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

Full List of Publications

934 results
[934]Lossy Kernels for Hitting Subgraphs
Eduard Eiben, Danny Hermelin, M. S. Ramanujan
MFCS 2017.
Note: To Appear
[bibtex]
[933]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]
2021
[932]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, pages 105125, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf
[bibtex] [doi]
[931]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, M.S. Ramanujan
Algorithmica, 2021.
Note: to appear
[bibtex]
[930]Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021.
Note: to appear
[bibtex]
[929]SAT-based Decision Tree Learning for Large Data Sets
André Schilder, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021.
Note: to appear
[bibtex]
[928]Parameterized Complexity of Small Decision Tree Learning
Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021.
Note: to appear
[bibtex]
[927]The Complexity of Object Association in Multiple Object Tracking
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021.
Note: to appear
[bibtex]
[926]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, 2021.
Note: to appear
[bibtex]
[925]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.
Note: To be published
[bibtex] [pdf]
2020
[924]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]
[923]Multi-level Area Balancing of Clustered Graphs
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
IEEE Trans. Visualization and Computer Graphics, 2020.
[bibtex] [doi]
[922]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]
[921]MetroSets: Visualizing Sets as Metro Maps
Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, 2020.
[bibtex] [pdf] [doi]
[920]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, 2020.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf
[bibtex] [doi]
[919]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]
[918]Placing Labels in Road Maps: Algorithms and Complexity
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithmica, volume 82, pages 1881–1908, 2020.
[bibtex] [doi]
[917]Route Schematization with Landmarks
Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering
J. Spatial Information Science, volume 21, 2020.
[bibtex] [pdf] [doi]
[916]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]
[915]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, 2020.
[bibtex] [doi]
[914]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, 2020.
Note: to appear, previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
[bibtex]
[913]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]
[912]The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Algorithmica, 2020.
Note: to appear
[bibtex]
[911]Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: a Survey
Robert Ganian, Sebastian Ordyniak
MDPI Algorithms, 2020.
Note: to appear
[bibtex]
[910]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
Algorithmica, 2020.
Note: to appear
[bibtex]
[909]Using Decomposition-Parameters for QBF: Mind the Prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Journal of Computer and System Sciences, 2020.
Note: to appear
[bibtex]
[908]On Existential MSO and its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
ACM Transactions on Computation Theory, volume 12, number 4, pages 22:1–22:32, 2020.
[bibtex]
[907]An A* search algorithm for the constrained longest common subsequence problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
Information Processing Letters, pages 106041, 2020.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
[bibtex] [pdf] [doi]
[906]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]
[905]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]
[904]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, 2020.
Note: to appear
[bibtex]
[903]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]
[902]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.), 2020, Springer.
[bibtex] [pdf]
[901]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]
[900]Labeling Nonograms
Maarten Löffler, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020.
[bibtex] [pdf]
[899]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]
[898]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]
[897]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]
[896]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]
[895]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 2021: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020.
[bibtex] [pdf]
[894]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, Held as Part of EvoStar 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer.
[bibtex] [pdf]
[893]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]
[892]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]
[891]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]
[890]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]
[889]On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
, 2020.
Note: submitted to OPTIMA 2020
[bibtex] [pdf]
[888]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]
[887]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]
[886]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]
[885]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.), 2020, Springer.
[bibtex] [pdf]
[884]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]
[883]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]
[882]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]
[881]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]
[880]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]
[879]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]
[878]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]
[877]Computing Optimal Hypertree Decompositions
André Schidler, Stefan Szeider
Proceedings of ALENEX 2020, the 22nd Workshop on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf]
[876]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]
[875]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]
[874]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]
[873]Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Robert Ganian, Tomás 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]
[872]On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Dimension
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]
[871]An Efficient Algorithm for Counting Markov Equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, 2020.
Note: to appear
[bibtex]
[870]The Complexity Landscape of Resource-Constrained Scheduling
Robert Ganian, Thekla Hamm, Guillaume Mescoff
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, 2020.
Note: to appear
[bibtex]
[869]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]
[868]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]
[867]Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, 2020.
Note: to appear
[bibtex]
[866]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nollenburg
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Note: to appear
[bibtex]
[865]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, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Note: to appear
[bibtex]
[864]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]
[863]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]
[862]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]
[861]Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen, Robert Ganian, Thekla Hamm
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, 2020.
Note: to appear
[bibtex]
[860]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Proceedings of GD 2020, the 28th International Symposium on Graph Drawing and Network Visualization, 2020.
Note: To appear
[bibtex]
[859]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]
[858]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
37th Symposium on Theoretical Aspects of Computer Science, STACS 2020, 2020, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Note: to appear
[bibtex]
[857]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]
[856]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]
[855]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]
[854]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
[853]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]
[852]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]
[851]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]
[850]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]
[849]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]
[848]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]
[847]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]
[846]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]
[845]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]
[844]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]
[843]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]
[842]Dependency Learning for QBF
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Journal Artificial Intelligence Research, volume 65, pages 180–208, 2019.
[bibtex] [pdf] [doi]
[841]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]
[840]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]
[839]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]
[838]On the Complexity Landscape of Connected f-Factor Problems
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
Algorithmica, 2019.
[bibtex]
[837]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Algorithmica, volume 81, number 1, pages 201–223, 2019.
[bibtex]
[836]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]
[835]Counting linear extensions: Parameterizations by treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Algorithmica, 2019.
[bibtex]
[834]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]
[833]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]
[832]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]
[831]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]
[830]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]
[829]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]
[828]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]
[827]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]
[826]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]
[825]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]
[824]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]
[823]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]
[822]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]
[821]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]
[820]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]
[819]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]
[818]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]
[817]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]
[816]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]
[815]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]
[814]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]
[813]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]
[812]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]
[811]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]
[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]
[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
Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019.
Note: To appear
[bibtex]
[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]
[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]
[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]
[803]Integer Programming and Incidence Treedepth?
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Piliczuk, Marcin Wrochna
Proceedings of IPCO 2019, The 20th Conference on Integer Programming and Combinatorial Optimization, 2019.
Note: To appear
[bibtex]
[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
Proceedings of GD 2019, the 27th International Symposium on Graph Drawing and Network Visualization, 2019.
Note: To appear
[bibtex]
[798]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]
[797]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]
[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]
[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]
[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]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, September 2017, Assoc. Comput. Mach., New York.
[bibtex] [pdf] [doi]
[743]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]
[742]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]
[741]Euclidean Greedy Drawings of Trees
Martin Nöllenburg, Roman Prutkin
Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017.
[bibtex] [doi]
[740]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]
[739]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]
[738]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]
[737]The Treewidth of Proofs
Moritz Müller, Stefan Szeider
Information and Computation, volume 255, pages 147–164, 2017.
[bibtex] [pdf] [doi]
[736]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]
[735]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]
[734]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]
[733]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]
[732]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]
[731]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]
[730]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]
[729]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]
[728]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]
[727]Free Weak Nilpotent Minimum Algebras
Stefano Aguzzoli, Simone Bova, Diego Valota
Soft Computing, volume 21(1), pages 79–95, 2017.
[bibtex]
[726]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]
[725]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]
[724]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]
[723]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]
[722]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]
[721]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]
[720]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]
[719]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]
[718]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]
[717]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]
[716]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]
[715]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]
[714]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]
[713]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]
[712]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]
[711]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]
[710]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]
[709]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]
[708]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]
[707]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]
[706]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]
[705]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]
[704]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, Brigitte 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]
[703]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]
[702]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]
[701]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]
[700]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]
[699]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]
[698]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]
[697]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]
[696]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]
[695]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]
[694]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]
[693]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]
[692]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]
[691]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]
[690]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]
[689]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]
[688]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
[687]Hybrid Metaheuristics – Powerful Tools for Optimization
Christian Blum, Günther R. Raidl
2016, Springer.
[bibtex] [pdf]
[686]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]
[685]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]
[684]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]
[683]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]
[682]Extending Convex Partial Drawings of Graphs
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
Algorithmica, volume 76, number 1, pages 47–67, 2016.
[bibtex] [doi]
[681]Mixed Map Labeling
Maarten Löffler, Martin Nöllenburg, Frank Staals
J. Spatial Information Science, volume 13, pages 3–32, 2016.
[bibtex] [doi]
[680]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]
[679]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]
[678]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]
[677]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]
[676]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]
[675]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]
[674]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]
[673]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]
[672]Quantifier reordering for QBF
Friedrich Slivovsky, Stefan Szeider
Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016.
[bibtex] [pdf] [doi]
[671]Soundness of Q-resolution with dependency schemes
Friedrich Slivovsky, Stefan Szeider
Theoretical Computer Science, volume 612, pages 83–101, 2016.
[bibtex] [pdf] [doi]
[670]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]
[669]A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
Algorithmica, volume 75, number 1, pages 1–26, 2016.
[bibtex]
[668]Complexity and monotonicity results for domination games
Stephan Kreutzer, Sebastian Ordyniak
Theor. Comput. Sci., volume 628, pages 1–29, 2016.
[bibtex]
[667]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]
[666]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]
[665]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]
[664]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]
[663]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]
[662]Directed elimination games
Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer
Discrete Applied Mathematics, volume 199, pages 187–198, 2016.
[bibtex]
[661]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]
[660]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]
[659]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]
[658]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]
[657]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]
[656]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]
[655]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]
[654]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]
[653]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]
[652]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]
[651]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]
[650]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]
[649]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]
[648]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]
[647]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]
[646]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]
[645]Edge-Editing to a Dense and a Sparse Graph Class
Michal Kotrbcík, Rastislav Královic, 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]
[644]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]
[643]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]
[642]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]
[641]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]
[640]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]
[639]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]
[638]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]
[637]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]
[636]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]
[635]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]
[634]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]
[633]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]
[632]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]
[631]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]
[630]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]
[629]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]
[628]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]
[627]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]
[626]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]
[625]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]
[624]Parameterized Complexity in the Polynomial Hierarchy
Ronald de Haan
2016, PhD thesis, Technische Universität Wien.
[bibtex] [pdf]
[623]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]
[622]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]
[621]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]
[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]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]
[618]Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
Ronald de Haan
August 2016, Technical report 1608.02406, arXiv.org.
[bibtex] [pdf]
2015
[617]Backdoors to Tractable Answer Set Programming
Johannes Klaus Fichte, Stefan Szeider
Artificial Intelligence, volume 220, pages 64–103, March 2015.
[bibtex] [doi]
[616]Numerical Optimisation of Electro-Hybrid Powertrains
Thorsten Krenek, Christopher Bacher, Thomas Lauer, Günther R. Raidl
MTZ Worldwide, volume 03, pages 46–52, Mar 2015, Springer.
[bibtex]
[615]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.
[bibtex]
[614]PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems
Marian Rainer-Harbach, Petrina Papazek, Günther R. Raidl, Bin Hu, Christian Kloimüllner
Journal of Global Optimization, volume 63, number 3, pages 597-629, 2015, Springer.
[bibtex] [pdf] [doi]
[613]Decomposition Based Hybrid Metaheuristics
Günther R. Raidl
European Journal of Operational Research, volume 244, pages 66-76, 2015.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/raidl-15.pdf
[bibtex]
[612]Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl
Central European Journal of Operations Research, volume 23, number 1, pages 89-113, 2015.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/hiermann-13.pdf
[bibtex]
[611]Multi-Row Boundary-Labeling Algorithms for Panorama Images
Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg
ACM Trans. Spatial Algorithms and Systems, volume 1, number 1, pages 1:1–1:30, 2015.
[bibtex] [pdf] [doi]
[610]A Hybrid Genetic Algorithm with Solution Archive for the Discrete (r|p)-Centroid Problem
Benjamin Biesinger, Bin Hu, Günther Raidl
Journal of Heuristics, volume 21, number 3, pages 391-431, 2015, Springer US.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/biesinger-14.pdf
[bibtex] [doi]
[609]Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)
Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron Quigley
Dagstuhl Reports, volume 5, number 1, pages 243–258, 2015.
[bibtex] [pdf] [doi]
[608]Many-to-One Boundary Labeling with Backbones
Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
J. Graph Algorithms Appl., volume 19, number 3, pages 779–816, 2015.
[bibtex] [pdf] [doi]
[607]Computing secure sets in graphs using answer set programming
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran
Journal of Logic and Computation, 2015.
[bibtex] [pdf] [doi]
[606]Parameterized and subexponential-time complexity of satisfiability problems and applications
Iyad A. Kanj, Stefan Szeider
Theoretical Computer Science, volume 607, pages 282–295, 2015.
[bibtex] [pdf] [doi]
[605]A SAT Approach to Clique-Width
Marijn Heule, Stefan Szeider
ACM Transactions on Computational Logic, volume 16, number 3, pages 24, 2015.
[bibtex] [pdf] [doi]
[604]Faster Parameterized Algorithms for Deletion to Split Graphs
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Algorithmica, volume 71, number 4, pages 989–1006, 2015.
[bibtex] [pdf] [doi]
[603]On finding optimal polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
Theoretical Computer Science, volume 592, pages 49–58, 2015.
[bibtex] [pdf] [doi]
[602]Improving Vertex Cover as a Graph Parameter
Robert Ganian
Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015.
[bibtex]
[601]Backdoors to Normality for Disjunctive Logic Programs
Johannes Klaus Fichte, Stefan Szeider
ACM Transactions on Computational Logic, volume 17, number 1, 2015.
[bibtex] [doi]
[600]On the Subexponential-Time Complexity of CSP
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Journal Artificial Intelligence Research, volume 52, pages 203–234, 2015.
[bibtex] [pdf] [doi]
[599]The complexity of equivalence, entailment, and minimization in existential positive logic
Simone Bova, Hubie Chen
Journal of Computer and System Sciences, volume 81, number 2, pages 443–457, 2015.
[bibtex]
[598]A complete parameterized complexity analysis of bounded planning
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Journal of Computer and System Sciences, volume 81, number 7, pages 1311–1332, 2015.
[bibtex] [pdf] [doi]
[597]Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 99 – 100, 2015.
[bibtex] [pdf]
[596]A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles
Christopher Bacher, Günther R. Raidl
Chapter in Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (A. Quesada-Arencibia, others, eds.), pages 119–120, 2015.
[bibtex] [pdf]
[595]Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Ronald de Haan, Stefan Szeider
SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, Pec pod Sn\ve\vzkou, Czech Republic, January 24-29, 2015. Proceedings, volume 8939 of Lecture Notes in Computer Science, pages 217–229, January 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[594]Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem
Alan Tus, Andrea Rendl, Günther R. Raidl
Conference Proceedings of Learning and Intelligent Optimization Conference (LION 9), volume 8994 of LNCS, pages 186-201, 2015, Springer.
[bibtex]
[593]On the Comparison of Decoding Strategies for a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem
Christian Schauer, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 279-285, 2015, Springer.
[bibtex]
[592]Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
Algorithms and Computation (ISAAC'15) (Khaled Elbassioni, Kazuhisa Makino, eds.), volume 9472 of LNCS, pages 637–649, 2015, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[591]Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 30–43, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[590]Towards Realistic Flow Control in Power Grid Operation
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner, Franziska Wegner
Energy Informatics (EI'15) (Sebastian Gottwalt, Lukas König, Hartmut Schmeck, eds.), volume 9424 of LNCS, pages 192–199, 2015, Springer International Publishing.
[bibtex] [doi]
[589]CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem
Christian Schauer David Markvica, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 401–408, 2015, Springer.
[bibtex]
[588]Mixed Map Labeling
Maarten Löffler, Martin Nöllenburg, Frank Staals
Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 339–351, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[587]Operating Power Grids with Few Flow Control Buses
Thomas Leibfried, Tamara Mchedlidze, Nico Meyer-Hübner, Martin Nöllenburg, Ignaz Rutter, Peter Sanders, Dorothea Wagner, Franziska Wegner
Future Energy Systems (e-Energy'15), pages 289–294, 2015, ACM.
[bibtex] [pdf] [doi]
[586]On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics
Evelia Liz'arraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
Proceedings of the 2015 International Symposium on Innovations in Intelligent Systems and Applications (INISTA) (David Camacho, others, eds.), pages 1-8, 2015, IEEE Xplore.
[bibtex] [pdf]
[585]Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
Jonathan Klawitter, Martin Nöllenburg, Torsten Ueckerdt
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 231–244, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[584]On Minimizing Crossings in Storyline Visualizations
Irina Kostitsyna, Martin Nöllenburg, Valentin Polishchuk, André Schulz, Darren Strash
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 192–198, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[583]Recognizing Weighted Disk Contact Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 433–446, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[582]A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems
Christian Kloimüllner, Petrina Papazek, Günther R. Raidl
Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 125–126, 2015.
[bibtex] [pdf]
[581]A New Solution Representation for the Firefighter Problem
Bin Hu, Andreas Windbichler, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 25–35, 2015, Springer.
[bibtex] [pdf]
[580]Label Placement in Road Maps
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithms and Complexity (CIAC'15) (V. Th. Paschos, Peter Widmayer, eds.), volume 9079 of LNCS, pages 221–234, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[579]A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size
Frederico Dusberger, Günther R. Raidl
Extended Abstracts of the Fifthteenth International Conference on Computer Aided Systems Theory (EUROCAST 2015) (Alexis Quesada-Arencibia, José Carlos Rodriguez, Roberto Moreno-Díaz jr., Roberto Moreno-Díaz, eds.), pages 109–110, 2015.
[bibtex] [pdf]
[578]A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem with Variable Sheet Size
Frederico Dusberger, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2015, volume 9520 of LNCS, pages 384–392, 2015, Springer.
[bibtex] [pdf]
[577]Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search
Frederico Dusberger, Günther R. Raidl
The 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, pages 133–140, 2015, Elsevier.
[bibtex] [pdf]
[576]Heuristic Approaches for the Probabilistic Traveling Salesman Problem
Christoph Weiler, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 9520 of LNCS, pages 342–349, 2015, Springer International Publishing Switzerland.
[bibtex] [pdf] [doi]
[575]A Genetic Algorithm for the Capacity and Distance Constrained Plant Location Problem
Matthias Lanzinger, Benjamin Biesinger, Bin Hu, Günther R. Raidl
Proceedings of the 11th Metaheuristics International Conference, pages 89/1–89/9, 2015.
[bibtex] [pdf]
[574]A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2015 (Gabriela Ochoa, Francisco Chicano, eds.), volume 9026 of LNCS, pages 48–60, 2015, Springer.
[bibtex] [pdf]
[573]On the Readability of Boundary Labeling
Lukas Barth, Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Graph Drawing (GD'15) (Emilio Di Giacomo, Anna Lubiw, eds.), volume 9411 of LNCS, pages 515–527, 2015, Springer International Publishing.
[bibtex] [pdf] [doi]
[572]A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles
Christopher Bacher, Günther R. Raidl, Thorsten Krenek
Computer Aided Systems Theory – EUROCAST 2015 (Roberto Moreno-Díaz, others, eds.), volume 9520 of LNCS, pages 425–432, 2015, Springer International Publishing Switzerland.
[bibtex] [pdf]
[571]Towards Realistic Pedestrian Route Planning
Simeon Andreev, Julian Dibbelt, Martin Nöllenburg, Thomas Pajor, Dorothea Wagner
Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'15) (Giuseppe F. Italiano, Marie Schmidt, eds.), volume 48 of OpenAccess Series in Informatics (OASIcs), pages 1–15, 2015, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[570]Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
Michael Abseher, Frederico Dusberger, Nysret Musliu, Stefan Woltran
Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina (Qiang Yang, Michael Wooldridge, eds.), pages 275–282, 2015.
[bibtex] [pdf]
[569]On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 566–577, 2015.
[bibtex] [pdf] [doi]
[568]Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, pages 935–946, 2015.
[bibtex] [pdf] [doi]
[567]Reconfiguration on Sparse Graphs
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Algorithms and Data Structures - 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, pages 506–517, 2015.
[bibtex] [pdf] [doi]
[566]Variable-Deletion Backdoors to Planning
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA. (Blai Bonet, Sven Koenig, eds.), pages 3305–3312, 2015, AAAI Press.
[bibtex]
[565]Community Structure Inspired Algorithms for SAT and #SAT
Robert Ganian, Stefan Szeider
18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), September 24-27, 2015, Austin, Texas (Marijn Heule, Sean Weaver, eds.), pages 223-237, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[564]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings (Rahul Jain, Sanjay Jain, Frank Stephan, eds.), volume 9076 of Lecture Notes in Computer Science, pages 428–440, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[563]Algorithmic Applications of Tree-Cut Width
Robert Ganian, Eun Jung Kim, Stefan Szeider
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235 of Lecture Notes in Computer Science, pages 348–360, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[562]Parameterized Algorithms for Parity Games
Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II (Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, eds.), volume 9235 of Lecture Notes in Computer Science, pages 336–347, 2015, Springer Verlag.
[bibtex]
[561]FO Model Checking on Posets of Bounded Width
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 963–974, 2015.
[bibtex] [pdf] [doi]
[560]Solving d-SAT via Backdoors to Small Treewidth
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 630–641, 2015.
[bibtex] [pdf] [doi]
[559]Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
Ulle Endriss, Ronald de Haan, Stefan Szeider
Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems (Gerhard Weiss, Pinar Yolum, Rafael H. Bordini, Edith Elkind, eds.), pages 127–136, 2015, IFAAMAS/ACM.
[bibtex] [pdf]
[558]Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young
Ulle Endriss, Ronald de Haan
Proceedings of AAMAS 2015, the 14th International Conference on Autonomous Agents and Multiagent Systems, 2015, IFAAMAS/ACM.
[bibtex] [pdf]
[557]Meta-Kernelization using Well-Structured Modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Parameterized and Exact Computation - 10th International Symposium, IPEC 2014, Patras, Greece, September 16-18, 2015. Revised Selected Papers (Thore Husfeldt, Iyad A. Kanj, eds.), volume 43 of LIPIcs, pages 114–126, 2015.
[bibtex] [pdf] [doi]
[556]Solving Problems on Graphs of High Rank-Width
Eduard Eiben, Robert Ganian, Stefan Szeider
Algorithms and Data Structures Symposium (WADS 2015), August 5-7, 2015, University of Victoria, BC, Canada, pages 314–326, 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[555]On the Complexity of Rainbow Coloring Problems
Eduard Eiben, Robert Ganian, Juho Lauri
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers (Zsuzsanna Lipták, William F. Smyth, eds.), pages 209–220, 2015.
[bibtex] [pdf] [doi]
[554]A Dichotomy Result for Ramsey Quantifiers
Ronald de Haan, Jakub Szymanik
Proceedings of WoLLIC 2015, the 22nd International Workshop on Logic, Language, Information, and Computation, 2015, Springer Verlag.
[bibtex] [pdf]
[553]Fixed-parameter Tractable Reductions to SAT for Planning
Ronald de Haan, Martin Kronegger, Andreas Pfandler
Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence, July 25–31, 2015, Buenos Aires, Argentina, 2015.
[bibtex] [pdf]
[552]On Compiling Structured CNFs to OBDDs
Simone Bova, Friedrich Slivovsky
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, pages 80–93, 2015.
[bibtex]
[551]First-Order Queries on Finite Abelian Groups
Simone Bova, Barnaby Martin
24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, pages 41–59, 2015.
[bibtex]
[550]On Compiling CNFs into Structured Deterministic DNNFs
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, pages 199–214, 2015.
[bibtex]
[549]Metric Dimension of Bounded Width Graphs
Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pages 115–126, 2015.
[bibtex] [pdf] [doi]
[548]Solving the Travelling Thief Problem with an Evolutionary Algorithm
Christoph Wachter
Sep 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
[bibtex] [pdf]
[547]Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition
Katharina Ölsböck
Jul 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Riedler
[bibtex] [pdf]
[546]Optimization Approaches for Recreational Bicycle Tour Planning
Benedikt Klocker
Apr 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by M. Prandtstetter and G. Raidl
[bibtex] [pdf]
[545]Solving the Multi-Objective Steiner Tree Problem with Resources
Georg Brandstätter
Jan 2015, Master's thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by M. Leitner, M. Ruthmair, and G. Raidl
[bibtex] [pdf]
[544]An Overview of Non-Uniform Parameterized Complexity
Ronald de Haan
2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC).
[bibtex] [pdf]
2014
[543]On d-regular schematization of embedded paths
Daniel Delling, Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
Comput. Geom. Theory Appl., volume 47, number 3A, pages 381–406, 2014.
[bibtex] [doi]
[542]Tractable answer-set programming with weight constraints: bounded treewidth is not enough
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
Theory Pract. Log. Program., volume 14, number 2, pages 141-164, 2014.
[bibtex] [doi]
[541]Faster Parameterized Algorithms Using Linear Programming
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
ACM Transactions on Algorithms, volume 11, number 2, pages 15:1–15:31, 2014.
[bibtex] [pdf] [doi]
[540]Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Serge Gaspers, Stefan Szeider
Artificial Intelligence, volume 216, pages 1-19, 2014.
[bibtex] [doi]
[539]Lower bounds on the complexity of MSO1 model-checking
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
J. Comput. Syst. Sci., volume 80, number 1, pages 180–194, 2014.
[bibtex]
[538]Digraph width measures in parameterized algorithmics
Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith
Discrete Applied Mathematics, volume 168, pages 88–107, 2014.
[bibtex]
[537]Unification and Projectivity in De Morgan and Kleene Algebras
Simone Bova, Leonardo Manuel Cabrer
Order, volume 31, number 2, pages 159–187, 2014.
[bibtex]
[536]Scalability Considerations for Multivariate Graph Visualization
T. J. Jankun-Kelly, Tim Dwyer, Danny Holten, Christophe Hurter, Martin Nöllenburg, Chris Weaver, Kai Xu
Chapter in Multivariate Network Visualization (Andreas Kerren, Helen C. Purchase, Matthew O. Ward, eds.), volume 8380 of LNCS, pages 207–235, 2014, Springer International Publishing.
[bibtex] [doi]
[535]Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles
Christopher Bacher, Thorsten Krenek, Günther R. Raidl
Chapter in Applications of Evolutionary Computation (Anna I. Esparcia-Alcázar, Antonio M. Mora, eds.), pages 553-564, 2014, Springer.
[bibtex] [pdf] [doi]
[534]A survey on automated metro map layout methods
Martin Nöllenburg
Schematic Mapping Workshop, apr 2014.
[bibtex] [pdf]
[533]Boosting an Exact Logic-Based Benders Decomposition Approach by Variable Neighborhood Search
T. Baumhauer B. Hu Günther R. Raidl
Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 149–156, 2014, Elsevier.
[bibtex] [pdf]
[532]Speeding up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem
Günther R. Raidl, Thomas Baumhauer, Bin Hu
Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 183–197, 2014, Springer.
[bibtex] [pdf]
[531]Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid
Petrina Papazek, Christian Kloimüllner, Bin Hu, Günther R. Raidl
Parallel Problem Solving from Nature – PPSN XIII (Thomas Bartz-Beielstein, Jürgen Branke, Bogdan Filipic, Jim Smith, eds.), volume 8672 of LNCS, pages 792–801, 2014, Springer.
[bibtex] [pdf] [doi]
[530]On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 476–487, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[529]Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams
Boris Klemz, Tamara Mchedlidze, Martin Nöllenburg
Algorithm Theory (SWAT'14) (R. Ravi, I. L. Gørtz, eds.), volume 8503 of LNCS, pages 253–264, 2014, Springer International Publishing.
[bibtex] [doi]
[528]Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case
Christian Kloimüllner, Petrina Papazek, Bin Hu, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2014 (Christian Blum, Gabriela Ochoa, eds.), volume 8600 of LNCS, pages 73–84, 2014, Springer.
[bibtex] [pdf] [doi]
[527]An Efficient Variable Neighborhood Search Solving a Robust Dynamic Facility Location Problem in Emergency Service Network
Stefan Misković, Zorica Stanimirović, Igor Grujicic
Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 261–268, 2014, Elsevier.
[bibtex] [pdf]
[526]Variable Neighbourhood Search for Integrated Timetable Design of Railway Infrastructure
Igor Grujicic, Günther R. Raidl, Andreas Schöbel
Proceedings of the 3rd International Conference on Variable Neighborhood Search, volume 47 of Electronic Notes in Discrete Mathematics, pages 141–148, 2014, Elsevier.
[bibtex] [pdf]
[525]A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure
Igor Grujicic, Günther R. Raidl, Andreas Schöbel, Gerhard Besau
Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (S. Lakusic, others, eds.), pages 691–696, 2014, Department of Transportation, University of Zagreb.
[bibtex] [pdf]
[524]Evaluation of Labeling Strategies for Rotating Maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
Experimental Algorithms (SEA'14) (Joachim Gudmundsson, J. Katajainen, eds.), volume 8504 of LNCS, pages 235–246, 2014, Springer International Publishing.
[bibtex] [pdf] [doi]
[523]A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem
Frederico Dusberger, Günther R. Raidl
Hybrid Metaheuristics, 9th Int. Workshop, HM 2014 (Maria J. Blesa, Christain Blum, Stefan Voß, eds.), volume 8457 of LNCS, pages 85–99, 2014, Springer.
[bibtex] [pdf]
[522]PIGRA – A Tool for Pixelated Graph Representations
Thomas Bläsius, Fabian Klute, Benjamin Niedermann, Martin Nöllenburg
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 513–514, 2014, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [pdf]
[521]An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior
Benjamin Biesinger, Bin Hu, Günther R. Raidl
Conference Proceedings of Learning and Intelligent Optimization Conference (LION 8), volume 8426 of LNCS, pages 203–217, 2014, Springer.
[bibtex] [pdf]
[520]Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff
Theoretical Informatics (LATIN'14) (Alfredo Viola, ed.), volume 8392 of LNCS, pages 514–525, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[519]Simultaneous Embeddability of Two Partitions
Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
Graph Drawing (GD'14) (Christian A. Duncan, Antonios Symvonis, eds.), volume 8871 of LNCS, pages 64–75, 2014, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[518]Variable Dependencies and Q-Resolution
Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Carsten Sinz, Uwe Egly, eds.), volume 8561 of Lecture Notes in Computer Science, pages 269–284, 2014, Springer Verlag.
[bibtex] [doi]
[517]Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
M. S. Ramanujan, Saket Saurabh
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1739–1748, 2014.
[bibtex] [pdf] [doi]
[516]Vertex Exponential Algorithms for Connected f-Factors
Geevarghese Philip, M. S. Ramanujan
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India, pages 61–71, 2014.
[bibtex] [pdf] [doi]
[515]A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 270–281, 2014, Springer Verlag.
[bibtex]
[514]Backdoors to Planning
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2300–2307, 2014, AAAI Press.
[bibtex]
[513]Parameterized Approximations via d-Skew-Symmetric Multicut
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pages 457–468, 2014.
[bibtex] [pdf] [doi]
[512]Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications
Iyad A. Kanj, Stefan Szeider
Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings (Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du, eds.), volume 8881 of Lecture Notes in Computer Science, pages 637–651, 2014, Springer Verlag.
[bibtex] [pdf] [doi]
[511]Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivny
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27-31, 2014, Québec City, Québec, Canada. (Carla E. Brodley, Peter Stone, eds.), pages 2652-2658, 2014, AAAI Press.
[bibtex]
[510]Finite Integer Index of Pathwidth and Treewidth
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 258–269, 2014, Springer Verlag.
[bibtex]
[509]Faster Existential FO Model Checking on Posets
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings (Hee-Kap Ahn, Chan-Su Shin, eds.), volume 8889 of Lecture Notes in Computer Science, pages 441–451, 2014, Springer Verlag.
[bibtex]
[508]Parameterized Complexity Results for Agenda Safety in Judgment Aggregation
Ulle Endriss, Ronald de Haan, Stefan Szeider
Proceedings of ComSoc'14, Fifth International Workshop on Computational Social Choice Pittsburgh, Pennsylvania, June 23-25, 2014, pages 127–136, 2014.
[bibtex] [pdf]
[507]Fixed-Parameter Tractable Reductions to SAT
Ronald de Haan, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings (Uwe Egly, Carsten Sinz, eds.), volume 8561 of Lecture Notes in Computer Science, pages 85-102, 2014, Springer Verlag.
[bibtex] [pdf] [doi]
[506]The Parameterized Complexity of Reasoning Problems Beyond NP
Ronald de Haan, Stefan Szeider
Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014 (Chitta Baral, Giuseppe De Giacomo, Thomas Eiter, eds.), pages 82–91, 2014, AAAI Press.
[bibtex] [pdf]
[505]Subexponential Time Complexity of CSP with Global Constraints
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings (Barry O'Sullivan, ed.), volume 8656 of Lecture Notes in Computer Science, pages 272-288, 2014, Springer Verlag.
[bibtex] [pdf] [doi]
[504]Small Unsatisfiable Subsets in Constraint Satisfaction
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pages 429–436, 2014, IEEE.
[bibtex] [pdf] [doi]
[503]Quantified Conjunctive Queries on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (Marek Cygan, Pinar Heggernes, eds.), volume 8894 of Lecture Notes in Computer Science, pages 122–134, 2014, Springer Verlag.
[bibtex] [pdf] [doi]
[502]Model checking existential logic on partially ordered sets
Simone Bova, Robert Ganian, Stefan Szeider
Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014 (Thomas A. Henzinger, Dale Miller, eds.), pages 21:1–21:10, 2014, ACM.
[bibtex] [pdf] [doi]
[501]The Complexity of Width Minimization for Existential Positive Queries
Simone Bova, Hubie Chen
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235–244, 2014.
[bibtex]
[500]On the Kernelization Complexity of String Problems
Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pages 141–153, 2014.
[bibtex] [pdf] [doi]
[499]Parameterized Algorithms to Preserve Connectivity
Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 800–811, 2014.
[bibtex] [pdf] [doi]
[498]Heuristic Solution Approaches for the Two Dimensional Pre-Marshalling Problem
Alan Tus
Jun 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[497]Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework
Patrick Klaffenboeck
May 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[496]A Hybrid Algorithm for the Partition Coloring Problem
Gilbert Fritz
Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[495]Finding Longest Common Subsequences by GPU-Based Parallel Ant Colony Optimization
David Markvica
Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[494]Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows
Dietmar Trummer
Feb 2014, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[493]Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy
Ronald de Haan, Stefan Szeider
2014, Technical report TR14-143, Electronic Colloquium on Computational Complexity (ECCC).
[bibtex] [pdf]
2013
[492]Proceedings of the 10th Metaheuristics International Conference
(Hoong Chuin Lau, Günther R. Raidl, Patrick van Hentenryck, eds.), 2013.
[bibtex]
[491]Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers
(Gregory Gutin, Stefan Szeider, eds.), volume 8246 of Lecture Notes in Computer Science, 2013, Springer Verlag.
Note: ISBN 978-3-319-03897-1
[bibtex] [pdf] [doi]
[490]Edge-weighted contact representations of planar graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
J. Graph Algorithms Appl., volume 17, number 4, pages 441–473, 2013.
[bibtex] [doi]
[489]Stabilizing Branch-and-Price for Constrained Tree Problems
Markus Leitner, Mario Ruthmair, Günther R. Raidl
Networks, volume 61, number 2, pages 150–170, 2013.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf
[bibtex]
[488]Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151)
Stephen Kobourov, Martin Nöllenburg, Monique Teillaud
Dagstuhl Reports, volume 3, number 4, pages 34–68, 2013.
[bibtex] [pdf] [doi]
[487]Optimal 3D Angular Resolution for Low-Degree Graphs
David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
J. Graph Algorithms Appl., volume 17, number 3, pages 173–200, 2013.
[bibtex] [doi]
[486]Drawing Trees with Perfect Angular Resolution and Polynomial Area
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
Discrete and Computational Geometry, volume 49, number 2, pages 157–182, 2013.
[bibtex] [doi]
[485]Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Sebastian Ordyniak, Stefan Szeider
Journal Artificial Intelligence Research, volume 46, pages 263-302, 2013.
[bibtex] [doi]
[484]Satisfiability of acyclic and almost acyclic CNF formulas
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
Theoretical Computer Science, volume 481, pages 85-99, 2013.
[bibtex] [doi]
[483]A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Theory Comput. Syst., volume 53, number 4, pages 609–620, 2013.
[bibtex] [pdf] [doi]
[482]Cops-and-robbers: remarks and problems
Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault, Martin Vatshelle
Journal of Combinatorial Mathematics and Combinatorial Computing, volume 85, pages 141–159, 2013.
[bibtex]
[481]A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Eur. J. Comb., volume 34, number 3, pages 680–701, 2013.
[bibtex]
[480]Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Robert Ganian, Petr Hlinený, Jan Obdrzálek
Fundam. Inform., volume 123, number 1, pages 59–76, 2013.
[bibtex]
[479]Polynomial space hardness without disjunction property
Simone Bova, Franco Montagna
Theor. Comput. Sci., volume 467, pages 1–11, 2013.
[bibtex]
[478]Generic expression hardness results for primitive positive formula comparison
Simone Bova, Hubie Chen, Matthew Valeriote
Inf. Comput., volume 222, pages 108–120, 2013.
[bibtex]
[477]A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Michael Pimmer, Günther R. Raidl
Chapter in Advances in Metaheuristics (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), volume 53 of Operations Research/Computer Science Interfaces Series, pages 143–158, 2013, Springer.
[bibtex] [pdf]
[476]An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure
Andreas Schöbel, Günther R. Raidl, Igor Grujicic, Gerhard Besau, Gottfried Schuster
Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen 2013, pages 765–774, 2013, IAROR.
[bibtex] [pdf]
[475]Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach
Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 121-132, 2013, Springer.
[bibtex] [pdf]
[474]Balancing Bicycle Sharing Systems: Improving a VNS by Efficiently Determining Optimal Loading Operations
Günther R. Raidl, Bin Hu, Marian Rainer-Harbach, Petrina Papazek
Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 130–143, 2013, Springer.
[bibtex] [pdf]
[473]A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem
Petrica C. Pop, Bin Hu, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 219–226, 2013, Springer.
[bibtex] [pdf]
[472]A Memetic Algorithm for the Partition Graph Coloring Problem
Petrica C. Pop, Bin Hu, Günther R. Raidl
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 167–169, 2013.
[bibtex] [pdf]
[471]On The Usability of Lombardi Graph Drawings
Helen C. Purchase, John Hamer, Martin Nöllenburg, Stephen G. Kobourov
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 451–462, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[470]A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems
Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu
Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 372–379, 2013, Springer.
[bibtex] [pdf]
[469]A PILOT/VND/GRASP Hybrid for Balancing Bicycle Sharing Systems
Petrina Papazek, Günther R. Raidl, Marian Rainer-Harbach, Bin Hu
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 223–225, 2013.
[bibtex] [pdf]
[468]Edge-weighted contact representations of planar graphs
Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 224–235, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[467]Euclidean Greedy Drawings of Trees
Martin Nöllenburg, Roman Prutkin
Algorithms (ESA'13) (H. L. Bodlaender, G. F. Italiano, eds.), volume 8125 of LNCS, pages 767–778, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[466]Drawing Planar Graphs with a Prescribed Inner Face
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 316–327, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[465]Planar Lombardi Drawings of Outerpaths
Maarten Löffler, Martin Nöllenburg
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 561–562, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
[464]Circular-Arc Cartograms
Jan-Hinrich Kämper, Stephen G. Kobourov, Martin Nöllenburg
IEEE Pacific Visualization Symposium (PacificVis'13), pages 1–8, 2013, IEEE.
[bibtex] [pdf] [doi]
[463]Clique and Independent Set Based GRASP Approaches for the Regenerator Location Problem
Peter Jahrmann, Günther R. Raidl
Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 30/1–30/10, 2013.
[bibtex] [pdf]
[462]A Memetic Algorithm for the Virtual Network Mapping Problem
Johannes Inführ, Günther R. Raidl
Proceedings of the 10th Metaheuristics International Conference (H.C. Lau, P. Van Hentenryck, G.R. Raidl, eds.), pages 28/1–28/10, 2013.
[bibtex] [pdf]
[461]GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem
Johannes Inführ, Günther R. Raidl
Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (M. J. Blesa, others, eds.), volume 7919 of LNCS, pages 159–173, 2013, Springer.
[bibtex] [pdf]
[460]Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent
Johannes Inführ, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimisation – 13th European Conference, EvoCOP 2013 (M. Middendorf, C. Blum, eds.), volume 7832 of LNCS, pages 250-261, 2013, Springer.
[bibtex] [pdf]
[459]Using Optimized Virtual Network Embedding for Network Dimensioning
Johannes Inführ, David Stezenbach, Matthias Hartmann, Kurt Tutschku, Günther R. Raidl
Proceedings of Networked Systems 2013, pages 118–125, 2013, IEEE.
[bibtex] [pdf]
[458]A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem
Bin Hu, Werner Ölz, Günther R. Raidl
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 200–202, 2013.
[bibtex] [pdf]
[457]Trajectory-Based Dynamic Map Labeling
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithms and Computation (ISAAC'13) (Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam, eds.), volume 8283 of LNCS, pages 413–423, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[456]Drawing Metro Maps using Bézier Curves
Martin Fink, Herman Haverkort, Martin Nöllenburg, Maxwell J. Roberts, Julian Schuhmann, Alexander Wolff
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 463–474, 2013, Springer Berlin Heidelberg.
[bibtex] [doi]
[455]Strict Confluent Drawing
David Eppstein, Danny Holten, Maarten Löffler, Martin Nöllenburg, Bettina Speckmann, Kevin Verbeek
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 352–363, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[454]Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2013 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 8111 of LNCS, pages 380–387, 2013, Springer.
[bibtex] [pdf]
[453]Reconstructing Cross Cut Shredded Documents with a Genetic Algorithm with Solution Archive
Benjamin Biesinger, Christian Schauer, Bin Hu, Günther R. Raidl
Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, pages 226–228, 2013.
[bibtex] [pdf]
[452]Progress on Partial Edge Drawings
Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 67–78, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[451]Many-to-One Boundary Labeling with Backbones
Michael Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 244–255, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[450]Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Therese Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter
Graph Drawing (GD'13) (Stephen Wismath, Alexander Wolff, eds.), volume 8242 of LNCS, pages 460–471, 2013, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[449]Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor
Jan Christoph Athenstädt, Robert Görke, Marcus Krug, Martin Nöllenburg
Graph Drawing (GD'12) (Walter Didimo, Maurizio Patrignani, eds.), volume 7704 of LNCS, pages 553–554, 2013, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
[448]Capturing Structure in Hard Combinatorial Problems
Stefan Szeider
2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, November 4-6, 2013, pages 897-898, 2013.
Note: invited keynote talk
[bibtex] [doi]
[447]The Parameterized Complexity of Constraint Satisfaction and Reasoning
Stefan Szeider
Applications of Declarative Programming and Knowledge Management - 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, Armin Wolf, eds.), volume 7773 of Lecture Notes in Computer Science, pages 27-37, 2013, Springer Verlag.
[bibtex] [doi]
[446]Model Counting for Formulas of Bounded Clique-Width
Friedrich Slivovsky, Stefan Szeider
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam, eds.), volume 8283 of Lecture Notes in Computer Science, pages 677-687, 2013, Springer Verlag.
[bibtex] [doi]
[445]Backdoors to Abduction
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Proceedings of IJCAI 2013, the 23th International Joint Conference on Artificial Intelligence, August 3-9, 2013, Beijing, China, 2013.
[bibtex]
[444]Model Counting for CNF Formulas of Bounded Modular Treewidth
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 55-66, 2013, Leibniz-Zentrum fuer Informatik.
[bibtex] [doi]
[443]Revisiting Space in Proof Complexity: Treewidth and Pathwidth
Moritz Müller, Stefan Szeider
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag.
[bibtex] [doi]
[442]Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 394-402, 2013, Springer Verlag.
[bibtex] [doi]
[441]Hardness of r-dominating set on Graphs of Diameter (r + 1)
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pages 255–267, 2013.
[bibtex] [pdf] [doi]
[440]The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
Theory and Applications of Formal Argumentation - Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, eds.), volume 8306 of Lecture Notes in Computer Science, pages 158-175, 2013, Springer Verlag.
[bibtex] [doi]
[439]On the Subexponential Time Complexity of CSP
Iyad Kanj, Stefan Szeider
Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins, Michael L. Littman, eds.), pages 459-465, 2013, The AAAI Press.
[bibtex]
[438]Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 671–682, 2013.
[bibtex] [pdf] [doi]
[437]A SAT Approach to Clique-Width
Marijn Heule, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings (Matti Järvisalo, Allen Van Gelder, eds.), volume 7962 of Lecture Notes in Computer Science, pages 318-334, 2013, Springer Verlag.
[bibtex] [doi]
[436]Strong Backdoors to Bounded Treewidth SAT
Serge Gaspers, Stefan Szeider
54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 489-498, 2013, IEEE Computer Society.
[bibtex] [doi]
[435]Backdoors to q-Horn
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany (Natacha Portier, Thomas Wilke, eds.), volume 20 of LIPIcs, pages 67-79, 2013, Leibniz-Zentrum fuer Informatik.