:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Macaskill-Smith, Zachary, Sharma, Unmol, Warner, Melissa, Varga, Kálmán, Hyde, David A. B.
Format:	Preprint
Published:	2026
Subjects:	Quantum Physics 81P68, 05C83, 05C85 F.2.2; G.2.2; B.7.2
Online Access:	https://arxiv.org/abs/2604.25433
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Overview of Universal Obstructions for Graph Parameters
by: Paul, Christophe, et al.
Published: (2023)

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

Dynamic programming on bipartite tree decompositions
by: Jaffke, Lars, et al.
Published: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
by: Morelle, Laure, et al.
Published: (2025)

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

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

A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)

Excluding Pinched Spheres
by: Morelle, Laure, et al.
Published: (2025)

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

Faster parameterized algorithms for modification problems to minor-closed classes
by: Morelle, Laure, et al.
Published: (2022)

Vertex identification to a forest
by: Morelle, Laure, et al.
Published: (2024)

Excluding a Forest Induced Minor
by: Bonnet, Édouard, et al.
Published: (2025)

Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
by: Sau, Ignasi, et al.
Published: (2024)

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

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)

The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)

The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

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

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

On Strict Brambles
by: Lardas, Emmanouil, et al.
Published: (2022)

Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)

Colorful Minors
by: Protopapas, Evangelos, et al.
Published: (2025)

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

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

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

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

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

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, et al.
Published: (2026)

Prime vertex-minors of a prime graph
by: Kim, Donggyu, et al.
Published: (2022)

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

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

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

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)

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
by: Cheng, Christine T., et al.
Published: (2026)

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