Paweł Żyliński

From MaRDI portal
Person:819179

Available identifiers

zbMath Open zylinski.pawelMaRDI QIDQ819179

List of research outcomes





PublicationDate of PublicationType
Primal-dual cops and robber2024-04-02Paper
https://portal.mardi4nfdi.de/entity/Q61877922024-01-15Paper
On vertex guarding staircase polygons2023-07-26Paper
Spanning trees with disjoint dominating and 2-dominating sets2022-01-03Paper
How to Keep an Eye on Small Things2021-11-26Paper
Certified domination2021-10-05Paper
Optimizing generalized kernels of polygons2021-08-17Paper
Shortest watchman tours in simple polygons under rotated monotone visibility2021-04-21Paper
Vertex-edge domination in cubic graphs2020-09-10Paper
Graphs with equal domination and certified domination numbers2020-04-22Paper
Disjoint dominating and 2-dominating sets in graphs2020-02-24Paper
Reconfiguring minimum dominating sets in trees2020-02-17Paper
Graphs with equal domination and covering numbers2020-02-03Paper
Bipartization of graphs2019-11-06Paper
Vertex-edge domination in graphs2019-07-26Paper
Convex dominating sets in maximal outerplanar graphs2019-07-17Paper
Clearing directed subgraphs by mobile agents. Variations on covering with paths2019-05-03Paper
Coronas and domination subdivision number of a graph2019-01-31Paper
A point set connection problem for autonomous mobile robots in a grid2018-04-05Paper
On domination perfect graphs2018-02-10Paper
The snow team problem (clearing directed subgraphs by mobile agents)2017-11-22Paper
Total dominating sets in maximal outerplanar graphs2017-10-11Paper
The searchlight problem for road networks2015-07-13Paper
Corrigendum to ``Note on covering monotone orthogonal polygons2014-07-18Paper
THE MINIMUM GUARDING TREE PROBLEM2014-04-25Paper
Watchman routes for lines and line segments2014-04-14Paper
Linear-time 3-approximation algorithm for the \(r\)-star covering problem2012-11-23Paper
Watchman routes for lines and segments2012-08-14Paper
Approximation algorithms for buy-at-bulk geometric network design2012-03-13Paper
Vision-based pursuit-evasion in a grid2011-06-17Paper
Packing three-vertex paths in 2-connected cubic graphs.2011-02-02Paper
Packing three-vertex paths in a subcubic graph2010-07-30Paper
A note on mixed tree coloring2010-04-19Paper
Note on covering monotone orthogonal polygons with star-shaped polygons2010-03-24Paper
An improved strategy for exploring a grid polygon2010-02-24Paper
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs2010-01-29Paper
Mixed graph edge coloring2009-12-09Paper
Approximation Algorithms for Buy-at-Bulk Geometric Network Design2009-10-20Paper
Equitable coloring of Kneser graphs2009-08-03Paper
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph2009-04-29Paper
https://portal.mardi4nfdi.de/entity/Q36028592009-02-12Paper
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids2009-01-27Paper
Fault Tolerant Guarding of Grids2009-01-27Paper
Vision-Based Pursuit-Evasion in a Grid2008-07-15Paper
Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning2008-06-24Paper
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem2008-03-25Paper
Cooperative guards in art galleries2008-02-01Paper
Packing \([1, \Delta ]\)-factors in graphs of small degree2007-11-14Paper
Parallel Processing and Applied Mathematics2007-05-02Paper
Cooperative mobile guards in grids2007-04-18Paper
Cooperative guards in art galleries with one hole2007-03-27Paper
Algorithms and Computation2006-11-14Paper
https://portal.mardi4nfdi.de/entity/Q54894652006-09-28Paper
Watched guards in art galleries2006-05-18Paper
Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem2006-03-22Paper
https://portal.mardi4nfdi.de/entity/Q46597542005-03-21Paper

Research outcomes over time

This page was built for person: Paweł Żyliński