Image de couverture de livre

Parameterized Complexity of Path Set Packing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Aravind, N. R., Saxena, Roopam
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

The Parameterized Complexity of Terminal Monitoring Set
par: Aravind, N. R., et autres
Publié: (2024)

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

Parameterized Complexity of Submodular Minimization under Uncertainty
par: Kakimura, Naonori, et autres
Publié: (2024)

Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
par: Marin, Malory
Publié: (2025)

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

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

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

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
par: Manna, Bubai, et autres
Publié: (2024)

On the Parameterized Intractability of Determinant Maximization
par: Ohsaka, Naoto
Publié: (2022)

Reconfiguration of Multisets with Applications to Bin Packing
par: Kam, Jeffrey, et autres
Publié: (2024)

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

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

On the Structural Parameterizations of 2-Club with Triangle Constraints
par: Jacob, Ashwin, et autres
Publié: (2025)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

On the Number of Non-equivalent Parameterized Squares in a String
par: Hamai, Rikuya, et autres
Publié: (2024)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
par: Madathil, Jayakrishnan, et autres
Publié: (2024)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
par: Mathur, Yashaswini, et autres
Publié: (2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
par: Foucaud, Florent, et autres
Publié: (2024)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
par: Aute, Shubhada, et autres
Publié: (2026)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
par: Komusiewicz, Christian, et autres
Publié: (2026)

Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
par: Brubach, Brian, et autres
Publié: (2021)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Tight Localizations of Feedback Sets
par: Hecht, Michael, et autres
Publié: (2020)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Tight Paths and Tight Pairs in Weighted Directed Graphs
par: Balcázar, José Luis
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
par: Kaymakov, Kirill V., et autres
Publié: (2024)

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

Partially Ordered Sets Corresponding to the Partition Problem
par: Kubo, Susumu
Publié: (2024)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
par: Foucaud, Florent, et autres
Publié: (2026)