Výpis publikací

BALABÁN, Jakub, Robert GANIAN a Mathis ROCTON. Computing Twin-Width Parameterized by the Feedback Edge Number. In Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel. 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik, 2024, s. 1-19. ISBN 978-3-95977-311-9. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2024.7.

BALABÁN, Jakub, Robert GANIAN a Mathis ROCTON. Twin-Width Meets Feedback Edges and Vertex Integrity. In International Symposium on Parameterized and Exact Computation (IPEC). 2024, s. 1-22.

GANIAN, Robert, Filip POKRÝVKA, André SCHIDLER, Kirill SIMONOV a Stefan SZEIDER. Weighted Model Counting with Twin-Width. Online. In Meel, Kuldeep S. and Strichman, Ofer. 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2022, s. "15:1"-"15:17", 17 s. ISBN 978-3-95977-242-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.SAT.2022.15.

GANIAN, Robert, Sebastian ORDYNIAK a Stefan SZEIDER. A Join-Based Hybrid Parameter for Constraint Satisfaction. Online. In Thomas Schiex and Simon de Givry. Principles and Practice of Constraint Programming - 25th International Conference. USA: Springer, 2019, s. 195-212. ISBN 978-3-030-30047-0. Dostupné z: https://dx.doi.org/10.1007/978-3-030-30048-7_12.

EIBEN, Eduard, Robert GANIAN, Kustaa KANGAS a Sebastian ORDYNIAK. Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica. Springer, 2019, roč. 81, č. 4, s. 1657-1683. ISSN 0178-4617. Dostupné z: https://dx.doi.org/10.1007/s00453-018-0496-4.

GANIAN, Robert, Sebastian ORDYNIAK a C. S. RAHUL. Group Activity Selection with Few Agent Types. Online. In Michael A. Bender and Ola Svensson and Grzegorz Herman. 27th Annual European Symposium on Algorithms (ESA 2019). Nemecko: Dagstuhl, 2019, s. 1-16. ISBN 978-3-95977-124-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ESA.2019.48.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP, Sebastian ORDYNIAK, Michal PILIPCZUK a Marcin WROCHNA. Integer Programming and Incidence Treedepth. Online. In Andrea Lodi and Viswanath Nagarajan. Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019. USA: Springer, 2019, s. 194-204. ISBN 978-3-030-17952-6. Dostupné z: https://dx.doi.org/10.1007/978-3-030-17953-3_15.

EIBEN, Eduard, Robert GANIAN, Thekla HAMM a O-joung KWON. Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. Online. In Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Nemecko: Dagstuhl, 2019, s. 1-15. ISBN 978-3-95977-117-7. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2019.42.

FORSTER, Henry, Robert GANIAN, Fabian KLUTE a Martin NOLLENBURG. On Strict (Outer-)Confluent Graphs. Online. In Daniel Archambault, Csaba D. Toth. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019. USA: Springer, 2019, s. 147-161. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_12.

GANIAN, Robert, N. S. NARAYANASWAMY, Sebastian ORDYNIAK, C. S. RAHUL a M. S. RAMANUJAN. On the Complexity Landscape of Connected f-Factor Problems. Algorithmica. Springer, 2019, roč. 81, č. 6, s. 2606-2632. ISSN 0178-4617. Dostupné z: https://dx.doi.org/10.1007/s00453-019-00546-z.

BHORE, Sujoy, Robert GANIAN, Fabrizio MONTECCHIANI a Martin NOLLENBURG. Parameterized Algorithms for Book Embedding Problems. Online. In Daniel Archambault, Csaba D. Toth. Graph Drawing and Network Visualization - 27th International Symposium, GD 2019. USA: Springer, 2019, s. 365-378. ISBN 978-3-030-35801-3. Dostupné z: https://dx.doi.org/10.1007/978-3-030-35802-0_28.

GANIAN, Robert, Martin KRONEGGER, Andreas PFANDLER a Alexandru POPA. Parameterized Complexity of Asynchronous Border Minimization. Algorithmica. Springer, 2019, roč. 81, č. 1, s. 201-223. ISSN 0178-4617. Dostupné z: https://dx.doi.org/10.1007/s00453-018-0442-5.

GANIAN, Robert, Neha LODHA, Sebastian ORDYNIAK a Stefan SZEIDER. SAT-Encodings for Treecut Width and Treedepth. Online. In Stephen G. Kobourov and Henning Meyerhenke. ALENEX 2019. USA: SIAM, 2019, s. 117-129. ISBN 978-1-61197-549-9. Dostupné z: https://dx.doi.org/10.1137/1.9781611975499.10.

GANIAN, Robert, Petr HLINĚNÝ, Jaroslav NEŠETŘIL, Jan OBDRŽÁLEK a Patrice OSSONA DE MENDEZ. Shrub-depth: Capturing Height of Dense Graphs. Logical Methods in Computer Science. BRAUNSCHWEIG: LOGICAL METHODS COMPUTER SCIENCE E V, 2019, roč. 15, č. 1, s. "7:1"-"7:25", 25 s. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.23638/LMCS-15(1:7)2019.

GANIAN, Robert a Sebastian ORDYNIAK. Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. Algorithms. 2019, roč. 12, č. 12, s. 1-14. ISSN 1999-4893. Dostupné z: https://dx.doi.org/10.3390/A12120248.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Quadratic Programming via Explicit and Structural Restrictions. Online. In Peter Stone. Proceedings of the AAAI Conference on Artificial Intelligence. USA: AAAI Press, 2019, s. 1477-1484. ISBN 978-1-57735-809-1. Dostupné z: https://dx.doi.org/10.1609/aaai.v33i01.33011477.

EIBEN, Eduard, Robert GANIAN, Iyad KANJ a Stefan SZEIDER. The Parameterized Complexity of Cascading Portfolio Scheduling. Online. In Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alche-Buc and Emily B. Fox and Roman Garnett. Advances in Neural Information Processing Systems 32 (NIPS 2019). USA: Neural Information Processing Systems Foundation, Inc., 2019, s. 7666-7676. ISBN 978-1-7281-1044-8.

GANIAN, Robert a Sebastian ORDYNIAK. The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. Online. In Ignasi Sau and Dimitrios M. Thilikos. WG 2019: Graph-Theoretic Concepts in Computer Science. USA: Springer, 2019, s. 190-204. ISBN 978-3-030-30785-1. Dostupné z: https://dx.doi.org/10.1007/978-3-030-30786-8_15.

EIBEN, Eduard, Robert GANIAN a O-joung KWON. A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of Computer and System Sciences. Academic Press, 2018, roč. 97, č. 1, s. 121-146. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2018.05.005.

EIBEN, Eduard, Robert GANIAN a Sebastian ORDYNIAK. A Structural Approach to Activity Selection. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI). USA: ijcai.org, 2018, s. 203-209. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/28.

EIBEN, Eduard, Robert GANIAN a Stefan SZEIDER. Meta-kernelization using well-structured modulators. Discrete Applied Mathematics. Elsevier Science, 2018, roč. 248, č. 1, s. 153-167. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2017.09.018.

GANIAN, Robert, Fabian KLUTE a Sebastian ORDYNIAK. On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-14. ISBN 978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.33.

EIBEN, Eduard, Robert GANIAN a Juho LAURI. On the complexity of rainbow coloring problems. Discrete Applied Mathematics. Elsevier Science, 2018, roč. 246, č. 1, s. 38-48. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2016.10.021.

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK a Stefan SZEIDER. Parameterized Algorithms for the Matrix Completion Problem. Online. In Jennifer G. Dy, Andreas Krause. Proceedings of the 35th International Conference on Machine Learning (ICML). USA: PMLR, 2018, s. 1642-1651. ISBN 978-1-5108-6796-3.

EIBEN, Eduard, Robert GANIAN a Sebastian ORDYNIAK. Small Resolution Proofs for QBF using Dependency Treewidth. Online. In Rolf Niedermeier, Brigitte Vallee. STACS 2018. Nemecko: Dagstuhl, 2018, s. 1-15. ISBN 978-3-95977-062-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2018.28.

EIBEN, Eduard, Robert GANIAN a Stefan SZEIDER. Solving Problems on Graphs of High Rank-Width. Algorithmica. Springer, 2018, roč. 80, č. 2, s. 742-771. ISSN 0178-4617. Dostupné z: https://dx.doi.org/10.1007/s00453-017-0290-8.

GANIAN, Robert, Eunjung KIM, Friedrich SLIVOVSKY a Stefan SZEIDER. Sum-of-Products with Default Values: Algorithms and Complexity Results. Online. In Lefteri H. Tsoukalas, Eric Gregoire, Miltiadis Alamaniotis. IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI). USA: IEEE, 2018, s. 733-737. ISBN 978-1-5386-7449-9. Dostupné z: https://dx.doi.org/10.1109/ICTAI.2018.00115.

GANIAN, Robert a Sebastian ORDYNIAK. The complexity landscape of decompositional parameters for ILP. ARTIFICIAL INTELLIGENCE. Elsevier Science, 2018, roč. 257, č. 1, s. 61-71. ISSN 0004-3702. Dostupné z: https://dx.doi.org/10.1016/j.artint.2017.12.006.

EIBEN, Eduard, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Unary Integer Linear Programming with Structural Restrictions. Online. In Jerome Lang. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. USA: ijcai.org, 2018, s. 1284-1290. ISBN 978-0-9992411-2-7. Dostupné z: https://dx.doi.org/10.24963/ijcai.2018/179.

GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Backdoor Treewidth for SAT. Online. In Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. 10491. vyd. Nemecko: Springer, 2017, s. 20-37. ISBN 978-3-319-66262-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66263-3_2.

GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Combining Treewidth and Backdoors for CSP. Online. In Heribert Vollmer and Brigitte Vallee. 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. Nemecko: Dagstuhl-LIPIcs, 2017, s. 1-17. ISBN 978-3-95977-028-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2017.36.

GANIAN, Robert, Stefan SZEIDER a M.S. RAMANUJAN. Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Transactions on Algorithms. USA: ACM, 2017, roč. 13, č. 2, s. 1-32. ISSN 1549-6325. Dostupné z: https://dx.doi.org/10.1145/3014587.

GANIAN, Robert, M.S. RAMANUJAN a Sebastian ORDYNIAK. Going Beyond Primal Treewidth for {(M)ILP}. Online. In Satinder P. Singh; Shaul Markovitch. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. USA: AAAI, 2017, s. 815-821. ISBN 978-1-57735-781-0.

GANIAN, Robert a Stefan SZEIDER. New Width Parameters for Model Counting. Online. In Serge Gaspers and Toby Walsh. Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings. Nemecko: Springer, 2017, s. 38-52. ISBN 978-3-319-66262-6. Dostupné z: https://dx.doi.org/10.1007/978-3-319-66263-3_3.

GANIAN, Robert, Sebastian ORDYNIAK a M.S. RAMANUJAN. On Structural Parameterizations of the Edge Disjoint Paths Problem. Online. In Yoshio Okamoto; Takeshi Tokuyama. 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand. 92. vyd. Nemecko: LIPIcs, 2017, s. 1-13. ISBN 978-3-95977-054-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ISAAC.2017.36.

DVORAK, Pavel, Eduard EIBEN, Robert GANIAN, Dusan KNOP a Sebastian ORDYNIAK. Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. Online. In Carles Sierra. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017. USA: ijcai.org, 2017, s. 607-613. ISBN 978-0-9992411-0-3. Dostupné z: https://dx.doi.org/10.24963/ijcai.2017/85.

EIBEN, Eduard, Sebastian ORDYNIAK, M.S. RAMANUJAN, Benjamin BERGOUGNOUX a Robert GANIAN. Towards a Polynomial Kernel for Directed Feedback Vertex Set. Online. In Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin. 42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark. 83. vyd. Nemecko: LIPIcs, 2017, s. 1-15. ISBN 978-3-95977-046-0. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2017.36.

GANIAN, Robert, Eduard EIBEN a O-joung KWON. A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "34:1"-"34:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.34.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? Journal of Combinatorial Theory, Ser B. Academic Press, 2016, roč. 116, č. 1, s. 250-286. ISSN 0095-8956. Dostupné z: https://dx.doi.org/10.1016/j.jctb.2015.09.001.

GANIAN, Robert, M.S. RAMANUJAN a Stefan SZEIDER. Backdoors to Tractable Valued CSP. In Rueher, M. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016. CHAM: SPRINGER INT PUBLISHING AG, 2016, s. 233-250. ISBN 978-3-319-44952-4. Dostupné z: https://dx.doi.org/10.1007/978-3-319-44953-1_16.

GANIAN, Robert, Sebastian ORDYNIAK, Eduard EIBEN a Kanga KUSTAA. Counting Linear Extensions: Parameterizations by Treewidth. Online. In Piotr Sankowski and Christos D. Zaroliagis. 24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark. Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. 1-18. ISBN 978-3-95977-015-6. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.ESA.2016.39.

GANIAN, Robert, Stefan SZEIDER a Friedrich SLIVOVSKY. Meta-kernelization with structural parameters. Journal of Computer and System Sciences. Academic Press, 2016, roč. 82, č. 2, s. 333-346. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2015.08.003.

GANIAN, Robert, Stefan SZEIDER a Simone BOVA. Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. USA: ACM, 2016, roč. 17, č. 2, s. 1-35. ISSN 1529-3785. Dostupné z: https://dx.doi.org/10.1145/2814937.

GANIAN, Robert, Ronald DE HAAN, Stefan SZEIDER a Iyad KANJ. On Existential MSO and its Relation to ETH. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "42:1"-"42:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.42.

GANIAN, Robert, N. S. NARAYANASWAMY, Sebastian ORDYNIAK, C. S. RAHUL a M. S. RAMANUJAN. On the Complexity Landscape of Connected f-Factor Problems. Online. In Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26. Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016, s. "41:1"-"41:14", 14 s. ISBN 978-3-95977-016-3. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.MFCS.2016.41.

GANIAN, Robert, Martin KALANY, Stefan SZEIDER a Jesper Larsson TRAFF. Polynomial-time Construction of Optimal MPI Derived Datatype Trees. Online. In 2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016). NEW YORK: IEEE, 2016, s. 638-647. ISBN 978-1-5090-2140-6. Dostupné z: https://dx.doi.org/10.1109/IPDPS.2016.13.

BOVA, Simone, Robert GANIAN a Stefan SZEIDER. Quantified conjunctive queries on partially ordered sets. Theoretical Computer Science. Amsterdam: Elsevier, 2016, roč. 618, č. 1, s. 72-84. ISSN 0304-3975. Dostupné z: https://dx.doi.org/10.1016/j.tcs.2016.01.010.

GANIAN, Robert a Sebastian ORDYNIAK. The Complexity Landscape of Decompositional Parameters for ILP. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 710-716. ISBN 978-1-57735-760-5.

GANIAN, Robert, Sebastian ORDYNIAK a Eduard EIBEN. Using Decomposition-Parameters for QBF: Mind the Prefix!. Online. In Dale Schuurmans, Michael P. Wellman. Proceedings of the Thirtieth {AAAI} Conference on Artificial Intelligence. USA: AAAI Press, 2016, s. 964-970. ISBN 978-1-57735-760-5.

GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. Logical Methods in Computer Science. Německo: Logical Methods in Computer Science e.V., 2015, roč. 11, 4:11, s. 1-20. ISSN 1860-5974. Dostupné z: https://dx.doi.org/10.2168/LMCS-11(4:11)2015.

GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK a Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. Elsevier B.V., 2014, roč. 168, č. 1, s. 88-107. ISSN 0166-218X. Dostupné z: https://dx.doi.org/10.1016/j.dam.2013.10.038.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Journal of Computer and System Sciences. Elsevier, 2014, roč. 80, č. 1, s. 180-194. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2013.07.005.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2013, roč. 123, č. 1, s. 59-76. ISSN 0169-2968. Dostupné z: https://dx.doi.org/10.3233/FI-2013-800.

BOYER, M., S. HARTI, A. OUARARI, Robert GANIAN, T. GAVENČIAK, G. HAHN, C. MOLDENAUER, I. RUTTER, B. THERIAULT a M. VATSHELLE. Cops-and-robbers: Remarks and problems. Journal of Combinatorial Mathematics and Combinatorial Computing. Charles Babbage Research Centre, 2013, roč. 85, č. 1, s. 141-159. ISSN 0835-3026.

OBDRŽÁLEK, Jan a Robert GANIAN. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard. Combinatorial Algorithms 24th International Workshop, IWOCA 2013. Berlin Heidelberg: Springer, 2013, s. 164-177. ISBN 978-3-642-45277-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45278-9_15.

GANIAN, Robert, Petr HLINĚNÝ, Daniel KRÁĽ, Jan OBDRŽÁLEK, Jarett SCHWARTZ a Jakub TESKA. FO Model Checking of Interval Graphs. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg. ICALP (2) 2013. Berlin Heidelberg: Springer, 2013, s. 250-262. ISBN 978-3-642-39211-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39212-2_24.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width. European Journal of Combinatorics. Elsevier, 2013, roč. 34, č. 3, s. 680-701. ISSN 0195-6698. Dostupné z: https://dx.doi.org/10.1016/j.ejc.2012.07.024.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. Can dense graphs be "sparse"? In Third Workshop on Graphs and Matroids; Maastricht, The Netherlands. 2012.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Peter ROSSMANITH a Somnath SIKDAR. Lower Bounds on the Complexity of MSO_1 Model-Checking. Online. In 29th International Symposium on Theoretical Aspects of Computer Science STACS2012. 2012. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2012, s. 326-337. ISBN 978-3-939897-35-4. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2012.326.

GANIAN, Robert. Parameterized Algorithms on Width Parameters of Graphs. 2012, 143 s.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Jaroslav NEŠETŘIL, Patrice OSSONA DE MENDEZ a Reshma RAMADURAI. When Trees Grow Low: Shrubs and Fast MSO1. In Math Foundations of Computer Science MFCS 2012. 7464. vyd. Německo: Lecture Notes in Computer Science, Springer-Verlag, 2012, s. 419-430. ISBN 978-3-642-32588-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-32589-2_38.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Clique-width: When Hard Does Not Mean Impossible. Online. In Thomas Schwentick and Christoph D{\"u}rr. 28th International Symposium on Theoretical Aspects of Computer Science STACS2011. 2011. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011, s. 404-415. ISBN 978-3-939897-25-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2011.404.

GANIAN, Robert. New Results on the Complexity of the Max- and Min-Rep Problems. In SOFSEM 2011: Theory and Practice of Computer Science. Nový Smokovec, Slovensko: Springer-Verlag, 2011, s. 238-247. ISBN 978-3-642-05005-3. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11266-9_36.

GANIAN, Robert. Thread graphs, linear rank-width and their algorithmic applications. In C.S. Iliopoulos and W.F. Smyth. Combinatorial Algorithms 2010. Londýn, Velká Británie: Springer, 2011, s. 38-42. ISBN 978-3-642-19221-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-19222-7_5.

GANIAN, Robert. Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics. In Peter Rossmanith, Daniel Marx. Parameterized and Exact Computation. Neuveden: Springer, 2011, s. 259-271, 12 s. ISBN 978-3-642-28049-8.

GANIAN, Robert. Using Neighborhood Diversity to Solve Hard Problems. 2011.

GANIAN, Robert. Algorithmic applications of linear rank-width. In GRAFY 2010. 2010.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Joachim KNEIS, Daniel MEISTER, Somnath SIKDAR a Peter ROSSMANITH. Are there any good digraph width measures? In Parameterized and exact computation, IPEC 2010. 6478. vyd. India: Lecture Notes in Computer Science, Springer-Verlag, 2010, s. 135-146. ISBN 978-3-642-17492-6. Dostupné z: https://dx.doi.org/10.1007/978-3-642-17493-3_14.

GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Better algorithms for satisfiability problems for formulas of bounded rank-width. Online. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). 2010. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2010, s. 73-83. ISBN 978-3-939897-23-1. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.73.

