According to our database1, Adrian Kosowski authored at least 123 papers between 2004 and 2018.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2018
Exact Distance Oracles Using Hopsets.
CoRR, 2018

CoRR, 2018

Universal protocols for information dissemination using emergent signals.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Ergodic Effects in Token Circulation.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Brief Announcement: Population Protocols Are Fast.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Collision-free network exploration.
J. Comput. Syst. Sci., 2017

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Distributed Computing, 2017

Spreading a Confirmed Rumor: A Case for Oscillatory Dynamics.
CoRR, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.
CoRR, 2017

Robust Detection in Leak-Prone Population Protocols.
CoRR, 2017

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Algorithmica, 2017

Robustness of the Rotor-Router Mechanism.
Algorithmica, 2017

Multiple Random Walks on Paths and Grids.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robust Detection in Leak-Prone Population Protocols.
Proceedings of the DNA Computing and Molecular Programming - 23rd International Conference, 2017

2016
Bounds on the cover time of parallel rotor walks.
J. Comput. Syst. Sci., 2016

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons.
CoRR, 2016

Ergodic Effects in Token Circulation.
CoRR, 2016

Sublinear-Space Distance Labeling Using Hubs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Sublinear-Space Distance Labeling Using Hubs.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Patrolling Trees with Mobile Robots.
Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

Local Conflict Coloring.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

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

Fast collaborative graph exploration.
Inf. Comput., 2015

Position discovery for a system of bouncing robots.
Inf. Comput., 2015

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Computing, 2015

Even Simpler Distance Labeling for (Sparse) Graphs.
CoRR, 2015

Local Conflict Coloring.
CoRR, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
CoRR, 2015

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Algorithmica, 2015

Limit Behavior of the Multi-agent Rotor-Router System.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Improved Analysis of Deterministic Load-Balancing Schemes.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Time versus space trade-offs for rendezvous in trees.
Distributed Computing, 2014

Distinguishing Views in Symmetric Networks: A Tight Lower Bound.
CoRR, 2014

Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks.
CoRR, 2014

Lock-in Problem for Parallel Rotor-router Walks.
CoRR, 2014

Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy.
CoRR, 2014

Rendezvous of Distance-aware Mobile Agents in Unknown Graphs.
CoRR, 2014

Bounds on the Cover Time of Parallel Rotor Walks.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks.
Proceedings of the Structural Information and Communication Complexity, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.
Proceedings of the Structural Information and Communication Complexity, 2014

Collision-Free Network Exploration.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Maximum matching in multi-interface networks.
Theor. Comput. Sci., 2013

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.
Theory Comput. Syst., 2013

Lower Bounds on the Communication Complexity of Binary Local Quantum Measurement Simulation.
CoRR, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

A Õ (n2) Time-Space Trade-off for Undirected s-t Connectivity.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Fast Collaborative Graph Exploration.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network.
, 2013

2012
How to meet when you forget: log-space rendezvous in arbitrary graphs.
Distributed Computing, 2012

On the size of identifying codes in triangle-free graphs.
Discrete Applied Mathematics, 2012

A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity
CoRR, 2012

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid.
Computing and Informatics, 2012

Graph Decomposition for Memoryless Periodic Exploration.
Algorithmica, 2012

Position Discovery for a System of Bouncing Robots.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Time vs. space trade-offs for rendezvous in trees.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Maximum Matching in Multi-Interface Networks.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Synchronous black hole search in directed graphs.
Theor. Comput. Sci., 2011

Review of SIROCCO 2011.
SIGACT News, 2011

Derandomizing random walks in undirected graphs using locally fair exploration strategies.
Distributed Computing, 2011

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
CoRR, 2011

Synchronous Rendezvous for Location-Aware Agents.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Exploiting multi-interface networks: Connectivity and Cheapest Paths.
Wireless Networks, 2010

Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring.
Theor. Comput. Sci., 2010

On the size of identifying codes in triangle-free graphs
CoRR, 2010

Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock?
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

How to meet when you forget: log-space rendezvous in arbitrary graphs.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Universal augmentation schemes for network navigability.
Theor. Comput. Sci., 2009

Cost minimization in wireless networks with a bounded and unbounded number of interfaces.
Networks, 2009

On the complexity of distributed graph coloring with local minimality constraints.
Networks, 2009

Turbine stage design aided by artificial intelligence methods.
Expert Syst. Appl., 2009

The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.
Discrete Mathematics, 2009

Mixed graph edge coloring.
Discrete Mathematics, 2009

Approximating the maximum 2- and 3-edge-colorable subgraph problems.
Discrete Applied Mathematics, 2009

A note on the strength and minimum color sum of bipartite graphs.
Discrete Applied Mathematics, 2009

Forwarding and optical indices of a graph.
Discrete Applied Mathematics, 2009

What Can Be Observed Locally?
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Euler Tour Lock-In Problem in the Rotor-Router Model.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

An Improved Strategy for Exploring a Grid Polygon.
Proceedings of the Structural Information and Communication Complexity, 2009

Synchronization Helps Robots to Detect Black Holes in Directed Graphs.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Robustness of the Rotor-router Mechanism.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Graph Decomposition for Improving Memoryless Periodic Exploration.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Forming a connected network in a grid by asynchronous and oblivious robots.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
The maximum edge-disjoint paths problem in complete graphs.
Theor. Comput. Sci., 2008

A note on mixed tree coloring.
Inf. Process. Lett., 2008

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph.
Graphs and Combinatorics, 2008

Packing Three-Vertex Paths in 2-Connected Cubic Graphs.
Ars Comb., 2008

Connectivity in Multi-interface Networks.
Proceedings of the Trustworthy Global Computing, 4th International Symposium, 2008

Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Packing [1, Delta] -factors in graphs of small degree.
J. Comb. Optim., 2007

Cooperative mobile guards in grids.
Comput. Geom., 2007

On the Complexity of Distributed Greedy Coloring.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Cost Minimisation in Unbounded Multi-interface Networks.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

Cost Minimisation in Multi-interface Networks.
Proceedings of the Network Control and Optimization, 2007

Application of an Online Judge & Contester System in Academic Tuition.
Proceedings of the Advances in Web Based Learning, 2007

2006
An approximation algorithm for maximum P3-packing in subcubic graphs.
Inf. Process. Lett., 2006

Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.
Proceedings of the Structural Information and Communication Complexity, 2006

Energy Optimisation in Resilient Self-Stabilizing Processes.
Proceedings of the Fifth International Conference on Parallel Computing in Electrical Engineering (PARELEC 2006), 2006

Fault Tolerant Guarding of Grids.
Proceedings of the Computational Science and Its Applications, 2006

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.
Proceedings of the Computational Science and Its Applications, 2006

Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees.
Proceedings of the Artificial Intelligence and Soft Computing, 2006

On Greedy Graph Coloring in the Distributed Model.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
Parallel Processing Subsystems with Redundancy in a Distributed Environment.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

On Bounded Load Routings for Modeling k-Regular Connection Topologies.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.
Proceedings of the String Processing and Information Retrieval, 2004