| Publication | Date of Publication | Type |
|---|
| A meta-theorem for distributed certification | 2024-01-25 | Paper |
| Energy-efficient distributed algorithms for synchronous networks | 2024-01-11 | Paper |
| The Minimum Clique Routing Problem on Cycles | 2023-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065460 | 2023-11-14 | Paper |
| Communication complexity meets cellular automata: necessary conditions for intrinsic universality | 2023-09-08 | Paper |
| Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs | 2023-04-21 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
| Local certification of graphs with bounded genus | 2022-12-08 | Paper |
| A meta-theorem for distributed certification | 2022-11-11 | Paper |
| Distributed interactive proofs for the recognition of some geometric intersection graph classes | 2022-11-11 | Paper |
| Connectivity and connected components in the number-in-hand computation model | 2022-10-25 | Paper |
| The multiple traveling salesman problem on spiders | 2022-03-24 | Paper |
| The role of randomness in the broadcast congested clique model | 2021-11-25 | Paper |
| Compact distributed certification of planar graphs | 2021-06-30 | Paper |
| Compact Distributed Certification of Planar Graphs | 2021-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5145151 | 2021-01-20 | Paper |
| Graph reconstruction in the congested clique | 2020-06-09 | Paper |
| The Impact of Locality in the Broadcast Congested Clique Model | 2020-03-20 | Paper |
| On distributed Merlin-Arthur decision protocols | 2020-03-03 | Paper |
| The impact of locality on the detection of cycles in the broadcast congested clique model | 2020-02-12 | Paper |
| Two rounds are enough for reconstructing any graph (class) in the congested clique model | 2019-01-30 | Paper |
| Distributed testing of excluded subgraphs | 2018-08-16 | Paper |
| Robust reconstruction of Barabási‐Albert networks in the broadcast congested clique model | 2018-04-27 | Paper |
| The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model | 2016-09-02 | Paper |
| Brief Announcement | 2016-03-23 | Paper |
| Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model | 2016-01-08 | Paper |
| Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results | 2015-08-04 | Paper |
| Allowing each node to communicate only once in a distributed system: shared whiteboard models | 2015-07-22 | Paper |
| The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism | 2014-08-07 | Paper |
| Solving the density classification problem with a large diffusion and small amplification cellular automaton | 2014-04-04 | Paper |
| Letting Alice and Bob choose which problem to solve: implications to the study of cellular automata | 2013-02-19 | Paper |
| Distributed computing of efficient routing schemes in generalized chordal graphs | 2012-08-10 | Paper |
| Erratum to: ``Communication complexity and intrinsic universality in cellular automata | 2012-01-04 | Paper |
| Traced communication complexity of cellular automata | 2011-07-18 | Paper |
| Communication complexity in number-conserving and monotone cellular automata | 2011-07-14 | Paper |
| On dissemination thresholds in regular and irregular graph classes | 2011-03-02 | Paper |
| Communication complexity and intrinsic universality in cellular automata | 2011-01-10 | Paper |
| Average Long-Lived Memoryless Consensus: The Three-Value Case | 2010-06-17 | Paper |
| Minimal proper interval completions | 2010-04-19 | Paper |
| Average long-lived binary consensus: quantifying the stabilizing role played by memory | 2010-04-06 | Paper |
| Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs | 2010-02-24 | Paper |
| Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol | 2009-01-29 | Paper |
| Small Alliances in Graphs | 2008-09-17 | Paper |
| Minimal Proper Interval Completions | 2008-09-04 | Paper |
| Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory | 2008-07-10 | Paper |
| Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time | 2008-04-17 | Paper |
| On Dissemination Thresholds in Regular and Irregular Graph Classes | 2008-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828960 | 2004-11-29 | Paper |
| Cellular automata and communication complexity | 2004-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044329 | 2004-08-11 | Paper |
| Domino tilings and related models: Space of configurations of domains with holes | 2004-08-10 | Paper |
| AT-free graphs: Linear bounds for the oriented diameter | 2004-08-06 | Paper |
| Complexity of approximating the oriented diameter of chordal graphs | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407708 | 2003-11-10 | Paper |
| Tiling with bars under tomographic constraints. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414499 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741458 | 2001-10-24 | Paper |
| Tiling allowing rotations only | 1999-06-21 | Paper |
| Complexity of tile rotation problems | 1998-06-30 | Paper |
