Sebastian Krinninger

Publication Activity (10 Years)

Years Active: 2010-2021
Publications (10 Years): 24

Top Topics

Strongly Connected

Dynamically Updated

Top Venues

Publications

Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50 (3) (2021)
Karl Bringmann, Sebastian Krinninger
A note on hardness of diameter approximation. Inf. Process. Lett. 133 (2018)
Gramoz Goranci, Sebastian Krinninger
Dynamic Low-Stretch Trees via Dynamic Low-Diameter~Decompositions. CoRR (2018)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. J. ACM 65 (6) (2018)
Karl Bringmann, Sebastian Krinninger
A Note on Hardness of Diameter Approximation. CoRR (2017)
Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. ICALP (2017)
Sebastian Krinninger, Danupon Nanongkai
A Faster Distributed Single-Source Shortest Paths Algorithm. CoRR (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR (2017)
Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. CoRR (2017)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC (2017)
Ittai Abraham, Shiri Chechik, Sebastian Krinninger
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. SODA (2017)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. ACM Trans. Algorithms 13 (4) (2017)
Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP (2017)
Karl Bringmann, Sebastian Krinninger
Brief Announcement: A Note on Hardness of Diameter Approximation. DISC (2017)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM J. Comput. 45 (3) (2016)
Ittai Abraham, Shiri Chechik, Sebastian Krinninger
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. CoRR (2016)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR (2016)
Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng
On Fully Dynamic Graph Sparsifiers. FOCS (2016)
Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng
On Fully Dynamic Graph Sparsifiers. CoRR (2016)
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR (2016)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC (2016)
Greg Bodwin, Sebastian Krinninger
Fully Dynamic Spanners with Worst-Case Update Time. CoRR (2016)
Greg Bodwin, Sebastian Krinninger
Fully Dynamic Spanners with Worst-Case Update Time. ESA (2016)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR (2016)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC (2015)
Sebastian Krinninger
Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege. Ausgezeichnete Informatikdissertationen (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. CoRR (2015)
Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. ICALP (1) (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. CoRR (2015)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) (2015)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin
Approximating the minimum cycle mean. Theor. Comput. Sci. 547 (2014)
Sebastian Krinninger
Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness. Fuzzy Sets Syst. 247 (2014)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA (2014)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. FOCS (2014)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. STOC (2014)
Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
Finding 2-edge and 2-vertex strongly connected components in quadratic time. CoRR (2014)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70 (3) (2014)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. CoRR (2013)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer
Approximating the minimum cycle mean. GandALF (2013)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) (2013)
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS (2013)
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA (2012)
Christian Gruber, Thiemo Gruber, Sebastian Krinninger, Bernhard Sick
Online Signature Verification With Support Vector Machines Based on LCSS Kernel Functions. IEEE Trans. Syst. Man Cybern. Part B 40 (4) (2010)