Stavros G. Kolliopoulos

59 papers A* 5A 6B 6C 2Misc 2Journal 32Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximation algorithms for maximum weighted throughput on unrelated machines.
Theor. Comput. Sci.
George Karakostas, Stavros G. Kolliopoulos
2025 A* conf
Finding irrelevant vertices in linear time on bounded-genus graphs.
SODA
Petr A. Golovach, Stavros G. Kolliopoulos, Giannos Stamoulis, Dimitrios M. Thilikos
2025 J jnl
Time-sharing scheduling with tolerance capacities.
J. Comput. Syst. Sci.
George Karakostas, Stavros G. Kolliopoulos
2023 A conf
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines.
APPROX/RANDOM
George Karakostas, Stavros G. Kolliopoulos
2023 J jnl
Precedence-constrained covering problems with multiplicity constraints.
J. Comb. Optim.
Stavros G. Kolliopoulos, Antonis Skarlatos
2022 C conf
Resource Time-Sharing for IoT Applications with Deadlines.
ALGOSENSORS
George Karakostas, Stavros G. Kolliopoulos
2021 B conf
Precedence-Constrained Covering Problems with Multiplicity Constraints.
WAOA
Stavros G. Kolliopoulos, Antonis Skarlatos
2021 J jnl
Single-item lot-sizing with quantity discount and bounded inventory.
Oper. Res. Lett.
Douglas G. Down, George Karakostas, Stavros G. Kolliopoulos, Somayye Rostami
2018 — ch.
Disjoint Paths and Unsplittable Flow.
Handbook of Approximation Algorithms and Metaheuristics (2)
Stavros G. Kolliopoulos
2017 J jnl
Irrelevant vertices for the planar Disjoint Paths Problem.
J. Comb. Theory B
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2016 J jnl
Integrality gaps for strengthened linear relaxations of capacitated facility location.
Math. Program.
Stavros G. Kolliopoulos, Yannis Moysoglou
2016 J jnl
Planar Disjoint-Paths Completion.
Algorithmica
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2015 A conf
Extended Formulation Lower Bounds via Hypergraph Coloring?.
STACS
Stavros G. Kolliopoulos, Yannis Moysoglou
2015 J jnl
Planar Disjoint-Paths Completion.
CoRR
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2014 J jnl
Extended Formulation Lower Bounds via Hypergraph Coloring?
CoRR
Stavros G. Kolliopoulos, Yannis Moysoglou
2014 — conf
Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location.
APPROX-RANDOM
Stavros G. Kolliopoulos, Yannis Moysoglou
2013 J jnl
Exponential lower bounds on the size of approximate formulations in the natural encoding for Capacitated Facility Location.
CoRR
Stavros G. Kolliopoulos, Yannis Moysoglou
2013 J jnl
Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location
CoRR
Stavros G. Kolliopoulos, Yannis Moysoglou
2013 J jnl
Irrelevant Vertices for the Planar Disjoint Paths Problem.
CoRR
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2013 J jnl
Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location.
CoRR
Stavros G. Kolliopoulos, Yannis Moysoglou
2013 J jnl
The 2-valued case of makespan minimization with assignment constraints.
Inf. Process. Lett.
Stavros G. Kolliopoulos, Yannis Moysoglou
2012 J jnl
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.
ACM Trans. Algorithms
George Karakostas, Stavros G. Kolliopoulos, Jing Wang
2012 J jnl
The 2-valued case of makespan minimization with assignment constraints
CoRR
Stavros G. Kolliopoulos, Yannis Moysoglou
2011 B conf
Planar Disjoint-Paths Completion.
IPEC
Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
2011 — conf
Tight Bounds for Linkages in Planar Graphs.
ICALP (1)
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010 B conf
On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users.
SAGT
Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos
2009 Misc conf
An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates.
COCOON
George Karakostas, Stavros G. Kolliopoulos, Jing Wang
2009 J jnl
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
Algorithmica
George Karakostas, Stavros G. Kolliopoulos
2009 J jnl
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.
Algorithmica
George Karakostas, Stavros G. Kolliopoulos
2007 J jnl
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.
SIAM J. Comput.
Stavros G. Kolliopoulos, Satish Rao
2007 J jnl
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.
Oper. Res. Lett.
Stavros G. Kolliopoulos, George Steiner
2007 — ch.
Edge-Disjoint Paths and Unsplittable Flow.
Handbook of Approximation Algorithms and Metaheuristics
Stavros G. Kolliopoulos
2007 J jnl
Partially ordered knapsack and applications to scheduling.
Discret. Appl. Math.
Stavros G. Kolliopoulos, George Steiner
2006 J jnl
Approximation algorithms for minimizing the total weighted tardiness on a single machine.
Theor. Comput. Sci.
Stavros G. Kolliopoulos, George Steiner
2006 Misc conf
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
COCOON
George Karakostas, Stavros G. Kolliopoulos
2005 J jnl
Approximation algorithms for covering/packing integer programs.
J. Comput. Syst. Sci.
Stavros G. Kolliopoulos, Neal E. Young
2005 J jnl
Implementing approximation algorithms for the single-source unsplittable flow problem.
ACM J. Exp. Algorithmics
Jingde Du, Stavros G. Kolliopoulos
2005 J jnl
Minimum-cost single-source 2-splittable flow.
Inf. Process. Lett.
Stavros G. Kolliopoulos
2004 J jnl
Approximating disjoint-path problems using packing integer programs.
Math. Program.
Stavros G. Kolliopoulos, Clifford Stein
2004 A* conf
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.
FOCS
George Karakostas, Stavros G. Kolliopoulos
2004 — conf
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem.
WEA
Jingde Du, Stavros G. Kolliopoulos
2004 C conf
Minimum-Cost Single-Source 2-Splittable Flow.
CTW
Stavros G. Kolliopoulos
2004 J jnl
Minimum-Cost Single-Source 2-Splittable Flow.
Electron. Notes Discret. Math.
Stavros G. Kolliopoulos
2004 A conf
On Minimizing the Total Weighted Tardiness on a Single Machine.
STACS
Stavros G. Kolliopoulos, George Steiner
2004 — conf
The Efficiency of Optimal Taxes.
CAAN
George Karakostas, Stavros G. Kolliopoulos
2003 J jnl
Approximating covering integer programs with multiplicity constraints.
Discret. Appl. Math.
Stavros G. Kolliopoulos
2003 J jnl
Techniques for scheduling with rejection.
J. Algorithms
Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
2002 A conf
Partially-Ordered Knapsack and Applications to Scheduling.
ESA
Stavros G. Kolliopoulos, George Steiner
2002 J jnl
Tight Approximation Results for General Covering Integer Programs
CoRR
Stavros G. Kolliopoulos, Neal E. Young
2001 J jnl
Approximation Algorithms for Single-Source Unsplittable Flow.
SIAM J. Comput.
Stavros G. Kolliopoulos, Clifford Stein
2001 A* conf
Tight Approximation Results for General Covering Integer Programs.
FOCS
Stavros G. Kolliopoulos, Neal E. Young
2000 A* conf
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.
INFOCOM
Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
1999 A conf
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.
ESA
Stavros G. Kolliopoulos, Satish Rao
1999 B conf
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.
IPCO
Stavros G. Kolliopoulos, Clifford Stein
1998 B conf
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.
IPCO
Stavros G. Kolliopoulos, Clifford Stein
1998 J jnl
Finding Real-Valued Single-Source Shortest Paths in
J. Algorithms
Stavros G. Kolliopoulos, Clifford Stein
1998 A conf
Techniques for Scheduling with Rejection.
ESA
Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
1997 A* conf
Improved Approximation Algorithms for Unsplittable Flow Problems.
FOCS
Stavros G. Kolliopoulos, Clifford Stein
1996 B conf
Finding Real-Valued Single-Source Shortest Paths.
IPCO
Stavros G. Kolliopoulos, Clifford Stein