Stavros G. Kolliopoulos

	2011
34		Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos: Tight Bounds for Linkages in Planar Graphs. ICALP (1) 2011: 110-121
33		Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos: Planar Disjoint-Paths Completion. IPEC 2011: 80-93
	2010
32		Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos: On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. SAGT 2010: 162-173
	2009
31		George Karakostas, Stavros G. Kolliopoulos, Jing Wang: An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. COCOON 2009: 238-248
30		George Karakostas, Stavros G. Kolliopoulos: Stackelberg Strategies for Selfish Routing in General Multicommodity Networks. Algorithmica 53(1): 132-153 (2009)
29		George Karakostas, Stavros G. Kolliopoulos: Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. Algorithmica 53(2): 225-249 (2009)
	2007
28		Stavros G. Kolliopoulos, George Steiner: Partially ordered knapsack and applications to scheduling. Discrete Applied Mathematics 155(8): 889-897 (2007)
27		Stavros G. Kolliopoulos, George Steiner: Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35(5): 685-692 (2007)
26		Stavros G. Kolliopoulos, Satish Rao: A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem. SIAM J. Comput. 37(3): 757-782 (2007)
	2006
25		George Karakostas, Stavros G. Kolliopoulos: Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands. COCOON 2006: 23-32
24		Stavros G. Kolliopoulos, George Steiner: Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor. Comput. Sci. 355(3): 261-273 (2006)
	2005
23		Jingde Du, Stavros G. Kolliopoulos: Implementing approximation algorithms for the single-source unsplittable flow problem. ACM Journal of Experimental Algorithmics 10: (2005)
22		Stavros G. Kolliopoulos: Minimum-cost single-source 2-splittable flow. Inf. Process. Lett. 94(1): 15-18 (2005)
21		Stavros G. Kolliopoulos, Neal E. Young: Approximation algorithms for covering/packing integer programs. J. Comput. Syst. Sci. 71(4): 495-505 (2005)
	2004
20		George Karakostas, Stavros G. Kolliopoulos: The Efficiency of Optimal Taxes. CAAN 2004: 3-12
19		Stavros G. Kolliopoulos: Minimum-Cost Single-Source 2-Splittable Flow. CTW 2004: 175-179
18		George Karakostas, Stavros G. Kolliopoulos: Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. FOCS 2004: 268-276
17		Stavros G. Kolliopoulos, George Steiner: On Minimizing the Total Weighted Tardiness on a Single Machine. STACS 2004: 176-186
16		Jingde Du, Stavros G. Kolliopoulos: Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. WEA 2004: 213-227
15		Stavros G. Kolliopoulos: Minimum-Cost Single-Source 2-Splittable Flow. Electronic Notes in Discrete Mathematics 17: 197-201 (2004)
14		Stavros G. Kolliopoulos, Clifford Stein: Approximating disjoint-path problems using packing integer programs. Math. Program. 99(1): 63-87 (2004)
	2003
13		Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein: Techniques for scheduling with rejection. J. Algorithms 49(1): 175-191 (2003)
	2002
12		Stavros G. Kolliopoulos, George Steiner: Partially-Ordered Knapsack and Applications to Scheduling. ESA 2002: 612-624
11		Stavros G. Kolliopoulos, Neal E. Young: Tight Approximation Results for General Covering Integer Programs CoRR cs.DS/0205030: (2002)
	2001
10		Stavros G. Kolliopoulos, Neal E. Young: Tight Approximation Results for General Covering Integer Programs. FOCS 2001: 522-528
9		Stavros G. Kolliopoulos, Clifford Stein: Approximation Algorithms for Single-Source Unsplittable Flow. SIAM J. Comput. 31(3): 919-946 (2001)
	2000
8		Mark W. Goudreau, Stavros G. Kolliopoulos, Satish Rao: Scheduling Algorithms for Input-Queued Switches: Randomized Techniques and Experimental Evaluation. INFOCOM 2000: 1624-1643
	1999
7		Stavros G. Kolliopoulos, Satish Rao: A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. ESA 1999: 378-389
6		Stavros G. Kolliopoulos, Clifford Stein: Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. IPCO 1999: 328-344
	1998
5		Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein: Techniques for Scheduling with Rejection. ESA 1998: 490-501
4		Stavros G. Kolliopoulos, Clifford Stein: Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. IPCO 1998: 153-168
3		Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time. J. Algorithms 28(1): 125-141 (1998)
	1997
2		Stavros G. Kolliopoulos, Clifford Stein: Improved Approximation Algorithms for Unsplittable Flow Problems. FOCS 1997: 426-435
	1996
1		Stavros G. Kolliopoulos, Clifford Stein: Finding Real-Valued Single-Source Shortest Paths. IPCO 1996: 94-104

Coauthor Index

1	Isolde Adler	[33] [34]
2	Jingde Du	[16] [23]
3	Daniel W. Engels	[5] [13]
4	Dimitris Fotakis	[32]
5	Mark W. Goudreau	[8]
6	George Karakostas	[18] [20] [25] [29] [30] [31] [32]
7	David R. Karger	[5] [13]
8	Philipp Klaus Krause	[34]
9	Daniel Lokshtanov	[34]
10	Satish Rao	[7] [8] [26]
11	Saket Saurabh	[34]
12	Sudipta Sengupta	[5] [13]
13	Clifford Stein	[1] [2] [3] [4] [6] [9] [14]
14	George Steiner	[12] [17] [24] [27] [28]
15	Dimitrios M. Thilikos	[33] [34]
16	R. N. Uma	[5] [13]
17	Jing Wang	[31]
18	Joel Wein	[5] [13]
19	Neal E. Young	[10] [11] [21]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page