The SCEAS System
| |||||||

## Search the dblp DataBase
Adrian Kosowski:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Adrian Kosowski, Lukasz Kuszner
**On Greedy Graph Coloring in the Distributed Model.**[Citation Graph (0, 0)][DBLP] Euro-Par, 2006, pp:592-601 [Conf] - 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] - 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] - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
**Fault Tolerant Guarding of Grids.**[Citation Graph (0, 0)][DBLP] ICCSA (1), 2006, pp:161-170 [Conf] - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
**On Bounded Load Routings for Modeling**[Citation Graph (0, 0)][DBLP]*k*-Regular Connection Topologies. ISAAC, 2005, pp:614-623 [Conf] - Adrian Kosowski, Lukasz Kuszner
**Energy Optimisation in Resilient Self-Stabilizing Processes.**[Citation Graph (0, 0)][DBLP] PARELEC, 2006, pp:105-110 [Conf] - 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] - 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] - Adrian Kosowski
**Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2006, pp:130-142 [Conf] - Adrian Kosowski
**An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem.**[Citation Graph (0, 0)][DBLP] SPIRE, 2004, pp:93-100 [Conf] - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski
**An approximation algorithm for maximum P**[Citation Graph (0, 0)][DBLP]_{3}-packing in subcubic graphs. Inf. Process. Lett., 2006, v:99, n:6, pp:230-233 [Journal] - 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] - 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] - Ralf Klasing, Adrian Kosowski, Alfredo Navarra
**Cost Minimisation in Multi-interface Networks.**[Citation Graph (0, 0)][DBLP] NET-COOP, 2007, pp:276-285 [Conf] - 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] - 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] **Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.**[Citation Graph (, )][DBLP]**Application of an Online Judge & Contester System in Academic Tuition.**[Citation Graph (, )][DBLP]**Graph Decomposition for Improving Memoryless Periodic Exploration.**[Citation Graph (, )][DBLP]**Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains.**[Citation Graph (, )][DBLP]**Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring.**[Citation Graph (, )][DBLP]**Robustness of the Rotor-router Mechanism.**[Citation Graph (, )][DBLP]**Synchronization Helps Robots to Detect Black Holes in Directed Graphs.**[Citation Graph (, )][DBLP]**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]**How to meet when you forget: log-space rendezvous in arbitrary graphs.**[Citation Graph (, )][DBLP]**Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.**[Citation Graph (, )][DBLP]**Cost Minimisation in Unbounded Multi-interface Networks.**[Citation Graph (, )][DBLP]**An Improved Strategy for Exploring a Grid Polygon.**[Citation Graph (, )][DBLP]**Connectivity in Multi-interface Networks.**[Citation Graph (, )][DBLP]**Euler Tour Lock-In Problem in the Rotor-Router Model.**[Citation Graph (, )][DBLP]**What Can Be Observed Locally?**[Citation Graph (, )][DBLP]**Forming a connected network in a grid by asynchronous and oblivious robots.**[Citation Graph (, )][DBLP]**Packing Three-Vertex Paths in 2-Connected Cubic Graphs.**[Citation Graph (, )][DBLP]**Forwarding and optical indices of a graph.**[Citation Graph (, )][DBLP]**A note on the strength and minimum color sum of bipartite graphs.**[Citation Graph (, )][DBLP]**Approximating the maximum 2- and 3-edge-colorable subgraph problems.**[Citation Graph (, )][DBLP]**Mixed graph edge coloring.**[Citation Graph (, )][DBLP]**The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.**[Citation Graph (, )][DBLP]
Search in 0.098secs, Finished in 0.100secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |