2009 |
29 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.
Algorithmica 53(1): 132-153 (2009) |
28 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
Algorithmica 53(2): 225-249 (2009) |
2007 |
27 | EE | Stavros G. Kolliopoulos,
George Steiner:
Partially ordered knapsack and applications to scheduling.
Discrete Applied Mathematics 155(8): 889-897 (2007) |
26 | EE | Stavros G. Kolliopoulos,
George Steiner:
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.
Oper. Res. Lett. 35(5): 685-692 (2007) |
25 | EE | Stavros G. Kolliopoulos,
Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.
SIAM J. Comput. 37(3): 757-782 (2007) |
2006 |
24 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
COCOON 2006: 23-32 |
23 | EE | Stavros G. Kolliopoulos,
George Steiner:
Approximation algorithms for minimizing the total weighted tardiness on a single machine.
Theor. Comput. Sci. 355(3): 261-273 (2006) |
2005 |
22 | EE | Jingde Du,
Stavros G. Kolliopoulos:
Implementing approximation algorithms for the single-source unsplittable flow problem.
ACM Journal of Experimental Algorithmics 10: (2005) |
21 | EE | Stavros G. Kolliopoulos:
Minimum-cost single-source 2-splittable flow.
Inf. Process. Lett. 94(1): 15-18 (2005) |
20 | EE | Stavros G. Kolliopoulos,
Neal E. Young:
Approximation algorithms for covering/packing integer programs.
J. Comput. Syst. Sci. 71(4): 495-505 (2005) |
2004 |
19 | EE | George Karakostas,
Stavros G. Kolliopoulos:
The Efficiency of Optimal Taxes.
CAAN 2004: 3-12 |
18 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.
FOCS 2004: 268-276 |
17 | EE | Stavros G. Kolliopoulos,
George Steiner:
On Minimizing the Total Weighted Tardiness on a Single Machine.
STACS 2004: 176-186 |
16 | EE | Jingde Du,
Stavros G. Kolliopoulos:
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem.
WEA 2004: 213-227 |
15 | EE | Stavros G. Kolliopoulos:
Minimum-Cost Single-Source 2-Splittable Flow.
Electronic Notes in Discrete Mathematics 17: 197-201 (2004) |
14 | EE | Stavros G. Kolliopoulos,
Clifford Stein:
Approximating disjoint-path problems using packing integer programs.
Math. Program. 99(1): 63-87 (2004) |
2003 |
13 | EE | Daniel W. Engels,
David R. Karger,
Stavros G. Kolliopoulos,
Sudipta Sengupta,
R. N. Uma,
Joel Wein:
Techniques for scheduling with rejection.
J. Algorithms 49(1): 175-191 (2003) |
2002 |
12 | EE | Stavros G. Kolliopoulos,
George Steiner:
Partially-Ordered Knapsack and Applications to Scheduling.
ESA 2002: 612-624 |
11 | EE | Stavros G. Kolliopoulos,
Neal E. Young:
Tight Approximation Results for General Covering Integer Programs
CoRR cs.DS/0205030: (2002) |
2001 |
10 | | Stavros G. Kolliopoulos,
Neal E. Young:
Tight Approximation Results for General Covering Integer Programs.
FOCS 2001: 522-528 |
9 | EE | Stavros G. Kolliopoulos,
Clifford Stein:
Approximation Algorithms for Single-Source Unsplittable Flow.
SIAM J. Comput. 31(3): 919-946 (2001) |
2000 |
8 | EE | Mark W. Goudreau,
Stavros G. Kolliopoulos,
Satish Rao:
Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.
INFOCOM 2000: 1624-1643 |
1999 |
7 | EE | Stavros G. Kolliopoulos,
Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.
ESA 1999: 378-389 |
6 | EE | Stavros G. Kolliopoulos,
Clifford Stein:
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.
IPCO 1999: 328-344 |
1998 |
5 | EE | Daniel W. Engels,
David R. Karger,
Stavros G. Kolliopoulos,
Sudipta Sengupta,
R. N. Uma,
Joel Wein:
Techniques for Scheduling with Rejection.
ESA 1998: 490-501 |
4 | EE | Stavros G. Kolliopoulos,
Clifford Stein:
Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.
IPCO 1998: 153-168 |
3 | | Stavros G. Kolliopoulos,
Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time.
J. Algorithms 28(1): 125-141 (1998) |
1997 |
2 | EE | Stavros G. Kolliopoulos,
Clifford Stein:
Improved Approximation Algorithms for Unsplittable Flow Problems.
FOCS 1997: 426-435 |
1996 |
1 | | Stavros G. Kolliopoulos,
Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths.
IPCO 1996: 94-104 |