:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Glazenburg, Erwin, van der Horst, Thijs, Peters, Tom, Speckmann, Bettina, Staals, Frank
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry 68Q25 F.2.2
Online Access:	https://arxiv.org/abs/2401.02897
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

The Word Problem for Products of Symmetric Groups
by: Simon, Hans U.
Published: (2025)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
by: Xia, Mingji
Published: (2026)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Quantum Advantage in Computational Chemistry?
by: Gundlach, Hans, et al.
Published: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

Overlapping Biclustering
by: Bentert, Matthias, et al.
Published: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
by: Kullmann, Oliver, et al.
Published: (2026)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
by: Keil, J. Mark, et al.
Published: (2025)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

On strictly output sensitive color frequency reporting
by: Glazenburg, Erwin, et al.
Published: (2026)

Computing shortest closed curves on non-orientable surfaces
by: Bulavka, Denys, et al.
Published: (2024)

Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
by: Philip, Geevarghese, et al.
Published: (2026)

The Tower of Hanoi: Optimality Proofs, Multi-Peg Bounds, and Computational Frontiers
by: Junyi, Qi
Published: (2025)

Fair allocations with subadditive and XOS valuations
by: Feige, Uriel, et al.
Published: (2025)

On MMS, APS and XOS
by: Feige, Uriel, et al.
Published: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

The Maximum Clique Problem in a Disk Graph Made Easy
by: Keil, J. Mark, et al.
Published: (2024)

A Comprehensive Mathematical and System-Level Analysis of Autonomous Vehicle Timelines
by: Perrone, Paul
Published: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
by: Grochow, Joshua A., et al.
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
by: Bell, Tolson, et al.
Published: (2024)

Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)