The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stavros G. Kolliopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. George Karakostas, Stavros G. Kolliopoulos
    The Efficiency of Optimal Taxes. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:3-12 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. Stavros G. Kolliopoulos, George Steiner
    Partially-Ordered Knapsack and Applications to Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:612-624 [Conf]
  6. 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]
  7. Stavros G. Kolliopoulos, Clifford Stein
    Improved Approximation Algorithms for Unsplittable Flow Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:426-435 [Conf]
  8. 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]
  9. 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]
  10. Stavros G. Kolliopoulos, Clifford Stein
    Finding Real-Valued Single-Source Shortest Paths. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:94-104 [Conf]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Stavros G. Kolliopoulos, Clifford Stein
    Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:125-141 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]

  26. An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. [Citation Graph (, )][DBLP]


  27. Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. [Citation Graph (, )][DBLP]


  28. Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002