default search action
Michal Rolínek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c16]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: 6310-6320 - [c15]Anselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos, Georg Martius:
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints. ICML 2021: 8443-8453 - [c14]Marin Vlastelica P., Michal Rolínek, Georg Martius:
Neuro-algorithmic Policies Enable Fast Combinatorial Generalization. ICML 2021: 10575-10585 - [c13]Dominik Zietlow, Michal Rolínek, Georg Martius:
Demystifying Inductive Biases for (Beta-)VAE Based Architectures. ICML 2021: 12945-12954 - [c12]Marco Bagatella, Miroslav Olsák, Michal Rolínek, Georg Martius:
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. NeurIPS 2021: 24707-24718 - [i18]Dominik Zietlow, Michal Rolínek, Georg Martius:
Demystifying Inductive Biases for β-VAE Based Architectures. CoRR abs/2102.06822 (2021) - [i17]Marin Vlastelica Pogancic, Michal Rolínek, Georg Martius:
Neuro-algorithmic Policies enable Fast Combinatorial Generalization. CoRR abs/2102.07456 (2021) - [i16]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 abs/2105.02343 (2021) - [i15]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. CoRR abs/2108.10606 (2021) - [i14]Marco Bagatella, Mirek Olsák, Michal Rolínek, Georg Martius:
Planning from Pixels in Environments with Combinatorially Hard Search Spaces. CoRR abs/2110.06149 (2021) - 2020
- [c11]Cristina Pinneri, Shambhuraj Sawant, Sebastian Blaes, Jan Achterhold
, Joerg Stueckler, Michal Rolínek, Georg Martius:
Sample-efficient Cross-Entropy Method for Real-time Planning. CoRL 2020: 1049-1065 - [c10]Michal Rolínek, Vít Musil
Optimizing Rank-Based Metrics With Blackbox Differentiation. CVPR 2020: 7617-7627 - [c9]Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. ECCV (28) 2020: 407-424 - [c8]Marin Vlastelica Pogancic, Anselm Paulus, Vít Musil, Georg Martius
Differentiation of Blackbox Combinatorial Solvers. ICLR 2020 - [i13]Michal Rolínek, Paul Swoboda, Dominik Zietlow, Anselm Paulus, Vít Musil, Georg Martius:
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. CoRR abs/2003.11657 (2020) - [i12]Cristina Pinneri, Shambhuraj Sawant, Sebastian Blaes, Jan Achterhold, Jörg Stückler, Michal Rolínek, Georg Martius:
Sample-efficient Cross-Entropy Method for Real-time Planning. CoRR abs/2008.06389 (2020)
2010 – 2019
- 2019
- [j4]Alexandr Kazda
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. ACM Trans. Algorithms 15(2): 22:1-22:33 (2019) - [c7]Michal Rolínek, Dominik Zietlow, Georg Martius:
Variational Autoencoders Pursue PCA Directions (by Accident). CVPR 2019: 12406-12415 - [i11]Marin Vlastelica P., Anselm Paulus, Vít Musil, Georg Martius, Michal Rolínek:
Differentiation of Blackbox Combinatorial Solvers. CoRR abs/1912.02175 (2019) - [i10]Michal Rolínek, Vít Musil, Anselm Paulus, Marin Vlastelica P., Claudio Michaelis, Georg Martius:
Optimizing Rank-based Metrics with Blackbox Differentiation. CoRR abs/1912.03500 (2019) - 2018
- [j3]Vladimir Kolmogorov, Michal Rolínek:
Superconcentrators of Density 25.3. Ars Comb. 141: 269-304 (2018) - [c6]Joël Alwen, Peter Gazi, Chethan Kamath
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS 2018: 51-65 - [c5]Pritish Mohapatra, Michal Rolínek, C. V. Jawahar
Efficient Optimization for Rank-Based Loss Functions. CVPR 2018: 3693-3701 - [c4]Michal Rolínek, Georg Martius:
L4: Practical loss-based stepsize adaptation for deep learning. NeurIPS 2018: 6434-6444 - [i9]Michal Rolínek, Georg Martius:
L4: Practical loss-based stepsize adaptation for deep learning. CoRR abs/1802.05074 (2018) - [i8]Michal Rolínek, Dominik Zietlow, Georg Martius:
Variational Autoencoders Pursue PCA Directions (by Accident). CoRR abs/1812.06775 (2018) - 2017
- [j2]Vladimir Kolmogorov, Andrei A. Krokhin
The Complexity of General-Valued CSPs. SIAM J. Comput. 46(3): 1087-1110 (2017) - [c3]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SODA 2017: 307-326 - 2016
- [j1]Vladimir Kolmogorov, Thomas Pock, Michal Rolínek:
Total Variation on a Tree. SIAM J. Imaging Sci. 9(2): 605-636 (2016) - [i7]Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. CoRR abs/1602.03124 (2016) - [i6]Pritish Mohapatra, Michal Rolínek, C. V. Jawahar, Vladimir Kolmogorov, M. Pawan Kumar:
Efficient Optimization for Rank-based Loss Functions. CoRR abs/1604.08269 (2016) - [i5]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: 783 (2016) - 2015
- [c2]Vladimir Kolmogorov, Andrei A. Krokhin
The Complexity of General-Valued CSPs. FOCS 2015: 1246-1258 - [c1]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov
Effectiveness of Structural Restrictions for Hybrid CSPs. ISAAC 2015: 566-577 - [i4]Vladimir Kolmogorov, Andrei A. Krokhin, Michal Rolínek:
The Complexity of General-Valued CSPs. CoRR abs/1502.07327 (2015) - [i3]Vladimir Kolmogorov, Thomas Pock, Michal Rolínek:
Total variation on a tree. CoRR abs/1502.07770 (2015) - [i2]Vladimir Kolmogorov, Michal Rolínek, Rustem Takhanov:
Effectiveness of Structural Restrictions for Hybrid CSPs. CoRR abs/1504.07067 (2015) - 2014
- [i1]Vladimir Kolmogorov, Michal Rolínek:
Superconcentrators of Density 25.3. CoRR abs/1405.7828 (2014) - 2013
- [b2]Titu Andreescu, Michal Rolínek, Josef Tkadlec:
106 Geometry Problems - From The AwesomeMath Summer Program. XYZ Press 2013, ISBN 978-0-9799269-4-5, pp. I-VIII, 1-174 - [b1]Titu Andreescu, Michal Rolínek, Josef Tkadlec:
107 Geometry Problems - From The AwesomeMath Year-Round Program. XYZ Press 2013, ISBN 978-0-9799269-7-6, pp. I-VIII, 1-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: