Image de couverture de livre

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Berthe, Gaétan, Bougeret, Marin, Gonçalves, Daniel, Raymond, Jean-Florent
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
par: Berthe, Gaétan, et autres
Publié: (2024)

Kick the cliques
par: Berthe, Gaétan, et autres
Publié: (2024)

Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
par: Berthe, Gaétan, et autres
Publié: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

Approximating optimization problems in graphs with locational uncertainty
par: Bougeret, Marin, et autres
Publié: (2022)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
par: Koana, Tomohiro, et autres
Publié: (2024)

Faster exponential algorithms for cut problems via geometric data structures
par: Kozma, László, et autres
Publié: (2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
par: Bougeret, Marin, et autres
Publié: (2026)

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
par: Marin, Malory
Publié: (2025)

A Tight Subexponential-time Algorithm for Two-Page Book Embedding
par: Ganian, Robert, et autres
Publié: (2024)

Computing crossing numbers with topological and geometric restrictions
par: Hamm, Thekla, et autres
Publié: (2024)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

Reconstruction of geometric random graphs with the Simple algorithm
par: Stegehuis, Clara, et autres
Publié: (2024)

On efficient robust regression with subquadratic samples
par: Adil, Deeksha, et autres
Publié: (2026)

Parameterized and approximation algorithms for coverings points with segments in the plane
par: Kowalska, Katarzyna, et autres
Publié: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
par: Bougeret, Marin, et autres
Publié: (2025)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

Local Routing on Ordered $Θ$-graphs
par: van Renssen, André, et autres
Publié: (2025)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Dynamic parameterized problems on unit disk graphs
par: An, Shinwoo, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

A face cover perspective to $\ell_1$ embeddings of planar graphs
par: Filtser, Arnold
Publié: (2019)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
par: Elkin, Yury, et autres
Publié: (2021)

Kernelization dichotomies for hitting minors under structural parameterizations
par: Bougeret, Marin, et autres
Publié: (2025)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
par: Wesołowski, Adam, et autres
Publié: (2025)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

Strassen's algorithm via orbit flip graphs
par: Ikenmeyer, Christian, et autres
Publié: (2025)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

Retroactive Monotonic Priority Queues via Range Searching
par: Castro, Lucas, et autres
Publié: (2025)

Euclidean distance compression via deep random features
par: Leroux, Brett, et autres
Publié: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

Fully Subexponential Time Approximation Scheme for Product Partition
par: Costandin, Marius
Publié: (2024)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
par: Duan, Hongyi, et autres
Publié: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
par: Bhore, Sujoy, et autres
Publié: (2024)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
par: Maus, Victor, et autres
Publié: (2026)

Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
par: Bai, Xingjian, et autres
Publié: (2024)