Image de couverture de livre

Guarding Polyominoes Under $k$-Hop Visibility

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Filtser, Omrit, Krohn, Erik, Nilsson, Bengt J., Rieck, Christian, Schmidt, Christiane
Format:	Preprint
Publié:	2023
Sujets:	Computational Geometry Data Structures and Algorithms F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Guarding Offices with Maximum Dispersion
par: Fekete, Sándor P., et autres
Publié: (2025)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
par: Fekete, Sándor P., et autres
Publié: (2022)

Improving Online Bin Covering with Little Advice
par: Brodnik, Andrej, et autres
Publié: (2025)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
par: Fekete, Sándor P., et autres
Publié: (2024)

Sliding Squares in Parallel
par: Akitaya, Hugo A., et autres
Publié: (2024)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
par: Becker, Aaron T., et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

Online Maximum Independent Set of Hyperrectangles
par: Advani, Rishi, et autres
Publié: (2023)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
par: Le, Hung, et autres
Publié: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
par: Fekete, Sándor P., et autres
Publié: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
par: Fekete, Sándor P., et autres
Publié: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
par: Brankovic, Milutin, et autres
Publié: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
par: Grandoni, Fabrizio, et autres
Publié: (2024)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
par: Gudmundsson, Joachim, et autres
Publié: (2021)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
par: Aichholzer, Oswin, et autres
Publié: (2026)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Planar Network Diversion
par: Bentert, Matthias, et autres
Publié: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

An improved local search based algorithm for $k^-$-star partition
par: Gong, Mingyang, et autres
Publié: (2025)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
par: Hommelsheim, Felix, et autres
Publié: (2025)

Simple in-place yet comparison-optimal Mergesort
par: Siebert, Christian
Publié: (2025)

Graph Threading
par: Demaine, Erik D., et autres
Publié: (2023)

Line Cover and Related Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
par: Kumar, Nikhil, et autres
Publié: (2025)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)