Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Full List of Publications

1102 results
[1102]Algorithmic Extensions of Dirac's Theorem
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
Chapter in , pages 406-416.
[bibtex] [pdf] [doi]
[1101]Lossy Kernels for Hitting Subgraphs
Eduard Eiben, Danny Hermelin, M. S. Ramanujan
MFCS 2017.
Note: To Appear
[bibtex]
[1100]On the Parameterized Complexity of Simultaneous Deletion Problems
Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan
FSTTCS 2017.
Note: To Appear
[bibtex]
2023
[1099]LinSets.zip: Compressing Linear Set Diagrams
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, 2023.
[bibtex] [pdf]
[1098]MosaicSets: Embedding Set Systems into Grid Graphs
Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert
IEEE Trans. Visualization and Computer Graphics, 2023.
[bibtex] [pdf]
[1097]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Comput. Geom. Theory Appl., volume 111, 2023.
[bibtex] [doi]
[1096]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
European J. Combinatorics, volume 110, pages 103662, 2023.
[bibtex] [doi]
[1095]On the Parameterized Complexity of Clustering Problems for Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Journal of Computer and System Sciences, 2023.
Note: to appear
[bibtex]
[1094]Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer.
[bibtex] [pdf] [doi]
[1093]Optimizing the positions of battery swapping stations
Tobias Rodemann, Hiroaki Kataoka, Thomas Jatschka, Günther R. Raidl, Steffen Limmer, Meguro Hiromu
Proceedings to the 6th International Electric Vehicle Technology Conference, 2023.
Note: submitted
[bibtex]
[1092]A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization (Arnaud Liefooghe, Luís Paquete, eds.), 2023, Springer.
Note: submitted
[bibtex] [pdf]
[1091]MySemCloud: Semantic-aware Word Cloud Editing
Michael Huber, Martin Nöllenburg, Anaïs Villedieu
Pacific Visualization Symposium (PacificVis'23), 2023.
Note: To appear.
[bibtex]
[1090]Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer.
[bibtex] [pdf] [doi]
[1089]A Policy-Based Learning Beam Search for Combinatorial Optimization
Rupert Ettrich, Marc Huber, Günther Raidl
Evolutionary Computation in Combinatorial Optimization – 23nd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), 2023, Springer.
Note: to appear
[bibtex] [pdf]
[1088]A logic-based algorithmic meta-theorem for mim-width
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3282-3304, 2023.
[bibtex] [pdf] [doi]
[1087]Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
[bibtex] [pdf]
[1086]On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer.
[bibtex] [doi]
[1085]Circuit Minimization with QBF-Based Exact Synthesis
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press.
Note: to appear
[bibtex]
[1084]Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity
Johannes K. Fichte, Markus Hecher, Stefan Szeider
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press.
Note: to appear
[bibtex]
[1083]A Structural Complexity Analysis of Synchronous Dynamical Systems
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press.
Note: to appear
[bibtex]
[1082]The Parameterized Complexity of Coordinated Motion Planning
Eduard Eiben, Robert Ganian, Iyad Kanj
39th International Symposium on Computational Geometry, SoCG 2023, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[1081]A Parameterized Theory of PAC Learning
Cornelius Brand, Robert Ganian, Kirill Simonov
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press.
Note: to appear
[bibtex]
[1080]The Parameterized Complexity of Network Microaggregation
Václav Blažej, Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich, Kirill Simonov
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, AAAI Press.
Note: to appear
[bibtex]
[1079]Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
39th International Symposium on Computational Geometry, SoCG 2023, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[1078]First-Order Model Checking on Structurally Sparse Graph Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
2023, arXiv.
Note: to be presented at STOC 2023
[bibtex] [pdf] [doi]
2022
[1077]47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
(Stefan Szeider, Robert Ganian, Alexandra Silva, eds.), volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[1076]Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl
ACM Transactions on Computational Logic, September 2022, Association for Computing Machinery.
[bibtex] [pdf] [doi]
[1075]Multi-level Area Balancing of Clustered Graphs
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022.
[bibtex] [doi]
[1074]Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022.
[bibtex] [doi]
[1073]Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet
Johannes Varga, Günther R. Raidl, Steffen Limmer
Access, volume 10, 2022.
[bibtex] [pdf] [doi]
[1072]Multicriteria Optimization for Dynamic Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022.
Note: TVCG Replicability Stamp
[bibtex] [doi]
[1071]Recognizing Weighted and Seeded Disk Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
J. Computational Geometry, volume 13, number 1, pages 327–376, 2022.
[bibtex] [doi]
[1070]Growth of the perfect sequence covering array number
Enrico Iurlano
Designs, Codes and Cryptography, 2022.
[bibtex] [pdf] [doi]
[1069]Twin-width and generalized coloring numbers
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Discrete Mathematics, volume 345, number 3, pages 112746, 2022.
[bibtex] [pdf] [doi]
[1068]Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences
Marko Djukanovi\'c, Aleksandar Kartelj, Dragan Mati\'c, Milana Grbi\'c, Christian Blum, Günther R. Raidl
Applied Soft Computing, volume 122, pages 108844, 2022.
[bibtex] [pdf] [doi]
[1067]Mixed Labeling: Integrating Internal and External Labels
Ladislav Čmolík, Václav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022.
[bibtex] [pdf] [doi]
[1066]Shape-Guided Mixed Metro Map Layout
Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu
Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022.
[bibtex] [doi]
[1065]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Sujoy Bhore, Guangping Li, Martin Nöllenburg
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022.
[bibtex] [doi]
[1064]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022.
[bibtex] [doi]
[1063]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., 2022.
Note: to appear
[bibtex]
[1062]An efficient algorithm for counting Markov equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
Artificial Intelligence, volume 304, pages 103648, 2022.
[bibtex] [pdf] [doi]
[1061]Threshold Treewidth and Hypertree Width
Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022.
[bibtex] [pdf] [doi]
[1060]Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
Algorithmica, 2022.
Note: to appear
[bibtex]
[1059]Algorithmic Applications of Tree-Cut Width
Robert Ganian, Eun Jung Kim, Stefan Szeider
SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022.
[bibtex] [pdf] [doi]
[1058]Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022.
[bibtex] [pdf]
[1057]Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
Robert Ganian, Jan Kratochvíl, Stefan Szeider
Discr. Appl. Math., volume 312, pages 1–2, 2022.
[bibtex] [pdf]
[1056]SAT Backdoors: Depth Beats Size
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
(Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1055]Turbocharging Heuristics for Weak Coloring Numbers
Alexander Dobler, Manuel Sorge, Anaïs Villedieu
CoRR, volume abs/2203.03358, 2022.
[bibtex] [pdf] [doi]
[1054]Removing Popular Faces in Curve Arrangements
Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
CoRR, volume abs/2202.12175, 2022.
[bibtex] [pdf]
[1053]Finding a Battleship of Uncertain Shape
Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec, Markus Wallinger
CoRR, volume abs/2202.08747, 2022.
[bibtex] [pdf]
[1052]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
SIAM J. Discret. Math., volume 36, number 2, pages 1200–1230, 2022.
[bibtex] [pdf] [doi]
[1051]A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Tobias Rodemann, Günther R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia, others, eds.), pages 32–33, feb 2022.
[bibtex] [pdf]
[1050]A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Tobias Rodemann, Günther R. Raidl
Chapter in Computer Aided Systems Theory – EUROCAST 2022, 2022, Springer.
Note: to appear
[bibtex] [pdf]
[1049]A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
M. Huber, G. R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022.
[bibtex] [pdf]
[1048]Fine-grained Complexity of Partial Minimum Satisfiability
Ivan Bliznets, Danil Sagunov, Kirill Simonov
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt, ed.), pages 1774–1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [pdf] [doi]
[1047]A Learning Large Neighborhood Search for the Staff Rerostering Problem
Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber
Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer.
[bibtex] [pdf] [doi]
[1046]A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer.
[bibtex] [pdf] [doi]
[1045]A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Farouk Yalaoui, El-Ghazali Talbi, Grégoire Danoy, eds.), volume 1541 of CCIS, pages 3–17, 2022, Springer.
[bibtex] [pdf]
[1044]A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem
M. Huber, G. R. Raidl
Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2022, Springer.
Note: to appear
[bibtex] [pdf]
[1043]Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
M. Huber, Günther R. Raidl
Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer.
[bibtex] [pdf] [doi]
[1042]Combinatorial and Algorithmic Aspects of Monadic Stability
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Sang Won Bae, Heejin Park, eds.), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1041]On Computing Optimal Linear Diagrams
Alexander Dobler, Martin Nöllenburg
Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer.
[bibtex] [pdf] [doi]
[1040]Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer.
[bibtex] [doi]
[1039]Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[1038]Learning Large Bayesian Networks with Expert Constraints
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022.
[bibtex] [pdf]
[1037]Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
Stefan Szeider, Robert Ganian, Alexandra Silva
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[1036]A SAT Approach to Twin-Width
André Schidler, Stefan Szeider
Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf] [doi]
[1035]A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[1034]A SAT Attack on Rota’s Basis Conjecture
Markus Kirchweger, Manferd Scheucher, Stefan Szeider
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1033]The Complexity of Temporal Vertex Cover in Small-Degree Graphs
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10193–10201, 2022, AAAI Press.
[bibtex] [pdf]
[1032]Parameterised Partially-Predrawn Crossing Number
Thekla Hamm, Petr Hlinený
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 46:1–46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1031]Slim Tree-Cut Width
Robert Ganian, Viktoriia Korchemna
17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[1030]Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press.
[bibtex] [pdf]
[1029]The Complexity of k-Means Clustering when Little is Known
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR.
[bibtex] [pdf]
[1028]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1027]Weighted Model Counting with Twin-Width
Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1026]Longest Cycle above Erd\Hos–Gallai Bound
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
30th Annual European Symposium on Algorithms (ESA 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[1025]Detours in Directed Graphs
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1–29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1024]A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[1023]Finding a Cluster in Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1022]Tractable Abstract Argumentation via Backdoor-Treewidth
Wolfgang Dvorak, Markus Hecher, Matthias König, Andre Schidler, Stefan Szeider, Stefan Woltran
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press.
[bibtex] [pdf]
[1021]CSP Beyond Tractable Constraint Languages
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1020]The Complexity of Envy-Free Graph Cutting
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org.
[bibtex] [pdf] [doi]
[1019]Towards Uniform Certification in QBF
Leroy Chew, Friedrich Slivovsky
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 22:1–22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1018]Testing Upward Planarity of Partial 2-Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
30th International Symposium on Graph Drawing and Network Visualization, GD 2022, September 13-16, 2022, Tokyo, Japan, 2022, Springer Verlag.
Note: to appear
[bibtex]
[1017]Parameterized Algorithms for Upward Planarity
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1016]QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 1781–1787, 2022, ijcai.org.
Note: Distinguished Paper Award
[bibtex] [pdf] [doi]
[1015]Should Decisions in QCDCL Follow Prefix Order?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1014]FPT Approximation for Fair Minimum-Load Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[1013]Lossy Kernelization of Same-Size Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings, pages 96–114, 2022, Springer-Verlag.
[bibtex] [pdf] [doi]
[1012]How to Find a Good Explanation for Clustering?
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904–3912, 2022, AAAI Press.
[bibtex] [pdf]
[1011]Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[1010]Bounding and Computing Obstacle Numbers of Graphs
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[1009]Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.
[bibtex] [pdf]
[1008]Treelike Decompositions for Transductions of Sparse Graphs
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.
[bibtex] [pdf]
[1007]Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Toruńczyk
2022, arXiv.
[bibtex] [pdf] [doi]
[1006]Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles
Thomas Jatschka
feb 2022, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl and T. Rodemann
[bibtex] [pdf]
[1005]Using Graph Neural Networks in Local Search for Edge-Based Relaxations of the Maximum Clique Problem
Rupert Ettrich
dec 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and Marc Huber
[bibtex] [pdf]
[1004]Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach
Jonas Mayerhofer
may 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and Marc Huber
[bibtex] [pdf]
[1003]A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters
Matthias Rauscher
jan 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[1002]Are Hitting Formulas Hard for Resolution?
Tomáš Peitl, Stefan Szeider
2022, Technical report abs/2206.15225, CoRR.
[bibtex] [pdf]
2021
[1001]External Labeling: Fundamental Concepts and Algorithmic Techniques
Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg
2021, Morgan & Claypool.
[bibtex] [doi]
[1000]On the Readability of Abstract Set Visualizations
Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021.
[bibtex] [doi]
[999]On Families of Planar DAGs with Constant Stack Number
Martin Nöllenburg, Sergey Pupyrev
CoRR, volume abs/2107.13658, 2021.
[bibtex] [pdf]
[998]Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings
Bojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbic, Christian Blum, Günther Raidl
Mathematics, volume 9, number 13, 2021.
[bibtex] [pdf] [doi]
[997]Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
Johannes Maschler, Günther R. Raidl
Annals of Operations Research, volume 302, pages 407–531, 2021.
[bibtex] [pdf]
[996]Labeling Nonograms: Boundary Labeling for Curve Arrangements
Fabian Klute, Maarten Löffler, Martin Nöllenburg
Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.
[bibtex] [doi]
[995]MetroSets: Visualizing Sets as Metro Maps
Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021.
[bibtex] [pdf] [doi]
[994]Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers
Benjamin Schaden, Thomas Jatschka, Steffen Limmer, Günther Robert Raidl
Energies, volume 14, number 22, 2021.
[bibtex] [pdf] [doi]
[993]A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
T. Jatschka, G. R. Raidl, T. Rodemann
Algorithms, volume 14, number 8, 2021.
[bibtex] [pdf] [doi]
[992]A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem
Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg
Computers & Operations Research, volume 126, number 105125, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf
[bibtex] [doi]
[991]A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
Matthias Horn, Günther R. Raidl, Elina Rönnberg
Annals of Operations Research, volume 302, pages 477–501, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf
[bibtex] [pdf] [doi]
[990]Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021.
[bibtex] [doi]
[989]ClusterSets: Optimizing Planar Clusters in Categorical Point Data
Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021.
[bibtex] [pdf] [doi]
[988]Measuring what matters: A hybrid approach to dynamic programming with treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
J. Comput. Syst. Sci., volume 121, pages 57–75, 2021.
[bibtex] [pdf]
[987]Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. Raidl
Computers & Operations Research, volume 125, number 105089, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
[bibtex] [pdf] [doi]
[986]Geometric Planar Networks on Bichromatic Collinear Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Theoretical Computer Science, volume 895, pages 124–136, 2021.
[bibtex] [doi]
[985]Finding the Hardest Formulas for Resolution
Tomáš Peitl, Stefan Szeider
Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021.
Note: Conference Award Track, best paper CP 2020
[bibtex] [doi]
[984]New Width Parameters for SAT and Sharp-SAT
Robert Ganian, Stefan Szeider
Artificial Intelligence, volume 295, pages 103460, 2021.
[bibtex] [pdf] [doi]
[983]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 6, pages 1605–1637, 2021.
[bibtex] [pdf]
[982]The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Algorithmica, volume 83, number 2, pages 726–752, 2021.
[bibtex] [pdf]
[981]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
Algorithmica, volume 83, number 1, pages 297–336, 2021.
[bibtex] [pdf]
[980]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
J. Graph Algorithms Appl., 2021.
[bibtex] [pdf]
[979]Parameterized k-Clustering: Tractability island
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021.
[bibtex] [pdf] [doi]
[978]The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak
Artificial Intelligence, 2021.
[bibtex] [pdf]
[977]Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths
Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl
Electron. Colloquium Comput. Complex., pages 135, 2021.
[bibtex] [pdf]
[976]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 5, pages 1201–1221, 2021.
[bibtex] [pdf]
[975]Fixed-Parameter Tractability
Marko Samer, Stefan Szeider
Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 693–736, 2021, IOS Press.
[bibtex] [pdf] [doi]
[974]Stable Visual Summaries for Trajectory Collections
Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann
Pacific Visualization Symposium (PacificVis'21), pages 61–70, 2021, IEEE.
[bibtex] [doi]
[973]Layered Area-Proportional Rectangle Contact Representation
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer.
[bibtex] [doi]
[972]Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
M. Horn, Günther R. Raidl
17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 72–88, 2021, Springer.
[bibtex] [pdf] [doi]
[971]Driver Shift Planning for an Online Store with Short Delivery Times
Matthias Horn, Nikolaus Frohner, Günther R. Raidl
Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021.
[bibtex] [pdf] [doi]
[970]Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines
Nikolaus Frohner, Matthias Horn, Günther R. Raidl
Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021.
[bibtex] [pdf] [doi]
[969]Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Jan Dreier
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13, 2021.
Note: distinguished paper
[bibtex] [doi]
[968]Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
Adrian Bracher, Nikolaus Frohner, Günther R. Raidl
17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer.
[bibtex] [pdf] [doi]
[967]Disjoint Box Covering in a Rectilinear Polygon
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Jules Wulms
European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021.
[bibtex] [pdf]
[966]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[965]Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer.
[bibtex] [pdf] [doi]
[964]Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer.
[bibtex] [doi]
[963]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM.
[bibtex] [pdf] [doi]
[962]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer.
[bibtex] [pdf] [doi]
[961]Learning fast-inference Bayesian networks
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021.
[bibtex] [pdf]
[960]Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press.
[bibtex] [pdf]
[959]Computing Optimal Hypertree Decompositions with SAT
Andre Schidler, Stefan Szeider
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021.
[bibtex] [doi]
[958]SAT-based Decision Tree Learning for Large Data Sets
André Schidler, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press.
[bibtex] [pdf]
[957]Certified DQBF Solving by Definition Extraction
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[956]Finding the Hardest Formulas for Resolution (Extended Abstract)
Tomáš Peitl, Stefan Szeider
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021.
Note: Sister Conferences Best Papers
[bibtex] [doi]
[955]Parameterized Complexity of Small Decision Tree Learning
Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454–6462, 2021, AAAI Press.
[bibtex] [pdf]
[954]Backdoor DNFs
Sebastian Ordyniak, Andre Schidler, Stefan Szeider
Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021.
[bibtex] [doi]
[953]Proof Complexity of Symbolic QBF Reasoning
Stefan Mengel, Friedrich Slivovsky
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 399–416, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[952]SAT Modulo Symmetries for Graph Generation
Markus Kirchweger, Stefan Szeider
Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing.
[bibtex] [pdf] [doi]
[951]Computing Kemeny Rankings from d-Euclidean Preferences
Thekla Hamm, Martin Lackner, Anna Rapberger
Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023 of Lecture Notes in Computer Science, pages 147–161, 2021, Springer Verlag.
[bibtex]
[950]Engineering an Efficient Boolean Functional Synthesis Engine
Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel
IEEE/ACM International Conference On Computer Aided Design, ICCAD 2021, Munich, Germany, November 1-4, 2021, pages 1–9, 2021, IEEE.
[bibtex] [pdf] [doi]
[949]The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Robert Ganian, Viktoriia Korchemna
Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021.
[bibtex] [pdf]
[948]The Complexity of Object Association in Multiple Object Tracking
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press.
[bibtex] [pdf]
[947]Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[946]The Parameterized Complexity of Clustering Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press.
[bibtex] [pdf]
[945]EPTAS for \emphk-means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (Dániel Marx, ed.), pages 2649–2659, 2021, SIAM.
[bibtex] [pdf] [doi]
[944]Approximate Evaluation of First-Order Counting Queries
Jan Dreier, Peter Rossmanith
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM.
[bibtex] [pdf] [doi]
[943]The Parameterized Complexity of Connected Fair Division
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org.
[bibtex] [pdf]
[942]Graphs with two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier.
[bibtex] [pdf]
[941]Davis and Putnam Meet Henkin: Solving DQBF with Resolution
Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[940]On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021.
[bibtex] [pdf] [doi]
[939]Parameterized Complexity of Feature Selection for Categorical Data Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (Filippo Bonchi, Simon J. Puglisi, eds.), volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1–14:14, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[938]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nollenburg, Jules Wulms
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
[bibtex] [pdf]
[937]A Learning Large Neighborhood Search for the Staff Rerostering Problem
Fabio Francisco Oberweger
oct 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and E. Rönnberg and M. Huber
[bibtex] [pdf]
[936]Computational Methods for Fleet Scheduling in E-Mobility
Johannes Varga
aug 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[935]Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power
Benjamin Schaden
apr 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[934]Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics
Giulio Pace
mar 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
[bibtex] [pdf]
2020
[933]An Iterative Time-Bucket Refinement Algorithm for a High-Resolution Resource-Constrained Project Scheduling Problem
Martin Riedler, Thomas Jatschka, Johannes Maschler, Günther R. Raidl
International Transactions in Operational Research, jan 2020.
[bibtex] [pdf] [doi]
[932]A Survey on Transit Map Layout – from Design, Machine, and Human Perspectives
Hsiang-Yun Wu, Benjamin Niedermann, Shigeo Takahashi, Maxwell J. Roberts, Martin Nöllenburg
Computer Graphics Forum, volume 39, number 3, pages 619–646, 2020.
[bibtex] [pdf] [doi]
[931]A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Applied Mathematics and Computation, volume 380, number 125233, 2020.
[bibtex] [pdf] [doi]
[930]A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Discrete Applied Mathematics, volume 228, pages 242–264, 2020.
[bibtex] [pdf] [doi]
[929]A Unified Model and Algorithms for Temporal Map Labeling
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithmica, volume 82, pages 2709–2736, 2020.
[bibtex] [doi]
[928]Placing Labels in Road Maps: Algorithms and Complexity
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithmica, volume 82, pages 1881–1908, 2020.
[bibtex] [doi]
[927]Route Schematization with Landmarks
Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering
J. Spatial Information Science, volume 21, 2020.
[bibtex] [pdf] [doi]
[926]Finding Longest Common Subsequences: New anytime A$^*$ Search Results
Marko Djukanovic, Günther R. Raidl, Christian Blum
Applied Soft Computing, volume 95, number 106400, 2020.
[bibtex] [pdf]
[925]An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
Information Processing Letters, volume 166, number 106041, 2020.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
[bibtex] [pdf] [doi]
[924]Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Computers & Operations Research, volume 114, pages 104827, 2020, Elsevier.
[bibtex] [doi]
[923]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 24, number 4, pages 603–620, 2020.
[bibtex] [doi]
[922]Using decomposition-parameters for QBF: Mind the prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
J. Comput. Syst. Sci., volume 110, pages 1–21, 2020.
[bibtex] [pdf]
[921]On Existential MSO and Its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020.
[bibtex] [pdf] [doi]
[920]Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada
Derek G. Corneil, Robert Ganian, Andrzej Proskurowski
Discr. Appl. Math., volume 278, pages 1–2, 2020.
[bibtex]
[919]Complexity of independency and cliquy trees
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Discr. Appl. Math., volume 272, pages 2–15, 2020.
[bibtex] [pdf] [doi]
[918]Crossing Layout in Non-planar Graphs
Martin Nöllenburg
Chapter in Beyond Planar Graphs (Seok-Hee Hong, Takeshi Tokuyama, eds.), pages 187–209, 2020, Springer Nature Singapore.
[bibtex] [doi]
[917]The Turing Test for Graph Drawing Algorithms
Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer.
[bibtex] [pdf] [doi]
[916]Towards Data-Driven Multilinear Metro Maps
Soeren Nickel, Martin Nöllenburg
Diagrammatic Representation and Inference (DIAGRAMS'20) (Ahti-Veikko Pietarinen, Peter Chapman, Leonie Bosveld de Smet, Valeria Giardino, James Corter, Sven Linker, eds.), volume 12169 of LNAI, pages 153–161, 2020, Springer.
[bibtex] [pdf] [doi]
[915]Labeling Nonograms
Maarten Löffler, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020.
[bibtex] [pdf]
[914]A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem
Thomas Kaufmann, Matthias Horn, Günther R. Raidl
Proceedings of PPSN XVI: Parallel Problem Solving from Nature (Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, Heike Trautmann, eds.), volume 12270 of LNCS, pages 385–398, 2020, Springer.
[bibtex] [doi]
[913]Distributing Battery Swapping Stations for Electric Scooters in an Urban Area
Thomas Jatschka, Fabio F. Oberweger, Tobias Rodemann, Günther R. Raidl
Optimization and Applications, Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer.
[bibtex] [pdf] [doi]
[912]Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 738–750, 2020, Springer.
[bibtex] [pdf]
[911]VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255–262, 2020, Springer.
[bibtex] [pdf]
[910]On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences
Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 134–149, 2020, Springer.
[bibtex] [doi]
[909]Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
Matthias Horn, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 344–351, 2020, Springer.
[bibtex] [pdf]
[908]A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility
Nikolaus Frohner, Günther R. Raidl
Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020.
[bibtex] [pdf]
[907]A Beam Search Approach to the Traveling Tournament Problem
Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer.
[bibtex] [pdf]
[906]Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers
Nikolaus Frohner, Günther R. Raidl
Machine Learning, Optimization, and Data Science – 5th International Conference, LOD 2019 (Giuseppe Nicosia, Panos Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 445–457, 2020, Springer.
[bibtex] [pdf]
[905]Casual Employee Scheduling with Constraint Programming and Metaheuristics
Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 279–287, 2020, Springer.
[bibtex] [pdf]
[904]Extending Partial 1-Planar Drawings
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Automata, Languages, and Programming (ICALP'20) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[903]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[902]On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer.
[bibtex] [pdf] [doi]
[901]A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation
Marko Djukanovic, Günther R Raidl, Christian Blum
Proceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer.
[bibtex] [pdf] [doi]
[900]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Sujoy Bhore, Guangping Li, Martin Nöllenburg
Algorithms (ESA'20) (Fabrizio Grandoni, Peter Sanders, Grzegorz Herman, eds.), volume 173 of LIPIcs, pages 19:1–19:24, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[899]Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'20), pages 66:1–66:6, 2020.
[bibtex] [pdf]
[898]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer.
[bibtex] [pdf] [doi]
[897]Layered Fan-Planar Graph Drawings
Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Chrysanthi Raftopoulou
Mathematical Foundations of Computer Science (MFCS'20) (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 14:1–14:13, 2020, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[896]Geometric Planar Networks on Bichromatic Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Algorithms and Discrete Applied Mathematics (CALDAM'20) (Manoj Changat, Sandip Das, eds.), volume 12016 of LNCS, pages 79–91, 2020, Springer.
[bibtex] [pdf] [doi]
[895]MaxSAT-Based Postprocessing for Treedepth
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag.
[bibtex] [pdf] [doi]
[894]A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Friedrich Slivovsky, Stefan Szeider
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 267–276, 2020, Springer Verlag.
[bibtex] [pdf]
[893]Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing
Friedrich Slivovsky
Computer Aided Verification - 32nd International Conference, CAV 2020 (Shuvendu K. Lahiri, Chao Wang, eds.), volume 12224 of Lecture Notes in Computer Science, pages 508–528, 2020, Springer Verlag.
[bibtex] [pdf]
[892]Short Q-Resolution Proofs with Homomorphisms
Ankit Shukla, Friedrich Slivovsky, Stefan Szeider
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 412–428, 2020, Springer Verlag.
[bibtex] [pdf]
[891]Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness
Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 429–446, 2020, Springer Verlag.
[bibtex]
[890]Computing Optimal Hypertree Decompositions
André Schidler, Stefan Szeider
Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf]
[889]Finding the Hardest Formulas for Resolution
Tomáš Peitl, Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 514–530, 2020, Springer Verlag.
Note: Best Paper Award
[bibtex] [pdf]
[888]Formalizing Graph Trail Properties in Isabelle/HOL
Laura Kovács, Hanna Lachnitt, Stefan Szeider
Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller, Bruce R. Miller, eds.), volume 12236 of Lecture Notes in Computer Science, pages 190–205, 2020, Springer Verlag.
[bibtex] [pdf]
[887]Threshold Treewidth and Hypertree Width
Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020.
[bibtex] [pdf] [doi]
[886]Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020.
[bibtex] [pdf]
[885]On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press.
[bibtex] [pdf]
[884]An Efficient Algorithm for Counting Markov Equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press.
[bibtex] [pdf]
[883]The Complexity Landscape of Resource-Constrained Scheduling
Robert Ganian, Thekla Hamm, Guillaume Mescoff
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org.
[bibtex] [pdf]
[882]Building Large k-Cores from Sparse Graphs
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza, Daniel Kráľ, eds.), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[881]Low-Rank Binary Matrix Approximation in Column-Sum Norm
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) (Jarosław Byrka, Raghu Meka, eds.), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1–32:18, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[880]Towards Faster Reasoners by Using Transparent Huge Pages
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, volume 12333 of Lecture Notes in Computer Science, pages 304–322, 2020, Springer Verlag.
[bibtex]
[879]Breaking Symmetries with RootClique and LexTopsort
Johannes K. Fichte, Markus Hecher, Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 286–303, 2020, Springer Verlag.
[bibtex] [pdf]
[878]A Time Leap Challenge for SAT-Solving
Johannes K. Fichte, Markus Hecher, Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 267–285, 2020, Springer Verlag.
[bibtex] [pdf]
[877]Solving the Steiner Tree Problem with few Terminals
Johannes Klaus Fichte, Markus Hecher, André Schidler
32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293–300, 2020, IEEE.
[bibtex]
[876]Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press.
[bibtex] [pdf]
[875]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[874]Extending Partial 1-Planar Drawings
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[873]Manipulating Districts to Win Elections: Fine-Grained Complexity
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1902–1909, 2020, AAAI Press.
[bibtex] [pdf]
[872]Hard Problems on Random Graphs
Jan Dreier, Henri Lotze, Peter Rossmanith
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168 of Leibniz International Proceedings in Informatics (LIPIcs), pages 40:1–40:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[871]Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size
Jan Dreier, Philipp Kuinke, Peter Rossmanith
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[870]First-Order Model-Checking in Random Graphs and Complex Networks
Jan Dreier, Philipp Kuinke, Peter Rossmanith
28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[869]Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen, Robert Ganian, Thekla Hamm
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org.
[bibtex] [pdf]
[868]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer Verlag.
[bibtex] [pdf]
[867]Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths
Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag.
[bibtex] [pdf]
[866]Hard QBFs for Merge Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[865]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[864]A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
09 2020, Presentation, CPAIOR2020.
[bibtex] [pdf]
[863]Combinatorial Optimization Approaches for Graph Construction Problems
Benedikt Klocker
apr 2020, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther R. Raidl
[bibtex] [pdf]
[862]Casual Employee Scheduling with Constraint Programming and Metaheuristics
Stephan Teuschl
nov 2020, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
[bibtex] [pdf]
[861]Solving a Generalized Constrained Longest Common Subsequence Problem
Christoph Berger
jun 2020, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Djukanovic
[bibtex] [pdf]
[860]Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots
Simeon Kuran
mar 2020, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and A. Chwatal
[bibtex] [pdf]
2019
[859]Metabopolis: scalable network layout for biological pathway diagrams in urban map style
Hsiang-Yun Wu, Martin Nöllenburg, Filipa L. Sousa, Ivan Viola
BMC Bioinformatics, volume 20, pages 187, 2019.
[bibtex] [doi]
[858]Exact Approaches for Network Design Problems with Relays
M. Leitner, I. Ljubić, M. Riedler, M. Ruthmair
INFORMS Journal on Computing, volume 31, number 1, pages 171–192, 2019.
[bibtex] [doi]
[857]Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses
Aleksandar Nesic, Matthias Blaicher, Tobias Hoose, Andreas Hofmann, Matthias Lauermann, Yasar Kutuvantavida, Martin Nöllenburg, Sebastian Randel, Wolfgang Freude, Christian Koos
Optics Express, volume 27, number 12, pages 17402–17425, 2019.
[bibtex] [doi]
[856]Minimizing crossings in constrained two-sided circular graph layouts
Fabian Klute, Martin Nöllenburg
J. Computational Geometry, volume 10, number 2, pages 45–69, 2019.
[bibtex] [doi]
[855]Lombardi Drawings of Knots and Links
Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
J. Computational Geometry, volume 10, number 1, pages 444–476, 2019.
[bibtex] [doi]
[854]Snarks with Special Spanning Trees
Arthur Hoffmann-Ostenhof, Thomas Jatschka
Graphs and Combinatorics, volume 35, number 1, pages 207–219, 2019, Springer.
[bibtex] [pdf] [doi]
[853]Job Sequencing with One Common and Multiple Secondary Resources: An A*/Beam Search Based Anytime Algorithm
Matthias Horn, Günther Raidl, Christian Blum
Artificial Intelligence, volume 277, number 103173, 2019.
[bibtex] [doi]
[852]Short Plane Supports for Spatial Hypergraphs
Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan
J. Graph Algorithms Appl., volume 23, number 3, pages 463–498, 2019.
[bibtex] [doi]
[851]On the Readability of Leaders in Boundary Labeling
Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Information Visualization, volume 18, number 1, pages 110–132, 2019.
[bibtex] [doi]
[850]External Labeling Techniques: A Taxonomy and Survey
Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg
Computer Graphics Forum, volume 38, number 3, pages 833–860, 2019.
[bibtex] [pdf] [doi]
[849]Planar Drawings of Fixed-Mobile Bigraphs
Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis Tollis
Theoretical Computer Science, volume 795, pages 408–419, 2019.
[bibtex] [doi]
[848]Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Algorithms, volume 12, number 7, pages 127:1–127:37, 2019.
[bibtex] [pdf] [doi]
[847]Dependency Learning for QBF
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019.
[bibtex] [pdf] [doi]
[846]Long-Distance Q-Resolution with Dependency Schemes
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Journal of Automated Reasoning, volume 63, number 1, pages 127–155, 2019.
[bibtex] [pdf] [doi]
[845]On the Parameterized Complexity of (k,s)-SAT
Daniël Paulusma, Stefan Szeider
Information Processing Letters, volume 143, pages 34–36, 2019.
[bibtex] [pdf] [doi]
[844]A SAT Approach to Branchwidth
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019.
[bibtex] [pdf] [doi]
[843]Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Robert Ganian, Sebastian Ordyniak
Algorithms, volume 12, number 12, pages 248, 2019.
[bibtex] [pdf]
[842]On the Complexity Landscape of Connected f-Factor Problems
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
Algorithmica, volume 81, number 6, pages 2606–2632, 2019.
[bibtex] [pdf]
[841]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Algorithmica, volume 81, number 1, pages 201–223, 2019.
[bibtex] [pdf]
[840]Shrub-Depth: Capturing Height of Dense Graphs
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Logical Methods in Computer Science, 2019.
[bibtex] [pdf]
[839]Counting linear extensions: Parameterizations by treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Algorithmica, 2019.
[bibtex] [pdf]
[838]Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
Ronald de Haan, Stefan Szeider
MDPI Algorithms, volume 12, number 9, pages 1–28, 2019.
[bibtex] [pdf] [doi]
[837]VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 70–71, feb 2019.
[bibtex] [pdf]
[836]Metaheuristic Hybrids
Günther R. Raidl, Jakob Puchinger, Christian Blum
Chapter in Handbook of Metaheuristics (Michel Gendreau, Jean Yves Potvin, eds.), pages 385–417, 2019, Springer.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
[bibtex]
[835]Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
Matthias Horn, Günther R. Raidl
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 94–95, 2019.
[bibtex] [pdf]
[834]Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization
Nikolaus Frohner, Stephan Teuschl, Günther R. Raidl
Chapter in Extended Abstracts of the 17th International Conference on Computer Aided Systems Theory (EUROCAST 2019) (Alexis Quesada-Arencibia, others, eds.), pages 78–79, 2019.
[bibtex] [pdf]
[833]A Memetic Algorithm for Competitive Facility Location Problems
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Chapter in Business and Consumer Analytics: New Ideas, pages 637–660, 2019, Springer.
[bibtex] [pdf]
[832]Strategies for Iteratively Refining Layered Graph Models
Martin Riedler, Mario Ruthmair, Günther R. Raidl
Hybrid Metaheuristics: 11th International Workshop, HM 2019 (M. J. Blesa Aguilera, C. Blum, H. Gambini Santos, P. Pinacho-Davidson, J. Godoy del Campo, eds.), volume 11299 of LNCS, pages 46–62, 2019, Springer.
[bibtex] [doi]
[831]Computing Stable Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 46–60, 2019, Springer.
[bibtex] [pdf] [doi]
[830]A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems
Christian Kloimüllner, Günther R. Raidl
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 184–200, 2019, Springer.
[bibtex] [pdf] [doi]
[829]A SAT Approach for Finding Sup-Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Learning and Intelligent Optimization. LION 2019, volume 11968 of LNCS, pages 325–341, 2019, Springer.
[bibtex] [pdf]
[828]A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization (Arnaud Liefooghe, Luís Paquete, eds.), volume 11452 of LNCS, pages 1–16, 2019, Springer.
[bibtex] [pdf]
[827]A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem
Christian Blum, Dhananjay Thiruvady, Andreas T. Ernst, Matthias Horn, Günther R. Raidl
Proceedings of AI 2019: Advances in Artificial Intelligence (Jixue Liu, James Bailey, eds.), volume 11919 of LNCS, pages 549–560, 2019, Springer.
[bibtex] [doi]
[826]Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 323–336, 2019, Springer.
[bibtex] [pdf] [doi]
[825]Efficient Segment Folding is Hard
Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara, Katsuhisa Yamanaka
Canadian Conference on Computational Geometry (CCCG'19), pages 177–183, 2019.
[bibtex]
[824]Exploring Semi-Automatic Map Labeling
Fabian Klute, Guangping Li, Raphael Löffler, Martin Nöllenburg, Manuela Schmidt
Advances in Geographic Information Systems (SIGSPATIAL'19), pages 13–22, 2019, ACM.
[bibtex] [pdf] [doi]
[823]Towards Improving Merging Heuristics for Binary Decision Diagrams
Nikolaus Frohner, Günther R. Raidl
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 30–45, 2019, Springer.
[bibtex] [pdf]
[822]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 147–161, 2019, Springer.
[bibtex] [pdf] [doi]
[821]Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks
Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu
IFIP Networking Conference (Networking'19), pages 1–9, 2019, IEEE.
[bibtex] [doi]
[820]A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Proceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 429-437, 2019, Springer.
[bibtex] [doi]
[819]A Heuristic Approach for Solving the Longest Common Square Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory (EUROCAST 2019), 2019.
Note: accepted for presentation
[bibtex] [pdf]
[818]Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem
Marko Djukanovic, Günther R. Raidl, Christian Blum
Proceedings of LION 12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199–214, 2019, Springer.
[bibtex] [doi]
[817]Mixed Linear Layouts: Complexity, Heuristics, and Experiments
Philipp de Col, Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 460–467, 2019, Springer.
[bibtex] [pdf] [doi]
[816]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'19) (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of LNCS, pages 365–378, 2019, Springer.
[bibtex] [pdf] [doi]
[815]Refined Complexity of PCA with Outliers
Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri, Ruslan Salakhutdinov, eds.), volume 97 of Proceedings of Machine Learning Research, pages 5818–5826, 2019, PMLR.
[bibtex] [pdf]
[814]Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019.
[bibtex] [pdf]
[813]Proof Complexity of Fragments of Long-Distance Q-resolution
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[812]Combining Resolution-Path Dependencies with Dependency Learning
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 306–318, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[811]Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time
Thekla Hamm
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen, Jan Arne Telle, eds.), volume 148 of LIPIcs, pages 20:1–20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[810]A Join-Based Hybrid Parameter for Constraint Satisfaction
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
Proceedings of CP 2019, the 25th International Conference on Principles and Practice of Constraint Programming (Thomas Schiex, Simon de Givry, eds.), volume 11802 of Lecture Notes in Computer Science, pages 195–212, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[809]The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019.
[bibtex] [pdf]
[808]SAT-Encodings for Treecut Width and Treedepth
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf] [doi]
[807]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer Verlag.
[bibtex] [pdf]
[806]Solving integer quadratic programming via explicit and structural restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019.
[bibtex] [pdf]
[805]The Parameterized Complexity of Cascading Portfolio Scheduling
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019.
[bibtex] [pdf]
[804]Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019.
[bibtex] [pdf]
[803]Integer Programming and Incidence Treedepth
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer Verlag.
[bibtex] [pdf]
[802]Hardness of FO Model-Checking on Random Graphs
Jan Dreier, Peter Rossmanith
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of LIPIcs, pages 11:1–11:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[801]Motif Counting in Preferential Attachment Graphs
Jan Dreier, Peter Rossmanith
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), volume 150 of LIPIcs, pages 13:1–13:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[800]The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
14th International Symposium on Parameterized and Exact Computation (IPEC 2019), volume 148 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1–10:16, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[799]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer Verlag.
[bibtex] [pdf]
[798]Patient Scheduling in Particle Therapy
Johannes Maschler
mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl
[bibtex] [pdf]
[797]Algorithmic Approaches for Optimization Problems in Bike Sharing and Security Control
Christian Kloimüllner
mar 2019, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by Günther R. Raidl
[bibtex] [pdf]
[796]A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem
Thomas Kaufmann
dec 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and M. Horn
[bibtex] [pdf]
[795]Perfect Pseudo Matchings on Snarks
Benjamin Schwendinger
may 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[794]Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Benedikt Klocker
apr 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[793]A Heuristic Approach to Aircraft Trajectory Optimization with Constraints
Andreas Windbichler
mar 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[792]Automated Calculation of Optimal Adjustment Parameters for Myoelectric Hand Prostheses
Sigrid Gerger
mar 2019, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
2018
[791]Exact approaches for the directed network design problem with relays
Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair
Omega, 2018.
[bibtex] [pdf] [doi]
[790]Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
Martin Riedler, Günther Raidl
Computers & Operations Research, volume 96, pages 30–54, 2018.
[bibtex] [pdf] [doi]
[789]Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
IEEE Trans. Visualization and Computer Graphics, volume 24, number 5, pages 1814–1827, 2018.
[bibtex] [doi]
[788]Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments
Johannes Maschler, Günther R. Raidl
International Transactions in Operational Research, 2018.
[bibtex] [pdf] [doi]
[787]Scalable Set Visualizations (Dagstuhl Seminar 17332)
Yifan Hu, Luana Micallef, Martin Nöllenburg, Peter Rodgers
Dagstuhl Reports, volume 7, number 8, pages 1–22, 2018.
[bibtex] [doi]
[786]Planar and poly-arc Lombardi drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg
J. Computational Geometry, volume 9, number 1, pages 328–355, 2018.
[bibtex] [doi]
[785]A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Transportation Science, volume 52, number 3, pages 673–690, 2018.
Note: previous technical report available at https://www.ac.tuwien.ac.at/files/tr/ac-tr-16-001.pdf
[bibtex]
[784]The complexity landscape of decompositional parameters for ILP
Robert Ganian, Sebastian Ordyniak
Artificial Intelligence, volume 257, pages 61–71, 2018.
[bibtex] [pdf]
[783]Meta-kernelization using well-structured modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Discr. Appl. Math., volume 248, pages 153–167, 2018.
[bibtex] [pdf] [doi]
[782]Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithmica, volume 80, number 2, pages 742–771, 2018.
[bibtex] [pdf] [doi]
[781]On the complexity of rainbow coloring problems
Eduard Eiben, Robert Ganian, Juho Lauri
Discr. Appl. Math., volume 246, pages 38–48, 2018.
[bibtex] [pdf]
[780]A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Journal of Computer and System Sciences, volume 97, pages 121–146, 2018.
[bibtex] [pdf]
[779]Graph Visualization
Yifan Hu, Martin Nöllenburg
Chapter in Encyclopedia of Big Data Technologies (Sherif Sakr, Albert Zomaya, eds.), 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
[778]A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
Eurographics Conference on Visualization (EuroVis'18) – Posters (Anna Puig, Renata Raidou, eds.), pages 57–59, 2018.
[bibtex] [doi]
[777]Semi-Automated Location Planning for Urban Bike-Sharing Systems
Markus Straub, Christian Rudloff, Anita Graser, Christian Kloimüllner, Günther R. Raidl, Markus Pajones, Felix Beyer
Proceedings of the 7th Transport Research Arena (TRA 2018), pages 1–10, 2018.
[bibtex] [pdf]
[776]Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments
Johannes Maschler, Martin Riedler, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2017, Part I, pages 364–372, 2018, Springer.
[bibtex] [pdf] [doi]
[775]Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem
Johannes Maschler, Günther R. Raidl
PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 375–397, 2018.
[bibtex] [pdf]
[774]Towards Characterizing Strict Outerconfluent Graphs
Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 612–614, 2018, Springer.
[bibtex] [pdf]
[773]Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Fabian Klute, Martin Nöllenburg
Computational Geometry (SoCG'18) (Bettina Speckmann, Csaba D. Tóth, eds.), pages 53:1–53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[772]Experimental Evaluation of Book Drawing Algorithms
Jonathan Klawitter, Tamara Mchedlidze, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 224–238, 2018, Springer.
[bibtex] [pdf] [doi]
[771]Finding Smooth Graphs with Small Independence Numbers
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 527-539, 2018, Springer.
[bibtex] [pdf]
[770]Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Benedikt Klocker, Günther R Raidl
Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 355-363, 2018, Springer.
[bibtex] [pdf]
[769]Lombardi Drawings of Knots and Links
Philipp Kindermann, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, Birgit Vogtenhuber
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 113–126, 2018, Springer.
[bibtex] [pdf] [doi]
[768]An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows
Matthias Horn, Günther R. Raidl, Elina Rönnberg
PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, pages 235–256, 2018.
[bibtex] [pdf]
[767]Minimzing Wiggles in Storyline Visualizations
Theresa Fröschl, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 585–587, 2018, Springer.
[bibtex] [pdf]
[766]GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez
Computer Aided Systems Theory – EUROCAST 2017, Part I (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 10671 of LNCS, pages 299-306, 2018, Springer.
[bibtex] [pdf]
[765]Short Plane Supports for Spatial Hypergraphs
Thom Casterman, Mereke van Garderen, Wouter Meulemans, Martin Nöllenburg, Xiaoru Yuan
Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 53–66, 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
[764]Planar L-Drawings of Directed Graphs
Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 465–478, 2018, Springer.
[bibtex] [pdf] [doi]
[763]Planar Drawings of Fixed-Mobile Bigraphs
Michael Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis
Graph Drawing and Network Visualization (GD'17) (Fabrizio Frati, Kwan-Liu Ma, eds.), volume 10692 of LNCS, pages 426–439, 2018, Springer.
[bibtex] [pdf] [doi]
[762]Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Evmorfia Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi Raftopoulou, Alexander Wolff
Graph Drawing and Network Visualization (GD'18) (Therese Biedl, Andreas Kerren, eds.), volume 11282 of LNCS, pages 509–523, 2018, Springer International Publishing.
[bibtex] [pdf] [doi]
[761]Polynomial-Time Validation of QCDCL Certificates
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of SAT 2018, the 21st International Conference on Theory and Applications of Satisfiability Testing, Part of FLoC 2018, July 9–12, 2018, Oxford, UK (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 253–269, 2018, Springer Verlag.
[bibtex] [pdf] [doi]
[760]Portfolio-Based Algorithm Selection for Circuit QBFs
Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
QBF Workshop, 2018.
[bibtex]
[759]Portfolio-Based Algorithm Selection for Circuit QBFs
Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 195–209, 2018, Springer Verlag.
[bibtex] [pdf] [doi]
[758]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 33:1–33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[757]Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Proceedings of ICTAI 2018, the 30th IEEE International Conference on Tools with Artificial Intelligence (Lefteri H. Tsoukalas, Éric Grégoire, Miltiadis Alamaniotis, eds.), pages 733–737, 2018, IEEE.
[bibtex] [pdf] [doi]
[756]Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of ICML, the Thirty-fifth International Conference on Machine Learning, Stockholm, July 10–15, 2018, pages 1642–1651, 2018, JMLR.org.
Note: ISSN: 1938-7228
[bibtex] [pdf]
[755]An SMT Approach to Fractional Hypertree Width
Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag.
[bibtex] [pdf] [doi]
[754]Small Resolution Proofs for QBF using Dependency Treewidth
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[753]A Structural Approach to Activity Selection
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org.
[bibtex] [pdf]
[752]Unary Integer Linear Programming with Structural Restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org.
[bibtex] [pdf]
[751]Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applications
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
44th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2018), volume 10706 of Lecture Notes in Computer Science, pages 125–136, 2018, Springer Verlag.
[bibtex] [pdf] [doi]
[750]Portfolio Solvers for QDIMACS and QCIR
Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
2018.
Note: QBF Evaluation at SAT
[bibtex]
[749]Advances in Decomposition Approaches for Mixed Integer Linear Programming
Martin Riedler
Nov 2018, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl
[bibtex] [pdf]
[748]Methods for Intraday Scheduling in Particle Therapy
Michael Höfler
nov 2018, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Maschler
[bibtex] [pdf]
[747]Local Search Methods for the Particle Therapy Patient Scheduling Problem
Thomas Hackl
sep 2018, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Maschler
[bibtex] [pdf]
[746]Monero Chross-Chain Traceability
Abraham Hinteregger
sep 2018, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[745]Parallel Hybrid Metaheuristics for Solving the Firefighter Problem Using the GPU
Gajo Gajic
jun 2018, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and C. Bacher
[bibtex] [pdf]
2017
[744]Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)
(Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider, eds.), volume 7 of Dagstuhl Reports, 2017.
[bibtex] [pdf] [doi]
[743]Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
M. S. Ramanujan, Saket Saurabh
ACM Trans. Algorithms, volume 13, number 4, pages 46:1–46:25, 9 2017, Assoc. Comput. Mach., New York.
[bibtex] [pdf] [doi]
[742]Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm
Petrica C. Pop, Cosmin Sabo, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Carpathian Journal of Mathematics, volume 33, number 3, pages 365–371, 2017.
[bibtex] [pdf]
[741]Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
International Journal of Computational Geometry and Applications, volume 27, number 1–2, pages 121–158, 2017.
[bibtex] [doi]
[740]Euclidean Greedy Drawings of Trees
Martin Nöllenburg, Roman Prutkin
Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017.
[bibtex] [doi]
[739]Large Neighborhood Search for the Most Strings with Few Bad Columns Problem
Evelia Liźarraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
Soft Computing, volume 21, number 17, pages 4901–4915, 2017.
[bibtex] [pdf]
[738]Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition
Christian Kloimüllner, Günther R. Raidl
Networks, volume 69, number 3, pages 270–289, 2017.
Note: previous technical report available at https://www.ac.tuwien.ac.at/files/pub/kloimuellner-17a.pdf
[bibtex] [pdf] [doi]
[737]Progress on Partial Edge Drawings
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
J. Graph Algorithms Appl., volume 21, number 4, pages 757–786, 2017.
[bibtex] [doi]
[736]The Treewidth of Proofs
Moritz Müller, Stefan Szeider
Information and Computation, volume 255, pages 147–164, 2017.
[bibtex] [pdf] [doi]
[735]Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
SIAM J. Discrete Math., volume 31, number 2, pages 1294–1327, 2017.
[bibtex] [pdf] [doi]
[734]Hitting (Selected) Odd Cycles
Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
SIAM J. Discrete Math., volume 31, number 3, pages 1581–1615, 2017.
[bibtex] [pdf]
[733]On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances
Ronald de Haan, Iyad Kanj, Stefan Szeider
ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.
[bibtex] [pdf] [doi]
[732]Backdoors into heterogeneous classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny
Journal of Computer and System Sciences, volume 85, pages 38–56, 2017.
[bibtex] [pdf] [doi]
[731]Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
ACM Transactions on Algorithms, volume 13, number 2, pages 29:1–29:32, 2017.
[bibtex] [pdf] [doi]
[730]Kernelization using structural parameters on sparse graph classes
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
Journal of Computer and System Sciences, volume 84, pages 219–242, 2017.
[bibtex]
[729]Parameterized Complexity Classes Beyond Para-NP
Ronald de Haan, Stefan Szeider
Journal of Computer and System Sciences, volume 87, pages 16–57, 2017.
[bibtex] [pdf] [doi]
[728]Faster exact algorithms for some terminal set problems
Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
J. Comput. Syst. Sci., volume 88, pages 195–207, 2017.
[bibtex] [pdf] [doi]
[727]Metric Dimension of Bounded Tree-length Graphs
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
SIAM J. Discrete Math., volume 31, number 2, pages 1217–1243, 2017.
[bibtex] [pdf] [doi]
[726]Free Weak Nilpotent Minimum Algebras
Stefano Aguzzoli, Simone Bova, Diego Valota
Soft Computing, volume 21(1), pages 79–95, 2017.
[bibtex]
[725]Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd
Ujwal Gadiraju, Sebastian Möller, Martin Nöllenburg, Dietmar Saupe, Sebastian Egger-Lampl, Daniel Archambault, Brian Fisher
Chapter in Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (Daniel Archambault, Helen Purchase, Tobias Hoßfeld, eds.), volume 10264 of LNCS, pages 6–26, 2017, Springer International Publishing.
[bibtex] [doi]
[724]Backdoor Sets for CSP
Serge Gaspers, Sebastian Ordyniak, Stefan Szeider
Chapter in The Constraint Satisfaction Problem: Complexity and Approximability (Andrei A. Krokhin, Stanislav Zivny, eds.), volume 7 of Dagstuhl Follow-Ups, pages 137–157, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[723]Minimizing crossings in constrained two-sided circular graph layouts
Fabian Klute, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017.
[bibtex] [pdf]
[722]Radial Contour Labeling with Straight Leaders
Benjamin Niedermann, Martin Nöllenburg, Ignaz Rutter
IEEE Pacific Visualization Symposium (PacificVis'17), pages 295–304, 2017.
[bibtex] [pdf] [doi]
[721]A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem
Johannes Maschler, Günther R. Raidl
Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 393–399, 2017, Springer.
[bibtex] [pdf]
[720]Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments
Johannes Maschler, Martin Riedler, Günther R. Raidl
Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 106–107, 2017.
[bibtex] [pdf]
[719]An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem
Johannes Maschler, Thomas Hackl, Martin Riedler, Günther R. Raidl
Proceedings of the 12th Metaheuristics International Conference, pages 465–474, 2017.
[bibtex] [pdf]
[718]A Linear-Time Parameterized Algorithm for Node Unique Label Cover
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs, Christian Sohler, eds.), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 57:1–57:15, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[717]Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem
Christian Kloimüllner, Günther R. Raidl
Conference Proceedings of Learning and Intelligent Optimization Conference (LION 11) (Roberto Battiti, Dmitri Kvasov, Yaroslav Sergeyev, eds.), volume 10556 of LNCS, pages 1–16, 2017, Springer.
[bibtex] [pdf] [doi]
[716]Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging
Benedikt Klocker, Günther R Raidl
Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory (EUROCAST 2017) (Alexis Quesada-Arencibia, José Carlos Rodríguez, Roberto Moreno-Díaz, eds.), pages 104–105, 2017.
[bibtex] [pdf]
[715]Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control
Bong-Min Kim, Christian Kloimüllner, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization. EvoCOP 2017 (Bin Hu, Manuel López-Ibáñez, eds.), volume 10197 of LNCS, pages 91–107, 2017, Springer.
[bibtex] [pdf]
[714]Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment
Matthias Horn, Günther R. Raidl, Christian Blum
MOD 2017: Machine Learning, Optimization, and Big Data – Third International Conference (Giovanni Giuffrida, Giuseppe Nicosia, Panos Pardalos, Renato Umeton, eds.), volume 10710 of LNCS, pages 506–518, 2017, Springer.
[bibtex] [pdf]
[713]GRASP and VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
Airam Expósito, Günther R. Raidl, Julio Brito, José A. Moreno-Pérez
Extended Abstracts of the Sixteenth International Conference on Computer Aided Systems Theory – EUROCAST 2017 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), 2017.
[bibtex]
[712]A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem
Frederico Dusberger, Günther R. Raidl
Operations Research Proceedings 2015 — Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1–4, 2015 (Karl Franz Dörner, Ivana Ljubić, Georg Pflug, Gernot Tragler, eds.), pages 385–391, 2017, Springer.
[bibtex] [pdf]
[711]Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
M. S. Ramanujan, Stefan Szeider
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929–3935, 2017.
[bibtex] [pdf]
[710]Dependency learning for QBF
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 298–313, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[709]Linear Representation of Transversal Matroids and Gammoids parameterized by rank
Fahad Panolan, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings (Yixin Cao, Jianer Chen, eds.), pages 420–432, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[708]Lossy kernelization
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 224–237, 2017.
[bibtex] [pdf] [doi]
[707]A SAT Approach to Branchwidth
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org.
Note: Sister Conference Best Paper Track
[bibtex] [pdf] [doi]
[706]SAT-Encodings for Special Treewidth and Pathwidth
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[705]New Width Parameters for Model Counting
Robert Ganian, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 38–52, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[704]Backdoor Treewidth for SAT
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 20–37, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[703]Combining Treewidth and Backdoors for CSP
Robert Ganian, M. S. Ramanujan, Stefan Szeider
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[702]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto, Takeshi Tokuyama, eds.), volume 92 of LIPIcs, pages 36:1–36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[701]Path-Contractions, Edge Deletions and Connectivity Preservation
Gregory Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström
25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs, Christian Sohler, eds.), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[700]Backdoor Trees for Answer Set Programming
Johannes Klaus Fichte, Stefan Szeider
Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. (Bart Bogaerts, Amelia Harrison, eds.), volume 1868 of CEUR Workshop Proceedings, 2017, CEUR-WS.org.
[bibtex] [pdf]
[699]SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
Johannes K. Fichte, Neha Lodha, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag.
[bibtex] [pdf] [doi]
[698]Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Pavel Dvo\v rák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 607–613, 2017, ijcai.org.
[bibtex] [pdf]
[697]Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures
Ronald de Haan, Marija Slavkovik
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
[bibtex]
[696]Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure
Ronald de Haan
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
[bibtex]
[695]Going Beyond Primal Treewidth for (M)ILP
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815–821, 2017.
[bibtex] [pdf]
[694]Saving Critical Nodes with Firefighters is FPT
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl, eds.), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 135:1–135:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[693]Circuit Treewidth, Sentential Decision, and Query Compilation
Simone Bova, Stefan Szeider
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017 (Emanuel Sallinger, Jan Van den Bussche, Floris Geerts, eds.), pages 233–246, 2017, Assoc. Comput. Mach., New York.
[bibtex] [pdf] [doi]
[692]Herbrand Property: Finite Quasi-Herbrand Models and Lifting Chandra-Merlin Theorem to Quantified Conjunctive Queries
Simone Bova, Fabio Mogavero
Proceedings of the Thirty-Second ACM/IEEE Symposium on Logic in Computer Science (LICS) June 20-23, 2017, Reykjavik, Iceland, 2017.
[bibtex]
[691]How many variables are needed to express an existential positive query?
Simone Bova, Hubie Chen
Proceeding of the Twentieth International Conference on Database Theory (ICDT), March 21-24, 2017, Venice, Italy, 2017.
Note: Best Paper Award
[bibtex]
[690]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin, eds.), volume 83 of LIPIcs, pages 36:1–36:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[689]Pareto Optimal Allocation under Uncertain Preferences
Haris Aziz, Ronald de Haan, Baharak Rastegari
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
Note: Extended Abstract
[bibtex]
[688]Stable Matching with Uncertain Pairwise Preferences
Haris Aziz, Péter Biró, Tamas Fleiner, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Proceedings of AAMAS 2017, the 16th International Conference on Autonomous Agents and Multiagent Systems, 2017, IFAAMAS/ACM.
[bibtex]
[687]An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems
Thomas Jatschka
oct 2017, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, M. Riedler, and J. Maschler
[bibtex] [pdf]
2016
[686]Hybrid Metaheuristics – Powerful Tools for Optimization
Christian Blum, Günther R. Raidl
2016, Springer.
[bibtex] [pdf]
[685]Proc. 24th International Symposium on Graph Drawing and Network Visualization (GD'16)
(Yifan Hu, Martin Nöllenburg, eds.), volume 9801 of LNCS, 2016, Springer International Publishing.
[bibtex] [doi]
[684]A Multi-Commodity Flow Based Model for Multi Layer Hierarchical Ring Network Design
Christian Schauer, Günther R. Raidl
Electronic Notes in Discrete Mathematics, volume 52, pages 189–196, 2016.
Note: INOC 2015 – 7th International Network Optimization Conference
[bibtex] [pdf] [doi]
[683]New Developments in Metaheuristics and their Applications – Selected Extended Contributions from the 10th Metaheuristics International Conference (MIC 2013)
Hoong Chuin Lau, Günther R. Raidl, Pascal Van Hentenryck
Journal of Heuristics, volume 22, number 4, pages 359–363, 2016.
[bibtex] [pdf] [doi]
[682]On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
J. Computational Geometry, volume 7, number 1, pages 47–69, 2016.
[bibtex] [pdf]
[681]Extending Convex Partial Drawings of Graphs
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
Algorithmica, volume 76, number 1, pages 47–67, 2016.
[bibtex] [doi]
[680]Mixed Map Labeling
Maarten Löffler, Martin Nöllenburg, Frank Staals
J. Spatial Information Science, volume 13, pages 3–32, 2016.
[bibtex] [doi]
[679]A Memetic Algorithm for the Virtual Network Mapping Problem
Johannes Inführ, Günther Raidl
Journal of Heuristics, volume 22, number 4, pages 475–505, 2016.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/infuehr-14.pdf
[bibtex] [doi]
[678]Evaluation of Labeling Strategies for Rotating Maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
ACM J. Experimental Algorithmics, volume 21, number 1, pages 1.4:1–1.4:21, 2016.
[bibtex] [pdf] [doi]
[677]Consistent Labeling of Rotating Maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
J. Computational Geometry, volume 7, number 1, pages 308–331, 2016.
[bibtex] [pdf]
[676]Strict Confluent Drawing
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
J. Computational Geometry, volume 7, number 1, pages 22–46, 2016.
[bibtex] [pdf]
[675]Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem
Christian Blum, Günther R. Raidl
Optimization Letters, volume 10, number 1, pages 189–205, 2016.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-15.pdf
[bibtex]
[674]An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Electronic Notes in Discrete Mathematics, volume 52, pages 245–252, 2016.
Note: INOC 2015 – 7th International Network Optimization Conference
[bibtex] [pdf]
[673]Models and Algorithms for Competitive Facility Location Problems with Different Customer Behavior
Benjamin Biesinger, Bin Hu, Günther Raidl
Annals of Mathematics and Artificial Intelligence, volume 76, number 1, pages 93–119, 2016, Springer.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14b.pdf
[bibtex]
[672]Adjacency-Preserving Spatial Treemaps
Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
J. Computational Geometry, volume 7, number 1, pages 100-122, 2016.
[bibtex] [pdf]
[671]Quantifier reordering for QBF
Friedrich Slivovsky, Stefan Szeider
Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016.
[bibtex] [pdf] [doi]
[670]Soundness of Q-resolution with dependency schemes
Friedrich Slivovsky, Stefan Szeider
Theoretical Computer Science, volume 612, pages 83–101, 2016.
[bibtex] [pdf] [doi]
[669]Model Counting for CNF Formulas of Bounded Modular Treewidth
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
Algorithmica, volume 76, number 1, pages 168–194, 2016.
[bibtex] [pdf] [doi]
[668]A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
Algorithmica, volume 75, number 1, pages 1–26, 2016.
[bibtex]
[667]Complexity and monotonicity results for domination games
Stephan Kreutzer, Sebastian Ordyniak
Theor. Comput. Sci., volume 628, pages 1–29, 2016.
[bibtex]
[666]Tree-depth and vertex-minors
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
Eur. J. Comb., volume 56, pages 46–56, 2016.
[bibtex]
[665]Backdoors to q-Horn
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
Algorithmica, volume 74, number 1, pages 540–557, 2016.
[bibtex] [pdf] [doi]
[664]Meta-Kernelization with Structural Parameters
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
Journal of Computer and System Sciences, volume 82, number 2, pages 333–346, 2016.
[bibtex] [pdf] [doi]
[663]FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska
Logical Methods in Computer Science, volume 11, number 4, 2016.
[bibtex] [pdf]
[662]Are There Any Good Digraph Measures?
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
Journal of Combinatorial Theory, Series B, volume 116, pages 250–286, 2016.
[bibtex]
[661]Directed elimination games
Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer
Discrete Applied Mathematics, volume 199, pages 187–198, 2016.
[bibtex]
[660]Quantified Conjunctive Queries on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
Theoretical Computer Science, volume 618, pages 72–84, 2016.
[bibtex] [pdf] [doi]
[659]Model Checking Existential Logic on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
ACM Transactions on Computational Logic, volume 17, number 2, 2016.
[bibtex] [doi]
[658]Partially Polynomial Kernels for Set Cover and Test Cover
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
SIAM J. Discrete Math., volume 30, number 3, pages 1401–1423, 2016.
[bibtex]
[657]Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics
Günther R. Raidl, Thomas Jatschka, Martin Riedler, Johannes Maschler
Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle, V. Maniezzo, eds.), pages 104–107, 2016.
[bibtex] [pdf]
[656]Districting and Routing for Security Control
Michael Prischink, Christian Kloimüllner, Benjamin Biesinger, Günther R. Raidl
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 87–103, 2016, Springer.
[bibtex] [pdf]
[655]Software Visualization via Hierarchic Micro/Macro Layouts
Martin Nöllenburg, Ignaz Rutter, Alfred Schuhmacher
Information Visualization Theory and Applications (IVAPP'16) (Lars Linsen, Alexandru C. Telea, eds.), pages 153–160, 2016, SciTePress.
[bibtex] [doi]
[654]An Algorithmic Framework for Labeling Road Maps
Benjamin Niedermann, Martin Nöllenburg
Geographic Information Science (GIScience '16) (Jennifer A. Miller, David O'Sullivan, Nancy Wiegand, eds.), volume 9927 of LNCS, pages 308–322, 2016, Springer International Publishing.
[bibtex] [pdf] [doi]
[653]Particle Therapy Patient Scheduling: First Heuristic Approaches
Johannes Maschler, Martin Riedler, Markus Stock, Günther R. Raidl
PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, pages 223–244, 2016.
[bibtex] [pdf]
[652]Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Hybrid Metaheuristics: 10th International Workshop, HM 2016 (Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vicenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi, eds.), volume 9668 of LNCS, pages 1–16, 2016, Springer.
[bibtex] [pdf]
[651]Temporal Map Labeling: A New Unified Framework with Experiments
Lukas Barth, Benjamin Niedermann, Martin Nöllenburg, Darren Strash
Advances in Geographic Information Systems (SIGSPATIAL'16), pages 23:1–23:10, 2016.
[bibtex] [pdf] [doi]
[650]A Faster Parameterized Algorithm for Group Feedback Edge Set
M. S. Ramanujan
Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers, pages 269–281, 2016.
[bibtex] [pdf]
[649]A Parameterized Algorithm for Mixed-Cut
Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, pages 672–685, 2016.
[bibtex] [pdf]
[648]Strong Parameterized Deletion: Bipartite Graphs
Ashutosh Rai, M. S. Ramanujan
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, pages 21:1–21:14, 2016.
[bibtex] [pdf] [doi]
[647]Long Distance Q-Resolution with Dependency Schemes
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag.
[bibtex] [pdf] [doi]
[646]Backdoors for Linear Temporal Logic
Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler
11th International Symposium on Parameterized and Exact Computation (IPEC 2016) (Jiong Guo, Danny Hermelin, eds.), volume 63 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:17, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[645]A SAT Approach to Branchwidth
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag.
[bibtex] [doi]
[644]Edge-Editing to a Dense and a Sparse Graph Class
Michal Kotrb\vcík, Rastislav Královi\vc, Sebastian Ordyniak
LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings (Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, eds.), volume 9644 of Lecture Notes in Computer Science, pages 562–575, 2016, Springer Verlag.
[bibtex]
[643]Backdoors to Tractable Valued CSP
Robert Ganian, M.S. Ramanujan, Stefan Szeider
Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings (Michel Rueher, ed.), volume 9892 of Lecture Notes in Computer Science, pages 233–250, 2016, Springer Verlag.
[bibtex] [pdf] [doi]
[642]Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Robert Ganian, M. S. Ramanujan, Stefan Szeider
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1670–1681, 2016.
[bibtex] [pdf] [doi]
[641]The Complexity Landscape of Decompositional Parameters for ILP
Robert Ganian, Sebastian Ordyniak
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 710–716, 2016, AAAI Press.
[bibtex] [pdf]
[640]Polynomial-Time Construction of Optimal MPI Derived Datatype Trees
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pages 638–647, 2016, IEEE Computer Society.
[bibtex] [pdf] [doi]
[639]On Existential MSO and its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of Leibniz International Proceedings in Informatics (LIPIcs), pages 42:1–42:14, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[638]A New Perspective on FO Model Checking of Dense Graph Classes
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, pages 176–184, 2016.
[bibtex] [pdf]
[637]On the Complexity Landscape of Connected f-factor Problems
Robert Ganian, N.S. Narayanaswamy, Sebastian Ordyniak, C.S. Rahul, Ramanujan M. S.
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), pages 41:1–41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[636]Succinctness of Languages for Judgment Aggregation
Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang
Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 176–186, 2016, AAAI Press.
[bibtex] [pdf]
[635]Counting Linear Extensions: Parameterizations by Treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
24th European Symposium of Algorithms, ESA 2016, volume 57 of LIPIcs, pages 39:1–39:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[634]Using Decomposition-Parameters for QBF: Mind the Prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (Dale Schuurmans, Michael P. Wellman, eds.), pages 964–970, 2016, AAAI Press.
[bibtex] [pdf]
[633]A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
Eduard Eiben, Robert Ganian, O-joung Kwon
Mathematical Foundations of Computer Science 2016 - 41st International Symposium, MFCS 2016 (Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds.), volume 58 of LIPIcs, pages 34:1–34:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf]
[632]Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics
Ronald de Haan, Stefan Szeider
Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral, James P. Delgrande, Frank Wolter, eds.), pages 453–462, 2016, AAAI Press.
[bibtex] [pdf]
[631]Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
Ronald de Haan
Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016) (Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen, eds.), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1502–1510, 2016.
[bibtex] [pdf]
[630]Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
Ronald de Haan
Proceedings of ComSoc 2016, the Sixth International Workshop on Computational Social Choice, 2016.
[bibtex] [pdf]
[629]Knowledge Compilation Meets Communication Complexity
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), 9-15 July, 2016, New York, NY, USA, pages 1008–1014, 2016.
[bibtex]
[628]SDDs Are Exponentially More Succinct than OBDDs
Simone Bova
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, pages 929–935, 2016.
[bibtex]
[627]SOBRA - Shielding Optimization for BRAchytherapy
Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Veli Mäkinen, Simon J. Puglisi, Leena Salmela, eds.), volume 9843 of Lecture Notes in Computer Science, pages 309–320, 2016, Springer Verlag.
[bibtex]
[626]Clique-Width and Directed Width Measures for Answer-Set Programming
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016) (Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen, eds.), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 1105–1113, 2016, IOS Press.
[bibtex]
[625]Stable Matching with Uncertain Linear Preferences
Haris Aziz, Peter Biro, Serge Gaspers, Ronald de Haan, Nicholas Mattei, Baharak Rastegari
Proceedings of SAGT 2016, the 9th International Symposium on Algorithmic Game Theory (Martin Gairing, Rahul Savani, eds.), volume 9928 of Lecture Notes in Computer Science, pages 195–206, 2016, Springer Verlag.
[bibtex] [pdf]
[624]Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem
Benjamin Biesinger
Apr 2016, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. R. Raidl and B. Hu
[bibtex] [pdf]
[623]Parameterized Complexity in the Polynomial Hierarchy
Ronald de Haan
2016, PhD thesis, Technische Universität Wien.
[bibtex] [pdf]
[622]Metaheuristics for the Districting and Routing Problem for Security Control
Michael Prischink
May 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, B. Biesinger, and C. Kloimüllner
[bibtex] [pdf]
[621]Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem
Franz Leberl
Mar 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and F. Dusberger
[bibtex] [pdf]
[620]A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem
Bernhard Bonigl
Jan 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and F. Dusberger
[bibtex] [pdf]
[619]Visibility Based Obstacle Placing – Automated Obstacle Placing Based on Circularity
Carina Schwab
Jan 2016, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and R. Schaffranek
[bibtex] [pdf]
[618]Positive and Negative Results for Parameterized Compilability
Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider
2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien.
[bibtex] [pdf]
[617]Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
Ronald de Haan
8 2016, Technical report 1608.02406, arXiv.org.
[bibtex] [pdf]
2015
[616]Numerische Optimierung elektrifizierter Antriebsstränge
Thorsten Krenek, Christopher Bacher, Thomas Lauer, Günther R. Raidl
Motortechnische Zeitschrift (MTZ), volume 03, pages 66–74, Mar 2015, Springer.