Partitioned matching games for international kidney exchange
(2025)
Journal Article
Benedek, M., Biro, P., Kern, W., Palvolgyi, D., & Paulusma, D. (online). Partitioned matching games for international kidney exchange. Mathematical Programming, https://doi.org/10.1007/s10107-025-02200-9
Professor Daniel Paulusma's Outputs (5)
Computing subset vertex covers in H-free graphs (2025)
Journal Article
Brettell, N., Oostveen, J. J., Pandey, S., Paulusma, D., Rauch, J., & van Leeuwen, E. J. (2025). Computing subset vertex covers in H-free graphs. Theoretical Computer Science, 1032, Article 115088. https://doi.org/10.1016/j.tcs.2025.115088
The Complexity of Diameter on H-free Graphs (2025)
Presentation / Conference Contribution
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
Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs, (2025)
Presentation / Conference Contribution
Lucke, F., Momeni, A., Paulusma, D., & Smith, S. (2024, June). Finding d-cuts in graphs of bounded diameter, graphs of bounded radius and H-free graphs,. Presented at WG 2024, Gozd Martuljek, Slovenia
Complexity Framework for Forbidden Subgraphs I: The Framework (2025)
Journal Article
Johnson, M., Martin, B., Oostveen, J. J., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2025). Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica, 87(3), 429-464. https://doi.org/10.1007/s00453-024-01289-2For a set of graphs H, a graph G is H-subgraph-free if G does not contain any graph from H as a subgraph. We propose general and easy-to-state conditions on graph problems that explain a large set of results for H-subgraph-free graphs. Namely, a grap... Read More about Complexity Framework for Forbidden Subgraphs I: The Framework.