The following pages link to Adrian Kosowski (Q269495):
Displayed 37 items.
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Q3459874) (← links)
- On the Complexity of Distributed Greedy Coloring (Q3523231) (← links)
- (Q3576691) (← links)
- Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains (Q3586092) (← links)
- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs (Q3613649) (← links)
- Cost Minimisation in Multi-interface Networks (Q3614996) (← links)
- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (Q3638110) (← links)
- What Can Be Observed Locally? (Q3646229) (← links)
- Euler Tour Lock-In Problem in the Rotor-Router Model (Q3646241) (← links)
- Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons (Q4575838) (← links)
- (Q4608065) (← links)
- (Q4610034) (← links)
- Improved Analysis of Deterministic Load-Balancing Schemes (Q4629980) (← links)
- (Q4636644) (← links)
- Position Discovery for a System of Bouncing Robots (Q4909422) (← links)
- (Q5092347) (← links)
- (Q5111415) (← links)
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling (Q5145219) (← links)
- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router (Q5167868) (← links)
- The multi-agent rotor-router on the ring (Q5176115) (← links)
- Locating a target with an agent guided by unreliable local advice (Q5176212) (← links)
- How to meet when you forget (Q5176220) (← links)
- Cost minimization in wireless networks with a bounded and unbounded number of interfaces (Q5191147) (← links)
- Brief Announcement (Q5197713) (← links)
- Universal protocols for information dissemination using emergent signals (Q5230279) (← links)
- Fast Collaborative Graph Exploration (Q5327462) (← links)
- Brief Announcement (Q5361914) (← links)
- String Processing and Information Retrieval (Q5393943) (← links)
- Collision-Free Network Exploration (Q5405053) (← links)
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs (Q5496166) (← links)
- Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks (Q5496167) (← links)
- An Efficient Algorithm for Mobile Guarded Guards in Simple Grids (Q5505331) (← links)
- Fault Tolerant Guarding of Grids (Q5505335) (← links)
- Faster Walks in Graphs: A <i>Õ</i>(<i>n</i><sup>2</sup>) Time-Space Trade-off for Undirected <i>s-t</i> Connectivity (Q5741843) (← links)
- Algorithms and Computation (Q5897894) (← links)
- Parallel Processing and Applied Mathematics (Q5899119) (← links)
- Parallel Processing and Applied Mathematics (Q5899148) (← links)