Robert Ganian
Associate Prof. / PhD
Role
-
Associate Professor
Algorithms and Complexity, E192-01
Contact
- robert.ganian@tuwien.ac.at
- +43-1-58801-192127
- Favoritenstrasse 9, Room HB0414
- vCard from TISS
Courses
2022W
- Algorithmics / 186.814 / VU
- Bachelor Thesis in Computer Science / 186.819 / PR
- Fixed-Parameter Algorithms and Complexity / 192.135 / VU
- Frontiers of Algorithms and Complexity / 192.136 / VU
- Introduction to Logical Methods in Computer Science / 184.766 / VO
- Project in Computer Science 1 / 186.820 / PR
- Project in Computer Science 2 / 186.821 / PR
- Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
- Project in Software Engineering & Internet Computing / 186.852 / PR
- Research Seminar LogiCS / 184.767 / SE
- Scientific Research and Writing / 193.052 / SE
- Seminar for Master Students in Logic and Computation / 180.773 / SE
- Seminar on Algorithms / 186.182 / SE
2023S
- Algorithms and Data Structures / 186.866 / VU
- Bachelor Thesis in Computer Science / 186.819 / PR
- Introduction to Logical Methods in Computer Science / 184.766 / VO
- Project in Computer Science 1 / 186.820 / PR
- Project in Computer Science 2 / 186.821 / PR
- Research Seminar LogiCS / 184.767 / SE
- Scientific Research and Writing / 193.052 / SE
Projects
-
Parameterized Analysis in Artificial Intelligence
2021 – 2026 / Austrian Science Fund (FWF) / Publications: 144028, 147758, 147781, 147914, 147932, 148546, 148561, 148580, 149087, 86009, 86021, 86024, 86025, 86027, 86030 -
Structural Approaches in Stability Under Diversity Constraints
2021 – 2022 / Austrian Exchange Service (OeAD) / Publication: 86027 -
New Frontiers for Parameterized Complexity
2018 – 2022 / Austrian Science Fund (FWF) / Publications: 147758, 147765, 147781, 147932, 148546, 148561, 86009, 86024, 86025, 86027, 86030 -
The Parameterized Complexity of Reasoning Problems
2010 – 2014 / European Research Council (ERC) / Publications: 163866, 163868, 165499, 165500, 165501, 165503, 170514, 170543, 170544, 170545, 170546, 170551, 171744, 172273, 172275, 172276, 172278, 172279, 172280, 172281, 175429, 26839, 27011, 27012, 30598, 30996, 40956, 56838, 56985, 56987, 56988, 56989, 56990, 56991, 57118, 57200, 57429, 57430, 57431, 57432, 57433, 57434, 57435, 57436, 57995, 57996, 57997, 57998, 57999, 58000, 58001, 58002, 58003, 58004, 58005, 58476, 58550, 58551, 58552, 58553, 58554, 58556, 58557, 58558, 58560, 58561, 58562, 58563, 58564, 58565, 58566, 58567, 58573, 58575, 59512, 59586, 59587, 59588, 59589, 59590, 59591, 59592, 59593, 59595, 59596, 90194, 90195, 90196, 90441, 90442, 90443, 90444
Publications
Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.
2022
- Algorithmic applications of tree-cut width / Ganian, R., Kim, E. J., & Szeider, S. (2022). Algorithmic applications of tree-cut width. SIAM Journal on Discrete Mathematics, 36(4), 2635–2666. https://doi.org/10.1137/20M137478X / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz, REVEAL-AI
- Finding a Cluster in Incomplete Data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2022). Finding a Cluster in Incomplete Data. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–14). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.47 / Projects: Parameterisierte Analyse in der Künstlichen Intelligenz, SLIM
- Bounding and Computing Obstacle Numbers of Graphs / Balko, M., Chaplick, S., Ganian, R., Gupta, S., Hoffmann, M., Valtr, P., & Wolff, A. (2022). Bounding and Computing Obstacle Numbers of Graphs. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.11 / Project: Parameterisierte Analyse in der Künstlichen Intelligenz
- 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) / Szeider, S., Ganian, R., & Silva, A. (Eds.). (2022). 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). https://doi.org/10.4230/LIPIcs.MFCS.2022.0
- Threshold Treewidth and Hypertree Width / Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2022). Threshold Treewidth and Hypertree Width. Journal of Artificial Intelligence Research, 74, 1687–1713. https://doi.org/10.1613/JAIR.1.13661 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz, REVEAL-AI, SLIM
- Weighted Model Counting with Twin-Width / Ganian, R., Pokrývka, F., Schidler, A., Simonov, K., & Szeider, S. (2022). Weighted Model Counting with Twin-Width. In K. S. Meel & O. Strichman (Eds.), 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.15 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz, REVEAL-AI, SLIM
- The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width / Ganian, R., Hamm, T., Korchemna, V., Okrasa, K., & Simonov, K. (2022). The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. In 49th EATCS International Conference on Automata, Languages, and Programming (pp. 66:1-66:20). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ICALP.2022.66 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz
- Hedonic Diversity Games: A Complexity Picture with More than Two Colors / Ganian, R., Hamm, T., Knop, D., Schierreich, Š., & Suchý, O. (2022). Hedonic Diversity Games: A Complexity Picture with More than Two Colors. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5034–5042). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20435 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz, Structural Approaches in Stability Under Diversity Constraints
- Parameterized Algorithms for Upward Planarity / Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C., & Simonov, K. (2022). Parameterized Algorithms for Upward Planarity. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.26 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz
- Parameterized Algorithms for Queue Layouts / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2022). Parameterized Algorithms for Queue Layouts. Journal of Graph Algorithms and Applications, 26(3), 335–352. https://doi.org/10.7155/jgaa.00597 / Projects: HumAlgo, Parameterisierte Analyse in der Künstlichen Intelligenz
- Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria / Ganian, R., Kratochvíl, J., & Szeider, S. (2022). Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. In S. Szeider, R. Ganian, & J. Kratochwill (Eds.), Ninth workshop on graph classes, optimization, and Width Parameters (Vol. 312). https://doi.org/10.1016/j.dam.2022.02.009
- An efficient algorithm for counting Markov equivalent DAGs / Ganian, R., Hamm, T., & Talvitie, T. (2022). An efficient algorithm for counting Markov equivalent DAGs. Artificial Intelligence, 304, 1–13. https://doi.org/10.1016/j.artint.2021.103648
- Sum-of-Products with Default Values: Algorithms and Complexity Results / Ganian, R., Kim, E. J., Slivovsky, F., & Szeider, S. (2022). Sum-of-Products with Default Values: Algorithms and Complexity Results. Journal of Artificial Intelligence Research, 73, 535–552. https://doi.org/10.1613/JAIR.1.12370 / Projects: NFPC, QBF
- On Covering Segments with Unit Intervals / Bergren, D., Eiben, E., Ganian, R., & Kanj, I. (2022). On Covering Segments with Unit Intervals. SIAM Journal on Discrete Mathematics, 36(2), 1200–1230. https://doi.org/10.1137/20M1336412 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz
- Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts / Brand, C., Ceylan, E., Ganian, R., Hatschka, C., & Korchemna, V. (2022). Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. In M. A. Bekos & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 98–113). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-031-15914-5_8
- The Complexity of k-Means Clustering when Little is Known / Ganian, R., Hamm, T., Korchemna, V., Okrasa, K., & Simonov, K. (2022). The Complexity of k-Means Clustering when Little is Known. In Proceedings of the 39th International Conference on Machine Learning (pp. 6960–6987). https://doi.org/10.34726/3070 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz
- The Complexity of Envy-Free Graph Cutting / Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2022). The Complexity of Envy-Free Graph Cutting. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 237–243). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/34 / Projects: NFPC, Parameterisierte Analyse in der Künstlichen Intelligenz
- A Unifying Framework for Characterizing and Computing Width Measures / Eiben, E., Ganian, R., Hamm, T., Jaffke, L., & Kwon, O.-J. (2022). A Unifying Framework for Characterizing and Computing Width Measures. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (pp. 1–23). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ITCS.2022.63 / Project: Parameterisierte Analyse in der Künstlichen Intelligenz
2021
- On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2021). On Strict (Outer-)Confluent Graphs. Journal of Graph Algorithms and Applications, 25(1), 481–512. https://doi.org/10.7155/jgaa.00568
- Measuring what matters: Ahybrid approach to dynamic programming with treewidth / Eiben, E., Ganian, R., Hamm, T., & Kwon, O. (2021). Measuring what matters: Ahybrid approach to dynamic programming with treewidth. Journal of Computer and System Sciences, 121, 57–75. https://doi.org/10.1016/j.jcss.2021.04.005
- New width parameters for SAT and #SAT / Ganian, R., & Szeider, S. (2021). New width parameters for SAT and #SAT. Artificial Intelligence, 295(103460), 103460. https://doi.org/10.1016/j.artint.2021.103460
- The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints / Dvořák, P., Eiben, E., Ganian, R., Knop, D., & Ordyniak, S. (2021). The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artificial Intelligence, 300(103561), 103561. https://doi.org/10.1016/j.artint.2021.103561
- On Structural Parameterizations of the Edge Disjoint Paths Problem / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2021). On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica, 83(6), 1605–1637. https://doi.org/10.1007/s00453-020-00795-3
- Graphs with Two Moplexes / Dallard, C., Ganian, R., Hatzel, M., Krnc, M., & Milanič, M. (2021). Graphs with Two Moplexes. In Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium (pp. 248–256). Elsevier. https://doi.org/10.1016/j.procs.2021.11.031 / Project: Parameterisierte Analyse in der Künstlichen Intelligenz
- The Complexity of Object Association in Multiple Object Tracking / Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Complexity of Object Association in Multiple Object Tracking. In The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21) (pp. 1388–1396). AAAI Press. http://hdl.handle.net/20.500.12708/58619
- Crossing-Optimal Extension of Simple Drawings / Ganian, R., Hamm, T., Klute, F., Parada, I., & Vogtenhuber, B. (2021). Crossing-Optimal Extension of Simple Drawings. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (pp. 1–17). LIPICS. https://doi.org/10.4230/LIPIcs.ICALP.2021.72
- The Parameterized Complexity of Connected Fair Division / Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Parameterized Complexity of Connected Fair Division. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/20
- Parameterized Complexity in Graph Drawing / Ganian, R., Montecchiani, F., Nöllenburg, M., & Zehavi, M. (2021). Parameterized Complexity in Graph Drawing. In Seminar on Parameterized Complexity in Graph Drawing (pp. 82–123). Dagstuhl Reports. https://doi.org/10.4230/DagRep.11.6.82
- Worbel: Aggregating Point Labels intoWord Clouds / Bhore, S., Ganian, R., Li, G., Nöllenburg, M., & Wulms, J. (2021). Worbel: Aggregating Point Labels intoWord Clouds. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems. ACM SIGSPATIAL international conference on Advances in geographic information systems, Irvine, California, Non-EU. ACM. https://doi.org/10.1145/3474717.3483959
- The Parameterized Complexity of Clustering Incomplete Data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2021). The Parameterized Complexity of Clustering Incomplete Data. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 7296–7304). AAAI Press. http://hdl.handle.net/20.500.12708/58587
- The Complexity Landscape of Resource-Constrained Scheduling / Ganian, R., Hamm, T., & Mescoff, G. (2021). The Complexity Landscape of Resource-Constrained Scheduling. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Non-EU. https://doi.org/10.24963/ijcai.2020/241
- Threshold Treewidth and Hypertree Width / Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2021). Threshold Treewidth and Hypertree Width. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. https://doi.org/10.24963/ijcai.2020/263
- Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP / Chen, J., Ganian, R., & Hamm, T. (2021). Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (pp. 1–7). http://hdl.handle.net/20.500.12708/55573
2020
- Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2020). Parameterized Algorithms for Book Embedding Problems. Journal of Graph Algorithms and Applications, 24(4), 603–620. https://doi.org/10.7155/jgaa.00526
- Usingdecomposition-parametersforQBF:Mindtheprefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2020). Usingdecomposition-parametersforQBF:Mindtheprefix! Journal of Computer and System Sciences, 110, 1–21. https://doi.org/10.1016/j.jcss.2019.12.005
- On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2020). On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem. Algorithmica, 83(1), 297–336. https://doi.org/10.1007/s00453-020-00758-8
- The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths / Ganian, R., & Ordyniak, S. (2020). The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths. Algorithmica, 83(2), 726–752. https://doi.org/10.1007/s00453-020-00772-w
- Towards a Polynomial Kernel for Directed Feedback VertexSet / Bergougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2020). Towards a Polynomial Kernel for Directed Feedback VertexSet. Algorithmica, 83(5), 1201–1221. https://doi.org/10.1007/s00453-020-00777-5
- On Existential MSO and Its Relation to ETH / Ganian, R., Haan, R. de, Kanj, I., & Szeider, S. (2020). On Existential MSO and Its Relation to ETH. ACM Transactions on Computation Theory, 12(4), 1–32. https://doi.org/10.1145/3417759
- Fixed-Parameter Tractability of Dependency QBF with Structural Parameters / Ganian, R., Peitl, T., Slivovsky, F., & Szeider, S. (2020). Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. In Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, Non-EU. https://doi.org/10.24963/kr.2020/40
- Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada / Corneil, D. G., Ganian, R., & Proskurowski, A. (2020). Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. In Discrete Applied Mathematics (pp. 1–2). Elsevier Science Publishers. https://doi.org/10.1016/j.dam.2020.04.001
- On Covering Segments with Unit Intervals / Bergren, D., Eiben, E., Ganian, R., & Kanj, I. (2020). On Covering Segments with Unit Intervals. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (p. 17). LIPICS. https://doi.org/10.4230/LIPIcs.STACS.2020.13
- An Efficient Algorithm for Counting Markov Equivalent DAGs / Ganian, R., Hamm, T., & Talvitie, T. (2020). An Efficient Algorithm for Counting Markov Equivalent DAGs. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 10136–10143). AAAI Press. https://doi.org/10.1609/aaai.v34i06.6573
- Parameterized Complexity of Envy-Free Resource Allocation in Social Networks / Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2020). Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 7135–7142). AAAI Press. https://doi.org/10.1609/aaai.v34i05.6201
- Extending Nearly Complete 1-Planar Drawings in Polynomial Time / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In 45th International Symposium on Mathematical Foundations of Computer Science (pp. 1–16). LIPIcs. https://doi.org/10.4230/LIPIcs.MFCS.2020.31
- On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2020). On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 3906–3913). AAAI Press. https://doi.org/10.1609/aaai.v34i04.5804
- Extending Partial 1-Planar Drawings / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Partial 1-Planar Drawings. In 47th International Colloquium on Automata, Languages, and Programming (pp. 1–19). Leibniz International Proceedings in Informatics. https://doi.org/10.4230/LIPIcs.ICALP.2020.0
2019
- Parameterized Complexity of Asynchronous Border Minimization / 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 / Projects: FAIR, START, X-TRACT
- Parameterized Complexity Results for the Completion and Clustering of Incomplete Data / Szeider, S., Ganian, R., Kanj, I., & Ordyniak, S. (2019). Parameterized Complexity Results for the Completion and Clustering of Incomplete Data. Kocoon Workshop, Arras, Frankreich, EU. http://hdl.handle.net/20.500.12708/86961
- On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2019). On Strict (Outer-)Confluent Graphs. In Lecture Notes in Computer Science (pp. 147–161). LNCS. https://doi.org/10.1007/978-3-030-35802-0_12
- Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2019). Parameterized Algorithms for Book Embedding Problems. In Lecture Notes in Computer Science (pp. 365–378). LNCS. https://doi.org/10.1007/978-3-030-35802-0_28
- SAT-Encodings for Treecut Width and Treedepth / Ganian, R., Lodha, N., Ordyniak, S., & Szeider, S. (2019). SAT-Encodings for Treecut Width and Treedepth. In S. G. Kobourov & H. Meyerhenke (Eds.), Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM. https://doi.org/10.1137/1.9781611975499
2018
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion / Eiben, E., Ganian, R., & Kwon, O. (2018). A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of Computer and System Sciences, 97, 121–146. https://doi.org/10.1016/j.jcss.2018.05.005
- On the Complexity of Rainbow Coloring Problems / Eiben, E., Ganian, R., & Lauri, J. (2018). On the Complexity of Rainbow Coloring Problems. Discrete Applied Mathematics, 246, 38–48. https://doi.org/10.1016/j.dam.2016.10.021
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2018). The Complexity Landscape of Decompositional Parameters for ILP. Artificial Intelligence, 257, 61–71. https://doi.org/10.1016/j.artint.2017.12.006
- Meta-kernelization using well-structured modulators / Eiben, E., Ganian, R., & Szeider, S. (2018). Meta-kernelization using well-structured modulators. Discrete Applied Mathematics, 248, 153–167. https://doi.org/10.1016/j.dam.2017.09.018
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2018). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57666
- Small Resolution Proofs for QBF using Dependency Treewidth / Eiben, E., Ganian, R., & Ordyniak, S. (2018). Small Resolution Proofs for QBF using Dependency Treewidth. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57665
- Unary Integer Linear Programming with Structural Restrictions / Eiben, E., Ganian, R., & Knop, D. (2018). Unary Integer Linear Programming with Structural Restrictions. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 1284–1290). International Joint Conferences on Artificial Intelligence. http://hdl.handle.net/20.500.12708/57664
- A Structural Approach to Activity Selection / Eiben, E., Ganian, R., & Ordyniak, S. (2018). A Structural Approach to Activity Selection. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 203–209). International Joint Conferences on Artificial Intelligence. http://hdl.handle.net/20.500.12708/57663
- Parameterized Algorithms for the Matrix Completion Problem / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2018). Parameterized Algorithms for the Matrix Completion Problem. In Proceeding of ICML (pp. 1642–1651). Journal of Machine Learning Research. http://hdl.handle.net/20.500.12708/57440
2017
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Transactions on Algorithms, 13(2), 1–32. https://doi.org/10.1145/3014587
- Solving Problems on Graphs of High Rank-Width / Eiben, E., Ganian, R., & Szeider, S. (2017). Solving Problems on Graphs of High Rank-Width. Algorithmica, 80(2), 742–771. https://doi.org/10.1007/s00453-017-0290-8
- Towards a Polynomial Kernel for Directed Feedback Vertex Set / Bergnougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Towards a Polynomial Kernel for Directed Feedback Vertex Set. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (pp. 1–15). Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science. http://hdl.handle.net/20.500.12708/57302
- New Width Parameters for Model Counting / Ganian, R., & Szeider, S. (2017). New Width Parameters for Model Counting. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 38–52). International Conference on Theory and Applications of Satisfiability Testing. https://doi.org/10.1007/978-3-319-66263-3_3
- Going Beyond Primal Treewidth for (M)ILP / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Going Beyond Primal Treewidth for (M)ILP. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (pp. 815–821). http://hdl.handle.net/20.500.12708/57013
- Backdoor Treewidth for SAT / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Backdoor Treewidth for SAT. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 20–37). Springer-Verlag. https://doi.org/10.1007/978-3-319-66263-3_2
- Combining Treewidth and Backdoors for CSP / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Combining Treewidth and Backdoors for CSP. In 34th Symposium on Theoretical Aspects of Computer Science (pp. 429–445). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/LIPIcs.STACS.2017.36
2016
- Meta-kernelization with structural parameters / Ganian, R., Slivovsky, F., & Szeider, S. (2016). Meta-kernelization with structural parameters. Journal of Computer and System Sciences, 82(2), 333–346. https://doi.org/10.1016/j.jcss.2015.08.003
- Quantified conjunctive queries on partially ordered sets / Bova, S., Ganian, R., & Szeider, S. (2016). Quantified conjunctive queries on partially ordered sets. Theoretical Computer Science, 618, 72–84. https://doi.org/10.1016/j.tcs.2016.01.010
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R., Ramanujan, M. S., & Szeider, S. (2016). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. In R. Krauthgamer (Ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1670–1681). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974331.ch114
- Polynomial-Time Construction of Optimal MPI Derived Datatype Trees / Ganian, R., Kalany, M., Szeider, S., & Träff, J. L. (2016). Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016), Chicago, Illinois, USA, Non-EU. IEEE Computer Society. https://doi.org/10.1109/ipdps.2016.13 / Project: EPiGRAM
- A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion / Eiben, E., Ganian, R., & Kwon, O.-J. (2016). A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56801
- Counting Linear Extensions Parameterizations by Treewidth / Eiben, E., Ganian, R., Kangas, K., & Ordyniak, S. (2016). Counting Linear Extensions Parameterizations by Treewidth. In Proceedings of the 24th Annual European Symposium on Algorithms (pp. 1–18). http://hdl.handle.net/20.500.12708/56800
- On the Complexity Landscape of Connected f-Factor Problems* / Ganian, R., Narayanaswamy, N. S., Ordyniak, S., Rahul, C. S., & Ramanujan, M. S. (2016). On the Complexity Landscape of Connected f-Factor Problems*. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56689
- Using Decomposition-Parameters for QBF: Mind the Prefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2016). Using Decomposition-Parameters for QBF: Mind the Prefix! In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 964–970). http://hdl.handle.net/20.500.12708/56686
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2016). The Complexity Landscape of Decompositional Parameters for ILP. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 710–716). http://hdl.handle.net/20.500.12708/56685
- On Existential MSO and its Relation to ETH / Ganian, R., de Haan, R., Kanj, I., & Szeider, S. (2016). On Existential MSO and its Relation to ETH. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56669
- Backdoors to Tractable Valued CSP / Ganian, R., Ramanujan, M. S., & Szeider, S. (2016). Backdoors to Tractable Valued CSP. In Principles and Practice of Constraint Programming (Proceedings of 22nd CP) (pp. 233–250). LNCS. http://hdl.handle.net/20.500.12708/56665
2015
- FO Model Checking of Interval Graphs / Ganian, R., Hlineny, P., Kral, D., Obdrzalek, J., Schwartz, J., & Teska, J. (2015). FO Model Checking of Interval Graphs. Logical Methods in Computer Science, 11(4). https://doi.org/10.2168/lmcs-11(4:11)2015
- Model Checking Existential Logic on Partially Ordered Sets / Bova, S., Ganian, R., & Szeider, S. (2015). Model Checking Existential Logic on Partially Ordered Sets. ACM Transactions on Computational Logic, 17(2), 1–35. https://doi.org/10.1145/2814937
- Improving Vertex Cover as a Graph Parameter / Ganian, R. (2015). Improving Vertex Cover as a Graph Parameter. Discrete Mathematics & Theoretical Computer Science, 17/2, 77–100. http://hdl.handle.net/20.500.12708/151557
- Well-Structured Modulators: FPT Algorithms and Kernels / Ganian, R. (2015). Well-Structured Modulators: FPT Algorithms and Kernels. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/86165
- Algorithmic Applications of Large Well-Structured Modulators / Ganian, R. (2015). Algorithmic Applications of Large Well-Structured Modulators. Algorithmic Model Theory Meeting 2015 - ALMOTH 2015, Bayreuth, Deutschland, EU. http://hdl.handle.net/20.500.12708/86163
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R. (2015). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Contemporary Trends in Theoretical Computer Science 2015, Prag, Tschechien, EU. http://hdl.handle.net/20.500.12708/86164
- Solving Problems on Graphs of High Rank-Width / Eiben, E., Ganian, R., & Szeider, S. (2015). Solving Problems on Graphs of High Rank-Width. In Proceedings of the 14th International Symposium on Algorithms and Data Structures (pp. 314–326). LNCS. http://hdl.handle.net/20.500.12708/56453
- Community Structure Inspired Algorithms for SAT and #SAT / Ganian, R., & Szeider, S. (2015). Community Structure Inspired Algorithms for SAT and #SAT. In Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing (pp. 223–238). LNCS / Springer. http://hdl.handle.net/20.500.12708/56452
- Algorithmic Applications of Tree-Cut Width / Ganian, R., Kim, E. J., & Szeider, S. (2015). Algorithmic Applications of Tree-Cut Width. In Proceedings of the 40th International Symposium Mathematical Foundations of Computer Science 2015 (pp. 348–361). http://hdl.handle.net/20.500.12708/56451
- Meta-kernelization using Well-structured Modulators / Eiben, E., Ganian, R., & Szeider, S. (2015). Meta-kernelization using Well-structured Modulators. In T. Husfeldt & I. Kanj (Eds.), 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) (pp. 114–126). LIPICs. https://doi.org/10.4230/LIPIcs.IPEC.2015.114
- Parameterized Complexity of Asynchronous Border Minimization / Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2015). Parameterized Complexity of Asynchronous Border Minimization. In R. Jain, S. Jain, & F. Stephan (Eds.), Lecture Notes in Computer Science (pp. 428–440). Springer. https://doi.org/10.1007/978-3-319-17142-5_36 / Project: FAIR
2014
- Digraph Width Measures in Parameterized Algorithmics / 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 / Projects: Complex Reason, X-TRACT
- Lower Bounds on the Complexity of MSO1 Model-Checking / Ganian, R., Hliněný, P., Langer, A., Obdržálek, J., Rossmanith, P., & Sikdar, S. (2014). Lower Bounds on the Complexity of MSO1 Model-Checking. Journal of Computer and System Sciences, 80(1), 180–194. https://doi.org/10.1016/j.jcss.2013.07.005 / Projects: Complex Reason, X-TRACT
- Quantified Conjunctive Queries on Partially Ordered Sets / 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 / Projects: Compilation, Complex Reason, X-TRACT
- Model Checking Existential Logic on Partially Ordered Sets / 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 / Projects: Compilation, Complex Reason, X-TRACT
2013
- Meta-Kernelization with Structural Parameters / Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Contemporary Trends in Theoretical Computer Science (STTI 2013), Prague, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85671 / Project: Complex Reason
- Meta-Kernelization with Structural Parameters / Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/85670 / Project: Complex Reason
- Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes / Ganian, R., & Obdrálek, J. (2013). Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In T. Lecroq & L. Mouchard (Eds.), Combinatorial Algorithms - 24th International Workshop (pp. 164–177). Springer / LNCS. http://hdl.handle.net/20.500.12708/54878 / Project: Complex Reason
- FO Model Checking of Interval Graphs / Ganian, R., Hlinený, P., Král, D., Obdrálek, J., Schwartz, J., & Teska, J. (2013). FO Model Checking of Interval Graphs. In Automata, Languages, and Programming - 40th International Colloquium (pp. 250–262). Springer / LNCS. http://hdl.handle.net/20.500.12708/54877 / Project: Complex Reason
- Meta-kernelization with Structural Parameters / Ganian, R., Slivovsky, F., & Szeider, S. (2013). Meta-kernelization with Structural Parameters. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 457–468). Springer / LNCS. https://doi.org/10.1007/978-3-642-40313-2_41 / Project: Complex Reason
Supervisions
Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.
- Algorithmic Advances via Graph Decomposition / Hamm, T. (2022). Algorithmic Advances via Graph Decomposition [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.108300
- Parameterized algorithms for Bayesian network learning / Korchemna, V. (2021). Parameterized algorithms for Bayesian network learning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90847
- Strukturelle Parameter von ILP und MILP -Instanzen aus der Praxis / Dittmer, V. (2018). Strukturelle Parameter von ILP und MILP -Instanzen aus der Praxis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.52362