Items where Author is "Krinninger, Sebastian"

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 | Book Section/Chapter
Number of items: 23.

Journal Paper

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0097-5397 (2021)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0004-5411 (2018)

  • Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 1549-6325 (2017)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 947-1006 ISSN 0097-5397 (2016)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika and Raskin, Michael A. pp. 104-116 ISSN 0304-3975 (2014)

  • Polynomial-Time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 457-492 ISSN 0178-4617 (2014)

  • Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness
    Krinninger, Sebastian pp. 1-17 ISSN 0165-0114 (2014)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • Brief Announcement: A Note on Hardness of Diameter Approximation
    Bringmann, Karl and Krinninger, Sebastian In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
    Becker, Ruben and Karrenbauer, Andreas and Krinninger, Sebastian and Lenzen, Christoph In: 31st International Symposium on Distributed Computing (DISC 2017) , October 17–19, 2017 , Vienna (2017)

  • Decremental Data Structures for Connectivity and Dominators in Directed Graphs
    Georgiadis, Loukas and Hansen, Thomas Dueholm and Italiano, Giuseppe F. and Krinninger, Sebastian and Parotsidis, Nikos In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
    Bringmann, Karl and Hansen, Thomas Dueholm and Krinninger, Sebastian In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) , July 10–14 2017 , Warsaw (2017)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time
    Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
    Henzinger, Monika and Nanongkai, Danupon and Krinninger, Sebastian In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015) , July 6–10, 2015 , Kyoto, Japan (2015)

  • Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon and Saranurak, Thatchaphol In: 47th ACM Symposium on Theory of Computing (STOC 2015) , June 14 - June 17 , Portland, OR, USA (2015)

  • Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2014) , October 18-21, 2014 , Philadelphia, USA (2014)

  • Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 46th ACM Symposium on Theory of Computing (STOC 2014) , June 1 – June 3, 2014 , New York, NY, USA (2014)

  • A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 25th ACM-SIAM Symposium on Discrete Algorithms (SODA14) , January 5-7, 2014 , Portland, USA (In Press) (2014)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: FOCS 2013 54th Annual IEEE Symposium on Foundations of Computer Science , October 27-29, 2013 , Berkeley, USA (In Press) (2013)

  • Approximating the minimum cycle mean
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Loitzenbauer, Veronika In: Fourth International Symposion on Games, Automata, Logics and Formal Verification (GandALF 2013) , 29 - 31 Aug 2013 , Borca di Cadore, Dolomites, Italy (2013)

  • Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 40th International Colloquium on Automata, Languages and Programming (ICALP 2013) , 8-12 July 2013 , Riga, Latvia (In Press) (2013)

  • Polynomial-time Algorithms for Energy Games with Special Weight Structures
    Chatterjee, Krishnendu and Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: 20th Annual European Symposium on Algorithms (ESA 2012) , 10-12 Sep 2012 , Ljubljana, Slovenia (2012)

    • Book Section/Chapter

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: Encyclopedia of Algorithms. Springer, pp. 600-602 (2016)

    • This list was generated on Thu Nov 21 16:50:43 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.