| Publication | Date of Publication | Type |
|---|
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
(available as arXiv preprint) | N/A | Paper |
| Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs | 2026-09-10 | Paper |
Lower bounds on tree covers
SIAM Journal on Computing | 2026-07-29 | Paper |
| On packing low-diameter spanning trees | 2026-03-18 | Paper |
| Lower bounds on 0-extension with Steiner nodes | 2026-01-14 | Paper |
| Towards better approximation of graph crossing number | 2025-08-12 | Paper |
| An \(\Omega(\sqrt{\log |T|})\) lower bound for Steiner point removal | 2024-11-28 | Paper |
| On \((1 + \varepsilon)\)-approximate flow sparsifiers | 2024-11-28 | Paper |
| Sublinear algorithms and lower bounds for estimating MST and TSP cost in general metrics | 2024-11-14 | Paper |
| A new conjecture on hardness of 2-CSP's with implications to hardness of densest \(k\)-subgraph and other problems | 2024-09-25 | Paper |
| Query complexity of the metric Steiner tree problem | 2024-05-14 | Paper |
| Almost-optimal sublinear additive spanners | 2024-05-08 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
scientific article; zbMATH DE number 7788470 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Almost-linear <i>ε</i> -emulators for planar graphs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Towards tight(er) bounds for the excluded grid theorem
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Erratum to: ``On the inequalities of projected volumes and the constructible region''
SIAM Journal on Discrete Mathematics | 2020-04-07 | Paper |
Towards tight(er) bounds for the excluded grid theorem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the inequalities of projected volumes and the constructible region
SIAM Journal on Discrete Mathematics | 2019-05-13 | Paper |
Comments on Cut-Set Bounds on Network Function Computation
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Web and Internet Economics | 2017-02-10 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Web and Internet Economics | 2017-02-10 | Paper |
On the computational complexity of bridgecard
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
| On the Meeting Time for Two Random Walks on a Regular Graph | 2014-08-08 | Paper |
