Stavros G. Kolliopoulos
According to our database1,
Stavros G. Kolliopoulos
authored at least 43 papers
between 1996 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
2025
0
1
2
3
4
5
1
1
1
1
1
1
2
3
1
2
3
1
3
1
2
1
1
1
1
1
1
1
1
1
3
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2023
J. Comb. Optim., May, 2023
Proceedings of the Approximation, 2023
2022
Proceedings of the Algorithmics of Wireless Networks, 2022
2021
Oper. Res. Lett., 2021
2018
Disjoint Paths and Unsplittable Flow.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
2016
Integrality gaps for strengthened linear relaxations of capacitated facility location.
Math. Program., 2016
2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
2014
Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location.
Proceedings of the Approximation, 2014
2013
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
2012
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.
ACM Trans. Algorithms, 2012
2011
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
Algorithmica, 2009
Algorithmica, 2009
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
SIAM J. Comput., 2007
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.
Oper. Res. Lett., 2007
Discret. Appl. Math., 2007
2006
Approximation algorithms for minimizing the total weighted tardiness on a single machine.
Theor. Comput. Sci., 2006
2005
Implementing approximation algorithms for the single-source unsplittable flow problem.
ACM J. Exp. Algorithmics, 2005
J. Comput. Syst. Sci., 2005
2004
Math. Program., 2004
Proceedings of the STACS 2004, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004
2003
Discret. Appl. Math., 2003
2001
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
Proceedings of the Algorithms, 1999
1998
Finding Real-Valued Single-Source Shortest Paths in <i>o(n<sup>3</sup>)</i> Expected Time.
J. Algorithms, 1998
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996