| Publication | Date of Publication | Type |
|---|
| New bounds for single-machine time-dependent scheduling with uniform deterioration | 2024-06-26 | Paper |
| Distributed Averaging in Opinion Dynamics | 2024-03-26 | Paper |
| Brief Announcement: Discrete Incremental Voting | 2024-03-26 | Paper |
| Perpetual maintenance of machines with different urgency requirements | 2023-10-24 | Paper |
| A simple model of influence | 2023-10-04 | Paper |
| Fast plurality consensus in regular expanders | 2023-02-03 | Paper |
| Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020 | 2022-10-06 | Paper |
| A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005184 | 2021-08-04 | Paper |
| Time-space trade-offs in population protocols for the majority problem | 2021-05-17 | Paper |
| A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence | 2021-04-23 | Paper |
| Fast Low-Cost Estimation of Network Properties Using Random Walks | 2021-03-26 | Paper |
| On Counting the Population Size | 2021-01-20 | Paper |
| Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements | 2020-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207878 | 2020-01-13 | Paper |
| Dispersion processes | 2019-02-20 | Paper |
| Fast consensus for voting on general expander graphs | 2018-08-24 | Paper |
| Brief Announcement | 2017-10-11 | Paper |
| Robustness of the rotor-router mechanism | 2017-10-09 | Paper |
| The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process | 2017-09-29 | Paper |
| Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) | 2017-04-04 | Paper |
| Coalescing Walks on Rotor-Router Systems | 2016-01-08 | Paper |
| Fast Low-Cost Estimation of Network Properties Using Random Walks | 2015-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934641 | 2014-12-18 | Paper |
| Coalescing random walks and voting on graphs | 2014-12-05 | Paper |
| Tree exploration with logarithmic memory | 2014-09-09 | Paper |
| The Power of Two Choices in Distributed Voting | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417719 | 2014-05-22 | Paper |
| Coalescing Random Walks and Voting on Connected Graphs | 2014-04-10 | Paper |
| Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks | 2014-01-17 | Paper |
| The cover times of random walks on random uniform hypergraphs | 2014-01-13 | Paper |
| Testing connectivity of faulty networks in sublinear time | 2012-09-13 | Paper |
| A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence | 2012-07-23 | Paper |
| Efficient Connectivity Testing of Hypercubic Networks with Faults | 2011-05-19 | Paper |
| The Cover Time of Cartesian Product Graphs | 2011-05-19 | Paper |
| Multiple Random Walks in Random Regular Graphs | 2010-12-03 | Paper |
| Locating and repairing faults in a network with mobile agents | 2010-04-06 | Paper |
| Time-Efficient Broadcast in Radio Networks | 2010-02-09 | Paper |
| Multiple Random Walks and Interacting Particle Systems | 2009-07-14 | Paper |
| Many-to-many communication in radio networks | 2009-06-16 | Paper |
| Memory Efficient Anonymous Graph Exploration | 2009-01-20 | Paper |
| Approximation bounds for Black Hole Search problems | 2008-12-17 | Paper |
| A randomized algorithm for the joining protocol in dynamic distributed networks | 2008-11-12 | Paper |
| Locating and Repairing Faults in a Network with Mobile Agents | 2008-07-10 | Paper |
| Computing all efficient solutions of the biobjective minimum spanning tree problem | 2007-10-10 | Paper |
| Hardness and approximation results for black hole search in arbitrary networks | 2007-10-02 | Paper |
| Deterministic communication in radio networks with large labels | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416574 | 2007-01-22 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Power balance and apportionment algorithms for the United States Congress | 2005-08-04 | Paper |
| Improving time bounds on maximum generalised flow computations by contracting the network | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737193 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228440 | 2002-01-17 | Paper |
| Faster algorithms for the generalized network flow problem | 2001-11-26 | Paper |
| Parametric flows, weighted means of cuts, and fractional combinatorial optimization | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247441 | 1999-06-16 | Paper |
| Fast deterministic approximation for the multicommodity flow problem | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128914 | 1997-04-23 | Paper |
| Shortest paths algorithms: Theory and experimental evaluation | 1996-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886082 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763405 | 1995-04-11 | Paper |
| Tight bounds on the number of minimum-mean cycle cancellations and related results | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138945 | 1993-10-20 | Paper |
| A heuristic improvement of the Bellman-Ford algorithm | 1993-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974857 | 1992-06-26 | Paper |
| Improved deterministic parallel integer sorting | 1992-06-25 | Paper |
| Connectivity vs. reachability | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795244 | 1988-01-01 | Paper |
