DOI,IST REx ID,Research Group,Title of publication
10.1145/3230649,6032,VlKo,Even delta-matroids and the complexity of planar boolean CSPs
10.1109/TPAMI.2017.2730884,703,VlKo,Maximum persistency via iterative relaxed inference with graphical models
null,18,VlKo,Superconcentrators of density 25.3
10.1609/aaai.v32i1.12202,5978,VlKo,Exact MAP-inference by confining combinatorial search with LP relaxation
10.1137/1.9781611974782.20,1192,VlKo,Even delta-matroids and the complexity of planar Boolean CSPs
null,274,VlKo,A faster approximation algorithm for the Gibbs partition function
10.15479/AT:ISTA:57,5561,VlKo,Graph matching problems for annotating C. Elegans
10.1007/978-3-319-58771-4_26,641,VlKo,Graphical model parameter learning by inverse linear programming
10.1109/CVPR.2017.530,915,VlKo,A message passing algorithm for the minimum cost multicut problem
10.1109/CVPR.2017.747,916,VlKo,A study of lagrangean decompositions and dual ascent solvers for graph matching
10.1109/CVPR.2017.526,917,VlKo,A dual ascent framework for Lagrangean decomposition of combinatorial problems
10.1137/16M1091836,644,VlKo,The complexity of general-valued CSPs
10.1007/978-3-319-58771-4_19,646,VlKo,A novel convex relaxation for non binary discrete tomography
10.15479/AT:ISTA:th_815,992,VlKo,Complexity of constraint satisfaction
10.1109/FOCS.2016.88,1193,VlKo,Commutativity in the algorithmic Lovasz local lemma
10.1007/978-3-662-49896-5_13,1231,"KrPi,VlKo",On the complexity of scrypt and proofs of space in the parallel random oracle model
10.1142/S0218196716500430,1353,VlKo,Deciding absorption
10.1007/s00012-015-0358-8,1612,VlKo,CSP for binary conservative relational structures
10.15479/AT:ISTA:46,5557,VlKo,Synthetic discrete tomography problems
10.1007/s00453-015-0017-7,1794,VlKo,Inference algorithms for pattern-based CRFs on sequence data