Jochen Könemann

	2012
53		Timothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. SODA 2012: 1576-1585
52		Isaac Fung, Konstantinos Georgiou, Jochen Könemann, Malcolm Sharpe: Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances CoRR abs/1202.5049: (2012)
	2011
51		Adrian Bock, Elyot Grant, Jochen Könemann, Laura Sanità: The School Bus Problem on Trees. ISAAC 2011: 10-19
50		Jochen Könemann: Winning Strategies for a Matchstick Game. Algorithms Unplugged 2011: 259-265
49		Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. Algorithmica 59(4): 489-509 (2011)
48		Jochen Könemann, David Pritchard, Kunlun Tan: A partition-based relaxation for Steiner trees. Math. Program. 127(2): 345-370 (2011)
	2010
47		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds. IPCO 2010: 110-123
46		Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-Restricted and Priority Covering Integer Programs. IPCO 2010: 355-368
45		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees. IPCO 2010: 383-396
44		Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann: On Column-restricted and Priority Covering Integer Programs CoRR abs/1003.1507: (2010)
43		Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis: On Generalizations of Network Design Problems with Degree Bounds CoRR abs/1003.2977: (2010)
42		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound CoRR abs/1006.2249: (2010)
41		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. 38(6): 567-570 (2010)
40		Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Strict Cost Sharing Schemes for Steiner Forest. SIAM J. Comput. 39(8): 3616-3632 (2010)
	2009
39		Deeparnab Chakrabarty, Jochen Könemann, David Pritchard: Hypergraphic LP Relaxations for Steiner Trees CoRR abs/0910.0281: (2009)
	2008
38		Jochen Könemann, Ojas Parekh, David Pritchard: Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA 2008: 1-14
37		Jochen Könemann: Gewinnstrategie für ein Streichholzspiel. Taschenbuch der Algorithmen 2008: 267-273
36		Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms 5(1): (2008)
35		Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4): 399-401 (2008)
34		Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game. SIAM J. Comput. 37(5): 1319-1341 (2008)
33		Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover. SIAM J. Comput. 38(3): 825-840 (2008)
	2007
32		Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer: An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. SODA 2007: 1153-1162
31		Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Transactions on Algorithms 3(2): (2007)
30		Jochen Könemann, David Pritchard, Kunlun Tan: A Partition-Based Relaxation For Steiner Trees CoRR abs/0712.3568: (2007)
29		Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007)
28		Naveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. SIAM J. Comput. 37(2): 630-652 (2007)
	2006
27		Jochen Könemann, Ojas Parekh, Danny Segev: A Unified Approach to Approximating Partial Covering Problems. ESA 2006: 468-479
26		Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor: Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446
25		Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. STOC 2006: 663-670
	2005
24		Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi: Distributed Weighted Vertex Cover via Maximal Matchings. COCOON 2005: 839-848
23		Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan H. M. van Zwam: From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. ICALP 2005: 930-942
22		Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, Mauro Sozio: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. PODC 2005: 118-125
21		Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384
20		Jochen Könemann, Stefano Leonardi, Guido Schäfer: A group-strategyproof mechanism for Steiner forests. SODA 2005: 612-619
19		Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella: Approximating k-hop minimum-spanning trees. Oper. Res. Lett. 33(2): 115-120 (2005)
18		Jochen Könemann, R. Ravi: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005)
	2004
17		Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-Clairvoyant Scheduling for Minimizing Mean Slowdown. Algorithmica 40(4): 305-318 (2004)
16		Jochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2004)
15		Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004)
14		Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: An approximation algorithm for the edge-dilation k-center problem, . Oper. Res. Lett. 32(5): 491-495 (2004)
	2003
13		Jochen Könemann, R. Ravi: Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301
12		Jochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121
11		Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha: Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35
10		Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Könemann: A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. SODA 2003: 517-522
9		Nikhil Bansal, Kedar Dhamdhere, Jochen Könemann, Amitabh Sinha: Non-clairvoyant Scheduling for Minimizing Mean Slowdown. STACS 2003: 260-270
8		Jochen Könemann, R. Ravi: Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395
7		Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved Approximations for Tour and Tree Covers. Algorithmica 38(3): 441-449 (2003)
	2002
6		Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha: Approximation Algorithms for Edge-Dilation k-Center Problems. SWAT 2002: 210-219
5		Jochen Könemann, R. Ravi: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. SIAM J. Comput. 31(6): 1783-1793 (2002)
	2000
4		Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha: Improved approximations for tour and tree covers. APPROX 2000: 184-193
3		Jochen Könemann, R. Ravi: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546
	1998
2		Naveen Garg, Jochen Könemann: Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. FOCS 1998: 300-309
	1995
1		Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, Christian Uhrig: Exact Geometric Computation in LEDA. Symposium on Computational Geometry 1995: C18-C19

Coauthor Index

1	Ernst Althaus	[19]
2	Nikhil Bansal	[9] [17] [43] [47]
3	Luca Becchetti	[21] [31]
4	Adrian Bock	[51]
5	Christoph Burnikel	[1]
6	Deeparnab Chakrabarty	[39] [41] [42] [44] [45] [46]
7	Timothy M. Chan	[53]
8	Joseph Cheriyan	[35]
9	Kedar Dhamdhere	[9] [17]
10	Friedrich Eisenbrand	[10]
11	Roee Engelberg	[26] [29]
12	Guy Even	[11] [15]
13	Lisa Fleischer	[25] [40]
14	Isaac Fung	[52]
15	Stefan Funke	[10] [19]
16	Naveen Garg	[2] [10] [11] [15] [28]
17	Konstantinos Georgiou (Constantinos Georgiou)	[52]
18	Fabrizio Grandoni	[22] [24] [33] [36]
19	Elyot Grant	[44] [46] [51] [53]
20	Anupam Gupta	[32]
21	Sariel Har-Peled	[19]
22	Howard J. Karloff	[35]
23	Rohit Khandekar	[35] [43] [47]
24	Goran Konjevod	[4] [7]
25	Stefano Leonardi	[20] [21] [23] [25] [26] [29] [31] [32] [34] [40]
26	Asaf Levin	[12] [16]
27	Yanjun Li	[6] [14]
28	Kurt Mehlhorn	[1]
29	Viswanath Nagarajan	[43] [47]
30	Stefan Näher	[1]
31	Joseph Naor (Seffi Naor)	[26] [29]
32	Martin Pál (Martin Pal)	[21] [31]
33	Alessandro Panconesi	[22] [24] [33] [36]
34	Ojas Parekh	[4] [6] [7] [14] [27] [38] [49]
35	Britta Peis	[43] [47]
36	David Pritchard	[30] [38] [39] [41] [42] [45] [48]
37	Edgar A. Ramos	[19]
38	R. Ravi	[3] [5] [8] [11] [13] [15] [18] [32]
39	Laura Sanità	[51]
40	Guido Schäfer	[20] [23] [25] [32] [34] [40]
41	Stefan Schirra	[1]
42	Danny Segev	[27] [49]
43	Malcolm Sharpe	[52] [53]
44	Amitabh Sinha	[4] [6] [7] [9] [11] [12] [14] [15] [16] [17]
45	Martin Skutella	[19]
46	Mauro Sozio	[22] [33]
47	Kunlun Tan	[30] [48]
48	Christian Uhrig	[1]
49	Stefan H. M. van Zwam	[23] [34]

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