The Library
Browse by Warwick Author
 | Up a level |
Jump to: DFG grant So 514/1-2 | Deutsche Forschungsgemeinschaft (DFG) | EPSRC grant EP/D063191/1 | Engineering and Physical Sciences Research Council (EPSRC) | European Research Council (ERC) | Israel Science Foundation (ISF) | Komitet BadanΜ Naukowych (Poland) (KBN) | NSF ITR grant CCR-0313219 and DIMAP | National Science Foundation (U.S.) (NSF) | Royal Society (Great Britain) | Sixth Framework Programme (European Commission) (FP6) | Sweden. VetenskapsrΓ₯det [Research Council] | University of Warwick | University of Warwick. Centre for Discrete Mathematics and Its Applications
Number of items: 32.
DFG grant So 514/1-2
Czumaj, Artur and Sohler, Christian (2009) Small space representations for metric min-sum k-clustering and their applications. Theory of Computing Systems, Volume 46 (Number 3). pp. 416-442. doi:10.1007/s00224-009-9235-1 ISSN 1433-0490.
Deutsche Forschungsgemeinschaft (DFG)
Czumaj, Artur, Krysta, Piotr and VΓΆcking, Berthold (2010) Selfish traffic allocation for server farms. SIAM Journal on Computing, Vol.39 (No.5). pp. 1957-1987. doi:10.1137/070693862 ISSN 0097-5397.
Czumaj, Artur, Shapira, Asaf and Sohler, Christian (2009) Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, Volume 38 (Number 6). pp. 2499-2510. doi:10.1137/070681831 ISSN 0097-5397.
Czumaj, Artur and Sohler, Christian (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms, Volume 4 (Number 3). p. 31. Article Number 31. doi:10.1145/1367064.1367071 ISSN 1549-6325.
EPSRC grant EP/D063191/1
Czumaj, Artur and Sohler, Christian (2009) Small space representations for metric min-sum k-clustering and their applications. Theory of Computing Systems, Volume 46 (Number 3). pp. 416-442. doi:10.1007/s00224-009-9235-1 ISSN 1433-0490.
Engineering and Physical Sciences Research Council (EPSRC)
Czumaj, Artur, Deligkas, Argyrios, Fasoulakis, Michail, Fearnley, John, Jurdzinski, Marcin and Savani, Rahul (2016) Distributed methods for computing approximate equilibria. In: International Conference on Web and Internet Economics, WINE 2016, MontrΓ©al, Canada, 11-14 Dec 2016. Published in: Web and Internet Economics. WINE 2016, 10123 pp. 15-28. ISBN 9783662541098. doi:10.1007/978-3-662-54110-4_2 ISSN 0302-9743.
Czumaj, Artur, Peng, Pan and Sohler, Christian (2016) Relating two property testing models for bounded degree directed graphs. In: 48th Annual ACM Symposium on Theory of Computing (STOC 2016), Cambridge, MA, 19-21 Jun 2016. Published in: STOC 2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing pp. 1033-1045. ISBN 9781450341325. doi:10.1145/2897518.2897575
Czumaj, Artur, Peng, Pan and Sohler, Christian (2015) Testing cluster structure of graphs. In: Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, Oregon, 15-17 Jun 2015. Published in: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 723-732. ISBN 9781450335362. doi:10.1145/2746539.2746618
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2010) PTAS for k-tour cover problem on the plane for moderately large values of k. International Journal of Foundations of Computer Science, Volume 21 (Number 6). pp. 893-904. doi:10.1142/S0129054110007623 ISSN 0129-0541.
Czumaj, Artur, Krysta, Piotr and VΓΆcking, Berthold (2010) Selfish traffic allocation for server farms. SIAM Journal on Computing, Vol.39 (No.5). pp. 1957-1987. doi:10.1137/070693862 ISSN 0097-5397.
Czumaj, Artur and Lingas, Andrzej (2009) Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication. SIAM Journal on Computing, Volume 39 (Number 2). pp. 431-444. doi:10.1137/070695149 ISSN 0097-5397.
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2009) PTAS for k-tour cover problem on the plane for moderately large values of k. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, December 16-18, 2009. Published in: Lecture Notes in Computer Science, 5878 pp. 994-1003. ISBN 978-3-642-10630-9. doi:10.1007/978-3-642-10631-6_100 ISSN 0302-9743.
Czumaj, Artur, Shapira, Asaf and Sohler, Christian (2009) Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, Volume 38 (Number 6). pp. 2499-2510. doi:10.1137/070681831 ISSN 0097-5397.
Czumaj, Artur and Sohler, Christian (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms, Volume 4 (Number 3). p. 31. Article Number 31. doi:10.1145/1367064.1367071 ISSN 1549-6325.
European Research Council (ERC)
Czumaj, Artur, Peng, Pan and Sohler, Christian (2016) Relating two property testing models for bounded degree directed graphs. In: 48th Annual ACM Symposium on Theory of Computing (STOC 2016), Cambridge, MA, 19-21 Jun 2016. Published in: STOC 2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing pp. 1033-1045. ISBN 9781450341325. doi:10.1145/2897518.2897575
Israel Science Foundation (ISF)
Czumaj, Artur, Deligkas, Argyrios, Fasoulakis, Michail, Fearnley, John, Jurdzinski, Marcin and Savani, Rahul (2016) Distributed methods for computing approximate equilibria. In: International Conference on Web and Internet Economics, WINE 2016, MontrΓ©al, Canada, 11-14 Dec 2016. Published in: Web and Internet Economics. WINE 2016, 10123 pp. 15-28. ISBN 9783662541098. doi:10.1007/978-3-662-54110-4_2 ISSN 0302-9743.
Komitet BadanΜ Naukowych (Poland) (KBN)
Czumaj, Artur (1992) Parallel algorithm for the matrix chain product problem. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
NSF ITR grant CCR-0313219 and DIMAP
Czumaj, Artur and Sohler, Christian (2009) Small space representations for metric min-sum k-clustering and their applications. Theory of Computing Systems, Volume 46 (Number 3). pp. 416-442. doi:10.1007/s00224-009-9235-1 ISSN 1433-0490.
National Science Foundation (U.S.) (NSF)
Czumaj, Artur, Krysta, Piotr and VΓΆcking, Berthold (2010) Selfish traffic allocation for server farms. SIAM Journal on Computing, Vol.39 (No.5). pp. 1957-1987. doi:10.1137/070693862 ISSN 0097-5397.
Czumaj, Artur and Lingas, Andrzej (2009) Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication. SIAM Journal on Computing, Volume 39 (Number 2). pp. 431-444. doi:10.1137/070695149 ISSN 0097-5397.
Czumaj, Artur, Shapira, Asaf and Sohler, Christian (2009) Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, Volume 38 (Number 6). pp. 2499-2510. doi:10.1137/070681831 ISSN 0097-5397.
Czumaj, Artur and Sohler, Christian (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms, Volume 4 (Number 3). p. 31. Article Number 31. doi:10.1145/1367064.1367071 ISSN 1549-6325.
Royal Society (Great Britain)
Cygan, Marek, Czumaj, Artur, Mucha, Marcin and Sankowski, Piotr (2018) Online facility location with deletions. In: 26th Annual European Symposium on Algorithms (ESA 2018), Helsinki, Finland, 20-24 Aug 2018. Published in: {26th Annual European Symposium on Algorithms (ESA 2018), 112 21:1-21:15. ISBN 9783959770811. doi:10.4230/LIPIcs.ESA.2018.21 ISSN 1868-8969.
Sixth Framework Programme (European Commission) (FP6)
Czumaj, Artur, Krysta, Piotr and VΓΆcking, Berthold (2010) Selfish traffic allocation for server farms. SIAM Journal on Computing, Vol.39 (No.5). pp. 1957-1987. doi:10.1137/070693862 ISSN 0097-5397.
Sweden. VetenskapsrΓ₯det [Research Council]
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2010) PTAS for k-tour cover problem on the plane for moderately large values of k. International Journal of Foundations of Computer Science, Volume 21 (Number 6). pp. 893-904. doi:10.1142/S0129054110007623 ISSN 0129-0541.
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2009) PTAS for k-tour cover problem on the plane for moderately large values of k. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, December 16-18, 2009. Published in: Lecture Notes in Computer Science, 5878 pp. 994-1003. ISBN 978-3-642-10630-9. doi:10.1007/978-3-642-10631-6_100 ISSN 0302-9743.
University of Warwick
Czumaj, Artur and Lingas, Andrzej (2009) Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication. SIAM Journal on Computing, Volume 39 (Number 2). pp. 431-444. doi:10.1137/070695149 ISSN 0097-5397.
Czumaj, Artur and Sohler, Christian (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms, Volume 4 (Number 3). p. 31. Article Number 31. doi:10.1145/1367064.1367071 ISSN 1549-6325.
University of Warwick. Centre for Discrete Mathematics and Its Applications
Czumaj, Artur, Peng, Pan and Sohler, Christian (2016) Relating two property testing models for bounded degree directed graphs. In: 48th Annual ACM Symposium on Theory of Computing (STOC 2016), Cambridge, MA, 19-21 Jun 2016. Published in: STOC 2016 Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing pp. 1033-1045. ISBN 9781450341325. doi:10.1145/2897518.2897575
Czumaj, Artur, Peng, Pan and Sohler, Christian (2015) Testing cluster structure of graphs. In: Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, Oregon, 15-17 Jun 2015. Published in: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing pp. 723-732. ISBN 9781450335362. doi:10.1145/2746539.2746618
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2010) PTAS for k-tour cover problem on the plane for moderately large values of k. International Journal of Foundations of Computer Science, Volume 21 (Number 6). pp. 893-904. doi:10.1142/S0129054110007623 ISSN 0129-0541.
Adamaszek, Anna, Czumaj, Artur and Lingas, Andrzej (2009) PTAS for k-tour cover problem on the plane for moderately large values of k. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), Honolulu, HI, December 16-18, 2009. Published in: Lecture Notes in Computer Science, 5878 pp. 994-1003. ISBN 978-3-642-10630-9. doi:10.1007/978-3-642-10631-6_100 ISSN 0302-9743.
This list was generated on Fri Mar 31 16:18:22 2023 BST.
