Michael Dinitz

From MaRDI portal
Person:748115

Available identifiers

zbMath Open dinitz.michael-hMaRDI QIDQ748115

List of research outcomes





PublicationDate of PublicationType
Controlling tail risk in online ski-rental2024-11-28Paper
Epic fail: emulators can tolerate polynomially many edge faults for free2024-09-25Paper
Relative survivable network design2024-08-22Paper
Partially optimal edge fault-tolerant spanners2024-07-19Paper
Improved approximations for relative survivable network design2024-07-19Paper
https://portal.mardi4nfdi.de/entity/Q61262512024-04-09Paper
Reception capacity: definitions, game theory and hardness2024-04-05Paper
https://portal.mardi4nfdi.de/entity/Q61474322024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q58742702023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58754622023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50911902022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50909722022-07-21Paper
Lasserre integrality gaps for graph spanners and related problems2022-03-22Paper
https://portal.mardi4nfdi.de/entity/Q50096412021-08-04Paper
Brief announcement: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network2021-07-28Paper
Approximating spanners and directed Steiner forest. Upper and lower bounds2021-05-03Paper
Efficient and Simple Algorithms for Fault-Tolerant Spanners2021-03-15Paper
Partially Optimal Edge Fault-Tolerant Spanners2021-02-22Paper
Distributed Minimum Degree Spanning Trees2021-01-20Paper
Distributed distance-bounded network design through distributed convex programming2020-07-30Paper
Approximate Moore graphs are good expanders2020-01-15Paper
Lasserre Integrality Gaps for Graph Spanners and Related Problems2019-05-17Paper
Matroid secretary for regular and decomposable matroids2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46339402019-05-06Paper
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights2018-11-12Paper
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner2018-10-30Paper
Smoothed analysis of dynamic networks2018-08-24Paper
Smoothed analysis of dynamic networks2018-08-13Paper
The densest \(k\)-subhypergraph problem2018-07-18Paper
Approximating low-stretch spanners2018-07-16Paper
Approximating spanners and directed Steiner forest: upper and lower bounds2018-07-16Paper
Minimizing the union: tight approximations for small set bipartite vertex expansion2018-07-16Paper
Approximating approximate distance oracles2018-05-03Paper
The densest \(k\)-subhypergraph problem2018-04-19Paper
Computing approximate PSD factorizations2018-04-19Paper
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)2018-03-15Paper
Explicit expanding expanders2017-10-10Paper
Towards resistance sparsifiers2017-08-31Paper
Improved approximation algorithm for Steiner \(k\)-Forest with nearly uniform weights2017-03-22Paper
https://portal.mardi4nfdi.de/entity/Q29696102017-03-22Paper
Lowest-degree \(k\)-spanner: approximation and hardness2016-11-01Paper
Explicit expanding expanders2015-11-19Paper
Efficient distributed computation of distance sketches in networks2015-10-20Paper
Fault-tolerant spanners2015-09-11Paper
Matroid secretary for regular and decomposable matroids2015-02-09Paper
Directed spanners via flow-based linear programs2014-06-05Paper
Compact routing with slack2014-03-13Paper
Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner2013-08-12Paper
Packing interdiction and partial covering problems2013-03-19Paper
iBGP and Constrained Connectivity2012-11-02Paper
Graphical representations of clutters2011-10-25Paper
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics2008-11-20Paper
Spanners with Slack2008-03-11Paper
Full Rank Tilings of Finite Abelian Groups2006-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46819822005-06-09Paper

Research outcomes over time

This page was built for person: Michael Dinitz