( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On unrooted and root-uncertain variants of several well-known phylogenetic network problems.

, , , , и . CoRR, (2016)

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.

Lothar Kelker

Klaus Kelkel

Franz Kelkel

Leena Kelkar-Stephan

Matthias Kelker

 

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

Kernelizations for the hybridization number problem on multiple nonbinary trees., и . CoRR, (2013)Integrality gaps for colorful matchings., и . Discret. Optim., (2019)Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set., , , , , и . SIAM J. Discret. Math., 26 (4): 1635-1656 (2012)Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees., и . WG, том 8747 из Lecture Notes in Computer Science, стр. 299-311. Springer, (2014)Constructing the Simplest Possible Phylogenetic Network from Triplets., и . Algorithmica, 60 (2): 207-235 (2011)Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees., , , и . Theor. Comput. Sci., (2016)Kernelizations for the hybridization number problem on multiple nonbinary trees., , и . J. Comput. Syst. Sci., 82 (6): 1075-1089 (2016)A note on convex characters, Fibonacci numbers and exponential-time algorithms., и . Adv. Appl. Math., (2017)Convex Characters, Algorithms, and Matchings., , и . SIAM J. Discret. Math., 38 (1): 380-411 (марта 2024)Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs., , , , и . CoRR, (2024)