 | 2009 |
|---|
| 33 |       | Cyril Gavoille,
Adrian Kosowski,
Marcin Markiewicz:
What Can Be Observed Locally?
DISC 2009: 243-257 |
| 32 | | Evangelos Bampas,
Leszek Gasieniec,
Nicolas Hanusse,
David Ilcinkas,
Ralf Klasing,
Adrian Kosowski:
Euler Tour Lock-In Problem in the Rotor-Router Model.
DISC 2009: 423-435 |
| 31 | | Colin Cooper,
David Ilcinkas,
Ralf Klasing,
Adrian Kosowski:
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.
ICALP (2) 2009: 411-422 |
| 30 | | Adrian Kosowski,
Alfredo Navarra:
Graph Decomposition for Improving Memoryless Periodic Exploration.
MFCS 2009: 501-512 |
| 29 | | Adrian Kosowski:
A note on the strength and minimum color sum of bipartite graphs.
Discrete Applied Mathematics 157(11): 2552-2554 (2009) |
| 28 | | Adrian Kosowski:
Forwarding and optical indices of a graph.
Discrete Applied Mathematics 157(2): 321-329 (2009) |
| 27 | | Krzysztof Kosowski,
Karol Tucki,
Adrian Kosowski:
Turbine stage design aided by artificial intelligence methods.
Expert Syst. Appl. 36(9): 11536-11542 (2009) |
| 26 | | Ralf Klasing,
Adrian Kosowski,
Alfredo Navarra:
Cost minimization in wireless networks with a bounded and unbounded number of interfaces.
Networks 53(3): 266-275 (2009) |
| 25 | | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability.
Theor. Comput. Sci. 410(21-23): 1970-1981 (2009) |
| 2008 |
|---|
| 24 | | Ralf Klasing,
Adrian Kosowski,
Alfredo Navarra:
Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.
OPODIS 2008: 446-462 |
| 23 | | Adrian Kosowski,
Alfredo Navarra,
Maria Cristina Pinotti:
Connectivity in Multi-interface Networks.
TGC 2008: 157-170 |
| 22 |  | Adrian Kosowski,
Pawel Zylinski:
Packing Three-Vertex Paths in 2-Connected Cubic Graphs.
Ars Comb. 89: (2008) |
| 21 | | Hanna Furmanczyk,
Adrian Kosowski,
Pawel Zylinski:
A note on mixed tree coloring.
Inf. Process. Lett. 106(4): 133-135 (2008) |
| 20 | | Adrian Kosowski:
The maximum edge-disjoint paths problem in complete graphs.
Theor. Comput. Sci. 399(1-2): 128-140 (2008) |
| 2007 |
|---|
| 19 | | Cyril Gavoille,
Ralf Klasing,
Adrian Kosowski,
Alfredo Navarra:
On the Complexity of Distributed Greedy Coloring.
DISC 2007: 482-484 |
| 18 | | Adrian Kosowski,
Michal Malafiejski,
Tomasz Noinski:
Application of an Online Judge & Contester System in Academic Tuition.
ICWL 2007: 343-354 |
| 17 | | Ralf Klasing,
Adrian Kosowski,
Alfredo Navarra:
Cost Minimisation in Multi-interface Networks.
NET-COOP 2007: 276-285 |
| 16 | | Hanna Furmanczyk,
Adrian Kosowski,
Pawel Zylinski:
Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.
PPAM 2007: 1001-1008 |
| 15 | | Adrian Kosowski,
Alfredo Navarra:
Cost Minimisation in Unbounded Multi-interface Networks.
PPAM 2007: 1039-1047 |
| 14 | | Pierre Fraigniaud,
Cyril Gavoille,
Adrian Kosowski,
Emmanuelle Lebhar,
Zvi Lotker:
Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier.
SPAA 2007: 1-7 |
| 13 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Cooperative mobile guards in grids.
Comput. Geom. 37(2): 59-71 (2007) |
| 12 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Packing [1, Delta] -factors in graphs of small degree.
J. Comb. Optim. 14(1): 63-86 (2007) |
| 2006 |
|---|
| 11 | | Adrian Kosowski,
Lukasz Kuszner:
On Greedy Graph Coloring in the Distributed Model.
Euro-Par 2006: 592-601 |
| 10 | | Adrian Kosowski,
Lukasz Kuszner:
Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees.
ICAISC 2006: 1150-1159 |
| 9 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.
ICCSA (1) 2006: 141-150 |
| 8 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Fault Tolerant Guarding of Grids.
ICCSA (1) 2006: 161-170 |
| 7 | | Adrian Kosowski,
Lukasz Kuszner:
Energy Optimisation in Resilient Self-Stabilizing Processes.
PARELEC 2006: 105-110 |
| 6 | | Adrian Kosowski:
Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.
SIROCCO 2006: 130-142 |
| 5 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
An approximation algorithm for maximum P3-packing in subcubic graphs.
Inf. Process. Lett. 99(6): 230-233 (2006) |
| 2005 |
|---|
| 4 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
On Bounded Load Routings for Modeling k-Regular Connection Topologies.
ISAAC 2005: 614-623 |
| 3 | | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Parallel Processing Subsystems with Redundancy in a Distributed Environment.
PPAM 2005: 1002-1009 |
| 2 | | Adrian Kosowski,
Lukasz Kuszner:
A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves.
PPAM 2005: 75-82 |
| 2004 |
|---|
| 1 | | Adrian Kosowski:
An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.
SPIRE 2004: 93-100 |