HLINĚNÝ, Petr a Vladimír VETCHÝ. Česko-Slovenská Konference GRAFY 2010. 2010.

GANIAN, Robert a Petr HLINĚNÝ. New results on the complexity of oriented colouring on restricted digraph classes. In SOFSEM 2010, Lecture Notes in Computer Science 5901. 5901. vyd. Berlin: Springer, 2010, s. 428-439. ISBN 978-3-642-11265-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11266-9_36.

GANIAN, Robert a Petr HLINĚNÝ. On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics. Amsterdam: Elsevier B.V., 2010, roč. 158, č. 1, s. 851-867. ISSN 0166-218X.

GANIAN, Robert a Petr HLINĚNÝ. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874. 5874. vyd. Berlin: Springer, 2009, s. 266-277. ISBN 978-3-642-10216-5. Dostupné z: https://dx.doi.org/10.1007/978-3-642-10217-2.

GANIAN, Robert. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In IWOCA 2009. 2009.

GANIAN, Robert. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In GRAPHS 2009. 2009.

GANIAN, Robert a Petr HLINĚNÝ. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In IWOCA 2009. 2009.

GANIAN, Robert a Petr HLINĚNÝ. Better Polynomial Algorithms on Graphs of Bounded Rank-width. In GRAPHS 2009. 2009. ISBN 978-80-227-3084-6.

GANIAN, Robert, Petr HLINĚNÝ, Jan OBDRŽÁLEK, Alexander LANGER, Joachim KNEIS a Peter ROSSMANITH. On Digraph Width Measures in Parameterized Algorithmics. In IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science. 5917. vyd. Berlin: Springer Verlag, 2009, s. 185-197. ISBN 978-3-642-11268-3. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11269-0_15.

GANIAN, Robert. The Parameterized Complexity of Oriented Colouring. In MEMICS 2009 proceedings. Dagstuhl, Germany: DROPS, 2009, 8 s. ISBN 978-3-939897-15-6.

HLINĚNÝ, Petr a Robert GANIAN. Automata Approach to Graphs of Bounded Rank-width. In Workshop MEMICS 2008. Brno: FI MU, 2008, s. 257. ISBN 978-80-7355-082-0.

HLINĚNÝ, Petr a Robert GANIAN. Automata Approach to Graphs of Bounded Rank-width. In Mirka Miller and Koichi Wada. International Workshop on Combinatorial Algorithms IWOCA 2008. United Kingdom: Proceedings of the International Workshop on Combinatorial Algorithms 2008, College Publications, 2008, s. 4-15. ISBN 978-1-904987-74-1.

GANIAN, Robert. Automata Approach to Graphs of Bounded Rank-width. In MEMICS 2008. 2008.

GANIAN, Robert. Automata Approach to Graphs of Bounded Rank-width. In IWOCA 2008. 2008.

GANIAN, Robert a Petr HLINĚNÝ. Automata formalization for graphs of bounded rank-width. In GRAPHS 2008. 2008.

GANIAN, Robert. Automata formalization for graphs of bounded rank-width. In GRAPHS 2008. 2008.