DOI,IST REx ID,Research Group,Title of publication
10.1007/s40314-019-0955-9,7000,VlKo,Convergence analysis of projection method for variational inequalities
10.1137/16m109332x,7412,VlKo,A local lemma for focused stochastical algorithms
10.1109/CVPR.2019.01140,7468,VlKo,Map inference via block-coordinate Frank-Wolfe algorithm
10.1109/ICCVW.2019.00097,7639,VlKo,Function norms for neural networks
10.1007/s00025-019-1061-4,6596,VlKo,Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces
10.4230/LIPICS.ICALP.2019.77,6725,VlKo,Testing the complexity of a valued CSP language
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.1145/3196494.3196534,193,"KrPi,HeEd,VlKo",On the memory hardness of data independent password hashing functions
10.15479/AT:ISTA:82,5573,VlKo,"Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow"
10.1137/16m1093306,5975,VlKo,Commutativity in the algorithmic Lovász local lemma
null,5978,VlKo,Exact MAP-inference by confining combinatorial search with LP relaxation
10.1145/3230649,6032,VlKo,Even delta-matroids and the complexity of planar boolean CSPs
10.1007/978-3-319-74772-9_7,10864,VlKo,Absorption and directed Jónsson terms
10.1109/cvpr.2018.00389,273,VlKo,Efficient optimization for rank-based loss functions
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.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