The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Víctor Dalmau" ( http://dblp.L3S.de/Authors/Víctor_Dalmau )

  Author page on DBLP  Author page in RDF  Community of Víctor Dalmau in ASPL-2

Publication years (Num. hits)
1997-2003 (15) 2004-2005 (16) 2006-2008 (16) 2009-2013 (17) 2015-2019 (14)
Publication types (Num. hits)
article(41) inproceedings(37)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 5 keywords

Results
Found 80 publication records. Showing 78 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose Long range actions, connectedness, and dismantlability in relational structures. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose Dismantlability, Connectedness, and Mixing in Relational Structures. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pablo Barceló, Alexander Baumgartner, Victor Dalmau, Benny Kimelfeld Regularizing Conjunctive Features for Classification. Search on Bibsonomy PODS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran Towards a characterization of constant-factor approximable finite-valued CSPs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Conjunctions of Among Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal Robust algorithms with polynomial loss for near-unanimity CSPs. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Conjunctions of Among Constraints. Search on Bibsonomy CP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal Robust algorithms with polynomial loss for near-unanimity CSPs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker Distance constraint satisfaction problems. Search on Bibsonomy Inf. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Decomposing Quantified Conjunctive (or Disjunctive) Formulas. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran Towards a Characterization of Constant-Factor Approximable Min CSPs. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. Search on Bibsonomy LICS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Balder ten Cate, Víctor Dalmau The Product Homomorphism Problem and Applications. Search on Bibsonomy ICDT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau Datalog and constraint satisfaction with infinite templates. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin Robust Satisfiability for CSPs: Hardness and Algorithmic Results. Search on Bibsonomy TOCT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau, Berit Grußien Arc consistency and friends. Search on Bibsonomy J. Log. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis Learning schema mappings. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau, Marc Thurley Descriptive complexity of approximate counting CSPs. Search on Bibsonomy CSL The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx Enumerating homomorphisms. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Balder ten Cate, Víctor Dalmau A note on the product homomorphism problem and CQ-definability Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Decomposing Quantified Conjunctive (or Disjunctive) Formulas. Search on Bibsonomy LICS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis Learning schema mappings. Search on Bibsonomy ICDT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau, Berit Grußien Arc Consistency and Friends Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin Two new homomorphism dualities and lattice operations. Search on Bibsonomy J. Log. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin CSP duality and trees of bounded pathwidth. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker Distance Constraint Satisfaction Problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker Distance Constraint Satisfaction Problems. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau There are no pure relational width 2 constraint satisfaction problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx Enumerating Homomorphisms Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx Enumerating Homomorphisms. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin Majority constraints have bounded pathwidth duality. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A combinatorial characterization of resolution width. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau Datalog and Constraint Satisfaction with Infinite Templates Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Benoît Larose Retractions onto series-parallel posets. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin Caterpillar Duality for Constraint Satisfaction Problems. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF caterpillar structures, Datalog, duality, constraint satisfaction problem, homomorphism
1Víctor Dalmau, Benoît Larose Maltsev + Datalog --> Symmetric Datalog. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Maltsev term, Dstalog, Symmetric Datalog
1Andrei A. Bulatov, Hubie Chen, Víctor Dalmau Learning intersection-closed classes with signatures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti CD(4) has bounded width Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis Phase transitions of PP-complete satisfiability problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Benoît Larose First-order Definable Retraction Problems for Posets and Reflexive Graphs. Search on Bibsonomy J. Log. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau Towards a dichotomy theorem for the counting constraint satisfaction problem. Search on Bibsonomy Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Andrei A. Bulatov, Víctor Dalmau On the Power of k -Consistency. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Generalized Majority-Minority Operations are Tractable Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Víctor Dalmau Generalized Majority-Minority Operations are Tractable. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau A Simple Algorithm for Mal'tsev Constraints. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Víctor Dalmau Datalog and Constraint Satisfaction with Infinite Templates. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau A new tractable class of constraint satisfaction problems. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF para-primal algebra, complexity, constraint satisfaction problem
1Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien Tractable Clones of Polynomials over Semigroups Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Beyond Hypertree Width: Decomposition Methods Without Decompositions Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Víctor Dalmau Linear Datalog and Bounded Path Duality of Relational Structures Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Víctor Dalmau Linear datalog and bounded path duality of relational structures. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Generalized Majority-Minority Operations are Tractable. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien Tractable Clones of Polynomials over Semigroups. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Beyond Hypertree Width: Decomposition Methods Without Decompositions. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. Search on Bibsonomy CSL The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Peter Jonsson The complexity of counting homomorphisms seen from the other side. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Malt'sev Constraints made Simple Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Benoît Larose First-Order Definable Retraction Problems for Posets and Reflexive Graph. Search on Bibsonomy LICS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Hubie Chen, Víctor Dalmau Learnability of Relatively Quantified Generalized Formulas. Search on Bibsonomy ALT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Looking Algebraically at Tractable Quantified Boolean Formulas. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hubie Chen, Víctor Dalmau Looking Algebraically at Tractable Quantified Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2004 DBLP  BibTeX  RDF
1Hubie Chen, Víctor Dalmau (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Peter Jeavons 0001 Learnability of quantified formulas. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Daniel K. Ford Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A Combinatorial Characterization of Resolution Width. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Víctor Dalmau A Combinatorial Characterization of Resolution Width Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Víctor Dalmau Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. Search on Bibsonomy AAAI/IAAI The full citation details ... 2002 DBLP  BibTeX  RDF
1Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. Search on Bibsonomy CP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis Phase Transitions of PP-Complete Satisfiability Problems. Search on Bibsonomy IJCAI The full citation details ... 2001 DBLP  BibTeX  RDF
1Víctor Dalmau A New Tractable Class of Constraint Satisfaction Problems. Search on Bibsonomy AMAI The full citation details ... 2000 DBLP  BibTeX  RDF
1Víctor Dalmau A Dichotomy Theorem for Learning Quantified Boolean Formulas. Search on Bibsonomy Machine Learning The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau Boolean Formulas are Hard to Learn for most Gate Bases. Search on Bibsonomy ALT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Justin Pearson Closure Functions and Width 1 Problems. Search on Bibsonomy CP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Peter Jeavons 0001 Learnability of Quantified Formulas. Search on Bibsonomy EuroCOLT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau A Dichotomy Theorem for Learning Quantified Boolean Formulas. Search on Bibsonomy COLT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #78 of 78 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license