Parameterized Complexity of Generalizations of Edge Dominating Set

Aute, S., Panolan, F. orcid.org/0000-0001-6213-8687, Saha, S. et al. (2 more authors) (2025) Parameterized Complexity of Generalizations of Edge Dominating Set. In: 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025). 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025), 20-23 Jan 2025, Bratislava, Slovakia. Lecture Notes in Computer Science, 15538 . Springer , Cham, Switzerland , pp. 65-79. ISBN 978-3-031-82669-6

Metadata

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

This is an author produced version of a proceedings paper published in SOFSEM 2025: Theory and Practice of Computer Science 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part I, 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: Edge Dominating Set, FPT, Hypergraph, Kernel,
Dates:
  • Published: 7 February 2025
  • Published (online): 6 February 2025
  • Accepted: 13 November 2024
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: 03 Jan 2025 13:49
Last Modified: 07 Feb 2025 16:06
Published Version: https://link.springer.com/chapter/10.1007/978-3-03...
Status: Published
Publisher: Springer
Series Name: Lecture Notes in Computer Science
Identification Number: 10.1007/978-3-031-82670-2_6
Open Archives Initiative ID (OAI ID):

Download

Export

Statistics


CORE (COnnecting REpositories)