| Publication | Date of Publication | Type |
|---|
| Asynchronous self-stabilization made fast, simple, and energy-efficient | 2025-06-13 | Paper |
| The reduced automata technique for graph exploration space lower bounds | 2025-03-19 | Paper |
| Framing algorithms for approximate multicriteria shortest paths | 2024-08-13 | Paper |
Optimized silent self-stabilizing scheme for tree-based constructions
Algorithmica | 2022-02-01 | Paper |
Exploration of dynamic cactuses with sub-logarithmic overhead
Theory of Computing Systems | 2021-06-24 | Paper |
Exploration of carrier-based time-varying networks: the power of waiting
Theoretical Computer Science | 2020-09-17 | Paper |
Deciding and verifying network properties locally with few output bits
Distributed Computing | 2020-04-23 | Paper |
Beachcombing on strips and islands
Theoretical Computer Science | 2020-01-16 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
| Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps | 2018-12-10 | Paper |
On asynchronous rendezvous in general graphs
Theoretical Computer Science | 2018-11-29 | Paper |
Label-guided graph exploration by a finite automaton
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Exploration of the T-interval-connected dynamic graphs: the case of the ring
Theory of Computing Systems | 2018-07-23 | Paper |
Self-stabilizing disconnected components detection and rooted shortest-path tree maintenance in polynomial steps
(available as arXiv preprint) | 2018-07-18 | Paper |
On mobile agent verifiable problems
Information and Computation | 2018-05-30 | Paper |
Robustness of the rotor-router mechanism
Algorithmica | 2017-10-09 | Paper |
Linear search by a pair of distinct-speed robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On mobile agent verifiable problems
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
The impact of dynamic events on the number of errors in networks
Theoretical Computer Science | 2016-04-01 | Paper |
Distributedly testing cycle-freeness
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Oracle size, a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | 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 |
Exploration of constantly connected dynamic graphs based on cactuses
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Worst-case optimal exploration of terrains with obstacles
Information and Computation | 2013-11-29 | Paper |
Computing without communicating: ring exploration by asynchronous oblivious robots
Algorithmica | 2013-08-05 | Paper |
Distributed computing with advice: information sensitivity of graph coloring
Distributed Computing | 2013-06-28 | Paper |
The cost of monotonicity in distributed graph searching
Distributed Computing | 2013-06-28 | Paper |
How many oblivious robots can explore a line
Information Processing Letters | 2013-04-04 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Ping pong in dangerous graphs: optimal black hole search with pebbles
Algorithmica | 2012-04-26 | Paper |
Derandomizing random walks in undirected graphs using locally fair exploration strategies
Distributed Computing | 2012-02-06 | Paper |
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science | 2011-12-07 | Paper |
Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Almost optimal asynchronous rendezvous in infinite multidimensional grids
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Optimal Exploration of Terrains with Obstacles
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Asynchronous deterministic rendezvous in bounded terrains
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Communication algorithms with advice
Journal of Computer and System Sciences | 2010-05-25 | Paper |
Fast radio broadcasting with advice
Theoretical Computer Science | 2010-04-06 | Paper |
Remembering without memory: tree exploration by asynchronous oblivious robots
Theoretical Computer Science | 2010-04-06 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Euler Tour Lock-In Problem in the Rotor-Router Model
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
Automata, Languages and Programming | 2009-07-14 | Paper |
Labeling schemes for tree representation
Algorithmica | 2009-05-13 | Paper |
Setting Port Numbers for Fast Graph Exploration
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Tree exploration with advice
Information and Computation | 2008-12-03 | Paper |
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Impact of memory size on graph exploration capability
Discrete Applied Mathematics | 2008-09-29 | Paper |
Setting port numbers for fast graph exploration
Theoretical Computer Science | 2008-07-31 | Paper |
Fast Radio Broadcasting with Advice
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Structural Information and Communication Complexity | 2008-07-10 | Paper |
| Impact of asynchrony on the behavior of rational selfish agents | 2008-03-19 | Paper |
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Automata, Languages and Programming | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Tree Exploration with an Oracle
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Distributed Computing – IWDC 2005
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph exploration by a finite automaton
Theoretical Computer Science | 2005-12-06 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
