| Publication | Date of Publication | Type |
|---|
| VC-dimensions for graphs (extended abstract) | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187825 | 2024-01-15 | Paper |
| On multi-label linear interval routing schemes | 2024-01-05 | Paper |
| Search on a Line by Byzantine Robots | 2023-08-15 | Paper |
| Delivery to safety with two cooperating robots | 2023-08-14 | Paper |
| A time-randomness tradeoff for selection in parallel | 2023-01-18 | Paper |
| Optimal rendezvous on a line by location-aware robots in the presence of spies* | 2022-12-19 | Paper |
| Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults | 2022-12-09 | Paper |
| Power consumption in packet radio networks | 2022-11-09 | Paper |
| Energy Consumption of Group Search on a Line | 2022-07-21 | Paper |
| The pony express communication problem | 2022-03-22 | Paper |
| Graph exploration by energy-sharing mobile agents | 2022-03-22 | Paper |
| The bike sharing problem | 2021-10-04 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2021-01-25 | Paper |
| Gathering in the plane of location-aware robots in the presence of spies | 2020-08-25 | Paper |
| God save the queen | 2020-08-11 | Paper |
| On realizing shapes in the theory of RNA neutral networks | 2020-07-09 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2020-03-03 | Paper |
| Weak coverage of a rectangular barrier | 2020-02-28 | Paper |
| Satisfying neighbor preferences on a circle | 2020-02-12 | Paper |
| Priority evacuation from a disk: the case of \(n = 1,2,3\) | 2020-01-16 | Paper |
| Search on a line with faulty robots | 2019-11-27 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | Paper |
| Gathering in the plane of location-aware robots in the presence of spies | 2019-01-30 | Paper |
| Priority evacuation from a disk using mobile robots (extended abstract) | 2019-01-30 | Paper |
| Optimal shooting: Characterizations and applications | 2019-01-10 | Paper |
| Search on a Line by Byzantine Robots | 2018-04-19 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
| Know when to persist: deriving value from a stream buffer | 2018-03-13 | Paper |
| Approximating the unsatisfiability threshold of random formulas (Extended Abstract) | 2017-12-05 | Paper |
| Lower bounds for compact routing | 2017-11-16 | Paper |
| When patrolmen become corrupted: monitoring a graph using faulty mobile robots | 2017-11-09 | Paper |
| Search on a Line with Faulty Robots | 2017-09-29 | Paper |
| Linear Search with Terrain-Dependent Speeds | 2017-07-21 | Paper |
| Weak coverage of a rectangular barrier | 2017-07-21 | Paper |
| Distributed algorithms for barrier coverage using relocatable sensors | 2017-04-04 | Paper |
| Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs | 2017-04-04 | Paper |
| Know When to Persist: Deriving Value from a Stream Buffer | 2016-11-09 | Paper |
| Reconstructing Cactus Graphs from Shortest Path Information | 2016-11-09 | Paper |
| When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots | 2016-01-11 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| DMVP: Foremost Waypoint Coverage of Time-Varying Graphs | 2015-09-09 | Paper |
| Excuse me! or the courteous theatregoers' problem | 2015-05-26 | Paper |
| Complexity of barrier coverage with relocatable sensors in the plane | 2015-05-18 | Paper |
| MINIMIZING CONGESTION OF LAYOUTS FOR ATM NETWORKS WITH FAULTY LINKS | 2015-04-29 | Paper |
| Distributed algorithms for barrier coverage using relocatable sensors | 2015-03-02 | Paper |
| Randomized rendezvous with limited memory | 2014-09-09 | Paper |
| Asymptotic number of hairpins of saturated RNA secondary structures | 2014-04-22 | Paper |
| Complexity of Barrier Coverage with Relocatable Sensors in the Plane | 2013-06-07 | Paper |
| On the page number of RNA secondary structures with pseudoknots | 2012-12-13 | Paper |
| Maintaining privacy on a line | 2012-12-06 | Paper |
| BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS | 2012-10-15 | Paper |
| STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE | 2012-10-15 | Paper |
| The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs | 2012-09-10 | Paper |
| Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points | 2012-06-29 | Paper |
| Encoding 2D range maximum queries | 2011-12-16 | Paper |
| Deterministic symmetric rendezvous with tokens in a synchronous torus | 2011-06-01 | Paper |
| Maintaining Connectivity in Sensor Networks Using Directional Antennae | 2011-04-05 | Paper |
| Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle | 2011-01-10 | Paper |
| Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations | 2011-01-10 | Paper |
| Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs | 2011-01-08 | Paper |
| String recognition on anonymous rings | 2010-06-17 | Paper |
| Maximum Interference of Random Sensors on a Line | 2010-06-17 | Paper |
| Random maximal independent sets and the unfriendly theater seating arrangement problem | 2009-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181699 | 2009-10-12 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Approximate hotlink assignment | 2009-07-21 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| An Algorithmic Theory of Mobile Agents | 2009-03-05 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | Paper |
| Mobile Agent Rendezvous in a Synchronous Torus | 2008-09-18 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Memoryless search algorithms in a network with faulty advice | 2008-08-06 | Paper |
| Balancing Traffic Load Using One-Turn Rectilinear Routing | 2008-05-27 | Paper |
| Randomized Rendez-Vous with Limited Memory | 2008-04-15 | Paper |
| The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring | 2008-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310248 | 2007-09-21 | Paper |
| Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model | 2007-04-18 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Efficient automatic simulation of parallel computation on networks of workstations | 2006-06-09 | Paper |
| Asynchronous deterministic rendezvous in graphs | 2006-04-28 | Paper |
| Principles of Distributed Systems | 2005-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5705139 | 2005-11-08 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| Asymmetric communication protocols via hotlink assignments | 2005-02-11 | Paper |
| Compact routing schemes for dynamic ring networks | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817649 | 2004-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472476 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474141 | 2004-08-04 | Paper |
| Sorting and election in anonymous asynchronous rings. | 2004-03-14 | Paper |
| Searching with mobile agents in networks with liars. | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436057 | 2003-11-23 | Paper |
| Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory | 2003-10-29 | Paper |
| The impact of information on broadcasting time in linear radio networks. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2752519 | 2002-09-18 | Paper |
| Rigorous results for random (\(2+p)\)-SAT | 2002-03-03 | Paper |
| Random constraint satisfaction: A more accurate picture | 2002-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766883 | 2002-01-28 | Paper |
| Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval | 2002-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728846 | 2001-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729093 | 2001-10-23 | Paper |
| Ray shooting from convex ranges | 2001-09-03 | Paper |
| Fault-Tolerant Broadcasting in Radio Networks | 2001-07-29 | Paper |
| On recognizing a string on an anonymous ring | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788596 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504023 | 2000-12-06 | Paper |
| Distributed Online Frequency Assignment in Cellular Networks | 2000-11-22 | Paper |
| Efficient regular polygon dissections | 2000-10-23 | Paper |
| Power consumption in packet radio networks | 2000-08-21 | Paper |
| Approximating the unsatisfiability threshold of random formulas | 2000-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938771 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942228 | 2000-03-21 | Paper |
| Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks | 2000-03-19 | Paper |
| Baked-Potato Routing | 1999-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234101 | 1999-06-29 | Paper |
| Approximate maxima finding of continuous functions under restricted budget | 1999-01-12 | Paper |
| Planar stage graphs: Characterizations and applications | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385172 | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375776 | 1998-02-08 | Paper |
| Stage-graph representations | 1998-01-29 | Paper |
| The VC-dimension of set systems defined by graphs | 1997-12-17 | Paper |
| Hop-Congestion Trade-Offs for High-Speed Networks | 1997-09-29 | Paper |
| On Multi-Label Linear Interval Routing Schemes | 1996-10-30 | Paper |
| Labeled versus unlabeled distributed Cayley networks | 1996-08-05 | Paper |
| Time-Randomness Trade-offs in Parallel Computation | 1996-06-27 | Paper |
| Fast deterministic selection on mesh-connected processor arrays | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326201 | 1995-07-13 | Paper |
| Computing Boolean functions on anonymous networks | 1995-01-11 | Paper |
| Optimal coteries and voting schemes | 1994-08-03 | Paper |
| Integer sorting on a mesh-connected array of processors | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038697 | 1993-05-18 | Paper |
| The Average Complexity of Parallel Comparison Merging | 1992-06-28 | Paper |
| Oblivious routing with limited buffer capacity | 1992-06-25 | Paper |
| Tight bounds for oblivious routing in the hypercube | 1991-01-01 | Paper |
