Sebastian Krinninger

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