| Publication | Date of Publication | Type |
|---|
| On the hardness of allocating frequencies for hybrid networks | 2024-06-05 | Paper |
| Near-optimal distributed edge coloring | 2023-05-08 | Paper |
| Communities, Random Walks, and Social Sybil Defense | 2021-04-23 | Paper |
| Some simple distributed algorithms for sparse networks | 2020-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5137352 | 2020-12-02 | Paper |
| Tracks from hell -- when finding a proof may be easier than checking it | 2020-09-03 | Paper |
| Tracks from hell - When finding a proof may be easier than checking it | 2020-08-11 | Paper |
| How to Schedule a Cascade in an Arbitrary Graph | 2020-05-31 | Paper |
| On the Distortion of Locality Sensitive Hashing | 2019-05-07 | Paper |
| Rumor Spreading and Conductance | 2018-12-06 | Paper |
| Trainyard is NP-hard | 2018-11-23 | Paper |
| Distributed weighted vertex cover via maximal matchings | 2018-11-05 | Paper |
| The Distortion of Locality Sensitive Hashing | 2018-05-03 | Paper |
| Fast randomized algorithms for distributed edge coloring | 2017-08-21 | Paper |
| Trainyard is NP-hard | 2017-07-17 | Paper |
| Approximate Max \(k\)-Cut with subgraph guarantee | 2016-06-09 | Paper |
| A faster distributed algorithm for computing maximal matchings deterministically | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501805 | 2015-08-14 | Paper |
| Primal-dual based distributed algorithms for vertex cover with semi-hard capacities | 2015-03-10 | Paper |
| Expansion properties of (secure) wireless networks | 2014-09-09 | Paper |
| Almost tight bounds for rumour spreading with conductance | 2014-08-13 | Paper |
| Models for the Compressible Web | 2014-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417739 | 2014-05-22 | Paper |
| Models for the Compressible Web | 2014-02-04 | Paper |
| Rumor Spreading in Random Evolving Graphs | 2013-09-17 | Paper |
| Fast primal-dual distributed algorithms for scheduling and matching problems | 2013-06-28 | Paper |
| On the importance of having an identity or, is consensus really universal? | 2013-06-07 | Paper |
| Concentration of measure for the analysis of randomized algorithms. | 2012-06-26 | Paper |
| Rumor spreading in social networks | 2011-06-07 | Paper |
| Low degree connectivity of ad-hoc networks via percolation | 2010-07-13 | Paper |
| On Active Attacks on Sensor Network Key Distribution Schemes | 2010-01-05 | Paper |
| Concentration of Measure for the Analysis of Randomized Algorithms | 2009-09-01 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Rumor Spreading in Social Networks | 2009-07-14 | Paper |
| A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover | 2009-06-22 | Paper |
| Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation | 2008-09-25 | Paper |
| Cuts and Disjoint Paths in the Valley-Free Path Model | 2008-04-29 | Paper |
| Localized techniques for broadcasting in wireless sensor networks | 2008-02-18 | Paper |
| Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) | 2007-11-15 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons | 2005-12-07 | Paper |
| An experimental study of a simple, distributed edge-coloring algorithm | 2005-08-04 | Paper |
| An experimental analysis of simple, distributed vertex coloring algorithms | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828989 | 2004-11-29 | Paper |
| Packing cuts in undirected graphs | 2004-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471362 | 2004-07-28 | Paper |
| Packing cycles in undirected graphs | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796199 | 2003-03-02 | Paper |
| On the distributed complexity of computing maximal matchings | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766868 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753728 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525687 | 2001-01-24 | Paper |
| Fast Distributed Algorithms for Brooks–Vizing Colorings | 2000-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250215 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259987 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250185 | 1999-06-17 | Paper |
| Near-optimal, distributed edge colouring via the nibble method | 1999-01-12 | Paper |
| On the hardness of allocating frequencies for hybrid networks | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398359 | 1998-07-19 | Paper |
| Nearly optimal distributed edge coloring in O(log log n) rounds | 1997-07-15 | Paper |
| Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds | 1997-05-26 | Paper |
| Approximability of maximum splitting of k-sets and some other Apx-complete problems | 1997-02-27 | Paper |
| On the Complexity of Distributed Network Decomposition | 1996-05-06 | Paper |
| The local nature of \(\Delta\)-coloring and its algorithmic applications | 1996-04-16 | Paper |
| Quantifiers and approximation | 1993-05-16 | Paper |
| Completeness in approximation classes | 1991-01-01 | Paper |
| Predicting deadlock in store‐and‐forward networks | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817607 | 1988-01-01 | Paper |
| Inclusion relationships among permutation problems | 1987-01-01 | Paper |
