Image de couverture de livre

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Yuxi, Tian, Kangyi, Xiao, Mingyu
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
par: Tian, Kangyi, et autres
Publié: (2026)

Faster Parameterized Vertex Multicut
par: Chu, Huairui, et autres
Publié: (2026)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
par: Xiong, Ziliang, et autres
Publié: (2024)

A Refined Kernel for $d$-Hitting Set
par: Liu, Yuxi, et autres
Publié: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
par: Kenig, Batya, et autres
Publié: (2024)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
par: Iwata, Satoru, et autres
Publié: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Parameterizing Path Partitions
par: Fernau, Henning, et autres
Publié: (2022)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
par: Haeupler, Bernhard, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Linear Kernels for $l$-Exact Component Order Connectivity
par: Liu, Yuxi, et autres
Publié: (2026)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
par: Wlodarczyk, Michal
Publié: (2023)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
par: Nederlof, Jesper
Publié: (2025)

Treewidth Parameterized by Feedback Vertex Number
par: Molter, Hendrik, et autres
Publié: (2025)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
par: Bai, Tian, et autres
Publié: (2022)

Parameterized Algorithms for Computing Pareto Sets
par: Könen, Joshua, et autres
Publié: (2025)

Parameterized Restless Temporal Path
par: Cauvi, Justine, et autres
Publié: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
par: Bucić, Matija, et autres
Publié: (2025)

Dynamic Treewidth in Logarithmic Time
par: Korhonen, Tuukka
Publié: (2025)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
par: Khanna, Sanjeev, et autres
Publié: (2026)

A Note on Interdiction of Linear Minimization Problems
par: Cong, Yu, et autres
Publié: (2026)

The Support of Bin Packing is Exponential
par: Jansen, Klaus, et autres
Publié: (2025)

A Single Exponential-Time FPT Algorithm for Cactus Contraction
par: Krithika, R., et autres
Publié: (2025)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2026)

Parameterized Maximum Node-Disjoint Paths
par: Lampis, Michael, et autres
Publié: (2024)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
par: Borowitz, Jannick, et autres
Publié: (2023)

Packed Acyclic Deterministic Finite Automata
par: Shibata, Hiroki, et autres
Publié: (2024)

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2025)