| Publication | Date of Publication | Type |
|---|
Mutual-visibility in strong products of graphs via total mutual-visibility
Discrete Applied Mathematics | 2024-09-26 | Paper |
Mutual-visibility problems on graphs of diameter two
European Journal of Combinatorics | 2024-07-08 | Paper |
On monophonic position sets in graphs
Discrete Applied Mathematics | 2024-06-20 | Paper |
On the general position number of Mycielskian graphs
Discrete Applied Mathematics | 2024-05-29 | 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 |
A structured methodology for designing distributed algorithms for mobile entities
Information Sciences | 2023-12-11 | Paper |
Variety of mutual-visibility problems in graphs
Theoretical Computer Science | 2023-09-18 | Paper |
Mutual visibility in hypercube-like graphs
| 2023-08-28 | 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 |
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm
| 2023-07-20 | Paper |
Arbitrary pattern formation on infinite regular tessellation graphs
Theoretical Computer Science | 2022-12-21 | Paper |
On the mutual visibility in Cartesian products and triangle-free graphs
Applied Mathematics and Computation | 2022-11-16 | Paper |
Mutual-visibility in strong products of graphs via total mutual-visibility
| 2022-10-14 | Paper |
On the Vertex Position Number of Graphs
| 2022-09-01 | Paper |
A graph theoretical approach to the firebreak locating problem
Theoretical Computer Science | 2022-04-19 | Paper |
Mutual visibility in graphs
Applied Mathematics and Computation | 2022-03-03 | Paper |
On the mutual visibility in Cartesian products and triangle-free graphs
| 2021-12-24 | Paper |
On the effectiveness of the genetic paradigm for polygonization
Information Processing Letters | 2021-06-16 | Paper |
Mutual Visibility in Graphs
| 2021-05-06 | Paper |
On monophonic position sets in graphs
| 2020-12-18 | Paper |
Gathering robots in graphs: the central role of synchronicity
Theoretical Computer Science | 2020-12-15 | 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 |
Approximation algorithms for decomposing octilinear polygons
Theoretical Computer Science | 2019-06-06 | Paper |
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
Information and Computation | 2018-12-03 | 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 |
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 |
Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
Search Theory | 2017-02-20 | 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 |
Minmax-distance gathering on given meeting points
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Decomposing Octilinear Polygons into Triangles and Rectangles
Lecture Notes in Computer Science | 2015-09-14 | Paper |
Computing on rings by oblivious robots: a unified approach for different tasks
Algorithmica | 2015-09-02 | Paper |
Gathering on rings under the look-compute-move model
Distributed Computing | 2015-02-23 | Paper |
Gathering six oblivious robots on anonymous symmetric rings
Journal of Discrete Algorithms | 2014-04-28 | 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 |
A graph theoretical approach to the shunting problem
| 2013-09-09 | Paper |
Distance-hereditary comparability graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Engineering a new algorithm for distributed shortest paths on dynamic networks
Algorithmica | 2013-05-16 | Paper |
How to gather asynchronous oblivious robots on anonymous rings
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Distance-hereditary comparability graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
Information Sciences | 2012-10-10 | Paper |
Robust algorithms and price of robustness in shunting problems
| 2012-09-28 | Paper |
Dynamic algorithms for recoverable robustness problems
| 2012-09-28 | Paper |
15. Maintenance of multi-level overlay graphs for timetable queries
| 2012-09-28 | Paper |
On the online track assignment problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
Minimize the maximum duty in multi-interface networks
Algorithmica | 2012-04-26 | 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 |
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science | 2010-03-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 |
Recoverable Robust Timetables on Trees
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Treelike comparability graphs
Discrete Applied Mathematics | 2009-06-24 | Paper |
On minimum \(k\)-modal partitions of permutations
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Delay Management Problem: Complexity Results and Robust Algorithms
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On Minimum k-Modal Partitions of Permutations
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Dynamic multi-level overlay graphs for shortest paths
Mathematics in Computer Science | 2008-09-08 | Paper |
Online Bounded Coloring of Permutation and Overlap Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Track assignment
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Networks with small stretch number
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Self-spanner graphs
Discrete Applied Mathematics | 2005-09-28 | Paper |
(\(k,+\))-distance-hereditary graphs
Journal of Discrete Algorithms | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2044923 (Why is no real title available?)
| 2004-02-18 | Paper |
A fully dynamic algorithm for distributed shortest paths.
Theoretical Computer Science | 2003-08-17 | Paper |
Compact-port routing models and applications to distance-hereditary graphs
Journal of Parallel and Distributed Computing | 2002-12-02 | Paper |
scientific article; zbMATH DE number 1696525 (Why is no real title available?)
| 2002-07-22 | Paper |
Static and dynamic low-congested interval routing schemes
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1522931 (Why is no real title available?)
| 2001-07-24 | Paper |
Graphs with bounded induced distance
Discrete Applied Mathematics | 2001-07-23 | Paper |
Low-congested interval routing schemes for hypercubelike networks
| 2000-12-12 | Paper |
scientific article; zbMATH DE number 1512693 (Why is no real title available?)
| 2000-10-03 | Paper |
On the extension of bipartite to parity graphs
Discrete Applied Mathematics | 2000-04-04 | Paper |
Graph classes between parity and distance-hereditary graphs
Discrete Applied Mathematics | 2000-03-22 | Paper |
scientific article; zbMATH DE number 1222095 (Why is no real title available?)
| 1999-05-16 | Paper |
scientific article; zbMATH DE number 1262797 (Why is no real title available?)
| 1999-03-15 | Paper |
On the General Position Number of Mycielskian Graphs
| N/A | Paper |
Lower General Position Sets in Graphs
| N/A | Paper |
Mutual-visibility problems on graphs of diameter two
| N/A | Paper |
