| Publication | Date of Publication | Type |
|---|
A unified framework of light spanners. I: Fast (yet optimal) constructions
SIAM Journal on Computing | 2026-01-08 | Paper |
| Computing diameter+2 in truly-subquadratic time for unit-disk graphs | 2025-11-24 | Paper |
| Optimal Euclidean tree covers | 2025-11-24 | Paper |
Optimal padded decomposition for bounded treewidth graphs
TheoretiCS | 2025-10-22 | Paper |
Truly optimal Euclidean spanners
SIAM Journal on Computing | 2025-09-16 | Paper |
| Planar and minor-free metrics embed into metrics of polylogarithmic treewidth with expected multiplicative distortion arbitrarily close to 1 | 2025-08-15 | Paper |
| Covering planar metrics (and beyond): O(1) trees suffice | 2025-08-15 | Paper |
| Optimal fault-tolerant spanners in Euclidean and doubling metrics: breaking the ( n) lightness barrier | 2025-08-15 | Paper |
| Low treewidth embeddings of planar and minor-free metrics | 2025-08-15 | Paper |
| Optimal approximate distance oracle for planar graphs | 2025-08-13 | Paper |
| On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs | 2025-08-12 | Paper |
| Truly optimal Euclidean spanners | 2025-08-12 | Paper |
| Minor-free graphs have light spanners | 2025-08-06 | Paper |
Greedy spanners in Euclidean spaces admit sublinear separators
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more | 2024-11-28 | Paper |
| VC set systems in minor-free (di)graphs and applications | 2024-11-28 | Paper |
| Greedy spanners in Euclidean spaces admit sublinear separators | 2024-07-19 | Paper |
| Near-optimal spanners for general graphs in (nearly) linear time | 2024-07-19 | Paper |
| Approximate distance oracles for planar graphs with subpolynomial error dependency | 2024-05-14 | Paper |
| Sparse Euclidean spanners with tiny diameter: a tight lower bound | 2024-05-14 | Paper |
| A unified framework for light spanners | 2024-05-08 | Paper |
Can't See the Forest for the Trees
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
Balanced Q-learning: combining the influence of optimistic and pessimistic targets
Artificial Intelligence | 2023-12-14 | Paper |
Locality-sensitive orderings and applications to reliable spanners
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Clan embeddings into trees, and low treewidth graphs
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Multi-parameter Szemer\'{e}di-Trotter-type theorems and applications in finite fields | 2023-07-11 | Paper |
| VC Set Systems in Minor-free (Di)Graphs and Applications | 2023-04-04 | Paper |
Light Euclidean Spanners with Steiner Points
(available as arXiv preprint) | 2023-02-07 | Paper |
Truly Optimal Euclidean Spanners
SIAM Journal on Computing | 2022-04-20 | Paper |
Waves of maximal height for a class of nonlocal equations with inhomogeneous symbols
Asymptotic Analysis | 2022-03-14 | Paper |
A PTAS for subset TSP in minor-free graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Local search is a PTAS for feedback vertex set in minor-free graphs
Theoretical Computer Science | 2020-09-01 | Paper |
| A simple local search gives a PTAS for the Feedback Vertex Set problem in minor-free graphs | 2020-02-24 | Paper |
On the existence and instability of solitary water waves with a finite dipole
SIAM Journal on Mathematical Analysis | 2019-10-18 | Paper |
Greedy spanners are optimal in doubling metrics
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A better bound on the largest induced forests in triangle-free planar graph
Graphs and Combinatorics | 2019-01-11 | Paper |
Elliptic equations with transmission and Wentzell boundary conditions and an application to steady water waves in the presence of wind
Discrete and Continuous Dynamical Systems | 2018-08-16 | Paper |
Optimal dynamic program for r-domination problems over tree decompositions
(available as arXiv preprint) | 2018-04-10 | Paper |
Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph
Graphs and Combinatorics | 2018-02-14 | Paper |
Direct numerical simulation of turbulent flow over a backward-facing step
Journal of Fluid Mechanics | 1998-03-30 | Paper |
An improvement of fractional step methods for the incompressible Navier- Stokes equations
Journal of Computational Physics | 1991-01-01 | Paper |
