Artur Czumaj

	2010
98		Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-sum k-Clustering and Their Applications. Theory Comput. Syst. 46(3): 416-442 (2010)
	2009
97		Anna Adamaszek, Artur Czumaj, Andrzej Lingas: PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ISAAC 2009: 994-1003
96		Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180
95		Anna Adamaszek, Artur Czumaj, Andrzej Lingas: PTAS for k-tour cover problem on the plane for moderately large values of k CoRR abs/0904.2576: (2009)
94		Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009)
93		Artur Czumaj, Andrzej Lingas: Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication. SIAM J. Comput. 39(2): 431-444 (2009)
92		Artur Czumaj, Christian Sohler: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM J. Comput. 39(3): 904-922 (2009)
	2008
91		Artur Czumaj: Euclidean Traveling Salesperson Problem. Encyclopedia of Algorithms 2008
90		Artur Czumaj, Andrzej Lingas: Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008
89		Artur Czumaj, Berthold Vöcking: Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008
88		Artur Czumaj, Christian Sohler: Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms 4(3): (2008)
	2007
87		Artur Czumaj, Gereon Frahling, Christian Sohler: Efficient Kinetic Data Structures for MaxCut. CCCG 2007: 157-160
86		Artur Czumaj, Christian Sohler: Testing Expansion in Bounded-Degree Graphs. FOCS 2007: 570-578
85		Artur Czumaj, Xin Wang: Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. ISAAC 2007: 220-231
84		Artur Czumaj, Xin Wang: Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. SAGA 2007: 70-81
83		Artur Czumaj, Christian Sohler: On testable properties in bounded degree graphs. SODA 2007: 494-501
82		Artur Czumaj, Andrzej Lingas: Finding a heaviest triangle is not harder than matrix multiplication. SODA 2007: 986-994
81		Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548
80		Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms 3(1): (2007)
79		Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083): (2007)
78		Artur Czumaj, Christian Sohler: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007)
77		Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theor. Comput. Sci. 380(1-2): 37-46 (2007)
	2006
76		Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: Sublinear Algorithms, 17.07. - 22.07.2005 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
75		René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for a service provider game with (Im)perfect information. ACM Transactions on Algorithms 2(4): 679-706 (2006)
74		Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas: Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC) 13(111): (2006)
73		Artur Czumaj, Andrzej Lingas: Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electronic Colloquium on Computational Complexity (ECCC) 13(115): (2006)
72		Artur Czumaj, Wojciech Rytter: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006)
71		Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006)
	2005
70		André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao: Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483
69		Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
68		Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: 05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005
67		Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson: Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. Inf. Process. Lett. 94(2): 49-53 (2005)
66		Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. 34(3): 580-615 (2005)
65		Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. 35(1): 91-109 (2005)
64		Artur Czumaj, Christian Sohler: Testing hypergraph colorability. Theor. Comput. Sci. 331(1): 37-52 (2005)
	2004
63		Artur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation: [extended abstract]. ACM Conference on Electronic Commerce 2004: 252-253
62		Artur Czumaj, Christian Sohler: Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407
61		Artur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation. PODC 2004: 98-106
60		Artur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505
59		René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755
58		Artur Czumaj, Christian Sohler: Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183
57		Artur Czumaj, Hairong Zhao: Fault-Tolerant Geometric Spanners. Discrete & Computational Geometry 32(2): 207-230 (2004)
	2003
56		Artur Czumaj, Wojciech Rytter: Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501
55		Artur Czumaj, Andrzej Lingas, Johan Nilsson: Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553
54		Artur Czumaj, Chris Riley, Christian Scheideler: Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251
53		Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822
52		Artur Czumaj, Hairong Zhao: Fault-tolerant geometric spanners. Symposium on Computational Geometry 2003: 1-10
51		Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito: On polynomial-time approximation algorithms for the variable length scheduling problem. Theor. Comput. Sci. 302(1-3): 489-495 (2003)
	2002
50		Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92
49		Artur Czumaj, Andrzej Lingas, Hairong Zhao: Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984
48		Artur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. SODA 2002: 413-420
47		Artur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish traffic allocation for server farms. STOC 2002: 287-296
	2001
46		Artur Czumaj, Christian Sohler: Property Testing with Geometric Queries. ESA 2001: 266-277
45		Artur Czumaj, Christian Sohler: Testing Hypergraph Coloring. ICALP 2001: 493-505
44		Artur Czumaj, Christian Sohler: Soft kinetic data structures. SODA 2001: 865-872
43		Artur Czumaj, Volker Stemann: Randomized allocation processes. Random Struct. Algorithms 18(4): 297-331 (2001)
42		Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito: Efficient web searching using temporal factors. Theor. Comput. Sci. 262(1): 569-582 (2001)
	2000
41		Artur Czumaj, Leszek Gasieniec: On the Complexity of Determining the Period of a String. CPM 2000: 412-422
40		Artur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166
39		Artur Czumaj, Andrzej Lingas: Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868
38		Artur Czumaj, Christian Scheideler: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39
37		Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya: Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108
36		Artur Czumaj, Christian Scheideler: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). STOC 2000: 38-47
35		Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced allocations: the heavily loaded case. STOC 2000: 745-754
34		Artur Czumaj, Christian Scheideler: Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms 17(3-4): 213-237 (2000)
33		Artur Czumaj, Miroslaw Kutylowski: Delayed path coupling and generating random permutations. Random Struct. Algorithms 17(3-4): 238-259 (2000)
32		Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann: Contention Resolution in Hashing Based Shared Memory Simulations. SIAM J. Comput. 29(5): 1703-1739 (2000)
31		Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. 245(2): 151-173 (2000)
30		Artur Czumaj: Recovery Time of Dynamic Allocation Processes. Theory Comput. Syst. 33(5/6): 465-487 (2000)
	1999
29		Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280
28		Artur Czumaj, Andrzej Lingas: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290
27		Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito: Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305
26		Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Fast Practical Multi-Pattern Matching. Inf. Process. Lett. 71(3-4): 107-113 (1999)
	1998
25		Artur Czumaj, Andrzej Lingas: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694
24		Artur Czumaj: Recovery Time of Dynamic Allocation Processes. SPAA 1998: 202-211
23		Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Fast Generation of Random Permutations Via Networks Simulation. Algorithmica 21(1): 2-20 (1998)
22		Artur Czumaj, Leszek Gasieniec, Andrzej Pelc: Time and Cost Trade-Offs in Gossiping. SIAM J. Discrete Math. 11(3): 400-413 (1998)
	1997
21		Artur Czumaj, Willy-Bernhard Strothmann: Bounded Degree Spanning Trees (Extended Abstract). ESA 1997: 104-117
20		Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn: Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279
19		Artur Czumaj, Volker Stemann: Randomized Allocation Processes. FOCS 1997: 194-203
18		Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann: Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Inf. Comput. 137(2): 103-120 (1997)
17		Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett. 62(2): 103-110 (1997)
16		Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter: Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997)
	1996
15		Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Fast Generation of Random Permutations via Networks Simulation. ESA 1996: 246-260
14		Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278
13		Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka: Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. 59(6): 289-294 (1996)
12		Artur Czumaj: Very Fast Approximation of the Matrix Chain Product Problem. J. Algorithms 21(1): 71-79 (1996)
11		Artur Czumaj, Alan Gibbons: Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. 154(1): 3-22 (1996)
10		Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Fast Generation of Random Permutations via Networks Simulation Universität Trier, Mathematik/Informatik, Forschungsbericht 96-26: (1996)
	1995
9		Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann: Shared Memory Simulations with Triple-Logarithmic Delay. ESA 1995: 46-59
8		Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann: Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. ISTCS 1995: 11-19
7		Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski: Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722
	1994
6		Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter: Parallel and Sequential Approximations of Shortest Superstrings. SWAT 1994: 95-106
5		Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. Algorithmica 12(4/5): 247-267 (1994)
	1993
