Georgios Stamoulis

Available identifiers

zbMath Open stamoulis.georgiosMaRDI QIDQ730309

List of research outcomes

Publication	Date of Publication	Type
Snakes and Ladders: A Treewidth Story	2024-05-03	Paper
Reflections on kernelizing and computing unrooted agreement forests	2022-01-20	Paper
A structured view on weighted counting with relations to counting, quantum computation and applications	2020-12-15	Paper
Integrality gaps for colorful matchings	2019-06-14	Paper
On unrooted and root-uncertain variants of several well-known phylogenetic network problems	2019-01-11	Paper
On a fixed haplotype variant of the minimum error correction problem	2018-10-04	Paper
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs	2018-08-17	Paper
Treewidth distance on phylogenetic trees	2018-06-07	Paper
PTAS for Ordered Instances of Resource Allocation Problems	2017-02-21	Paper
A note on convex characters, Fibonacci numbers and exponential-time algorithms	2016-12-27	Paper
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs	2016-05-03	Paper
Approximation Algorithms for Multi-budgeted Network Design Problems	2016-01-08	Paper
The Computational Complexity of Stochastic Optimization	2015-10-16	Paper
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions	2014-10-14	Paper
Bi-criteria and approximation algorithms for restricted matchings	2014-06-06	Paper
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems	2013-09-13	Paper
Constrained Matching Problems in Bipartite Graphs	2012-11-02	Paper
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals	2012-09-25	Paper

Research outcomes over time

This page was built for person: Georgios Stamoulis