1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs
Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz
Counting and uniform sampling of directed acyclic graphs (DAGs) from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper, we show that thes…
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…
Complete Edge-Colored Permutation Graphs
Tom Hartmann, Max Bannach, Martin Middendorf +3
We introduce the concept of complete edge-colored permutation graphs as complete graphs that are the edge-disjoint union of "classical" permutation graphs. We show that a graph $G=…