| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating homomorphisms.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin |
Two new homomorphism dualities and lattice operations.  |
J. Log. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau, Berit Grußien |
Arc Consistency and Friends  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin |
CSP duality and trees of bounded pathwidth.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
Distance Constraint Satisfaction Problems  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
Distance Constraint Satisfaction Problems.  |
MFCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
There are no pure relational width 2 constraint satisfaction problems.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx |
Enumerating Homomorphisms.  |
STACS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
Retractions onto series-parallel posets.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin |
Majority constraints have bounded pathwidth duality.  |
Eur. J. Comb.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau |
Datalog and Constraint Satisfaction with Infinite Templates  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Albert Atserias, Víctor Dalmau |
A combinatorial characterization of resolution width.  |
J. Comput. Syst. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Benoit Larose |
Maltsev + Datalog --> Symmetric Datalog.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
Maltsev term, Dstalog, Symmetric Datalog |
| 1 | Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin |
Caterpillar Duality for Constraint Satisfaction Problems.  |
LICS  |
2008 |
DBLP DOI BibTeX RDF |
caterpillar structures, Datalog, duality, constraint satisfaction problem, homomorphism |
| 1 | Andrei A. Bulatov, Hubie Chen, Víctor Dalmau |
Learning intersection-closed classes with signatures.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau |
Towards a dichotomy theorem for the counting constraint satisfaction problem.  |
Inf. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
First-order Definable Retraction Problems for Posets and Reflexive Graphs.  |
J. Log. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti |
CD(4) has bounded width  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis |
Phase transitions of PP-complete satisfiability problems.  |
Discrete Applied Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Andrei A. Bulatov, Víctor Dalmau |
On the Power of k -Consistency.  |
ICALP  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
Generalized Majority-Minority Operations are Tractable.  |
Logical Methods in Computer Science  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
Generalized Majority-Minority Operations are Tractable  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau |
A Simple Algorithm for Mal'tsev Constraints.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau |
Datalog and Constraint Satisfaction with Infinite Templates.  |
STACS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
Linear datalog and bounded path duality of relational structures.  |
Logical Methods in Computer Science  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
Beyond Hypertree Width: Decomposition Methods Without Decompositions  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
Linear Datalog and Bounded Path Duality of Relational Structures  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
A new tractable class of constraint satisfaction problems.  |
Ann. Math. Artif. Intell.  |
2005 |
DBLP DOI BibTeX RDF |
para-primal algebra, complexity, constraint satisfaction problem |
| 1 | Víctor Dalmau |
Generalized Majority-Minority Operations are Tractable.  |
LICS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.  |
CSL  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien |
Tractable Clones of Polynomials over Semigroups.  |
CP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
Beyond Hypertree Width: Decomposition Methods Without Decompositions.  |
CP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
Malt'sev Constraints made Simple  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau, Peter Jonsson |
The complexity of counting homomorphisms seen from the other side.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
Looking Algebraically at Tractable Quantified Boolean Formulas.  |
SAT  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
Looking Algebraically at Tractable Quantified Boolean Formulas.  |
SAT (Selected Papers  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Hubie Chen, Víctor Dalmau |
Learnability of Relatively Quantified Generalized Formulas.  |
ALT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Andrei A. Krokhin, Benoit Larose |
First-Order Definable Retraction Problems for Posets and Reflexive Graph.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubie Chen, Víctor Dalmau |
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.  |
CP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Peter Jeavons |
Learnability of quantified formulas.  |
Theor. Comput. Sci.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Daniel K. Ford |
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.  |
MFCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Víctor Dalmau |
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Víctor Dalmau |
A Combinatorial Characterization of ResolutionWidth.  |
IEEE Conference on Computational Complexity  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Víctor Dalmau |
A Combinatorial Characterization of Resolution Width  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.  |
ICALP  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis |
Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.  |
AAAI/IAAI  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi |
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.  |
CP  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis |
Phase Transitions of PP-Complete Satisfiability Problems.  |
IJCAI  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
A New Tractable Class of Constraint Satisfaction Problems.  |
AMAI  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Víctor Dalmau |
A Dichotomy Theorem for Learning Quantified Boolean Formulas.  |
Machine Learning  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
Boolean Formulas are Hard to Learn for most Gate Bases.  |
ATL  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Peter Jeavons |
Learnability of Quantified Formulas.  |
EuroCOLT  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau, Justin Pearson |
Closure Functions and Width 1 Problems.  |
CP  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
A Dichotomy Theorem for Learning Quantified Boolean Formulas.  |
COLT  |
1997 |
DBLP DOI BibTeX RDF |
|