Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints

Bandopadhyay, S., Banerjee, S., Majumdar, D. et al. (1 more author) (2025) Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. In: Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024). 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), 06-08 Dec 2024, Beijing, China. Lecture Notes in Computer Science . Springer , Singapore , pp. 14-25. ISBN 978-981-96-4447-6

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

This is an author produced version of a conference paper published in Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), made available under the terms of the Creative Commons Attribution License (CC BY), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited.
Keywords: Shortest Path, Parameterized Complexity, Positive Disjunctive Constraints, Kernelization, Planar Graph
Dates:
  • Accepted: 1 October 2024
  • Published (online): 4 May 2025
  • Published: 4 May 2025
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 17 Oct 2024 14:17
Last Modified: 02 Jun 2025 16:32
Published Version: https://link.springer.com/chapter/10.1007/978-981-...
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-981-96-4448-3_2
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)