Search the dblp DataBase

Publications of Author

1. Adrian Kosowski, Lukasz Kuszner
   On Greedy Graph Coloring in the Distributed Model. [Citation Graph (0, 0)][DBLP]
   Euro-Par, 2006, pp:592-601 [Conf]
   
2. Adrian Kosowski, Lukasz Kuszner
   Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees. [Citation Graph (0, 0)][DBLP]
   ICAISC, 2006, pp:1150-1159 [Conf]
   
3. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
   An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. [Citation Graph (0, 0)][DBLP]
   ICCSA (1), 2006, pp:141-150 [Conf]
   
4. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
   Fault Tolerant Guarding of Grids. [Citation Graph (0, 0)][DBLP]
   ICCSA (1), 2006, pp:161-170 [Conf]
   
5. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
   On Bounded Load Routings for Modeling k-Regular Connection Topologies. [Citation Graph (0, 0)][DBLP]
   ISAAC, 2005, pp:614-623 [Conf]
   
6. Adrian Kosowski, Lukasz Kuszner
   Energy Optimisation in Resilient Self-Stabilizing Processes. [Citation Graph (0, 0)][DBLP]
   PARELEC, 2006, pp:105-110 [Conf]
   
7. Adrian Kosowski, Lukasz Kuszner
   A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. [Citation Graph (0, 0)][DBLP]
   PPAM, 2005, pp:75-82 [Conf]
   
8. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
   Parallel Processing Subsystems with Redundancy in a Distributed Environment. [Citation Graph (0, 0)][DBLP]
   PPAM, 2005, pp:1002-1009 [Conf]
   
9. Adrian Kosowski
   Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2006, pp:130-142 [Conf]
   
10. Adrian Kosowski
    An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:93-100 [Conf]
    
11. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
    An approximation algorithm for maximum P₃-packing in subcubic graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:6, pp:230-233 [Journal]
    
12. Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
    Universal augmentation schemes for network navigability: overcoming the sqrt(n)-barrier. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:1-7 [Conf]
    
13. Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra
    On the Complexity of Distributed Greedy Coloring. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:482-484 [Conf]
    
14. Ralf Klasing, Adrian Kosowski, Alfredo Navarra
    Cost Minimisation in Multi-interface Networks. [Citation Graph (0, 0)][DBLP]
    NET-COOP, 2007, pp:276-285 [Conf]
    
15. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
    Cooperative mobile guards in grids. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:2, pp:59-71 [Journal]
    
16. Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
    Packing [1, Delta] -factors in graphs of small degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:1, pp:63-86 [Journal]
    
17. 
    Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. [Citation Graph (, )][DBLP]
    
    
18. 
    Application of an Online Judge & Contester System in Academic Tuition. [Citation Graph (, )][DBLP]
    
    
19. 
    Graph Decomposition for Improving Memoryless Periodic Exploration. [Citation Graph (, )][DBLP]
    
    
20. 
    Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. [Citation Graph (, )][DBLP]
    
    
21. 
    Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. [Citation Graph (, )][DBLP]
    
    
22. 
    Robustness of the Rotor-router Mechanism. [Citation Graph (, )][DBLP]
    
    
23. 
    Synchronization Helps Robots to Detect Black Holes in Directed Graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? [Citation Graph (, )][DBLP]
    
    
25. 
    How to meet when you forget: log-space rendezvous in arbitrary graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    Cost Minimisation in Unbounded Multi-interface Networks. [Citation Graph (, )][DBLP]
    
    
28. 
    An Improved Strategy for Exploring a Grid Polygon. [Citation Graph (, )][DBLP]
    
    
29. 
    Connectivity in Multi-interface Networks. [Citation Graph (, )][DBLP]
    
    
30. 
    Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]
    
    
31. 
    What Can Be Observed Locally? [Citation Graph (, )][DBLP]
    
    
32. 
    Forming a connected network in a grid by asynchronous and oblivious robots. [Citation Graph (, )][DBLP]
    
    
33. 
    Packing Three-Vertex Paths in 2-Connected Cubic Graphs. [Citation Graph (, )][DBLP]
    
    
34. 
    Forwarding and optical indices of a graph. [Citation Graph (, )][DBLP]
    
    
35. 
    A note on the strength and minimum color sum of bipartite graphs. [Citation Graph (, )][DBLP]
    
    
36. 
    Approximating the maximum 2- and 3-edge-colorable subgraph problems. [Citation Graph (, )][DBLP]
    
    
37. 
    Mixed graph edge coloring. [Citation Graph (, )][DBLP]
    
    
38. 
    The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. [Citation Graph (, )][DBLP]