Pawel Zylinski

According to our database1, Pawel Zylinski
  • authored at least 36 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Total Dominating Sets in Maximal Outerplanar Graphs.
Graphs and Combinatorics, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2015
The searchlight problem for road networks.
Theor. Comput. Sci., 2015

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

The Minimum Guarding Tree Problem.
Discrete Math., Alg. and Appl., 2014

Watchman routes for lines and line segments.
Comput. Geom., 2014

Clearing Connections by Few Agents.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2012
Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem.
Int. J. Comput. Geometry Appl., 2012

A Point Set Connection Problem for Autonomous Mobile Robots in a Grid.
Computing and Informatics, 2012

Watchman Routes for Lines and Segments.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2011
Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Int. J. Found. Comput. Sci., 2011

2010
Vision-Based Pursuit-Evasion in a Grid.
SIAM J. Discrete Math., 2010

2009
Equitable coloring of Kneser graphs.
Discussiones Mathematicae Graph Theory, 2009

Mixed graph edge coloring.
Discrete Mathematics, 2009

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

An Improved Strategy for Exploring a Grid Polygon.
Proceedings of the Structural Information and Communication Complexity, 2009

Forming a connected network in a grid by asynchronous and oblivious robots.
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 - .
Theor. Comput. Sci., 2008

Capturing an Evader in a Building - Randomized and Deterministic Algorithms for Mobile Robots.
IEEE Robot. Automat. Mag., 2008

A note on mixed tree coloring.
Inf. Process. Lett., 2008

Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph.
Graphs and Combinatorics, 2008

Packing Three-Vertex Paths in 2-Connected Cubic Graphs.
Ars Comb., 2008

Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Vision-Based Pursuit-Evasion in a Grid.
Proceedings of the Algorithm Theory, 2008

2007
Packing [1, Delta] -factors in graphs of small degree.
J. Comb. Optim., 2007

Note on covering monotone orthogonal polygons with star-shaped polygons.
Inf. Process. Lett., 2007

Cooperative mobile guards in grids.
Comput. Geom., 2007

Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

Offline variants of the "lion and man" problem.
Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, 2007

2006
An approximation algorithm for maximum P3-packing in subcubic graphs.
Inf. Process. Lett., 2006

Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem.
Electr. J. Comb., 2006

Fault Tolerant Guarding of Grids.
Proceedings of the Computational Science and Its Applications, 2006

An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.
Proceedings of the Computational Science and Its Applications, 2006

2005
Parallel Processing Subsystems with Redundancy in a Distributed Environment.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

On Bounded Load Routings for Modeling k-Regular Connection Topologies.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Weakly Cooperative Guards in Grids.
Proceedings of the Computational Science and Its Applications, 2005


  Loading...