| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7788630 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Search on a Line by Byzantine Robots
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Optimal rendezvous on a line by location-aware robots in the presence of spies*
Discrete Mathematics, Algorithms and Applications | 2022-12-19 | Paper |
Searching for a Non-adversarial, Uncooperative Agent on a Cycle
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Separating translates in the plane: Combinatorial bounds and an algorithm
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
Algorithms for Sensor Systems | 2022-12-09 | Paper |
On convergence and threshold properties of discrete Lotka-Volterra population protocols
Journal of Computer and System Sciences | 2022-08-26 | Paper |
Energy consumption of group search on a line
(available as arXiv preprint) | 2022-07-21 | Paper |
| Linear rendezvous with asymmetric clocks | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7525472 (Why is no real title available?) | 2022-05-11 | Paper |
Graph exploration by energy-sharing mobile agents
(available as arXiv preprint) | 2022-03-22 | Paper |
The bike sharing problem
(available as arXiv preprint) | 2021-10-04 | Paper |
Gossiping by energy-constrained mobile agents in tree networks
Theoretical Computer Science | 2021-03-09 | Paper |
Building a nest by an automaton
Algorithmica | 2021-02-01 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Theoretical Computer Science | 2021-01-25 | Paper |
Symmetry Breaking in the Plane
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Evacuating robots from a disk using face-to-face communication | 2021-01-05 | Paper |
Patrolling a path connecting a set of points with unbalanced frequencies of visits
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Exploring graphs with time constraints by unreliable collections of mobile robots
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Gathering in the plane of location-aware robots in the presence of spies
Theoretical Computer Science | 2020-08-25 | Paper |
God save the queen
(available as arXiv preprint) | 2020-08-11 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Lecture Notes in Computer Science | 2020-03-03 | Paper |
Priority evacuation from a disk: the case of \(n = 1,2,3\)
Theoretical Computer Science | 2020-01-16 | Paper |
Beachcombing on strips and islands
Theoretical Computer Science | 2020-01-16 | Paper |
Searching for a non-adversarial, uncooperative agent on a cycle
Theoretical Computer Science | 2020-01-16 | Paper |
Search on a line with faulty robots
Distributed Computing | 2019-11-27 | Paper |
Energy-optimal broadcast and exploration in a tree using mobile agents
Theoretical Computer Science | 2019-10-18 | Paper |
Group search of the plane with faulty robots
Theoretical Computer Science | 2019-10-07 | Paper |
Temporal flows in temporal networks
Journal of Computer and System Sciences | 2019-06-25 | Paper |
Gathering in the plane of location-aware robots in the presence of spies
Structural Information and Communication Complexity | 2019-01-30 | Paper |
| Broadcast with energy-exchanging mobile agents distributed on a tree | 2019-01-30 | Paper |
Priority evacuation from a disk using mobile robots (extended abstract)
(available as arXiv preprint) | 2019-01-30 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
| Patrolling trees with mobile robots | 2018-12-07 | Paper |
On asynchronous rendezvous in general graphs
Theoretical Computer Science | 2018-11-29 | Paper |
Search on a line by Byzantine robots
(available as arXiv preprint) | 2018-04-19 | Paper |
| Evacuation from a disc in the presence of a faulty robot | 2018-04-12 | Paper |
Evacuating two robots from multiple unknown exits in a circle
Theoretical Computer Science | 2017-12-20 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithmica | 2017-11-09 | Paper |
Search on a line with faulty robots
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Linear Search with Terrain-Dependent Speeds
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Temporal flows in temporal networks
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Collision-free network exploration
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Distributed patrolling with two-speed robots (and an application to transportation)
Operations Research and Enterprise Systems | 2017-04-28 | Paper |
Communication problems for mobile agents exchanging energy
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Linear search by a pair of distinct-speed robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
Survivability of bouncing robots
Discrete Mathematics, Algorithms and Applications | 2016-09-16 | Paper |
Convergecast and broadcast by power-aware mobile agents
Algorithmica | 2016-03-23 | Paper |
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Algorithms and Computation | 2016-01-11 | Paper |
Information spreading by mobile particles on a line
Structural Information and Communication Complexity | 2016-01-08 | Paper |
The beachcombers' problem: walking and searching with mobile robots
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 |
Localization for a system of colliding robots
Distributed Computing | 2015-09-29 | Paper |
Position discovery for a system of bouncing robots
Information and Computation | 2015-09-28 | 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 |
Evacuating robots via unknown exit in a disk
Lecture Notes in Computer Science | 2015-02-10 | Paper |
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Patrolling by robots equipped with visibility
Structural Information and Communication Complexity | 2014-08-07 | Paper |
The beachcombers' problem: walking and searching with mobile robots
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Time versus space trade-offs for rendezvous in trees
Distributed Computing | 2014-07-11 | Paper |
| How to meet asynchronously (almost) everywhere | 2014-05-22 | Paper |
Collision-free network exploration
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Survivability of swarms of bouncing robots
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Worst-case optimal exploration of terrains with obstacles
Information and Computation | 2013-11-29 | Paper |
Localization for a system of colliding robots
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 |
Collecting information by power-aware mobile agents
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 |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Choosing the best among peers
Theoretical Computer Science | 2012-08-08 | Paper |
Approximation algorithms for buy-at-bulk geometric network design
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science | 2011-12-07 | Paper |
Synchronous rendezvous for location-aware agents
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Optimality and competitiveness of exploring polygons by mobile robots
Information and Computation | 2011-01-13 | Paper |
Almost optimal asynchronous rendezvous in infinite multidimensional grids
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Tell Me Where I Am So I Can Meet You Sooner
Automata, Languages and Programming | 2010-09-07 | Paper |
Efficient Information Exchange in the Random Phone-Call Model
Automata, Languages and Programming | 2010-09-07 | Paper |
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Simultaneous diagonal flips in plane triangulations
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | 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 |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Black hole search in directed graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Consensus and Mutual Exclusion in a Multiple Access Channel
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Optimality and Competitiveness of Exploring Polygons by Mobile Robots
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Equivalence of Functions Represented by Simple Context-Free Grammars with Output
Developments in Language Theory | 2009-03-26 | Paper |
Gathering few fat mobile robots in the plane
Theoretical Computer Science | 2009-03-02 | Paper |
Computing the throughput of concatenation state machines
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Efficient Computation of Throughput Values of Context-Free Languages
Implementation and Application of Automata | 2008-06-10 | Paper |
REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
| Rectilinear glass-cut dissections of rectangles to squares | 2008-04-03 | Paper |
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Searching for a Black Hole in Synchronous Tree Networks
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
Structural Information and Communication Complexity | 2007-11-15 | Paper |
| Assigning bookmarks in perfect binary trees. | 2007-09-21 | Paper |
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice
Implementation and Application of Automata | 2007-09-06 | Paper |
Simultaneous diagonal flips in plane triangulations
Journal of Graph Theory | 2007-05-11 | Paper |
Equivalence of simple functions
Theoretical Computer Science | 2007-05-11 | Paper |
Prime normal form and equivalence of simple grammars
Theoretical Computer Science | 2007-01-09 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| Complexity of searching for a black hole | 2006-08-03 | Paper |
| Transducers with set output | 2006-02-06 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
| scientific article; zbMATH DE number 2100931 (Why is no real title available?) | 2004-09-15 | Paper |
| scientific article; zbMATH DE number 2100932 (Why is no real title available?) | 2004-09-15 | Paper |
| scientific article; zbMATH DE number 2089985 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080232 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1962770 (Why is no real title available?) | 2003-08-11 | Paper |
On polygons enclosing point sets
Geombinatorics | 2003-01-26 | Paper |
Cutting circles into equal area pieces
Geombinatorics | 2002-09-18 | Paper |
Circular separability of polygons
Algorithmica | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1552835 (Why is no real title available?) | 2001-12-12 | Paper |
| scientific article; zbMATH DE number 1629820 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1629819 (Why is no real title available?) | 2001-11-01 | Paper |
IMMOBILIZING A SHAPE
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Convex tours of bounded curvature
Computational Geometry | 2000-01-17 | Paper |
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments
Information Processing Letters | 1998-08-13 | Paper |
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm
International Journal of Computational Geometry & Applications | 1998-05-25 | Paper |
| scientific article; zbMATH DE number 910883 (Why is no real title available?) | 1996-08-22 | Paper |
Illuminating high-dimensional convex sets
Geometriae Dedicata | 1995-10-17 | Paper |
Protecting convex sets
Graphs and Combinatorics | 1995-02-01 | Paper |
Guarding rectangular art galleries
Discrete Applied Mathematics | 1994-08-21 | Paper |
Separation of convex sets
Discrete Applied Mathematics | 1994-07-31 | Paper |
Searching with local constraints on error patterns
European Journal of Combinatorics | 1994-07-19 | Paper |
COMPUTING SHORTEST TRANSVERSALS OF SETS
International Journal of Computational Geometry & Applications | 1993-11-26 | Paper |
| scientific article; zbMATH DE number 432849 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 219237 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177550 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 140478 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 90553 (Why is no real title available?) | 1993-01-16 | Paper |
Illuminating rectangles and triangles on the plane
Journal of Combinatorial Theory. Series B | 1993-01-01 | Paper |
Separating convex sets in the plane
Discrete & Computational Geometry | 1992-06-28 | Paper |
Crooked diagrams with few slopes
Order | 1992-06-25 | Paper |
Searching with a forbidden lie pattern in responses
Information Processing Letters | 1991-01-01 | Paper |
Lattice diagrams with few slopes
Journal of Combinatorial Theory. Series A | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4202280 (Why is no real title available?) | 1991-01-01 | Paper |
Drawing orders with few slopes
Discrete Mathematics | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4167784 (Why is no real title available?) | 1990-01-01 | Paper |
Ulam's searching game with lies
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Solution of Ulam's problem on binary search with two lies
Journal of Combinatorial Theory. Series A | 1988-01-01 | Paper |
