2020W

• Algorithmics / 186.814 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Fixed-Parameter Algorithms and Complexity / 186.855 / VU
• Scientific Research and Writing / 193.052 / SE

2021S

• Algorithms and Data Structures / 186.866 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR
• Project in Computer Science 1 / 186.820 / PR
• Project in Computer Science 2 / 186.821 / PR
• Seminar on Algorithms / 186.182 / SE

• Parameterized Analysis in Artificial Intelligence
  2021 – 2026 / Austrian Science Fund (FWF)
• Structural Approaches in Stability Under Diversity Constraints
  2021 – 2022 / Austrian Exchange Service (OeAD)
• New Frontiers for Parameterized Complexity
  2018 – 2021 / Austrian Science Fund (FWF)
• The Parameterized Complexity of Reasoning Problems
  2010 – 2014 / European Research Council (ERC)

2021

• The Complexity Landscape of Resource-Constrained Scheduling / R. Ganian, T. Hamm, G. Mescoff / Talk: IJCAI 2020, Yokohama; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence", (2020), ISBN: 978-0-9992411-6-5; 1741 - 1747
• Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP / J. Chen, R. Ganian, T. Hamm / Talk: International Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence", (2020), ISBN: 978-0-9992411-6-5; 1 - 7
• Threshold Treewidth and Hypertree Width / R. Ganian, A. Schidler, M. Sorge, S. Szeider / Talk: IJCAI - International Joint Conference on Artificial Intelligence, Yokohama, Japan; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)", (2020), ISBN: 978-0-9992411-6-5; 1898 - 1904

2020

• Fixed-Parameter Tractability of Dependency QBFwith Structural Parameters / R. Ganian, T. Peitl, F. Slivovsky, S. Szeider / Talk: 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece; 2020-09-12 - 2020-09-18; in: "Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020", (2020), ISSN: 2334-1033; 392 - 402
• Extending Nearly Complete 1-Planar Drawings in Polynomial Time / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Prag, Tschechien; 2020-08-24 - 2020-08-28; in: "45th International Symposium on Mathematical Foundations of Computer Science", LIPIcs, 170 (2020), ISBN: 978-3-95977-159-7; 1 - 16
• Extending Partial 1-Planar Drawings / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / Talk: International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany; 2020-07-08 - 2020-07-11; in: "47th International Colloquium on Automata, Languages, and Programming", Leibniz International Proceedings in Informatics, 168 (2020), ISBN: 978-3-95977-138-2; 1 - 19
• On Covering Segments with Unit Intervals / D. Bergren, E. Eiben, R. Ganian, I. Kanj / Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Montpellier, Frankreich; 2020-03-10 - 2020-03-13; in: "37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)", LIPICS, 154 (2020), ISBN: 978-3-95977-140-5; Paper ID 13, 17 pages
• An Efficient Algorithm for Counting Markov Equivalent DAGs / R. Ganian, T. Hamm, T. Talvitie / Talk: 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, New York, USA; 2020-02-07 - 2020-02-12; in: "The Thirty-Fourth AAAI Conference on Artificial Intelligence", AAAI Press, 34 (2020), ISSN: 2159-5399; 10136 - 10143
• Parameterized Complexity of Envy-Free Resource Allocation in Social Networks / E. Eiben, R. Ganian, T. Hamm, S. Ordyniak / Talk: 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, New York, USA; 2020-02-07 - 2020-02-12; in: "The Thirty-Fourth AAAI Conference on Artificial Intelligence", AAAI Press, 34 (2020), ISSN: 2159-5399; 7135 - 7142
• On the Parameterized Complexity ofClustering Incomplete Data into Subspaces of Small Dimension / R. Ganian, I. Kanj, S. Ordyniak, S. Szeider / Talk: AAAI 2020, New York, USA; 2020-02-07 - 2020-02-12; in: "Proceedings of AAAI2020", AAAI Press, 34 (2020), ISSN: 2374-3468; 3906 - 3913
• Towards a Polynomial Kernel for Directed Feedback VertexSet / B. Bergougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan / Algorithmica, 82 (2020), 1 - 21
• On Existential MSO and Its Relation to ETH / R. Ganian, R. de Haan, I. Kanj, S. Szeider / ACM Transactions on Computation Theory, 12 (2020), 4; 1 - 32
• Usingdecomposition-parametersforQBF:Mindtheprefix! / E. Eiben, R. Ganian, S. Ordyniak / Journal of Computer and System Sciences, 110 (2020), 1 - 21
• On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem / R. Ganian, F. Klute, S. Ordyniak / Algorithmica, 82 (2020), 1 - 40
• The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths / R. Ganian, S. Ordyniak / Algorithmica, 82 (2020), 1 - 27
• Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / Journal of Graph Algorithms and Applications, 24 (2020), 4; 603 - 620
• Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada / D. Corneil, R. Ganian, A. Proskurowski / in: "Discrete Applied Mathematics", 278; Elsevier Science Publishers, 2020, 1 - 2

