Publists

⬅️ Zurück zum Profil

2025

• Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg. J. Comput. Geom.
  📄 Details

• The Computational Complexity of Positive Non-Clashing Teaching in Graphs Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton. The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025
  📄 Details

⬅️ Zurück zum Profil

2026

• Tractability via Low Dimensionality: The Parameterized Complexity of Training Quantized Neural Networks Robert Ganian, Frank Sommer, Manuel Sorge. The Fourteenth International Conference on Learning Representations, ICLR 2026
  📄 Details

2025

• The complexity of cluster vertex splitting and company Alexander Firbas, Alexander Dobler, Fabian Holzer, Jakob Schafellner, Manuel Sorge, Anaïs Villedieu, Monika Wißmann. Discrete Applied Mathematics
  📄 Details

⬅️ Zurück zum Profil

2025

• Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem Bresich, Maria, Raidl, Günther R., Limmer, Steffen. Computer Aided Systems Theory – EUROCAST 2024
  📄 Details

⬅️ Zurück zum Profil

2026

• Graph Choosability via SAT: Beyond the Nullstellensatz Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider. The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026
  📄 Details

2025

• Breaking Symmetries in Quantified Graph Search: A Comparative Study Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider. AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA
  📄 Details

2024

• SAT Modulo Symmetries for Graph Generation and Enumeration Markus Kirchweger, Stefan Szeider. ACM Transactions on Computational Logic
  📄 Details

⬅️ Zurück zum Profil

2019

• Parameterized Complexity of Asynchronous Border Minimization Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa. Algorithmica
  📄 Details

2015

• Fixed-parameter Tractable Reductions to SAT for Planning Ronald de Haan, Martin Kronegger, Andreas Pfandler. Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina
  📄 Details

⬅️ Zurück zum Profil

2026

• Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time Bhore, Sujoy, Nöllenburg, Martin, Tóth, Csaba D., Wulms, Jules. Discrete and Computational Geometry
  📄 Details

⬅️ Zurück zum Profil

2026

• Computing Twin-Width via Treedepth and Vertex Integrity Robert Ganian, Mathis Rocton. 43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026
  📄 Details

2025

• Computing Twin-Width Parameterized by the Feedback Edge Number and Vertex Integrity Jakub Balabán, Robert Ganian, Mathis Rocton. SIAM J. Discret. Math.
  📄 Details

⬅️ Zurück zum Profil

2026

• A Parameterized-Complexity Framework for Finding Local Optima Robert Ganian, Hung P. Hoang, Christian Komusiewicz, Nils Morawietz. 17th Innovations in Theoretical Computer Science Conference, ITCS 2026
  📄 Details

⬅️ Zurück zum Profil

2026

• A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award) Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, Vaishali Surianarayanan. 2026 Symposium on Simplicity in Algorithms, SOSA 2026
  📄 Details

⬅️ Zurück zum Profil

2026

• $F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness Piselli, Tommaso, Liotta, Giuseppe, Montecchiani, Fabrizio, Nöllenburg, Martin, Di Bartolomeo, Sara. IEEE Trans. Vis. Comput. Graph.
  📄 Details

2025

• Optimizing Staircase Motifs in Biofabric Network Layouts Di Bartolomeo, Sara, Wallinger, Markus, Nöllenburg, Martin. Comput. Graph. Forum
  📄 Details