PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Tantau, Till"

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of SNP block partitioning under the perfect phylogeny model.

, , , , and . Discrete Mathematics, 309 (18): 5610-5617 (2009)

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.

Till Kugler University of Stuttgart

Till Böhm University of Stuttgart

Till Hielscher University of Stuttgart

Pascal Tilli University of Stuttgart

 

Other publications of authors with the same name

Logspace Optimization Problems and Their Approximability Properties.. Theory Comput. Syst., 41 (2): 327-350 (2007)Weak cardinality theorems.. J. Symb. Log., 70 (3): 861-878 (2005)Query complexity of membership comparable sets.. Theor. Comput. Sci., 302 (1-3): 467-474 (2003)Where First-Order and Monadic Second-Order Logic Coincide., , and . ACM Trans. Comput. Log., 17 (4): 25 (2016)Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121)., , and . Dagstuhl Reports, 9 (3): 64-82 (2019)Graph Drawing in TikZ.. J. Graph Algorithms Appl., 17 (4): 495-513 (2013)Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification.. CoRR, (2014)Optimal Flow Distribution Among Multiple Channels with Unknown Capacities ., , and . Essays in Memory of Shimon Even, volume 3895 of Lecture Notes in Computer Science, page 111-128. Springer, (2006)Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems., and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 299-310. Springer, (2008)On structural similarities of finite automata and Turing machine enumerability classes.. Wissenschaft & Technik Verlag, (2003)