Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Víctor Dalmau
2010 – today
- 2013
[j20]Manuel Bodirsky, Víctor Dalmau: Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. 79(1): 79-100 (2013)- [j19]Hubie Chen, Víctor Dalmau, Berit Grußien: Arc consistency and friends. J. Log. Comput. 23(1): 87-108 (2013)
- 2012
- [j18]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating homomorphisms. J. Comput. Syst. Sci. 78(2): 638-650 (2012)
- [c29]
- [c28]Hubie Chen, Víctor Dalmau: Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS 2012: 205-214
- [i12]Balder ten Cate, Víctor Dalmau: A note on the product homomorphism problem and CQ-definability. CoRR abs/1212.3534 (2012)
- 2011
- [j17]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin: Two new homomorphism dualities and lattice operations. J. Log. Comput. 21(6): 1065-1092 (2011)
- [i11]
- 2010
- [j16]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin: CSP duality and trees of bounded pathwidth. Theor. Comput. Sci. 411(34-36): 3188-3208 (2010)
- [c27]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. MFCS 2010: 162-173
- [i10]Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker: Distance Constraint Satisfaction Problems. CoRR abs/1004.3842 (2010)
2000 – 2009
- 2009
- [j15]Víctor Dalmau: There are no pure relational width 2 constraint satisfaction problems. Inf. Process. Lett. 109(4): 213-218 (2009)
- [c26]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. STACS 2009: 231-242
- [i9]Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. CoRR abs/0902.1256 (2009)
- 2008
- [j14]Víctor Dalmau, Andrei A. Krokhin, Benoit Larose: Retractions onto series-parallel posets. Discrete Mathematics 308(11): 2104-2114 (2008)
- [j13]Víctor Dalmau, Andrei A. Krokhin: Majority constraints have bounded pathwidth duality. Eur. J. Comb. 29(4): 821-837 (2008)
- [j12]Albert Atserias, Víctor Dalmau: A combinatorial characterization of resolution width. J. Comput. Syst. Sci. 74(3): 323-334 (2008)
- [c25]
- [c24]Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin: Caterpillar Duality for Constraint Satisfaction Problems. LICS 2008: 307-316
- [i8]Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. CoRR abs/0809.2386 (2008)
- 2007
- [j11]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics 155(12): 1627-1639 (2007)
- [j10]Andrei A. Bulatov, Víctor Dalmau: Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5): 651-678 (2007)
- [j9]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)
- [j8]Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learning intersection-closed classes with signatures. Theor. Comput. Sci. 382(3): 209-220 (2007)
- [c23]Albert Atserias, Andrei A. Bulatov, Víctor Dalmau: On the Power of k -Consistency. ICALP 2007: 279-290
- [i7]Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti: CD(4) has bounded width. CoRR abs/0709.1934 (2007)
- 2006
- [j7]Víctor Dalmau: Generalized Majority-Minority Operations are Tractable. Logical Methods in Computer Science 2(4) (2006)
- [j6]Andrei A. Bulatov, Víctor Dalmau: A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput. 36(1): 16-27 (2006)
- [c22]Manuel Bodirsky, Víctor Dalmau: Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659
- [i6]
- 2005
- [j5]Víctor Dalmau: A new tractable class of constraint satisfaction problems. Ann. Math. Artif. Intell. 44(1-2): 61-85 (2005)
- [j4]Víctor Dalmau: Linear datalog and bounded path duality of relational structures. Logical Methods in Computer Science 1(1) (2005)
- [c21]Hubie Chen, Víctor Dalmau: Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP 2005: 167-181
- [c20]Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups. CP 2005: 196-210
- [c19]Hubie Chen, Víctor Dalmau: From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. CSL 2005: 232-247
- [c18]
- [i5]Víctor Dalmau: Linear Datalog and Bounded Path Duality of Relational Structures. CoRR abs/cs/0504027 (2005)
- [i4]Hubie Chen, Víctor Dalmau: Beyond Hypertree Width: Decomposition Methods Without Decompositions. CoRR abs/cs/0505035 (2005)
- [i3]Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien: Tractable Clones of Polynomials over Semigroups. Electronic Colloquium on Computational Complexity (ECCC)(059) (2005)
- 2004
- [j3]Víctor Dalmau, Peter Jonsson: The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci. 329(1-3): 315-323 (2004)
- [c17]Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learnability of Relatively Quantified Generalized Formulas. ALT 2004: 365-379
- [c16]Hubie Chen, Víctor Dalmau: (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP 2004: 182-196
- [c15]Víctor Dalmau, Andrei A. Krokhin, Benoit Larose: First-Order Definable Retraction Problems for Posets and Reflexive Graph. LICS 2004: 232-241
- [c14]
- [c13]Hubie Chen, Víctor Dalmau: Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers 2004: 71-79
- [i2]Víctor Dalmau: Malt'sev Constraints made Simple. Electronic Colloquium on Computational Complexity (ECCC)(097) (2004)
- 2003
- [j2]Víctor Dalmau, Peter Jeavons: Learnability of quantified formulas. Theor. Comput. Sci. 306(1-3): 485-511 (2003)
- [c12]Albert Atserias, Víctor Dalmau: A Combinatorial Characterization of ResolutionWidth. IEEE Conference on Computational Complexity 2003: 239-247
- [c11]Andrei A. Bulatov, Víctor Dalmau: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. FOCS 2003: 562-571
- [c10]Víctor Dalmau, Daniel K. Ford: Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. MFCS 2003: 358-367
- 2002
- [c9]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
- [c8]Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002: 310-326
- [c7]Víctor Dalmau: Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. ICALP 2002: 414-425
- [i1]Albert Atserias, Víctor Dalmau: A Combinatorial Characterization of Resolution Width. Electronic Colloquium on Computational Complexity (ECCC)(035) (2002)
- 2001
- [c6]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase Transitions of PP-Complete Satisfiability Problems. IJCAI 2001: 183-192
- 2000
- [c5]
1990 – 1999
- 1999
- [j1]Víctor Dalmau: A Dichotomy Theorem for Learning Quantified Boolean Formulas. Machine Learning 35(3): 207-224 (1999)
- [c4]
- [c3]
- [c2]
- 1997
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-01 19:55 CET by the dblp team