Michael Dinitz

Available identifiers

zbMath Open dinitz.michael-hMaRDI QIDQ748115

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126251	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6147432	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q5874270	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5875462	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5090972	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091190	2022-07-21	Paper
Lasserre integrality gaps for graph spanners and related problems	2022-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5009641	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002788	2021-07-28	Paper
Approximating Spanners and Directed Steiner Forest	2021-05-03	Paper
Efficient and Simple Algorithms for Fault-Tolerant Spanners	2021-03-15	Paper
Partially Optimal Edge Fault-Tolerant Spanners	2021-02-22	Paper
Distributed Minimum Degree Spanning Trees	2021-01-20	Paper
Distributed Distance-Bounded Network Design Through Distributed Convex Programming	2020-07-30	Paper
Approximate Moore graphs are good expanders	2020-01-15	Paper
Lasserre Integrality Gaps for Graph Spanners and Related Problems	2019-05-17	Paper
Matroid Secretary for Regular and Decomposable Matroids	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4633940	2019-05-06	Paper
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights	2018-11-12	Paper
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner	2018-10-30	Paper
Smoothed analysis of dynamic networks	2018-08-24	Paper
Smoothed analysis of dynamic networks	2018-08-13	Paper
The Densest $k$-Subhypergraph Problem	2018-07-18	Paper
Approximating Low-Stretch Spanners	2018-07-16	Paper
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds	2018-07-16	Paper
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4638107	2018-05-03	Paper
Computing approximate PSD factorizations	2018-04-19	Paper
The Densest k-Subhypergraph Problem	2018-04-19	Paper
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)	2018-03-15	Paper
Explicit expanding expanders	2017-10-10	Paper
Towards Resistance Sparsifiers	2017-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q2969610	2017-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q2969613	2017-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q2830866	2016-11-01	Paper
Explicit expanding expanders	2015-11-19	Paper
Efficient distributed computation of distance sketches in networks	2015-10-20	Paper
Fault-tolerant spanners	2015-09-11	Paper
Matroid Secretary for Regular and Decomposable Matroids	2015-02-09	Paper
Directed spanners via flow-based linear programs	2014-06-05	Paper
Compact routing with slack	2014-03-13	Paper
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner	2013-08-12	Paper
Packing Interdiction and Partial Covering Problems	2013-03-19	Paper
iBGP and Constrained Connectivity	2012-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q3094552	2011-10-25	Paper
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics	2008-11-20	Paper
Spanners with Slack	2008-03-11	Paper
Full Rank Tilings of Finite Abelian Groups	2006-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4681982	2005-06-09	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael Dinitz