default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorgios Stamoulis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Virginia Ardévol Martínez, Steven Chaplick
, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. SOFSEM 2024: 40-54- 2023
- [c10]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: A Treewidth Story. WG 2023: 187-200 - [i14]Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Snakes and Ladders: a Treewidth Story. CoRR abs/2302.10662 (2023) - [i13]Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis:
Relaxed Agreement Forests. CoRR abs/2309.01110 (2023) - 2022
- [j10]Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis:
Reflections on kernelizing and computing unrooted agreement forests. Ann. Oper. Res. 309(1): 425-451 (2022) - 2020
- [j9]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: 104627 (2020) - [i12]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 abs/2007.07060 (2020) - [i11]Rim van Wersch, Steven Kelk, Simone Linz, Georgios Stamoulis:
Reflections on kernelizing and computing unrooted agreement forests. CoRR abs/2012.07354 (2020)
2010 – 2019
- 2019
- [j8]Steven Kelk, Georgios Stamoulis:
Integrality gaps for colorful matchings. Discret. Optim. 32: 73-92 (2019) - [j7]Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23(4): 715-743 (2019) - 2018
- [j6]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): 2993-3022 (2018) - [j5]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27: 26-56 (2018) - [j4]Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth distance on phylogenetic trees. Theor. Comput. Sci. 731: 99-117 (2018) - [c9]Axel Goblet, Steven Kelk, Matús Mihalák, Georgios Stamoulis:
On a Fixed Haplotype Variant of the Minimum Error Correction Problem. COCOON 2018: 554-566 - [i10]Steven Kelk, Georgios Stamoulis:
Integrality Gaps for Bounded Color Matchings. CoRR abs/1801.07937 (2018) - [i9]Remie Janssen, Mark Jones, Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth of display graphs: bounds, brambles and applications. CoRR abs/1809.00907 (2018) - 2017
- [j3]Steven Kelk, Georgios Stamoulis:
A note on convex characters, Fibonacci numbers and exponential-time algorithms. Adv. Appl. Math. 84: 34-46 (2017) - [j2]Georgios Stamoulis:
The multi-budgeted and weighted bounded degree metric Steiner network problem. J. Parallel Distributed Comput. 104: 36-48 (2017) - [i8]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications. CoRR abs/1701.06386 (2017) - [i7]Steven Kelk, Georgios Stamoulis, Taoyang Wu:
Treewidth distance on phylogenetic trees. CoRR abs/1703.10840 (2017) - 2016
- [c8]É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: 235-248 - [i6]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 abs/1609.00544 (2016) - [i5]Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions. CoRR abs/1610.00082 (2016) - [i4]Georgios Stamoulis:
Limitations of Linear Programming Techniques for Bounded Color Matchings. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c7]Georgios Stamoulis:
Approximation Algorithms for Multi-budgeted Network Design Problems. SIROCCO 2015: 135-148 - 2014
- [j1]Monaldo Mastrolilli, Georgios Stamoulis:
Bi-criteria and approximation algorithms for restricted matchings. Theor. Comput. Sci. 540: 115-132 (2014) - [c6]Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland:
The Computational Complexity of Stochastic Optimization. ISCO 2014: 173-185 - [c5]Georgios Stamoulis:
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. MFCS (2) 2014: 625-636 - [i3]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR abs/1409.6952 (2014) - 2013
- [c4]Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems. FSTTCS 2013: 461-473 - [i2]Monaldo Mastrolilli, Georgios Stamoulis:
Bi-Criteria and Approximation Algorithms for Restricted Matchings. CoRR abs/1311.5481 (2013) - [i1]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. TR13 (2013) - 2012
- [c3]Monaldo Mastrolilli, Georgios Stamoulis:
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. COCOON 2012: 98-108 - [c2]Monaldo Mastrolilli, Georgios Stamoulis:
Constrained Matching Problems in Bipartite Graphs. ISCO 2012: 344-355 - [c1]Adam Kurpisz, Monaldo Mastrolilli, Georgios Stamoulis:
Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems. WAOA 2012: 159-172
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
