P.Ż.

    Paweł Żyliński
    University of Gdańsk
    Institute of Informatics
    Wita Stwosza 57
    80-308 Gdańsk, Poland

    Building of the MFI Faculty, room #145
    e-mail:

 

    Dydaktyka
    » Ogłoszenia, wykłady, zadania, ...

 

· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · And Then There Were None · · · · · · ·

    Ph.D. Thesis, University of Gdańsk, Gdańsk (2004)
    » Cooperative Guards – Combinatorial Bounds and Complexity

    Hab. Thesis, Institute of Computer Science, Polish Academy of Science, Warszawa (2014)
    » Problem galerii sztuki i jego odmiany – algorytmy i oszacowania

    Research area
    » graph theory
    » computational geometry

 

· · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · ·

SURVEYS, BOOK CHAPTERS

[B02] P. Żyliński: Cooperative Guards in Art Galleries
         Dissertationes Mathematicae 450 (2008)
         >>>> Errata

[B01] P. Żyliński: Placing guards in art galleries by graph coloring
         in: Graph Colorings (M. Kubale, Ed.), Contemporary Mathematics 352 (2004)

JOURNAL PAPERS

[J34] M. Miotk, P. Żyliński: Spanning trees with disjoint dominating and 2-dominating sets
         Discussiones Mathematicae Graph Theory, in Press

[J33] M. Miotk, J. Topp, P. Żyliński: Disjoint dominating and 2-dominating sets in graphs
         Discrete Optimization, in Press

[J32] M. Dettlaff, M. Lemańska, J. Topp, R. Ziemann, P. Żyliński: Certified domination
         AKCE International Journal of Graphs and Combinatorics, in Press

[J31] M. Lemańska, P. Żyliński: Reconfiguring minimum dominating sets in trees
         Journal of Graph Algorithms and Applications 24(1), pp. 47-61 (2020)

[J30] A. Lingas, M. Miotk, J. Topp, P. Żyliński: Graphs with equal domination and covering numbers
         Journal of Combinatorial Optimization 39, 55-71 (2020)

[J29]  M. Dettlaff, M. Lemańska, M. Miotk, J. Topp, R. Ziemann, P. Żyliński:
         Graphs with equal domination and certified domination numbers
         Opuscula Mathematica 39(6), pp. 815-827 (2019)

[J28] M. Miotk, J. Topp, P. Żyliński: Bipartization of graphs
         Graphs & Combinatorics 35(5), 1169-1177 (2019)

[J27] P. Żyliński: Vertex-edge domination in graphs
         Aequationes Mathematicae 93(4), pp. 735-742 (2019)

[J26]  M. Lemańska, E. Rivera-Campo, R. Ziemann, R. Zuazua, P. Żyliński
         Convex dominating sets in maximal outerplanar graphs
         Discrete Applied Mathematics 265, pp. 142-157 (2019)

[J25] D. Dereniowski, A. Lingas, M. Persson, D. Urbańska, P. Żyliński
         Clearing directed subgraphs by mobile agents: Variations on covering with paths
         Journal of Computer and System Sciences 102, pp. 57-68 (2019)

[J24] M. Dettlaff, M. Lemańska, J. Topp, P. Żyliński
         Coronas and domination subdivision number of graphs
         Bulletin of the Malaysian Mathematical Sciences Society 41(4), pp. 1717-1724 (2018)

[J23]  M. Lemańska, R. Zuazua, P. Żyliński: Total dominating sets in maximal outerplanar graphs
         Graphs & Combinatorics 33(4), pp. 991-998 (2017)

[J22] D. Dereniowski, H. Ono, I. Suzuki, Ł. Wrona, M. Yamashita, P. Żyliński
         The searchlight problem for road networks
         Theoretical Computer Science 591, pp. 28-59 (2015)

[J21] A. Dumitrescu, J.S.B. Mitchell, P. Żyliński: The minimum guarding tree problem
         Discrete Mathematics, Algorithms and Applications 6(1), #1450011 (2014)

[J20] A. Dumitrescu, J.S.B. Mitchell, P. Żyliński: Watchman routes for lines and segments
         Computational Geometry: Theory and Applications 47(4), pp. 527-538 (2014)

         >>>> Errata. Our acknowledgements should also include Adrian Kosowski and Michał Małafiejski.
                   I overlooked it, my fault, sorry... (PZ)

[J19] A. Lingas, A. Wasylewicz, P. Żyliński
         Linear-time 3-approximation algorithm for the r-star covering problem
         The International Journal of Computational Geometry & Applications 22(2), pp. 103-142 (2012)

[J18] A. Kosowski, I. Suzuki, P. Żyliński
         A point set connection problem for autonomous mobile robots in a grid
         Computing and Informatics 31(2), pp. 349-369 (2012)

[J17] A. Dumitrescu, H. Kok, I. Suzuki, P. Żyliński: Vision-based pursuit-evasion in a grid
         SIAM Journal on Discrete Mathematics 24(3), pp. 1177-1204 (2010)

