( en | de | ru )

 

Disambiguation of "Weller, Mathias"

Author of the publication

copydeleteadd this publication to your clipboard
A Timecop's Work Is Harder Than You Think.

, , and . MFCS, volume 170 of LIPIcs, page 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Mathias Weller

Mathias Weller

Gert Weller

Sebastian Weller

Wilhelm Weller

 

Other publications of authors with the same name

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