A Dichotomy Theorem for Learning Quantified Boolean Formulas. - Víctor Dalmau (COLT, 1997)

Boolean Formulas are Hard to Learn for most Gate Bases. - Víctor Dalmau (ALT, 1999)

Closure Functions and Width 1 Problems. - Víctor Dalmau; Justin Pearson (CP, 1999)

Learnability of Quantified Formulas. - Víctor Dalmau; Peter Jeavons 001 (EuroCOLT, 1999)

A New Tractable Class of Constraint Satisfaction Problems. - Víctor Dalmau (AI&M, 2000)

Phase Transitions of PP-Complete Satisfiability Problems. - Delbert D. Bailey; Víctor Dalmau; Phokion G. Kolaitis (IJCAI, 2001)

Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. - Delbert D. Bailey; Víctor Dalmau; Phokion G. Kolaitis (AAAI/IAAI, 2002)

Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. - Víctor Dalmau; Phokion G. Kolaitis; Moshe Y. Vardi (CP, 2002)

Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. - Víctor Dalmau (ICALP, 2002)

A Combinatorial Characterization of Resolution Width. - Albert Atserias; Víctor Dalmau (CCC, 2003)

Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. - Andrei A. Bulatov; Víctor Dalmau (FOCS, 2003)

Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. - Víctor Dalmau; Daniel K. Ford (MFCS, 2003)

Learnability of Relatively Quantified Generalized Formulas. - Andrei A. Bulatov; Hubie Chen; Víctor Dalmau (ALT, 2004)

(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. - Hubie Chen; Víctor Dalmau (CP, 2004)

First-Order Definable Retraction Problems for Posets and Reflexive Graph. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (LICS, 2004)

Looking Algebraically at Tractable Quantified Boolean Formulas. - Hubie Chen; Víctor Dalmau (SAT, 2004)

Malt'sev Constraints made Simple - Víctor Dalmau (Electron. Colloquium Comput. Complex., 2004)

The complexity of counting homomorphisms seen from the other side. - Víctor Dalmau; Peter Jonsson (Theor. Comput. Sci., 2004)

Beyond Hypertree Width: Decomposition Methods Without Decompositions. - Hubie Chen; Víctor Dalmau (CP, 2005)

Tractable Clones of Polynomials over Semigroups. - Víctor Dalmau; Ricard Gavaldà; Pascal Tesson; Denis Thérien (CP, 2005)

From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. - Hubie Chen; Víctor Dalmau (CSL, 2005)

Generalized Majority-Minority Operations are Tractable. - Víctor Dalmau (LICS, 2005)

Linear datalog and bounded path duality of relational structures. - Víctor Dalmau (Log. Methods Comput. Sci., 2005)

Datalog and Constraint Satisfaction with Infinite Templates. - Manuel Bodirsky; Víctor Dalmau (STACS, 2006)

A Simple Algorithm for Mal'tsev Constraints. - Andrei A. Bulatov; Víctor Dalmau (SIAM J. Comput., 2006)

On the Power of k -Consistency. - Albert Atserias; Andrei A. Bulatov; Víctor Dalmau (ICALP, 2007)

CD(4) has bounded width - Catarina Carvalho; Víctor Dalmau; Petar Markovic; Miklós Maróti (CoRR, 2007)

First-order Definable Retraction Problems for Posets and Reflexive Graphs. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (J. Log. Comput., 2007)

Learning intersection-closed classes with signatures. - Andrei A. Bulatov; Hubie Chen; Víctor Dalmau (Theor. Comput. Sci., 2007)

Caterpillar Duality for Constraint Satisfaction Problems. - Catarina Carvalho; Víctor Dalmau; Andrei A. Krokhin (LICS, 2008)

Maltsev + Datalog –> Symmetric Datalog. - Víctor Dalmau; Benoît Larose (LICS, 2008)

Retractions onto series-parallel posets. - Víctor Dalmau; Andrei A. Krokhin; Benoît Larose (Discret. Math., 2008)

Majority constraints have bounded pathwidth duality. - Víctor Dalmau; Andrei A. Krokhin (Eur. J. Comb., 2008)

Enumerating Homomorphisms. - Andrei A. Bulatov; Víctor Dalmau; Martin Grohe; Dániel Marx (STACS, 2009)

There are no pure relational width 2 constraint satisfaction problems. - Víctor Dalmau (Inf. Process. Lett., 2009)

Distance Constraint Satisfaction Problems. - Manuel Bodirsky; Víctor Dalmau; Barnaby Martin; Michael Pinsker (MFCS, 2010)

CSP duality and trees of bounded pathwidth. - Catarina Carvalho; Víctor Dalmau; Andrei A. Krokhin (Theor. Comput. Sci., 2010)

Two new homomorphism dualities and lattice operations. - Catarina Carvalho; Víctor Dalmau; Andrei A. Krokhin (J. Log. Comput., 2011)

Learning schema mappings. - Balder ten Cate; Víctor Dalmau; Phokion G. Kolaitis (ICDT, 2012)

Decomposing Quantified Conjunctive (or Disjunctive) Formulas. - Hubie Chen; Víctor Dalmau (LICS, 2012)

A note on the product homomorphism problem and CQ-definability - Balder ten Cate; Víctor Dalmau (CoRR, 2012)

Descriptive complexity of approximate counting CSPs. - Andrei A. Bulatov; Víctor Dalmau; Marc Thurley (CSL, 2013)

Arc consistency and friends. - Hubie Chen; Víctor Dalmau; Berit Grußien (J. Log. Comput., 2013)

Robust Satisfiability for CSPs: Hardness and Algorithmic Results. - Víctor Dalmau; Andrei A. Krokhin (ACM Trans. Comput. Theory, 2013)

The Product Homomorphism Problem and Applications. - Balder ten Cate; Víctor Dalmau (ICDT, 2015)

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. - Víctor Dalmau; László Egri; Pavol Hell; Benoît Larose; Arash Rafiey (LICS, 2015)

Towards a Characterization of Constant-Factor Approximable Min CSPs. - Víctor Dalmau; Andrei A. Krokhin; Rajsekar Manokaran (SODA, 2015)

Distance constraint satisfaction problems. - Manuel Bodirsky; Víctor Dalmau; Barnaby Martin; Antoine Mottet; Michael Pinsker (Inf. Comput., 2016)

Conjunctions of Among Constraints. - Víctor Dalmau (CP, 2017)

Robust algorithms with polynomial loss for near-unanimity CSPs. - Víctor Dalmau; Marcin Kozik; Andrei A. Krokhin; Konstantin Makarychev; Yury Makarychev; Jakub Oprsal (SODA, 2017)

Towards a characterization of constant-factor approximable finite-valued CSPs. - Víctor Dalmau; Andrei A. Krokhin; Rajsekar Manokaran (J. Comput. Syst. Sci., 2018)

Dismantlability, Connectedness, and Mixing in Relational Structures. - Raimundo Briceño; Andrei A. Bulatov; Víctor Dalmau; Benoît Larose (ICALP, 2019)

Regularizing Conjunctive Features for Classification. - Pablo Barceló; Alexander Baumgartner; Victor Dalmau; Benny Kimelfeld (PODS, 2019)

Long range actions, connectedness, and dismantlability in relational structures. - Raimundo Briceño; Andrei Bulatov 001; Víctor Dalmau; Benoît Larose (CoRR, 2019)

The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs. - Pablo Barceló; Victor Dalmau; Cristina Feier; Carsten Lutz; Andreas Pieris (PODS, 2020)

Conjunctive Queries: Unique Characterizations and Exact Learnability. - Balder ten Cate; Victor Dalmau (ICDT, 2021)

Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. - Silvia Butti; Víctor Dalmau (MFCS, 2021)

The Complexity of the Distributed Constraint Satisfaction Problem. - Silvia Butti; Victor Dalmau (STACS, 2021)

Promise Constraint Satisfaction and Width. - Albert Atserias; Víctor Dalmau (SODA, 2022)

Extremal Fitting Problems for Conjunctive Queries. - Balder ten Cate; Victor Dalmau; Maurice Funk; Carsten Lutz (PODS, 2023)

Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. - Balder ten Cate; Víctor Dalmau; Jakub Oprsal (CoRR, 2023)

When Do Homomorphism Counts Help in Query Algorithms? - Balder ten Cate; Victor Dalmau; Phokion G. Kolaitis; Wei-Lin Wu (ICDT, 2024)

Right-Adjoints for Datalog Programs. - Balder ten Cate; Víctor Dalmau; Jakub Oprsal (ICDT, 2024)

Local consistency as a reduction between constraint satisfaction problems. - Víctor Dalmau; Jakub Oprsal (LICS, 2024)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems. - Libor Barto; Silvia Butti; Víctor Dalmau (CoRR, 2024)

The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side. - Kristina Asimi; Libor Barto; Victor Dalmau (CoRR, 2024)

Functors on Relational Structures Which Admit Both Left and Right Adjoints. - Víctor Dalmau; Andrei A. Krokhin; Jakub Oprsal (SIAM J. Discret. Math., 2024)