| 2025 | ESA | Testing Depth First Search Numbering. | Artur Czumaj, Christian Sohler, Stefan Walzer |
| 2025 | ICALP | Fully Scalable MPC Algorithms for Euclidean k-Center. | Artur Czumaj, Guichen Gao, Mohsen Ghaffari, Shaofeng H.-C. Jiang |
| 2024 | ICALP | Fully-Scalable MPC Algorithms for Clustering in High Dimension. | Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel |
| 2024 | PODC | Streaming Graph Algorithms in the Massively Parallel Computation Model. | Artur Czumaj, Gopinath Mishra, Anish Mukherjee |
| 2024 | SPAA | Log Diameter Rounds MST Verification and Sensitivity in MPC. | Sam Coy, Artur Czumaj, Gopinath Mishra, Anish Mukherjee |
| 2023 | ICALP | Optimal (Degree+1)-Coloring in Congested Clique. | Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
| 2023 | MFCS | Modern Parallel Algorithms (Invited Talk). | Artur Czumaj |
| 2023 | SPAA | On Parallel k-Center Clustering. | Sam Coy, Artur Czumaj, Gopinath Mishra |
| 2023 | SIROCCO | Routing Schemes for Hybrid Communication Networks. | Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann |
| 2022 | FOCS | Streaming Facility Location in High Dimension via Geometric Hashing. | Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel, Mingwei Yang |
| 2022 | ICALP | Streaming Algorithms for Geometric Steiner Forest. | Artur Czumaj, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Vesel |
| 2022 | STOC | Deterministic massively parallel connectivity. | Sam Coy, Artur Czumaj |
| 2021 | ICALP | Haystack Hunting Hints and Locker Room Communication. | Artur Czumaj, George Kontogeorgiou, Mike Paterson |
| 2021 | OPODIS | Near-Shortest Path Routing in Hybrid Communication Networks. | Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs |
| 2021 | PODC | Improved Deterministic (Δ+1) Coloring in Low-Space MPC. | Artur Czumaj, Peter Davies, Merav Parter |
| 2021 | PODC | Component Stability in Low-Space Massively Parallel Computation. | Artur Czumaj, Peter Davies, Merav Parter |
| 2020 | PODC | Simple, Deterministic, Constant-Round Coloring in the Congested Clique. | Artur Czumaj, Peter Davies, Merav Parter |
| 2020 | SODA | Sublinear time approximation of the cost of a metric | Artur Czumaj, Christian Sohler |
| 2020 | SPAA | Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. | Artur Czumaj, Peter Davies, Merav Parter |
| 2019 | FOCS | A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs). | Artur Czumaj, Christian Sohler |
| 2018 | ESA | Online Facility Location with Deletions. | Marek Cygan, Artur Czumaj, Marcin Mucha, Piotr Sankowski |
| 2018 | STOC | Round compression for parallel matching algorithms. | Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2018 | WAOA | Sublinear Graph Augmentation for Fast Query Implementation. | Artur Czumaj, Yishay Mansour, Shai Vardi |
| 2017 | PODC | Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks. | Artur Czumaj, Peter Davies |
| 2016 | ICALP | Faster Deterministic Communication in Radio Networks. | Artur Czumaj, Peter Davies |
| 2016 | PODC | Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks. | Artur Czumaj, Peter Davies |
| 2016 | STOC | Relating two property testing models for bounded degree directed graphs. | Artur Czumaj, Pan Peng, Christian Sohler |
| 2015 | IJCAI | Approximate Nash Equilibria with Near Optimal Social Welfare. | Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski |
| 2015 | OPODIS | Communicating with Beeps. | Artur Czumaj, Peter Davies |
| 2015 | STOC | Random Permutations using Switching Networks. | Artur Czumaj |
| 2015 | STOC | Testing Cluster Structure of Graphs. | Artur Czumaj, Pan Peng, Christian Sohler |
| 2014 | ICALP | Thorp Shuffling, Butterflies, and Non-Markovian Couplings. | Artur Czumaj, Berthold Vcking |
| 2014 | SAGT | Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games. | Artur Czumaj, Michail Fasoulakis, Marcin Jurdzinski |
| 2013 | SODA | (1+ Є)-approximation for facility location in data streams. | Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler |
| 2012 | SODA | An | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2012 | STOC | Optimal online buffer scheduling for block devices. | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2011 | FOCS | Planar Graphs: Random Walks and Bipartiteness Testing. | Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler |
| 2011 | ICALP | Approximation Schemes for Capacitated Geometric Network Design. | Anna Adamaszek, Artur Czumaj, Andrzej Lingas, Jakub Onufry Wojtaszczyk |
| 2011 | STOC | Almost tight bounds for reordering buffer management. | Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Rcke |
| 2010 | ESA | Local Graph Exploration and Fast Property Testing. | Artur Czumaj |
| 2010 | SODA | Testing Monotone Continuous Distributions on High-dimensional Real Cubes. | Michal Adamaszek, Artur Czumaj, Christian Sohler |
| 2009 | ISAAC | PTAS for | Anna Adamaszek, Artur Czumaj, Andrzej Lingas |
| 2009 | WADS | Approximation Algorithms for Buy-at-Bulk Geometric Network Design. | Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski |
| 2007 | FOCS | Testing Expansion in Bounded-Degree Graphs. | Artur Czumaj, Christian Sohler |
| 2007 | ISAAC | Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. | Artur Czumaj, Xin Wang |
| 2007 | SODA | Finding a heaviest triangle is not harder than matrix multiplication. | Artur Czumaj, Andrzej Lingas |
| 2007 | SODA | On testable properties in bounded degree graphs. | Artur Czumaj, Christian Sohler |
| 2007 | STACS | Small Space Representations for Metric Min-Sum | Artur Czumaj, Christian Sohler |
| 2005 | ESA | Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. | Andr Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao |
| 2005 | ICALP | Facility Location in Sublinear Time. | Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler |
| 2004 | ICALP | Sublinear-Time Approximation for Clustering Via Random Sampling. | Artur Czumaj, Christian Sohler |
| 2004 | PODC | On the expected payment of mechanisms for task allocation. | Artur Czumaj, Amir Ronen |
| 2004 | SODA | Computing equilibria for congestion games with (im)perfect information. | Ren Beier, Artur Czumaj, Piotr Krysta, Berthold Vcking |
| 2004 | SODA | Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. | Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho, Hairong Zhao |
| 2004 | STOC | Estimating the weight of metric minimum spanning trees in sublinear-time. | Artur Czumaj, Christian Sohler |
| 2003 | FOCS | Broadcasting Algorithms in Radio Networks with Unknown Topology. | Artur Czumaj, Wojciech Rytter |
| 2003 | ISAAC | Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. | Artur Czumaj, Andrzej Lingas, Johan Nilsson |
| 2003 | SODA | Sublinear-time approximation of Euclidean minimum spanning tree. | Artur Czumaj, Funda Ergn, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler |
| 2002 | FOCS | Abstract Combinatorial Programs and Efficient Property Testers. | Artur Czumaj, Christian Sohler |
| 2002 | ICALP | Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. | Artur Czumaj, Andrzej Lingas, Hairong Zhao |
| 2002 | SODA | Tight bounds for worst-case equilibria. | Artur Czumaj, Berthold Vcking |
| 2002 | STOC | Selfish traffic allocation for server farms. | Artur Czumaj, Piotr Krysta, Berthold Vcking |
| 2001 | ESA | Property Testing with Geometric Queries. | Artur Czumaj, Christian Sohler |
| 2001 | ICALP | Testing Hypergraph Coloring. | Artur Czumaj, Christian Sohler |
| 2001 | SODA | Soft kinetic data structures. | Artur Czumaj, Christian Sohler |
| 2000 | CPM | On the Complexity of Determining the Period of a String. | Artur Czumaj, Leszek Gasieniec |
| 2000 | ESA | Property Testing in Computational Geometry. | Artur Czumaj, Christian Sohler, Martin Ziegler |
| 2000 | ICALP | Fast Approximation Schemes for Euclidean Multi-connectivity Problems. | Artur Czumaj, Andrzej Lingas |
| 2000 | SODA | Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovsz local lemma. | Artur Czumaj, Christian Scheideler |
| 2000 | STOC | Balanced allocations: the heavily loaded case. | Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vcking |
| 2000 | STOC | A new algorithm approach to the general Lovsz local lemma with applications to scheduling and satisfiability problems (extended abstract). | Artur Czumaj, Christian Scheideler |
| 2000 | SPAA | Infinite parallel job allocation (extended abstract). | Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya |
| 1999 | SODA | Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. | Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys |
| 1999 | SODA | On Approximability of the Minimum-Cost | Artur Czumaj, Andrzej Lingas |
| 1999 | WADS | Efficient Web Searching Using Temporal Factors. | Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito |
| 1998 | ICALP | A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. | Artur Czumaj, Andrzej Lingas |
| 1998 | SPAA | Recovery Time of Dynamic Allocation Processes. | Artur Czumaj |
| 1997 | ESA | Bounded Degree Spanning Trees (Extended Abstract). | Artur Czumaj, Willy-Bernhard Strothmann |
| 1997 | EuroPar | Routing on the PADAM: Degrees of Optimality. | Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn |
| 1997 | FOCS | Randomized Allocation Processes. | Artur Czumaj, Volker Stemann |
| 1996 | ESA | Fast Generation of Random Permutations via Networks Simulation. | Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys |
| 1996 | MFCS | Parallel Alternating-Direction Access Machine. | Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski |
| 1995 | ESA | Shared Memory Simulations with Triple-Logarithmic Delay. | Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann |
| 1995 | STOC | Work-time-optimal parallel algorithms for string problems. | Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski |
| 1993 | ICALP | Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. | Artur Czumaj, Alan Gibbons |
| 1993 | STACS | Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). | Artur Czumaj |
| 1992 | STACS | Speeding Up Two String-Matching Algorithms. | Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter |