Items where Research Area is "Theory and Applications of Algorithms" and Year is 2022

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Jump to: B | C | E | F | H
Number of items: 17.

B

  • Fair k-Center Clustering in MapReduce and Streaming
    Bera, Suman and Das, Syamantak and Galhotra, Sainyam and Kale, Sagar In: ACM Web Conference 2022 (TheWebConf 2022) , 25.-29. April 2022 , Virtual Online (2022)

  • Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG
    Brankovic, Milutin and Seybold P., Martin In: The 28th International Computing and Combinatorics Conference , October 22-24, 2022 , Shenzhen, China (2022)

    • C

  • Improved Coresets for Euclidean k-Means
    Cohen-Addad, Vincent and Larsen, Kasper Green and Saulpic, David and Schwiegelshohn, Chris and Sheikh-Omar, Omar Ali In: Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS 2022) , 28.11.2022-09.12.2022 , New Orleans (2022)

    • E

  • Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
    El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan In: ACM Symposium on Principles of Distributed Computing (PODC) 2022 , July 25-29, 2022 , Salerno, Italy (2022)

  • Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices
    Ernstbrunner, Robert and Mayer, Viktoria and Gansterer, Wilfried In: IEEE International Parallel and Distributed Processing Symposium (IPDPS) , May 30 - June 3, 2022 , Lyon, France (2022)

    • F

  • Approximately Counting Subgraphs in Data Streams
    Fichtenberger, Hendrik and Peng, Pan In: ACM Symposium on Principles of Database Systems (PODS22) , 12.06.2022 - 17.06.2022 , Philadelphia, USA (2022)

    • H

  • 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)

  • 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)

  • 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)

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

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

  • The Complexity of Average-Case Dynamic Subgraph Counting
    Henzinger, Monika and Lincoln, Andrea and Saha, Barna In: ACM-SIAM Symposium on Discrete Algorithms (SODA22) , January, 9-12, 2022 , Alexandria, Virginia, U.S. (2022)

  • Practical Fully Dynamic Minimum Cut Algorithms
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX22) , January 9 - 10, 2022 , Hybrid: Alexandria, Virginia, U.S. (2022)

  • The augmentation-speed tradeoff for consistent network updates
    Henzinger, Monika and Paz, Ami and Pourdamghani, Arash and Schmid, Stefan In: The ACM SIGCOMM Symposium on SDN Research (SOSR) 2022 , October 20, 2022 , Virtual Event (2022)

  • Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
    Henzinger, Monika and Paz, Ami and Sricharan, A.R. In: European Symposium on Algorithms (ESA) 2022 , 5.-9.9.2022 , Potsdam, Germany (2022)

  • Leximax Approximations and Representative Cohort Selection
    Henzinger, Monika and Peale, Charlotte and Reingold, Omer and Hanwen Shen, Judy In: The 3rd annual Symposium on Foundations of Responsible Computing (FORC 2022) , June 6-8, 2022 , Cambridge, MA, USA (2022)

  • Constant-Time Dynamic (∆ + 1)-Coloring
    Henzinger, Monika and Peng, Pan ISSN 1549-6325 (2022)

    • This list was generated on Tue Nov 5 15:26:04 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.