The SCEAS System
| |||||||

## Search the dblp DataBase
Stavros G. Kolliopoulos:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- George Karakostas, Stavros G. Kolliopoulos
**The Efficiency of Optimal Taxes.**[Citation Graph (0, 0)][DBLP] CAAN, 2004, pp:3-12 [Conf] - George Karakostas, Stavros G. Kolliopoulos
**Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:23-32 [Conf] - Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
**Techniques for Scheduling with Rejection.**[Citation Graph (0, 0)][DBLP] ESA, 1998, pp:490-501 [Conf] - Stavros G. Kolliopoulos, Satish Rao
**A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.**[Citation Graph (0, 0)][DBLP] ESA, 1999, pp:378-389 [Conf] - Stavros G. Kolliopoulos, George Steiner
**Partially-Ordered Knapsack and Applications to Scheduling.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:612-624 [Conf] - George Karakostas, Stavros G. Kolliopoulos
**Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:268-276 [Conf] - Stavros G. Kolliopoulos, Clifford Stein
**Improved Approximation Algorithms for Unsplittable Flow Problems.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:426-435 [Conf] - Stavros G. Kolliopoulos, Neal E. Young
**Tight Approximation Results for General Covering Integer Programs.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:522-528 [Conf] - Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao
**Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2000, pp:1624-1643 [Conf] - Stavros G. Kolliopoulos, Clifford Stein
**Finding Real-Valued Single-Source Shortest Paths.**[Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:94-104 [Conf] - Stavros G. Kolliopoulos, Clifford Stein
**Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.**[Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:153-168 [Conf] - Stavros G. Kolliopoulos, Clifford Stein
**Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.**[Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:328-344 [Conf] - Stavros G. Kolliopoulos, George Steiner
**On Minimizing the Total Weighted Tardiness on a Single Machine.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:176-186 [Conf] - Jingde Du, Stavros G. Kolliopoulos
**Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:213-227 [Conf] - Stavros G. Kolliopoulos, Neal E. Young
**Tight Approximation Results for General Covering Integer Programs**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Stavros G. Kolliopoulos, George Steiner
**Partially ordered knapsack and applications to scheduling.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:8, pp:889-897 [Journal] - Stavros G. Kolliopoulos
**Minimum-cost single-source 2-splittable flow.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:94, n:1, pp:15-18 [Journal] - Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein
**Techniques for scheduling with rejection.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2003, v:49, n:1, pp:175-191 [Journal] - Stavros G. Kolliopoulos, Clifford Stein
**Finding Real-Valued Single-Source Shortest Paths in**[Citation Graph (0, 0)][DBLP]*o(n*Expected Time.^{3}) J. Algorithms, 1998, v:28, n:1, pp:125-141 [Journal] - Stavros G. Kolliopoulos, Neal E. Young
**Approximation algorithms for covering/packing integer programs.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:71, n:4, pp:495-505 [Journal] - Jingde Du, Stavros G. Kolliopoulos
**Implementing approximation algorithms for the single-source unsplittable flow problem.**[Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal] - Stavros G. Kolliopoulos, Clifford Stein
**Approximating disjoint-path problems using packing integer programs.**[Citation Graph (0, 0)][DBLP] Math. Program., 2004, v:99, n:1, pp:63-87 [Journal] - Stavros G. Kolliopoulos, Clifford Stein
**Approximation Algorithms for Single-Source Unsplittable Flow.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2001, v:31, n:3, pp:919-946 [Journal] - Stavros G. Kolliopoulos, George Steiner
**Approximation algorithms for minimizing the total weighted tardiness on a single machine.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:355, n:3, pp:261-273 [Journal] - Stavros G. Kolliopoulos, Satish Rao
**A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:757-782 [Journal] **An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates.**[Citation Graph (, )][DBLP]**Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.**[Citation Graph (, )][DBLP]**Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |