If you made any changes in Pure these will be visible here soon.

Research Output

  • 7 Article
  • 1 Conference article in proceeding

Integrality gaps for colorful matchings

Kelk, S. & Stamoulis, G., May 2019, In : Discrete Optimization. 32, p. 73-92 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

Treewidth of display graphs: bounds, brambles and applications

Janssen, R., Jones, M., Kelk, S., Stamoulis, G. & Wu, T., 2019, In : Journal of Graph Algorithms and Applications. 23, 4, p. 715-743

Research output: Contribution to journalArticleAcademicpeer-review

On a Fixed Haplotype Variant of the Minimum Error Correction Problem

Goblet, A., Kelk, S., Mihalák, M. & Stamoulis, G., 29 Jun 2018, Computing and Combinatorics. COCOON 2018. Wang, L. & Zhu, D. (eds.). Springer Verlag, p. 554-566 (Lecture Notes in Computer Science, Vol. 10976).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems

Van Iersel, L., Kelk, S., Stamoulis, G., Stougie, L. & Boes, O., 1 Nov 2018, In : Algorithmica. 80, 11, p. 2993-3022 30 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

Bonnet, E., Escoffier, B., Paschos, V. & Stamoulis, G., 1 Feb 2018, In : Discrete Optimization. 27, p. 26-56 31 p.

Research output: Contribution to journalArticleAcademicpeer-review