| Publication | Date of Publication | Type |
|---|
| Renting servers in the cloud: the case of equal duration jobs | 2025-01-06 | Paper |
| Diversity-seeking jump games in networks | 2024-05-29 | Paper |
| Exploration of High-Dimensional Grids by Finite State Machines | 2024-04-24 | Paper |
| Evacuation of equilateral triangles by mobile agents of limited communication range | 2024-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187825 | 2024-01-15 | Paper |
| Search on a Line by Byzantine Robots | 2023-08-15 | Paper |
| Energy Consumption of Group Search on a Line | 2022-07-21 | Paper |
| Exploration of High-Dimensional Grids by Finite Automata | 2022-07-21 | Paper |
| Graph exploration by energy-sharing mobile agents | 2022-03-22 | Paper |
| The bike sharing problem | 2021-10-04 | Paper |
| On synchronization and orientation in distributed barrier coverage with relocatable sensors | 2021-09-27 | Paper |
| Time-energy tradeoffs for evacuation by two robots in the wireless model | 2021-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386625 | 2021-01-05 | Paper |
| Evacuating equilateral triangles and squares in the face-to-face model | 2020-10-23 | Paper |
| God save the queen | 2020-08-11 | Paper |
| Evacuating an Equilateral Triangle in the Face-to-Face Model | 2020-07-30 | Paper |
| Distributed pattern formation in a ring | 2020-03-03 | 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 |
| How to choose friends strategically | 2020-02-13 | Paper |
| Satisfying neighbor preferences on a circle | 2020-02-12 | Paper |
| Whom to befriend to influence people | 2020-02-06 | 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 |
| Editing graphs to satisfy diversity requirements | 2019-10-11 | Paper |
| Priority evacuation from a disk using mobile robots (extended abstract) | 2019-01-30 | Paper |
| Search on a Line by Byzantine Robots | 2018-04-19 | Paper |
| How to choose friends strategically | 2018-04-12 | Paper |
| Search on a Line with Faulty Robots | 2017-09-29 | Paper |
| Weak coverage of a rectangular barrier | 2017-07-21 | Paper |
| Linear Search with Terrain-Dependent Speeds | 2017-07-21 | Paper |
| Distributed algorithms for barrier coverage using relocatable sensors | 2017-04-04 | Paper |
| Whom to befriend to influence people | 2016-12-01 | Paper |
| Strong connectivity of sensor networks with double antennae | 2015-12-10 | Paper |
| Complexity of barrier coverage with relocatable sensors in the plane | 2015-05-18 | Paper |
| Distributed algorithms for barrier coverage using relocatable sensors | 2015-03-02 | Paper |
| Optimal sensor networks for area monitoring using rotating and beam sensors | 2015-01-21 | Paper |
| Distributed Barrier Coverage with Relocatable Sensors | 2014-08-07 | Paper |
| A tight characterization of strategic games with a unique equilibrium | 2013-11-29 | Paper |
| Complexity of Barrier Coverage with Relocatable Sensors in the Plane | 2013-06-07 | Paper |
| Strong Connectivity of Sensor Networks with Double Antennae | 2012-09-26 | Paper |
| Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs | 2011-06-17 | Paper |
| Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations | 2011-01-10 | Paper |
| Maximum Interference of Random Sensors on a Line | 2010-06-17 | Paper |
| Wavelength routing of uniform instances in all-optical rings | 2009-06-02 | Paper |
| Games to induce specified equilibria | 2009-01-08 | Paper |
| Balancing Traffic Load Using One-Turn Rectilinear Routing | 2008-05-27 | Paper |
| On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks | 2008-03-06 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Worst-case analysis of a dynamic channel assignment strategy | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471372 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536364 | 2002-11-06 | Paper |
| Partial characterizations of networks supporting shortest path interval labeling schemes | 2002-07-21 | Paper |
| Approximation algorithms for channel assignment with constraints | 2002-03-03 | Paper |
| Static frequency assignment in cellular networks | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511237 | 2001-03-06 | Paper |
| Distributed Online Frequency Assignment in Cellular Networks | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942230 | 2000-03-21 | Paper |
| Interval Routing onk-Trees | 1998-06-23 | Paper |
| Upper and lower bounds for selection on the mesh | 1998-05-24 | Paper |
| Fast deterministic selection on mesh-connected processor arrays | 1996-04-28 | Paper |
