Martin Dvorak
Graduate School
Kolmogorov Group
3 Publications
2024 | Journal Article | IST-REx-ID: 10045 | 
Dvorak, M., & Kolmogorov, V. (2024). Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. Springer Nature. https://doi.org/10.1007/s10107-024-02064-5
[Preprint]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 13120 |
Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 9592 |
Dvorak, M., & Nicholson, S. (n.d.). Massively winning configurations in the convex grabbing game on the plane. In Proceedings of the 33rd Canadian Conference on Computational Geometry. Halifax, NS, Canada.
[Submitted Version]
View
| Files available
| arXiv
3 Publications
2024 | Journal Article | IST-REx-ID: 10045 |
Dvorak, M., & Kolmogorov, V. (2024). Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. Springer Nature. https://doi.org/10.1007/s10107-024-02064-5
[Preprint]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 13120 |
Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 9592 |
Dvorak, M., & Nicholson, S. (n.d.). Massively winning configurations in the convex grabbing game on the plane. In Proceedings of the 33rd Canadian Conference on Computational Geometry. Halifax, NS, Canada.
[Submitted Version]
View
| Files available
| arXiv