Satisfiability with Exponential Families. - Dominik Scheder; Philipp Zumstein (SAT, 2007)

Unsatisfiable Linear k-CNFs Exist, for every k - Dominik Scheder (CoRR, 2007)

Partial Satisfaction of k-Satisfiable Formulas. - Claudia Käppeli; Dominik Scheder (Electron. Notes Discret. Math., 2007)

Guided Search and a Faster Deterministic Algorithm for 3-SAT. - Dominik Scheder (LATIN, 2008)

How Many Conflicts Does It Need to Be Unsatisfiable? - Dominik Scheder; Philipp Zumstein (SAT, 2008)

An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas - Dominik Scheder; Philipp Zumstein (CoRR, 2008)

Satisfiability of Almost Disjoint CNF Formulas - Dominik Scheder (CoRR, 2008)

The Lovász Local Lemma and Satisfiability. - Heidi Gebauer; Robin A. Moser; Dominik Scheder; Emo Welzl (Efficient Algorithms, 2009)

Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely - Dominik Scheder (CoRR, 2009)

Unsatisfiable Linear CNF Formulas Are Large and Complex. - Dominik Scheder (STACS, 2010)

Using a Skewed Hamming Distance to Speed Up Deterministic Local Search - Dominik Scheder (CoRR, 2010)

Using CSP To Improve Deterministic 3-SAT - Konstantin Kutzkov; Dominik Scheder (CoRR, 2010)

A Full Derandomization of Schoening's k-SAT Algorithm - Robin A. Moser; Dominik Scheder (CoRR, 2010)

Improving PPSZ for 3-SAT using Crtitical Variables - Timon Hertli; Robin A. Moser; Dominik Scheder (CoRR, 2010)

PPZ For More Than Two Truth Values - An Algorithm for Constraint Satisfaction Problems - Dominik Scheder (CoRR, 2010)

Improving PPSZ for 3-SAT using Critical Variables. - Timon Hertli; Robin A. Moser; Dominik Scheder (STACS, 2011)

A full derandomization of schöning's k-SAT algorithm. - Robin A. Moser; Dominik Scheder (STOC, 2011)

Algorithms and Extremal Properties of SAT and CSP. - Dominik Scheder (2011)

On the Average Sensitivity and Density of k-CNF Formulas. - Dominik Scheder; Li-Yang Tan (APPROX-RANDOM, 2013)

Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. - Dominik Scheder (ISAAC, 2013)

Unsatisfiable CNF Formulas contain Many Conflicts. - Dominik Scheder (ISAAC, 2013)

Exponential Lower Bounds for the PPSZ k-SAT Algorithm. - Dominik Scheder; Bangsheng Tang; Shiteng Chen; Navid Talebanfard (SODA, 2013)

Inside the Simons Institute. - Dominik Scheder (Bull. EATCS, 2013)

Overlays and Limited Memory Communication Mode(l)s. - Periklis A. Papakonstantinou; Dominik Scheder; Hao Song (Electron. Colloquium Comput. Complex., 2013)

A new bound for 3-satisfiable MaxSat and its algorithmic application. - Gregory Z. Gutin; Mark Jones 001; Dominik Scheder; Anders Yeo (Inf. Comput., 2013)

Overlays and Limited Memory Communication. - Periklis A. Papakonstantinou; Dominik Scheder; Hao Song (CCC, 2014)

Cryptogenography. - Joshua Brody; Sune K. Jakobsen; Dominik Scheder; Peter Winkler 001 (ITCS, 2014)

The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. - Timon Hertli; Isabelle Hurbain; Sebastian Millius; Robin A. Moser; Dominik Scheder; May Szedlák (CP, 2016)

Derandomization of ( boldsymbol{k} ) -SAT Algorithm. - Dominik Scheder (Encyclopedia of Algorithms, 2016)

Exponential Lower Bounds for k-SAT Algorithms. - Dominik Scheder (Encyclopedia of Algorithms, 2016)

PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. - Dominik Scheder; John P. Steinberger (CCC, 2017)

Tighter Hard Instances for PPSZ. - Pavel Pudlák; Dominik Scheder; Navid Talebanfard (ICALP, 2017)

Recent studies of agent incentives in internet resource allocation and pricing. - Yukun Cheng; Xiaotie Deng; Dominik Scheder (4OR, 2018)

PPSZ for k ≥ 5: More Is Better. - Dominik Scheder (Electron. Colloquium Comput. Complex., 2018)

PPSZ on CSP Instances with Multiple Solutions. - Dominik Scheder (Electron. Colloquium Comput. Complex., 2018)

Searching for Cryptogenography Upper Bounds via Sum of Square Programming. - Dominik Scheder; Shuyang Tang; Jiaheng Zhang (ISAAC, 2019)

PPSZ for k ≥ 5: More Is Better. - Dominik Scheder (ACM Trans. Comput. Theory, 2019)

Super Strong ETH Is True for PPSZ with Small Resolution Width. - Dominik Scheder; Navid Talebanfard (CCC, 2020)

Super Strong ETH is true for strong PPSZ. - Dominik Scheder; Navid Talebanfard (Electron. Colloquium Comput. Complex., 2020)

Impatient PPSZ - A Faster Algorithm for CSP. - Shibo Li; Dominik Scheder (ISAAC, 2021)

PPSZ is better than you think. - Dominik Scheder (Electron. Colloquium Comput. Complex., 2021)

PPSZ for General k-SAT and CSP - Making Hertli's Analysis Simpler and 3-SAT Faster. - Dominik Scheder; John P. Steinberger (Comput. Complex., 2024)

PLS-completeness of string permutations. - Dominik Scheder; Johannes Tantow (CoRR, 2025)