The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

George Karakostas: [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, Richard J. Lipton, Anastasios Viglas
    On the Complexity of Intersecting Finite State Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:229-234 [Conf]
  3. 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]
  4. 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]
  5. George Karakostas
    A Better Approximation Ratio for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1043-1050 [Conf]
  6. Dimitrios N. Serpanos, George Karakostas, W. H. Wolf
    Effective Caching of Web Objects using Zipf's Law. [Citation Graph (0, 0)][DBLP]
    IEEE International Conference on Multimedia and Expo (II), 2000, pp:727-730 [Conf]
  7. George Karakostas, Anastasios Viglas
    Equilibria for Networks with Malicious Users. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:696-704 [Conf]
  8. George Karakostas, Dimitrios N. Serpanos
    Exploitation of different types of locality for Web caches. [Citation Graph (0, 0)][DBLP]
    ISCC, 2002, pp:207-212 [Conf]
  9. Douglas G. Down, George Karakostas
    Maximizing Throughput in Queueing Networks with Limited Flexibility. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:398-409 [Conf]
  10. Sanjeev Arora, George Karakostas
    A 2+epsilon approximation algorithm for the k-MST problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:754-759 [Conf]
  11. George Karakostas
    Faster approximation schemes for fractional multicommodity flow problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:166-173 [Conf]
  12. Sanjeev Arora, George Karakostas
    Approximation Schemes for Minimum Latency Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:688-693 [Conf]
  13. George Karakostas
    A better approximation ratio for the Vertex Cover problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:084, pp:- [Journal]
  14. Sanjeev Arora, George Karakostas
    A 2 + epsilon approximation algorithm for the k-MST problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:107, n:3, pp:491-504 [Journal]
  15. Sanjeev Arora, George Karakostas
    Approximation Schemes for Minimum Latency Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1317-1337 [Journal]
  16. George Karakostas, Richard J. Lipton, Anastasios Viglas
    On the complexity of intersecting finite state automata and N L versus N P. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:257-274 [Journal]
  17. George Karakostas, Taeyon Kim, Anastasios Viglas, Hao Xia
    Selfish Routing with Oblivious Users. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:318-327 [Conf]
  18. George Karakostas, Anastasios Viglas
    Equilibria for networks with malicious users. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:3, pp:591-613 [Journal]

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


  20. General Pseudo-random Generators from Weaker Models of Computation. [Citation Graph (, )][DBLP]


  21. Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes. [Citation Graph (, )][DBLP]


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


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


Search in 0.004secs, Finished in 0.004secs
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