| 2009 |
|---|
| 24 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.
Algorithmica 53(1): 132-153 (2009) |
| 23 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
Algorithmica 53(2): 225-249 (2009) |
| 2008 |
|---|
| 22 | EE | George Karakostas,
Euripides Markou:
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.
LATIN 2008: 350-361 |
| 21 | EE | George Karakostas:
Fractional Packing and Covering Problems.
Encyclopedia of Algorithms 2008 |
| 20 | EE | George Karakostas:
Faster approximation schemes for fractional multicommodity flow problems.
ACM Transactions on Algorithms 4(1): (2008) |
| 19 | EE | Douglas G. Down,
George Karakostas:
Maximizing throughput in queueing networks with limited flexibility.
European Journal of Operational Research 187(1): 98-112 (2008) |
| 2007 |
|---|
| 18 | EE | George Karakostas,
Taeyon Kim,
Anastasios Viglas,
Hao Xia:
Selfish Routing with Oblivious Users.
SIROCCO 2007: 318-327 |
| 17 | EE | George Karakostas,
Anastasios Viglas:
Equilibria for networks with malicious users.
Math. Program. 110(3): 591-613 (2007) |
| 2006 |
|---|
| 16 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.
COCOON 2006: 23-32 |
| 15 | EE | Douglas G. Down,
George Karakostas:
Maximizing Throughput in Queueing Networks with Limited Flexibility.
LATIN 2006: 398-409 |
| 14 | EE | Sanjeev Arora,
George Karakostas:
A 2 + epsilon approximation algorithm for the k-MST problem.
Math. Program. 107(3): 491-504 (2006) |
| 2005 |
|---|
| 13 | EE | George Karakostas:
A Better Approximation Ratio for the Vertex Cover Problem.
ICALP 2005: 1043-1050 |
| 2004 |
|---|
| 12 | EE | George Karakostas,
Stavros G. Kolliopoulos:
The Efficiency of Optimal Taxes.
CAAN 2004: 3-12 |
| 11 | EE | George Karakostas,
Stavros G. Kolliopoulos:
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.
FOCS 2004: 268-276 |
| 10 | EE | George Karakostas:
A better approximation ratio for the Vertex Cover problem
Electronic Colloquium on Computational Complexity (ECCC)(084): (2004) |
| 2003 |
|---|
| 9 | EE | George Karakostas,
Anastasios Viglas:
Equilibria for Networks with Malicious Users.
ISAAC 2003: 696-704 |
| 8 | EE | Sanjeev Arora,
George Karakostas:
Approximation Schemes for Minimum Latency Problems.
SIAM J. Comput. 32(5): 1317-1337 (2003) |
| 7 | EE | George Karakostas,
Richard J. Lipton,
Anastasios Viglas:
On the complexity of intersecting finite state automata and N L versus N P.
Theor. Comput. Sci. 302(1-3): 257-274 (2003) |
| 2002 |
|---|
| 6 | EE | George Karakostas,
Dimitrios N. Serpanos:
Exploitation of different types of locality for Web caches.
ISCC 2002: 207-212 |
| 5 | EE | George Karakostas:
Faster approximation schemes for fractional multicommodity flow problems.
SODA 2002: 166-173 |
| 2000 |
|---|
| 4 | EE | George Karakostas,
Richard J. Lipton,
Anastasios Viglas:
On the Complexity of Intersecting Finite State Automata.
IEEE Conference on Computational Complexity 2000: 229-234 |
| 3 | | Dimitrios N. Serpanos,
George Karakostas,
W. H. Wolf:
Effective Caching of Web Objects using Zipf's Law.
IEEE International Conference on Multimedia and Expo (II) 2000: 727-730 |
| 2 | EE | Sanjeev Arora,
George Karakostas:
A 2+epsilon approximation algorithm for the k-MST problem.
SODA 2000: 754-759 |
| 1999 |
|---|
| 1 | EE | Sanjeev Arora,
George Karakostas:
Approximation Schemes for Minimum Latency Problems.
STOC 1999: 688-693 |
