Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2012) An O(log k)-competitive algorithm for generalized caching. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1681-1689.

Adamaszek, Anna, Czumaj, Artur, Englert, Matthias and Räcke, Harald (2011) Almost tight bounds for reordering buffer management. In: STOC'11 Symposium on Theory of Computing Conference (Co-located with FCRC 2011), San Jose, CA, USA, 6-8 Jun 2011. Published in: STOC '11 Proceedings of the 43rd annual ACM symposium on Theory of computing pp. 607-616.

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, Vol.21 (No.6). pp. 893-904. ISSN 0129-0541

Czumaj, Artur and Sohler, Christian (2010) Testing expansion in bounded-degree graphs. In: Meeting on Combinatorics and Probability, Mathemat Res Inst, Oberwolfach, Germany, April 26-May 02, 2009. Published in: Combinatorics, Probability and Computing, Vol.19 (No.Special Issue 5-6). pp. 693-709.

Czumaj, Artur and Sohler, Christian. (2010) Small space representations for metric min-sum k-clustering and their applications. Theory of Computing Systems, Vol.46 (No.3). pp. 416-442. ISSN 1432-4350

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. ISSN 0097-5397

Czumaj, Artur, Adamaszek, Michał and Sohler, Christian (2010) Testing Monotone Continuous Distributions on High-dimensional Real Cubes. In: 21st ACM-SIAM Symposium on Discrete Algorithms (SODA'10), Austin, Texas. Published in: SIAM pp. 56-65.

Czumaj, Artur and Sohler, Christian (2010) Sublinear-time algorithms. In: Workshop on Property Testing, Tsinghua University, Peoples Republic of China. Published in: Property Testing : Current Research and Surveys, Vol.6390 pp. 41-64.

Adamaszek, Michał, Czumaj, Artur and Sohler, Christian (2010) Testing monotone continuous distributions on high-dimensional real cubes. In: Workshop on Property Testing, Tsinghua University, Peoples Republic of China. Published in: Property Testing : Current Research and Surveys, Vol.6390 pp. 228-233.

Czumaj, Artur (2010) Local graph exploration and fast property testing. In: 16th Annual European Symposium on Algorithms (ESA 2010), Liverpool, England, 6-8 Sep 2010. Published in: Lecture Notes in Computer Science, Vol.6346 pp. 410-414.

Adamaszek, Michał, Czumaj, Artur and Sohler, Christian (2010) Testing monotone continuous distributions on high-dimensional real cubes. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms. Philadelphia: SIAM, pp. 56-65. ISBN 9780898717013

Czumaj, Artur and Sohler, Christian. (2009) Estimating the weight of metric minimum spanning trees in sublinear time. SIAM Journal on Computing, Vol.39 (No.3). pp. 904-922. 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, Vol.39 (No.2). pp. 431-444. ISSN 0097-5397

Czumaj, Artur, Shapira, Asaf and Sohler, Christian. (2009) Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, Vol.38 (No.6). pp. 2499-2510. ISSN 00975397

Czumaj, Artur, Czyzowicz, Jurek, Gasieniec, Leszek, Jansson, Jesper, Lingas, Andrzej and Zylinski, Pawel (2009) Approximation algorithms for buy-at-bulk geometric network design. In: 11th International Workshop on Algorithms and Data Structures (WADS 2009), Banff, Canada, August 21-23, 2009. Published in: Lecture Notes in Computer Science, Vol.5664 pp. 168-180.

Czumaj, Artur, Czyzowicz, J., Gąsieniec, L., Jansson, J., Lingas, A. and Zylinski, P. (2009) Approximation algorithms for buy-at-bulk geometric network design. In: Algorithms and data structures. Lecture Notes in Computer Science (5664). Springer Verlag, pp. 168-180. ISBN 9783642033667

Czumaj, Artur and Sohler, C.. (2009) Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM Journal on Computing (SICOMP), 39 (3). pp. 904-922. ISSN 0097-5397

Czumaj, Artur and Lingas, A.. (2009) Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM Journal on Computing (SICOMP), 39 (2). pp. 431-444. 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.

Czumaj, Artur and Sohler, Christian (2009) Small space representations for metric min-sum k-clustering and their applications. In: Theory of Computing Systems. Springer Science+Business Media, LLC 2009, pp. 416-442.

Czumaj, Artur, Shapira, A. and Sohler, C.. (2009) Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM Journal on Computing (SICOMP), 38 (6). pp. 2499-2510. ISSN 0097-5397

Czumaj, Artur and Sohler, Christian. (2008) Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms , Vol.4 (No.3). p. 31. ISSN 1549-6325

Czumaj, Artur (2008) Euclidean traveling salesperson problem. In: Encyclopedia of algorithms. Springer Verlag, pp. 1-99. ISBN 978-0-387-30162-4

Czumaj, Artur and Lingas, Andrzej (2008) Minimum k-connected geometric networks. In: Encyclopedia of algorithms. Springer Verlag. ISBN 9780387301624

Czumaj, Artur and Vöcking, Berthold (2008) Price of anarchy for machines models. In: Encyclopedia of algorithms. Springer Verlag, pp. 1-99. ISBN 9780387301624

Czumaj, Artur, Kowaluk, Miroslaw and Lingas, Andrzej. (2007) Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theoretical Computer Science, Vol.380 (No.1-2). pp. 37-46. ISSN 0304-3975

Czumaj, Artur and Sohler, Christian (2007) Sublinear-time approximation algorithms for clustering via random sampling. In: 12th International Conference on Random Structures and Algorithms, Poznan, POLAND, AUG 01-05, 2005. Published in: RANDOM STRUCTURES & ALGORITHMS, 30 (1-2 Sp. Iss. SI). pp. 226-256.

Czumaj, Artur and Wang, Xin (2007) Communication problems in random line-of-sight ad-hoc radio networks. In: 4th International Symposium on Stochastic Algorithms - Foundations and Applications, Zurich, SWITZERLAND, SEP 13-14, 2007. Published in: Stochastic Algorithms: Foundations and Applications, Proceedings, 4665 pp. 70-81.

Czumaj, Artur and Wang, Xin (2007) Fast message dissemination in random geometric ad-hoc radio networks. In: 18th International Symposium on Algorithms and Computations (ISAAC 2007), Sendai, JAPAN, DEC 17-19, 2007. Published in: ALGORITHMS AND COMPUTATION, 4835 pp. 220-231.

Czumaj, Artur and Lingas, Andrzej (2007) Finding a Heaviest Triangle is not Harder than Matrix Multiplication. In: 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, JAN 07-09, 2007. Published in: PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS pp. 986-994.

Czumaj, Artur and Sohler, Christian (2007) On Testable Properties in Bounded Degree Graphs. In: 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, JAN 07-09, 2007. Published in: PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS pp. 494-501.

Czumaj, Artur and Sohler, Christian (2007) Small space representations for metric min-sum k-clustering and their applications. In: 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, GERMANY, FEB 22-24, 2007. Published in: Stacs 2007, Proceedings, 4393 pp. 536-548.

Czumaj, Artur and Sohler, Christian (2007) Testing expansion in bounded-degree graphs. In: 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, OCT 20-23, 2007. Published in: 48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS pp. 570-578.