Author of the publication

Jdrasil: A Modular Library for Computing Tree Decompositions.

, , and . SEA, volume 75 of LIPIcs, page 28:1-28:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

 

Other publications of authors with the same name

Fast Parallel Fixed-parameter Algorithms via Color Coding., , and . IPEC, volume 43 of LIPIcs, page 224-235. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A new constructive criterion for Markov equivalence of MAGs., , and . UAI, volume 180 of Proceedings of Machine Learning Research, page 2107-2116. PMLR, (2022)Practical Access to Dynamic Programming on Tree Decompositions., and . ESA, volume 112 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time., , and . SWAT, volume 162 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth., and . IPEC, volume 285 of LIPIcs, page 35:1-35:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs., , and . CoRR, (2020)Parallel Multivariate Meta-Theorems., and . IPEC, volume 63 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Faster Graph Algorithms Through DAG Compression., , and . STACS, volume 289 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)PACE Solver Description: Fluid., , , and . IPEC, volume 180 of LIPIcs, page 27:1-27:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Computing Hitting Set Kernels By AC0-Circuits., and . Theory Comput. Syst., 64 (3): 374-399 (2020)