Complexity framework for forbidden subgraphs IV: The Steiner Forest problem

Bodlaender, Hans L.; Johnson, Matthew; Martin, Barnaby; Oostveen, Jelle .J.; Pandey, Sukanya; Paulusma, Daniel; Smith, Siani; van Leeuwen, Erik Jan

doi:10.1007/978-3-031-63021-7_16

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem

Bodlaender, Hans L.; Johnson, Matthew; Martin, Barnaby; Oostveen, Jelle .J.; Pandey, Sukanya; Paulusma, Daniel; Smith, Siani; van Leeuwen, Erik Jan

Authors

Hans L. Bodlaender

Professor Matthew Johnson matthew.johnson2@durham.ac.uk
Head Of Department

Dr Barnaby Martin barnaby.d.martin@durham.ac.uk
Associate Professor

Jelle .J. Oostveen

Sukanya Pandey

Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor

Siani Smith

Erik Jan van Leeuwen

Citation

Bodlaender, H. L., Johnson, M., Martin, B., Oostveen, J. .., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2024, July). Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. Presented at IWOCA, Ischia, Italy

Presentation Conference Type	Conference Paper (published)
Conference Name	IWOCA
Start Date	Jul 1, 2024
End Date	Jul 3, 2024
Acceptance Date	May 1, 2024
Online Publication Date	Jun 22, 2024
Publication Date	Jun 22, 2024
Deposit Date	Dec 31, 2024
Publicly Available Date	Jan 3, 2025
Journal	Lecture Notes in Computer Science
Print ISSN	0302-9743
Publisher	Springer
Peer Reviewed	Peer Reviewed
Volume	14764
Pages	206-217
Series Title	Lecture Notes in Computer Science
Series ISSN	0302-9743
Book Title	Combinatorial Algorithms
ISBN	9783031630200
DOI	https://doi.org/10.1007/978-3-031-63021-7_16
Public URL	https://durham-repository.worktribe.com/output/3230225
Publisher URL	https://link.springer.com/chapter/10.1007/978-3-031-63021-7_16