Publications per year
Publications per year
- 15 results
Search results
-
2023
Bootstrapping Dynamic Distance Oracles
Forster, S., Goranci, G., Nazari, Y. & Skarlatos, A., 1 Sep 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). 50Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
Efficient Data Structures for Incremental Exact and Approximate Maximum Flow
Goranci, G. & Henzinger, M., 1 Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). 69Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
Fully Dynamic Exact Edge Connectivity in Sublinear Time
Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, M. & Wulff-Nilsen, C., 1 Jan 2023, ACM-SIAM Symposium on Discrete Algorithms (SODA23).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
2021
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
Forster, S., Goranci, G. & Henzinger, M., 1 Jan 2021, ACM-SIAM Symposium on Discrete Algorithms (SODA21).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
Fully Dynamic k-Center Clustering in Low Dimensional Metrics
Goranci, G., Henzinger, M., Leniowski, D., Schulz, C. & Svozil, A., 1 Jan 2021, SIAM Symposium on Algorithm Engineering and Experiments.Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
2020
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
Chen, L., Goranci, G., Henzinger, M., Peng, R. & Saranurak, T., 1 Nov 2020, 61st Annual IEEE Symposium on Foundations of Computer Science.Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
2019
Dynamic low-stretch trees via dynamic low-diameter decompositions
Forster, S. & Goranci, G., 23 Jun 2019, 51st Annual ACM Symposium on the Theory of Computing (STOC 2019). Charikar, M. & Cohen, E. (eds.). New York: Association for Computing Machinery (ACM), p. 377-388 12 p.Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
Fully dynamic specrtal vertex sparsifiers and applications
Durfee, D., Gao, Y., Goranci, G. & Peng, R., 1 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). p. 914-925 12 p.Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
2018
A Tree Structure for Dynamic Facility Location
Goranci, G., Henzinger, M. & Leniowski, D., 20 Aug 2018, 26th Annual European Symposium on Algorithms (ESA 2018). Bast, H., Herman, G. & Azar, Y. (eds.). Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 39. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 112).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
Goranci, G., Henzinger, M. & Peng, P., 20 Aug 2018, 26th Annual European Symposium on Algorithms (ESA 2018). Bast, H., Herman, G. & Azar, Y. (eds.). Wadern: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 15 p. 40. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 112).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
2017
Improved Guarantees for Vertex Sparsification in Planar Graphs
Goranci, G., Henzinger, M. & Peng, P., 1 Sep 2017, 25th Annual European Symposium on Algorithms (ESA 2017). Pruhs, K. & Sohler, C. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 44:1-44:14 14 p. 44. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 87).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
Goranci, G., Henzinger, M. & Peng, P., 4 Sep 2017, 25th Annual European Symposium on Algorithms (ESA 2017). Pruhs, K. & Sohler, C. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 45:1-45:14 45. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 87).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access -
Vertex Sparsification in Trees
Goranci, G. & Räcke, H., 2017, Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Revised Selected Papers. Mastrolilli, M. & Jansen, K. (eds.). p. 103-115 13 p.Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
2016
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Cheung, Y. K., Goranci, G. & Henzinger, M., 1 Jul 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y. & Sangiorgi, D. (eds.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 131:1-131:14 131. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 55).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
-
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
Goranci, G., Henzinger, M. & Thorup, M., 1 Aug 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 46:1-46:17 46. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 57).Publications: Contribution to book › Contribution to proceedings › Peer Reviewed
Open Access