Jelle J. Oostveen
The complexity of Diameter on H-free graphs
Oostveen, Jelle J.; Paulusma, Daniel; van Leeuwen, Erik Jan
Citation
Oostveen, J. J., Paulusma, D., & van Leeuwen, E. J. (2024, June). The complexity of Diameter on H-free graphs. Presented at WG 2024, Gozd Martuljek, Slovenia
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | WG 2024 |
| Start Date | Jun 19, 2024 |
| End Date | Jun 21, 2024 |
| Acceptance Date | Apr 19, 2024 |
| Deposit Date | Dec 31, 2024 |
| Print ISSN | 0302-9743 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Series Title | Lecture Notes in Computer Science |
| Series ISSN | 0302-9743 |
| Book Title | Graph-Theoretic Concepts in Computer Science |
| ISBN | 9783031754081 |
| Public URL | https://durham-repository.worktribe.com/output/3230217 |
| Publisher URL | https://link.springer.com/book/9783031754081 |
This file is under embargo due to copyright reasons.
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search