Víctor Dalmau

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 22

Top Topics

Datalog Programs

Relational Structures

Constraint Solving

Top Venues

Publications

Libor Barto, Silvia Butti, Víctor Dalmau
The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems. CoRR (2024)
Víctor Dalmau, Jakub Oprsal
Local consistency as a reduction between constraint satisfaction problems. LICS (2024)
Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
Functors on Relational Structures Which Admit Both Left and Right Adjoints. SIAM J. Discret. Math. 38 (3) (2024)
Balder ten Cate, Víctor Dalmau, Jakub Oprsal
Right-Adjoints for Datalog Programs. ICDT (2024)
Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
Functors on relational structures which admit both left and right adjoints. CoRR (2023)
Balder ten Cate, Víctor Dalmau, Jakub Oprsal
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. CoRR (2023)
Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu
When do homomorphism counts help in query algorithms? CoRR (2023)
Albert Atserias, Víctor Dalmau
Promise Constraint Satisfaction and Width. SODA (2022)
Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
Dismantlability, connectedness, and mixing in relational structures. J. Comb. Theory, Ser. B 147 (2021)
Albert Atserias, Víctor Dalmau
Promise Constraint Satisfaction and Width. CoRR (2021)
Silvia Butti, Víctor Dalmau
Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. MFCS (2021)
Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose
Dismantlability, Connectedness, and Mixing in Relational Structures. ICALP (2019)
Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
Long range actions, connectedness, and dismantlability in relational structures. CoRR (2019)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48 (6) (2019)
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a characterization of constant-factor approximable finite-valued CSPs. J. Comput. Syst. Sci. 97 (2018)
Víctor Dalmau
Conjunctions of Among Constraints. CP (2017)
Víctor Dalmau
Conjunctions of Among Constraints. CoRR (2017)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA (2017)
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. CoRR (2016)
Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR (2016)
Hubie Chen, Víctor Dalmau
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput. 45 (6) (2016)
Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
Distance constraint satisfaction problems. Inf. Comput. 247 (2016)
Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS (2015)
Balder ten Cate, Víctor Dalmau
The Product Homomorphism Problem and Applications. ICDT (2015)
Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
Towards a Characterization of Constant-Factor Approximable Min CSPs. SODA (2015)
Hubie Chen, Víctor Dalmau, Berit Grußien
Arc consistency and friends. J. Log. Comput. 23 (1) (2013)
Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis
Learning schema mappings. ACM Trans. Database Syst. 38 (4) (2013)
Andrei A. Bulatov, Víctor Dalmau, Marc Thurley
Descriptive complexity of approximate counting CSPs. CSL (2013)
Víctor Dalmau, Andrei A. Krokhin
Robust Satisfiability for CSPs: Hardness and Algorithmic Results. ACM Trans. Comput. Theory 5 (4) (2013)
Manuel Bodirsky, Víctor Dalmau
Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79 (1) (2013)
Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
Enumerating homomorphisms. J. Comput. Syst. Sci. 78 (2) (2012)
Balder ten Cate, Víctor Dalmau
A note on the product homomorphism problem and CQ-definability CoRR (2012)
Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis
Learning schema mappings. ICDT (2012)
Hubie Chen, Víctor Dalmau
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS (2012)
Hubie Chen, Víctor Dalmau, Berit Grußien
Arc Consistency and Friends CoRR (2011)
Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
Two new homomorphism dualities and lattice operations. J. Log. Comput. 21 (6) (2011)
Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
Distance Constraint Satisfaction Problems CoRR (2010)
Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
Distance Constraint Satisfaction Problems. MFCS (2010)
Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
CSP duality and trees of bounded pathwidth. Theor. Comput. Sci. 411 (34-36) (2010)
Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
Enumerating Homomorphisms CoRR (2009)
Víctor Dalmau
There are no pure relational width 2 constraint satisfaction problems. Inf. Process. Lett. 109 (4) (2009)
Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
Enumerating Homomorphisms. STACS (2009)
Víctor Dalmau, Benoît Larose
Maltsev + Datalog --> Symmetric Datalog. LICS (2008)
Albert Atserias, Víctor Dalmau
A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74 (3) (2008)
Manuel Bodirsky, Víctor Dalmau
Datalog and Constraint Satisfaction with Infinite Templates CoRR (2008)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
Retractions onto series-parallel posets. Discret. Math. 308 (11) (2008)
Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
Caterpillar Duality for Constraint Satisfaction Problems. LICS (2008)
Víctor Dalmau, Andrei A. Krokhin
Majority constraints have bounded pathwidth duality. Eur. J. Comb. 29 (4) (2008)
Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
Phase transitions of PP-complete satisfiability problems. Discret. Appl. Math. 155 (12) (2007)
Albert Atserias, Andrei A. Bulatov, Víctor Dalmau
-Consistency. ICALP (2007)
Andrei A. Bulatov, Víctor Dalmau
Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205 (5) (2007)
Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
Learning intersection-closed classes with signatures. Theor. Comput. Sci. 382 (3) (2007)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
First-order Definable Retraction Problems for Posets and Reflexive Graphs. J. Log. Comput. 17 (1) (2007)
Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti
CD(4) has bounded width CoRR (2007)
Manuel Bodirsky, Víctor Dalmau
Datalog and Constraint Satisfaction with Infinite Templates. STACS (2006)
Víctor Dalmau
Generalized Majority-Minority Operations are Tractable CoRR (2006)
Andrei A. Bulatov, Víctor Dalmau
A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput. 36 (1) (2006)
Víctor Dalmau
Generalized Majority-Minority Operations are Tractable. Log. Methods Comput. Sci. 2 (4) (2006)
Hubie Chen, Víctor Dalmau
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. CSL (2005)
Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
Tractable Clones of Polynomials over Semigroups. CP (2005)
Hubie Chen, Víctor Dalmau
Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP (2005)
Víctor Dalmau
Generalized Majority-Minority Operations are Tractable. LICS (2005)
Víctor Dalmau
Linear Datalog and Bounded Path Duality of Relational Structures CoRR (2005)
Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
Tractable Clones of Polynomials over Semigroups Electron. Colloquium Comput. Complex. (059) (2005)
Víctor Dalmau
Linear datalog and bounded path duality of relational structures. Log. Methods Comput. Sci. 1 (1) (2005)
Víctor Dalmau
A new tractable class of constraint satisfaction problems. Ann. Math. Artif. Intell. 44 (1-2) (2005)
Hubie Chen, Víctor Dalmau
Beyond Hypertree Width: Decomposition Methods Without Decompositions CoRR (2005)
Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
Learnability of Relatively Quantified Generalized Formulas. ALT (2004)
Víctor Dalmau, Peter Jonsson
The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci. 329 (1-3) (2004)
Víctor Dalmau
Malt'sev Constraints made Simple Electron. Colloquium Comput. Complex. (097) (2004)
Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
First-Order Definable Retraction Problems for Posets and Reflexive Graph. LICS (2004)
Hubie Chen, Víctor Dalmau
Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers (2004)
Hubie Chen, Víctor Dalmau
Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (2004)
Hubie Chen, Víctor Dalmau
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP (2004)
Andrei A. Bulatov, Víctor Dalmau
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. FOCS (2003)
Albert Atserias, Víctor Dalmau
A Combinatorial Characterization of Resolution Width. Computational Complexity Conference (2003)
Víctor Dalmau, Daniel K. Ford
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. MFCS (2003)
Víctor Dalmau, Peter Jeavons
Learnability of quantified formulas. Theor. Comput. Sci. 306 (1-3) (2003)
Víctor Dalmau
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. ICALP (2002)
Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP (2002)
Albert Atserias, Víctor Dalmau
A Combinatorial Characterization of Resolution Width Electron. Colloquium Comput. Complex. (035) (2002)
Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. AAAI/IAAI (2002)
Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
Phase Transitions of PP-Complete Satisfiability Problems. IJCAI (2001)
Víctor Dalmau
A New Tractable Class of Constraint Satisfaction Problems. AI&M (2000)
Víctor Dalmau, Peter Jeavons
Learnability of Quantified Formulas. EuroCOLT (1999)
Víctor Dalmau
A Dichotomy Theorem for Learning Quantified Boolean Formulas. Mach. Learn. 35 (3) (1999)
Víctor Dalmau
Boolean Formulas are Hard to Learn for most Gate Bases. ALT (1999)
Víctor Dalmau, Justin Pearson
Closure Functions and Width 1 Problems. CP (1999)
Víctor Dalmau
A Dichotomy Theorem for Learning Quantified Boolean Formulas. COLT (1997)