2019

• Parameterized Complexity Results for the Completion and Clustering of Incomplete Data / S. Szeider, R. Ganian, I. Kanj, S. Ordyniak / Talk: Kocoon Workshop, Arras, Frankreich; 2019-12-16 - 2019-12-19
• On Strict (Outer-)Confluent Graphs / H. Förster, R. Ganian, F. Klute, M. Nöllenburg / Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 147 - 161
• Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / Talk: Graph Drawing and Network Visualization, Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 365 - 378
• Parameterized Complexity of Asynchronous Border Minimization / R. Ganian, M. Kronegger, A. Pfandler, A. Popa / Algorithmica, 81 (2019), 1; 201 - 223
• SAT-Encodings for Treecut Width and Treedepth / R. Ganian, N. Lodha, S. Ordyniak, S. Szeider / in: "Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)", S.G. Kobourov, H. Meyerhenke (ed.); SIAM, 2019, ISBN: 978-1-61197-549-9, 13 pages

2018

• A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion / E. Eiben, R. Ganian, O. Kwon / Journal of Computer and System Sciences, 96 (2018), 121 - 146
• On the Complexity of Rainbow Coloring Problems / E. Eiben, R. Ganian, J. Laurila / Discrete Applied Mathematics, 246 (2018), 38 - 48
• The Complexity Landscape of Decompositional Parameters for ILP / R. Ganian, S. Ordyniak / Artificial Intelligence, 257 (2018), 61 - 71
• Meta-kernelization using well-structured modulators / E. Eiben, R. Ganian, S. Szeider / Discrete Applied Mathematics, Volume 280 (2018), 153 - 167
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem / R. Ganian, F. Klute, S. Ordyniak / in: "Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science", 35th Symposium on Theoretical Aspects of Computer Science, Cean, 2018, ISBN: 978-3-95977-062-0, 1 - 14
• Small Resolution Proofs for QBF using Dependency Treewidth / E. Eiben, R. Ganian, S. Ordyniak / in: "Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France", 35th Symposium on Theoretical Aspects of Computer Science, Caen, 2018, ISBN: 978-3-95977-062-0, 1 - 14
• Unary Integer Linear Programming with Structural Restrictions / E. Eiben, R. Ganian, D. Knop / in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", International Joint Conferences on Artificial Intelligence, Schweden, 2018, ISBN: 978-0-9992411-2-7, 1284 - 1290
• A Structural Approach to Activity Selection / E. Eiben, R. Ganian, S. Ordyniak / in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", issued by: IJCAI2018; International Joint Conferences on Artificial Intelligence, Stockholm, 2018, ISBN: 978-0-9992411-2-7, 203 - 209
• Parameterized Algorithms for the Matrix Completion Problem / R. Ganian, I. Kanj, S. Ordyniak, S. Szeider / in: "Proceeding of ICML", issued by: jmlr.org; Journal of Machine Learning Research, 2018, 1642 - 1651

2017

• Towards a Polynomial Kernel for Directed Feedback Vertex Set / B. Bergnougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan / Talk: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg Denmark; 2017-08-21 - 2017-08-25; in: "Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science", Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, (2017), ISBN: 978-3-95977-046-0; 1 - 15
• Going Beyond Primal Treewidth for (M)ILP / R. Ganian, S. Ordyniak, M. Ramanujan / Talk: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, California; 2017-02-04 - 2017-02-09; in: "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence", (2017), ISBN: 978-1-57735-781-0; 815 - 821
• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian, M. S. Ramanujan, S. Szeider / ACM Transactions on Algorithms, 13 (2017), 1 - 31
• Backdoor Treewidth for SAT / R. Ganian, M. S. Ramanujan, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer-Verlag, 2017, ISBN: 978-3-319-66262-6, 20 - 37
• New Width Parameters for Model Counting / R. Ganian, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", International Conference on Theory and Applications of Satisfiability Testing, 2017, ISBN: 978-3-319-66262-6, 38 - 52
• Combining Treewidth and Backdoors for CSP / R. Ganian, M. S. Ramanujan, S. Szeider / in: "34th Symposium on Theoretical Aspects of Computer Science", issued by: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, ISBN: 978-3-95977-028-6, 429 - 445
• Solving Problems on Graphs of High Rank-Width / E. Eiben, R. Ganian, S. Szeider / Algorithmica (online), 80 (2017), 80; 30 pages

