:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Muth, Alicia, Neimand, E. Dov
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Combinatorics 05C05, 05C12, 05C40 G.2.2
Online Access:	https://arxiv.org/abs/2510.18066
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

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

The Minimum Subgraph Complementation Problem
by: Gutiérrez, Juan, et al.
Published: (2025)

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

On Relaxation of Dominant Sets
by: Koster, Max
Published: (2022)

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

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

Independent Locating-Dominating Sets in Pseudotrees
by: Cáceres, José, 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)

List Coloring of some Cayley graphs using Kernel perfections
by: S, Prajnanaswaroopa
Published: (2024)

Alon-Tarsi Number of Some Regular Graphs
by: Prajnanaswaroopa, S.
Published: (2023)

TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead
by: Dau, Son Hoang, et al.
Published: (2022)

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

Combinatorial spectra using polynomials
by: Cichacz, Sylwia, et al.
Published: (2024)

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

Posets are easily testable
by: Fekete, Panna Tímea, et al.
Published: (2023)

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

Symmetric-Difference (Degeneracy) and Signed Tree Models
by: Bonnet, Édouard, et al.
Published: (2024)

Chromatic Feature Vectors for 2-Trees: Exact Formulas for Partition Enumeration with Network Applications
by: Allagan, J., et al.
Published: (2025)

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

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

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

Sparse Induced Subgraphs of Large Treewidth
by: Bonnet, Édouard
Published: (2024)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
by: Bonnet, Édouard, et al.
Published: (2023)

Cluster deletion and clique partitioning in graphs with bounded clique number
by: Galesi, Nicola, et al.
Published: (2025)

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

An improved bound for 2-distance coloring of planar graphs with girth six
by: Deniz, Zakir
Published: (2022)

A Vector Representation for Phylogenetic Trees
by: Chauve, Cedric, et al.
Published: (2024)

Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
by: Carr, Avery
Published: (2025)

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

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

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

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

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

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

On the parameterized complexity of computing good edge-labelings
by: de Andrade, Davi, et al.
Published: (2024)