Travelled to:1 × Japan
1 × Latvia
2 × USA
Collaborated with:M.Henzinger D.Nanongkai V.Loitzenbauer T.Saranurak
Talks about:time (3) sublinear (2) decrement (2) algorithm (2) reachabl (2) direct (2) sourc (2) singl (2) graph (2) dynam (2)
Person: Sebastian Krinninger
DBLP: Krinninger:Sebastian
Contributed to:
2015
201520142013Wrote 5 papers:
- ICALP-v1-2015-HenzingerKL #component #polynomial
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (MH, SK, VL), pp. 713–724.
- ICALP-v1-2015-HenzingerKN #algorithm #graph #reachability
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
- STOC-2015-HenzingerKNS #multi #online #problem
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (MH, SK, DN, TS), pp. 21–30.
- STOC-2014-HenzingerKN #algorithm #graph #reachability
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.
- ICALP-v2-2013-HenzingerKN #maintenance #network
- Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks (MH, SK, DN), pp. 607–619.