Items where Author is "Goranci, Gramoz"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Category | No Grouping
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings
Number of items: 23.

Journal Paper

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan ISSN 0895-4801 (2019)

  • Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel ISSN 1549-6325 (2018)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • Near-Optimal (1 + ϵ)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs
    Filtser, Arnold and Goranci, Gramoz and Patel, Neel and Probst Gutenberg, Maximilian In: 65th IEEE Symposium on Foundations of Computer Science (FOCS) 2024 , October 27-30, 2024 , Chicago, IL, USA (2024)

  • Dynamic Facility Location in High Dimensional Euclidean Spaces
    Bhattacharya, Sayan and Goranci, Gramoz and Jiang, Shaofeng H.-C. and Qian, Yi and Zhang, Yubo In: The 41st International Conference on Machine Learning (ICML 2024) , July 21 - July 27, 2024 , Vienna, Austria (2024)

  • Fully Dynamic Algorithms for Euclidean Steiner Tree
    Chan, T-H. Hubert and Goranci, Gramoz and Jiang, Shaofeng H.-C. and Wang, Bo and Xue, Quan In: The 17th International Conference and Workshops on Algorithms and Computation , March 18-20, 2024 , Japan (2024)

  • Dynamic algorithms for k-center on graphs
    Cruciani, Emilio and Forster, Sebastian and Goranci, Gramoz and Nazari, Yasamin and Skarlatos, Antonis In: ACM-SIAM Symposium on Discrete Algorithms (SODA24) , January, 7-10, 2024 , Alexandria, Virginia, USA (2024)

  • Electrical Flows for Polylogarithmic Competitive Oblivious Routing
    Goranci, Gramoz and Henzinger, Monika and Räcke, Harald and Sachdeva, Sushant and A.R., Sricharan In: 15th Innovations in Theoretical Computer Science (ITCS) , January 30 to Friday February 2, 2024 , Simons Institute for the Theory of Computing on the University of California, Berkeley, USA (2024)

  • Fast Algorithms for Separable Linear Programs
    Dong, Sally and Goranci, Gramoz and Li, Lawrence and Sachdeva, Sushant and Ye, Guanghao In: SODA 2024, 35th Annual ACM-SIAM Symposium on Discrete Algorithms , January, 7-10, 2024 , Alexandria, Virginia, USA (2024)

  • Bootstrapping Dynamic Distance Oracles
    Forster, Sebastian and Goranci, Gramoz and Nazari, Yasamin and Skarlatos, Antonis In: European Symposium on Algorithms (ESA) , September 4-8, 2023 , Amsterdam (2023)

  • Efficient Data Structures for Incremental Exact and Approximate Maximum Flow
    Goranci, Gramoz and Henzinger, Monika In: 50th EATCS International Colloquium on Automata, Languages and Programming, ICALP 2023 , 10-14 July , Paderborn, Germany (2023)

  • Fully Dynamic Exact Edge Connectivity in Sublinear Time
    Goranci, Gramoz and Henzinger, Monika and Nanongkai, Danupon and Saranurak, Thatchaphol and Thorup, Mikkel and Wulff-Nilsen, Christian In: ACM-SIAM Symposium on Discrete Algorithms (SODA23) , January 22 - 25, 2023 , Florence, Italy (2023)

  • Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
    Forster, Sebastian and Goranci, Gramoz and Henzinger, Monika In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Fully Dynamic k-Center Clustering in Low Dimensional Metrics
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz and Schulz, Christian and Svozil, Alexander In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021) , 10.-11.1.2021 , Virtual Online (Virginia, US) (2021)

  • Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
    Chen, Li and Goranci, Gramoz and Henzinger, Monika and Peng, Richard and Saranurak, Thatchaphol In: 61st Annual IEEE Symposium on Foundations of Computer Science , 16.-19.11.2020 , Online Virtual Conference (2020)

  • Dynamic low-stretch trees via dynamic low-diameter decompositions
    Forster, Sebastian and Goranci, Gramoz In: 51st Annual ACM Symposium on the Theory of Computing (STOC 2019) , 23-26 June 2019 , Phoenix, AZ, USA (2019)

  • Fully dynamic specrtal vertex sparsifiers and applications
    Durfee, David and Gao, Yu and Goranci, Gramoz and Peng, Richard In: 51st Annual ACM Symposium on the Theory of Computing (STOC 2019) , 23-26 June 2019 , Phoenix, AZ, USA (2019)

  • A Tree Structure For Dynamic Facility Location
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 26th Annual European Symposium on Algorithms (ESA 2018) , 20-24 August 2018 , Helsinki, Finland (2018)

  • Improved Guarantees for Vertex Sparsification in Planar Graphs
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
    Goranci, Gramoz and Henzinger, Monika and Peng, Pan In: 25th Annual European Symposium on Algorithms (ESA 2017) , September 4-6, 2017 , Vienna, Austria (2017)

  • Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Vertex Sparsification in Trees
    Goranci, Gramoz and Räcke, Harald In: 14th Workshop on Approximation and Online Algorithms (WAOA) 2016 , August 25-26, 2016 , Aarhus, Denmark (2016)

  • Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , 12-15 July 2016 , Rome, Italy (2016)

    • This list was generated on Wed Nov 20 13:05:10 2024 CET.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.