
PolynomialTime Algorithms for Counting and Sampling Markov Equivalent DAGs
Counting and uniform sampling of directed acyclic graphs (DAGs) from a M...
read it

Solving Packing Problems with Few Small Items Using Rainbow Matchings
An important area of combinatorial optimization is the study of packing ...
read it

Complete EdgeColored Permutation Graphs
We introduce the concept of complete edgecolored permutation graphs as ...
read it

PositiveInstance Driven Dynamic Programming for Graph Searching
Research on the similarity of a graph to being a tree  called the treew...
read it

Towards WorkEfficient Parallel Parameterized Algorithms
Parallel parameterized complexity theory studies how fixedparameter tra...
read it

On the Descriptive Complexity of Color Coding
Color coding is an algorithmic technique used in parameterized complexit...
read it

Computing Kernels in Parallel: Lower and Upper Bounds
Parallel fixedparameter tractability studies how parameterized problems...
read it

Practical Access to Dynamic Programming on Tree Decompositions
Parameterized complexity theory has lead to a wide range of algorithmic ...
read it

Computing Hitting Set Kernels By AC^0Circuits
Given a hypergraph H = (V,E), what is the smallest subset X ⊆ V such tha...
read it
Max Bannach
is this you? claim profile