Adrian Kosowski

Adrian Kosowski, 2009

Affiliation:
Assistant Professor at Department of Algorithms and System Modeling
Gdańsk University of Technology
Narutowicza 11/12, 80233 Gdańsk, Poland
e-mail: adrian@kaims.pl

Associate Member of LaBRI (CNRS / Université Bordeaux 1)

My research interests focus on some aspects of combinatorial optimization problems (graph coloring, routing, generalized matching), network optimization, and graph algorithms in a distributed setting.

Selected published works

To appear

Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti: Synchronization Helps Robots to Detect Black Holes in Directed Graphs. OPODIS 2009 (to appear)
Evangelos Bampas, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Tomasz Radzik: Robustness of the rotor-router mechanism. OPODIS 2009 (to appear)
Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009 (to appear)
  Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti: Exploiting Multi-Interface Networks: Connectivity and Cheapest Paths. Wireless Networks (available online)

2009

  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
  Cyril Gavoille, Adrian Kosowski, Marcin Markiewicz: What Can be Observed Locally? Round-based Models for Quantum Distributed Computing. DISC 2009: 243-257
  Adrian Kosowski, Alfredo Navarra: Graph Decomposition for Improving Memoryless Periodic Exploration. MFCS 2009: 501-512
  Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ICALP 2009: 411-422
  Adrian Kosowski: Approximating the maximum 2- and 3-edge-colorable subgraph problems. Discrete Applied Mathematics 157(17): 3593-3600 (2009)
  Adrian Kosowski: A note on the strength and minimum color sum of bipartite graphs. Discrete Applied Mathematics 157(11): 2552-2554 (2009)
  Adrian Kosowski: Forwarding and optical indices of a graph. Discrete Applied Mathematics 157(2): 321-329 (2009)
  Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski: Mixed graph edge coloring. Discrete Mathematics 309(12): 4027-4036 (2009)
  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)
  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)
  Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker: Universal augmentation schemes for network navigability. Theoretical Computer Science 410(21-23): 1970-1981 (2009)
  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)
  Krzysztof Kosowski, Karol Tucki, Adrian Kosowski: Turbine stage design aided by artificial intelligence methods. Expert Systems With Applications 36(9): 11536-11542 (2009)

2008

  Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring. OPODIS 2008: 446-462
  Adrian Kosowski, Alfredo Navarra, Cristina M. Pinotti: Connectivity in Multi-interface Networks. TGC 2008: 157-170
  Adrian Kosowski, Pawel Zylinski: Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Combinatoria 89: 95-113 (2008)
  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)
  Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski: A note on mixed tree coloring. Information Processing Letters 106(4): 133-135 (2008)
  Adrian Kosowski: The maximum edge-disjoint paths problem in complete graphs. Theoretical Computer Science 399(1-2): 128-140 (2008)

2007

  Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Alfredo Navarra: On the Complexity of Distributed Greedy Coloring. DISC 2007: 482-484
  Adrian Kosowski, Michal Malafiejski, Tomasz Noinski: Application of an Online Judge & Contester System in Academic Tuition. ICWL 2007: 343-354
  Ralf Klasing, Adrian Kosowski, Alfredo Navarra: Cost Minimisation in Multi-interface Networks. NET-COOP 2007: 276-285
  Hanna Furmanczyk, Adrian Kosowski, Pawel Zylinski: Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. PPAM 2007: 1001-1008
  Adrian Kosowski, Alfredo Navarra: Cost Minimisation in Unbounded Multi-interface Networks. PPAM 2007: 1039-1047
  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
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Cooperative mobile guards in grids. Computational Geometry: Theory and Applications 37(2): 59-71 (2007)
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Packing [1, Delta]-factors in graphs of small degree. Journal of Combinatorial Optimization 14(1): 63-86 (2007)

2006

  Adrian Kosowski, Lukasz Kuszner: On Greedy Graph Coloring in the Distributed Model. Euro-Par 2006: 592-601
  Adrian Kosowski, Lukasz Kuszner: Self-stabilizing Algorithms for Graph Coloring with Improved Performance Guarantees. ICAISC 2006: 1150-1159
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. ICCSA (1) 2006: 141-150
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Fault Tolerant Guarding of Grids. ICCSA (1) 2006: 161-170
  Adrian Kosowski, Lukasz Kuszner: Energy Optimisation in Resilient Self-Stabilizing Processes. PARELEC 2006: 105-110
  Adrian Kosowski: Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. SIROCCO 2006: 130-142
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: An approximation algorithm for maximum P3-packing in subcubic graphs. Information Processing Letters 99(6): 230-233 (2006)

2005

  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: On Bounded Load Routings for Modeling k-Regular Connection Topologies. ISAAC 2005: 614-623
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Parallel Processing Subsystems with Redundancy in a Distributed Environment. PPAM 2005: 1002-1009
  Adrian Kosowski, Lukasz Kuszner: A Self-stabilizing Algorithm for Finding a Spanning Tree in a Polynomial Number of Moves. PPAM 2005: 75-82
  Adrian Kosowski, Michal Malafiejski, Pawel Zylinski: Packing Three-Vertex Paths in a Subcubic Graph. EUROCOMB 2005: 213-218

2004

  Adrian Kosowski: An Efficient Algorithm for the Longest Tandem Scattered Subsequence Problem. SPIRE 2004: 93-100
  Adrian Kosowski, Krzysztof Manuszewski: Classical Coloring of Graphs. In: Graph Colorings, Marek Kubale ed. AMS Contemporary Math. 352: 1-20 (2004)

Based on DBLP records. A complete list of my papers is available here: PDF.

Education/Brief CV

  • Ph.D. thesis: defended at the Gdańsk University of Technology, June 2007, with honors (advisor: Krzysztof Giaro, title: Path Assignment with Wavelength Constraints)
  • awards for scientific work:
    • Witold Lipski Prize for Young Researchers in Computer Science, 2009
    • Foundation for Polish Science scolarship (FNP Start), 2009
    • Prime Minister's prize (Ph.D. thesis), Poland, 2008
    • prize of the Gdansk Scientific Society (Ph.D thesis), 2008
    • Chancellor's prizes, Gdańsk University of Technology, 2006, 2007
    • Best Paper Award at SPAA'07 (for joint work with Pierre Fraigniaud, Cyril Gavoille, Emmanuelle Lebhar, and Zvi Lotker)
  • university education: 2000-2005 M.Sc. Eng. Comp. Sci. (Gdańsk Univ. Tech.), 2002-2006 M.Sc. Math. (Univ. Gdańsk), 2005-now Phys. (Univ. Gdańsk)
    • awarded 1st place in Primus Inter Pares contest 2005 (best student of Poland)
    • awarded 1st place in Primus Expert - Computer Science contest 2005 (best student of Computer Science in Poland)
    • awarded 1st place in the contest for the best master's thesis in computer science organised by the Polish Information Processing Society, 2005
    • 1st place as a team in the 6th International 24-hour Programming Contest challenge24.org, 2006

External links

  • Sphere Interest Group - an algorithm-oriented group at the Gdańsk University of Technology, which I had the pleasure of co-founding.
  • Sphere Online Judge - if you wish to practice your programming skills online, to participate in a programming contest (or hold your own), this is the place you were looking for.