default search action
Pawel Zylinski
Person information
- unicode name: Paweł Żyliński
- affiliation (PhD 2004): University of Gdańsk, Institute of Informatics, Gdańsk, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Minh Tuan Ha, Paul Jungeblut, Torsten Ueckerdt, Pawel Zylinski:
Primal-Dual Cops and Robber. Comput. Geom. Topol. 3(2): 4:1-4:12 (2024) - [i5]Dariusz Dereniowski, Janusz Dybizbanski, Przemyslaw Karpinski, Michal Zakrzewski, Pawel Zylinski:
Low-degree spanning trees of 2-edge-connected graphs in linear time. CoRR abs/2410.20137 (2024) - 2022
- [j31]Mateusz Miotk
, Pawel Zylinski
Spanning trees with disjoint 2 dominating and 2-dominating sets. Discuss. Math. Graph Theory 42(1): 299-308 (2022) - [c20]Matt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman
On Vertex Guarding Staircase Polygons. LATIN 2022: 746-760 - [i4]Lukasz Mielewczyk, Leonidas Palios, Pawel Zylinski:
The Rectilinear Steiner Forest Arborescence problem. CoRR abs/2210.04576 (2022) - 2021
- [j30]Alejandra Martínez-Moraian, David Orden
Optimizing generalized kernels of polygons. J. Glob. Optim. 80(4): 887-920 (2021) - [c19]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Illuminating the x-Axis by α-Floodlights. ISAAC 2021: 11:1-11:12 - 2020
- [j29]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp
Certified domination. AKCE Int. J. Graphs Comb. 17(1): 86-97 (2020) - [j28]Mateusz Miotk, Jerzy Topp
Disjoint dominating and 2-dominating sets in graphs. Discret. Optim. 35: 100553 (2020) - [j27]Radoslaw Ziemann, Pawel Zylinski
Vertex-edge domination in cubic graphs. Discret. Math. 343(11): 112075 (2020) - [j26]Bengt J. Nilsson
How to Keep an Eye on Small Things. Int. J. Comput. Geom. Appl. 30(2): 97-120 (2020) - [j25]Andrzej Lingas
Graphs with equal domination and covering numbers. J. Comb. Optim. 39(1): 55-71 (2020) - [c18]Bengt J. Nilsson
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility. COCOON 2020: 311-323 - [i3]Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility. CoRR abs/2007.08368 (2020)
2010 – 2019
- 2019
- [j24]Magdalena Lemanska, Eduardo Rivera-Campo, Radoslaw Ziemann, Rita Zuazua, Pawel Zylinski
Convex dominating sets in maximal outerplanar graphs. Discret. Appl. Math. 265: 142-157 (2019) - [j23]Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Bipartization of Graphs. Graphs Comb. 35(5): 1169-1177 (2019) - [j22]Dariusz Dereniowski
Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. 102: 57-68 (2019) - [c17]Bengt J. Nilsson, Pawel Zylinski:
The Lighthouse Problem - Navigating by Lighthouses in Geometric Domains. CCCG 2019: 71-77 - [c16]Matt Gibson, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Pawel Zylinski:
A Note on Guarding Staircase Polygons. CCCG 2019: 105-109 - 2018
- [i2]David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
Generalized kernels of polygons under rotation. CoRR abs/1802.05995 (2018) - 2017
- [j21]Magdalena Lemanska
Total Dominating Sets in Maximal Outerplanar Graphs. Graphs Comb. 33(4): 991-998 (2017) - [c15]Dariusz Dereniowski
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203 - [i1]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR abs/1712.00316 (2017) - 2015
- [j20]Dariusz Dereniowski
The searchlight problem for road networks. Theor. Comput. Sci. 591: 28-59 (2015) - 2014
- [j19]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman routes for lines and line segments. Comput. Geom. 47(4): 527-538 (2014) - [j18]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
The Minimum Guarding Tree Problem. Discret. Math. Algorithms Appl. 6(1) (2014) - [j17]Andrzej Lingas, Leonidas Palios
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]. Inf. Process. Lett. 114(11): 646-654 (2014) - [c14]Christos Levcopoulos
Clearing Connections by Few Agents. FUN 2014: 289-300 - 2012
- [j16]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski:
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid. Comput. Informatics 31(2): 349-369 (2012) - [j15]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the R-Star Covering Problem. Int. J. Comput. Geom. Appl. 22(2): 103-142 (2012) - [c13]Adrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski:
Watchman Routes for Lines and Segments. SWAT 2012: 36-47 - 2011
- [j14]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. Int. J. Found. Comput. Sci. 22(8): 1949-1969 (2011) - 2010
- [j13]Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. SIAM J. Discret. Math. 24(3): 1177-1204 (2010)
2000 – 2009
- 2009
- [j12]Hanna Furmanczyk
Mixed graph edge coloring. Discret. Math. 309(12): 4027-4036 (2009) - [j11]Robert Fidytek, Hanna Furmanczyk, Pawel Zylinski:
Equitable coloring of Kneser graphs. Discuss. Math. Graph Theory 29(1): 119-142 (2009) - [c12]Adrian Kosowski, Ichiro Suzuki, Pawel Zylinski:
Forming a connected network in a grid by asynchronous and oblivious robots. IMCSIT 2009: 583-588 - [c11]Agnieszka Kolenderska, Adrian Kosowski, Michal Malafiejski
An Improved Strategy for Exploring a Grid Polygon. SIROCCO 2009: 222-236 - [c10]Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. WADS 2009: 168-180 - 2008
- [j10]Adrian Kosowski, Pawel Zylinski:
Packing Three-Vertex Paths in 2-Connected Cubic Graphs. Ars Comb. 89 (2008) - [j9]Adrian Kosowski, Michal Malafiejski
Tighter Bounds on the Size of a Maximum P3-Matching in a Cubic Graph. Graphs Comb. 24(5): 461-468 (2008) - [j8]Hanna Furmanczyk
A note on mixed tree coloring. Inf. Process. Lett. 106(4): 133-135 (2008) - [j7]Ichiro Suzuki, Pawel Zylinski:
Capturing an Evader in a Building - Randomized and Deterministic Algorithms for Mobile Robots. IEEE Robotics Autom. Mag. 15(2): 16-26 (2008) - [j6]Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski:
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning - . Theor. Comput. Sci. 399(3): 220-235 (2008) - [c9]Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel Zylinski:
Vision-Based Pursuit-Evasion in a Grid. SWAT 2008: 53-64 - [c8]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. WALCOM 2008: 157-168 - 2007
- [j5]Adrian Kosowski, Michal Malafiejski
Cooperative mobile guards in grids. Comput. Geom. 37(2): 59-71 (2007) - [j4]Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski:
Note on covering monotone orthogonal polygons with star-shaped polygons. Inf. Process. Lett. 104(6): 220-227 (2007) - [j3]Adrian Kosowski, Michal Malafiejski
Packing [1, Delta] -factors in graphs of small degree. J. Comb. Optim. 14(1): 63-86 (2007) - [c7]Adrian Dumitrescu, Ichiro Suzuki, Pawel Zylinski:
Offline variants of the "lion and man" problem. SCG 2007: 102-111 - [c6]Hanna Furmanczyk
Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs. PPAM 2007: 1001-1008 - 2006
- [j2]Pawel Zylinski:
Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem. Electron. J. Comb. 13(1) (2006) - [j1]Adrian Kosowski, Michal Malafiejski
An approximation algorithm for maximum P3-packing in subcubic graphs. Inf. Process. Lett. 99(6): 230-233 (2006) - [c5]Adrian Kosowski, Michal Malafiejski
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. ICCSA (1) 2006: 141-150 - [c4]Adrian Kosowski, Michal Malafiejski
Fault Tolerant Guarding of Grids. ICCSA (1) 2006: 161-170 - 2005
- [c3]Michal Malafiejski, Pawel Zylinski:
Weakly Cooperative Guards in Grids. ICCSA (1) 2005: 647-656 - [c2]Adrian Kosowski, Michal Malafiejski
On Bounded Load Routings for Modeling k-Regular Connection Topologies. ISAAC 2005: 614-623 - [c1]Adrian Kosowski, Michal Malafiejski
Parallel Processing Subsystems with Redundancy in a Distributed Environment. PPAM 2005: 1002-1009
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: