Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2019). Parameterized Complexity of Asynchronous Border Minimization. Algorithmica, 81(1), 201–223. https://doi.org/10.1007/s00453-018-0442-5 ( reposiTUm)

Ganian, R., Hliněný, P., Langer, A., Obdržálek, J., Rossmanith, P., & Sikdar, S. (2014). Lower bounds on the complexity of MSO₁ model-checking. Journal of Computer and System Sciences, 80(1), 180–194. https://doi.org/10.1016/j.jcss.2013.07.005 ( reposiTUm)

Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., & Rossmanith, P. (2014). Digraph Width Measures in Parameterized Algorithmics. Discrete Applied Mathematics, 168, 88–107. https://doi.org/10.1016/j.dam.2013.10.038 ( reposiTUm)

Bova, S., Ganian, R., & Szeider, S. (2014). Model Checking Existential Logic on Partially Ordered Sets. In CSL-LICS 2014. Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vienna, Austria. ACM New York, NY, USA. http://hdl.handle.net/20.500.12708/55811 ( reposiTUm)

Bova, S., Ganian, R., & Szeider, S. (2014). Quantified Conjunctive Queries on Partially Ordered Sets. In IPEC 2014 (pp. 122–134). LNCS / Springer. http://hdl.handle.net/20.500.12708/55812 ( reposiTUm)