Víctor Dalmau

According to our database, Víctor Dalmau authored at least 67 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The Complexity of the Distributed Constraint Satisfaction Problem.

Silvia Butti, Víctor Dalmau

Theory Comput. Syst., August, 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

The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side.

Kristina Asimi, Libor Barto, Victor Dalmau

CoRR, 2024

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems.

Libor Barto, Silvia Butti, Víctor Dalmau

CoRR, 2024

Local consistency as a reduction between constraint satisfaction problems.

Víctor Dalmau, Jakub Oprsal

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Right-Adjoints for Datalog Programs.

Balder ten Cate, Víctor Dalmau, Jakub Oprsal

Proceedings of the 27th International Conference on Database Theory, 2024

When Do Homomorphism Counts Help in Query Algorithms?

Balder ten Cate, Victor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu

Proceedings of the 27th International Conference on Database Theory, 2024

2023

Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes.

Balder ten Cate, Víctor Dalmau, Jakub Oprsal

CoRR, 2023

Extremal Fitting Problems for Conjunctive Queries.

Balder ten Cate, Victor Dalmau, Maurice Funk, Carsten Lutz

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

2022

Conjunctive Queries: Unique Characterizations and Exact Learnability.

Balder ten Cate, Victor Dalmau

ACM Trans. Database Syst., 2022

Promise Constraint Satisfaction and Width.

Albert Atserias, Víctor Dalmau

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Dismantlability, connectedness, and mixing in relational structures.

Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose

J. Comb. Theory B, 2021

Regularizing conjunctive features for classification.

Pablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld

J. Comput. Syst. Sci., 2021

Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem.

Silvia Butti, Víctor Dalmau

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs.

Pablo Barceló, Victor Dalmau, Cristina Feier, Carsten Lutz, Andreas Pieris

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

2019

Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs.

Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal

SIAM J. Comput., 2019

Long range actions, connectedness, and dismantlability in relational structures.

Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose

CoRR, 2019

2018

Towards a characterization of constant-factor approximable finite-valued CSPs.

Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran

J. Comput. Syst. Sci., 2018

2017

Conjunctions of Among Constraints.

Víctor Dalmau

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

Decomposing Quantified Conjunctive (or Disjunctive) Formulas.

Hubie Chen, Víctor Dalmau

SIAM J. Comput., 2016

Distance constraint satisfaction problems.

Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker

Inf. Comput., 2016

2015

Towards a Characterization of Constant-Factor Approximable Min CSPs.

Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

The Product Homomorphism Problem and Applications.

Balder ten Cate, Víctor Dalmau

Proceedings of the 18th International Conference on Database Theory, 2015

2013

Learning schema mappings.

Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis

ACM Trans. Database Syst., 2013

Robust Satisfiability for CSPs: Hardness and Algorithmic Results.

Víctor Dalmau, Andrei A. Krokhin

ACM Trans. Comput. Theory, 2013

Arc consistency and friends.

Hubie Chen, Víctor Dalmau, Berit Grußien

J. Log. Comput., 2013

Datalog and constraint satisfaction with infinite templates.

Manuel Bodirsky, Víctor Dalmau

J. Comput. Syst. Sci., 2013

Descriptive complexity of approximate counting CSPs.

Andrei A. Bulatov, Víctor Dalmau, Marc Thurley

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Enumerating homomorphisms.

Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx

J. Comput. Syst. Sci., 2012

A note on the product homomorphism problem and CQ-definability

Balder ten Cate, Víctor Dalmau

CoRR, 2012

2011

Two new homomorphism dualities and lattice operations.

Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin

J. Log. Comput., 2011

2010

CSP duality and trees of bounded pathwidth.

Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin

Theor. Comput. Sci., 2010

Distance Constraint Satisfaction Problems.

Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

There are no pure relational width 2 constraint satisfaction problems.

Víctor Dalmau

Inf. Process. Lett., 2009

2008

A combinatorial characterization of resolution width.

Albert Atserias, Víctor Dalmau

J. Comput. Syst. Sci., 2008

Majority constraints have bounded pathwidth duality.

Víctor Dalmau, Andrei A. Krokhin

Eur. J. Comb., 2008

Retractions onto series-parallel posets.

Víctor Dalmau, Andrei A. Krokhin, Benoît Larose

Discret. Math., 2008

Maltsev + Datalog --> Symmetric Datalog.

Víctor Dalmau, Benoît Larose

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Caterpillar Duality for Constraint Satisfaction Problems.

Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Learning intersection-closed classes with signatures.

Andrei A. Bulatov, Hubie Chen, Víctor Dalmau

Theor. Comput. Sci., 2007

First-order Definable Retraction Problems for Posets and Reflexive Graphs.

Víctor Dalmau, Andrei A. Krokhin, Benoît Larose

J. Log. Comput., 2007

Towards a dichotomy theorem for the counting constraint satisfaction problem.

Andrei A. Bulatov, Víctor Dalmau

Inf. Comput., 2007

Phase transitions of PP-complete satisfiability problems.

Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis

Discret. Appl. Math., 2007

CD(4) has bounded width

Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti

CoRR, 2007

On the Power of <i>k</i> -Consistency.

Albert Atserias, Andrei A. Bulatov, Víctor Dalmau

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

A Simple Algorithm for Mal'tsev Constraints.

Andrei A. Bulatov, Víctor Dalmau

SIAM J. Comput., 2006

Generalized Majority-Minority Operations are Tractable.

Víctor Dalmau

Log. Methods Comput. Sci., 2006

2005

Linear datalog and bounded path duality of relational structures.

Víctor Dalmau

Log. Methods Comput. Sci., 2005

Tractable Clones of Polynomials over Semigroups

Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien

Electron. Colloquium Comput. Complex., 2005

A new tractable class of constraint satisfaction problems.

Víctor Dalmau

Ann. Math. Artif. Intell., 2005

From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.

Hubie Chen, Víctor Dalmau

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Beyond Hypertree Width: Decomposition Methods Without Decompositions.

Hubie Chen, Víctor Dalmau

Proceedings of the Principles and Practice of Constraint Programming, 2005

2004

The complexity of counting homomorphisms seen from the other side.

Víctor Dalmau, Peter Jonsson

Theor. Comput. Sci., 2004

Malt'sev Constraints made Simple

Víctor Dalmau

Electron. Colloquium Comput. Complex., 2004

Looking Algebraically at Tractable Quantified Boolean Formulas.

Hubie Chen, Víctor Dalmau

Proceedings of the SAT 2004, 2004

First-Order Definable Retraction Problems for Posets and Reflexive Graph.

Víctor Dalmau, Andrei A. Krokhin, Benoît Larose

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.

Hubie Chen, Víctor Dalmau

Proceedings of the Principles and Practice of Constraint Programming, 2004

Learnability of Relatively Quantified Generalized Formulas.

Andrei A. Bulatov, Hubie Chen, Víctor Dalmau

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Learnability of quantified formulas.

Víctor Dalmau, Peter Jeavons

Theor. Comput. Sci., 2003

Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.

Víctor Dalmau, Daniel K. Ford

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.

Víctor Dalmau

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.

Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi

Proceedings of the Principles and Practice of Constraint Programming, 2002

Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.

Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis

Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

1999

A Dichotomy Theorem for Learning Quantified Boolean Formulas.

Víctor Dalmau

Mach. Learn., 1999

Closure Functions and Width 1 Problems.

Víctor Dalmau, Justin Pearson

Proceedings of the Principles and Practice of Constraint Programming, 1999

Boolean Formulas are Hard to Learn for most Gate Bases.

Víctor Dalmau

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999