


Robert Krauthgamer (רוברט קראוטגמר) Faculty member Jump to Research ~ Service ~ Teaching ~ Students ~ Links ~ Contact 
Publications.
Most of my papers are available online:
Chronologically or by keyword.
It includes slides of additional talks
(e.g. more introductory).
Journal Editorial.
SIAM Journal on Computing (SICOMP), Associate Editor (since 2012).
Theory of Computing, an
openaccess journal, Managing Editor (since 2007),
and Editorial Board Member (20042007).
Conferences Program Committees. HALG 2018 (PC chair), ICALP 2018, ESA 2017, HALG 2017, IPDPS 2017, FOCS 2016, HALG 2016, SODA 2016 (PC chair), SIMBAD 2015, SODA 2015, ICALP 2014, SIMBAD 2013, STOC 2013, ICML 2012, ITCS 2012, SIMBAD 2011, APPROX 2011, SODA 2010, APPROX 2009, APPROX 2007, STOC 2007, RANDOM 2005, STOC 2004, APPROX 2003.
List of accepted papers to SODA 2016 and accepted papers with abstracts. Here is a version with with links to full papers (when available publicly).Workshop Organization. Sublinear Algorithms and NearestNeighbor Search (Simons Institute 2018), Sublinear Algorithms (Johns Hopkins 2016), Sublinear Algorithms (Bertinoro 2014), WeizmannWarwick Meeting 2012, WarwickWeizmann workshop 2011, Sublinear Algorithms (Bertinoro 2011), WeizmannWarwick Meeting 2010.
Other.
Steering Committee member, European Symposia on Algorithms (ESA) conference.
Steering Committee member, Highlights of Algorithms (HALG) conference.
Organizer of Weizmann's TheoryLunch (email me to join the mailing list).
Coordinator of the Foundations of computer science (aka theory) seminar
(20092017, joint with Moni Naor).
Coordinator of
Ulpanot de Shalit
in Mathematics and Computer Science (20112012 and 20152016, joint with
Dmitry Novikov /
Dima Gourevitch /
Shahar Dobzinski),
a workshop for select undergraduate students.
Treasurer of the Israel Mathematical Union
(20092010).
MSc Students.
Yevgeny Levanzov, 2018.
On Finding Large Cliques in Random and SemiRandom Graphs.
Yosef Pogrow, 2017.
Solving Symmetric Diagonally Dominant Linear Systems in Sublinear Time (and Some Observations on Graph Sparsification).
Otniel van Handel, 2016,
Vertex Cover Approximation in Data Streams.
Chen Attias, 2016 (supervised jointly with Retsef Levi, MIT),
Combinatorial Optimization Problems with Testing.
Noa Loewenthal, 2014,
Exploiting temporal information for detecting communities in social networks.
Dmitry Kogan, 2014,
Sketching Cuts in Graphs and Hypergraphs.
Inbal Rika, 2013,
Mimicking Networks and Succinct Representations of Terminal Cuts.
Nimrod Talmon, 2012,
Selection in the Presence of Memory Faults, With Applications to Inplace Resilient Sorting.
Tamar Zondiner, 2012,
Eliminating Steiner Vertices in Graph Metrics.
PhD Students.
Chen Attias, current (supervised jointly with Boaz Nadler).
Ohad Trabelsi, current (supervised jointly with Eden Chlamtac, BGU).
Inbal Rika, current.
Arnold Filtser, current (at BGU, supervised jointly with Ofer Neiman).
Lior Kamma, 2017,
Algorithms for Graphical Vertex Sparsifiers.
Postdocs.
Shaofeng Jiang,
2017today.
Nimrod Talmon,
2015today.
Bundit Laekhanukit,
20152017 (jointly with Uriel Feige).
Rajesh Chitnis,
20142017 (jointly with Uriel Feige).
Gilad Tsur,
20112013.
Tsvi Kopelowitz,
20112013.
Michael Dinitz,
20102013 (jointly with David Peleg).
LeeAd Gottlieb,
20082010.
Office:  Ziskind Building #222 
Phone:  089344281 
Fax:  089344122 (to my attention) 
Mailing Address:  Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 234 Herzel St., P.O.B. 26, Rehovot 76100, ISRAEL. 
Email:  robert.krauthgamer@weizmann.ac.il 