Imagen de Portada

On the Complexity of Vertex-Splitting Into an Interval Graph

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abu-Khzam, Faisal N., Chakraborty, Dipayan, Isenmann, Lucas, Oijid, Nacim
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

On the Complexity of 2-club Cluster Editing with Vertex Splitting
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

On the Complexity of Claw-Free Vertex Splitting
por: Abu-Khzam, Faisal N., et al.
Publicado: (2025)

Bounded degree QBF and positional games
por: Oijid, Nacim
Publicado: (2024)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
por: Marcille, Clara, et al.
Publicado: (2026)

Bicluster Editing with Overlaps: A Vertex Splitting Approach
por: Abu-Khzam, Faisal N., et al.
Publicado: (2025)

A Linear Kernel for Planar Vector Domination
por: Sahili, Mahabba El, et al.
Publicado: (2023)

On the complexity of the Maker-Breaker happy vertex game
por: Hilaire, Mathieu, et al.
Publicado: (2026)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

A two-player version of the assignment problem
por: Galliot, Florian, et al.
Publicado: (2026)

On the parameterized complexity of the Maker-Breaker domination game
por: Bagan, Guillaume, et al.
Publicado: (2026)

Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

The Interplay Between Domination and Separation in Graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2026)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
por: Firbas, Alexander, et al.
Publicado: (2024)

Complexity of Maker-Breaker Games on Edge Sets of Graphs
por: Duchêne, Eric, et al.
Publicado: (2023)

The Complexity of Cluster Vertex Splitting and Company
por: Firbas, Alexander, et al.
Publicado: (2023)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

On full-separating sets and related codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

The Parameterized Complexity of Computing the Linear Vertex Arboricity
por: Erhardt, Alexander, et al.
Publicado: (2025)

On the Descriptive Complexity of Vertex Deletion Problems
por: Bannach, Max, et al.
Publicado: (2024)

Asymmetric Number Partitioning with Splitting and Interval Targets
por: Bismuth, Samuel, et al.
Publicado: (2022)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
por: Fan, Austen, et al.
Publicado: (2026)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
por: Aute, Shubhada, et al.
Publicado: (2026)

The Computational Complexity of Factored Graphs
por: Gupta, Shreya, et al.
Publicado: (2024)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
por: Tale, Prafullkumar
Publicado: (2025)

The Parameterized Complexity of Coloring Mixed Graphs
por: Lauerbach, Antonio, et al.
Publicado: (2026)

Hexasort -- The Complexity of Stacking Colors on Graphs
por: Klocker, Linus, et al.
Publicado: (2026)

On the Complexity of Problems on Tree-structured Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2022)

Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules
por: Hirahara, Shuichi, et al.
Publicado: (2025)

AraSpell: A Deep Learning Approach for Arabic Spelling Correction
por: Salhab, Mahmoud, et al.
Publicado: (2024)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
por: Dey, Palash, et al.
Publicado: (2026)

On $[1,2]$-Domination in Interval and Circle Graphs
por: Meybodi, Mohsen Alambardar, et al.
Publicado: (2024)

Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree
por: Liu, Brian, et al.
Publicado: (2024)

The Complexity of Contracting Bipartite Graphs into Small Cycles
por: Krithika, R., et al.
Publicado: (2022)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
por: Retschmeier, Lukas
Publicado: (2025)

Cluster Vertex Deletion Problems on Cubic Graphs
por: Rusu, Irena
Publicado: (2025)