pith. sign in

Sebastian Krinninger

Identifiers

  • name variant Sebastian Krinninger 0.60 · backfill

Papers (16)

  1. A Note on Hardness of Diameter Approximation cs.DS · 2017 · author #2
  2. Decremental Data Structures for Connectivity and Dominators in Directed Graphs cs.DS · 2017 · author #4
  3. Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs cs.DS · 2017 · author #3
  4. Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs cs.DS · 2016 · author #2
  5. Fully dynamic all-pairs shortest paths with worst-case update-time revisited cs.DS · 2016 · author #3
  6. Fully Dynamic Spanners with Worst-Case Update Time cs.DS · 2016 · author #2
  7. Polynomial-Time Algorithms for Energy Games with Special Weight Structures cs.DS · 2016 · author #3
  8. On Fully Dynamic Graph Sparsifiers cs.DS · 2016 · author #4
  9. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time cs.DS · 2015 · author #2
  10. Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks cs.DS · 2015 · author #2
  11. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture cs.DS · 2015 · author #2
  12. Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs cs.DS · 2015 · author #2
  13. A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths cs.DC · 2015 · author #2
  14. Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time cs.DS · 2014 · author #2
  15. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization cs.DS · 2013 · author #2
  16. Approximating the minimum cycle mean cs.DS · 2013 · author #3

Mentions

  • 1308.0776 #2 · backfill · confidence 0.70 Sebastian Krinninger
  • 1307.4473 #3 · backfill · confidence 0.70 Sebastian Krinninger

Frequent Coauthors