Michal Rolínek

Publication Activity (10 Years)

Years Active: 2015-2021
Publications (10 Years): 17

Top Topics

Integer Programming

Neighboring Pixels

Inexact Graph Matching

Top Venues

IACR Cryptol. ePrint Arch.

ACM Trans. Algorithms

Publications

Marco Bagatella, Miroslav Olsák, Michal Rolínek, Georg Martius
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. NeurIPS (2021)
Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos, Georg Martius
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. CoRR (2021)
Marin Vlastelica Pogancic, Michal Rolínek, Georg Martius
Neuro-algorithmic Policies enable Fast Combinatorial Generalization. CoRR (2021)
Andrea Hornáková, Timo Kaiser, Paul Swoboda, Michal Rolínek, Bodo Rosenhahn, Roberto Henschel
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths. ICCV (2021)
Marco Bagatella, Mirek Olsák, Michal Rolínek, Georg Martius
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. CoRR (2021)
Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. CoRR (2020)
Michal Rolínek, Vít Musil, Anselm Paulus, Marin Vlastelica P., Claudio Michaelis, Georg Martius
Optimizing Rank-Based Metrics With Blackbox Differentiation. CVPR (2020)
Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. ECCV (28) (2020)
Marin Vlastelica P., Anselm Paulus, Vít Musil, Georg Martius, Michal Rolínek
Differentiation of Blackbox Combinatorial Solvers. CoRR (2019)
Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. ACM Trans. Algorithms 15 (2) (2019)
Michal Rolínek, Vít Musil, Anselm Paulus, Marin Vlastelica P., Claudio Michaelis, Georg Martius
Optimizing Rank-based Metrics with Blackbox Differentiation. CoRR (2019)
Pritish Mohapatra, Michal Rolínek, C. V. Jawahar, Vladimir Kolmogorov, M. Pawan Kumar
Efficient Optimization for Rank-Based Loss Functions. CVPR (2018)
Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek
The Complexity of General-Valued CSPs. SIAM J. Comput. 46 (3) (2017)
Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SODA (2017)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. CoRR (2016)
Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov
Effectiveness of Structural Restrictions for Hybrid CSPs. ISAAC (2015)