[J16] H. Furmańczyk, A. Kosowski, B. Ries, P. Żyliński: Mixed graph edge coloring
         Discrete Mathematics 309(12), pp. 4027-4036 (2009)

[J15] R. Fidytek, H. Furmańczyk, P. Żyliński: Equitable colorings of Kneser graphs
         Discussiones Mathematicae: Graph Theory 29(1), pp. 119-142 (2009)

[J14] A. Kosowski, M. Małafiejski, P. Żyliński: Tighter bounds on the size of P3-matching in a cubic graph
         Graphs & Combinatorics 24(5), pp. 461-468 (2008)

[J13] A. Kosowski, P. Żyliński: Packing three-vertex paths in 2-connected cubic graphs
         Ars Combinatoria 89, pp. 95-113 (2008)

[J12] I. Suzuki, P. Żyliński: Capturing an evader in a building
         Special Issue on Computational Geometry Approaches in Path Planning
         IEEE Robotics and Automation Magazine 15(2), pp. 16-26 (2008)
         >>>> Corrigendum

[J11] A. Dumitrescu, I. Suzuki, P. Żyliński: Offline variants of the "Lion and Man" problem
         – Some problems and techniques for measuring crowdedness and for safe path planning –

         Special Issue on Graph Searching, Theoretical Computer Science 399(3), pp. 220-235 (2008)

[J10] H. Furmańczyk, A. Kosowski, P. Żyliński: A note on mixed tree coloring
         Information Processing Letters 106, pp. 133-135 (2008)

[J09b] A. Lingas, L. Palios, A. Wasylewicz, P. Żyliński
         Corrigendum to "Note on covering monotone orthogonal polygons with star-shaped polygons"
         Information Processing Letters 114(11), pp. 646-654 (2014)

[J09a] A. Lingas, A. Wasylewicz, P. Żyliński
         Note on covering orthogonal polygons with star-shaped polygons
         Information Processing Letters 104(6), pp. 220-227 (2007)

[J08] A. Kosowski, M. Małafiejski, P. Żyliński: Packing [1,Δ]-factors in graphs of small degree
         Journal of Combinatorial Optimization 14(1), pp. 63-86 (2007)
         >>>> Errata

[J07] A. Kosowski, M. Małafiejski, P. Żyliński: Cooperative mobile guards in grids
         Computational Geometry: Theory and Applications 37(2), pp. 59-71 (2007)

[J06] P. Żyliński: Orthogonal art galleries with holes − a coloring proof of Aggarwal's Theorem
         The Electronic Journal of Combinatorics 13, #R20 (2006)

[J05] P. Żyliński: Watched guards in art galleries, Journal of Geometry 84, pp. 164-185 (2006)

[J04] P. Żyliński: Art galleries with k-guarded guards, Note di Matematica 24(1), pp. 111-127 (2005)

[J03] P. Żyliński: Cooperative guards in art galleries with one hole
         Balkan Journal of Geometry and Its Applications 10(2), pp. 142-153 (2005)

[J02] P. Żyliński: Cooperative guards in the fortress problem
         Balkan Journal of Geometry and Its Applications 9(2), pp. 103-119 (2004)

[J01] H. Furmańczyk, P. Żyliński
         Scheduling unit time jobs on a single batch processing machine (in Polish)
         Scientific Journal of Silesian University of Technology 134, pp. 127-137 (2002)

CONFERENCES/EXTENDED ABSTRACTS (without a journal version):

[C09] B.J. Nilsson, P. Żyliński: The Lighthouse Problem – Navigating by lighthouses in geometric domains          Proc. of the 31st Canadian Conference on Computational Geometry, pp. 71-77 (2019)

Note to [C09]. Unfortunately, at the time of presentation of these results, the authors encountered a counterexample to Lemma 4, thus invalidating the results claimed up to and including Theorem 7.

[C08] M. Gibson, E. Krohn, B.J. Nilsson, M. Rayford, P. Żyliński: A note on guarding staircase polygons
         Proc. of the 31st Canadian Conference on Computational Geometry, pp. 101-105 (2019)

[C07] A. Martínez-Moraian, D. Orden, L. Palios, C. Seara, P. Żyliński
         Generalized kernels of polygons under rotation: area and perimeter
         Proc. of the XVIII Spanish Meeting on Computational Geometry, pp. 5-8 (2019)

[C06] Ch. Levcopoulos, A. Lingas, B. J. Nilsson, P. Żyliński: Clearing connections by few agents
         FUN'14, LNCS 8496, pp. 289-300 (2014)

[C05] B.J. Nilsson, P. Żyliński: How to keep an eye on a few small things
         EuroCG'14, Proc. of the 30th EuroCG, pp. 4 (2014)

[C04] H. Furmańczyk, A. Kosowski, P. Żyliński
         Scheduling with precedence constraints: Mixed graph coloring in series-parallel graphs
         PPAM'07, LNCS 4967, pp. 1001-1008 (2008)

