Cover Image

Compressed data structures for Heegaard splittings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ennes, Henrique, Maria, Clément
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Data Structures and Algorithms Geometric Topology
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hardness of computation of quantum invariants on 3-manifolds with restricted topology
by: Ennes, Henrique, et al.
Published: (2025)

Criteria for toroidal embedding of one-vertex ribbon graphs
by: Berezin, Tim
Published: (2022)

Filling a triangulation of the 2-sphere
by: Doyle, Peter, et al.
Published: (2023)

A Structural Equivalence of Symmetric TSP to a Constrained Group Steiner Tree Problem
by: Arslanoğlu, Yılmaz
Published: (2026)

Heegaard splittings and the tight Giroux Correspondence
by: Licata, Joan, et al.
Published: (2023)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
by: Chambers, Erin Wolf, et al.
Published: (2024)

On the existence of minimal Heegaard surfaces
by: Ketover, Daniel, et al.
Published: (2019)

New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes
by: Nghiem, Nhat A.
Published: (2025)

A Heegaard-Floer TQFT for link cobordisms
by: Eftekhary, Eaman
Published: (2024)

A fast algorithm for the Hecke representation of the braid group, and applications to the computation of the HOMFLY-PT polynomial and the search for interesting braids
by: Maria, Clément, et al.
Published: (2025)

On Sparse Representations of 3-Manifolds
by: Huszár, Kristóf, et al.
Published: (2025)

Heegaard Floer homology and maximal twisting numbers
by: Cavallo, Alberto, et al.
Published: (2026)

Rank inequalities for the Heegaard Floer homology of branched covers
by: Hendricks, Kristen, et al.
Published: (2020)

Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)

Hard diagrams of split links
by: Lunel, Corentin, et al.
Published: (2024)

The hat and plus version of the Heegaard Floer contact invariant are not equivalent
by: Cavallo, Alberto, et al.
Published: (2026)

Well-quasi-orders on embedded planar graphs
by: Lunel, Corentin, et al.
Published: (2025)

Hashing geographical point data using the space-filling H-curve
by: Netay, Igor V.
Published: (2024)

An algorithm for Tambara-Yamagami quantum invariants of 3-manifolds, parameterized by the first Betti number
by: Delaney, Colleen, et al.
Published: (2023)

Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
by: de Berg, Sarita, et al.
Published: (2026)

Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
by: Depian, Thomas, et al.
Published: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
by: Gusain, Rachana, et al.
Published: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
by: Liu, Shuilian, et al.
Published: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs
by: Banik, Aritra, et al.
Published: (2025)

The Peculiarities of Extending Queue Layouts
by: Depian, Thomas, et al.
Published: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
by: Chan, Timothy M., et al.
Published: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
by: Bhore, Sujoy, et al.
Published: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
by: Ghaseminia, Benyamin, et al.
Published: (2025)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
by: An, Shinwoo, et al.
Published: (2025)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
by: Fomin, Fedor V., et al.
Published: (2025)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
by: Chan, Timothy M., et al.
Published: (2025)

Uncrossed Multiflows and Applications to Disjoint Paths
by: Chekuri, Chandra, et al.
Published: (2025)

On computing the (exact) Fréchet distance with a frog
by: Conradi, Jacobus, et al.
Published: (2025)

Optimal Orthogonal Drawings in Linear Time
by: Didimo, Walter, et al.
Published: (2025)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
by: Duan, Hongyi, et al.
Published: (2025)