The following pages link to Paweł Żyliński (Q819179):
Displayed 50 items.
- Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem (Q819180) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Cooperative mobile guards in grids (Q876501) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- (Q963350) (redirect page) (← links)
- A note on mixed tree coloring (Q963351) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- The snow team problem (clearing directed subgraphs by mobile agents) (Q1679971) (← links)
- Coronas and domination subdivision number of a graph (Q1714015) (← links)
- Clearing directed subgraphs by mobile agents. Variations on covering with paths (Q1741492) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- Spanning trees with disjoint dominating and 2-dominating sets (Q2062688) (← links)
- Vertex-edge domination in cubic graphs (Q2198396) (← links)
- Corrigendum to ``Note on covering monotone orthogonal polygons'' (Q2252650) (← links)
- Graphs with equal domination and covering numbers (Q2292127) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- Bipartization of graphs (Q2334080) (← links)
- The searchlight problem for road networks (Q2354403) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- Total dominating sets in maximal outerplanar graphs (Q2409534) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Watched guards in art galleries (Q2490667) (← links)
- Watchman Routes for Lines and Segments (Q2904541) (← links)
- (Q3070345) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- (Q3428585) (← links)
- (Q3576691) (← links)
- (Q3602859) (← links)
- (Q4610034) (← links)
- LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093) (← links)
- (Q4659754) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Graphs with equal domination and certified domination numbers (Q5106692) (← links)
- Certified domination (Q5154565) (← links)
- Reconfiguring Minimum Dominating Sets in Trees (Q5216280) (← links)
- Equitable coloring of Kneser graphs (Q5324107) (← links)
- THE MINIMUM GUARDING TREE PROBLEM (Q5411806) (← links)
- Cooperative guards in art galleries (Q5440225) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)
- (Q5489465) (← links)
- An Efficient Algorithm for Mobile Guarded Guards in Simple Grids (Q5505331) (← links)
- Fault Tolerant Guarding of Grids (Q5505335) (← links)
- Vision-Based Pursuit-Evasion in a Grid (Q5892564) (← links)
- Algorithms and Computation (Q5897894) (← links)