[C03] A. Kosowski, M. Małafiejski, P. Żyliński
         Parallel processing subsystems with redundancy in a distributed environment
         PPAM'05, LNCS 3911, pp. 1002-1009 (2006)

[C02] M. Małafiejski, P. Żyliński: Weakly cooperative guards in grids
         CGA'05, LNCS 3480, pp. 647-656 (2005)

[C01] P. Żyliński: Vertex cover and connected guard sets
         EuroCG'03, Proc. of the 19th EuroCG, pp. 45-47 (2003)

CONFERENCE TALKS

[N/A] P. Żyliński: Recent results in the Art Gallery Problem for lines and line segments
         Combinatorics and Related Topics, Mexico City (2016)

[N/A] P. Żyliński: Guarding grids and related graph problems
         The 24th European Conference on Operational Research, Lisbon (2010)

/see [B02]/ T. Nierhoff, P. Żyliński: Cooperative guards in grids
         The 3rd Annual CGC Workshop, Neustrelitz (2003)
         >>>> see Errata for [B02]

OTHERS

/see [C07]/ D. Orden, L. Palios, C. Seara, P. Żyliński: Generalized kernels of polygons under rotation
         EuroCG'18, Proc. of the 30th EuroCG, 74:1-74:6 (2018)

/see [J25]/ D. Dereniowski, A. Lingas, M. Persson, D. Urbańska, P. Żyliński
         The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
         FCT'17, LNCS 10472, pp. 190-203 (2017)

/see [J21]/ A. Dumitrescu, J.S.B. Mitchell, P. Żyliński: The minimum guarding tree problem
         Proc. of the 29th EuroCG, pp. 5-8

/see [J20]/ A. Dumitrescu, J.S.B. Mitchell, P. Żyliński: Watchman routes for lines and segments
         SWAT'12, LNCS 7357, pp. 36-47

/almost a guest/ A. Czumaj, J. Czyzowicz, L. Gąsieniec, J. Jansson, A. Lingas, P. Żyliński
         Approximation algorithms for buy-at-bulk geometric network design
         International Journal of Foundations of Computer Science, 22(8), pp. 1949-1969
         Extended abstract: WADS' 09, LNCS 5664, pp. 168-180

/see [J19]/ A. Kosowski, I. Suzuki, P. Żyliński
         Forming a connected network in a grid by asynchronous and oblivious robots
         IMCSIT'09, Proc. of IMCSIT, pp. 583-588

/see [J18]/ A. Lingas, A. Wasylewicz, P. Żyliński
         Linear-time 3-approximation algorithm for the r-star covering problem
         WALCOM'08, LNCS 4921, pp. 157-168

/almost a guest/ A. Kolenderska, A. Kosowski, M. Małafiejski, P. Żyliński
         An improved strategy for exploring a grid polygon
         SIROCCO'09, LNCS 5869, pp. 222-236

/see [J17]/ A. Dumitrescu, H. Kok, I. Suzuki, P. Żyliński: Vision-based pursuit-evasion in a grid
         SWAT'08, LNCS 5124, pp. 53-64

/see [J11]/ A. Dumitrescu, I. Suzuki, P. Żyliński: Offline variants of the "Lion and Man" problem
         SCG'07, ACM Proc. of SCG, pp. 102-111

/see [J08]/ A. Kosowski, M. Małafiejski, P. Żyliński: Fault tolerant guarding of grids
         CGA'06, LNCS 3980, pp. 161-170

/see [J07]/ A. Kosowski, M. Małafiejski, P. Żyliński
         An efficient algorithm for mobile guarded guards in grids
         CGA'06, LNCS 3980, pp. 141-150

/almost a guest/ A. Kosowski, M. Małafiejski, P. Żyliński
         On bounded load routings for modeling k-regular connection topologies
         ISAAC'05, LNCS 3827, pp. 614-623

/see [J07]/ A. Kosowski, M. Małafiejski, P. Żyliński: Weakly cooperative mobile guards in grids
         JCDCG'04, Proc. of JCDCG, pp. 83-84

/see [C04]/ A. Kosowski, M. Małafiejski, P. Żyliński
         An approximation algorithm for maximum P3-packing in subcubic  graphs
         Information Processing Letters 99(6), pp. 230-233

/see [C04]/ A. Kosowski, M. Małafiejski, P. Żyliński: Packing three-vertex paths in a subcubic graph
          EUROCOMB'05, DMTCS AE, pp. 213-218

/see [B02]/  P. Żyliński: The minimum k-guarded guards problem
         Technical Report of Gdańsk University of Technology ETI Faculty 13/03 PG

/see [B02]/ P. Żyliński: Some results on cooperative guards
         Technical Report of Gdańsk University of Technology ETI Faculty 30/02 PG

/see [B01]/ P. Żyliński
         Planowanie rozmieszczenia strażników w galeriach sztuki metodą kolorowania grafów
         in: Optymalizacja dyskretna – modele i metody kolorowania grafów (M. Kubale, Ed.), WNT (2002)