Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. - Monaldo Mastrolilli; Georgios Stamoulis (COCOON, 2012)

Constrained Matching Problems in Bipartite Graphs. - Monaldo Mastrolilli; Georgios Stamoulis (ISCO, 2012)

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. - Adam Kurpisz; Monaldo Mastrolilli; Georgios Stamoulis (WAOA, 2012)

PTAS for Ordered Instances of Resource Allocation Problems. - Kamyar Khodamoradi; Ramesh Krishnamurti; Arash Rafiey; Georgios Stamoulis (FSTTCS, 2013)

A Structured View on Weighted Counting with Relations to Quantum Computation and Applications. - Cassio P. de Campos; Georgios Stamoulis; Dennis Weyland (Electron. Colloquium Comput. Complex., 2013)

The Computational Complexity of Stochastic Optimization. - Cassio Polpo de Campos; Georgios Stamoulis; Dennis Weyland (ISCO, 2014)

Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. - Georgios Stamoulis (MFCS (2), 2014)

On the approximation of maximum $k$-vertex cover in bipartite graphs. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (CoRR, 2014)

Bi-criteria and approximation algorithms for restricted matchings. - Monaldo Mastrolilli; Georgios Stamoulis (Theor. Comput. Sci., 2014)

Approximation Algorithms for Multi-budgeted Network Design Problems. - Georgios Stamoulis (SIROCCO, 2015)

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (LATIN, 2016)

PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. - Kamyar Khodamoradi; Ramesh Krishnamurti; Arash Rafiey; Georgios Stamoulis (CoRR, 2016)

Limitations of Linear Programming Techniques for Bounded Color Matchings. - Georgios Stamoulis (Electron. Colloquium Comput. Complex., 2016)

A note on convex characters, Fibonacci numbers and exponential-time algorithms. - Steven Kelk; Georgios Stamoulis (Adv. Appl. Math., 2017)

The multi-budgeted and weighted bounded degree metric Steiner network problem. - Georgios Stamoulis (J. Parallel Distributed Comput., 2017)

On a Fixed Haplotype Variant of the Minimum Error Correction Problem. - Axel Goblet; Steven Kelk; Matús Mihalák; Georgios Stamoulis (COCOON, 2018)

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. - Leo van Iersel; Steven Kelk; Georgios Stamoulis; Leen Stougie; Olivier Boes (Algorithmica, 2018)

Integrality Gaps for Bounded Color Matchings. - Steven Kelk; Georgios Stamoulis (CoRR, 2018)

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (Discret. Optim., 2018)

Treewidth distance on phylogenetic trees. - Steven Kelk; Georgios Stamoulis; Taoyang Wu (Theor. Comput. Sci., 2018)

Integrality gaps for colorful matchings. - Steven Kelk; Georgios Stamoulis (Discret. Optim., 2019)

Treewidth of display graphs: bounds, brambles and applications. - Remie Janssen; Mark Jones 001; Steven Kelk; Georgios Stamoulis; Taoyang Wu (J. Graph Algorithms Appl., 2019)

Template-Based Question Answering over Linked Geospatial Data. - Dharmen Punjani; Markos Iliakis; Theodoros Stefou; Kuldeep Singh 001; Andreas Both 001; Manolis Koubarakis; Iosif Angelidis; Konstantina Bereta; Themis Beris; Dimitris Bilidas; Theofilos Ioannidis; Nikolaos Karalis; et al. (CoRR, 2020)

A structured view on weighted counting with relations to counting, quantum computation and applications. - Cassio P. de Campos; Georgios Stamoulis; Dennis Weyland (Inf. Comput., 2020)

Reflections on kernelizing and computing unrooted agreement forests. - Rim van Wersch; Steven Kelk; Simone Linz; Georgios Stamoulis (Ann. Oper. Res., 2022)

Snakes and Ladders: A Treewidth Story. - Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (WG, 2023)

Relaxed Agreement Forests. - Virginia Aardevol Martinez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (CoRR, 2023)

Relaxed Agreement Forests. - Virginia Ardévol Martínez; Steven Chaplick; Steven Kelk; Ruben Meuwese; Matús Mihalák; Georgios Stamoulis (SOFSEM, 2024)

Quantum Circuit Design using a Progressive Widening Monte Carlo Tree Search. - Vincenzo Lipardi; Domenica Dibenedetto; Georgios Stamoulis; Mark H. M. Winands (CoRR, 2025)