Max Bannach

Florian Andreas Marwitz

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

On the Parallel Parameterized Complexity of MaxSAT Variants.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Structure-Guided Automated Reasoning.

[BibT_eX]

[DOI]

Markus Hecher

CoRR, 2023

Existential Second-Order Logic over Graphs: Parameterized Complexity.

[BibT_eX]

[DOI]

Florian Chudigiewitsch

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Efficient Enumeration of Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Recent Advances in Positive-Instance Driven Graph Searching.

[BibT_eX]

[DOI]

Algorithms, 2022

Dynamic Kernels for Hitting Sets and Set Packing.

[BibT_eX]

[DOI]

Algorithmica, 2022

Complete edge-colored permutation graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2022

A new constructive criterion for Markov equivalence of MAGs.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

MaxSAT with Absolute Value Functions: A Parameterized Perspective.

[BibT_eX]

[DOI]

Pamela Fleischmann

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

Sorting Signed Permutations by Inverse Tandem Duplication Random Losses.

[BibT_eX]

[DOI]

Tom Hartmann

Martin Middendorf

IEEE ACM Trans. Comput. Biol. Bioinform., 2021

On the Descriptive Complexity of Color Coding.

[BibT_eX]

[DOI]

Algorithms, 2021

Extendability of causal graphical models: Algorithms and computational complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Recent Advances in Counting and Sampling Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the KI 2021: Advances in Artificial Intelligence - 44th German Conference on AI, Virtual Event, September 27, 2021

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Computing Hitting Set Kernels By AC<sup>0</sup>-Circuits.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Solving Packing Problems with Few Small Items Using Rainbow Matchings.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

PACE Solver Description: PID^⋆.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

PACE Solver Description: Fluid.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

Parallele Parametrisierte Algorithmen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2019., 2019

Practical Access to Dynamic Programming on Tree Decompositions.

[BibT_eX]

[DOI]

Algorithms, 2019

Towards Work-Efficient Parallel Parameterized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Positive-Instance Driven Dynamic Programming for Graph Searching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018

Computing Hitting Set Kernels By AC^0-Circuits.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Computing Kernels in Parallel: Lower and Upper Bounds.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2017

Jdrasil: A Modular Library for Computing Tree Decompositions.

[BibT_eX]

[DOI]

Thorsten Ehlers

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016

Parallel Multivariate Meta-Theorems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Fast Parallel Fixed-parameter Algorithms via Color Coding.

[BibT_eX]

[DOI]

Christoph Stockhusen