3 papers
cs.DS2021
A SAT Approach to Twin-Width
André Schidler, Stefan Szeider
The graph invariant twin-width was recently introduced by Bonnet, Kim, Thomassé, and Watrigan. Problems expressible in first-order logic, which includes many prominent NP-hard prob…
cs.AI2020
Solving the Steiner Tree Problem with few Terminals
Johannes K. Fichte, Markus Hecher, Andre Schidler
The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tr…
cs.LO2020
Towards Faster Reasoners By Using Transparent Huge Pages
Johannes K. Fichte, Norbert Manthey, Julian Stecklina +1
Various state-of-the-art automated reasoning (AR) tools are widely used as backend tools in research of knowledge representation and reasoning as well as in industrial applications…