Parameterized complexity of path set packing

DOI10.1007/978-3-031-27051-2_25arXiv2209.08757MaRDI QIDQ6091171

Roopam Saxena, N. R. Aravind

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.08757

zbMATH Keywords

fixed parameter tractabilityset packinggraph algorithmsparameterized complexitypath set packing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• An improved kernelization algorithm for \(r\)-set packing
• The edge intersection graphs of paths in a tree
• On the parameterized complexity of multiple-interval graph problems
• A faster parameterized algorithm for set packing
• Edge and vertex intersection of paths in a tree
• Decomposition by clique separators
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• The path set packing problem
• On independent set in \(B_1\)-EPG graphs
• Approximation Algorithms for B 1-EPG Graphs
• Edge intersection graphs of single bend paths on a grid
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• An efficient parameterized algorithm for m-set packing
• Parameterized Algorithms
• On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

This page was built for publication: Parameterized complexity of path set packing