Rendering Real-World Objects without 3-D Model. - Tomás Werner; Roger D. Hersch; Václav Hlavác (CAIP, 1995)

Rendering Real-World Objects Using View Interpolation. - Tomás Werner; Roger D. Hersch; Václav Hlavác (ICCV, 1995)

Automatic Selection of Reference Views for Image-Based Scene Representations. - Václav Hlavác; Ales Leonardis; Tomás Werner (ECCV (1), 1996)

Selection of reference views for image-based representation. - Tomás Werner; Václav Hlavác; Ales Leonardis; Tomás Pajdla (ICPR, 1996)

Choosing Reference Views for Image-Based Representation. - Tomás Werner; Václav Hlavác; Ales Leonardis; Tomás Pajdla (SOFSEM, 1996)

Efficient 3-D Scene Visualization by Image Extrapolation. - Tomás Werner; Tomás Pajdla; Václav Hlavác (ECCV (2), 1998)

Efficient rendering of projective model for image-based visualization. - Tomás Werner; Tomás Pajdla; Václav Hlavác (ICPR, 1998)

Oriented Matching Constraints. - Tomás Werner; Tomás Pajdla (BMVC, 2001)

Cheirality in Epipolar Geometry. - Tomás Werner; Tomás Pajdla (ICCV, 2001)

Model selection for automated reconstruction from multiple views. - Tomás Werner; Andrew Zisserman (BMVC, 2002)

New Techniques for Automated Architectural Reconstruction from Photographs. - Tomás Werner; Andrew Zisserman (ECCV (2), 2002)

Automated reconstruction from multiple photographs. - Frederik Schaffalitzky; Andrew Zisserman; Tomás Werner; Andrew W. Fitzgibbon (ICIP (3), 2002)

Selection of Reference Images for Image-Based Scene Representations. - Tomás Werner; Tomás Pajdla; Václav Hlavác; Ales Leonardis; Martin Matousek (Computing, 2002)

Joint Orientation of Epipoles. - Ondrej Chum; Tomás Werner; Tomás Pajdla (BMVC, 2003)

Constraint on Five Points in Two Images. - Tomás Werner (CVPR (2), 2003)

Combinatorial Constraints on Multiple Projections of a Set of Points. - Tomás Werner (ICCV, 2003)

Epipolar Geometry Estimation via RANSAC Benefits from the Oriented Epipolar Constraint. - Ondrej Chum; Tomás Werner; Jiri Matas (ICPR (1), 2004)

Two-View Geometry Estimation Unaffected by a Dominant Plane. - Ondrej Chum; Tomás Werner; Jiri Matas (CVPR (1), 2005)

What is decreased by the max-sum arc consistency algorithm? - Tomás Werner (ICML, 2007)

A Linear Programming Approach to Max-Sum Problem: A Review. - Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2007)

A discrete search method for multi-modal non-rigid image registration. - Alexander Shekhovtsov; Juan D. García-Arteaga; Tomás Werner (CVPR Workshops, 2008)

High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). - Tomás Werner (CVPR, 2008)

Primal View on Belief Propagation. - Tomás Werner (UAI, 2010)

Soft arc consistency revisited. - Martin C. Cooper; Simon de Givry; Martí Sánchez-Fibla; Thomas Schiex; Matthias Zytnicki; Tomás Werner (Artif. Intell., 2010)

Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction. - Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2010)

Zero-Temperature Limit of a Convergent Algorithm to Minimize the Bethe Free Energy - Tomás Werner (CoRR, 2011)

Fast Detection of Multiple Textureless 3-D Objects. - Hongping Cai; Tomás Werner; Jiri Matas (ICVS, 2013)

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem? - Daniel Prusa; Tomás Werner (EMMCVPR, 2014)

Universality of the Local Marginal Polytope. - Daniel Prusa; Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings. - Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP. - Daniel Prusa; Tomás Werner (SODA, 2017)

On Coordinate Minimization of Convex Piecewise-Affine Functions. - Tomás Werner (CoRR, 2017)

LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program. - Daniel Prusa; Tomás Werner (IEEE Trans. Pattern Anal. Mach. Intell., 2017)

Relative Interior Rule in Block-Coordinate Minimization. - Tomás Werner; Daniel Prusa (CoRR, 2019)

Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program. - Daniel Prusa; Tomás Werner (SIAM J. Optim., 2019)

Bounding Linear Programs by Constraint Propagation: Application to Max-SAT. - Tomás Dlask; Tomás Werner (CP, 2020)

On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs. - Tomás Dlask; Tomás Werner (CP, 2020)

Relative Interior Rule in Block-Coordinate Descent. - Tomás Werner; Daniel Prusa; Tomás Dlask (CVPR, 2020)

A Class of Linear Programs Solvable by Coordinate-Wise Minimization. - Tomás Dlask; Tomás Werner (LION, 2020)

Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations. - Tomás Dlask; Tomás Werner; Simon de Givry (CP, 2021)

Classes of linear programs solvable by coordinate-wise minimization. - Tomás Dlask; Tomás Werner (Ann. Math. Artif. Intell., 2022)

Virtual Pairwise Consistency in Cost Function Networks. - Pierre Montalbano; David Allouche; Simon de Givry; George Katsirelos; Tomás Werner (CPAIOR, 2023)

Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs. - Tomás Dlask; Tomás Werner (Constraints An Int. J., 2023)

Super-reparametrizations of weighted CSPs: properties and optimization perspective. - Tomás Dlask; Tomás Werner; Simon de Givry (Constraints An Int. J., 2023)

Convergence of Some Convex Message Passing Algorithms to a Fixed Point. - Václav Vorácek; Tomás Werner (ICML, 2024)

Using Constraint Propagation to Bound Linear Programs. - Tomás Dlask; Tomás Werner (J. Artif. Intell. Res., 2024)