Georgios Stamoulis

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 25

Top Topics

Resource Allocation

Bounded Treewidth

Approximation Algorithms

Top Venues

Theor. Comput. Sci.

Discret. Optim.

Publications

Virginia Ardévol Martínez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. SOFSEM (2024)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: a Treewidth Story. CoRR (2023)
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Relaxed Agreement Forests. CoRR (2023)
Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis
Snakes and Ladders: A Treewidth Story. WG (2023)
Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis
Reflections on kernelizing and computing unrooted agreement forests. Ann. Oper. Res. 309 (1) (2022)
Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland
A structured view on weighted counting with relations to counting, quantum computation and applications. Inf. Comput. 275 (2020)
Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis
Reflections on kernelizing and computing unrooted agreement forests. CoRR (2020)
Dharmen Punjani, Markos Iliakis, Theodoros Stefou, Kuldeep Singh, Andreas Both, Manolis Koubarakis, Iosif Angelidis, Konstantina Bereta, Themis Beris, Dimitris Bilidas, Theofilos Ioannidis, Nikolaos Karalis, Christoph Lange, Despina-Athanasia Pantazi, Christos Papaloukas, Georgios Stamoulis
Template-Based Question Answering over Linked Geospatial Data. CoRR (2020)
Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23 (4) (2019)
Steven Kelk, Georgios Stamoulis
Integrality gaps for colorful matchings. Discret. Optim. 32 (2019)
Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. COCOON (2018)
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27 (2018)
Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. Algorithmica 80 (11) (2018)
Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth of display graphs: bounds, brambles and applications. CoRR (2018)
Steven Kelk, Georgios Stamoulis
Integrality Gaps for Bounded Color Matchings. CoRR (2018)
Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth distance on phylogenetic trees. Theor. Comput. Sci. 731 (2018)
Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland
A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications. CoRR (2017)
Steven Kelk, Georgios Stamoulis
A note on convex characters, Fibonacci numbers and exponential-time algorithms. Adv. Appl. Math. 84 (2017)
Georgios Stamoulis
The multi-budgeted and weighted bounded degree metric Steiner network problem. J. Parallel Distributed Comput. 104 (2017)
Steven Kelk, Georgios Stamoulis, Taoyang Wu
Treewidth distance on phylogenetic trees. CoRR (2017)
Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes
On unrooted and root-uncertain variants of several well-known phylogenetic network problems. CoRR (2016)
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN (2016)
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. CoRR (2016)
Georgios Stamoulis
Limitations of Linear Programming Techniques for Bounded Color Matchings. Electron. Colloquium Comput. Complex. 23 (2016)
Georgios Stamoulis
Approximation Algorithms for Multi-budgeted Network Design Problems. SIROCCO (2015)
Monaldo Mastrolilli, Georgios Stamoulis
Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. 540 (2014)
Georgios Stamoulis
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. MFCS (2) (2014)
Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland
The Computational Complexity of Stochastic Optimization. ISCO (2014)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR (2014)
Monaldo Mastrolilli, Georgios Stamoulis
Bi-Criteria and Approximation Algorithms for Restricted Matchings. CoRR (2013)
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis
PTAS for Ordered Instances of Resource Allocation Problems. FSTTCS (2013)
Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications. Electron. Colloquium Comput. Complex. 20 (2013)
Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA (2012)
Monaldo Mastrolilli, Georgios Stamoulis
Constrained Matching Problems in Bipartite Graphs. ISCO (2012)
Monaldo Mastrolilli, Georgios Stamoulis
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. COCOON (2012)