Victor Dalmau

vdalmau's picture

Victor Dalmau is an Associate Professor in the Department of Information and Communication Technologies at Universitat Pompeu Fabra (UPF).

He was born in Sudanell (Spain) in 1971. He obtained a degree and a Ph.D on Computer Science at Universitat Politécnica de Catalunya (Spain). After his Ph.D.,he worked at Universidad de Zaragoza (Spain) in 2000 and at the University of California, Santa Cruz (USA) in 2001. Since then he has been at UPF, first as a post-doc fellow, and, since 2007, as an Associate Professor. He has held research visitor positions at Royal Holloway, University of London (Egham, UK), University of Oxford (Oxford, UK), Simon Fraser University (Vancouver, Canada), University of Durham (Durham, UK), Newton Institute (Cambridge, UK), Charles University (Praga, Czech Republic), Humbold Universitat zu Berlin (Berlin, Germany), Ecole Polytechnique (Paris, France), and Fields Institute for Research in Mathematical Sciences (Toronto, Canada).

Victor Dalmau' main research is on Constraint satisfaction, which is the problem of deciding whether there exists an assignment of values to variables satisfying some given restrictions. The framework is general enough to express many common problems in areas such as logistics, computer vision, scheduling, and artificial intelligence, to name only a few. His work focuses on the theoretical aspects of the problem, involving techniques and concepts coming from areas as diverse as combinatorics, logic, database theory and universal algebra. He is also interested broadly in complexity theory, logic in computer science, and computational learning theory.

Publications

V. Dalmau, Kozik, M., Krokhin, A., Makarychev, K., Makarychev, Y., and Oprsal, J., Robust Algorithms with Polynomial Loss for Near-unanimity CSPs, in Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA'17), 2017, pp. 340-357.
V. Dalmau, Krokhin, A., and Manokaran, R., Towards a characterization of constant-factor approximable Min CSPs, in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, pp. 847–857.
Bten Cate and Dalmau, V., The Product Homomorphism Problem and Applications, 18th International Conference on Database Theory (ICDT 2015), 2015.
V. Dalmau, Egri, L., Hell, P., Larose, B., and Rafiey, A., Descriptive Complexity of List H-coloring Problems in Logspace: a Refined Dichotomy, in Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015.
H. Chen, Dalmau, V., and Grußien, B., Arc consistency and friends, J. Log. Comput., vol. 23, pp. 87-108, 2013.
Bten Cate, Dalmau, V., and Kolaitis, P. G., Learning schema mappings, ACM Trans. Database Syst., vol. 38, p. 28, 2013.

Pages