4		Artur Czumaj, Alan Gibbons: Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP 1993: 88-101
3		Artur Czumaj: Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). STACS 1993: 294-305
	1992
2		Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600
1		Artur Czumaj: An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. SWAT 1992: 62-72

Coauthor Index

1	Anna Adamaszek	[95] [97]
2	Mihai Badoiu	[69]
3	René Beier	[59] [75]
4	Petra Berenbrink	[35] [37] [71]
5	André Berger	[70]
6	Dany Breslauer	[17]
7	Bogdan S. Chlebus	[14] [20] [31]
8	Maxime Crochemore	[2] [5] [26]
9	Jurek Czyzowicz	[96]
10	Krzysztof Diks	[13]
11	Devdatt P. Dubhashi	[17]
12	Funda Ergün	[53] [65]
13	Ian Finch	[27] [42]
14	Lance Fortnow	[53] [65]
15	Gereon Frahling	[87]
16	Tom Friedetzky	[37]
17	Zvi Galil	[7]
18	Leszek Gasieniec	[2] [5] [6] [7] [14] [16] [22] [26] [27] [31] [41] [42] [51] [96]
19	Daya Ram Gaur	[51]
20	Alan Gibbons	[4] [11] [27] [42]
21	Michelangelo Grigni	[60] [70]
22	Magnús M. Halldórsson	[67]
23	Friedhelm Meyer auf der Heide	[8] [9] [17] [18] [32]
24	Piotr Indyk	[69]
25	Jesper Jansson	[96]
26	Stefan Jarominek	[2] [5]
27	Przemyslawa Kanarek	[10] [15] [23] [29]
28	Miroslaw Kowaluk	[14] [31] [74] [77]
29	Ramesh Krishnamurti	[51]
30	Piotr Krysta	[47] [59] [75]
31	Miroslaw Kutylowski	[10] [15] [23] [29] [33]
32	Thierry Lecroq	[2] [5] [26]
33	Paul H. Leng	[27] [42]
34	Andrzej Lingas	[25] [28] [39] [49] [55] [67] [73] [74] [77] [82] [90] [93] [95] [96] [97]
35	Krzysztof Lorys	[10] [15] [23] [29]
36	Avner Magen	[53] [65]
37	S. Muthukrishnan (S. Muthu Muthukrishnan)	[68] [76]
38	Ilan Newman	[53] [65]
39	Johan Nilsson	[55] [67]
40	Kunsoo Park	[7]
41	Andrzej Pelc	[22]
42	Marek Piotrów	[6] [16]
43	Wojciech Plandowski	[2] [5] [7] [14] [26] [31]
44	Teresa M. Przytycka	[13]
45	Chris Riley	[54]
46	Amir Ronen	[61] [63]
47	Ronitt Rubinfeld	[53] [65] [68] [76]
48	Wojciech Rytter	[2] [5] [6] [16] [26] [27] [42] [51] [56] [72]
49	Christian Scheideler	[34] [36] [38] [54]
50	Asaf Shapira	[79] [94]
51	Jop F. Sibeyn	[20]
52	Papa Sissokho	[60]
53	Christian Sohler	[40] [44] [45] [46] [50] [53] [58] [62] [64] [65] [66] [68] [69] [76] [78] [79] [81] [83] [86] [87] [88] [92] [94] [98]
54	Angelika Steger	[35] [71]
55	Volker Stemann	[8] [9] [18] [19] [32] [43]
56	Willy-Bernhard Strothmann	[21]
57	Berthold Vöcking	[35] [47] [48] [59] [71] [75] [80] [89]
58	Nikita D. Vvedenskaya	[37]
59	Xin Wang	[84] [85]
60	Hairong Zhao	[49] [52] [57] [60] [70]
61	Martin Ziegler	[40]
62	Michele Zito	[27] [42] [51]
63	Pawel Zylinski	[96]

Colors in the list of coauthors