| Publication | Date of Publication | Type |
|---|
| Query maintenance under batch changes with small-depth circuits | 2026-05-12 | Paper |
| Dynamic complexity of reachability: how many changes can we handle? | 2026-03-18 | Paper |
Log-diameter MST verification and sensitivity in MPC
Algorithmica | 2025-10-10 | Paper |
| Approximating edit distance in the fully dynamic model | 2025-08-15 | Paper |
| Streaming graph algorithms in the massively parallel computation model | 2025-06-13 | Paper |
The parameterized complexity of the survivable network design problem
Journal of Computer and System Sciences | 2024-12-27 | Paper |
| Dynamic planar embedding is in DynFO | 2024-12-03 | Paper |
| Shortest disjoint paths on a grid | 2024-11-28 | Paper |
| Dynamic meta-theorems for distance and matching | 2024-06-24 | Paper |
| The parameterized complexity of the survivable network design problem | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7799594 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
A spatiotemporal analytical outlook of the exposure to air pollution and COVID-19 mortality in the USA
Journal of Agricultural, Biological and Environmental Statistics | 2022-12-12 | Paper |
Shortest k-disjoint paths via determinants
(available as arXiv preprint) | 2022-07-21 | Paper |
| Planar Maximum Matching: Towards a Parallel Algorithm | 2022-07-21 | Paper |
Frameworks for designing in-place graph algorithms
Journal of Computer and System Sciences | 2021-10-28 | Paper |
A framework for in-place graph algorithms
(available as arXiv preprint) | 2021-08-04 | Paper |
Reachability and distances under multiple changes
(available as arXiv preprint) | 2021-07-28 | Paper |
| A strategy for dynamic programs: start over and muddle through | 2020-05-27 | Paper |
Space efficient algorithms for breadth-depth search
(available as arXiv preprint) | 2020-01-30 | Paper |
A strategy for dynamic programs: start over and muddle through
(available as arXiv preprint) | 2019-05-17 | Paper |
Reachability is in DynFO
Journal of the ACM | 2019-02-25 | Paper |
| Space-efficient approximation scheme for maximum matching in sparse graphs | 2018-03-21 | Paper |
Reachability is in DynFO
Automata, Languages, and Programming | 2015-11-04 | Paper |
Twist-three distribution f_(x,k^) in light-front Hamiltonian approach
Modern Physics Letters A | 2013-11-11 | Paper |
Quark transversity distribution in perturbative QCD: light-front Hamiltonian approach
Physics Letters B | 2001-06-20 | Paper |
