Author of the publication

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)

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

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG., , , , , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 19 (6): 3673-3684 (2022)Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time., , , , and . SODA, page 359-376. SIAM, (2022)Fast Indexes for Gapped Pattern Matching., , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 493-504. Springer, (2020)Sorting Finite Automata via Partition Refinement., , , , , , and . ESA, volume 274 of LIPIcs, page 15:1-15:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Practical Minimum Path Cover., , , and . SEA, volume 301 of LIPIcs, page 3:1-3:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Parameterized and Safe & Complete Graph Algorithms for Bioinformatics.. University of Helsinki, Finland, (2023)base-search.net (ftunivhelsihelda:oai:helda.helsinki.fi:10138/564956).Chaining of Maximal Exact Matches in Graphs., , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 353-366. Springer, (2023)Faster Repetition-Aware Compressed Suffix Trees Based on Block Trees., and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 434-451. Springer, (2019)Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond.. CPM, volume 259 of LIPIcs, page 7:1-7:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Block trees., , , , , , , , and . J. Comput. Syst. Sci., (2021)