Computing Visual Correspondence with Occlusions via Graph Cuts. - Vladimir Kolmogorov; Ramin Zabih (ICCV, 2001)

Multi-camera Scene Reconstruction via Graph Cuts. - Vladimir Kolmogorov; Ramin Zabih (ECCV (3), 2002)

Generalized Multi-camera Scene Reconstruction Using Graph Cuts. - Vladimir Kolmogorov; Ramin Zabih; Steven J. Gortler (EMMCVPR, 2003)

Computing Geodesics and Minimal Surfaces via Graph Cuts. - Yuri Boykov; Vladimir Kolmogorov (ICCV, 2003)

Visual Correspondence Using Energy Minimization and Mutual Information. - Junhwan Kim; Vladimir Kolmogorov; Ramin Zabih (ICCV, 2003)

Spatially Coherent Clustering Using Graph Cuts. - Ramin Zabih; Vladimir Kolmogorov (CVPR (2), 2004)

An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. - Yuri Boykov; Vladimir Kolmogorov (IEEE Trans. Pattern Anal. Mach. Intell., 2004)

What Energy Functions Can Be Minimized via Graph Cuts? - Vladimir Kolmogorov; Ramin Zabih (IEEE Trans. Pattern Anal. Mach. Intell., 2004)

"GrabCut": interactive foreground extraction using iterated graph cuts. - Carsten Rother; Vladimir Kolmogorov; Andrew Blake 001 (ACM Trans. Graph., 2004)

Graph Based Algorithms for Scene Reconstruction from Two or More Views. - Vladimir Kolmogorov (2004)

Bi-Layer Segmentation of Binocular Stereo Video. - Vladimir Kolmogorov; Antonio Criminisi; Andrew Blake 001; Geoffrey Cross; Carsten Rother (CVPR (2), 2005)

Digital Tapestry. - Carsten Rother; Sanjiv Kumar; Vladimir Kolmogorov; Andrew Blake 001 (CVPR (1), 2005)

What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux. - Vladimir Kolmogorov; Yuri Boykov (ICCV, 2005)

Fusion of Stereo, Colour and Contrast. - Andrew Blake 001; Antonio Criminisi; Geoffrey Cross; Vladimir Kolmogorov; Carsten Rother (ISRR, 2005)

On the Optimality of Tree-reweighted Max-product Message-passing. - Vladimir Kolmogorov; Martin J. Wainwright (UAI, 2005)

Graph Cut Algorithms for Binocular Stereo with Occlusions. - Vladimir Kolmogorov; Ramin Zabih (Handbook of Mathematical Models in Computer Vision, 2006)

Bilayer Segmentation of Live Video. - Antonio Criminisi; Geoffrey Cross; Andrew Blake 001; Vladimir Kolmogorov (CVPR (1), 2006)

Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs. - Carsten Rother; Thomas P. Minka; Andrew Blake 001; Vladimir Kolmogorov (CVPR (1), 2006)

An Integral Solution to Surface Evolution PDEs Via Geo-cuts. - Yuri Boykov; Vladimir Kolmogorov; Daniel Cremers; Andrew Delong (ECCV (3), 2006)

Comparison of Energy Minimization Algorithms for Highly Connected Graphs. - Vladimir Kolmogorov; Carsten Rother (ECCV (2), 2006)

A Comparative Study of Energy Minimization Methods for Markov Random Fields. - Richard Szeliski; Ramin Zabih; Daniel Scharstein; Olga Veksler; Vladimir Kolmogorov; Aseem Agarwala; Marshall F. Tappen; Carsten Rother (ECCV (2), 2006)

Convergent Tree-Reweighted Message Passing for Energy Minimization. - Vladimir Kolmogorov (IEEE Trans. Pattern Anal. Mach. Intell., 2006)

Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation. - Vladimir Kolmogorov; Antonio Criminisi; Andrew Blake 001; Geoffrey Cross; Carsten Rother (IEEE Trans. Pattern Anal. Mach. Intell., 2006)