2016

• Backdoors to Tractable Valued CSP / R. Ganian, M. S. Ramanujan, S. Szeider / Talk: International Conference on Principles and Practice of Constraint Programming (CP), Toulouse, Frankreich; 2016-09-05 - 2016-09-09; in: "Principles and Practice of Constraint Programming (Proceedings of 22nd CP)", LNCS, 9898 (2016), ISBN: 978-3-319-44952-4; 233 - 250
• A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion / E. Eiben, R. Ganian, O. Kwon / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14
• Counting Linear Extensions Parameterizations by Treewidth / E. Eiben, R. Ganian, K. Kangas, S. Ordyniak / Talk: ESA Workshop, Aarhus, Denmark; 2016-08-22 - 2016-08-24; in: "Proceedings of the 24th Annual European Symposium on Algorithms", (2016), ISBN: 978-3-95977-015-6; 1 - 18
• On the Complexity Landscape of Connected f-Factor Problems* / R. Ganian, N. Narayanaswamy, S. Ordyniak, C. Rahul, M. S. Ramanujan / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14
• On Existential MSO and its Relation to ETH / R. Ganian, R. de Haan, I. Kanj, S. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14
• Polynomial-Time Construction of Optimal MPI Derived Datatype Trees / R. Ganian, M. Kalany, S. Szeider, J. Träff / Talk: IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016), Chicago, Illinois, USA; 2016-05-23 - 2016-05-27; in: "Proceedings of the IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016)", IEEE Computer Society, (2016), ISBN: 978-1-5090-2140-6; 638 - 647
• Using Decomposition-Parameters for QBF: Mind the Prefix! / E. Eiben, R. Ganian, S. Ordyniak / Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 964 - 970
• The Complexity Landscape of Decompositional Parameters for ILP / R. Ganian, S. Ordyniak / Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 710 - 716
• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian, M. S. Ramanujan, S. Szeider / Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Arlington, VA, USA; 2016-01-10 - 2016-01-12; in: "Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms", (2016), ISBN: 978-1-61197-433-1; 1670 - 1681
• Meta-kernelization with structural parameters / R. Ganian, F. Slivovsky, S. Szeider / Journal of Computer and System Sciences, 82 (2016), 333 - 346
• Quantified conjunctive queries on partially ordered sets / S. Bova, R. Ganian, S. Szeider / Theoretical Computer Science, 618 (2016), 72 - 84

2015

