Finding Real-Valued Single-Source Shortest Paths. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1996)

Improved Approximation Algorithms for Unsplittable Flow Problems. - Stavros G. Kolliopoulos; Clifford Stein 001 (FOCS, 1997)

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1998)

Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. - Stavros G. Kolliopoulos; Clifford Stein 001 (J. Algorithms, 1998)

A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. - Stavros G. Kolliopoulos; Satish Rao (ESA, 1999)

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. - Stavros G. Kolliopoulos; Clifford Stein 001 (IPCO, 1999)

Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. - Mark W. Goudreau; Stavros G. Kolliopoulos; Satish Rao (INFOCOM, 2000)

Tight Approximation Results for General Covering Integer Programs. - Stavros G. Kolliopoulos; Neal E. Young (FOCS, 2001)

Approximation Algorithms for Single-Source Unsplittable Flow. - Stavros G. Kolliopoulos; Clifford Stein 001 (SIAM J. Comput., 2001)

Approximating covering integer programs with multiplicity constraints. - Stavros G. Kolliopoulos (Discret. Appl. Math., 2003)

Techniques for scheduling with rejection. - Daniel W. Engels; David R. Karger; Stavros G. Kolliopoulos; Sudipta Sengupta; R. N. Uma; Joel Wein (J. Algorithms, 2003)

The Efficiency of Optimal Taxes. - George Karakostas; Stavros G. Kolliopoulos (CAAN, 2004)

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. - George Karakostas; Stavros G. Kolliopoulos (FOCS, 2004)

On Minimizing the Total Weighted Tardiness on a Single Machine. - Stavros G. Kolliopoulos; George Steiner (STACS, 2004)

Approximating disjoint-path problems using packing integer programs. - Stavros G. Kolliopoulos; Clifford Stein 001 (Math. Program., 2004)

Minimum-cost single-source 2-splittable flow. - Stavros G. Kolliopoulos (Inf. Process. Lett., 2005)

Approximation algorithms for covering/packing integer programs. - Stavros G. Kolliopoulos; Neal E. Young (J. Comput. Syst. Sci., 2005)

Implementing approximation algorithms for the single-source unsplittable flow problem. - Jingde Du; Stavros G. Kolliopoulos (ACM J. Exp. Algorithmics, 2005)

Approximation algorithms for minimizing the total weighted tardiness on a single machine. - Stavros G. Kolliopoulos; George Steiner (Theor. Comput. Sci., 2006)

Partially ordered knapsack and applications to scheduling. - Stavros G. Kolliopoulos; George Steiner (Discret. Appl. Math., 2007)

Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. - Stavros G. Kolliopoulos; George Steiner (Oper. Res. Lett., 2007)

A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. - Stavros G. Kolliopoulos; Satish Rao (SIAM J. Comput., 2007)

Edge-Disjoint Paths and Unsplittable Flow. - Stavros G. Kolliopoulos (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. - George Karakostas; Stavros G. Kolliopoulos (Algorithmica, 2009)

Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. - George Karakostas; Stavros G. Kolliopoulos (Algorithmica, 2009)

On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. - Dimitris Fotakis 001; George Karakostas; Stavros G. Kolliopoulos (SAGT, 2010)

Tight Bounds for Linkages in Planar Graphs. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (ICALP (1), 2011)

An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. - George Karakostas; Stavros G. Kolliopoulos; Jing Wang (ACM Trans. Algorithms, 2012)

Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location. - Stavros G. Kolliopoulos; Yannis Moysoglou (CoRR, 2013)

Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location - Stavros G. Kolliopoulos; Yannis Moysoglou (CoRR, 2013)

The 2-valued case of makespan minimization with assignment constraints. - Stavros G. Kolliopoulos; Yannis Moysoglou (Inf. Process. Lett., 2013)

Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location. - Stavros G. Kolliopoulos; Yannis Moysoglou (APPROX-RANDOM, 2014)

Extended Formulation Lower Bounds via Hypergraph Coloring?. - Stavros G. Kolliopoulos; Yannis Moysoglou (STACS, 2015)

Planar Disjoint-Paths Completion. - Isolde Adler; Stavros G. Kolliopoulos; Dimitrios M. Thilikos (Algorithmica, 2016)

Integrality gaps for strengthened linear relaxations of capacitated facility location. - Stavros G. Kolliopoulos; Yannis Moysoglou (Math. Program., 2016)

Irrelevant vertices for the planar Disjoint Paths Problem. - Isolde Adler; Stavros G. Kolliopoulos; Philipp Klaus Krause; Daniel Lokshtanov; Saket Saurabh 001; Dimitrios M. Thilikos (J. Comb. Theory B, 2017)

Disjoint Paths and Unsplittable Flow. - Stavros G. Kolliopoulos (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Single-item lot-sizing with quantity discount and bounded inventory. - Douglas G. Down; George Karakostas; Stavros G. Kolliopoulos; Somayye Rostami (Oper. Res. Lett., 2021)

Resource Time-Sharing for IoT Applications with Deadlines. - George Karakostas; Stavros G. Kolliopoulos (ALGOSENSORS, 2022)

Precedence-constrained covering problems with multiplicity constraints. - Stavros G. Kolliopoulos; Antonis Skarlatos (J. Comb. Optim., 2023)

Finding irrelevant vertices in linear time on bounded-genus graphs. - Petr A. Golovach; Stavros G. Kolliopoulos; Giannos Stamoulis; Dimitrios M. Thilikos (SODA, 2025)

Time-sharing scheduling with tolerance capacities. - George Karakostas; Stavros G. Kolliopoulos (J. Comput. Syst. Sci., 2025)

Approximation algorithms for maximum weighted throughput on unrelated machines. - George Karakostas; Stavros G. Kolliopoulos (Theor. Comput. Sci., 2025)