2024
Energy Constrained Depth First Search.
Algorithmica, December, 2024
Low-degree spanning trees of 2-edge-connected graphs in linear time.
CoRR, 2024
On multidimensional generalization of binary search.
CoRR, 2024
Searching in trees with monotonic query times.
CoRR, 2024
2023
The complexity of bicriteria tree-depth.
Theor. Comput. Sci., February, 2023
Edge and Pair Queries-Random Graphs and Complexity.
Electron. J. Comb., 2023
2022
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
On the Characteristic Graph of a Discrete Symmetric Channel.
IEEE Trans. Inf. Theory, 2021
Gossiping by energy-constrained mobile agents in tree networks.
Theor. Comput. Sci., 2021
Searching by heterogeneous agents.
J. Comput. Syst. Sci., 2021
Noisy searching: simple, fast and correct.
CoRR, 2021
Building a Nest by an Automaton.
Algorithmica, 2021
An Efficient Noisy Binary Search in Graphs via Median Approximation.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
2020
Shared processor scheduling of multiprocessor jobs.
Eur. J. Oper. Res., 2020
2019
Finding small-width connected path decompositions in polynomial time.
Theor. Comput. Sci., 2019
Cops, a fast robber and defensive domination on interval graphs.
Theor. Comput. Sci., 2019
On Tradeoffs Between Width- and Fill-like Graph Parameters.
Theory Comput. Syst., 2019
On-line Search in Two-Dimensional Environment.
Theory Comput. Syst., 2019
Clearing directed subgraphs by mobile agents: Variations on covering with paths.
J. Comput. Syst. Sci., 2019
A Framework for Searching in Graphs in the Presence of Errors.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
2018
Shared processor scheduling.
J. Sched., 2018
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots.
Theory Comput. Syst., 2018
Brief Announcement: Energy Constrained Depth First Search.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Collision-free network exploration.
J. Comput. Syst. Sci., 2017
Shared multi-processor scheduling.
Eur. J. Oper. Res., 2017
Approximation Strategies for Generalized Binary Search in Weighted Trees.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots.
Proceedings of the Algorithms for Sensor Systems, 2017
2016
Topology recognition and leader election in colored networks.
Theor. Comput. Sci., 2016
Normal-form preemption sequences for an open problem in scheduling theory.
J. Sched., 2016
Bounds on the cover time of parallel rotor walks.
J. Comput. Syst. Sci., 2016
Distributed Searching of Partial Grids.
CoRR, 2016
Distributed Evacuation in Graphs with Multiple Exits.
Proceedings of the Structural Information and Communication Complexity, 2016
2015
The searchlight problem for road networks.
Theor. Comput. Sci., 2015
Distinguishing views in symmetric networks: A tight lower bound.
Theor. Comput. Sci., 2015
Rendezvous of heterogeneous mobile agents in edge-weighted networks.
Theor. Comput. Sci., 2015
The complexity of zero-visibility cops and robber.
Theor. Comput. Sci., 2015
The complexity of minimum-length path decompositions.
J. Comput. Syst. Sci., 2015
Zero-visibility cops and robber and the pathwidth of a graph.
J. Comb. Optim., 2015
Fast collaborative graph exploration.
Inf. Comput., 2015
Distributed graph searching with a sense of direction.
Distributed Comput., 2015
Structural Properties of an Open Problem in Preemptive Scheduling.
CoRR, 2015
Collaborative Exploration by Energy-Constrained Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2015
2014
Brushing with additional cleaning restrictions.
Theor. Comput. Sci., 2014
Leader election for anonymous asynchronous agents in arbitrary networks.
Distributed Comput., 2014
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.
Proceedings of the Structural Information and Communication Complexity, 2014
2013
On minimum cost edge searching.
Theor. Comput. Sci., 2013
Optimal edge-coloring with edge rate constraints.
Networks, 2013
On-line ranking of split graphs.
Discret. Math. Theor. Comput. Sci., 2013
Three-fast-searchable graphs.
Discret. Appl. Math., 2013
Minimum length path decompositions
CoRR, 2013
Zero-Visibility Cops and Robber Game on a Graph.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
Approximate search strategies for weighted trees.
Theor. Comput. Sci., 2012
From Pathwidth to Connected Pathwidth.
SIAM J. Discret. Math., 2012
Routing equal-size messages on a slotted ring.
J. Sched., 2012
Drawing maps with advice.
J. Parallel Distributed Comput., 2012
An efficient algorithm for finding ideal schedules.
Acta Informatica, 2012
2011
Connected searching of weighted trees.
Theor. Comput. Sci., 2011
The complexity of node blocking for dags.
J. Comb. Theory A, 2011
2010
Theor. Comput. Sci., 2010
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.
J. Sched., 2010
2009
Maximum vertex occupation time and inert fugitive: Recontamination does help.
Inf. Process. Lett., 2009
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.
Discuss. Math. Graph Theory, 2009
2008
A Note on Compact and Compact Circular Edge-colorings of Graphs.
Discret. Math. Theor. Comput. Sci., 2008
Edge ranking and searching in partial orders.
Discret. Appl. Math., 2008
The Complexity of List Ranking of Trees.
Ars Comb., 2008
2007
Easy and hard instances of arc ranking in directed graphs.
Discret. Appl. Math., 2007
2006
Vertex rankings of chordal graphs and weighted trees.
Inf. Process. Lett., 2006
Efficient Parallel Query Processing by Graph Ranking.
Fundam. Informaticae, 2006
Edge ranking of weighted trees.
Discret. Appl. Math., 2006
2005
Parallel Query Processing and Edge Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2005
2003
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2003
