| On unrooted and root-uncertain variants of several well-known phylogenetic network problems L Van Iersel, S Kelk, G Stamoulis, L Stougie, O Boes Algorithmica 80, 2993-3022, 2018 | 26 | 2018 |
| Constrained matching problems in bipartite graphs M Mastrolilli, G Stamoulis International Symposium on Combinatorial Optimization, 344-355, 2012 | 20 | 2012 |
| Approximation algorithms for bounded color matchings via convex decompositions G Stamoulis International Symposium on Mathematical Foundations of Computer Science, 625-636, 2014 | 17 | 2014 |
| Bi-criteria and approximation algorithms for restricted matchings M Mastrolilli, G Stamoulis Theoretical Computer Science 540, 115-132, 2014 | 13 | 2014 |
| Treewidth of display graphs: bounds, brambles and applications R Janssen, M Jones, S Kelk, G Stamoulis, T Wu arXiv preprint arXiv:1809.00907, 2018 | 11 | 2018 |
| A structured view on weighted counting with relations to quantum computation and applications CP de Campos, G Stamoulis, D Weyland Electronic Colloquium on Computational Complexity (ECCC) 20, 133, 2013 | 10 | 2013 |
| A structured view on weighted counting with relations to counting, quantum computation and applications CP de Campos, G Stamoulis, D Weyland Information and Computation 275, 104627, 2020 | 9 | 2020 |
| A note on convex characters, Fibonacci numbers and exponential-time algorithms S Kelk, G Stamoulis Advances in Applied Mathematics 84, 34-46, 2017 | 9 | 2017 |
| PTAS for ordered instances of resource allocation problems K Khodamoradi, R Krishnamurti, A Rafiey, G Stamoulis IARCS Annual Conference on Foundations of Software Technology and …, 2013 | 9 | 2013 |
| Reflections on kernelizing and computing unrooted agreement forests R van Wersch, S Kelk, S Linz, G Stamoulis Annals of Operations Research 309 (1), 425-451, 2022 | 8 | 2022 |
| Treewidth distance on phylogenetic trees S Kelk, G Stamoulis, T Wu Theoretical Computer Science 731, 99-117, 2018 | 7 | 2018 |
| Restricted max-min fair allocations with inclusion-free intervals M Mastrolilli, G Stamoulis Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 7 | 2012 |
| PTAS for ordered instances of resource allocation problems with restrictions on inclusions K Khodamoradi, R Krishnamurti, A Rafiey, G Stamoulis arXiv preprint arXiv:1610.00082, 2016 | 6 | 2016 |
| Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs É Bonnet, B Escoffier, VT Paschos, G Stamoulis Discrete Optimization 27, 26-56, 2018 | 5 | 2018 |
| The computational complexity of Stochastic Optimization CP de Campos, G Stamoulis, D Weyland Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon …, 2014 | 5 | 2014 |
| Competitive-ratio approximation schemes for makespan scheduling problems A Kurpisz, M Mastrolilli, G Stamoulis International Workshop on Approximation and Online Algorithms, 159-172, 2012 | 5 | 2012 |
| Integrality gaps for colorful matchings S Kelk, G Stamoulis Discrete Optimization 32, 73-92, 2019 | 3 | 2019 |
| A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs É Bonnet, B Escoffier, VT Paschos, G Stamoulis LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 2 | 2016 |
| On the approximation of maximum k-vertex cover in bipartite graphs E Bonnet, B Escoffier, VT Paschos, G Stamoulis arXiv preprint arXiv:1409.6952, 2014 | 2 | 2014 |
| Snakes and ladders: a treewidth story S Chaplick, S Kelk, R Meuwese, M Mihalák, G Stamoulis International Workshop on Graph-Theoretic Concepts in Computer Science, 187-200, 2023 | 1 | 2023 |
