Image de couverture de livre

Maximum Polygon Packing: The CG:SHOP Challenge 2024

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fekete, Sándor P., Keldenich, Phillip, Krupke, Dominik, Schirra, Stefan
Format:	Preprint
Publié:	2024
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

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

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

Guarding Offices with Maximum Dispersion
par: Fekete, Sándor P., 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)

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

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

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

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

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

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

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

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

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

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)

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

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
par: Becker, Aaron T., et autres
Publié: (2024)

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

Efficient Heuristics and Exact Methods for Pairwise Interaction Sampling
par: Fekete, Sándor P., et autres
Publié: (2025)

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)

Guarding Polyominoes Under $k$-Hop Visibility
par: Filtser, Omrit, et autres
Publié: (2023)

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

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

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

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

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

Streaming Algorithms for Bin Packing and Vector Scheduling
par: Cormode, Graham, et autres
Publié: (2019)

Structural Parameterization of Steiner Tree Packing
par: Hastrich, Niko, et autres
Publié: (2025)

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

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
par: Chakrabarti, Amit, et autres
Publié: (2024)

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

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
par: Ahn, Jungho, et autres
Publié: (2025)

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

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
par: Kowaluk, Miroslaw, 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)

Deterministic Minimum Steiner Cut in Maximum Flow Time
par: Ding, Matthew, et autres
Publié: (2023)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
par: Faour, Salwa, et autres
Publié: (2025)