Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A simplified algorithm computing all s-t bridges and articulation points., , , , , and . Discret. Appl. Math., (2021)Safety in s-t Paths, Trails and Walks., , , , and . CoRR, (2020)Vehicle Capacity-Aware Rerouting of Passengers in Delay Management., , and . ATMOS, volume 75 of OASIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Eulertigs: Minimum Plain Text Representation of k-mer Sets Without Repetitions in Linear Time., and . WABI, volume 242 of LIPIcs, page 2:1-2:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Cut Paths and Their Remainder Structure, with Applications., , , , , and . STACS, volume 254 of LIPIcs, page 17:1-17:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Computing all s-t bridges and articulation points simplified., , , , , and . CoRR, (2020)Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms., , , , , and . CoRR, (2020)Cut paths and their remainder structure, with applications., , , , , and . CoRR, (2022)Direct Insight into Grain Boundary Reconstruction in Polycrystalline $Cu(In,Ga)Se_2$ with Atomic Resolution, , , , , and . Phys. Rev. Lett., 108 (7): 075502 (February 2012)Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time., and . Algorithms Mol. Biol., 18 (1): 5 (December 2023)