Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Adrian Kosowski
2010 – today
- 2013
[j26]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. Theory Comput. Syst. 52(2): 179-199 (2013)- [c38]Adrian Kosowski: A Õ (n2) Time-Space Trade-off for Undirected s-t Connectivity. SODA 2013: 1873-1883
- 2012
- [j25]Adrian Kosowski, Alfredo Navarra: Graph Decomposition for Memoryless Periodic Exploration. Algorithmica 63(1-2): 26-38 (2012)
- [j24]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski: A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. Computing and Informatics 31(2): 349-369 (2012)
- [j23]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)
- [j22]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)
- [c37]Adrian Kosowski, Alfredo Navarra, Dominik Pajak, Maria Cristina Pinotti: Maximum Matching in Multi-Interface Networks. COCOA 2012: 13-24
- [c36]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan: k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) 2012: 610-622
- [c35]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Time vs. space trade-offs for rendezvous in trees. SPAA 2012: 1-10
- [c34]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan: Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA 2012: 11-17
- [c33]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, Eduardo Pacheco: Position Discovery for a System of Bouncing Robots. DISC 2012: 341-355
- [i3]Adrian Kosowski: A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity. CoRR abs/1204.1136 (2012)
- 2011
- [j21]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)
- [j20]Adrian Kosowski, Dominik Pajak, Zuzanna Stamirowska: Review of SIROCCO 2011. SIGACT News 42(4): 92-95 (2011)
- [j19]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Synchronous black hole search in directed graphs. Theor. Comput. Sci. 412(41): 5752-5759 (2011)
- [c32]Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis: Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds. ESA 2011: 701-712
- [c31]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Russell A. Martin: Synchronous Rendezvous for Location-Aware Agents. DISC 2011: 447-459
- [e1]Adrian Kosowski, Masafumi Yamashita (Eds.): Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Gdansk, Poland, June 26-29, 2011. Proceedings. Lecture Notes in Computer Science 6796, Springer 2011, ISBN 978-3-642-22211-5
- [i2]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)
- 2010
- [j18]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)
- [j17]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Exploiting multi-interface networks: Connectivity and Cheapest Paths. Wireless Networks 16(4): 1063-1073 (2010)
- [c30]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. MFCS 2010: 294-305
- [c29]Jérémie Chalopin, Shantanu Das, Adrian Kosowski: Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134
- [c28]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
- [c27]Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc: How to meet when you forget: log-space rendezvous in arbitrary graphs. PODC 2010: 450-459
- [i1]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud: On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
2000 – 2009
- 2009
- [j16]Adrian Kosowski: Forwarding and optical indices of a graph. Discrete Applied Mathematics 157(2): 321-329 (2009)
- [j15]Adrian Kosowski: A note on the strength and minimum color sum of bipartite graphs. Discrete Applied Mathematics 157(11): 2552-2554 (2009)
- [j14]Adrian Kosowski: Approximating the maximum 2- and 3-edge-colorable subgraph problems. Discrete Applied Mathematics 157(17): 3593-3600 (2009)
- [j13]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)
- [j12]Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski: Mixed graph edge coloring. Discrete Mathematics 309(12): 4027-4036 (2009)
- [j11]Krzysztof Kosowski, Karol Tucki, Adrian Kosowski: Turbine stage design aided by artificial intelligence methods. Expert Syst. Appl. 36(9): 11536-11542 (2009)
- [j10]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)
- [j9]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)
- [j8]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)
- [c26]Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP (2) 2009: 411-422
- [c25]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski: Forming a connected network in a grid by asynchronous and oblivious robots. IMCSIT 2009: 583-588
- [c24]Adrian Kosowski, Alfredo Navarra: Graph Decomposition for Improving Memoryless Periodic Exploration. MFCS 2009: 501-512
- [c23]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Synchronization Helps Robots to Detect Black Holes in Directed Graphs. OPODIS 2009: 86-98
- [c22]Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik: Robustness of the Rotor-router Mechanism. OPODIS 2009: 345-358
- [c21]Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009: 222-236
- [c20]Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz: What Can Be Observed Locally? DISC 2009: 243-257
- [c19]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
- 2008
- [j7]Adrian Kosowski, Pawel Zylinski: Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Comb. 89 (2008)
- [j6]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)
- [j5]Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski: A note on mixed tree coloring. Inf. Process. Lett. 106(4): 133-135 (2008)
- [j4]Adrian Kosowski: The maximum edge-disjoint paths problem in complete graphs. Theor. Comput. Sci. 399(1-2): 128-140 (2008)
- [c18]Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462
- [c17]Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti: Connectivity in Multi-interface Networks. TGC 2008: 157-170
- 2007
- [j3]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Cooperative mobile guards in grids. Comput. Geom. 37(2): 59-71 (2007)
- [j2]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Packing [1, Delta] -factors in graphs of small degree. J. Comb. Optim. 14(1): 63-86 (2007)
- [c16]Adrian Kosowski, Michal Malafiejski, Tomasz Noinski: Application of an Online Judge & Contester System in Academic Tuition. ICWL 2007: 343-354
- [c15]Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Cost Minimisation in Multi-interface Networks. NET-COOP 2007: 276-285
- [c14]Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski: Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. PPAM 2007: 1001-1008
- [c13]Adrian Kosowski, Alfredo Navarra: Cost Minimisation in Unbounded Multi-interface Networks. PPAM 2007: 1039-1047
- [c12]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
- [c11]Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra: On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484
- 2006
- [j1]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An approximation algorithm for maximum P3-packing in subcubic graphs. Inf. Process. Lett. 99(6): 230-233 (2006)
- [c10]Adrian Kosowski, Lukasz Kuszner: On Greedy Graph Coloring in the Distributed Model. Euro-Par 2006: 592-601
- [c9]Adrian Kosowski, Lukasz Kuszner: Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees. ICAISC 2006: 1150-1159
- [c8]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. ICCSA (1) 2006: 141-150
- [c7]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Fault Tolerant Guarding of Grids. ICCSA (1) 2006: 161-170
- [c6]Adrian Kosowski, Lukasz Kuszner: Energy Optimisation in Resilient Self-Stabilizing Processes. PARELEC 2006: 105-110
- [c5]Adrian Kosowski: Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. SIROCCO 2006: 130-142
- 2005
- [c4]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: On Bounded Load Routings for Modeling k-Regular Connection Topologies. ISAAC 2005: 614-623
- [c3]Adrian Kosowski, Lukasz Kuszner: A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. PPAM 2005: 75-82
- [c2]Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Parallel Processing Subsystems with Redundancy in a Distributed Environment. PPAM 2005: 1002-1009
- 2004
- [c1]Adrian Kosowski: An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. SPIRE 2004: 93-100
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-14 22:04 CEST by the dblp team