Georgios Stamoulis

Despina-Athanasia Pantazi

Dennis Weyland

Inf. Comput., 2020

Template-Based Question Answering over Linked Geospatial Data.

[BibT_eX]

[DOI]

Christos Papaloukas

CoRR, 2020

2019

Treewidth of display graphs: bounds, brambles and applications.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

Integrality gaps for colorful matchings.

[BibT_eX]

[DOI]

Discret. Optim., 2019

2018

Treewidth distance on phylogenetic trees.

[BibT_eX]

[DOI]

Taoyang Wu

Theor. Comput. Sci., 2018

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Integrality Gaps for Bounded Color Matchings.

[BibT_eX]

[DOI]

CoRR, 2018

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.

[BibT_eX]

[DOI]

Algorithmica, 2018

On a Fixed Haplotype Variant of the Minimum Error Correction Problem.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

The multi-budgeted and weighted bounded degree metric Steiner network problem.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

A note on convex characters, Fibonacci numbers and exponential-time algorithms.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2017

2016

Limitations of Linear Programming Techniques for Bounded Color Matchings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

PTAS for Ordered Instances of Resource Allocation Problems with Restrictions on Inclusions.

[BibT_eX]

[DOI]

CoRR, 2016

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Approximation Algorithms for Multi-budgeted Network Design Problems.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Bi-criteria and approximation algorithms for restricted matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the approximation of maximum $k$-vertex cover in bipartite graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Approximation Algorithms for Bounded Color Matchings via Convex Decompositions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

The Computational Complexity of Stochastic Optimization.

[BibT_eX]

[DOI]

Cassio Polpo de Campos

Dennis Weyland

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

A Structured View on Weighted Counting with Relations to Quantum Computation and Applications.

[BibT_eX]

[DOI]

Cassio P. de Campos

Dennis Weyland

Electron. Colloquium Comput. Complex., 2013

PTAS for Ordered Instances of Resource Allocation Problems.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems.

[BibT_eX]

[DOI]

Adam Kurpisz

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Constrained Matching Problems in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Restricted Max-Min Fair Allocations with Inclusion-Free Intervals.

[BibT_eX]

[DOI]