Dariusz Dereniowski

Lukasz Kuszner

CoRR, April, 2025

Discrete evacuation in graphs with multiple exits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

Noisy (Binary) Searching: Simple, Fast and Correct.

[BibT_eX]

[DOI]

Aleksander Lukasiewicz

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Energy Constrained Depth First Search.

[BibT_eX]

[DOI]

Algorithmica, December, 2024

Low-degree spanning trees of 2-edge-connected graphs in linear time.

[BibT_eX]

[DOI]

CoRR, 2024

On multidimensional generalization of binary search.

[BibT_eX]

[DOI]

Przemyslaw Gordinowicz

Karolina Wróbel

CoRR, 2024

Searching in trees with monotonic query times.

[BibT_eX]

[DOI]

Izajasz P. Wrosz

CoRR, 2024

2023

Edge and Pair Queries-Random Graphs and Complexity.

[BibT_eX]

[DOI]

Przemyslaw Gordinowicz

Pawel Pralat

Electron. J. Comb., 2023

2022

Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times.

[BibT_eX]

[DOI]

Izajasz P. Wrosz

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

On the Characteristic Graph of a Discrete Symmetric Channel.

[BibT_eX]

[DOI]

Marcin Jurkiewicz

IEEE Trans. Inf. Theory, 2021

Gossiping by energy-constrained mobile agents in tree networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Noisy searching: simple, fast and correct.

[BibT_eX]

[DOI]

Aleksander Lukasiewicz

CoRR, 2021

An Efficient Noisy Binary Search in Graphs via Median Approximation.

[BibT_eX]

[DOI]

Aleksander Lukasiewicz

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

The Complexity of Bicriteria Tree-Depth.

[BibT_eX]

[DOI]

Dorota Osula

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Shared processor scheduling of multiprocessor jobs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

2019

Finding small-width connected path decompositions in polynomial time.

[BibT_eX]

[DOI]

Dorota Osula

Pawel Rzazewski

Theor. Comput. Sci., 2019

Cops, a fast robber and defensive domination on interval graphs.

[BibT_eX]

[DOI]

Tomas Gavenciak

Jan Kratochvíl

Theor. Comput. Sci., 2019

On Tradeoffs Between Width- and Fill-like Graph Parameters.

[BibT_eX]

[DOI]

Adam Stanski

Theory Comput. Syst., 2019

Clearing directed subgraphs by mobile agents: Variations on covering with paths.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

A Framework for Searching in Graphs in the Presence of Errors.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Building a Nest by an Automaton.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Searching by Heterogeneous Agents.

[BibT_eX]

[DOI]

Lukasz Kuszner

Robert Ostrowski

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

Shared processor scheduling.

[BibT_eX]

[DOI]

J. Sched., 2018

Collaborative Exploration of Trees by Energy-Constrained Mobile Robots.

[BibT_eX]

[DOI]

Christina Karousatou

Theory Comput. Syst., 2018

Brief Announcement: Energy Constrained Depth First Search.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Shared multi-processor scheduling.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

On-line Search in Two-Dimensional Environment.

[BibT_eX]

[DOI]

Dorota Urbanska

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Topology recognition and leader election in colored networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Normal-form preemption sequences for an open problem in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., 2016

Distributed Searching of Partial Grids.

[BibT_eX]

[DOI]

Dorota Urbanska

CoRR, 2016

Distributed Evacuation in Graphs with Multiple Exits.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

2015

The searchlight problem for road networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Distinguishing views in symmetric networks: A tight lower bound.

[BibT_eX]

[DOI]

Adrian Kosowski

Dominik Pajak

Theor. Comput. Sci., 2015

The complexity of minimum-length path decompositions.

[BibT_eX]

[DOI]

Yori Zwols

J. Comput. Syst. Sci., 2015

Zero-visibility cops and robber and the pathwidth of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Distributed graph searching with a sense of direction.

[BibT_eX]

[DOI]

Lukasz Kuszner

Distributed Comput., 2015

Structural Properties of an Open Problem in Preemptive Scheduling.

[BibT_eX]

[DOI]

CoRR, 2015

Collaborative Exploration by Energy-Constrained Mobile Robots.

[BibT_eX]

[DOI]

Christina Karousatou

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Brushing with additional cleaning restrictions.

[BibT_eX]

[DOI]

Pawel Pralat

Theor. Comput. Sci., 2014

Leader election for anonymous asynchronous agents in arbitrary networks.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Bounds on the Cover Time of Parallel Rotor Walks.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

Collision-Free Network Exploration.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Complexity of Zero-Visibility Cops and Robber.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

On minimum cost edge searching.

[BibT_eX]

[DOI]

Danny Dyer

Theor. Comput. Sci., 2013

Optimal edge-coloring with edge rate constraints.

[BibT_eX]

[DOI]

Networks, 2013

On-line ranking of split graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Three-fast-searchable graphs.

[BibT_eX]

[DOI]

Öznur Yasar Diner

Danny Dyer

Discret. Appl. Math., 2013

Minimum length path decompositions

[BibT_eX]

[DOI]

Yori Zwols

CoRR, 2013

Fast Collaborative Graph Exploration.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Zero-Visibility Cops and Robber Game on a Graph.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Approximate search strategies for weighted trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Routing equal-size messages on a slotted ring.

[BibT_eX]

[DOI]

J. Sched., 2012

An efficient algorithm for finding ideal schedules.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Acta Informatica, 2012

2011

The complexity of node blocking for dags.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

From Pathwidth to Connected Pathwidth.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010

Phutball is PSPACE-hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.

[BibT_eX]

[DOI]

J. Sched., 2010

Drawing Maps with Advice.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Connected Searching of Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Maximum vertex occupation time and inert fugitive: Recontamination does help.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

2008

A Note on Compact and Compact Circular Edge-colorings of Graphs.

[BibT_eX]

[DOI]

Adam Nadolski

Discret. Math. Theor. Comput. Sci., 2008

Edge ranking and searching in partial orders.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

The Complexity of List Ranking of Trees.

[BibT_eX]

Ars Comb., 2008

2007

Easy and hard instances of arc ranking in directed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Vertex rankings of chordal graphs and weighted trees.

[BibT_eX]

[DOI]

Adam Nadolski

Inf. Process. Lett., 2006

Efficient Parallel Query Processing by Graph Ranking.

[BibT_eX]

[DOI]

Marek Kubale

Fundam. Informaticae, 2006

Edge ranking of weighted trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Parallel Query Processing and Edge Ranking of Graphs.

[BibT_eX]

[DOI]

Marek Kubale

Proceedings of the Parallel Processing and Applied Mathematics, 2005

2003

Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.

[BibT_eX]

[DOI]