Weakly Cooperative Guards in Grids. - Michal Malafiejski; Pawel Zylinski (ICCSA (1), 2005)

On Bounded Load Routings for Modeling k-Regular Connection Topologies. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (ISAAC, 2005)

Parallel Processing Subsystems with Redundancy in a Distributed Environment. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (PPAM, 2005)

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (ICCSA (1), 2006)

Fault Tolerant Guarding of Grids. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (ICCSA (1), 2006)

Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem. - Pawel Zylinski (Electron. J. Comb., 2006)

An approximation algorithm for maximum P3-packing in subcubic graphs. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (Inf. Process. Lett., 2006)

Offline variants of the "lion and man" problem. - Adrian Dumitrescu; Ichiro Suzuki; Pawel Zylinski (SCG, 2007)

Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. - Hanna Furmanczyk; Adrian Kosowski; Pawel Zylinski (PPAM, 2007)

Cooperative mobile guards in grids. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (Comput. Geom., 2007)

Note on covering monotone orthogonal polygons with star-shaped polygons. - Andrzej Lingas; Agnieszka Wasylewicz; Pawel Zylinski (Inf. Process. Lett., 2007)

Packing [1, Delta] -factors in graphs of small degree. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (J. Comb. Optim., 2007)

Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. - Andrzej Lingas; Agnieszka Wasylewicz; Pawel Zylinski (WALCOM, 2008)

Packing Three-Vertex Paths in 2-Connected Cubic Graphs. - Adrian Kosowski; Pawel Zylinski (Ars Comb., 2008)

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. - Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (Graphs Comb., 2008)

A note on mixed tree coloring. - Hanna Furmanczyk; Adrian Kosowski; Pawel Zylinski (Inf. Process. Lett., 2008)

Capturing an Evader in a Building - Randomized and Deterministic Algorithms for Mobile Robots. - Ichiro Suzuki; Pawel Zylinski (IEEE Robotics Autom. Mag., 2008)

Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - . - Adrian Dumitrescu; Ichiro Suzuki; Pawel Zylinski (Theor. Comput. Sci., 2008)

Forming a connected network in a grid by asynchronous and oblivious robots. - Adrian Kosowski; Ichiro Suzuki; Pawel Zylinski (IMCSIT, 2009)

An Improved Strategy for Exploring a Grid Polygon. - Agnieszka Kolenderska; Adrian Kosowski; Michal Malafiejski; Pawel Zylinski (SIROCCO, 2009)

Mixed graph edge coloring. - Hanna Furmanczyk; Adrian Kosowski; Bernard Ries; Pawel Zylinski (Discret. Math., 2009)

Equitable coloring of Kneser graphs. - Robert Fidytek; Hanna Furmanczyk; Pawel Zylinski (Discuss. Math. Graph Theory, 2009)

Vision-Based Pursuit-Evasion in a Grid. - Adrian Dumitrescu; Howi Kok; Ichiro Suzuki; Pawel Zylinski (SIAM J. Discret. Math., 2010)

Approximation Algorithms for Buy-at-Bulk Geometric Network Design. - Artur Czumaj; Jurek Czyzowicz; Leszek Gasieniec; Jesper Jansson 001; Andrzej Lingas; Pawel Zylinski (Int. J. Found. Comput. Sci., 2011)

Watchman Routes for Lines and Segments. - Adrian Dumitrescu; Joseph S. B. Mitchell; Pawel Zylinski (SWAT, 2012)

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. - Adrian Kosowski; Ichiro Suzuki; Pawel Zylinski (Comput. Informatics, 2012)

Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. - Andrzej Lingas; Agnieszka Wasylewicz; Pawel Zylinski (Int. J. Comput. Geom. Appl., 2012)

Clearing Connections by Few Agents. - Christos Levcopoulos; Andrzej Lingas; Bengt J. Nilsson; Pawel Zylinski (FUN, 2014)

Watchman routes for lines and line segments. - Adrian Dumitrescu; Joseph S. B. Mitchell; Pawel Zylinski (Comput. Geom., 2014)

