( en | de | ru )

 

Disambiguation of "Weller, Mathias"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Algorithms in Bioinformatics: An Overview.

, and . Algorithms, 12 (12): 256 (2019)

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

Karsten Weller

Wilhelm Weller

 

Other publications of authors with the same name

On a greedy approach for genome scaffolding., , , , and . Algorithms Mol. Biol., 17 (1): 16 (2022)Fast Exact Dynamic Time Warping on Run-Length Encoded Time Series., , , and . CoRR, (2019)Quantifying Hierarchical Conflicts in Homology Statements., , , , and . RECOMB-CG, volume 13234 of Lecture Notes in Computer Science, page 146-167. Springer, (2022)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)Finding Degree-Constrained Acyclic Orientations., , , and . IPEC, volume 285 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Treewidth-based algorithms for the small parsimony problem on networks., and . Algorithms Mol. Biol., 17 (1): 15 (2022)Exact approaches for scaffolding., , and . BMC Bioinform., 16 (S14): S2 (December 2015)Scanning Phylogenetic Networks Is NP-hard., , and . SOFSEM, volume 12011 of Lecture Notes in Computer Science, page 519-530. Springer, (2020)Complexity and lowers bounds for Power Edge Set Problem., , , , and . J. Discrete Algorithms, (2018)Tree Containment With Soft Polytomies., and . J. Graph Algorithms Appl., 25 (1): 417-436 (2021)