( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time.

, , и . FOCS, стр. 146-155. IEEE Computer Society, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Christoph Krinninger

Eduard Krinninger

Dominik Krinninger

Maximilian Krinninger

Maximilian Krinninger

 

Другие публикации лиц с тем же именем

Decremental Data Structures for Connectivity and Dominators in Directed Graphs., , , , и . ICALP, том 80 из LIPIcs, стр. 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fully dynamic all-pairs shortest paths with worst-case update-time revisited., , и . SODA, стр. 440-452. SIAM, (2017)On Fully Dynamic Graph Sparsifiers., , , , и . FOCS, стр. 335-344. IEEE Computer Society, (2016)Finding 2-edge and 2-vertex strongly connected components in quadratic time., , и . CoRR, (2014)Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs., , и . CoRR, (2016)An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths., , и . CoRR, (2015)Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege.. Ausgezeichnete Informatikdissertationen, том D-16 из LNI, GI, (2015)A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths., , и . SODA, стр. 1053-1072. SIAM, (2014)Fully dynamic all-pairs shortest paths with worst-case update-time revisited., , и . CoRR, (2016)Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time., , и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 713-724. Springer, (2015)