Robert Krauthgamer (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

81 Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26

75 Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-Max Graph Partitioning and Small Set Expansion CoRR abs/1110.4319: (2011)

54 Robert Krauthgamer, Joseph Naor, Roy Schwartz: Partitioning graphs into balanced components. SODA 2009: 942-949

34 Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor: Asymmetric k-center is log^* n-hard to approximate. J. ACM 52(4): 538-551 (2005)

Selection of 4 from 87 records - Robert Krauthgamer has 70 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

81		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26
75		Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz: Min-Max Graph Partitioning and Small Set Expansion CoRR abs/1110.4319: (2011)
54		Robert Krauthgamer, Joseph Naor, Roy Schwartz: Partitioning graphs into balanced components. SODA 2009: 942-949
34		Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor: Asymmetric k-center is log^* n-hard to approximate. J. ACM 52(4): 538-551 (2005)