| 2013 | ||
|---|---|---|
| c16 | Michael Dinitz, Anupam Gupta: Packing Interdiction and Partial Covering Problems. IPCO 2013: 157-168 | |
| c15 | Michael Dinitz, Guy Kortsarz: Matroid Secretary for Regular and Decomposable Matroids. SODA 2013: 108-117 | |
| 2012 | ||
| c14 | ||
| c13 | Eden Chlamtac, Michael Dinitz, Robert Krauthgamer: Everywhere-Sparse Spanners via Dense Subgraphs. FOCS 2012: 758-767 | |
| c12 | Michael Dinitz, Guy Kortsarz, Ran Raz: Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. ICALP (1) 2012: 290-301 | |
| c11 | Atish Das Sarma, Michael Dinitz, Gopal Pandurangan: Efficient computation of distance sketches in distributed networks. SPAA 2012: 318-326 | |
| i7 | Michael Dinitz, Guy Kortsarz, Ran Raz: Label Cover instances with large girth and the hardness of approximating basic k-spanner. CoRR abs/1203.0224 (2012) | |
| i6 | Eden Chlamtac, Michael Dinitz, Robert Krauthgamer: Everywhere-Sparse Spanners via Dense Subgraphs. CoRR abs/1205.0144 (2012) | |
| i5 | Michael Dinitz, Guy Kortsarz: Matroid Secretary for Regular and Decomposable Matroids. CoRR abs/1207.5146 (2012) | |
| 2011 | ||
| c10 | ||
| c9 | Michael Dinitz, Robert Krauthgamer: Directed spanners via flow-based linear programs. STOC 2011: 323-332 | |
| i4 | Michael Dinitz, Robert Krauthgamer: Fault-Tolerant Spanners: Better and Simpler. CoRR abs/1101.5753 (2011) | |
| i3 | ||
| i2 | Atish Das Sarma, Michael Dinitz, Gopal Pandurangan: Efficient Computation of Distance Sketches in Distributed Networks. CoRR abs/1112.1210 (2011) | |
| 2010 | ||
| j2 | Michael Dinitz, Jonah M. Gold, Thomas C. Sharkey, Lorenzo Traldi: Graphical representations of clutters. Ars Comb. 94 (2010) | |
| c8 | Michael Dinitz: Distributed Algorithms for Approximating Wireless Network Capacity. INFOCOM 2010: 1397-1405 | |
| i1 | Michael Dinitz, Robert Krauthgamer: Directed Spanners via Flow-Based Linear Programs. CoRR abs/1011.3701 (2010) | |
| 2009 | ||
| c7 | Matthew Andrews, Michael Dinitz: Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. INFOCOM 2009: 1332-1340 | |
| c6 | Michael Dinitz: Brief announcement: distributed algorithms for approximating wireless network capacity. PODC 2009: 328-329 | |
| c5 | Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar: Secretary problems: weights and discounts. SODA 2009: 1245-1254 | |
| 2008 | ||
| c4 | ||
| c3 | Michael Dinitz: Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics. DISC 2008: 152-166 | |
| 2007 | ||
| c2 | ||
| 2006 | ||
| j1 | Michael Dinitz: Full Rank Tilings of Finite Abelian Groups. SIAM J. Discrete Math. 20(1): 160-170 (2006) | |
| c1 | ||
Colors in the list of coauthors
Last update Tue May 21 21:15:25 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page