Items where Author is "Hanauer, Kathrin"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Category | No Grouping
Number of items: 13.

  • Expander Hierarchies for Normalized Cuts on Graphs
    Hanauer, Kathrin and Henzinger, Monika and Münk, Robin and Räcke, Harald and Vötsch, Maximilian In: 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD ’24) , 25 August 2024 – 29 August 2024 , Barcelona, Spain (2024)

  • Covering Rectilinear Polygons with Area-Weighted Rectangles
    Hanauer, Kathrin and Seybold P., Martin and Unterweger, Julian In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX24) , January 7 - 8, 2024 , Alexandria, Virginia, USA (2024)

  • Assisted Normative Reasoning with Aristotelian Diagrams
    Hanauer, Kathrin and Novotná, Tereza and Pascucci, Matteo In: 36th International Conference on Legal Knowledge and Information Systems (JURIX) , 18.-20.12.2023 , Maastricht, NL (2023)

  • Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
    Hanauer, Kathrin and Henzinger, Monika and Ost, Lara and Schmid, Stefan In: IEEE International Conference on Computer Communications (INFOCOM 2023) , 17–20 May 2023 , New York area, USA (2023)

  • O’Reach: Even Faster Reachability in Large Graphs
    Hanauer, Kathrin and Schulz, Christian and Trummer, Jonathan ISSN 1084-6654 (2022)

  • Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian ISSN 1084-6654 (2022)

  • Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) , March 28-30, 2022 , Online Event (2022)

  • Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
    Hanauer, Kathrin and Henzinger, Monika and Schmid, Stefan and Trummer, Jonathan In: IEEE Conference on Computer Communications (INFOCOM), Virtual Conference, May 2022 , 2-5/5/2022 , Virtual Conference (2022)

  • Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
    Hanauer, Kathrin and Henzinger, Monika and Schmid, Stefan and Trummer, Jonathan In: IEEE International Conference on Computer Communications (INFOCOM) 2022 , 2-5 May, 2022 , Virtual Online (2022)

  • Fully Dynamic Four-Vertex Subgraph Counting
    Hanauer, Kathrin and Henzinger, Monika and Hua, Qi Cheng In: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) , March 28-30, 2022 , Online Event (2022)

  • Even Faster Reachability in Large Graphs
    Hanauer, Kathrin and Schulz, Christian and Trummer, Jonathan In: 19th Symposium on Experimental Algorithms (SEA 2021) , June 7-9, 2021 , Online (2021)

  • Faster Fully Dynamic Transitive Closure in Practice
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: 18th Symposium on Experimental Algorithms (SEA 2020) , June 16-18, 2020 , Catania, Italy (2020)

  • Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
    Hanauer, Kathrin and Henzinger, Monika and Schulz, Christian In: Algorithm Engineering and Experimentation (ALENEX 2020) , Jan 5-6, 2020 , Salt Lake City, Utah, U.S. (2020)

    • This list was generated on Thu Nov 21 15:54:31 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.