| Publication | Date of Publication | Type |
|---|
On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
Distributed Computing | 2024-09-10 | Paper |
On gathering of semi-synchronous robots in graphs
| 2024-04-19 | Paper |
Molecular pattern formation on grids in the \textsc{Moblot} model
Theoretical Computer Science | 2024-04-04 | Paper |
Separating Bounded and Unbounded Asynchrony for Autonomous Robots
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
A structured methodology for designing distributed algorithms for mobile entities
Information Sciences | 2023-12-11 | Paper |
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs
Journal of Computer and System Sciences | 2023-10-24 | Paper |
Mutual visibility in hypercube-like graphs
| 2023-08-28 | Paper |
Optimal and heuristic algorithms for data collection by using an energy- and storage-constrained drone
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Molecular robots with chirality on grids
Algorithmics of Wireless Networks | 2023-08-04 | Paper |
Time-optimal geodesic mutual visibility of robots on grids within minimum area
| 2023-08-03 | Paper |
Arbitrary pattern formation on infinite regular tessellation graphs
Theoretical Computer Science | 2022-12-21 | Paper |
On the effectiveness of the genetic paradigm for polygonization
Information Processing Letters | 2021-06-16 | Paper |
Gathering robots in graphs: the central role of synchronicity
Theoretical Computer Science | 2020-12-15 | Paper |
On the curve complexity of 3-colored point-set embeddings
Theoretical Computer Science | 2020-11-06 | Paper |
Priority scheduling in the bamboo garden trimming problem
| 2020-10-22 | Paper |
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
| 2020-03-03 | Paper |
Asynchronous rendezvous with different maps
| 2020-03-03 | Paper |
Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
| 2020-02-06 | Paper |
Embedded pattern formation by asynchronous robots without chirality
Distributed Computing | 2019-08-13 | Paper |
Bamboo garden trimming problem: priority schedulings
Algorithms | 2019-07-08 | Paper |
Asynchronous arbitrary pattern formation: the effects of a rigorous approach
Distributed Computing | 2019-06-20 | Paper |
Colored Point-Set Embeddings of Acyclic Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Turning cliques into paths to achieve planarity
| 2019-02-15 | Paper |
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
Information and Computation | 2018-12-03 | Paper |
Approximation bounds for the minimum \(k\)-storage problem
| 2018-10-17 | Paper |
Asynchronous embedded pattern formation without orientation
| 2018-08-16 | Paper |
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
Distributed Computing | 2018-02-23 | Paper |
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
Distributed Computing | 2017-10-06 | Paper |
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
Journal of Discrete Algorithms | 2017-10-06 | Paper |
Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
Theoretical Computer Science | 2017-09-28 | Paper |
Recoverable Robust Timetables: An Algorithmic Approach on Trees
IEEE Transactions on Computers | 2017-07-27 | Paper |
Flow Problems in Multi-Interface Networks
IEEE Transactions on Computers | 2017-06-20 | Paper |
Gathering of oblivious robots on infinite grids with minimum traveled distance
Information and Computation | 2017-05-12 | Paper |
A unified approach for gathering and exclusive searching on rings under weak assumptions
Distributed Computing | 2017-03-29 | Paper |
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
Search Theory | 2017-02-20 | Paper |
Synchronous robots vs asynchronous lights-enhanced robots on graphs
| 2016-08-05 | Paper |
About ungatherability of oblivious and asynchronous robots on anonymous rings
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Gathering of robots on anonymous grids and trees without multiplicity detection
Theoretical Computer Science | 2015-12-10 | Paper |
Explore and repair graphs with black holes using mobile entities
Theoretical Computer Science | 2015-10-30 | Paper |
Minmax-distance gathering on given meeting points
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Computing on rings by oblivious robots: a unified approach for different tasks
Algorithmica | 2015-09-02 | Paper |
The minimum \(k\)-storage problem on directed graphs
Theoretical Computer Science | 2015-07-24 | Paper |
Gathering on rings under the look-compute-move model
Distributed Computing | 2015-02-23 | Paper |
Balancing energy consumption for the establishment of multi-interface networks
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Gathering six oblivious robots on anonymous symmetric rings
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Maximum matching in multi-interface networks
Theoretical Computer Science | 2014-01-16 | Paper |
Optimal gathering of oblivious robots in anonymous graphs
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Recoverable robustness for train shunting problems
Algorithmic Operations Research | 2013-12-11 | Paper |
From balls and bins to points and vertices
Algorithmic Operations Research | 2013-12-11 | Paper |
How to gather asynchronous oblivious robots on anonymous rings
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Maximum matching in multi-interface networks
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Robust algorithms and price of robustness in shunting problems
| 2012-09-28 | Paper |
Distributed colorings for collision-free routing in sink-centric sensor networks
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Localization and scheduling protocols for actor-centric sensor networks
Networks | 2012-06-29 | Paper |
Minimize the maximum duty in multi-interface networks
Algorithmica | 2012-04-26 | Paper |
Graph decomposition for memoryless periodic exploration
Algorithmica | 2012-04-26 | Paper |
Synchronous black hole search in directed graphs
Theoretical Computer Science | 2011-10-10 | Paper |
Collision-free routing in sink-centric sensor networks with coarse-grain coordinates
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Dense, concentric, and non-uniform multi-hop sensor networks
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Bandwidth constrained multi-interface networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Min-max coverage in multi-interface networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
On the complexity of distributed graph coloring with local minimality constraints
Networks | 2010-11-24 | Paper |
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science | 2010-08-11 | Paper |
Topology control and routing in ad hoc networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Energy consumption minimization in ad hoc wireless and multi-interface networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Evaluation of recoverable-robust timetables on tree networks
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Recoverable Robustness in Shunting and Timetabling
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
Journal of Combinatorial Optimization | 2009-12-02 | 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 |
Recoverable Robust Timetables on Trees
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Cost Minimisation in Multi-interface Networks
Lecture Notes in Computer Science | 2009-03-17 | Paper |
3-D Minimum Energy Broadcasting
Structural Information and Communication Complexity | 2009-03-12 | Paper |
Layouts for mobility management in wireless ATM networks
Discrete Applied Mathematics | 2009-03-04 | Paper |
Delay Management Problem: Complexity Results and Robust Algorithms
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On the Complexity of Distributed Greedy Coloring
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences | 2008-06-26 | Paper |
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
ACM Journal of Experimental Algorithmics | 2008-06-20 | Paper |
Asymptotically optimal solutions for small world graphs
Theory of Computing Systems | 2008-06-06 | Paper |
Improved approximation results for the minimum energy broadcasting problem
Algorithmica | 2008-02-18 | Paper |
Fast Periodic Graph Exploration with Constant Memory
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
Journal of Discrete Algorithms | 2006-10-31 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Theoretical Computer Science | 2005-04-06 | Paper |
