| Publication | Date of Publication | Type |
|---|
| Can We Break Symmetry with o(m) Communication? | 2024-03-26 | Paper |
| Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets | 2024-03-26 | Paper |
| Exact distributed sampling | 2024-01-11 | Paper |
| Symmetry breaking in the Congest model: time- and message-efficient algorithms for ruling sets | 2023-02-03 | Paper |
| The complexity of symmetry breaking in massive graphs | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091075 | 2022-07-21 | Paper |
| Near-optimal clustering in the \(k\)-machine model | 2021-12-22 | Paper |
| Distributed Approximation on Power Graphs | 2021-03-15 | Paper |
| Connectivity Lower Bounds in Broadcast Congested Clique | 2021-01-20 | Paper |
| A self-stabilizing algorithm for the maximum flow problem | 2020-12-02 | Paper |
| Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network | 2019-09-11 | Paper |
| Using Read-k Inequalities to Analyze a Distributed MIS Algorithm | 2018-07-18 | Paper |
| Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages | 2018-04-19 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| An experimental study of different approaches to solve the market equilibrium problem | 2017-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968077 | 2017-03-09 | Paper |
| Super-Fast 3-Ruling Sets. | 2017-01-26 | Paper |
| On the Analysis of a Label Propagation Algorithm for Community Detection | 2016-12-19 | Paper |
| Error-detecting codes and fault-containing self-stabilization | 2016-06-16 | Paper |
| Toward Optimal Bounds in the Congested Clique | 2016-03-23 | Paper |
| Lessons from the congested clique applied to MapReduce | 2015-12-11 | Paper |
| Sub-logarithmic distributed algorithms for metric facility location | 2015-10-20 | Paper |
| Fault-containing self-stabilizing algorithms | 2015-09-11 | Paper |
| Distributed graph coloring in a few rounds | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501309 | 2015-08-03 | Paper |
| Local approximation schemes for topology control | 2015-03-10 | Paper |
| Rapid randomized pruning for fast greedy distributed algorithms | 2015-03-02 | Paper |
| Near-constant-time distributed algorithms on a congested clique | 2015-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921655 | 2014-10-13 | Paper |
| Max-coloring and online coloring with bandwidths on interval graphs | 2014-09-09 | Paper |
| Lessons from the Congested Clique Applied to MapReduce | 2014-08-07 | Paper |
| Return of the primal-dual | 2014-07-23 | Paper |
| Building self-stabilizing overlay networks with the transitive closure framework | 2014-01-13 | Paper |
| Fault-containing self-stabilizing distributed protocols | 2013-06-20 | Paper |
| Super-Fast Distributed Algorithms for Metric Facility Location | 2012-11-01 | Paper |
| SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS | 2010-12-15 | Paper |
| Sub-coloring and Hypo-coloring Interval Graphs | 2010-01-21 | Paper |
| APX-hardness of domination problems in circle graphs | 2009-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3642544 | 2009-11-05 | Paper |
| Approximation Algorithms for Domatic Partitions of Unit Disk Graphs | 2009-10-28 | Paper |
| Good Quality Virtual Realization of Unit Ball Graphs | 2008-09-25 | Paper |
| The Randomized Coloring Procedure with Symmetry-Breaking | 2008-08-28 | Paper |
| Approximating interval coloring and max-coloring in chordal graphs | 2008-06-20 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| On Equitable Coloring of d-Degenerate Graphs | 2005-09-16 | Paper |
| Processor-efficient sparse matrix-vector multiplication | 2005-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3159164 | 2005-02-15 | Paper |
| Computing optimal diameter-bounded polygon partitions | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471329 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768401 | 2003-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780802 | 2002-11-21 | Paper |
| A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768316 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511218 | 2001-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511217 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952684 | 2000-05-10 | Paper |
| Self-Stabilizing Algorithms for Finding Centers and Medians of Trees | 2000-03-19 | Paper |
| Stack and Queue Layouts of Directed Acyclic Graphs: Part I | 1999-10-28 | Paper |
| Stack and Queue Layouts of Directed Acyclic Graphs: Part II | 1999-10-28 | Paper |
| Stack and Queue Layouts of Posets | 1998-02-09 | Paper |
| Using graph coloring in an algebraic compiler | 1996-09-25 | Paper |
| New results for the minimum weight triangulation problem | 1995-01-19 | Paper |
| Analysis of the worst case space complexity of a PR quadtree | 1994-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138282 | 1994-01-02 | Paper |
