Skip to contents

  1. Eberle, Franziska [Author]; Megow, Nicole [Author]; Nölke, Lukas [Author]; Simon, Bertrand [Author]; Wiese, Andreas [Author] ; Franziska Eberle and Nicole Megow and Lukas Nölke and Bertrand Simon and Andreas Wiese [Contributor]

    Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021

  2. Chen, Lijie [Author]; Duan, Ran [Author]; Wang, Ruosong [Author]; Zhang, Hanrui [Author]; Zhang, Tianyi [Author] ; Lijie Chen and Ran Duan and Ruosong Wang and Hanrui Zhang and Tianyi Zhang [Contributor]

    An Improved Algorithm for Incremental DFS Tree in Undirected Graphs

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018

  3. Kara, Ahmet [Author]; Nikolic, Milos [Author]; Olteanu, Dan [Author]; Zhang, Haozhe [Author] ; Ahmet Kara and Milos Nikolic and Dan Olteanu and Haozhe Zhang [Contributor]

    Conjunctive Queries with Free Access Patterns Under Updates

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023

  4. Hanauer, Kathrin [Author]; Henzinger, Monika [Author]; Schulz, Christian [Author]

    Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

    Conference Proceedings
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    LIPIcs - Leibniz International Proceedings in Informatics. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022

  5. Anand, Abhash [Author]; Baswana, Surender [Author]; Gupta, Manoj [Author]; Sen, Sandeep [Author] ; Abhash Anand and Surender Baswana and Manoj Gupta and Sandeep Sen [Contributor]

    Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2012

  6. Amir, Amihood [Author]; Charalampopoulos, Panagiotis [Author]; Pissis, Solon P. [Author]; Radoszewski, Jakub [Author] ; Amihood Amir and Panagiotis Charalampopoulos and Solon P. Pissis and Jakub Radoszewski [Contributor]

    Longest Common Substring Made Fully Dynamic

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019

  7. Bernstein, Aaron [Author]; van den Brand, Jan [Author]; Probst Gutenberg, Maximilian [Author]; Nanongkai, Danupon [Author]; Saranurak, Thatchaphol [Author]; Sidford, Aaron [Author]; Sun, He [Author] ; Aaron Bernstein and Jan van den Brand and Maximilian Probst Gutenberg and Danupon Nanongkai and Thatchaphol Saranurak and Aaron Sidford and He Sun [Contributor]

    Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

    Articles
    View online
    Close

    Bookmarks

    You can manage bookmarks using lists, please log in to your user account for this.

    Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022