Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

Jeferson Zapata

Ivan Sergeev

Martin Dvorak

Vladimir Kolmogorov

Yekini Shehu

Rustem Takhanov

Neel Shah

Alexandr Kazda

Paul Swoboda

Nasim Samei

Senanayak Karri

Michal Rolinek



75 Publications

2019 | Conference Paper | IST-REx-ID: 7639
Function norms for neural networks
A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.
View | DOI | WoS
 
2018 | Journal Article | IST-REx-ID: 703 | OA
Maximum persistency via iterative relaxed inference with graphical models
A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 10864 | OA
Absorption and directed Jónsson terms
A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273 | OA
Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 5975 | OA
Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Exact MAP-inference by confining combinatorial search with LP relaxation
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 18 | OA
Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 6032 | OA
Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Research Data | IST-REx-ID: 5573 | OA
Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow
H. Alhaija, A. Sellent, D. Kondermann, C. Rother, (2018).
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 641
Graphical model parameter learning by inverse linear programming
V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 644 | OA
The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2017 | Conference Paper | IST-REx-ID: 646 | OA
A novel convex relaxation for non binary discrete tomography
J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Thesis | IST-REx-ID: 992 | OA
Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Conference Paper | IST-REx-ID: 915 | OA
A message passing algorithm for the minimum cost multicut problem
P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
A dual ascent framework for Lagrangean decomposition of combinatorial problems
P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Conference Paper | IST-REx-ID: 274 | OA
A faster approximation algorithm for the Gibbs partition function
V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249.
[Published Version] View | Files available | arXiv
 
2017 | Research Data | IST-REx-ID: 5561 | OA
Graph matching problems for annotating C. Elegans
D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017).
[Published Version] View | Files available | DOI
 

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed