Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Coauthors
(59)
Stefano Leonardi
11
Amitabh Sinha II
11
Guido Schafer (Guido Schäfer)
8
Ojas Parekh
7
R. Ravi
7
Conferences
(18)
SODA
4
STOC
4
STACS
2
IPCO
2
RANDOM
2
Journals
(8)
SIAMCOMP
5
Algorithmica
4
CORR
4
ORL
4
TALG
2
Keywords
(94)
Embed
Subscribe
Academic
Authors
Jochen Konemann
Jochen Konemann (Jochen Könemann),University of Waterloo,Algorithms & Theory,Scientific Computing,Distributed & Parallel Computing
Edit
Jochen Konemann (Jochen Könemann)
University of Waterloo
Publications:
54

Citations:
834
Fields:
Algorithms & Theory
,
Scientific Computing
,
Distributed & Parallel Computing
View FAQ about top research areas and Fields of study
Collaborated with
59 coauthors
from 1995 to 2011

Cited by
849 authors
Cumulative
Annual
Sort by:
Publications
(54)
BibTeX

RIS

RefWorks
Download
A Unified Approach to Approximating Partial Covering Problems
(
Citations: 1
)
Jochen Könemann
,
Ojas Parekh
,
Danny Segev
Journal:
Algorithmica
, vol. 59, no. 4, pp. 489509, 2011
A partitionbased relaxation for Steiner trees
(
Citations: 1
)
Jochen Könemann
,
David Pritchard
,
Kunlun Tan
Journal:
Mathematical Programming
, vol. 127, no. 2, pp. 345370, 2011
Approximation algorithms for network design: A survey
Anupam Gupta
,
Jochen Könemann
Journal:
Surveys in Operations Research and Management Science
, vol. 16, no. 1, pp. 320, 2011
On ColumnRestricted and Priority Covering Integer Programs
(
Citations: 1
)
Deeparnab Chakrabarty
,
Elyot Grant
,
Jochen Könemann
Conference:
Integer Programming and Combinatorial Optimization  IPCO
, pp. 355368, 2010
On Generalizations of Network Design Problems with Degree Bounds
(
Citations: 1
)
Nikhil Bansal
,
Rohit Khandekar
,
Jochen Könemann
,
Viswanath Nagarajan
,
Britta Peis
Conference:
Integer Programming and Combinatorial Optimization  IPCO
, pp. 110123, 2010
Sort by:
Citations
(834 times by 693 publications)
Linear Programming in the Semistreaming Model with Application to the Maximum Matching Problem
(
Citations: 2
)
Kook Jin Ahn
,
Sudipto Guha
Journal:
Computing Research Repository  CORR
, vol. abs/1104.2, 2011
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
(
Citations: 1
)
André Berger
,
Vincenzo Bonifaci
,
Fabrizio Grandoni
,
Guido Schäfer
Journal:
Mathematical Programming
, vol. 128, no. 12, pp. 355372, 2011
Approximability of Sparse Integer Programs
(
Citations: 1
)
David Pritchard
,
Deeparnab Chakrabarty
Journal:
Algorithmica
, vol. 61, no. 1, pp. 7593, 2011
Novel algorithms for the network lifetime problem in wireless settings
(
Citations: 1
)
Michael Elkin
,
Yuval Lando
,
Zeev Nutov
,
Michael Segal
,
Hanan Shpungin
Journal:
Wireless Networks  WINET
, vol. 17, no. 2, pp. 397410, 2011
Approximating directed weighteddegree constrained networks
(
Citations: 1
)
Zeev Nutov
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 810, pp. 901912, 2011
Comments