| Publication | Date of Publication | Type |
|---|
| Fault-tolerance in distance-edge-monitoring sets | 2025-01-21 | Paper |
| Monitoring the edges of product networks using distances | 2024-12-27 | Paper |
| The number of spanning trees for Sierpiński graphs and data center networks | 2024-10-08 | Paper |
| Perturbation results for distance-edge-monitoring numbers | 2024-08-27 | Paper |
| On the distance-edge-monitoring numbers of graphs | 2024-01-24 | Paper |
| Gossiping in vertex-disjoint paths mode in interconnection networks | 2024-01-05 | Paper |
| Online knapsack with removal and recourse | 2023-12-22 | Paper |
| Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs | 2023-10-25 | Paper |
| Perpetual maintenance of machines with different urgency requirements | 2023-10-24 | Paper |
| The \textsc{Red-Blue Separation} problem on graphs | 2023-08-08 | Paper |
| A Modern View on Stability of Approximation | 2023-06-30 | Paper |
| Ramsey Achievement Games on Graphs : Algorithms and Bounds | 2023-03-06 | Paper |
| Optimal algorithms for broadcast and gossip in the edge-disjoint path modes | 2022-12-09 | Paper |
| Effective systolic algorithms for gossiping in cycles and two-dimensional grids | 2022-12-09 | Paper |
| Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020 | 2022-10-06 | Paper |
| The \textsc{red-blue separation} problem on graphs | 2022-08-30 | Paper |
| Broadcasting in butterfly and debruijn networks | 2022-08-18 | Paper |
| The relationship between gossiping in vertex-disjoint paths mode and bisection width | 2022-08-18 | Paper |
| Monitoring the edges of a graph using distances | 2022-08-04 | Paper |
| A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks | 2022-07-01 | Paper |
| On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality | 2022-06-28 | Paper |
| Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs | 2022-06-13 | Paper |
| Monitoring the edges of a graph using distances | 2020-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295505 | 2020-07-10 | Paper |
| Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs | 2020-01-16 | Paper |
| Beachcombing on strips and islands | 2020-01-16 | Paper |
| Vulnerability of super extra edge-connected graphs | 2019-11-29 | Paper |
| Computing parameters of sequence-based dynamic graphs | 2019-06-27 | Paper |
| Improved Analysis of Deterministic Load-Balancing Schemes | 2019-03-28 | Paper |
| Linear search by a pair of distinct-speed robots | 2019-01-11 | Paper |
| Centroidal bases in graphs | 2018-05-23 | Paper |
| A generic framework for computing parameters of sequence-based dynamic graphs | 2018-04-12 | Paper |
| Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality | 2017-11-14 | Paper |
| Parameterized and approximation complexity of the detection pair problem in graphs | 2017-10-24 | Paper |
| The approximability of the \(p\)-hub center problem with parameterized triangle inequality | 2017-10-23 | Paper |
| Robustness of the rotor-router mechanism | 2017-10-09 | Paper |
| The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks | 2017-10-06 | Paper |
| On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality | 2017-07-21 | Paper |
| Collision-free network exploration | 2017-05-26 | Paper |
| Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) | 2017-04-04 | Paper |
| Linear Search by a Pair of Distinct-Speed Robots | 2016-12-01 | Paper |
| Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? | 2016-12-01 | Paper |
| Approximation algorithms for the TSP with sharpened triangle inequality | 2016-06-16 | Paper |
| Improved analysis of deterministic load-balancing schemes | 2016-03-23 | Paper |
| Rendezvous of heterogeneous mobile agents in edge-weighted networks | 2015-12-11 | Paper |
| Gathering of robots on anonymous grids and trees without multiplicity detection | 2015-12-10 | Paper |
| Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs | 2015-09-21 | Paper |
| The multi-agent rotor-router on the ring | 2015-03-02 | Paper |
| Network verification via routing table queries | 2014-09-22 | Paper |
| Exploration of Constantly Connected Dynamic Graphs Based on Cactuses | 2014-08-07 | Paper |
| Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks | 2014-08-07 | Paper |
| Collision-Free Network Exploration | 2014-03-31 | Paper |
| Efficient Exploration of Anonymous Undirected Graphs | 2014-01-17 | Paper |
| From balls and bins to points and vertices | 2013-12-11 | Paper |
| Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs | 2013-12-11 | Paper |
| GATHERING RADIO MESSAGES IN THE PATH | 2013-06-11 | Paper |
| More efficient periodic traversal in anonymous undirected graphs | 2012-08-10 | Paper |
| On the size of identifying codes in triangle-free graphs | 2012-06-18 | Paper |
| Derandomizing random walks in undirected graphs using locally fair exploration strategies | 2012-02-06 | Paper |
| On the complexity of distributed graph coloring with local minimality constraints | 2010-11-24 | Paper |
| On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks | 2010-08-27 | Paper |
| Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring | 2010-08-11 | Paper |
| Improved Approximations for TSP with Simple Precedence Constraints | 2010-05-28 | Paper |
| Locating and repairing faults in a network with mobile agents | 2010-04-06 | Paper |
| More Efficient Periodic Traversal in Anonymous Undirected Graphs | 2010-02-24 | Paper |
| Data Gathering in Wireless Networks | 2010-02-09 | Paper |
| Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks | 2010-02-09 | Paper |
| Euler Tour Lock-In Problem in the Rotor-Router Model | 2009-11-19 | Paper |
| Cost minimization in wireless networks with a bounded and unbounded number of interfaces | 2009-07-28 | Paper |
| Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies | 2009-07-14 | Paper |
| Hardness results and approximation algorithms of \(k\)-tuple domination in graphs | 2009-07-09 | Paper |
| Cost Minimisation in Multi-interface Networks | 2009-03-17 | Paper |
| On \(k\)-connectivity problems with sharpened triangle inequality | 2009-02-23 | Paper |
| Approximation bounds for Black Hole Search problems | 2008-12-17 | Paper |
| On the complexity of bandwidth allocation in radio networks | 2008-11-12 | Paper |
| A randomized algorithm for the joining protocol in dynamic distributed networks | 2008-11-12 | Paper |
| On the Complexity of Distributed Greedy Coloring | 2008-09-02 | Paper |
| Locating and Repairing Faults in a Network with Mobile Agents | 2008-07-10 | Paper |
| Fast periodic graph exploration with constant memory | 2008-06-26 | Paper |
| Gathering Asynchronous Oblivious Mobile Robots in a Ring | 2008-04-24 | Paper |
| Gathering asynchronous oblivious mobile robots in a ring | 2008-03-05 | Paper |
| Improved approximation results for the minimum energy broadcasting problem | 2008-02-18 | Paper |
| Fast Periodic Graph Exploration with Constant Memory | 2007-11-15 | Paper |
| Hardness and approximation results for black hole search in arbitrary networks | 2007-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5755518 | 2007-08-13 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs | 2006-10-10 | Paper |
| Lower Bounds and Algorithms for Dominating Sets in Web Graphs | 2006-06-26 | Paper |
| Structural Information and Communication Complexity | 2005-11-30 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. | 2005-04-27 | Paper |
| On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501548 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437508 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415244 | 2003-07-28 | Paper |
| Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. | 2002-08-05 | Paper |
| Compressing cube-connected cycles and butterfly networks | 2002-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503938 | 2001-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232792 | 1999-08-17 | Paper |
| The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width | 1998-12-10 | Paper |
| Optimal embedding of complete binary trees into lines and grids | 1998-08-20 | Paper |
| Optimal algorithms for broadcast and gossip in the edge-disjoint modes | 1998-01-04 | Paper |
| The complexity of systolic dissemination of information in interconnection networks | 1997-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4870160 | 1996-04-09 | Paper |
| Broadcasting in butterfly and deBruijn networks | 1995-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281526 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694714 | 1993-06-29 | Paper |
| Monitoring the edges of product networks using distances | N/A | Paper |
| Perturbation results for distance-edge-monitoring numbers | N/A | Paper |
| Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? | N/A | Paper |
