Sebastian Forster
Person information
- affiliation: University of Salzburg, Austria
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2019
- [c22]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. SODA 2019: 1899-1918 - [c21]Sebastian Forster, Gramoz Goranci:
Dynamic low-stretch trees via dynamic low-diameter decompositions. STOC 2019: 377-388 - [i21]Sebastian Forster, Liu Yang:
A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems. CoRR abs/1904.08382 (2019) - [i20]Sebastian Forster, Danupon Nanongkai, Thatchaphol Saranurak, Liu Yang, Sorrachai Yingchareonthawornchai:
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. CoRR abs/1910.14344 (2019) - 2018
- [j8]Karl Bringmann, Sebastian Krinninger
:
A note on hardness of diameter approximation. Inf. Process. Lett. 133: 10-15 (2018) - [j7]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. J. ACM 65(6): 36:1-36:40 (2018) - [c20]Sebastian Forster
, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. FOCS 2018: 686-697 - [i19]Gramoz Goranci, Sebastian Krinninger:
Dynamic Low-Stretch Trees via Dynamic Low-Diameter~Decompositions. CoRR abs/1804.04928 (2018) - [i18]Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. CoRR abs/1810.10932 (2018) - 2017
- [j6]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. ACM Trans. Algorithms 13(4): 51:1-51:24 (2017) - [c19]Loukas Georgiadis
, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger
, Nikos Parotsidis
:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. ICALP 2017: 42:1-42:15 - [c18]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger
:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. ICALP 2017: 124:1-124:16 - [c17]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. SODA 2017: 440-452 - [c16]Ruben Becker
, Andreas Karrenbauer, Sebastian Krinninger
, Christoph Lenzen:
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. DISC 2017: 7:1-7:16 - [c15]Karl Bringmann, Sebastian Krinninger
:
Brief Announcement: A Note on Hardness of Diameter Approximation. DISC 2017: 44:1-44:3 - [i17]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. CoRR abs/1704.08122 (2017) - [i16]Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis:
Decremental Data Structures for Connectivity and Dominators in Directed Graphs. CoRR abs/1704.08235 (2017) - [i15]Karl Bringmann, Sebastian Krinninger:
A Note on Hardness of Diameter Approximation. CoRR abs/1705.02127 (2017) - [i14]Sebastian Krinninger, Danupon Nanongkai:
A Faster Distributed Single-Source Shortest Paths Algorithm. CoRR abs/1711.01364 (2017) - 2016
- [j5]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM J. Comput. 45(3): 947-1006 (2016) - [c14]Greg Bodwin, Sebastian Krinninger
:
Fully Dynamic Spanners with Worst-Case Update Time. ESA 2016: 17:1-17:18 - [c13]Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger
, Richard Peng:
On Fully Dynamic Graph Sparsifiers. FOCS 2016: 335-344 - [c12]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC 2016: 489-498 - [r1]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. Encyclopedia of Algorithms 2016: 600-602 - [i13]Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng:
On Fully Dynamic Graph Sparsifiers. CoRR abs/1604.02094 (2016) - [i12]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i11]Greg Bodwin, Sebastian Krinninger:
Fully Dynamic Spanners with Worst-Case Update Time. CoRR abs/1606.07864 (2016) - [i10]Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, Christoph Lenzen:
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. CoRR abs/1607.05127 (2016) - [i9]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. CoRR abs/1607.05132 (2016) - [i8]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR abs/1612.03856 (2016) - 2015
- [c11]Sebastian Krinninger:
Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege. Ausgezeichnete Informatikdissertationen 2015: 161-170 - [c10]Monika Henzinger, Sebastian Krinninger
, Veronika Loitzenbauer:
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. ICALP (1) 2015: 713-724 - [c9]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736 - [c8]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai, Thatchaphol Saranurak
:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30 - [i7]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR abs/1504.07056 (2015) - [i6]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. CoRR abs/1504.07959 (2015) - [i5]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak:
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR abs/1511.06773 (2015) - [i4]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR abs/1512.08147 (2015) - [i3]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. CoRR abs/1512.08148 (2015) - 2014
- [j4]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [j3]Sebastian Krinninger
:
Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness. Fuzzy Sets and Systems 247: 1-17 (2014) - [j2]Krishnendu Chatterjee
, Monika Henzinger, Sebastian Krinninger
, Veronika Loitzenbauer, Michael A. Raskin:
Approximating the minimum cycle mean. Theor. Comput. Sci. 547: 104-116 (2014) - [c7]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. FOCS 2014: 146-155 - [c6]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA 2014: 1053-1072 - [c5]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. STOC 2014: 674-683 - [i2]Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Finding 2-edge and 2-vertex strongly connected components in quadratic time. CoRR abs/1412.6466 (2014) - 2013
- [c4]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS 2013: 538-547 - [c3]Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) 2013: 607-619 - [c2]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Approximating the minimum cycle mean. GandALF 2013: 136-149 - [i1]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. CoRR abs/1308.0776 (2013) - 2012
- [c1]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger
, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312 - 2010
- [j1]Christian Gruber, Thiemo Gruber, Sebastian Krinninger
, Bernhard Sick:
Online Signature Verification With Support Vector Machines Based on LCSS Kernel Functions. IEEE Trans. Systems, Man, and Cybernetics, Part B 40(4): 1088-1100 (2010)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-11-22 00:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint