Víctor Dalmau

90 papers A* 16A 13B 7Journal 50Unranked 4

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Functors on Relational Structures Which Admit Both Left and Right Adjoints. SIAM J. Discret. Math. Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
2024	A*	`conf`	Local consistency as a reduction between constraint satisfaction problems. LICS Víctor Dalmau, Jakub Oprsal
2024	A	`conf`	Right-Adjoints for Datalog Programs. ICDT Balder ten Cate, Víctor Dalmau, Jakub Oprsal
2024	J	`jnl`	The Complexity of the Distributed Constraint Satisfaction Problem. Theory Comput. Syst. Silvia Butti, Víctor Dalmau
2024	J	`jnl`	The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems. CoRR Libor Barto, Silvia Butti, Víctor Dalmau
2023	J	`jnl`	Functors on relational structures which admit both left and right adjoints. CoRR Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal
2023	J	`jnl`	Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. CoRR Balder ten Cate, Víctor Dalmau, Jakub Oprsal
2023	J	`jnl`	When do homomorphism counts help in query algorithms? CoRR Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis, Wei-Lin Wu
2022	A*	`conf`	Promise Constraint Satisfaction and Width. SODA Albert Atserias, Víctor Dalmau
2021	J	`jnl`	Dismantlability, connectedness, and mixing in relational structures. J. Comb. Theory B Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
2021	B	`conf`	Fractional Homomorphism, Weisfeiler-Leman Invariance, and the Sherali-Adams Hierarchy for the Constraint Satisfaction Problem. MFCS Silvia Butti, Víctor Dalmau
2021	J	`jnl`	Promise Constraint Satisfaction and Width. CoRR Albert Atserias, Víctor Dalmau
2019	A*	`conf`	Dismantlability, Connectedness, and Mixing in Relational Structures. ICALP Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose
2019	J	`jnl`	Long range actions, connectedness, and dismantlability in relational structures. CoRR Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose
2019	J	`jnl`	Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
2018	J	`jnl`	Towards a characterization of constant-factor approximable finite-valued CSPs. J. Comput. Syst. Sci. Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
2017	A	`conf`	Conjunctions of Among Constraints. CP Víctor Dalmau
2017	J	`jnl`	Conjunctions of Among Constraints. CoRR Víctor Dalmau
2017	A*	`conf`	Robust algorithms with polynomial loss for near-unanimity CSPs. SODA Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
2016	J	`jnl`	Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput. Hubie Chen, Víctor Dalmau
2016	J	`jnl`	Distance constraint satisfaction problems. Inf. Comput. Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
2016	J	`jnl`	Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal
2016	J	`jnl`	Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. CoRR Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
2015	A*	`conf`	Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. LICS Víctor Dalmau, László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
2015	A	`conf`	The Product Homomorphism Problem and Applications. ICDT Balder ten Cate, Víctor Dalmau
2015	A*	`conf`	Towards a Characterization of Constant-Factor Approximable Min CSPs. SODA Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran
2013	J	`jnl`	Arc consistency and friends. J. Log. Comput. Hubie Chen, Víctor Dalmau, Berit Grußien
2013	J	`jnl`	Datalog and constraint satisfaction with infinite templates. J. Comput. Syst. Sci. Manuel Bodirsky, Víctor Dalmau
2013	B	`conf`	Descriptive complexity of approximate counting CSPs. CSL Andrei A. Bulatov, Víctor Dalmau, Marc Thurley
2013	J	`jnl`	Learning schema mappings. ACM Trans. Database Syst. Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis
2013	J	`jnl`	Robust Satisfiability for CSPs: Hardness and Algorithmic Results. ACM Trans. Comput. Theory Víctor Dalmau, Andrei A. Krokhin
2012	J	`jnl`	A note on the product homomorphism problem and CQ-definability CoRR Balder ten Cate, Víctor Dalmau
2012	A*	`conf`	Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS Hubie Chen, Víctor Dalmau
2012	J	`jnl`	Enumerating homomorphisms. J. Comput. Syst. Sci. Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2012	A	`conf`	Learning schema mappings. ICDT Balder ten Cate, Víctor Dalmau, Phokion G. Kolaitis
2011	J	`jnl`	Arc Consistency and Friends CoRR Hubie Chen, Víctor Dalmau, Berit Grußien
2011	J	`jnl`	Two new homomorphism dualities and lattice operations. J. Log. Comput. Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
2010	J	`jnl`	CSP duality and trees of bounded pathwidth. Theor. Comput. Sci. Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
2010	J	`jnl`	Distance Constraint Satisfaction Problems CoRR Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2010	B	`conf`	Distance Constraint Satisfaction Problems. MFCS Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2009	J	`jnl`	Enumerating Homomorphisms CoRR Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	A	`conf`	Enumerating Homomorphisms. STACS Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx
2009	J	`jnl`	There are no pure relational width 2 constraint satisfaction problems. Inf. Process. Lett. Víctor Dalmau
2008	J	`jnl`	A combinatorial characterization of resolution width. J. Comput. Syst. Sci. Albert Atserias, Víctor Dalmau
2008	A*	`conf`	Caterpillar Duality for Constraint Satisfaction Problems. LICS Catarina Carvalho, Víctor Dalmau, Andrei A. Krokhin
2008	J	`jnl`	Datalog and Constraint Satisfaction with Infinite Templates CoRR Manuel Bodirsky, Víctor Dalmau
2008	J	`jnl`	Majority constraints have bounded pathwidth duality. Eur. J. Comb. Víctor Dalmau, Andrei A. Krokhin
2008	A*	`conf`	Maltsev + Datalog --> Symmetric Datalog. LICS Víctor Dalmau, Benoît Larose
2008	J	`jnl`	Retractions onto series-parallel posets. Discret. Math. Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
2007	J	`jnl`	CD(4) has bounded width CoRR Catarina Carvalho, Víctor Dalmau, Petar Markovic, Miklós Maróti
2007	J	`jnl`	First-order Definable Retraction Problems for Posets and Reflexive Graphs. J. Log. Comput. Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
2007	J	`jnl`	Learning intersection-closed classes with signatures. Theor. Comput. Sci. Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
2007	A*	`conf`	On the Power of ICALP Albert Atserias, Andrei A. Bulatov, Víctor Dalmau
2007	J	`jnl`	Phase transitions of PP-complete satisfiability problems. Discret. Appl. Math. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
2007	J	`jnl`	Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. Andrei A. Bulatov, Víctor Dalmau
2006	J	`jnl`	A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput. Andrei A. Bulatov, Víctor Dalmau
2006	A	`conf`	Datalog and Constraint Satisfaction with Infinite Templates. STACS Manuel Bodirsky, Víctor Dalmau
2006	J	`jnl`	Generalized Majority-Minority Operations are Tractable CoRR Víctor Dalmau
2006	J	`jnl`	Generalized Majority-Minority Operations are Tractable. Log. Methods Comput. Sci. Víctor Dalmau
2005	J	`jnl`	A new tractable class of constraint satisfaction problems. Ann. Math. Artif. Intell. Víctor Dalmau
2005	J	`jnl`	Beyond Hypertree Width: Decomposition Methods Without Decompositions CoRR Hubie Chen, Víctor Dalmau
2005	A	`conf`	Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP Hubie Chen, Víctor Dalmau
2005	B	`conf`	From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. CSL Hubie Chen, Víctor Dalmau
2005	A*	`conf`	Generalized Majority-Minority Operations are Tractable. LICS Víctor Dalmau
2005	J	`jnl`	Linear Datalog and Bounded Path Duality of Relational Structures CoRR Víctor Dalmau
2005	J	`jnl`	Linear datalog and bounded path duality of relational structures. Log. Methods Comput. Sci. Víctor Dalmau
2005	J	`jnl`	Tractable Clones of Polynomials over Semigroups Electron. Colloquium Comput. Complex. Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
2005	A	`conf`	Tractable Clones of Polynomials over Semigroups. CP Víctor Dalmau, Ricard Gavaldà, Pascal Tesson, Denis Thérien
2004	A	`conf`	(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP Hubie Chen, Víctor Dalmau
2004	A*	`conf`	First-Order Definable Retraction Problems for Posets and Reflexive Graph. LICS Víctor Dalmau, Andrei A. Krokhin, Benoît Larose
2004	B	`conf`	Learnability of Relatively Quantified Generalized Formulas. ALT Andrei A. Bulatov, Hubie Chen, Víctor Dalmau
2004	A	`conf`	Looking Algebraically at Tractable Quantified Boolean Formulas. SAT Hubie Chen, Víctor Dalmau
2004	—	`conf`	Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers Hubie Chen, Víctor Dalmau
2004	J	`jnl`	Malt'sev Constraints made Simple Electron. Colloquium Comput. Complex. Víctor Dalmau
2004	J	`jnl`	The complexity of counting homomorphisms seen from the other side. Theor. Comput. Sci. Víctor Dalmau, Peter Jonsson
2003	A	`conf`	A Combinatorial Characterization of Resolution Width. CCC Albert Atserias, Víctor Dalmau
2003	B	`conf`	Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity. MFCS Víctor Dalmau, Daniel K. Ford
2003	J	`jnl`	Learnability of quantified formulas. Theor. Comput. Sci. Víctor Dalmau, Peter Jeavons
2003	A*	`conf`	Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. FOCS Andrei A. Bulatov, Víctor Dalmau
2002	J	`jnl`	A Combinatorial Characterization of Resolution Width Electron. Colloquium Comput. Complex. Albert Atserias, Víctor Dalmau
2002	—	`conf`	Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. AAAI/IAAI Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
2002	A*	`conf`	Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. ICALP Víctor Dalmau
2002	A	`conf`	Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi
2001	A*	`conf`	Phase Transitions of PP-Complete Satisfiability Problems. IJCAI Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis
2000	—	`conf`	A New Tractable Class of Constraint Satisfaction Problems. AI&M Víctor Dalmau
1999	J	`jnl`	A Dichotomy Theorem for Learning Quantified Boolean Formulas. Mach. Learn. Víctor Dalmau
1999	B	`conf`	Boolean Formulas are Hard to Learn for most Gate Bases. ALT Víctor Dalmau
1999	A	`conf`	Closure Functions and Width 1 Problems. CP Víctor Dalmau, Justin Pearson
1999	—	`conf`	Learnability of Quantified Formulas. EuroCOLT Víctor Dalmau, Peter Jeavons
1997	A*	`conf`	A Dichotomy Theorem for Learning Quantified Boolean Formulas. COLT Víctor Dalmau