| 2024 | ICDT | Right-Adjoints for Datalog Programs. | Balder ten Cate, Vctor Dalmau, Jakub Oprsal |
| 2024 | LICS | Local consistency as a reduction between constraint satisfaction problems. | Vctor Dalmau, Jakub Oprsal |
| 2022 | SODA | Promise Constraint Satisfaction and Width. | Albert Atserias, Vctor Dalmau |
| 2021 | MFCS | Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. | Silvia Butti, Vctor Dalmau |
| 2019 | ICALP | Dismantlability, Connectedness, and Mixing in Relational Structures. | Raimundo Briceo, Andrei A. Bulatov, Vctor Dalmau, Benot Larose |
| 2017 | CP | Conjunctions of Among Constraints. | Vctor Dalmau |
| 2017 | SODA | Robust algorithms with polynomial loss for near-unanimity CSPs. | Vctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal |
| 2015 | ICDT | The Product Homomorphism Problem and Applications. | Balder ten Cate, Vctor Dalmau |
| 2015 | LICS | Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. | Vctor Dalmau, Lszl Egri, Pavol Hell, Benot Larose, Arash Rafiey |
| 2015 | SODA | Towards a Characterization of Constant-Factor Approximable Min CSPs. | Vctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran |
| 2013 | CSL | Descriptive complexity of approximate counting CSPs. | Andrei A. Bulatov, Vctor Dalmau, Marc Thurley |
| 2012 | ICDT | Learning schema mappings. | Balder ten Cate, Vctor Dalmau, Phokion G. Kolaitis |
| 2012 | LICS | Decomposing Quantified Conjunctive (or Disjunctive) Formulas. | Hubie Chen, Vctor Dalmau |
| 2010 | MFCS | Distance Constraint Satisfaction Problems. | Manuel Bodirsky, Vctor Dalmau, Barnaby Martin, Michael Pinsker |
| 2009 | STACS | Enumerating Homomorphisms. | Andrei A. Bulatov, Vctor Dalmau, Martin Grohe, Dniel Marx |
| 2008 | LICS | Caterpillar Duality for Constraint Satisfaction Problems. | Catarina Carvalho, Vctor Dalmau, Andrei A. Krokhin |
| 2008 | LICS | Maltsev + Datalog --> Symmetric Datalog. | Vctor Dalmau, Benot Larose |
| 2007 | ICALP | On the Power of | Albert Atserias, Andrei A. Bulatov, Vctor Dalmau |
| 2006 | STACS | Datalog and Constraint Satisfaction with Infinite Templates. | Manuel Bodirsky, Vctor Dalmau |
| 2005 | CP | Beyond Hypertree Width: Decomposition Methods Without Decompositions. | Hubie Chen, Vctor Dalmau |
| 2005 | CP | Tractable Clones of Polynomials over Semigroups. | Vctor Dalmau, Ricard Gavald, Pascal Tesson, Denis Thrien |
| 2005 | CSL | From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. | Hubie Chen, Vctor Dalmau |
| 2005 | LICS | Generalized Majority-Minority Operations are Tractable. | Vctor Dalmau |
| 2004 | ALT | Learnability of Relatively Quantified Generalized Formulas. | Andrei A. Bulatov, Hubie Chen, Vctor Dalmau |
| 2004 | CP | (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. | Hubie Chen, Vctor Dalmau |
| 2004 | LICS | First-Order Definable Retraction Problems for Posets and Reflexive Graph. | Vctor Dalmau, Andrei A. Krokhin, Benot Larose |
| 2004 | SAT | Looking Algebraically at Tractable Quantified Boolean Formulas. | Hubie Chen, Vctor Dalmau |
| 2004 | SAT | Looking Algebraically at Tractable Quantified Boolean Formulas. | Hubie Chen, Vctor Dalmau |
| 2003 | FOCS | Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. | Andrei A. Bulatov, Vctor Dalmau |
| 2003 | MFCS | Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. | Vctor Dalmau, Daniel K. Ford |
| 2002 | AAAI | Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. | Delbert D. Bailey, Vctor Dalmau, Phokion G. Kolaitis |
| 2002 | CP | Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. | Vctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi |
| 2002 | ICALP | Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. | Vctor Dalmau |
| 2001 | IJCAI | Phase Transitions of PP-Complete Satisfiability Problems. | Delbert D. Bailey, Vctor Dalmau, Phokion G. Kolaitis |
| 1999 | ALT | Boolean Formulas are Hard to Learn for most Gate Bases. | Vctor Dalmau |
| 1999 | CP | Closure Functions and Width 1 Problems. | Vctor Dalmau, Justin Pearson |
| 1997 | COLT | A Dichotomy Theorem for Learning Quantified Boolean Formulas. | Vctor Dalmau |