research
∙
01/28/2023
Efficient Enumeration of Markov Equivalent DAGs
Enumerating the directed acyclic graphs (DAGs) of a Markov equivalence c...
share
research
∙
06/02/2022
On the Parallel Parameterized Complexity of MaxSAT Variants
In the maximum satisfiability problem (MAX-SAT) we are given a propositi...
research
∙
05/05/2022
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications
Counting and sampling directed acyclic graphs from a Markov equivalence ...
research
∙
04/26/2022
MaxSAT with Absolute Value Functions: A Parameterized Perspective
The natural generalization of the Boolean satisfiability problem to opti...
research
∙
12/17/2020
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs
Counting and uniform sampling of directed acyclic graphs (DAGs) from a M...
research
∙
07/06/2020
Solving Packing Problems with Few Small Items Using Rainbow Matchings
An important area of combinatorial optimization is the study of packing ...
research
∙
04/15/2020
Complete Edge-Colored Permutation Graphs
We introduce the concept of complete edge-colored permutation graphs as ...
research
∙
05/03/2019
Positive-Instance Driven Dynamic Programming for Graph Searching
Research on the similarity of a graph to being a tree - called the treew...
research
∙
02/20/2019
Towards Work-Efficient Parallel Parameterized Algorithms
Parallel parameterized complexity theory studies how fixed-parameter tra...
research
∙
01/10/2019
On the Descriptive Complexity of Color Coding
Color coding is an algorithmic technique used in parameterized complexit...
research
∙
07/10/2018
Computing Kernels in Parallel: Lower and Upper Bounds
Parallel fixed-parameter tractability studies how parameterized problems...
research
∙
06/26/2018
Practical Access to Dynamic Programming on Tree Decompositions
Parameterized complexity theory has lead to a wide range of algorithmic ...
research
∙
01/02/2018