dblp.uni-trier.dewww.uni-trier.de

Artur Czumaj Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
94EEArtur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski: Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180
93EEAnna 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)
92EEArtur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009)
2008
91EEArtur Czumaj: Euclidean Traveling Salesperson Problem. Encyclopedia of Algorithms 2008
90EEArtur Czumaj, Andrzej Lingas: Minimum k-Connected Geometric Networks. Encyclopedia of Algorithms 2008
89EEArtur Czumaj, Berthold Vöcking: Price of Anarchy for Machines Models. Encyclopedia of Algorithms 2008
88EEArtur 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
86EEArtur Czumaj, Christian Sohler: Testing Expansion in Bounded-Degree Graphs. FOCS 2007: 570-578
85EEArtur Czumaj, Xin Wang: Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. ISAAC 2007: 220-231
84EEArtur Czumaj, Xin Wang: Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. SAGA 2007: 70-81
83EEArtur Czumaj, Christian Sohler: On testable properties in bounded degree graphs. SODA 2007: 494-501
82EEArtur Czumaj, Andrzej Lingas: Finding a heaviest triangle is not harder than matrix multiplication. SODA 2007: 986-994
81EEArtur Czumaj, Christian Sohler: Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548
80EEArtur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms 3(1): (2007)
79EEArtur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083): (2007)
78EEArtur Czumaj, Christian Sohler: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007)
77EEArtur 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
75EERené 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)
74EEArtur 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)
73EEArtur Czumaj, Andrzej Lingas: Finding a Heaviest Triangle is not Harder than Matrix Multiplication. Electronic Colloquium on Computational Complexity (ECCC) 13(115): (2006)
72EEArtur Czumaj, Wojciech Rytter: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2): 115-143 (2006)
71EEPetra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006)
2005
70EEAndré Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao: Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. ESA 2005: 472-483
69EEMihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
68EEArtur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: 05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005
67EEArtur 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)
66EEArtur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. 34(3): 580-615 (2005)
65EEArtur 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)
64EEArtur Czumaj, Christian Sohler: Testing hypergraph colorability. Theor. Comput. Sci. 331(1): 37-52 (2005)
2004
63EEArtur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation: [extended abstract]. ACM Conference on Electronic Commerce 2004: 252-253
62EEArtur Czumaj, Christian Sohler: Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407
61EEArtur Czumaj, Amir Ronen: On the expected payment of mechanisms for task allocation. PODC 2004: 98-106
60EEArtur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004: 496-505
59EERené Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking: Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755
58EEArtur Czumaj, Christian Sohler: Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183
57EEArtur Czumaj, Hairong Zhao: Fault-Tolerant Geometric Spanners. Discrete & Computational Geometry 32(2): 207-230 (2004)
2003
56EEArtur Czumaj, Wojciech Rytter: Broadcasting Algorithms in Radio Networks with Unknown Topology. FOCS 2003: 492-501
55EEArtur Czumaj, Andrzej Lingas, Johan Nilsson: Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. ISAAC 2003: 544-553
54EEArtur Czumaj, Chris Riley, Christian Scheideler: Perfectly Balanced Allocation. RANDOM-APPROX 2003: 240-251
53EEArtur 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
52EEArtur Czumaj, Hairong Zhao: Fault-tolerant geometric spanners. Symposium on Computational Geometry 2003: 1-10
51EEArtur 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
50EEArtur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92
49EEArtur Czumaj, Andrzej Lingas, Hairong Zhao: Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ICALP 2002: 973-984
48EEArtur Czumaj, Berthold Vöcking: Tight bounds for worst-case equilibria. SODA 2002: 413-420
47EEArtur Czumaj, Piotr Krysta, Berthold Vöcking: Selfish traffic allocation for server farms. STOC 2002: 287-296
2001
46EEArtur Czumaj, Christian Sohler: Property Testing with Geometric Queries. ESA 2001: 266-277
45EEArtur Czumaj, Christian Sohler: Testing Hypergraph Coloring. ICALP 2001: 493-505
44EEArtur 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)
42EEArtur 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
41EEArtur Czumaj, Leszek Gasieniec: On the Complexity of Determining the Period of a String. CPM 2000: 412-422
40EEArtur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166
39EEArtur Czumaj, Andrzej Lingas: Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ICALP 2000: 856-868
38EEArtur Czumaj, Christian Scheideler: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. SODA 2000: 30-39
37EEPetra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya: Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108
36EEArtur 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
35EEPetra 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)
31EEBogdan 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)
30EEArtur Czumaj: Recovery Time of Dynamic Allocation Processes. Theory Comput. Syst. 33(5/6): 465-487 (2000)
1999
29EEArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280
28EEArtur Czumaj, Andrzej Lingas: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290
27EEArtur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito: Efficient Web Searching Using Temporal Factors. WADS 1999: 294-305
26EEMaxime 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
25EEArtur Czumaj, Andrzej Lingas: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. ICALP 1998: 682-694
24EEArtur 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)
22EEArtur Czumaj, Leszek Gasieniec, Andrzej Pelc: Time and Cost Trade-Offs in Gossiping. SIAM J. Discrete Math. 11(3): 400-413 (1998)
1997
21EEArtur Czumaj, Willy-Bernhard Strothmann: Bounded Degree Spanning Trees (Extended Abstract). ESA 1997: 104-117
20EEBogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn: Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279
19EEArtur 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)
17EEDany 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
15EEArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys: Fast Generation of Random Permutations via Networks Simulation. ESA 1996: 246-260
14EEBogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278
13EEArtur 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)
11EEArtur 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
9EEArtur 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
7EEArtur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski: Work-time-optimal parallel algorithms for string problems. STOC 1995: 713-722
1994
6EEArtur 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
4EEArtur Czumaj, Alan Gibbons: Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP 1993: 88-101
3EEArtur Czumaj: Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). STACS 1993: 294-305
1992
2EEMaxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter: Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600
1EEArtur Czumaj: An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. SWAT 1992: 62-72

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)