Online Signature Verification With Support Vector Machines Based on LCSS Kernel Functions. - Christian Gruber; Thiemo Gruber; Sebastian Krinninger; Bernhard Sick (IEEE Trans. Syst. Man Cybern. Part B, 2010)

Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ICALP (2), 2013)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer (GandALF, 2013)

A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SODA, 2014)

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (STOC, 2014)

Polynomial-Time Algorithms for Energy Games with Special Weight Structures. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (Algorithmica, 2014)

Validity in a logic that combines supervaluation and fuzzy logic based theories of vagueness. - Sebastian Krinninger (Fuzzy Sets Syst., 2014)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer; Michael A. Raskin (Theor. Comput. Sci., 2014)

Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege. - Sebastian Krinninger (Ausgezeichnete Informatikdissertationen, 2015)

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time. - Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer (ICALP (1), 2015)

Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ICALP (1), 2015)

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai; Thatchaphol Saranurak (STOC, 2015)

An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (CoRR, 2015)

Fully Dynamic Spanners with Worst-Case Update Time. - Greg Bodwin; Sebastian Krinninger (ESA, 2016)

On Fully Dynamic Graph Sparsifiers. - Ittai Abraham; David Durfee; Ioannis Koutis; Sebastian Krinninger; Richard Peng (FOCS, 2016)

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. - Ruben Becker; Andreas Karrenbauer; Sebastian Krinninger; Christoph Lenzen 001 (CoRR, 2016)

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SIAM J. Comput., 2016)

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (Encyclopedia of Algorithms, 2016)

Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. - Karl Bringmann; Thomas Dueholm Hansen; Sebastian Krinninger (ICALP, 2017)

Decremental Data Structures for Connectivity and Dominators in Directed Graphs. - Loukas Georgiadis; Thomas Dueholm Hansen; Giuseppe F. Italiano; Sebastian Krinninger; Nikos Parotsidis (ICALP, 2017)

Fully dynamic all-pairs shortest paths with worst-case update-time revisited. - Ittai Abraham; Shiri Chechik; Sebastian Krinninger (SODA, 2017)

Brief Announcement: A Note on Hardness of Diameter Approximation. - Karl Bringmann; Sebastian Krinninger (DISC, 2017)

Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (ACM Trans. Algorithms, 2017)

A Faster Distributed Single-Source Shortest Paths Algorithm. - Sebastian Forster; Danupon Nanongkai (FOCS, 2018)

A note on hardness of diameter approximation. - Karl Bringmann; Sebastian Krinninger (Inf. Process. Lett., 2018)

Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (J. ACM, 2018)

Dynamic low-stretch trees via dynamic low-diameter decompositions. - Sebastian Forster; Gramoz Goranci (STOC, 2019)

A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems. - Sebastian Forster; Liu Yang (CoRR, 2019)

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. - Sebastian Forster; Danupon Nanongkai; Liu Yang; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai (SODA, 2020)

Minor Sparsifiers and the Distributed Laplacian Paradigm. - Sebastian Forster; Gramoz Goranci; Yang P. Liu; Richard Peng; Xiaorui Sun; Mingquan Ye (FOCS, 2021)

An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. - Sebastian Forster; Martin Grösbacher; Tijn de Vos (OPODIS, 2021)

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications. - Sebastian Forster; Gramoz Goranci; Monika Henzinger (SODA, 2021)

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. - Ruben Becker; Sebastian Forster; Andreas Karrenbauer; Christoph Lenzen 001 (SIAM J. Comput., 2021)

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. - Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (SIAM J. Comput., 2021)

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. - Aaron Bernstein; Sebastian Forster; Monika Henzinger (ACM Trans. Algorithms, 2021)

Fast Deterministic Fully Dynamic Distance Approximation. - Jan van den Brand; Sebastian Forster; Yasamin Nazari (FOCS, 2022)

The Laplacian Paradigm in the Broadcast Congested Clique. - Sebastian Forster; Tijn de Vos (PODC, 2022)

Dynamic Graph Algorithms (Dagstuhl Seminar 22461). - Aaron Bernstein; Shiri Chechik; Sebastian Forster; Tsvi Kopelowitz; Yasamin Nazari; Nicole Wein (Dagstuhl Reports, 2022)

Bootstrapping Dynamic Distance Oracles. - Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (ESA, 2023)

Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. - Sebastian Forster; Tijn de Vos (PODC, 2023)

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch. - Sebastian Forster; Yasamin Nazari; Maximilian Probst Gutenberg (STOC, 2023)

The Laplacian Paradigm in Deterministic Congested Clique. - Sebastian Forster; Tijn de Vos (CoRR, 2023)

Fast Algorithms for Energy Games in Special Cases. - Sebastian Forster; Antonis Skarlatos; Tijn de Vos (GandALF, 2023)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (CoRR, 2023)

Faster Cut Sparsification of Weighted Graphs. - Sebastian Forster; Tijn de Vos (Algorithmica, 2023)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yasamin Nazari; Tijn de Vos (ICALP, 2024)

On Dynamic Graph Algorithms with Predictions. - Jan van den Brand; Sebastian Forster; Yasamin Nazari; Adam Polak 001 (SODA, 2024)

Dynamic algorithms for k-center on graphs. - Emilio Cruciani; Sebastian Forster; Gramoz Goranci; Yasamin Nazari; Antonis Skarlatos (SODA, 2024)

Fast 2-Approximate All-Pairs Shortest Paths. - Michal Dory; Sebastian Forster; Yael Kirkpatrick; Yasamin Nazari; Virginia Vassilevska Williams; Tijn de Vos (SODA, 2024)

Dynamic Consistent k-Center Clustering with Optimal Recourse. - Sebastian Forster; Antonis Skarlatos (SODA, 2025)