![]() | ![]() |
| 2012 | ||
|---|---|---|
| 60 | Adrian Kosowski, Alfredo Navarra: Graph Decomposition for Memoryless Periodic Exploration. Algorithmica 63(1-2): 26-38 (2012) | |
| 59 | Adrian Kosowski: A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity CoRR abs/1204.1136: (2012) | |
| 58 | Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs. Discrete Applied Mathematics 160(10-11): 1532-1546 (2012) | |
| 57 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Computing 25(2): 165-178 (2012) | |
| 2011 | ||
| 56 | Adrian Kosowski, Masafumi Yamashita: Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings Springer 2011 | |
| 55 | Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin: Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459 | |
| 54 | Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis: Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. ESA 2011: 701-712 | |
| 53 | Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan: Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power CoRR abs/1109.6534: (2011) | |
| 52 | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Computing 24(2): 91-99 (2011) | |
| 51 | Adrian Kosowski, Dominik Pajak, Zuzanna Stamirowska: Review of SIROCCO 2011. SIGACT News 42(4): 92-95 (2011) | |
| 50 | Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Synchronous black hole search in directed graphs. Theor. Comput. Sci. 412(41): 5752-5759 (2011) | |
| 2010 | ||
| 49 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS 2010: 294-305 | |
| 48 | Jérémie Chalopin, Shantanu Das, Adrian Kosowski: Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134 | |
| 47 | Nicolas Hanusse, David Ilcinkas, Adrian Kosowski, Nicolas Nisse: Locating a target with an agent guided by unreliable local advice: how to beat the random walk when you have a clock? PODC 2010: 355-364 | |
| 46 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC 2010: 450-459 | |
| 45 | Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs CoRR abs/1010.5975: (2010) | |
| 44 | Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411(34-36): 3235-3246 (2010) | |
| 43 | Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Exploiting multi-interface networks: Connectivity and Cheapest Paths. Wireless Networks 16(4): 1063-1073 (2010) | |
| 2009 | ||
| 42 | Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz: What Can Be Observed Locally? DISC 2009: 243-257 | |
| 41 | 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 | |
| 40 | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422 | |
| 39 | Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski: Forming a connected network in a grid by asynchronous and oblivious robots. IMCSIT 2009: 583-588 | |
| 38 | Adrian Kosowski, Alfredo Navarra: Graph Decomposition for Improving Memoryless Periodic Exploration. MFCS 2009: 501-512 | |
| 37 | Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik: Robustness of the Rotor-router Mechanism. OPODIS 2009: 345-358 | |
| 36 | Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Synchronization Helps Robots to Detect Black Holes in Directed Graphs. OPODIS 2009: 86-98 | |
| 35 | Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009: 222-236 | |
| 34 | Adrian Kosowski: A note on the strength and minimum color sum of bipartite graphs. Discrete Applied Mathematics 157(11): 2552-2554 (2009) | |
| 33 | Adrian Kosowski: Approximating the maximum 2- and 3-edge-colorable subgraph problems. Discrete Applied Mathematics 157(17): 3593-3600 (2009) | |
| 32 | Adrian Kosowski: Forwarding and optical indices of a graph. Discrete Applied Mathematics 157(2): 321-329 (2009) | |
| 31 | Robert Janczewski, Adrian Kosowski, Michal Malafiejski: The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discrete Mathematics 309(10): 3270-3279 (2009) | |
| 30 | Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski: Mixed graph edge coloring. Discrete Mathematics 309(12): 4027-4036 (2009) | |
| 29 | Krzysztof Kosowski, Karol Tucki, Adrian Kosowski: Turbine stage design aided by artificial intelligence methods. Expert Syst. Appl. 36(9): 11536-11542 (2009) | |
| 28 | 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) | |
| 27 | Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner, Alfredo Navarra: On the complexity of distributed graph coloring with local minimality constraints. Networks 54(1): 12-19 (2009) | |
| 26 | 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 | ||
| 25 | Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462 | |
| 24 | Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Connectivity in Multi-interface Networks. TGC 2008: 157-170 | |
| 23 | Adrian Kosowski, Pawel Zylinski: Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Comb. 89: (2008) | |
| 22 | Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. Graphs and Combinatorics 24(5): 461-468 (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 | |
Colors in the list of coauthors
Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page