| Publication | Date of Publication | Type |
|---|
| Fitting distances by tree metrics minimizing the total error within a constant factor | 2025-08-13 | Paper |
| Decremental single-source reachability and strongly connected components in \(\widetilde{O}(m \sqrt{n})\) total update time | 2025-08-06 | Paper |
| A local search algorithm for large maximum weight independent set problems | 2025-06-19 | Paper |
Fitting distances by tree metrics minimizing the total error within a constant factor
Journal of the ACM | 2025-02-06 | Paper |
A metaheuristic algorithm for large maximum weight independent set problems
Networks | 2025-01-15 | Paper |
| Optimal decremental connectivity in non-sparse graphs | 2024-11-14 | Paper |
| Faster computation of 3-edge-connected components in digraphs | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788356 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788501 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Collaborative procrastination | 2023-02-07 | Paper |
Faster algorithms for all-pairs bounded min-cuts
(available as arXiv preprint) | 2022-07-21 | Paper |
Dominating sets and connected dominating sets in dynamic graphs
(available as arXiv preprint) | 2022-07-18 | Paper |
New instances for maximum weight independent set from a vehicle routing application
SN Operations Research Forum | 2021-11-08 | Paper |
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Strong connectivity in directed graphs under failures, with applications
SIAM Journal on Computing | 2020-09-17 | Paper |
Decremental data structures for connectivity and dominators in directed graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
All-pairs 2-reachability in \(\mathcal{O}(n^\omega\log n)\) time
(available as arXiv preprint) | 2020-05-27 | Paper |
Incremental strong connectivity and 2-connectivity in directed graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
2-connectivity in directed graphs: an experimental study
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Computing 2-connected components and maximal 2-connected subgraphs in directed graphs: an experimental study
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
2-Edge Connectivity in Directed Graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Strong connectivity in directed graphs under failures, with applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
2-vertex connectivity in directed graphs
Information and Computation | 2018-06-14 | Paper |
| 2-Connectivity in Directed Graphs (Invited Talk) | 2018-03-02 | Paper |
Incremental 2-edge-connectivity in directed graphs
(available as arXiv preprint) | 2017-12-19 | Paper |
Sparse certificates for 2-connectivity in directed graphs
Theoretical Computer Science | 2017-11-06 | Paper |
2-edge connectivity in directed graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
Algorithms - ESA 2015 | 2015-11-19 | Paper |
2-vertex connectivity in directed graphs
Automata, Languages, and Programming | 2015-10-27 | Paper |
