:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	de Verdière, Éric Colin, Magnard, Thomas
Format:	Preprint
Published:	2021
Subjects:	Computational Geometry 05C85, 57M15 F.2.2; G.2.2
Online Access:	https://arxiv.org/abs/2107.06236
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On the width of complicated JSJ decompositions
by: Huszár, Kristóf, et al.
Published: (2023)

On the twin-width of smooth manifolds
by: Bonnet, Édouard, et al.
Published: (2024)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

On Chollet's Permanent Conjecture for Graph Laplacians
by: Pant, Priyanshu, et al.
Published: (2026)

On treewidth and maximum cliques
by: Chudnovsky, Maria, et al.
Published: (2024)

Finding Diverse Minimum s-t Cuts
by: de Berg, Mark, et al.
Published: (2023)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
by: Haslebacher, Sebastian
Published: (2025)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
by: Gartland, Peter, et al.
Published: (2023)

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)

Kernelization dichotomies for hitting minors under structural parameterizations
by: Bougeret, Marin, et al.
Published: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)

A new density limit for unanimity in majority dynamics on random graphs
by: Kim, Jeong Han, et al.
Published: (2025)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
by: Bhandari, Kritika, et al.
Published: (2025)

Bipartite Turán problem on cographs
by: Zimmermann, Jakob Paul
Published: (2026)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
by: Cunha, Luís Felipe I., et al.
Published: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
by: Bougeret, Marin, et al.
Published: (2024)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
by: Masařík, Tomáš, et al.
Published: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)

Graph Parameters, Universal Obstructions, and WQO
by: Paul, Christophe, et al.
Published: (2023)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
by: Macaskill-Smith, Zachary, et al.
Published: (2026)

Designing Capacitated Subnetworks for Shortest Path Routing
by: Chimani, Markus, et al.
Published: (2026)

On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

An algorithmic Vizing's theorem: toward efficient edge-coloring sampling with an optimal number of colors
by: De Meyer, Lucas, et al.
Published: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Community Detection using Fortunato's Performance Measure
by: Thakar, Srushti, et al.
Published: (2025)

DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)

Expanded-clique graphs and the domination problem
by: Dourado, Mitre C., et al.
Published: (2022)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
by: De Meyer, Lucas
Published: (2025)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

On Grundy indices for complete geometric graphs
by: Lara, Dolores, et al.
Published: (2025)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

A practical algorithm for 2-admissibility
by: Awofeso, Christine, et al.
Published: (2025)