People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
1
Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers
Nikolaus Frohner
,
Günther Raidl
PDF
Cite
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
Matthias Schlaipfer and Friedrich Slivovsky and Georg Weissenbacher and Florian Zuleger
Cite
Project
On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic
,
Christoph Berger
,
Günther Raidl
,
Christian Blum
PDF
Cite
DOI
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Robert Ganian
,
Iyad Kanj
,
Stefan Szeider
PDF
Cite
Project
Project
Project
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences
Horn, Matthias
,
Djukanovic, Marko
,
Blum, Christian
,
Günther Raidl
Cite
DOI
Short Q-Resolution Proofs with Homomorphisms
Ankit Shukla
,
Friedrich Slivovsky
,
Stefan Szeider
PDF
Cite
Project
Project
Project
Solving the Steiner Tree Problem with few Terminals
Johannes Klaus Fichte and Markus Hecher and André Schidler
Cite
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen
PDF
Cite
Project
String Factorizations Under Various Collision Constraints
Niels Grüttemeier and Christian Komusiewicz and Nils Morawietz and Frank Sommer
PDF
Cite
DOI
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths
Tomas Peitl
PDF
Cite
«
»
Cite
×