From post

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.

 

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

A Timecop's Work Is Harder Than You Think., , и . MFCS, том 170 из LIPIcs, стр. 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series., , , и . CoRR, (2019)Quantifying Hierarchical Conflicts in Homology Statements., , , , и . RECOMB-CG, том 13234 из Lecture Notes in Computer Science, стр. 146-167. Springer, (2022)Finding Degree-Constrained Acyclic Orientations., , , и . IPEC, том 285 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Scanning Phylogenetic Networks Is NP-hard., , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 519-530. Springer, (2020)Tree Containment With Soft Polytomies., и . J. Graph Algorithms Appl., 25 (1): 417-436 (2021)New Polynomial-Time Algorithm Around the Scaffolding Problem., , , и . AlCoB, том 11488 из Lecture Notes in Computer Science, стр. 25-38. Springer, (2019)Treewidth-Based Algorithms for the Small Parsimony Problem on Networks., и . WABI, том 201 из LIPIcs, стр. 6:1-6:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)New Results About the Linearization of Scaffolds Sharing Repeated Contigs., , , , и . COCOA, том 11346 из Lecture Notes in Computer Science, стр. 94-107. Springer, (2018)Interval Scheduling and Colorful Independent Sets., , , и . ISAAC, том 7676 из Lecture Notes in Computer Science, стр. 247-256. Springer, (2012)