Optimizing Binary MRFs via Extended Roof Duality. - Carsten Rother; Vladimir Kolmogorov; Victor S. Lempitsky; Martin Szummer (CVPR, 2007)

Applications of parametric maxflow in computer vision. - Vladimir Kolmogorov; Yuri Boykov; Carsten Rother (ICCV, 2007)

An Analysis of Convex Relaxations for MAP Estimation. - Pawan Kumar Mudigonda; Vladimir Kolmogorov; Philip H. S. Torr (NIPS, 2007)

Minimizing Nonsubmodular Functions with Graph Cuts-A Review. - Vladimir Kolmogorov; Carsten Rother (IEEE Trans. Pattern Anal. Mach. Intell., 2007)

Graph cut based image segmentation with connectivity priors. - Sara Vicente; Vladimir Kolmogorov; Carsten Rother (CVPR, 2008)

Feature Correspondence Via Graph Matching: Models and Global Optimization. - Lorenzo Torresani; Vladimir Kolmogorov; Carsten Rother (ECCV (2), 2008)

On partial optimality in multi-label MRFs. - Pushmeet Kohli; Alexander Shekhovtsov; Carsten Rother; Vladimir Kolmogorov; Philip H. S. Torr (ICML, 2008)

Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation. - Vladimir Kolmogorov; Antonio Criminisi; Andrew Blake 001; Geoffrey Cross; Carsten Rother (Int. J. Comput. Vis., 2008)

A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors. - Richard Szeliski; Ramin Zabih; Daniel Scharstein; Olga Veksler; Vladimir Kolmogorov; Aseem Agarwala; Marshall F. Tappen; Carsten Rother (IEEE Trans. Pattern Anal. Mach. Intell., 2008)

Joint optimization of segmentation and appearance models. - Sara Vicente; Vladimir Kolmogorov; Carsten Rother (ICCV, 2009)

A global perspective on MAP inference for low-level vision. - Oliver J. Woodford; Carsten Rother; Vladimir Kolmogorov (ICCV, 2009)

New algorithms for convex cost tension problem with application to computer vision. - Vladimir Kolmogorov; Akiyoshi Shioura (Discret. Optim., 2009)

An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs. - M. Pawan Kumar; Vladimir Kolmogorov; Philip H. S. Torr (J. Mach. Learn. Res., 2009)

Blossom V: a new implementation of a minimum cost perfect matching algorithm. - Vladimir Kolmogorov (Math. Program. Comput., 2009)

Cosegmentation Revisited: Models and Optimization. - Sara Vicente; Vladimir Kolmogorov; Carsten Rother (ECCV (2), 2010)

A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph. - Vladimir Kolmogorov (Algorithmica, 2010)

The complexity of conservative finite-valued CSPs - Vladimir Kolmogorov; Stanislav Zivný (CoRR, 2010)

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms - Vladimir Kolmogorov; Stanislav Zivný (CoRR, 2010)

A dichotomy theorem for conservative general-valued CSPs - Vladimir Kolmogorov (CoRR, 2010)

Team coverage games. - Yoram Bachrach; Pushmeet Kohli; Vladimir Kolmogorov (AAMAS, 2011)

Submodular decomposition framework for inference in associative Markov networks with global constraints. - Anton Osokin; Dmitry P. Vetrov; Vladimir Kolmogorov (CVPR, 2011)

Object cosegmentation. - Sara Vicente; Carsten Rother; Vladimir Kolmogorov (CVPR, 2011)

Dynamic Tree Block Coordinate Ascent. - Daniel Tarlow; Dhruv Batra; Pushmeet Kohli; Vladimir Kolmogorov (ICML, 2011)

Submodularity on a Tree: Unifying $L^ atural$ -Convex and Bisubmodular Functions. - Vladimir Kolmogorov (MFCS, 2011)

