Cover Image

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Conley, James, Georgiou, Konstantinos
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
by: Georgiou, Konstantinos, et al.
Published: (2024)

Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2026)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Bounds on the Number of Pieces in Continuous Piecewise Affine Functions
by: Zanotti, Leo
Published: (2025)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

The Complexity of Intersection Graphs of Lines in Space and Circle Orders
by: Cardinal, Jean
Published: (2024)

Further Connectivity Results on Plane Spanning Path Reconfiguration
by: Boucard, Valentino, et al.
Published: (2024)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

On maximum-sum matchings of bichromatic points
by: Chacón-Rivera, Oscar, et al.
Published: (2024)

The Price of Upwardness
by: Angelini, Patrizio, et al.
Published: (2024)

Efficient search of a minimum tree on points in a space with the $l_1$-norm
by: Kaymakov, K. V., et al.
Published: (2024)

Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)

Pathwidth of 2-Layer $k$-Planar Graphs
by: Okada, Yuto
Published: (2025)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Linear Layouts of Graphs with Priority Queues
by: Di Giacomo, Emilio, et al.
Published: (2025)

Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)

Stable Homology-Based Cycle Centrality Measures
by: Manzanares, John Rick D., et al.
Published: (2022)

Maximum rectilinear convex subsets
by: González-Aguilar, Hernán, et al.
Published: (2019)

On RAC Drawings of Graphs with Two Bends per Edge
by: Tóth, Csaba D.
Published: (2023)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2026)

Automated Symmetric Constructions in Discrete Geometry
by: Subercaseaux, Bernardo, et al.
Published: (2025)

Outerplanar and Forest Storyplans
by: Fiala, Jiří, et al.
Published: (2023)

Counting of Shortest Paths in Cubic Grid
by: Dutt, Mousumi, et al.
Published: (2018)

Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
by: Davies, James, et al.
Published: (2025)

A Couple of Simple Algorithms for $k$-Dispersion
by: Chen, Ke, et al.
Published: (2025)

Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)

Makespan Trade-offs for Visiting Triangle Edges
by: Georgiou, Konstantinos, et al.
Published: (2021)

The Fagnano Triangle Patrolling Problem
by: Georgiou, Konstantinos, et al.
Published: (2023)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
by: Yang, Puhan, et al.
Published: (2025)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
by: NASA Space Robots Team, et al.
Published: (2024)

Combinatorics of rectangulations: Old and new bijections
by: Asinowski, Andrei, et al.
Published: (2024)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
by: Gnewuch, Michael
Published: (2024)

Free Sets in Planar Graphs: History and Applications
by: Dujmović, Vida, et al.
Published: (2024)