The Minimum Guarding Tree Problem. - Adrian Dumitrescu; Joseph S. B. Mitchell; Pawel Zylinski (Discret. Math. Algorithms Appl., 2014)

Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. - Andrzej Lingas; Leonidas Palios; Agnieszka Wasylewicz; Pawel Zylinski (Inf. Process. Lett., 2014)

The searchlight problem for road networks. - Dariusz Dereniowski; Hirotaka Ono 001; Ichiro Suzuki; Lukasz Wrona; Masafumi Yamashita; Pawel Zylinski (Theor. Comput. Sci., 2015)

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). - Dariusz Dereniowski; Andrzej Lingas; Mia Persson; Dorota Urbanska; Pawel Zylinski (FCT, 2017)

Total Dominating Sets in Maximal Outerplanar Graphs. - Magdalena Lemanska; Rita Zuazua; Pawel Zylinski (Graphs Comb., 2017)

Generalized kernels of polygons under rotation. - David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (CoRR, 2018)

A Note on Guarding Staircase Polygons. - Matt Gibson 001; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Pawel Zylinski (CCCG, 2019)

The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. - Bengt J. Nilsson; Pawel Zylinski (CCCG, 2019)

Convex dominating sets in maximal outerplanar graphs. - Magdalena Lemanska; Eduardo Rivera-Campo; Radoslaw Ziemann; Rita Zuazua; Pawel Zylinski (Discret. Appl. Math., 2019)

Bipartization of Graphs. - Mateusz Miotk; Jerzy Topp; Pawel Zylinski (Graphs Comb., 2019)

Clearing directed subgraphs by mobile agents: Variations on covering with paths. - Dariusz Dereniowski; Andrzej Lingas; Dorota Osula; Mia Persson; Pawel Zylinski (J. Comput. Syst. Sci., 2019)

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (COCOON, 2020)

Certified domination. - Magda Dettlaff; Magdalena Lemanska; Jerzy Topp; Radoslaw Ziemann; Pawel Zylinski (AKCE Int. J. Graphs Comb., 2020)

Disjoint dominating and 2-dominating sets in graphs. - Mateusz Miotk; Jerzy Topp; Pawel Zylinski (Discret. Optim., 2020)

Vertex-edge domination in cubic graphs. - Radoslaw Ziemann; Pawel Zylinski (Discret. Math., 2020)

How to Keep an Eye on Small Things. - Bengt J. Nilsson; Pawel Zylinski (Int. J. Comput. Geom. Appl., 2020)

Graphs with equal domination and covering numbers. - Andrzej Lingas; Mateusz Miotk; Jerzy Topp; Pawel Zylinski (J. Comb. Optim., 2020)

Illuminating the x-Axis by α-Floodlights. - Bengt J. Nilsson; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (ISAAC, 2021)

Optimizing generalized kernels of polygons. - Alejandra Martínez-Moraian; David Orden; Leonidas Palios; Carlos Seara; Pawel Zylinski (J. Glob. Optim., 2021)

On Vertex Guarding Staircase Polygons. - Matt Gibson-Lopez; Erik Krohn; Bengt J. Nilsson; Matthew Rayford; Sean Soderman; Pawel Zylinski (LATIN, 2022)

The Rectilinear Steiner Forest Arborescence problem. - Lukasz Mielewczyk; Leonidas Palios; Pawel Zylinski (CoRR, 2022)

Spanning trees with disjoint 2 dominating and 2-dominating sets. - Mateusz Miotk; Pawel Zylinski (Discuss. Math. Graph Theory, 2022)

Primal-Dual Cops and Robber. - Minh Tuan Ha; Paul Jungeblut; Torsten Ueckerdt; Pawel Zylinski (Comput. Geom. Topol., 2024)

Low-degree spanning trees of 2-edge-connected graphs in linear time. - Dariusz Dereniowski; Janusz Dybizbanski; Przemyslaw Karpinski; Michal Zakrzewski; Pawel Zylinski (CoRR, 2024)