Author of the publication

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.

Dr. -Ing. Daniel Markthaler University of Stuttgart

Replication Data for: Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis, and . Dataset, (2024)Related to: Schneider, Andreas; Lystbæk, Thomas B.; Markthaler, Daniel; Hansen, Niels; Hauer, Bernhard (2024): Biocatalytic stereocontrolled head-to-tail cyclizations of unbiased terpenes as a tool in chemoenzymatic synthesis. In: Nature Communications, 15, 4925. doi: 10.1038/s41467-024-48993-9.

Daniel Klötzl University of Stuttgart

NMF-Based Analysis of Mobile Eye-Tracking Data, , , , , , and . Proceedings of the 2024 Symposium on Eye Tracking Research and Applications, page 1–9. New York, NY, USA, Association for Computing Machinery, (Jun 4, 2024)
NMF-Based Analysis of Mobile Eye-Tracking Data, , , , , , and . Proceedings of the 2024 Symposium on Eye Tracking Research and Applications, page 1–9. New York, NY, USA, Association for Computing Machinery, (Jun 4, 2024)Constrained Dynamic Mode Decomposition, , , and . IEEE Transactions on Visualization and Computer Graphics, (2022)
 

Other publications of authors with the same name

Kernelization, Bidimensionality and Kernels.. Encyclopedia of Algorithms, (2016)On the directed Full Degree Spanning Tree problem., , , and . Discrete Optimization, 8 (1): 97-109 (2011)Intractability of Clique-Width Parameterizations., , , and . SIAM J. Comput., 39 (5): 1941-1956 (2010)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)Optimal broadcast domination in polynomial time., and . Discrete Mathematics, 306 (24): 3267-3280 (2006)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers., , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 11 (4): 648-656 (2014)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discrete Math., 31 (2): 1294-1327 (2017)Covering Vectors by Spaces: Regular Matroids., , , and . SIAM J. Discrete Math., 32 (4): 2512-2565 (2018)