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] Cooperative Guards in Art Galleries /P. Żyliński/. Dissertationes Mathematicae 450 (2008)
         >>>> Errata

[B01] Placing guards in art galleries by graph coloring /P. Żyliński/

in: Graph Colorings (M. Kubale, Ed.), Contemporary Mathematics 352 (2004)

Journal papers:

[J24] Coronas and domination subdivision number of graphs

/M. Dettlaff, M. Lemańska, J. Topp, P. Żyliński/
Bulletin of the Malaysian Mathematical Sciences Society nn, pp. xx-yy (20??)

[J23] Total dominating sets in maximal outerplanar graphs /M. Lemańska, R. Zuazua, P. Żyliński/

Graphs and Combinatorics 33(4), pp. 991-998 (2017)

[J22] The searchlight problem for road networks

/D. Dereniowski, H. Ono, I. Suzuki, Ł. Wrona, M. Yamashita, P. Żyliński/
Theoretical Computer Science 591, pp. 28-59 (2015)

[J21] The minimum guarding tree problem /A. Dumitrescu, J. S. B. Mitchell, P. Żyliński/

Discrete Mathematics, Algorithms and Applications 6(1), #1450011 (2014)

[J20] Watchman routes for lines and segments /A. Dumitrescu, J. S. B. Mitchell, P. Żyliński/

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] Linear-time 3-approximation algorithm for the r-star covering problem

/A. Lingas, A. Wasylewicz, P. Żyliński/

The International Journal of Computational Geometry & Applications 22(2), pp. 103-142 (2012)

[J18] A point set connection problem for autonomous mobile robots in a grid

/A. Kosowski, I. Suzuki, P. Żyliński/

Computing and Informatics 31(2), pp. 349-369 (2012)

[J17] Vision-based pursuit-evasion in a grid /A. Dumitrescu, H. Kok, I. Suzuki, P. Żyliński/

SIAM Journal on Discrete Mathematics 24(3), pp. 1177-1204 (2010)

[J16] Mixed graph edge coloring /H. Furmańczyk, A. Kosowski, B. Ries, P. Żyliński/

Discrete Mathematics 309(12), pp. 4027-4036 (2009)

[J15] Equitable colorings of Kneser graphs /R. Fidytek, H. Furmańczyk, P. Żyliński/

Discussiones Mathematicae: Graph Theory 29(1), pp. 119-142 (2009)

[J14] Tighter bounds on the size of P3-matching in a cubic graph /A. Kosowski, M. Małafiejski, P. Żyliński/

Graphs & Combinatorics 24(5), pp. 461-468 (2008)

[J13] Packing three-vertex paths in 2-connected cubic graphs /A. Kosowski, P. Żyliński/

Ars Combinatoria 89, pp. 95-113 (2008)

[J12] Capturing an evader in a building /I. Suzuki, P. Żyliński/

>>>> Corrigendum                              IEEE Robotics and Automation Magazine 15(2), pp. 16-26 (2008)
Special Issue on Computational Geometry Approaches in Path Planning

[J11] Offline variants of the "Lion and Man" problem
        – Some problems and techniques for measuring crowdedness and for safe path planning –

/A. Dumitrescu, I. Suzuki, P. Żyliński/
Theoretical Computer Science 399(3), pp. 220-235 (2008)
Special Issue on Graph Searching

[J10] A note on mixed tree coloring /H. Furmańczyk, A. Kosowski, P. Żyliński/

Information Processing Letters 106, pp. 133-135 (2008)

[J09b] Corrigendum to "Note on covering monotone orthogonal polygons with star-shaped polygons"

/A. Lingas, L. Palios, A. Wasylewicz, P. Żyliński/
Information Processing Letters 114(11), pp. 646-654 (2014)

[J09a] Note on covering orthogonal polygons with star-shaped polygons

/A. Lingas, A. Wasylewicz, P. Żyliński/
Information Processing Letters 104(6), pp. 220-227 (2007)

[J08] Packing [1,Δ]-factors in graphs of small degree /A. Kosowski, M. Małafiejski, P. Żyliński/

>>>> Errata                                          Journal of Combinatorial Optimization 14(1), pp. 63-86 (2007)

[J07] Cooperative mobile guards in grids /A. Kosowski, M. Małafiejski, P. Żyliński/

Computational Geometry: Theory and Applications 37(2), pp. 59-71 (2007)

[J06] Orthogonal art galleries with holes − a coloring proof of Aggarwal's Theorem /P. Żyliński/

The Electronic Journal of Combinatorics 13, #R20 (2006)

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

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

[J03] Cooperative guards in art galleries with one hole /P. Żyliński/

Balkan Journal of Geometry and Its Applications 10(2), pp. 142-153 (2005)

[J02] Cooperative guards in the fortress problem /P. Żyliński/

Balkan Journal of Geometry and Its Applications 9(2), pp. 103-119 (2004)

[J01] Scheduling unit time jobs on a single batch processing machine (in Polish)

/H. Furmańczyk, P. Żyliński/
Scientific Journal of Silesian University of Technology 134, pp. 127-137 (2002)

Conference papers (without a journal version):

[C07] The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents

/D. Dereniowski, A. Lingas, M. Persson, D. Urbańska, P. Żyliński/

FCT'17, LNCS 10472, pp. xx-yy (2017)

[C06] Clearing connections by few agents /Ch. Levcopoulos, A. Lingas, B. J. Nilsson, P. Żyliński/

