0

A Construct Merge Solve and Adapt Heuristic for Least Cost Influence Maximization
pages 1-15, 2026.
Note: preprint accepted for MIC 2026
PDF Cite
Efficient reversal of transductions of sparse graph classes
PDF Cite
Superstrings of Uniform-Cardinality Set Systems via the Generalized Traveling Salesperson Problem
pages 1-15, 2026.
Note: preprint
PDF Cite
SAT-Based Search for Minwise Independent Families

Note: preprint

PDF Cite DOI
Algorithms for Satisfiability Testing
9 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.
Cite
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
PDF Cite
Computing Treewidth with Constraint Programming
pages 115-126, 9 2022, SKILL 2022, Gesellschaft für Informatik, Bonn.
PDF Cite
A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
09 2020, Presentation, CPAIOR2020.
PDF Cite
Portfolio Solvers for QDIMACS and QCIR

Note: QBF Evaluation at SAT

Cite
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)
volume 7 of Dagstuhl Reports, 2017.
PDF Cite DOI