Alexandr Kazda
Kolmogorov Group
4 Publications
2019 | Journal Article | IST-REx-ID: 6032 
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, 2019.
View
| DOI
| Download (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 1192
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View
| DOI
| Download (ext.)
2016 | Journal Article | IST-REx-ID: 1612
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1, pp. 75–84, 2016.
View
| DOI
| Download (ext.)
2016 | Journal Article | IST-REx-ID: 1353
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5, pp. 1033–1060, 2016.
View
| DOI
| Download (ext.)
4 Publications
2019 | Journal Article | IST-REx-ID: 6032
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, 2019.
View
| DOI
| Download (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 1192
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View
| DOI
| Download (ext.)
2016 | Journal Article | IST-REx-ID: 1612
A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1, pp. 75–84, 2016.
View
| DOI
| Download (ext.)
2016 | Journal Article | IST-REx-ID: 1353
L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5, pp. 1033–1060, 2016.
View
| DOI
| Download (ext.)