| Techniques for scheduling with rejection DW Engels, DR Karger, SG Kolliopoulos, S Sengupta, RN Uma, J Wein Journal of Algorithms 49 (1), 175-191, 2003 | 199 | 2003 |
| Improved approximation algorithms for unsplittable flow problems SG Kolliopoulos, C Stein Proceedings 38th Annual Symposium on Foundations of Computer Science, 426-436, 1997 | 189 | 1997 |
| Edge pricing of multicommodity networks for heterogeneous selfish users G Karakostas, SG Kolliopoulos FOCS 4, 268-276, 2004 | 154 | 2004 |
| A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem SG Kolliopoulos, S Rao Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999 | 134 | 1999 |
| A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem SG Kolliopoulos, S Rao SIAM Journal on Computing 37 (3), 757-782, 2007 | 122 | 2007 |
| Approximating disjoint-path problems using greedy algorithms and packing integer programs SG Kolliopoulos, C Stein International Conference on Integer Programming and Combinatorial …, 1998 | 118 | 1998 |
| Approximating disjoint-path problems using packing integer programs SG Kolliopoulos, C Stein Mathematical Programming 99 (1), 63-87, 2004 | 97 | 2004 |
| Approximation algorithms for covering/packing integer programs SG Kolliopoulos, NE Young Journal of Computer and System Sciences 71 (4), 495-505, 2005 | 96 | 2005 |
| Approximation algorithms for single-source unsplittable flow SG Kolliopoulos, C Stein SIAM Journal on Computing 31 (3), 919-946, 2001 | 84 | 2001 |
| Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation MW Goudreau, SG Kolliopoulos, SB Rao Proceedings IEEE INFOCOM 2000. Conference on Computer Communications …, 2000 | 73 | 2000 |
| Partially ordered knapsack and applications to scheduling SG Kolliopoulos, G Steiner Discrete Applied Mathematics 155 (8), 889-897, 2007 | 56 | 2007 |
| Stackelberg strategies for selfish routing in general multicommodity networks G Karakostas, SG Kolliopoulos Algorithmica 53, 132-153, 2009 | 52 | 2009 |
| Tight approximation results for general covering integer programs SG Kolliopoulos, NE Young Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 522-528, 2001 | 50 | 2001 |
| Irrelevant vertices for the planar disjoint paths problem I Adler, SG Kolliopoulos, PK Krause, D Lokshtanov, S Saurabh, ... Journal of Combinatorial Theory, Series B 122, 815-843, 2017 | 49 | 2017 |
| Techniques for scheduling with rejection DW Engels, DR Karger, SG Kolliopoulos, S Sengupta, RN Uma, J Wein European Symposium on Algorithms, 490-501, 1998 | 48 | 1998 |
| The efficiency of optimal taxes G Karakostas, SG Kolliopoulos Combinatorial and Algorithmic Aspects of Networking: First Workshop on …, 2005 | 41 | 2005 |
| Tight bounds for linkages in planar graphs I Adler, SG Kolliopoulos, PK Krause, D Lokshtanov, S Saurabh, D Thilikos Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011 | 39 | 2011 |
| Edge-Disjoint Paths and Unsplittable Flow. SG Kolliopoulos Handbook of approximation algorithms and metaheuristics, 57-1, 2007 | 38 | 2007 |
| On the existence of optimal taxes for network congestion games with heterogeneous users D Fotakis, G Karakostas, SG Kolliopoulos Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens …, 2010 | 37 | 2010 |
| Approximation algorithms for minimizing the total weighted tardiness on a single machine SG Kolliopoulos, G Steiner Theoretical Computer Science 355 (3), 261-273, 2006 | 36 | 2006 |
George KarakostasAssociate Professor of Computing & Software, McMaster UniversityПотвърден имейл адрес: mcmaster.ca