# Stavros G. Kolliopoulos

According to our database

Collaborative distances:

^{1}, Stavros G. Kolliopoulos authored at least 50 papers between 1996 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Irrelevant vertices for the planar Disjoint Paths Problem.

J. Comb. Theory, Ser. B, 2017

2016

Integrality gaps for strengthened linear relaxations of capacitated facility location.

Math. Program., 2016

Planar Disjoint-Paths Completion.

Algorithmica, 2016

2015

Planar Disjoint-Paths Completion.

CoRR, 2015

Extended Formulation Lower Bounds via Hypergraph Coloring?.

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Extended Formulation Lower Bounds via Hypergraph Coloring?

CoRR, 2014

Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location.

Proceedings of the Approximation, 2014

2013

The 2-valued case of makespan minimization with assignment constraints.

Inf. Process. Lett., 2013

Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location

CoRR, 2013

Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location.

CoRR, 2013

Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location.

CoRR, 2013

Irrelevant Vertices for the Planar Disjoint Paths Problem.

CoRR, 2013

2012

An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.

ACM Trans. Algorithms, 2012

The 2-valued case of makespan minimization with assignment constraints

CoRR, 2012

2011

Planar Disjoint-Paths Completion.

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

Tight Bounds for Linkages in Planar Graphs.

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.

Algorithmica, 2009

Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.

Algorithmica, 2009

An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates.

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2007

Edge-Disjoint Paths and Unsplittable Flow.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.

SIAM J. Comput., 2007

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.

Oper. Res. Lett., 2007

Partially ordered knapsack and applications to scheduling.

Discrete Applied Mathematics, 2007

2006

Approximation algorithms for minimizing the total weighted tardiness on a single machine.

Theor. Comput. Sci., 2006

Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Implementing approximation algorithms for the single-source unsplittable flow problem.

ACM Journal of Experimental Algorithmics, 2005

Approximation algorithms for covering/packing integer programs.

J. Comput. Syst. Sci., 2005

Minimum-cost single-source 2-splittable flow.

Inf. Process. Lett., 2005

2004

Approximating disjoint-path problems using packing integer programs.

Math. Program., 2004

Minimum-Cost Single-Source 2-Splittable Flow.

Electronic Notes in Discrete Mathematics, 2004

Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem.

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

On Minimizing the Total Weighted Tardiness on a Single Machine.

Proceedings of the STACS 2004, 2004

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Minimum-Cost Single-Source 2-Splittable Flow.

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

The Efficiency of Optimal Taxes.

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

Techniques for scheduling with rejection.

J. Algorithms, 2003

Approximating covering integer programs with multiplicity constraints.

Discrete Applied Mathematics, 2003

2002

Tight Approximation Results for General Covering Integer Programs

CoRR, 2002

Partially-Ordered Knapsack and Applications to Scheduling.

Proceedings of the Algorithms, 2002

2001

Approximation Algorithms for Single-Source Unsplittable Flow.

SIAM J. Comput., 2001

Tight Approximation Results for General Covering Integer Programs.

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.

Proceedings of the Algorithms, 1999

1998

Finding Real-Valued Single-Source Shortest Paths in

*o(n*Expected Time.^{3})
J. Algorithms, 1998

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Techniques for Scheduling with Rejection.

Proceedings of the Algorithms, 1998

1997

Improved Approximation Algorithms for Unsplittable Flow Problems.

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Finding Real-Valued Single-Source Shortest Paths.

Proceedings of the Integer Programming and Combinatorial Optimization, 1996