Imagen de Portada

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Controlling Knockout Tournaments Without Perfect Information
por: Blažej, Václav, et al.
Publicado: (2024)

Tractable Graph Structures in EFX Orientation
por: Blažej, Václav, et al.
Publicado: (2025)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
por: Gupta, Sushmita, et al.
Publicado: (2024)

Parameterized Complexity of Directed Traveling Salesman Problem
por: Blažej, Václav, et al.
Publicado: (2025)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
por: Blažej, Václav, et al.
Publicado: (2024)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
por: Goldmann, Lito, et al.
Publicado: (2023)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
por: Wlodarczyk, Michal
Publicado: (2023)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
por: Gaikwad, Ajinkya
Publicado: (2025)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
por: Esmer, Barış Can, et al.
Publicado: (2024)

Bandwidth Parameterized by Cluster Vertex Deletion Number
por: Gima, Tatsuya, et al.
Publicado: (2023)

Dynamic framework for edge-connectivity maintenance of simple graphs
por: Wrobel, Blazej
Publicado: (2026)

Parameterized Complexity of Efficient Sortation
por: Ganian, Robert, et al.
Publicado: (2024)

Parameterized Complexity of Simultaneous Planarity
por: Fink, Simon D., et al.
Publicado: (2023)

Algorithms and Complexity of Hedge Cluster Deletion Problems
por: Konstantinidis, Athanasios L., et al.
Publicado: (2025)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
por: O'Hara, Patrick, et al.
Publicado: (2024)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
por: Ganian, Robert, et al.
Publicado: (2024)

Parameterized Complexity of Finding Dissimilar Shortest Paths
por: Funayama, Ryo, et al.
Publicado: (2024)

FPT Approximations for Connected Maximum Coverage
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Towards Transitive-free Digraphs
por: Abhinav, Ankit, et al.
Publicado: (2025)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
por: Ameli, Afrouz Jabal, et al.
Publicado: (2026)

EF(X) Orientations: A Parameterized Complexity Perspective
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
por: Anand, Aditya, et al.
Publicado: (2025)

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
por: Chen, Ho-Lin, et al.
Publicado: (2026)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Fully Dynamic Strongly Connected Components in Planar Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
por: Goyal, Dishant, et al.
Publicado: (2024)

Eulerian Graph Sparsification by Effective Resistance Decomposition
por: Jambulapati, Arun, et al.
Publicado: (2024)

Parameterized Approximability for Modular Linear Equations
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Pathfinding in Self-Deleting Graphs
por: Dvořák, Michal, et al.
Publicado: (2025)

On the Parameterized Complexity of Diverse SAT
por: Misra, Neeldhara, et al.
Publicado: (2024)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

Adversarial Robustness on Insertion-Deletion Streams
por: Gribelyuk, Elena, et al.
Publicado: (2026)

Streaming Maximal Matching with Bounded Deletions
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Cluster Vertex Deletion on Chordal Graphs
por: Cao, Yixin, et al.
Publicado: (2026)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Parameterized Complexity of Path Set Packing
por: Aravind, N. R., et al.
Publicado: (2022)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)