• Well-Structured Modulators: FPT Algorithms and Kernels / R. Ganian / Talk: Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Aussois, France (invited); 2015-10-11 - 2015-10-15
• Community Structure Inspired Algorithms for SAT and #SAT / R. Ganian, S. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Austin, Texas; 2015-09-24 - 2015-09-27; in: "Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing", LNCS / Springer, 9340 (2015), ISBN: 978-3-319-24317-7; 223 - 238
• Meta-kernelization using Well-structured Modulators / E. Eiben, R. Ganian, S. Szeider / Talk: International Symposium on Parameterized and Exact Computation (IPEC), Patras, Greece; 2015-09-16 - 2015-09-18; in: "10th International Symposium on Parameterized and Exact Computation (IPEC 2015)", T. Husfeldt, I. Kanj (ed.); LIPICs, 43 (2015), ISBN: 978-3-939897-92-7; 114 - 126
• Algorithmic Applications of Tree-Cut Width / R. Ganian, Ej Kim, S. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Milan, Italy; 2015-08-24 - 2015-08-28; in: "Proceedings of the 40th International Symposium Mathematical Foundations of Computer Science 2015", LNCS 9235 (2015), ISBN: 978-3-662-48053-3; 348 - 361
• Solving Problems on Graphs of High Rank-Width / E. Eiben, R. Ganian, S. Szeider / Talk: Algorithms and Data Structures Symposium, Victoria, Canada; 2015-08-05 - 2015-08-07; in: "Proceedings of the 14th International Symposium on Algorithms and Data Structures", LNCS, 9214 (2015), ISBN: 978-3-319-21839-7; 314 - 326
• Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian / Talk: Contemporary Trends in Theoretical Computer Science 2015, Prag, Tschechien (invited); 2015-06-26 - 2015-06-27
• Parameterized Complexity of Asynchronous Border Minimization / R. Ganian, M. Kronegger, A. Pfandler, A. Popa / Talk: 12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015, Singapur; 2015-05-18 - 2015-05-20; in: "Theory and Applications of Models of Computation, 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings", R. Jain, S. Jain, F. Stephan (ed.); Springer, Lecture Notes in Computer Science Volume 9076 (2015), ISBN: 978-3-319-17141-8; 428 - 440
• Algorithmic Applications of Large Well-Structured Modulators / R. Ganian / Talk: Algorithmic Model Theory Meeting 2015 - ALMOTH 2015, Bayreuth, Deutschland (invited); 2015-02-26 - 2015-02-27
• Model Checking Existential Logic on Partially Ordered Sets / S. Bova, R. Ganian, S. Szeider / ACM Transactions on Computational Logic, 17 (2015), 2; 1 - 35
• Improving Vertex Cover as a Graph Parameter / R. Ganian / Discrete Mathematics & Theoretical Computer Science, 17/2 (2015), 77 - 100
• FO Model Checking of Interval Graphs / R. Ganian, P. Hlinený, D. Král, J. Obdrzalek, J. Schwartz, J. Teska / Logical Methods in Computer Science, 11 (2015), 4; 20 pages
• Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions / R. Ganian, M. Kalany, St. Szeider, J. Träff / Report for CoRR - Computing Research Repository; Report No. arXiv:1506.09100, 2015; 18 pages

2014

• Quantified Conjunctive Queries on Partially Ordered Sets / S. Bova, R. Ganian, St. Szeider / Talk: International Symposium on Parameterized and Exact Computation (IPEC), Wroclaw, Poland; 2014-09-10 - 2014-09-12; in: "IPEC 2014", LNCS / Springer, 8894 (2014), 122 - 134
• Model Checking Existential Logic on Partially Ordered Sets / S. Bova, R. Ganian, St. Szeider / Talk: 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; 2014-07-14 - 2014-07-18; in: "CSL-LICS 2014", ACM New York, NY, USA, (2014), ISBN: 978-1-4503-2886-9
• Digraph Width Measures in Parameterized Algorithmics / R. Ganian, P. Hlinený, J. Kneis, A. Langer, J. Obdrzalek, P. Rossmanith / Discrete Applied Mathematics, 168 (2014), 88 - 107
• Lower Bounds on the Complexity of MSO1 Model-Checking / R. Ganian, P. Hlinený, A. Langer, J. Obdrzalek, P. Rossmanith, S. Sikdar / Journal of Computer and System Sciences, 80 (2014), 1; 180 - 194

2013

• Meta-Kernelization with Structural Parameters / R. Ganian / Talk: Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece; 2013-10-09 - 2013-10-11
• Meta-kernelization with Structural Parameters / R. Ganian, F. Slivovsky, St. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Klosterneuburg, Austria; 2013-08-26 - 2013-08-30; in: "The 38th International Symposium on Mathematical Foundations of Computer Science, Proceedings", K. Chatterjee, J. Sgall (ed.); Springer / LNCS, 8087 (2013), ISBN: 978-3-642-40312-5; 457 - 468
• Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes / R. Ganian, J. Obdrálek / Talk: International Workshop on Combinatorial Algorithms (IWOCA), Rouen, France; 2013-07-10 - 2013-07-12; in: "Combinatorial Algorithms - 24th International Workshop", T. Lecroq, L. Mouchard (ed.); Springer / LNCS, 8288 (2013), ISBN: 978-3-642-45277-2; 164 - 177
• FO Model Checking of Interval Graphs / R. Ganian, P. Hlinený, D. Král, J. Obdrálek, J. Schwartz, J. Teska / Talk: International Colloquium on Automata, Languages and Programming (ICALP), Riga, Latvia; 2013-07-08 - 2013-07-12; in: "Automata, Languages, and Programming - 40th International Colloquium", Springer / LNCS, 7966 (2013), ISBN: 978-3-642-39211-5; 250 - 262
• Meta-Kernelization with Structural Parameters / R. Ganian / Talk: Contemporary Trends in Theoretical Computer Science (STTI 2013), Prague, Czech Republic; 2013-06-07 - 2013-06-08