Optimal Coalition Structures in Graph Games - Yoram Bachrach; Pushmeet Kohli; Vladimir Kolmogorov; Morteza Zadimoghaddam (CoRR, 2011)

Towards Minimizing k-Submodular Functions. - Anna Huber; Vladimir Kolmogorov (ISCO, 2012)

Generalized sequential tree-reweighted message passing - Vladimir Kolmogorov; Thomas Schoenemann (CoRR, 2012)

The power of linear programming for valued CSPs: a constructive characterization - Vladimir Kolmogorov (CoRR, 2012)

Generalized roof duality and bisubmodular functions. - Vladimir Kolmogorov (Discret. Appl. Math., 2012)

Minimizing a sum of submodular functions. - Vladimir Kolmogorov (Discret. Appl. Math., 2012)

Optimal Coalition Structure Generation in Cooperative Graph Games. - Yoram Bachrach; Pushmeet Kohli; Vladimir Kolmogorov; Morteza Zadimoghaddam (AAAI, 2013)

Computing the M Most Probable Modes of a Graphical Model. - Chao Chen 012; Vladimir Kolmogorov; Yan Zhu 009; Dimitris N. Metaxas; Christoph H. Lampert (AISTATS, 2013)

The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. - Vladimir Kolmogorov (ICALP (1), 2013)

Potts Model, Parametric Maxflow and K-Submodular Functions. - Igor Gridchyn; Vladimir Kolmogorov (ICCV, 2013)

Partial Enumeration and Curvature Regularization. - Carl Olsson; Johannes Ulén; Yuri Boykov; Vladimir Kolmogorov (ICCV, 2013)

Reweighted message passing revisited. - Vladimir Kolmogorov (CoRR, 2013)

Proofs of Space. - Stefan Dziembowski; Sebastian Faust; Vladimir Kolmogorov; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2013)

The complexity of conservative valued CSPs. - Vladimir Kolmogorov; Stanislav Zivný (J. ACM, 2013)

A Dual Decomposition Approach to Feature Correspondence. - Lorenzo Torresani; Vladimir Kolmogorov; Carsten Rother (IEEE Trans. Pattern Anal. Mach. Intell., 2013)

Tree-Reweighted Message Passing. - Vladimir Kolmogorov (Tractability, 2014)

Proceedings of The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM), 2014. - Vladimir Kolmogorov; Christoph H. Lampert; Emilie Morvant; Rustem Takhanov (CoRR, 2014)

A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Structural SVMs with a Costly max-Oracle. - Neel Shah; Vladimir Kolmogorov; Christoph H. Lampert (CoRR, 2014)

Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm. - Vladimir Kolmogorov; Pascal Monasse; Pauline Tan (Image Process. Line, 2014)

A multi-plane block-coordinate frank-wolfe algorithm for training structural SVMs with a costly max-oracle. - Neel Shah; Vladimir Kolmogorov; Christoph H. Lampert (CVPR, 2015)

Effectiveness of Structural Restrictions for Hybrid CSPs. - Vladimir Kolmogorov; Michal Rolínek; Rustem Takhanov (ISAAC, 2015)

Commutativity in the Random Walk formulation of the Lovasz Local Lemma. - Vladimir Kolmogorov (CoRR, 2015)

