Imagen de Portada

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Beisegel, Jesse, Chiarelli, Nina, Köhler, Ekkehard, Milanič, Martin, Muršič, Peter, Scheffler, Robert
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Computational Complexity Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
por: Beisegel, Jesse, et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
por: Beisegel, Jesse, et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
por: Beisegel, Jesse, et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

Breadth-First Search Trees with Many or Few Leaves
por: Beisegel, Jesse, et al.
Publicado: (2026)

Computing Hamiltonian Paths with Partial Order Restrictions
por: Beisegel, Jesse, et al.
Publicado: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
por: Lucke, Felicia, et al.
Publicado: (2024)

Online Coloring of Short Intervals
por: Chybowska-Sokół, Joanna, et al.
Publicado: (2018)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
por: Kratochvíl, Jan, et al.
Publicado: (2020)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

Exact Algorithms for Edge Deletion to Cactus
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2026)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
por: Bedert, Benjamin, et al.
Publicado: (2025)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
por: Hsieh, Jun-Ting, et al.
Publicado: (2026)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
por: Mary, Arnaud
Publicado: (2024)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

An unconditional lower bound for the active-set method on the hypercube
por: Disser, Yann, et al.
Publicado: (2025)

An unconditional lower bound for the active-set method in convex quadratic maximization
por: Bach, Eleon, et al.
Publicado: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
por: Cordasco, Gennaro, et al.
Publicado: (2024)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2025)

An efficient uniqueness theorem for overcomplete tensor decomposition
por: Koiran, Pascal
Publicado: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
por: Le, Hoang-Oanh, et al.
Publicado: (2024)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)