| Publication | Date of Publication | Type |
|---|
Controlling tail risk in online ski-rental
| 2024-11-28 | Paper |
Epic fail: emulators can tolerate polynomially many edge faults for free
| 2024-09-25 | Paper |
Relative survivable network design
| 2024-08-22 | Paper |
Partially optimal edge fault-tolerant spanners
| 2024-07-19 | Paper |
Improved approximations for relative survivable network design
| 2024-07-19 | Paper |
scientific article; zbMATH DE number 7829257 (Why is no real title available?)
| 2024-04-09 | Paper |
Reception capacity: definitions, game theory and hardness
| 2024-04-05 | Paper |
scientific article; zbMATH DE number 7788512 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7650885 (Why is no real title available?)
| 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650078 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561533 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561338 (Why is no real title available?)
| 2022-07-21 | Paper |
Lasserre integrality gaps for graph spanners and related problems
| 2022-03-22 | Paper |
scientific article; zbMATH DE number 7378741 (Why is no real title available?)
| 2021-08-04 | Paper |
Brief announcement: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network
| 2021-07-28 | Paper |
Approximating spanners and directed Steiner forest. Upper and lower bounds
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Efficient and Simple Algorithms for Fault-Tolerant Spanners
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Partially Optimal Edge Fault-Tolerant Spanners
| 2021-02-22 | Paper |
Distributed Minimum Degree Spanning Trees
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Distributed distance-bounded network design through distributed convex programming
| 2020-07-30 | Paper |
Approximate Moore graphs are good expanders
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Lasserre Integrality Gaps for Graph Spanners and Related Problems
| 2019-05-17 | Paper |
Matroid secretary for regular and decomposable matroids
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
scientific article; zbMATH DE number 7051296 (Why is no real title available?)
| 2019-05-06 | Paper |
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Smoothed analysis of dynamic networks
Lecture Notes in Computer Science | 2018-08-24 | Paper |
Smoothed analysis of dynamic networks
Distributed Computing | 2018-08-13 | Paper |
The densest \(k\)-subhypergraph problem
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
Approximating low-stretch spanners
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Approximating spanners and directed Steiner forest: upper and lower bounds
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Minimizing the union: tight approximations for small set bipartite vertex expansion
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Approximating approximate distance oracles
| 2018-05-03 | Paper |
The densest \(k\)-subhypergraph problem
| 2018-04-19 | Paper |
Computing approximate PSD factorizations
| 2018-04-19 | Paper |
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
| 2018-03-15 | Paper |
Explicit expanding expanders
Algorithmica | 2017-10-10 | Paper |
Towards resistance sparsifiers
| 2017-08-31 | Paper |
Improved approximation algorithm for Steiner \(k\)-Forest with nearly uniform weights
| 2017-03-22 | Paper |
scientific article; zbMATH DE number 6696497 (Why is no real title available?)
| 2017-03-22 | Paper |
Lowest-degree \(k\)-spanner: approximation and hardness
Theory of Computing | 2016-11-01 | Paper |
Explicit expanding expanders
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Efficient distributed computation of distance sketches in networks
Distributed Computing | 2015-10-20 | Paper |
Fault-tolerant spanners
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Matroid secretary for regular and decomposable matroids
SIAM Journal on Computing | 2015-02-09 | Paper |
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Compact routing with slack
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner
Automata, Languages, and Programming | 2013-08-12 | Paper |
Packing interdiction and partial covering problems
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
iBGP and Constrained Connectivity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Graphical representations of clutters
| 2011-10-25 | Paper |
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Spanners with Slack
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Full Rank Tilings of Finite Abelian Groups
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
scientific article; zbMATH DE number 2174609 (Why is no real title available?)
| 2005-06-09 | Paper |
