Paweł Żyliński

Available identifiers

zbMath Open zylinski.pawelMaRDI QIDQ819179

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6124764	2024-04-02	Paper
https://portal.mardi4nfdi.de/entity/Q6187792	2024-01-15	Paper
On vertex guarding staircase polygons	2023-07-26	Paper
Spanning trees with disjoint dominating and 2-dominating sets	2022-01-03	Paper
How to Keep an Eye on Small Things	2021-11-26	Paper
Certified domination	2021-10-05	Paper
Optimizing generalized kernels of polygons	2021-08-17	Paper
Shortest watchman tours in simple polygons under rotated monotone visibility	2021-04-21	Paper
Vertex-edge domination in cubic graphs	2020-09-10	Paper
Graphs with equal domination and certified domination numbers	2020-04-22	Paper
Disjoint dominating and 2-dominating sets in graphs	2020-02-24	Paper
Reconfiguring Minimum Dominating Sets in Trees	2020-02-17	Paper
Graphs with equal domination and covering numbers	2020-02-03	Paper
Bipartization of graphs	2019-11-06	Paper
Vertex-edge domination in graphs	2019-07-26	Paper
Convex dominating sets in maximal outerplanar graphs	2019-07-17	Paper
Clearing directed subgraphs by mobile agents. Variations on covering with paths	2019-05-03	Paper
Coronas and domination subdivision number of a graph	2019-01-31	Paper
https://portal.mardi4nfdi.de/entity/Q4610034	2018-04-05	Paper
On domination perfect graphs	2018-02-10	Paper
The snow team problem (clearing directed subgraphs by mobile agents)	2017-11-22	Paper
Total dominating sets in maximal outerplanar graphs	2017-10-11	Paper
The searchlight problem for road networks	2015-07-13	Paper
Corrigendum to ``Note on covering monotone orthogonal polygons	2014-07-18	Paper
THE MINIMUM GUARDING TREE PROBLEM	2014-04-25	Paper
Watchman routes for lines and line segments	2014-04-14	Paper
LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM	2012-11-23	Paper
Watchman Routes for Lines and Segments	2012-08-14	Paper
APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN	2012-03-13	Paper
Vision-Based Pursuit-Evasion in a Grid	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3070345	2011-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q3576691	2010-07-30	Paper
A note on mixed tree coloring	2010-04-19	Paper
Note on covering monotone orthogonal polygons with star-shaped polygons	2010-03-24	Paper
An Improved Strategy for Exploring a Grid Polygon	2010-02-24	Paper
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs	2010-01-29	Paper
Mixed graph edge coloring	2009-12-09	Paper
Approximation Algorithms for Buy-at-Bulk Geometric Network Design	2009-10-20	Paper
Equitable coloring of Kneser graphs	2009-08-03	Paper
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph	2009-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q3602859	2009-02-12	Paper
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids	2009-01-27	Paper
Fault Tolerant Guarding of Grids	2009-01-27	Paper
Vision-Based Pursuit-Evasion in a Grid	2008-07-15	Paper
Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning	2008-06-24	Paper
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem	2008-03-25	Paper
Cooperative guards in art galleries	2008-02-01	Paper
Packing \([1, \Delta \)-factors in graphs of small degree]	2007-11-14	Paper
Parallel Processing and Applied Mathematics	2007-05-02	Paper
Cooperative mobile guards in grids	2007-04-18	Paper
https://portal.mardi4nfdi.de/entity/Q3428585	2007-03-27	Paper
Algorithms and Computation	2006-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q5489465	2006-09-28	Paper
Watched guards in art galleries	2006-05-18	Paper
Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem	2006-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q4659754	2005-03-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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