Pawel Zylinski

Discuss. Math. Graph Theory, 2022

The Rectilinear Steiner Forest Arborescence problem.

[BibT_eX]

[DOI]

Lukasz Mielewczyk

Leonidas Palios

Alejandra Martínez-Moraian

CoRR, 2022

On Vertex Guarding Staircase Polygons.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Optimizing generalized kernels of polygons.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Illuminating the x-Axis by α-Floodlights.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Graphs with equal domination and covering numbers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

How to Keep an Eye on Small Things.

[BibT_eX]

[DOI]

Bengt J. Nilsson

Int. J. Comput. Geom. Appl., 2020

Vertex-edge domination in cubic graphs.

[BibT_eX]

[DOI]

Radoslaw Ziemann

Discret. Math., 2020

Disjoint dominating and 2-dominating sets in graphs.

[BibT_eX]

[DOI]

Mateusz Miotk

Jerzy Topp

Discret. Optim., 2020

Certified domination.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2020

Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Clearing directed subgraphs by mobile agents: Variations on covering with paths.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Bipartization of Graphs.

[BibT_eX]

[DOI]

Mateusz Miotk

Jerzy Topp

Graphs Comb., 2019

Convex dominating sets in maximal outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains.

[BibT_eX]

Bengt J. Nilsson

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

A Note on Guarding Staircase Polygons.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Generalized kernels of polygons under rotation.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Total Dominating Sets in Maximal Outerplanar Graphs.

[BibT_eX]

[DOI]

Magdalena Lemanska

Rita Zuazua

Graphs Comb., 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2015

The searchlight problem for road networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227].

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

The Minimum Guarding Tree Problem.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Discret. Math. Algorithms Appl., 2014

Watchman routes for lines and line segments.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Comput. Geom., 2014

Clearing Connections by Few Agents.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2012

Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem.

[BibT_eX]

[DOI]

Andrzej Lingas

Agnieszka Wasylewicz

Int. J. Comput. Geom. Appl., 2012

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid.

[BibT_eX]

[DOI]

Comput. Informatics, 2012

Watchman Routes for Lines and Segments.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

2010

Vision-Based Pursuit-Evasion in a Grid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2009

Equitable coloring of Kneser graphs.

[BibT_eX]

[DOI]

Robert Fidytek

Hanna Furmanczyk

Discuss. Math. Graph Theory, 2009

Mixed graph edge coloring.

[BibT_eX]

[DOI]

Discret. Math., 2009

An Improved Strategy for Exploring a Grid Polygon.

[BibT_eX]

[DOI]

Agnieszka Kolenderska

Proceedings of the Structural Information and Communication Complexity, 2009

Forming a connected network in a grid by asynchronous and oblivious robots.

[BibT_eX]

[DOI]

Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

2008

Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Capturing an Evader in a Building - Randomized and Deterministic Algorithms for Mobile Robots.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Mag., 2008

A note on mixed tree coloring.

[BibT_eX]

[DOI]

Hanna Furmanczyk

Inf. Process. Lett., 2008

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Packing Three-Vertex Paths in 2-Connected Cubic Graphs.

[BibT_eX]

Ars Comb., 2008

Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem.

[BibT_eX]

[DOI]

Andrzej Lingas

Agnieszka Wasylewicz

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

2007

Packing [1, Delta] -factors in graphs of small degree.

[BibT_eX]

[DOI]

J. Comb. Optim., 2007

Note on covering monotone orthogonal polygons with star-shaped polygons.

[BibT_eX]

[DOI]

Andrzej Lingas

Agnieszka Wasylewicz

Inf. Process. Lett., 2007

Cooperative mobile guards in grids.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Hanna Furmanczyk

Proceedings of the Parallel Processing and Applied Mathematics, 2007

Offline variants of the "lion and man" problem.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

An approximation algorithm for maximum P3-packing in subcubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Fault Tolerant Guarding of Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

2005

Parallel Processing Subsystems with Redundancy in a Distributed Environment.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2005

On Bounded Load Routings for Modeling k-Regular Connection Topologies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Weakly Cooperative Guards in Grids.

[BibT_eX]

[DOI]