 | 2009 |
|---|
| 50 |       | Andrei A. Bulatov,
Víctor Dalmau,
Martin Grohe,
Dániel Marx:
Enumerating Homomorphisms.
STACS 2009: 231-242 |
| 49 | | Andrei A. Bulatov,
Víctor Dalmau,
Martin Grohe,
Dániel Marx:
Enumerating Homomorphisms
CoRR abs/0902.1256: (2009) |
| 48 | | Víctor Dalmau:
There are no pure relational width 2 constraint satisfaction problems.
Inf. Process. Lett. 109(4): 213-218 (2009) |
| 2008 |
|---|
| 47 | | Víctor Dalmau,
Benoit Larose:
Maltsev + Datalog --> Symmetric Datalog.
LICS 2008: 297-306 |
| 46 | | Catarina Carvalho,
Víctor Dalmau,
Andrei A. Krokhin:
Caterpillar Duality for Constraint Satisfaction Problems.
LICS 2008: 307-316 |
| 45 | | Manuel Bodirsky,
Víctor Dalmau:
Datalog and Constraint Satisfaction with Infinite Templates
CoRR abs/0809.2386: (2008) |
| 44 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
Retractions onto series-parallel posets.
Discrete Mathematics 308(11): 2104-2114 (2008) |
| 43 | | Víctor Dalmau,
Andrei A. Krokhin:
Majority constraints have bounded pathwidth duality.
Eur. J. Comb. 29(4): 821-837 (2008) |
| 42 | | Albert Atserias,
Víctor Dalmau:
A combinatorial characterization of resolution width.
J. Comput. Syst. Sci. 74(3): 323-334 (2008) |
| 2007 |
|---|
| 41 | | Albert Atserias,
Andrei A. Bulatov,
Víctor Dalmau:
On the Power of k -Consistency.
ICALP 2007: 279-290 |
| 40 | | Catarina Carvalho,
Víctor Dalmau,
Petar Markovic,
Miklós Maróti:
CD(4) has bounded width
CoRR abs/0709.1934: (2007) |
| 39 | | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Phase transitions of PP-complete satisfiability problems.
Discrete Applied Mathematics 155(12): 1627-1639 (2007) |
| 38 | | Andrei A. Bulatov,
Víctor Dalmau:
Towards a dichotomy theorem for the counting constraint satisfaction problem.
Inf. Comput. 205(5): 651-678 (2007) |
| 37 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
First-order Definable Retraction Problems for Posets and Reflexive Graphs.
J. Log. Comput. 17(1): 31-51 (2007) |
| 36 | | Andrei A. Bulatov,
Hubie Chen,
Víctor Dalmau:
Learning intersection-closed classes with signatures.
Theor. Comput. Sci. 382(3): 209-220 (2007) |
| 2006 |
|---|
| 35 | | Manuel Bodirsky,
Víctor Dalmau:
Datalog and Constraint Satisfaction with Infinite Templates.
STACS 2006: 646-659 |
| 34 | | Víctor Dalmau:
Generalized Majority-Minority Operations are Tractable
CoRR abs/cs/0609108: (2006) |
| 33 | | Víctor Dalmau:
Generalized Majority-Minority Operations are Tractable.
Logical Methods in Computer Science 2(4): (2006) |
| 32 | | Andrei A. Bulatov,
Víctor Dalmau:
A Simple Algorithm for Mal'tsev Constraints.
SIAM J. Comput. 36(1): 16-27 (2006) |
| 2005 |
|---|
| 31 | | Hubie Chen,
Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions.
CP 2005: 167-181 |
| 30 | | Víctor Dalmau,
Ricard Gavaldà,
Pascal Tesson,
Denis Thérien:
Tractable Clones of Polynomials over Semigroups.
CP 2005: 196-210 |
| 29 | | Hubie Chen,
Víctor Dalmau:
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
CSL 2005: 232-247 |
| 28 | | Víctor Dalmau:
Generalized Majority-Minority Operations are Tractable.
LICS 2005: 438-447 |
| 27 | | Víctor Dalmau:
A new tractable class of constraint satisfaction problems.
Ann. Math. Artif. Intell. 44(1-2): 61-85 (2005) |
| 26 | | Víctor Dalmau:
Linear Datalog and Bounded Path Duality of Relational Structures
CoRR abs/cs/0504027: (2005) |
| 25 | | Hubie Chen,
Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions
CoRR abs/cs/0505035: (2005) |
| 24 | | Víctor Dalmau,
Ricard Gavaldà,
Pascal Tesson,
Denis Thérien:
Tractable Clones of Polynomials over Semigroups
Electronic Colloquium on Computational Complexity (ECCC)(059): (2005) |
| 23 | | Víctor Dalmau:
Linear datalog and bounded path duality of relational structures.
Logical Methods in Computer Science 1(1): (2005) |
| 2004 |
|---|
| 22 | | Andrei A. Bulatov,
Hubie Chen,
Víctor Dalmau:
Learnability of Relatively Quantified Generalized Formulas.
ALT 2004: 365-379 |
| 21 | | Hubie Chen,
Víctor Dalmau:
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.
CP 2004: 182-196 |
| 20 | | Víctor Dalmau,
Andrei A. Krokhin,
Benoit Larose:
First-Order Definable Retraction Problems for Posets and Reflexive Graph.
LICS 2004: 232-241 |
| 19 | | Hubie Chen,
Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas.
SAT 2004 |
| 18 | | Hubie Chen,
Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas.
SAT (Selected Papers 2004: 71-79 |
| 17 | | Víctor Dalmau:
Malt'sev Constraints made Simple
Electronic Colloquium on Computational Complexity (ECCC)(097): (2004) |
| 16 | | Víctor Dalmau,
Peter Jonsson:
The complexity of counting homomorphisms seen from the other side.
Theor. Comput. Sci. 329(1-3): 315-323 (2004) |
| 2003 |
|---|
| 15 | | Andrei A. Bulatov,
Víctor Dalmau:
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem.
FOCS 2003: 562- |
| 14 | | Albert Atserias,
Víctor Dalmau:
A Combinatorial Characterization of ResolutionWidth.
IEEE Conference on Computational Complexity 2003: 239-247 |
| 13 | | Víctor Dalmau,
Daniel K. Ford:
Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.
MFCS 2003: 358-367 |
| 12 | | Víctor Dalmau,
Peter Jeavons:
Learnability of quantified formulas.
Theor. Comput. Sci. 306(1-3): 485-511 (2003) |
| 2002 |
|---|
| 11 |  | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.
AAAI/IAAI 2002: 620-626 |
| 10 | | Víctor Dalmau,
Phokion G. Kolaitis,
Moshe Y. Vardi:
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.
CP 2002: 310-326 |
| 9 | | Víctor Dalmau:
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.
ICALP 2002: 414-425 |
| 8 | | Albert Atserias,
Víctor Dalmau:
A Combinatorial Characterization of Resolution Width
Electronic Colloquium on Computational Complexity (ECCC)(035): (2002) |
| 2001 |
|---|
| 7 | | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Phase Transitions of PP-Complete Satisfiability Problems.
IJCAI 2001: 183-192 |
| 2000 |
|---|
| 6 | | Víctor Dalmau:
A New Tractable Class of Constraint Satisfaction Problems.
AMAI 2000 |
| 1999 |
|---|
| 5 | | Víctor Dalmau:
Boolean Formulas are Hard to Learn for most Gate Bases.
ATL 1999: 301-312 |
| 4 | | Víctor Dalmau,
Justin Pearson:
Closure Functions and Width 1 Problems.
CP 1999: 159-173 |
| 3 | | Víctor Dalmau,
Peter Jeavons:
Learnability of Quantified Formulas.
EuroCOLT 1999: 63-78 |
| 2 | | Víctor Dalmau:
A Dichotomy Theorem for Learning Quantified Boolean Formulas.
Machine Learning 35(3): 207-224 (1999) |
| 1997 |
|---|
| 1 | | Víctor Dalmau:
A Dichotomy Theorem for Learning Quantified Boolean Formulas.
COLT 1997: 193-200 |
