The following pages link to Adrian Kosowski (Q269495):
Displayed 50 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Maximum matching in multi-interface networks (Q393046) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Position discovery for a system of bouncing robots (Q498402) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Synchronous black hole search in directed graphs (Q719316) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Cooperative mobile guards in grids (Q876501) (← links)
- Rendezvous of heterogeneous mobile agents in edge-weighted networks (Q896142) (← links)
- The maximum edge-disjoint paths problem in complete graphs (Q930909) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- A note on the strength and minimum color sum of bipartite graphs (Q967294) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
- Forwarding and optical indices of a graph (Q1003676) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- Patrolling trees with mobile robots (Q1631946) (← links)
- Sublinear-space distance labeling using hubs (Q1660937) (← links)
- Limit behavior of the multi-agent rotor-router system (Q1664136) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Robust detection in leak-prone population protocols (Q1694427) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Time versus space trade-offs for rendezvous in trees (Q2251152) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Fast collaborative graph exploration (Q2347797) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- Collision-free network exploration (Q2396820) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Improved Analysis of Deterministic Load-Balancing Schemes (Q2796265) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- (Q2965489) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- (Q3070345) (← links)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Q3092272) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (Q3167048) (← links)
- Maximum Matching in Multi-Interface Networks (Q3167345) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)