Imagen de Portada

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	de Verdière, Éric Colin, Magnard, Thomas
Formato:	Preprint
Publicado:	2021
Materias:	Computational Geometry 05C85, 57M15 F.2.2; G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

On treewidth and maximum cliques
por: Chudnovsky, Maria, et al.
Publicado: (2024)

Shortest two disjoint paths in conservative graphs
por: Schlotter, Ildikó
Publicado: (2023)

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

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

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

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

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

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

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

Bipartite Turán problem on cographs
por: Zimmermann, Jakob Paul
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

On λ-backbone coloring of cliques with tree backbones in linear time
por: Michalik, Krzysztof, et al.
Publicado: (2021)

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

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

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

On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs
por: Rafiepour, Mehrdad, et al.
Publicado: (2025)

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

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

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

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

A note on locating-dominating sets in twin-free graphs
por: Bousquet, Nicolas, et al.
Publicado: (2024)

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

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

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