A New Look at Reweighted Message Passing. - Vladimir Kolmogorov (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

The Power of Linear Programming for General-Valued CSPs. - Vladimir Kolmogorov; Johan Thapper; Stanislav Zivný (SIAM J. Comput., 2015)

Inference Algorithms for Pattern-Based CRFs on Sequence Data. - Vladimir Kolmogorov; Rustem Takhanov (Algorithmica, 2016)

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. - Joël Alwen; Binyi Chen; Chethan Kamath; Vladimir Kolmogorov; Krzysztof Pietrzak; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

Total Variation on a Tree. - Vladimir Kolmogorov; Thomas Pock; Michal Rolínek (SIAM J. Imaging Sci., 2016)

The Complexity of General-Valued CSPs. - Vladimir Kolmogorov; Andrei A. Krokhin; Michal Rolínek (SIAM J. Comput., 2017)

A Faster Approximation Algorithm for the Gibbs Partition Function. - Vladimir Kolmogorov (COLT, 2018)

Efficient Optimization for Rank-Based Loss Functions. - Pritish Mohapatra; Michal Rolínek; C. V. Jawahar; Vladimir Kolmogorov; M. Pawan Kumar (CVPR, 2018)

Superconcentrators of Density 25.3. - Vladimir Kolmogorov; Michal Rolínek (Ars Comb., 2018)

Commutativity in the Algorithmic Lovász Local Lemma. - Vladimir Kolmogorov (SIAM J. Comput., 2018)

MAP Inference via Block-Coordinate Frank-Wolfe Algorithm. - Paul Swoboda; Vladimir Kolmogorov (CVPR, 2019)

Testing the Complexity of a Valued CSP Language. - Vladimir Kolmogorov (ICALP, 2019)

Function Norms for Neural Networks. - Amal Rannen-Triki; Maxim Berman; Vladimir Kolmogorov; Matthew B. Blaschko (ICCV Workshops, 2019)

A Local Lemma for Focused Stochastic Algorithms. - Dimitris Achlioptas; Fotis Iliopoulos; Vladimir Kolmogorov (SIAM J. Comput., 2019)

Even Delta-Matroids and the Complexity of Planar Boolean CSPs. - Alexandr Kazda; Vladimir Kolmogorov; Michal Rolínek (ACM Trans. Algorithms, 2019)

Practical Frank-Wolfe algorithms. - Vladimir Kolmogorov (CoRR, 2020)

A New Notion of Commutativity for the Algorithmic Lovász Local Lemma. - David G. Harris 001; Fotis Iliopoulos; Vladimir Kolmogorov (APPROX-RANDOM, 2021)

One-sided Frank-Wolfe algorithms for saddle problems. - Vladimir Kolmogorov; Thomas Pock (ICML, 2021)

A computational study of Gomory-Hu tree algorithms. - Vladimir Kolmogorov (CoRR, 2022)

OrderedCuts: A new approach for computing Gomory-Hu tree. - Vladimir Kolmogorov (CoRR, 2022)

Combining pattern-based CRFs and weighted context-free grammars. - Rustem Takhanov; Vladimir Kolmogorov (Intell. Data Anal., 2022)

Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions. - Vladimir Kolmogorov (CVPR, 2023)

A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut. - Vladimir Kolmogorov (SPAA, 2024)

Verifying feasibility of degenerate semidefinite programs. - Vladimir Kolmogorov; Simone Naldi; Jeferson Zapata (CoRR, 2024)

Duality theory in linear optimization and its extensions - formally verified. - Martin Dvorak; Vladimir Kolmogorov (CoRR, 2024)

Bounded indegree k-forests problem and a faster algorithm for directed graph augmentation. - Pavel A. Arkhipov; Vladimir Kolmogorov (CoRR, 2024)

A faster algorithm for the k-forest problem: breaking the Ok(n3/2) complexity barrier. - Pavel A. Arkhipov; Vladimir Kolmogorov (CoRR, 2024)

Certifying Solutions of Degenerate Semidefinite Programs. - Vladimir Kolmogorov; Simone Naldi; Jeferson Zapata (SIAM J. Optim., 2025)

Generalized minimum 0-extension problem and discrete convexity. - Martin Dvorak; Vladimir Kolmogorov (Math. Program., 2025)

Parameter Estimation for Gibbs Distributions. - David G. Harris 001; Vladimir Kolmogorov (ACM Trans. Algorithms, 2025)

Simple parallel estimation of the partition ratio for Gibbs distributions. - David G. Harris 001; Vladimir Kolmogorov (CoRR, 2025)