| Publication | Date of Publication | Type |
|---|
Monitoring the edges of product networks using distances
(available as arXiv preprint) | N/A | Paper |
Perturbation results for distance-edge-monitoring numbers
(available as arXiv preprint) | N/A | Paper |
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
(available as arXiv preprint) | N/A | Paper |
The \(g\)-good-neighbor conditional diagnosability of generalized folded hypercubes under the PMC and \(\mathrm{MM}^\ast\) models
Discrete Applied Mathematics | 2026-09-18 | Paper |
| Algorithms and complexity for path covers of temporal DAGs | 2026-05-12 | Paper |
On the g-extra connectivity of graphs
Journal of Computer and System Sciences | 2026-05-08 | Paper |
Approximation algorithm for connected Roman k-dominating set
Journal of Computer and System Sciences | 2026-05-08 | Paper |
Ramsey achievement games on graphs: algorithms and bounds
Acta Informatica | 2026-02-20 | Paper |
On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
Acta Informatica | 2026-02-20 | Paper |
The g-good-neighbor diagnosability of product networks under the PMC model
Information and Computation | 2025-12-15 | Paper |
Greediness is not always a vice: efficient discovery algorithms for assignment problems
Procedia Computer Science | 2025-12-11 | Paper |
Greediness is not always a vice: efficient discovery algorithms for assignment problems
Discrete Applied Mathematics | 2025-11-04 | Paper |
Constructing disjoint Steiner trees in Sierpiński graphs
Fundamenta Informaticae | 2025-10-06 | Paper |
Online knapsack with removal and recourse
Journal of Computer and System Sciences | 2025-09-29 | Paper |
Linear programming of monitoring the links of a fractional weighted network using distance
Information and Computation | 2025-09-09 | Paper |
The distance-edge-monitoring numbers of subdivision graphs
Discrete Applied Mathematics | 2025-06-19 | Paper |
Online unbounded knapsack
Theory of Computing Systems | 2025-04-08 | Paper |
Fault-tolerance in distance-edge-monitoring sets
Acta Informatica | 2025-01-21 | Paper |
Monitoring the edges of product networks using distances
Journal of Computer and System Sciences | 2024-12-27 | Paper |
The number of spanning trees for Sierpiński graphs and data center networks
Information and Computation | 2024-10-08 | Paper |
Perturbation results for distance-edge-monitoring numbers
Fundamenta Informaticae | 2024-08-27 | Paper |
On the distance-edge-monitoring numbers of graphs
Discrete Applied Mathematics | 2024-01-24 | Paper |
Gossiping in vertex-disjoint paths mode in interconnection networks
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Online knapsack with removal and recourse
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs | 2023-10-25 | Paper |
Perpetual maintenance of machines with different urgency requirements
Journal of Computer and System Sciences | 2023-10-24 | Paper |
The \textsc{Red-Blue Separation} problem on graphs
Theoretical Computer Science | 2023-08-08 | Paper |
A Modern View on Stability of Approximation
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
| Ramsey Achievement Games on Graphs : Algorithms and Bounds | 2023-03-06 | Paper |
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020
Algorithmica | 2022-10-06 | Paper |
| The \textsc{red-blue separation} problem on graphs | 2022-08-30 | Paper |
Broadcasting in butterfly and deBruijn networks (extended abstract)
STACS 92 | 2022-08-18 | Paper |
The relationship between gossiping in vertex-disjoint paths mode and bisection width
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Monitoring the edges of a graph using distances
Discrete Applied Mathematics | 2022-08-04 | Paper |
| A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks | 2022-07-01 | Paper |
On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
Algorithmica | 2022-06-28 | Paper |
Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Monitoring the edges of a graph using distances
Lecture Notes in Computer Science | 2020-07-21 | Paper |
| scientific article; zbMATH DE number 7219313 (Why is no real title available?) | 2020-07-10 | Paper |
Beachcombing on strips and islands
Theoretical Computer Science | 2020-01-16 | Paper |
Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
Theoretical Computer Science | 2020-01-16 | Paper |
Vulnerability of super extra edge-connected graphs
Journal of Computer and System Sciences | 2019-11-29 | Paper |
Computing parameters of sequence-based dynamic graphs
Theory of Computing Systems | 2019-06-27 | Paper |
Improved analysis of deterministic load-balancing schemes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Linear search by a pair of distinct-speed robots
Algorithmica | 2019-01-11 | Paper |
Centroidal bases in graphs
Networks | 2018-05-23 | Paper |
| A generic framework for computing parameters of sequence-based dynamic graphs | 2018-04-12 | Paper |
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized and approximation complexity of the detection pair problem in graphs
Journal of Graph Algorithms and Applications | 2017-10-24 | Paper |
| The approximability of the \(p\)-hub center problem with parameterized triangle inequality | 2017-10-23 | 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 |
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Collision-free network exploration
Journal of Computer and System Sciences | 2017-05-26 | Paper |
Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Setting ports in an anonymous network: how to reduce the level of symmetry?
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 |
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters | 2016-06-16 | Paper |
Improved analysis of deterministic load-balancing schemes
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Theoretical Computer Science | 2015-12-11 | Paper |
Gathering of robots on anonymous grids and trees without multiplicity detection
Theoretical Computer Science | 2015-12-10 | Paper |
Efficiently testing T-interval connectivity in dynamic graphs
Lecture Notes in Computer Science | 2015-09-21 | 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 |
Network verification via routing table queries
Journal of Computer and System Sciences | 2014-09-22 | Paper |
Exploration of constantly connected dynamic graphs based on cactuses
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Collision-free network exploration
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Efficient exploration of anonymous undirected graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
Algorithmic Operations Research | 2013-12-11 | Paper |
From balls and bins to points and vertices
Algorithmic Operations Research | 2013-12-11 | Paper |
GATHERING RADIO MESSAGES IN THE PATH
Discrete Mathematics, Algorithms and Applications | 2013-06-11 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science | 2012-08-10 | Paper |
On the size of identifying codes in triangle-free graphs
Discrete Applied Mathematics | 2012-06-18 | Paper |
Derandomizing random walks in undirected graphs using locally fair exploration strategies
Distributed Computing | 2012-02-06 | Paper |
On the complexity of distributed graph coloring with local minimality constraints
Networks | 2010-11-24 | Paper |
On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Theoretical Computer Science | 2010-08-11 | Paper |
Improved approximations for TSP with simple precedence constraints (extended abstract)
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science | 2010-04-06 | Paper |
More efficient periodic traversal in anonymous undirected graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Energy consumption minimization in ad hoc wireless and multi-interface networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Data gathering in wireless networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Euler Tour Lock-In Problem in the Rotor-Router Model
Lecture Notes in Computer Science | 2009-11-19 | 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 |
Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
Information Processing Letters | 2009-07-09 | Paper |
Cost Minimisation in Multi-interface Networks
Lecture Notes in Computer Science | 2009-03-17 | Paper |
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Approximation bounds for Black Hole Search problems
Networks | 2008-12-17 | Paper |
On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science | 2008-11-12 | Paper |
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science | 2008-11-12 | Paper |
On the Complexity of Distributed Greedy Coloring
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Locating and Repairing Faults in a Network with Mobile Agents
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Gathering Asynchronous Oblivious Mobile Robots in a Ring
Algorithms and Computation | 2008-04-24 | Paper |
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science | 2008-03-05 | 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 |
