The following pages link to Georgios Stamoulis (Q730309):
Displaying 17 items.
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- On a fixed haplotype variant of the minimum error correction problem (Q1791017) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs (Q2802943) (← links)
- Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems (Q2848922) (← links)
- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals (Q2914315) (← links)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)
- PTAS for Ordered Instances of Resource Allocation Problems (Q2963935) (← links)
- Constrained Matching Problems in Bipartite Graphs (Q3167638) (← links)
- The Computational Complexity of Stochastic Optimization (Q3195326) (← links)
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
