DOI,IST REx ID,Research Group,Title of publication
10.1007/s11067-021-09517-w,9234,VlKo,New inertial projection methods for solving multivalued variational inequality problems beyond monotonicity
10.1007/s00025-021-01381-x,9315,VlKo,"New convergence results for inertial Krasnoselskii–Mann iterations in Hilbert spaces with applications"
null,9592,"GradSch,VlKo",Massively winning configurations in the convex grabbing game on the plane
10.1016/j.apnum.2020.06.009,8077,VlKo,Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence
10.1007/s11075-019-00758-y,6593,VlKo,An efficient projection-type method for monotone variational inequalities in Hilbert spaces
10.1007/s10957-019-01616-6,7161,VlKo,Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces
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.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.1109/cvpr.2018.00389,273,VlKo,Efficient optimization for rank-based loss functions
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.1007/978-3-319-74772-9_7,10864,VlKo,Absorption and directed Jónsson terms
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