Author of the publication

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms.

, , , , , and . CoRR, (2020)

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 Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results., , , and . TIME, volume 90 of LIPIcs, page 10:1-10:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication., , and . AAAI, page 1484-1490. AAAI Press, (2016)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)Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete., and . TIME, page 90-99. IEEE Computer Society, (2016)Dynamic Controllability Made Simple., and . TIME, volume 90 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty., , and . TIME, volume 120 of LIPIcs, page 8:1-8:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Optimal Omnitig Listing for Safe and Complete Contig Assembly., , , , and . CPM, volume 78 of LIPIcs, page 29:1-29:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms., , , , , and . CoRR, (2020)Width Helps and Hinders Splitting Flows., , , , , , , and . ESA, volume 244 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Linear-Time Parameterized Algorithm for Computing the Width of a DAG., , , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 257-269. Springer, (2021)