| Publication | Date of Publication | Type |
|---|
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Journal of Computer and System Sciences | 2022-08-26 | Paper |
scientific article; zbMATH DE number 7561636 (Why is no real title available?)
| 2022-07-21 | Paper |
Hardness of exact distance queries in sparse graphs through hub labeling
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Approximation strategies for generalized binary search in weighted trees
| 2020-05-27 | Paper |
Brief Announcement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Does adding more agents make a difference? A case study of cover time for the rotor-router
Journal of Computer and System Sciences | 2019-08-30 | Paper |
Universal protocols for information dissemination using emergent signals
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Faster walks in graphs: a \(\tilde O(n^2)\) time-space trade-off for undirected \(s\)-\(t\) connectivity
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Improved analysis of deterministic load-balancing schemes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Patrolling trees with mobile robots
| 2018-12-07 | Paper |
Limit behavior of the multi-agent rotor-router system
| 2018-08-24 | Paper |
Sublinear-space distance labeling using hubs
| 2018-08-16 | Paper |
Beyond highway dimension: small distance labels using tree skeletons
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Multiple random walks on paths and grids
| 2018-04-19 | Paper |
A point set connection problem for autonomous mobile robots in a grid
| 2018-04-05 | Paper |
scientific article; zbMATH DE number 6850478 (Why is no real title available?)
| 2018-03-15 | Paper |
Robust detection in leak-prone population protocols
| 2018-02-02 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithmica | 2017-11-09 | Paper |
Robustness of the rotor-router mechanism
Algorithmica | 2017-10-09 | Paper |
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
Distributed Computing | 2017-10-06 | Paper |
Brief announcement: Sublinear-space distance labeling using hubs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Collision-free network exploration
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Bounds on the cover time of parallel rotor walks
| 2017-03-03 | Paper |
Setting ports in an anonymous network: how to reduce the level of symmetry?
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Bounds on the cover time of parallel rotor walks
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Improved analysis of deterministic load-balancing schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithms and Computation | 2016-01-11 | Paper |
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Theoretical Computer Science | 2015-12-11 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Automata, Languages, and Programming | 2015-10-27 | Paper |
Position discovery for a system of bouncing robots
Information and Computation | 2015-09-28 | Paper |
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Distributed Computing | 2015-07-22 | Paper |
Fast collaborative graph exploration
Information and Computation | 2015-06-09 | Paper |
Distinguishing views in symmetric networks: a tight lower bound
Theoretical Computer Science | 2015-04-29 | Paper |
Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Rendezvous of distance-aware mobile agents in unknown graphs
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Time versus space trade-offs for rendezvous in trees
Distributed Computing | 2014-07-11 | Paper |
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
Automata, Languages, and Programming | 2014-07-01 | Paper |
Collision-free network exploration
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Maximum matching in multi-interface networks
Theoretical Computer Science | 2014-01-16 | Paper |
Fast collaborative graph exploration
Automata, Languages, and Programming | 2013-08-07 | Paper |
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Theory of Computing Systems | 2013-04-15 | Paper |
Position discovery for a system of bouncing robots
Lecture Notes in Computer Science | 2013-03-13 | Paper |
How to meet when you forget: log-space rendezvous in arbitrary graphs
Distributed Computing | 2013-02-04 | Paper |
Maximum matching in multi-interface networks
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
\(k\)-chordal graphs: from cops and robber to compact routing via treewidth
Automata, Languages, and Programming | 2012-11-01 | Paper |
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics | 2012-06-18 | Paper |
Graph decomposition for memoryless periodic exploration
Algorithmica | 2012-04-26 | Paper |
Derandomizing random walks in undirected graphs using locally fair exploration strategies
Distributed Computing | 2012-02-06 | Paper |
Synchronous rendezvous for location-aware agents
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Synchronous black hole search in directed graphs
Theoretical Computer Science | 2011-10-10 | Paper |
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Packing three-vertex paths in 2-connected cubic graphs.
| 2011-02-02 | Paper |
On the complexity of distributed graph coloring with local minimality constraints
Networks | 2010-11-24 | Paper |
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science | 2010-08-11 | Paper |
Packing three-vertex paths in a subcubic graph
| 2010-07-30 | Paper |
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics | 2010-04-28 | Paper |
A note on the strength and minimum color sum of bipartite graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
A note on mixed tree coloring
Information Processing Letters | 2010-04-19 | Paper |
An improved strategy for exploring a grid polygon
Structural Information and Communication Complexity | 2010-02-24 | Paper |
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
Information Processing Letters | 2010-01-29 | Paper |
Mixed graph edge coloring
Discrete Mathematics | 2009-12-09 | Paper |
Euler Tour Lock-In Problem in the Rotor-Router Model
Lecture Notes in Computer Science | 2009-11-19 | Paper |
What Can Be Observed Locally?
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Graph Decomposition for Improving Memoryless Periodic Exploration
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Cost minimization in wireless networks with a bounded and unbounded number of interfaces
Networks | 2009-07-28 | Paper |
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Automata, Languages and Programming | 2009-07-14 | Paper |
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
Discrete Mathematics | 2009-06-23 | Paper |
Universal augmentation schemes for network navigability
Theoretical Computer Science | 2009-05-28 | Paper |
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
Graphs and Combinatorics | 2009-04-29 | Paper |
Cost Minimisation in Multi-interface Networks
Lecture Notes in Computer Science | 2009-03-17 | Paper |
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Forwarding and optical indices of a graph
Discrete Applied Mathematics | 2009-03-04 | Paper |
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
Fault Tolerant Guarding of Grids
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
On the Complexity of Distributed Greedy Coloring
Lecture Notes in Computer Science | 2008-09-02 | Paper |
The maximum edge-disjoint paths problem in complete graphs
Theoretical Computer Science | 2008-06-24 | Paper |
Packing \([1, \Delta \)-factors in graphs of small degree]
Journal of Combinatorial Optimization | 2007-11-14 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Cooperative mobile guards in grids
Computational Geometry | 2007-04-18 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