FUN'14, LNCS 8496, pp. 289-300 (2014)

[C05] How to keep an eye on a few small things /B. J. Nilsson, P. Żyliński/

EuroCG'14, Proc. of the 30th EuroCG, pp. 4 (2014)

[C04] Scheduling with precedence constraints: Mixed graph coloring in series-parallel graphs

/H. Furmańczyk, A. Kosowski, P. Żyliński/
PPAM'07, LNCS 4967, pp. 1001-1008 (2008)

[C03] Parallel processing subsystems with redundancy in a distributed environment

/A. Kosowski, M. Małafiejski, P. Żyliński/

PPAM'05, LNCS 3911, pp. 1002-1009 (2006)

[C02] Weakly cooperative guards in grids /M. Małafiejski, P. Żyliński/

CGA'05, LNCS 3480, pp. 647-656 (2005)

[C01] Vertex cover and connected guard sets /P. Żyliński/

EuroCG'03, Proc. of the 19th EuroCG, pp. 45-47 (2003)

Conferences:

[N/A] Recent results in the Art Gallery Problem for lines and line segments /P. Żyliński/

Combinatorics and Related Topics, Mexico City (2016)

/see [J23]/ Coronas and domination subdivision number of graphs

/M. Dettlaff, M. Lemańska, J. Topp, P. Żyliński/
The 16th Workshop on Graph Theory ″Colourings, Independence and Domination″, Szklarska Poręba (2015)

[N/A] Guarding grids and related graph problems /P. Żyliński/

The 24th European Conference on Operational Research, Lisbon (2010)

/see [B02]/ Cooperative guards in grids /T. Nierhoff, P. Żyliński/

>>>> see Errata for [B02]                               The 3rd Annual CGC Workshop, Neustrelitz (2003)

Others:

/see [J21]/ The minimum guarding tree problem /A. Dumitrescu, J. S. B. Mitchell, P. Żyliński/

Proc. of the 29th EuroCG, pp. 5-8

/see [J20]/ Watchman routes for lines and segments /A. Dumitrescu, J. S. B. Mitchell, P. Żyliński/

SWAT'12, LNCS 7357, pp. 36-47

/almost a guest/ Approximation algorithms for buy-at-bulk geometric network design

/A. Czumaj, J. Czyzowicz, L. Gąsieniec, J. Jansson, A. Lingas, P. Żyliński/

International Journal of Foundations of Computer Science, 22(8), pp. 1949-1969
Extended abstract: WADS' 09, LNCS 5664, pp. 168-180

/see [J19]/ Forming a connected network in a grid by asynchronous and oblivious robots

/A. Kosowski, I. Suzuki, P. Żyliński/

IMCSIT'09, Proc. of IMCSIT, pp. 583-588

/see [J18]/ Linear-time 3-approximation algorithm for the r-star covering problem

/A. Lingas, A. Wasylewicz, P. Żyliński/
WALCOM'08, LNCS 4921, pp. 157-168

/almost a guest/ An improved strategy for exploring a grid polygon

/A. Kolenderska, A. Kosowski, M. Małafiejski, P. Żyliński/
SIROCCO'09, LNCS 5869, pp. 222-236

/see [J17]/ Vision-based pursuit-evasion in a grid /A. Dumitrescu, H. Kok, I. Suzuki, P. Żyliński/

SWAT'08, LNCS 5124, pp. 53-64

/see [J11]/ Offline variants of the "Lion and Man" problem /A. Dumitrescu, I. Suzuki, P. Żyliński/

SCG'07, ACM Proc. of SCG, pp. 102-111

/see [J08]/ Fault tolerant guarding of grids /A. Kosowski, M. Małafiejski, P. Żyliński/

CGA'06, LNCS 3980, pp. 161-170

/see [J07]/ An efficient algorithm for mobile guarded guards in grids

/A. Kosowski, M. Małafiejski, P. Żyliński/
CGA'06, LNCS 3980, pp. 141-150

/almost a guest/ On bounded load routings for modeling k-regular connection topologies

/A. Kosowski, M. Małafiejski, P. Żyliński/

ISAAC'05, LNCS 3827, pp. 614-623

/see [J07]/ Weakly cooperative mobile guards in grids /A. Kosowski, M. Małafiejski, P. Żyliński/

JCDCG'04, Proc. of JCDCG, pp. 83-84

/see [C04]/ An approximation algorithm for maximum P3-packing in subcubic  graphs

/A. Kosowski, M. Małafiejski, P. Żyliński/

Information Processing Letters 99(6), pp. 230-233

/see [C04]/ Packing three-vertex paths in a subcubic graph /A. Kosowski, M. Małafiejski, P. Żyliński/

EUROCOMB'05, DMTCS AE, pp. 213-218

/see [B02]/ The minimum k-guarded guards problem /P. Żyliński/

Technical Report of Gdańsk University of Technology ETI Faculty 13/03 PG

/see [B02]/ Some results on cooperative guards /P. Żyliński/

Technical Report of Gdańsk University of Technology ETI Faculty 30/02 PG

/see [B01]/ Planowanie rozmieszczenia strażników w galeriach sztuki metodą kolorowania grafów

/P. Żyliński/
in: Optymalizacja dyskretna – modele i metody kolorowania grafów (M. Kubale, Ed.) WNT Warsaw (2002)