Sebastian KRINNINGER

Sebastian Krinninger was born in Germany and started his studies in computer science at the University of Passau. He moved to Vienna in 2008 to continue his studies at the Vienna University of Technology.

Date: 01.06.2015
Title: Faster Approximation Algorithms for Partially Dynamic Shortest Paths Problems

CONGRATULATIONS!!

Post-Doc Asisstant at the Max-Planck-Institut für Informatik in Saarbrücken, Germany.

Since 2011: PhD student at IK computational optimization

2008-2011: MSc Computational Intelligence, Vienna University of Technology

2005-2008: BSc Computer Science, University of Passau, Germany

efficient graph algorithms, infinite games on graphs, combinatorial optimization

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks”. In: International Colloquium on Automata, Languages and Programming (ICALP). 2013, pp. 607–619.

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization”. In: SIAM Journal on Computing (forthcoming). Announced at FOCS’13.

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs”. In: Symposium on Theory of Computing (STOC). 2014, pp. 674–683.

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Dynamic Single-Source Shortest Paths”. In: Symposium on Discrete Algorithms (SODA). 2014, pp. 1053–1072.

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time”. In: Symposium on Foundations of Computer Science (FOCS). 2014, pp. 146–155.

• Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs”. In: International Colloquium on Automata, Languages and Programming (ICALP). 2015, pp. 713–724.