| Publication | Date of Publication | Type |
|---|
| Parallel approximation of optimization problems | 2024-06-21 | Paper |
| Structure in approximation classes | 2023-12-12 | Paper |
| Reductions to sets of low information content | 2019-12-04 | Paper |
| Plurality Consensus in the Gossip Model | 2017-10-05 | Paper |
| Simple dynamics for plurality consensus | 2017-09-04 | Paper |
| Revisiting a result of Ko | 2016-05-26 | Paper |
| A characterization of the leaf language classes | 2016-05-26 | Paper |
| Rumor spreading in random evolving graphs | 2016-03-22 | Paper |
| Distributed multi-broadcast in unknown radio networks | 2016-03-04 | Paper |
| Distributed community detection in dynamic graphs | 2015-05-22 | Paper |
| Information spreading in dynamic graphs | 2015-03-25 | Paper |
| Fast flooding over Manhattan | 2015-03-02 | Paper |
| Flooding time in edge-Markovian dynamic graphs | 2014-12-12 | Paper |
| Information spreading in dynamic graphs | 2014-12-05 | Paper |
| Parsimonious flooding in geometric random-walks | 2014-09-22 | Paper |
| Communication in dynamic radio networks | 2014-03-13 | Paper |
| Distributed Community Detection in Dynamic Graphs | 2013-12-17 | Paper |
| Rumor Spreading in Random Evolving Graphs | 2013-09-17 | Paper |
| Fast flooding over Manhattan | 2013-06-25 | Paper |
| On the importance of having an identity or, is consensus really universal? | 2013-06-07 | Paper |
| Optimal gossiping in geometric radio networks in the presence of dynamical faults | 2012-06-29 | Paper |
| Parsimonious Flooding in Geometric Random-Walks | 2011-10-28 | Paper |
| Flooding Time of Edge-Markovian Evolving Graphs | 2011-07-18 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| MANETS: High Mobility Can Make Up for Low Transmission Power | 2009-07-14 | Paper |
| Broadcasting in dynamic radio networks | 2009-04-30 | Paper |
| Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks | 2009-03-12 | Paper |
| Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults | 2008-09-17 | Paper |
| An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem | 2008-07-01 | Paper |
| Minimum-energy broadcast and disk cover in grid wireless networks | 2008-06-24 | Paper |
| On the bounded-hop MST problem on random Euclidean instances | 2007-10-02 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 2005-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461521 | 2005-07-26 | Paper |
| An experimental analysis of simple, distributed vertex coloring algorithms | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828989 | 2004-11-29 | Paper |
| Round robin is optimal for fault-tolerant broadcasting on wireless networks | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427854 | 2003-09-14 | Paper |
| Polynomial time introreducibility | 2003-08-26 | Paper |
| Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. | 2003-08-19 | Paper |
| Distributed broadcast in radio networks of unknown topology. | 2003-08-17 | Paper |
| The minimum range assignment problem on linear radio networks | 2003-06-02 | Paper |
| The minimum broadcast range assignment problem on linear multi-hop wireless networks. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796195 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785466 | 2003-02-04 | Paper |
| On weighted vs unweighted versions of combinatorial optimization problems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768369 | 2002-03-24 | Paper |
| Dot operators | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766868 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753931 | 2001-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501569 | 2001-12-05 | Paper |
| The Helping Hierarchy | 2001-01-01 | Paper |
| Structure in Approximation Classes | 1999-10-28 | Paper |
| Sperner's lemma and robust machines | 1999-05-09 | Paper |
| A worst-case analysis of the LZ2 compression algorithm | 1998-09-08 | Paper |
| On compact representations of propositional circumscription | 1998-07-22 | Paper |
| Helping by unambiguous computation and probabilistic computation | 1997-11-18 | Paper |
| Easily Checked Generalized Self-Reducibility | 1996-01-28 | Paper |
| Complexity classes and sparse oracles | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284249 | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281491 | 1994-03-10 | Paper |
| AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS | 1994-01-26 | Paper |
| A note on the descriptive complexity of maximization problems | 1994-01-13 | Paper |
| A uniform approach to define complexity classes | 1993-01-16 | Paper |
| Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems | 1990-01-01 | Paper |
