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

Publications

words3a

Here is a list of recent publications of former and current members of the Algorithms and Complexity group. A list including older publications can be found here. Technical reports can  be found here.

 

2024 and to appear

88 results
2024
[88]Scheduling Jobs Using Queries to Interactively Learn Human Availability Times
Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann
Computers & Operations Research, 2024.
[bibtex] [doi]
[87]Exact methods for the Selective Assessment Routing Problem
Joan Salvà Soler, Vera C. Hemmelmayr, Günther R. Raidl
Central European Journal of Operations Research, 2024.
[bibtex] [doi]
[86]A Biased Random Key Genetic Algorithm for Solving the Longest Common Square Subsequence Problem
Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl
IEEE Transactions on Evolutionary Computation, volume , number , pages , 2024.
Note: early access
[bibtex] [doi]
[85]Bounding and Computing Obstacle Numbers of Graphs
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
SIAM J. Discret. Math., volume 38, number 2, pages 1537–1565, 2024.
[bibtex] [pdf] [doi]
[84]Computing Hive Plots: A Combinatorial Framework
Martin Nöllenburg, Markus Wallinger
J. Graph Algorithms Appl., volume 28, number 2, pages 101–129, 2024.
[bibtex] [doi]
[83]Computing Data-driven Multilinear Metro Maps
Martin Nöllenburg, Soeren Terziadis
The Cartographic Journal, pages 1–16, 2024.
[bibtex] [doi]
[82]Visualizing Extensions of Argumentation Frameworks as Layered Graphs
Martin Nöllenburg, Christian Pirker, Anna Rapberger, Stefan Woltran, Jules Wulms
CoRR, volume abs/2409.05457, 2024.
[bibtex] [doi]
[81]Signed double Roman domination on cubic graphs
Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl
Applied Mathematics and Computation, volume 471, pages 128612, 2024, Elsevier.
[bibtex] [pdf] [doi]
[80]Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
J. Graph Algorithms Appl., volume 28, number 3, pages 31–48, 2024.
[bibtex] [doi]
[79]Improving Temporal Treemaps by Minimizing Crossings
Alexander Dobler, Martin Nöllenburg
Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.
[bibtex] [doi]
[78]Uncertainty in Humanities Network Visualization
Melanie Conroy, Christina Gillmann, Francis Harvey, Tamara Mchedlidze, Sara Irina Fabrikant, Florian Windhager, Gerik Scheuermann, Timothy R. Tangherlini, Christopher N. Warren, Scott B. Weingart, Malte Rehbein, Katy Börner, Kimmo Elo, Stefan Jänicke, Andreas Kerren, Martin Nöllenburg, Tim Dwyer, Øyvind Eide, Stephen Kobourov, Gregor Betz
Frontiers in Communication, volume 8, pages 1305137, 2024.
[bibtex] [doi]
[77]Extending Orthogonal Planar Graph Drawings is Fixed-parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
J. Computational Geometry, volume 15, number 2, pages 3–39, 2024.
[bibtex] [doi]
[76]On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
J. Computer and Systems Sciences, volume 139, pages 103466, 2024.
[bibtex] [doi]
[75]SAT-based Decision Tree Learning for Large Data Sets
André Schidler, Stefan Szeider
Journal of Artificial Intelligence Research, volume 80, pages 875–918, 2024.
[bibtex]
[74]On Critical Node Problems with Vulnerable Vertices
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
J. Graph Algorithms Appl., volume 28, number 1, pages 1–26, 2024.
[bibtex] [pdf] [doi]
[73]Backdoor DNFs
Sebastian Ordyniak, Andre Schidler, Stefan Szeider
Journal of Computer and System Sciences, volume 144, pages 103547, 2024.
[bibtex] [doi]
[72]Satisfiability Modulo User Propagators
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
Journal of Artificial Intelligence Research, volume 81, pages 989–1017, 2024.
[bibtex] [pdf] [doi]
[71]SAT Modulo Symmetries for Graph Generation and Enumeration
Markus Kirchweger, Stefan Szeider
ACM Transactions on Computational Logic, volume 25, number 3, 2024.
[bibtex] [doi]
[70]Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs
Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer
J. Comb. Optim., 2024.
Note: to appear
[bibtex]
[69]Slim Tree-Cut Width
Robert Ganian, Viktoriia Korchemna
Algorithmica, volume 86, number 8, pages 2714–2738, 2024.
[bibtex] [pdf] [doi]
[68]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
ACM Trans. Algorithms, volume 20, number 3, pages 19, 2024.
[bibtex] [pdf] [doi]
[67]Smash and grab: The 0*6 scoring game on graphs
Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau
Theor. Comput. Sci., volume 990, pages 114417, 2024.
[bibtex] [pdf] [doi]
[66]SAT backdoors: Depth beats size
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
Journal of Computer and System Sciences, volume 142, pages 103520, 2024.
[bibtex] [doi]
[65]Realtime Generation of Streamliners with Large Language Models
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
CoRR, volume abs/2408.10268, 2024.
[bibtex] [pdf] [doi]
[64]Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
J. Graph Algorithms Appl., 2024.
Note: to appear
[bibtex]
[63]The Complexity of Optimizing Atomic Congestion
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
Artif. Intell., 2024.
Note: to appear
[bibtex]
[62]Should Decisions in QCDCL Follow Prefix Order?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
J. Autom. Reason., volume 68, number 1, pages 5, 2024.
[bibtex] [pdf] [doi]
[61]QCDCL with cube learning or pure literal elimination - What is best?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
Artif. Intell., volume 336, pages 104194, 2024.
[bibtex] [pdf] [doi]
[60]Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy
Algorithmica, volume 86, number 7, pages 2250–2288, 2024.
[bibtex] [pdf] [doi]
[59]Hard QBFs for Merge Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood
ACM Trans. Comput. Theory, volume 16, number 2, pages 6:1–6:24, 2024.
[bibtex] [pdf] [doi]
[58]ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP
Leroy Chew, Alexis de Colnet, Stefan Szeider
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 253–263, 8 2024.
[bibtex] [pdf] [doi]
[57]Revisiting Causal Discovery from a Complexity-Theoretic Perspective
Robert Ganian, Viktoriia Korchemna, Stefan Szeider
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3377–3385, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [doi]
[56]Explaining Decisions in ML Models: A Parameterized Complexity Analysis
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, pages 563–573, 8 2024.
[bibtex] [pdf] [doi]
[55]Compilation and Fast Model Counting beyond CNF
Alexis de Colnet, Stefan Szeider, Tianwei Zhang
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24 (Kate Larson, ed.), pages 3315–3323, 8 2024, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [doi]
[54]Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks
Johannes Varga, Emil Karlsson, Günther R. Raidl, Elina Rönnberg, Fredrik Lindsten, Tobias Rodemann
Machine Learning, Optimization, and Data Science. LOD 2023. (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Panos M. Pardalos, Umeton Renato, eds.), volume 14505 of lNCS, pages 24–38, 2024, Springer.
[bibtex] [pdf] [doi]
[53]Selecting User Queries in Interactive Job Scheduling
Johannes Varga, Günther R. Raidl, Tobias Todemann
19th International Conference on Computer Aided Systems Theory, 2024, Springer.
Note: to appear
[bibtex] [pdf]
[52]A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning
Jaume Reixach, Christian Blum, Marko Djukanović, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2024 (T. Stützle, M. Wagner, eds.), volume 14632 of LNCS, pages 1–15, 2024, Springer.
Note: best paper award winner
[bibtex] [pdf] [doi]
[51]Hoop Diagrams: A Set Visualization Method
Peter Rodgers, Peter Chapman, Andrew Blake, Martin Nöllenburg, Markus Wallinger, Alexander Dobler
Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.
[bibtex] [doi]
[50]GdMetriX - A NetworkX Extension For Graph Drawing Metrics
Martin Nöllenburg, Sebastian Röder, Markus Wallinger
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 45:1–45:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[49]Introducing Fairness in Graph Visualization via Gradient Descent
Fabrizio Montecchiani, Giuseppe Liotta, Martin Nöllenburg, Seok-Hee Hong, Tommaso Piselli
Machine Learning Methods in Visualisation for Big Data (MLVis'24) (Daniel Archambault, Ian Nabney, Jaakko Peltonen, eds.), pages 1–5, 2024, Eurographics Association.
[bibtex] [doi]
[48]Introducing Fairness in Graph Visualization
Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 49:1–49:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[47]A Simulated Annealing Based Approach for the Roman Domination Problem
Jakob Greilhuber, Sophia Schober, Enrico Iurlano, Günther R. Raidl
Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 28–43, 2024, Springer.
[bibtex] [pdf] [doi]
[46]Minimizing Switches in Cased Graph Drawings
Robert Ganian, Martin Nöllenburg, Sebastian Röder
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 43:1–43:3, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: Poster abstract
[bibtex] [doi]
[45]Flip-breakability: A combinatorial dichotomy for monadically dependent graph classes
Jan Dreier, Nikolas Mählmann, Szymon Toruńczyk
Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1550–1560, 2024.
[bibtex] [pdf]
[44]First-Order Model Checking on Monadically Stable Graph Classes
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michał Pilipczuk, Szymon Toruńczyk
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pages 21-30, 2024.
[bibtex] [pdf] [doi]
[43]Constrained Boundary Labeling
Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger
Algorithms and Computation (ISAAC'24) (Julian Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 26:1–26:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[42]Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[41]The Parameterized Complexity of Extending Stack Layouts
Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 12:1–12:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[40]Minimizing Corners in Colored Rectilinear Grids
Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms
Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer.
[bibtex] [doi]
[39]Improvements in Large Neighborhood Search for the Electric Autonomous Dial-A-Ride Problem
Maria Bresich, Günther R. Raidl, Steffen Limmer
19th International Conference on Computer Aided Systems Theory (EUROCAST 2024), 2024, Springer.
Note: in press; preprint: https://www.ac.tuwien.ac.at/files/pub/bresich-24c.pdf
[bibtex] [pdf]
[38]Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion
Maria Bresich, Günther R. Raidl, Steffen Limmer
Proceedings of the Genetic and Evolutionary Computation Conference, pages 142–150, 2024, Association for Computing Machinery.
Note: best paper award winner of ECOM track
[bibtex] [pdf] [doi]
[37]Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem
Maria Bresich, Johannes Varga, Günther R. Raidl, Steffen Limmer
Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Rachid Ellaia, El-Ghazali Talbi, eds.), pages 3–20, 2024, Springer.
[bibtex] [pdf] [doi]
[36]Boundary Labeling in a Circular Orbit
Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 22:1–22:17, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[35]Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time
Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms
Computational Geometry (SoCG'24) (Wolfgang Mulzer, Jeff M. Phillips, eds.), volume 293 of LIPIcs, pages 19:1–19:16, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[34]Bundling-Aware Graph Drawing
Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, Markus Wallinger
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 15:1–15:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[33]Small unsatisfiable k-CNFs with bounded literal occurrence
Tianwei Zhang, Tomáš Peitl, Stefan Szeider
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1–31:22, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[32]SAT-Based Tree Decomposition with Iterative Cascading Policy Selection
Hai Xia, Stefan Szeider
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 8191–8199, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[31]SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints
Henning Martin Woydt, Christian Komusiewicz, Frank Sommer
32nd Annual European Symposium on Algorithms (ESA 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[30]Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger, Benjamin Doerr
Parallel Problem Solving from Nature - PPSN XVIII - 18th International Conference, PPSN 2024, Hagenberg, Austria, September 14-18, 2024, Proceedings, Part IV (Michael Affenzeller, Stephan M. Winkler, Anna V. Kononova, Heike Trautmann, Tea Tusar, Penousal Machado, Thomas Bäck, eds.), volume 15151 of Lecture Notes in Computer Science, pages 153–168, 2024, Springer Verlag.
[bibtex] [pdf] [doi]
[29]Structure-guided Local Improvement for Maximum Satisfiability
André Schidler, Stefan Szeider
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex]
[28]eSLIM: Circuit Minimization with SAT Based Local Improvement
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[27]The Power of Collaboration: Learning Large Bayesian Networks at Scale
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia
2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI), pages 371-378, 2024.
[bibtex] [doi]
[26]A General Theoretical Framework for Learning Smallest Interpretable Models
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10662–10669, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[25]Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
Markus Kirchweger, Stefan Szeider
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex]
[24]Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)
Petr Hlinený, Liana Khazaliya
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[23]On the Complexity of Community-aware Network Sparsification
Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer
49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[22]Generating All Invertible Matrices by Row Operations
Petr Gregor, Hung P. Hoang, Arturo Merino, Ondrej Micka
35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 35:1–35:14, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[21]The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Robert Ganian, Mathis Rocton, Daniel Unterberger
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2024, Spik, Slovenia, June 19-21, 2024, Revised Selected Papers, 2024, Springer Verlag.
Note: to appear
[bibtex]
[20]A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 68:1–68:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[19]Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[18]The Complexity of Fair Division of Indivisible Items with Externalities
Argyrios Deligkas, Eduard Eiben, Viktoriia Korchemna, Simon Schierreich
Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 9653–9661, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[17]Learning Small Decision Trees for Data of Low Rank-Width
Konrad Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 10476–10483, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[16]Exact Algorithms for Clustered Planarity with Linear Saturators
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
35th International Symposium on Algorithms and Computation, ISAAC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex]
[15]The Parameterized Complexity of Extending Stack Layouts
Thomas Depian, Simon Dominik Fink, Robert Ganian, Martin Nöllenburg
Graph Drawing and Network Visualization - 31st International Symposium, GD 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[14]Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 53:1–53:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[13]The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(\geq\) 5
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson, eds.), volume 297 of LIPIcs, pages 84:1–84:18, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[12]Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
AAAI'24, the Thirty-Eighth AAAI Conference on Artificial Intelligence, February 20-27, Vancouver, Canada (Jennifer Dy, Sriraam Natarajan, eds.), pages 7978–7986, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[11]Non-Clashing Teaching Maps for Balls in Graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
The Thirty Seventh Annual Conference on Learning Theory, June 30 - July 3, 2023, Edmonton, Canada (Shipra Agrawal, Aaron Roth, eds.), volume 247 of Proceedings of Machine Learning Research, pages 840–875, 2024, PMLR.
[bibtex] [pdf]
[10]Hot off the Press: The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Sacha Cerf, Benjamin Doerr, Benjamin Hebras, Yakob Kahane, Simon Wietheger
Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2024, Melbourne, VIC, Australia, July 14-18, 2024 (Xiaodong Li, Julia Handl, eds.), pages 27–28, 2024, ACM.
[bibtex] [pdf] [doi]
[9]Counting Vanishing Matrix-Vector Products
Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of Lecture Notes in Computer Science, pages 335–349, 2024, Springer Verlag.
[bibtex] [pdf] [doi]
[8]The Complexity of Optimizing Atomic Congestion
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada (Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, eds.), pages 20044–20052, 2024, AAAI Press.
[bibtex] [pdf] [doi]
[7]Enumerating Minimal Solution Sets for Metric Graph Problems
Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král, Martin Milanic, eds.), volume 14760 of Lecture Notes in Computer Science, pages 50–64, 2024, Springer Verlag.
[bibtex] [pdf] [doi]
[6]Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension
Valentin Bartier, Oscar Defrain, Fionn Mc Inerney
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings (Adele Anna Rescigno, Ugo Vaccaro, eds.), volume 14764 of Lecture Notes in Computer Science, pages 111–125, 2024, Springer Verlag.
[bibtex] [pdf] [doi]
[5]Twin-Width Meets Feedback Edges and Vertex Integrity
Jakub Balabán, Robert Ganian, Mathis Rocton
19th International Symposium on Parameterized and Exact Computation, IPEC 2024, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[4]Computing Twin-Width Parameterized by the Feedback Edge Number
Jakub Balabán, Robert Ganian, Mathis Rocton
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, eds.), volume 289 of LIPIcs, pages 7:1–7:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[3]An AlphaZero Agent for Just 4 Fun, a Non-Deterministic Game with Imperfect Information
Peter Neubauer
Oct 2024, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and Daniel Obszelka
[bibtex] [pdf]
[2]Strength Estimation in the Game of Go
Peter Neubauer
Oct 2024, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[1]Graph Neural Networks Meet Local Search for the Weighted Total Domination Problem
Alexander Simunics
Oct 2024, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Varga
[bibtex] [pdf]

2023

89 results
2023
[89]The Silent (R)evolution of SAT
Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
Communications of the ACM, volume 66, number 6, pages 64–72, June 2023.
[bibtex] [doi]
[88]LinSets.zip: Compressing Linear Set Diagrams
Markus Wallinger, Alexander Dobler, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023.
[bibtex] [doi]
[87]Faster Edge-Path Bundling Through Graph Spanners
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
Computer Graphics Forum, volume 42, number 6, pages e14789, 2023.
[bibtex] [doi]
[86]MosaicSets: Embedding Set Systems into Grid Graphs
Peter Rottmann, Markus Wallinger, Annika Bonerath, Sven Gedicke, Martin Nöllenburg, Jan-Henrik Haunert
IEEE Trans. Visualization and Computer Graphics, 2023.
[bibtex] [pdf]
[85]Large Neighborhood Search for Electric Vehicle Fleet Scheduling
Steffen Limmer, Johannes Varga, Günther R. Raidl
Energies, volume 16, number 12, 2023.
[bibtex] [pdf] [doi]
[84]Growth of the perfect sequence covering array number
Enrico Iurlano
Designs, Codes and Cryptography, volume 91, number 4, pages 1487–1494, 2023, Springer.
[bibtex] [pdf] [doi]
[83]New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi, Liana Khazaliya
Dagstuhl Reports, volume 13, number 4, pages 58–97, 2023.
[bibtex] [doi]
[82]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Comput. Geom. Theory Appl., volume 111, 2023.
[bibtex] [doi]
[81]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
ACM Trans. Spatial Algorithms and Systems, volume 9, number 3, pages 19:1–19:32, 2023.
[bibtex] [doi]
[80]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
European J. Combinatorics, volume 110, pages 103662, 2023.
[bibtex] [doi]
[79]Splitting Vertices in 2-Layer Graph Drawings
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann, Stephen Kobourov, Martin Nöllenburg, Antonios Symvonis, Anaïs Villedieu, Markus Wallinger
IEEE Computer Graphics and Applications, volume 43, number 3, pages 24–35, 2023.
[bibtex] [doi]
[78]Computing optimal hypertree decompositions with SAT
André Schidler, Stefan Szeider
Artificial Intelligence, volume 325, pages 104015, 2023.
[bibtex] [pdf] [doi]
[77]SAT-Boosted Tabu Search for Coloring Massive Graphs
Andre Schidler, Stefan Szeider
J. Exp. Algorithmics, volume 2825, number 1.5, pages 1–19, 2023.
[bibtex] [doi]
[76]Are Hitting Formulas Hard for Resolution?
Tomáš Peitl, Stefan Szeider
Discr. Appl. Math., volume 337, pages 173–184, 2023.
[bibtex] [doi]
[75]Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Algorithmica, volume 85, number 7, pages 2156–2187, 2023.
[bibtex] [pdf] [doi]
[74]Essentially Tight Kernels for (Weakly) Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Algorithmica, volume 85, number 6, pages 1706–1735, 2023.
[bibtex] [pdf] [doi]
[73]The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
Theory Comput. Syst., volume 67, number 5, pages 1050–1081, 2023.
[bibtex] [pdf] [doi]
[72]Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
Algorithmica, volume 85, number 5, pages 1111–1155, 2023.
[bibtex] [pdf] [doi]
[71]Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
SIAM J. Discrete Math., 2023.
Note: to appear
[bibtex]
[70]Hedonic diversity games: A complexity picture with more than two colors
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchy
Artif. Intell., volume 325, pages 104017, 2023.
[bibtex] [pdf] [doi]
[69]On the parameterized complexity of clustering problems for incomplete data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Journal of Computer and System Sciences, volume 134, pages 1–19, 2023.
[bibtex] [doi]
[68]Parameterized complexity of envy-free resource allocation in social networks
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Artif. Intell., volume 315, pages 103826, 2023.
[bibtex] [pdf] [doi]
[67]Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Discret. Math. Theor. Comput. Sci., volume 25, 2023.
[bibtex] [pdf] [doi]
[66]CSP beyond tractable constraint languages
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
Constraints, volume 28, number 3, pages 450–471, 2023.
[bibtex] [pdf] [doi]
[65]Sample compression schemes for balls in graphs
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
SIAM J. Discrete Math., 2023.
Note: to appear
[bibtex]
[64]Interactive Job Scheduling with Partially Known Personnel Availabilities
Johannes Varga, Günther R. Raidl, Elina Rönnberg, Tobias Rodemann
OLA 2023: Optimization and Learning (B. Dorronsoro, F. Chicano, G. Danoy, E.-G. Talbi, eds.), volume 1824 of Communications in Computer and Information Science, pages 236–247, 2023, Springer.
[bibtex] [pdf] [doi]
[63]Computing Hive Plots: A Combinatorial Framework
Martin Nöllenburg, Markus Wallinger
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14466 of LNCS, pages 153–169, 2023, Springer.
[bibtex] [pdf] [doi]
[62]Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 232–246, 2023, Springer.
[bibtex] [pdf] [doi]
[61]On Families of Planar DAGs with Constant Stack Number
Martin Nöllenburg, Sergey Pupyrev
Graph Drawing and Network Visualization (GD'23) (Michael Bekos, Markus Chimani, eds.), volume 14465 of LNCS, pages 135–151, 2023, Springer.
[bibtex] [pdf] [doi]
[60]First-Order Model Checking on Structurally Sparse Graph Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pages 567-580, 2023, Association for Computing Machinery.
[bibtex] [pdf] [doi]
[59]An Evolutionary Approach for Scheduling a Fleet of Shared Electric Vehicles
Steffen Limmer, Johannes Varga, Günther R. Raidl
EvoApplications 2023: Applications of Evolutionary Computation (J. Correia, S. Smith, R. Qaddoura, eds.), volume 13989 of LNCS, pages 3-18, 2023, Springer.
[bibtex] [pdf] [doi]
[58]The Influence of Dimensions on the Complexity of Computing Decision Trees
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms
Conference on Artificial Intelligence (AAAI'23) (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 8343–8350, 2023, AAAI Press.
[bibtex] [doi]
[57]Optimizing the positions of battery swapping stations – Pilot Studies and Layout Optimization Algorithm
Tobias Rodemann, Hiroaki Kataoka, Thomas Jatschka, Günther R. Raidl, Steffen Limmer, Meguro Hiromu
Proceedings to the 6th International Electric Vehicle Technology Conference, pages 20231015, 2023, JSAE.
[bibtex] [pdf]
[56]A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 50–65, 2023, Springer.
[bibtex] [pdf] [doi]
[55]A Relative Value Function Based Learning Beam Search for the Longest Common Subsequence Problem
Marc Huber, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2022 (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 13789 of LNCS, pages 87-95, 2023, Springer.
[bibtex] [pdf] [doi]
[54]MySemCloud: Semantic-aware Word Cloud Editing
Michael Huber, Martin Nöllenburg, Anaïs Villedieu
Pacific Visualization Symposium (PacificVis'23), pages 147–156, 2023.
[bibtex] [pdf] [doi]
[53]Splitting Plane Graphs to Outerplanarity
Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu
Algorithms and Computation (WALCOM'23) (Bertrand M. T. Lin, Chun-Cheng Lin, Giuseppe Liotta, eds.), volume 13973 of LNCS, 2023, Springer.
[bibtex] [pdf] [doi]
[52]Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines
Nikolaus Frohner, Günther R. Raidl, Francisco Chicano
, pages 1941–1949, 2023, ACM Press.
[bibtex] [doi]
[51]A Policy-Based Learning Beam Search for Combinatorial Optimization
Rupert Ettrich, Marc Huber, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – 23rd European Conference, EvoCOP 2023 (Leslie Pérez Cáceres, Thomas Stützle, eds.), volume 13987 of LNCS, pages 130–145, 2023, Springer.
Note: best paper award winner
[bibtex] [pdf] [doi]
[50]Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
Jan Dreier, Daniel Mock, Peter Rossmanith
31st Annual European Symposium on Algorithms (ESA 2023) (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 43:1–43:17, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[49]Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany (Kousha Etessami, Uriel Feige, Gabriele Puppis, eds.), volume 261 of LIPIcs, pages 125:1–125:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[48]A logic-based algorithmic meta-theorem for mim-width
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3282-3304, 2023.
[bibtex] [pdf] [doi]
[47]Crossing Minimization in Time Interval Storylines
Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023.
[bibtex] [pdf]
[46]Block Crossings in One-Sided Tanglegrams
Alexander Dobler, Martin Nöllenburg
Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer.
[bibtex] [pdf] [doi]
[45]Transitions in Dynamic Point Labeling
Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms
Geographic Information Science (GIScience'23) (Roger Beecham, Jed A. Long, Dianna Smith, Qunshan Zhao, Sarah Wise, eds.), volume 277 of LIPIcs, pages 2:1–2:19, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[44]Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
Computational Geometry (SoCG'23) (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[43]On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis
Graph Drawing and Network Visualization (GD'22) (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of LNCS, pages 304–318, 2023, Springer.
[bibtex] [doi]
[42]Searching for smallest universal graphs and tournaments with SAT
Tianwei Zhang, Stefan Szeider
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 39:1–39:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[41]Proven optimally-balanced Latin rectangles with SAT
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceedings of CP 2023, the 29th International Conference on Principles and Practice of Constraint Programming (Roland Yap, ed.), volume 280 of LIPIcs, pages 48:1–48:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[40]Maximizing Social Welfare in Score-Based Social Distance Games
Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý
Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge, TARK 2023, Oxford, United Kingdom, 28-30th June 2023 (Rineke Verbrugge, ed.), volume 379 of EPTCS, pages 272–286, 2023.
[bibtex] [pdf] [doi]
[39]Exact Algorithms for Group Closeness Centrality
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer
SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 1–12, 2023, SIAM.
[bibtex] [pdf] [doi]
[38]Computing twin-width with SAT and branch & bound
Andre Schidler, Stefan Szeider
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 2013–2021, 2023, ijcai.org.
Note: Main Track
[bibtex] [pdf] [doi]
[37]A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
Rafael Kiesel, André Schidler
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023 (Gonzalo Navarro, Julian Shun, eds.), pages 39–52, 2023, SIAM.
[bibtex] [doi]
[36]Circuit Minimization with QBF-Based Exact Synthesis
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 4087–4094, 2023, AAAI Press.
[bibtex] [pdf] [doi]
[35]Circuit Minimization with Exact Synthesis: From QBF Back to SAT
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS), 2023.
[bibtex]
[34]The Parameterized Complexity of Finding Concise Local Explanations
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 3312–3320, 2023, ijcai.org.
[bibtex] [pdf] [doi]
[33]On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics
Christian Komusiewicz, Jannis Schramek, Frank Sommer
SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 (Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann, eds.), pages 13–24, 2023, SIAM.
[bibtex] [pdf] [doi]
[32]On Computing Optimal Tree Ensembles
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge
International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA (Andreas Krause, Emma Brunskill, Kyunghyun Cho, Barbara Engelhardt, Sivan Sabato, Jonathan Scarlett, eds.), volume 202 of Proceedings of Machine Learning Research, pages 17364–17374, 2023, PMLR.
[bibtex] [pdf]
[31]SAT-Based Generation of Planar Graphs
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 14:1–14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[30]A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture
Markus Kirchweger, Tomáš Peitl, Stefan Szeider
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 13:1–13:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[29]Co-Certificate Learning with SAT Modulo Symmetries
Markus Kirchweger, Tomáš Peitl, Stefan Szeider
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 1944–1953, 2023, ijcai.org.
Note: Main Track
[bibtex] [pdf] [doi]
[28]Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, Erik Jan van Leeuwen
31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands (Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman, eds.), volume 274 of LIPIcs, pages 18:1–18:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[27]Inconsistent Cores for ASP: The Perks and Perils of Non-Monotonicity
Johannes K. Fichte, Markus Hecher, Stefan Szeider
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6363–6371, 2023, AAAI Press.
[bibtex] [pdf] [doi]
[26]IPASIR-UP: User Propagators for CDCL
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
The 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), July 04-08, 2023, Alghero, Italy (Meena Mahajan, Friedrich Slivovsky, eds.), volume 271 of LIPIcs, pages 8:1–8:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[25]Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–14, 2023.
[bibtex] [pdf] [doi]
[24]Learning Small Decision Trees with Large Domain
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 3184–3192, 2023, ijcai.org.
Note: Main Track
[bibtex] [pdf] [doi]
[23]A Structural Complexity Analysis of Synchronous Dynamical Systems
Eduard Eiben, Robert Ganian, Thekla Hamm, Viktoriia Korchemna
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6313–6321, 2023, AAAI Press.
[bibtex] [pdf]
[22]The Computational Complexity of Concise Hypersphere Classification
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceedings of the 40th International Conference on Machine Learning, ICML 2023, pages 9060–9070, 2023, PMLR.
[bibtex] [pdf]
[21]From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 16:1–16:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[20]The Parameterized Complexity of Coordinated Motion Planning
Eduard Eiben, Robert Ganian, Iyad Kanj
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 28:1–28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[19]Pseudorandom Finite Models
Jan Dreier, Jamie Tucker-Foltz
LICS, pages 1–13, 2023.
[bibtex] [pdf] [doi]
[18]Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
Robert Ganian, Liana Khazaliya, Kirill Simonov
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 18:1–18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[17]A Polyhedral Perspective on Tropical Convolutions
Cornelius Brand, Martin Koutecký, Alexandra Lassota
Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings (Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, eds.), volume 13889 of Lecture Notes in Computer Science, pages 111–122, 2023, Springer Verlag.
[bibtex] [pdf] [doi]
[16]Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth
Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer Verlag.
[bibtex] [pdf] [doi]
[15]Fast Convolutions for Near-Convex Sequences
Cornelius Brand, Alexandra Lassota
34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan (Satoru Iwata, Naonori Kakimura, eds.), volume 283 of LIPIcs, pages 16:1–16:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[14]Deterministic Constrained Multilinear Detection
Cornelius Brand, Viktoriia Korchemna, Michael Skotnica
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (Jérôme Leroux, Sylvain Lombardy, David Peleg, eds.), volume 272 of LIPIcs, pages 25:1–25:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[13]A Parameterized Theory of PAC Learning
Cornelius Brand, Robert Ganian, Kirill Simonov
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6834–6841, 2023, AAAI Press.
[bibtex] [pdf]
[12]New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
Cornelius Brand, Robert Ganian, Mathis Rocton
Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023.
[bibtex]
[11]Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
Cornelius Brand, Robert Ganian, Sebastian Röder, Florian Schager
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 66–81, 2023, Springer Verlag.
[bibtex] [pdf] [doi]
[10]On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model
Matthias Bentert, Jannik Schestag, Frank Sommer
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands (Neeldhara Misra, Magnus Wahlström, eds.), volume 285 of LIPIcs, pages 4:1–4:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[9]The Parameterized Complexity of Network Microaggregation
Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 6262–6270, 2023, AAAI Press.
[bibtex] [pdf]
[8]Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani, Martin Nöllenburg
39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA (Erin W. Chambers, Joachim Gudmundsson, eds.), volume 258 of LIPIcs, pages 18:1–18:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[7]Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs
Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf
SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings (Leszek Gasieniec, ed.), volume 13878 of Lecture Notes in Computer Science, pages 283–297, 2023, Springer Verlag.
[bibtex] [pdf] [doi]
[6]Algorithms for Satisfiability Testing
Florentina Voboril
September 2023, SKILL 2023, Gesellschaft für Informatik, Bonn.
[bibtex]
[5]Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning
Nikolaus Frohner
May 2023, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl
[bibtex] [pdf]
[4]Computational Optimization Approaches for Distributing Battery Exchange Stations for Electric Scooters
Bernhard Kreutzer
Sep 2023, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[3]A Learning Multilevel Optimization Approach for a Large Location Allocation Problem
Laurenz Tomandl
May 2023, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[2]Hybrid Metaheuristics Based on Large Neighborhood Search and Mixed Integer Linear Programming for the Directed Feedback Vertex Set Problem
Maria Bresich
Jan 2023, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and J. Varga
[bibtex] [pdf]
[1]Hybrid Approaches to Sports League Scheduling using Constraint Programming and Simulated Annealing
Bernhard Neumann
Jan 2023, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
[bibtex] [pdf]

2022

87 results
2022
[87]47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
(Stefan Szeider, Robert Ganian, Alexandra Silva, eds.), volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[86]Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl
ACM Transactions on Computational Logic, September 2022, Association for Computing Machinery.
[bibtex] [pdf] [doi]
[85]Initial Learning of Textual Programming at School: Evolution of Outreach Activities
Martina Landman, Gerald Futschek, Svetlana Unkovic, Florentina Voboril
OLYMPIADS IN INFORMATICS, pages 43–53, January 2022.
[bibtex] [pdf] [doi]
[84]Multi-level Area Balancing of Clustered Graphs
Hsiang-Yun Wu, Martin Nöllenburg, Ivan Viola
IEEE Trans. Visualization and Computer Graphics, volume 28, number 7, pages 2682–2696, 2022.
[bibtex] [doi]
[83]Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach
Markus Wallinger, Daniel Archambault, David Auber, Martin Nöllenburg, Jaakko Peltonen
IEEE Trans. Visualization and Computer Graphics, volume 28, number 1, pages 313–323, 2022.
[bibtex] [doi]
[82]Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet
Johannes Varga, Günther R. Raidl, Steffen Limmer
Access, volume 10, 2022.
[bibtex] [pdf] [doi]
[81]Multicriteria Optimization for Dynamic Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans, Stephen Kobourov, Jaakko Peltonen, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 6, pages 2376–2387, 2022.
Note: TVCG Replicability Stamp
[bibtex] [doi]
[80]Recognizing Weighted and Seeded Disk Graphs
Boris Klemz, Martin Nöllenburg, Roman Prutkin
J. Computational Geometry, volume 13, number 1, pages 327–376, 2022.
[bibtex] [doi]
[79]Twin-width and generalized coloring numbers
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Discrete Mathematics, volume 345, number 3, pages 112746, 2022.
[bibtex] [pdf] [doi]
[78]Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences
Marko Djukanovic, Aleksandar Kartelj, Dragan Matić, Milana Grbić, Christian Blum, Günther R. Raidl
Applied Soft Computing, volume 122, pages 108844, 2022.
[bibtex] [pdf] [doi]
[77]Mixed Labeling: Integrating Internal and External Labels
Ladislav Čmolík, Václav Pavlovec, Hsiang-Yun Wu, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 28, number 4, pages 1848–1861, 2022.
[bibtex] [pdf] [doi]
[76]Shape-Guided Mixed Metro Map Layout
Tobias Batik, Soeren Terziadis, Yu-Shuen Wang, Martin Nöllenburg, Hsiang-Yun Wu
Computer Graphics Forum, volume 41, number 7, pages 495–506, 2022.
[bibtex] [doi]
[75]An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
Sujoy Bhore, Guangping Li, Martin Nöllenburg
ACM J. Experimental Algorithmics, volume 27, pages 1.8:1–1.8:36, 2022.
[bibtex] [doi]
[74]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022.
[bibtex] [doi]
[73]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
J. Graph Algorithms Appl., volume 26, number 3, pages 335–352, 2022.
[bibtex] [pdf] [doi]
[72]An efficient algorithm for counting Markov equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
Artificial Intelligence, volume 304, pages 103648, 2022.
[bibtex] [pdf] [doi]
[71]Colored cut games
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Theoretical Computer Science, volume 936, pages 13–32, 2022.
[bibtex] [pdf] [doi]
[70]Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Theory Comput. Syst., volume 66, number 5, pages 1019–1045, 2022.
[bibtex] [pdf] [doi]
[69]Exploiting \textdollarc\textdollar-Closure in Kernelization Algorithms for Graph Problems
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
SIAM J. Discrete Math., volume 36, number 4, pages 2798–2821, 2022.
[bibtex] [pdf] [doi]
[68]Threshold Treewidth and Hypertree Width
Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider
Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022.
[bibtex] [pdf] [doi]
[67]Algorithmic Applications of Tree-Cut Width
Robert Ganian, Eun Jung Kim, Stefan Szeider
SIAM J. Discrete Math., volume 36, number 4, pages 2635–2666, 2022.
[bibtex] [pdf] [doi]
[66]Sum-of-Products with Default Values: Algorithms and Complexity Results
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Journal of Artificial Intelligence Research, volume 33, pages 535–552, 2022.
[bibtex] [pdf]
[65]Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
Robert Ganian, Jan Kratochvíl, Stefan Szeider
Discr. Appl. Math., volume 312, pages 1–2, 2022.
[bibtex] [pdf]
[64]Removing Popular Faces in Curve Arrangements
Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote
CoRR, volume abs/2202.12175, 2022.
[bibtex] [pdf]
[63]Finding a Battleship of Uncertain Shape
Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec, Markus Wallinger
CoRR, volume abs/2202.08747, 2022.
[bibtex] [pdf]
[62]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
SIAM J. Discret. Math., volume 36, number 2, pages 1200–1230, 2022.
[bibtex] [pdf] [doi]
[61]A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Tobias Rodemann, Günther R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (Alexis Quesada-Arencibia, others, eds.), pages 32–33, feb 2022.
[bibtex] [pdf]
[60]A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters
Thomas Jatschka, Matthias Rauscher, Bernhard Kreutzer, Yusuke Okamoto, Tobias Rodemann, Günther R. Raidl
Chapter in Computer Aided Systems Theory – EUROCAST 2022, volume 13789 of LNCS, pages 121-129, 2022, Springer.
[bibtex] [pdf]
[59]A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
Marc Huber, Günther R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 22–23, 2022.
[bibtex] [pdf]
[58]Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regime
N. Frohner, G. R. Raidl
Chapter in Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory – EUROCAST 2022 (Alexis Quesada-Arencibia, others, eds.), pages 20–21, 2022.
[bibtex] [pdf]
[57]Fine-grained Complexity of Partial Minimum Satisfiability
Ivan Bliznets, Danil Sagunov, Kirill Simonov
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 (Lud De Raedt, ed.), pages 1774–1780, 7 2022, International Joint Conferences on Artificial Intelligence Organization.
Note: Main Track
[bibtex] [pdf] [doi]
[56]A Learning Large Neighborhood Search for the Staff Rerostering Problem
Fabio F. Oberweger, Günther R. Raidl, Elina Rönnberg, Marc Huber
Integration of Constraint Programming, Artificial Intelligence, and Operations Research – CPAIOR 2022 (Pierre Schaus, ed.), volume 13292 of LNCS, pages 300–317, 2022, Springer.
[bibtex] [pdf] [doi]
[55]A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther Raidl
Evolutionary Computation in Combinatorial Optimization – EvoCOP 2022 (Leslie Pérez Cáceres, Sébastien Verel, eds.), volume 13222 of LNCS, pages 127–142, 2022, Springer.
Note: best paper award winner
[bibtex] [pdf] [doi]
[54]A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Metaheuristics and Nature Inspired Computing (Bernabé Dorronsoro, Farouk Yalaoui, El-Ghazali Talbi, Grégoire Danoy, eds.), volume 1541 of CCIS, pages 3–17, 2022, Springer.
[bibtex] [pdf]
[53]Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
Marc Huber, Günther R. Raidl
Machine Learning, Optimization, and Data Science, LOD 2021 (Giuseppe Nicosia, Varun Ojha, Emanuele La Malfa, Gabriele La Malfa, Giorgio Jansen, Panos M. Pardalos, Giovanni Giuffrida, Renato Umeton, eds.), volume 13164 of LNCS, pages 283–298, 2022, Springer.
[bibtex] [pdf] [doi]
[52]Parallel Beam Search for Combinatorial Optimization
Nikolaus Frohner, Jan Gmys, Nourdine Melab, Günther Raidl, El-ghazali Talbi
Fifteenth International Symposium on Combinatorial Search (SoCS 2022), pages 273–275, 2022, AAAI.
[bibtex] [pdf] [doi]
[51]Turbocharging Heuristics for Weak Coloring Numbers
Alexander Dobler, Manuel Sorge, Anaïs Villedieu
European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[50]Combinatorial and Algorithmic Aspects of Monadic Stability
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
33rd International Symposium on Algorithms and Computation (ISAAC 2022) (Sang Won Bae, Heejin Park, eds.), volume 248 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1–11:17, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[49]On Computing Optimal Linear Diagrams
Alexander Dobler, Martin Nöllenburg
Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer.
[bibtex] [pdf] [doi]
[48]Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger
Theoretical Informatics (LATIN'22) (Armando Castañeda, Francisco Rodríguez-Henríquez, eds.), volume 13568 of LNCS, pages 273–289, 2022, Springer.
[bibtex] [doi]
[47]Minimum Link Fencing
Sujoy Bhore, Fabian Klute, Maarten Löffler, Martin Nöllenburg, Soeren Terziadis, Anaïs Villedieu
Algorithms and Computation (ISAAC'22) (Sang Won Bae, Heejin Park, eds.), volume 248 of LIPIcs, pages 34:1–34:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[46]Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'22) (Artur Czumaj, Qin Xin, eds.), volume 227 of LIPIcs, pages 4:1–4:19, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[45]Learning Large Bayesian Networks with Expert Constraints
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
38th Conference on Uncertainty in Artificial Intelligence (UAI 2022), Eindhoven, Netherlands, August 1–5, 2022 (James Cussens, Kun Zhang, eds.), pages 180:1592–1601, 2022.
[bibtex] [pdf]
[44]Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
Stefan Szeider, Robert Ganian, Alexandra Silva
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria, volume 241 of LIPIcs, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[43]A SAT Approach to Twin-Width
André Schidler, Stefan Szeider
Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf] [doi]
[42]PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT
Rafael Kiesel, André Schidler
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 32:1–32:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[41]SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)
André Schidler
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 74:1–74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[40]On Critical Node Problems with Vulnerable Vertices
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 494–508, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[39]Pedant: A Certifying DQBF Solver
Franz-Xaver Reichl, Friedrich Slivovsky
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 20:1–20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[38]A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[37]Covering Many (Or Few) Edges with k Vertices in Sparse Graphs
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 42:1–42:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[36]A SAT Attack on Rota’s Basis Conjecture
Markus Kirchweger, Manferd Scheucher, Stefan Szeider
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 4:1–4:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[35]The Complexity of Temporal Vertex Cover in Small-Degree Graphs
Thekla Hamm, Nina Klobas, George B. Mertzios, Paul G. Spirakis
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 10193–10201, 2022, AAAI Press.
[bibtex] [pdf]
[34]Parameterised Partially-Predrawn Crossing Number
Thekla Hamm, Petr Hlinený
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 46:1–46:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[33]The Parameterized Complexity of s-Club with Triangle and Seed Constraints
Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings (Cristina Bazgan, Henning Fernau, eds.), volume 13270 of Lecture Notes in Computer Science, pages 313–326, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[32]Slim Tree-Cut Width
Robert Ganian, Viktoriia Korchemna
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 15:1–15:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[31]Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 5034–5042, 2022, AAAI Press.
[bibtex] [pdf]
[30]The Complexity of k-Means Clustering when Little is Known
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA (Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvári, Gang Niu, Sivan Sabato, eds.), volume 162 of Proceedings of Machine Learning Research, pages 6960–6987, 2022, PMLR.
[bibtex] [pdf]
[29]The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France (Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, eds.), volume 229 of LIPIcs, pages 66:1–66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[28]Weighted Model Counting with Twin-Width
Robert Ganian, Filip Pokrývka, Andre Schidler, Kirill Simonov, Stefan Szeider
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[27]Longest Cycle above Erd\Hos–Gallai Bound
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov
30th Annual European Symposium on Algorithms (ESA 2022), volume 271 of LIPIcs, pages 13:1–13:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[26]Detours in Directed Graphs
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of Leibniz International Proceedings in Informatics (LIPIcs), pages 29:1–29:16, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[25]A Unifying Framework for Characterizing and Computing Width Measures
Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon
13th Innovations in Theoretical Computer Science Conference, ITCS 2022, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[24]Finding a Cluster in Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:14, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[23]Tractable Abstract Argumentation via Backdoor-Treewidth
Wolfgang Dvorak, Markus Hecher, Matthias König, Andre Schidler, Stefan Szeider, Stefan Woltran
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press.
[bibtex] [pdf]
[22]SAT Backdoors: Depth Beats Size
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
30th Annual European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 46:1–46:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[21]CSP Beyond Tractable Constraint Languages
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (Christine Solnon, ed.), volume 235 of LIPIcs, pages 20:1–20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[20]The Complexity of Envy-Free Graph Cutting
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 237–243, 2022, ijcai.org.
[bibtex] [pdf] [doi]
[19]Towards Uniform Certification in QBF
Leroy Chew, Friedrich Slivovsky
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference) (Petra Berenbrink, Benjamin Monmege, eds.), volume 219 of LIPIcs, pages 22:1–22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[18]Testing Upward Planarity of Partial 2-Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers (Patrizio Angelini, Reinhard von Hanxleden, eds.), volume 13764 of Lecture Notes in Computer Science, pages 175–187, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[17]Parameterized Algorithms for Upward Planarity
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 26:1–26:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[16]QCDCL with Cube Learning or Pure Literal Elimination - What is Best?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022 (Luc De Raedt, ed.), pages 1781–1787, 2022, ijcai.org.
Note: Distinguished Paper Award
[bibtex] [pdf] [doi]
[15]Should Decisions in QCDCL Follow Prefix Order?
Benjamin Böhm, Tomáš Peitl, Olaf Beyersdorff
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 11:1–11:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[14]FPT Approximation for Fair Minimum-Load Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
[bibtex]
[13]Lossy Kernelization of Same-Size Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings, pages 96–114, 2022, Springer-Verlag.
[bibtex] [pdf] [doi]
[12]How to Find a Good Explanation for Clustering?
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, pages 3904–3912, 2022, AAAI Press.
[bibtex] [pdf]
[11]Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers (Michael A. Bekos, Michael Kaufmann, eds.), volume 13453 of Lecture Notes in Computer Science, pages 98–113, 2022, Springer Verlag.
[bibtex] [pdf] [doi]
[10]Bounding and Computing Obstacle Numbers of Graphs
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 11:1–11:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[9]Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.
[bibtex] [pdf]
[8]Treelike Decompositions for Transductions of Sparse Graphs
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022), 2022, Association for Computing Machinery.
[bibtex] [pdf]
[7]Computing Treewidth with Constraint Programming
Florentina Voboril
pages 115–126, September 2022, SKILL 2022, Gesellschaft für Informatik, Bonn.
[bibtex] [pdf]
[6]Computational Optimization Approaches for Distributing Service Points for Mobility Applications and Smart Charging of Electric Vehicles
Thomas Jatschka
feb 2022, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl and T. Rodemann
[bibtex] [pdf]
[5]On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Frank Sommer
2022, PhD thesis, University of Marburg, Germany.
[bibtex] [pdf] [doi]
[4]Optimization of Container Transportation for Fixed-Schedule Block Trains with Optional Round Trips in Collaborative Logistics
Lukas Felician Krasel
Dec 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl, G. Brandstätter, and U. Ritzinger
[bibtex] [pdf]
[3]Minimizing Makespan in Flow Shops with a Reinforcement Learning Like Approach
Jonas Mayerhofer
May 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and Marc Huber
[bibtex] [pdf]
[2]A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters
Matthias Rauscher
Jan 2022, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[1]Scrambling permutations and related structures: asymptotics and constructions
Enrico Iurlano
2022, Master's thesis, TU Wien, Institute of Discrete Mathematics and Geometry.
Note: supervised by B. Gittenberger
[bibtex] [pdf] [doi]

2021

73 results
2021
[73]External Labeling: Fundamental Concepts and Algorithmic Techniques
Michael A. Bekos, Benjamin Niedermann, Martin Nöllenburg
2021, Morgan & Claypool.
[bibtex] [doi]
[72]On the Readability of Abstract Set Visualizations
Markus Wallinger, Ben Jacobsen, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 6, pages 2821–2832, 2021.
[bibtex] [doi]
[71]Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings
Bojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbić, Christian Blum, Günther Raidl
Mathematics, volume 9, number 13, 2021.
[bibtex] [pdf] [doi]
[70]Multivalued Decision Diagrams for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
Johannes Maschler, Günther R. Raidl
Annals of Operations Research, volume 302, pages 407–531, 2021.
[bibtex] [pdf]
[69]Labeling Nonograms: Boundary Labeling for Curve Arrangements
Fabian Klute, Maarten Löffler, Martin Nöllenburg
Comput. Geom. Theory Appl., volume 98, pages 101791, 2021.
[bibtex] [doi]
[68]MetroSets: Visualizing Sets as Metro Maps
Ben Jacobsen, Markus Wallinger, Stephen Kobourov, Martin Nöllenburg
IEEE Trans. Visualization and Computer Graphics, volume 27, number 2, pages 1257–1267, 2021.
[bibtex] [pdf] [doi]
[67]Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers
Benjamin Schaden, Thomas Jatschka, Steffen Limmer, Günther R. Raidl
Energies, volume 14, number 22, 2021.
[bibtex] [pdf] [doi]
[66]A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
Thomas Jatschka, Günther R. Raidl, Tobias Rodemann
Algorithms, volume 14, number 8, pages 232, 2021.
[bibtex] [pdf] [doi]
[65]A*-based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem
Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg
Computers & Operations Research, volume 126, number 105125, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-011a.pdf
[bibtex] [doi]
[64]A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
Matthias Horn, Günther R. Raidl, Elina Rönnberg
Annals of Operations Research, volume 302, pages 477–501, 2021.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-19-002.pdf
[bibtex] [pdf] [doi]
[63]Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg, Meirav Zehavi
Dagstuhl Reports, volume 11, number 6, pages 82–123, 2021.
[bibtex] [doi]
[62]ClusterSets: Optimizing Planar Clusters in Categorical Point Data
Jakob Geiger, Sabine Cornelsen, Jan-Henrik Haunert, Philipp Kindermann, Tamara Mchedlidze, Martin Nöllenburg, Yoshio Okamoto, Alexander Wolff
Computer Graphics Forum, volume 40, number 3, pages 471–481, 2021.
[bibtex] [pdf] [doi]
[61]Measuring what matters: A hybrid approach to dynamic programming with treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
J. Comput. Syst. Sci., volume 121, pages 57–75, 2021.
[bibtex] [pdf]
[60]Geometric Planar Networks on Bichromatic Collinear Points
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Theoretical Computer Science, volume 895, pages 124–136, 2021.
[bibtex] [doi]
[59]Finding the Hardest Formulas for Resolution
Tomáš Peitl, Stefan Szeider
Journal of Artificial Intelligence Research, volume 72, pages 69–97, 2021.
Note: Conference Award Track, best paper CP 2020
[bibtex] [doi]
[58]Enumerating connected induced subgraphs: Improved delay and experimental comparison
Christian Komusiewicz, Frank Sommer
Discr. Appl. Math., volume 303, pages 262–282, 2021.
[bibtex] [pdf] [doi]
[57]Destroying Bicolored $P_3$s by Deleting Few Edges
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
Discret. Math. Theor. Comput. Sci., volume 23, number 1, 2021.
[bibtex] [pdf] [doi]
[56]New Width Parameters for SAT and Sharp-SAT
Robert Ganian, Stefan Szeider
Artificial Intelligence, volume 295, pages 103460, 2021.
[bibtex] [pdf] [doi]
[55]On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 6, pages 1605–1637, 2021.
[bibtex] [pdf]
[54]The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Algorithmica, volume 83, number 2, pages 726–752, 2021.
[bibtex] [pdf]
[53]On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Robert Ganian, Fabian Klute, Sebastian Ordyniak
Algorithmica, volume 83, number 1, pages 297–336, 2021.
[bibtex] [pdf]
[52]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
J. Graph Algorithms Appl., 2021.
[bibtex] [pdf]
[51]Parameterized k-Clustering: Tractability island
Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
Journal of Computer and System Sciences, volume 117, pages 50 - 74, 2021.
[bibtex] [pdf] [doi]
[50]Graphs with at most two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Journal of Graph Theory, 2021, Wiley Online Library.
[bibtex]
[49]The complexity landscape of decompositional parameters for ILP: Programs with Few Global Variables and Constraints
Pavel Dvořák, Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak
Artificial Intelligence, 2021.
[bibtex] [pdf]
[48]Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths
Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl
Electron. Colloquium Comput. Complex., pages 135, 2021.
[bibtex] [pdf]
[47]Towards a Polynomial Kernel for Directed Feedback Vertex Set
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Algorithmica, volume 83, number 5, pages 1201–1221, 2021.
[bibtex] [pdf]
[46]Fixed-Parameter Tractability
Marko Samer, Stefan Szeider
Chapter in Handbook of Satisfiability, 2nd Edition (Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, eds.), pages 693–736, 2021, IOS Press.
[bibtex] [pdf] [doi]
[45]Stable Visual Summaries for Trajectory Collections
Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann
Pacific Visualization Symposium (PacificVis'21), pages 61–70, 2021, IEEE.
[bibtex] [doi]
[44]Layered Area-Proportional Rectangle Contact Representation
Martin Nöllenburg, Anaïs Villedieu, Jules Wulms
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 318–326, 2021, Springer.
[bibtex] [doi]
[43]Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
M. Horn, Günther R. Raidl
17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 72–88, 2021, Springer.
[bibtex] [pdf] [doi]
[42]Driver Shift Planning for an Online Store with Short Delivery Times
Matthias Horn, Nikolaus Frohner, Günther R. Raidl
Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 517–524, 2021.
[bibtex] [pdf] [doi]
[41]Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines
Nikolaus Frohner, Matthias Horn, Günther R. Raidl
Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), volume 180 of Procedia Computer Science, pages 366-370, 2021.
[bibtex] [pdf] [doi]
[40]Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Jan Dreier
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1-13, 2021.
Note: distinguished paper
[bibtex] [doi]
[39]Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems
Adrian Bracher, Nikolaus Frohner, Günther R. Raidl
17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'21) (Peter J. Stuckey, ed.), volume 12735 of LNCS, pages 283–298, 2021, Springer.
[bibtex] [pdf] [doi]
[38]Disjoint Box Covering in a Rectilinear Polygon
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Jules Wulms
European Workshop on Computational Geometry (EuroCG'21), pages 71:1–71:7, 2021.
[bibtex] [pdf]
[37]Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg, Ignaz Rutter, Hsiang-Yun Wu
Algorithms and Computation (ISAAC'21) (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 19:1–19:17, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[36]Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
Sujoy Bhore, Maarten Löffler, Soeren Nickel, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 304–317, 2021, Springer.
[bibtex] [pdf] [doi]
[35]Balanced Independent and Dominating Sets on Colored Interval Graphs
Sujoy Bhore, Jan-Henrik Haunert, Fabian Klute, Guangping Li, Martin Nöllenburg
Theory and Practice of Computer Science (SOFSEM'21) (Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdziński, Claus Pahl, Florian Sikora, Prudence Wong, eds.), volume 12607 of LNCS, pages 89–103, 2021, Springer.
[bibtex] [doi]
[34]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms
Advances in Geographic Information Systems (SIGSPATIAL'21), pages 256–267, 2021, ACM.
[bibtex] [pdf] [doi]
[33]On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'21) (Helen Purchase, Ignaz Rutter, eds.), volume 12868 of LNCS, pages 242–256, 2021, Springer.
[bibtex] [pdf] [doi]
[32]Learning fast-inference Bayesian networks
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceedings of NeurIPS 2021, the Thirty-fifth Conference on Neural Information Processing Systems (M. Ranzato, A. Beygelzimer, K. Nguyen, P.S. Liang, J.W. Vaughan, Y. Dauphin, eds.), pages 17852–17863, 2021.
[bibtex] [pdf]
[31]Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895–3903, 2021, AAAI Press.
[bibtex] [pdf]
[30]Computing Optimal Hypertree Decompositions with SAT
Andre Schidler, Stefan Szeider
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021.
[bibtex] [doi]
[29]SAT-based Decision Tree Learning for Large Data Sets
André Schidler, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press.
[bibtex] [pdf]
[28]Certified DQBF Solving by Definition Extraction
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[27]First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving
Wolfgang Schreiner, Franz-Xaver Reichl
Proceedings of the 9th International Symposium on Symbolic Computation in Software Science, SCSS 2021, Hagenberg, Austria, September 8-10, 2021 (Temur Kutsia, ed.), volume 342 of EPTCS, pages 99–113, 2021.
[bibtex] [pdf] [doi]
[26]Finding the Hardest Formulas for Resolution (Extended Abstract)
Tomáš Peitl, Stefan Szeider
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 4814–4818, 2021.
Note: Sister Conferences Best Papers
[bibtex] [doi]
[25]Parameterized Complexity of Small Decision Tree Learning
Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6454–6462, 2021, AAAI Press.
[bibtex] [pdf]
[24]Backdoor DNFs
Sebastian Ordyniak, Andre Schidler, Stefan Szeider
Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021.
[bibtex] [doi]
[23]Proof Complexity of Symbolic QBF Reasoning
Stefan Mengel, Friedrich Slivovsky
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 399–416, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[22]Essentially Tight Kernels For (Weakly) Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan (Hee-Kap Ahn, Kunihiko Sadakane, eds.), volume 212 of LIPIcs, pages 35:1–35:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[21]SAT Modulo Symmetries for Graph Generation
Markus Kirchweger, Stefan Szeider
Proceeings of CP 2021, the 27th International Conference on Principles and Practice of Constraint Programming (Laurent D. Michel, ed.), pages 39:1–-39:17, 2021, Dagstuhl Publishing.
[bibtex] [pdf] [doi]
[20]Computing Kemeny Rankings from d-Euclidean Preferences
Thekla Hamm, Martin Lackner, Anna Rapberger
Algorithmic Decision Theory - 7th International Conference, ADT 2021, Toulouse, France, November 3-5, 2021, Proceedings, volume 13023 of Lecture Notes in Computer Science, pages 147–161, 2021, Springer Verlag.
[bibtex]
[19]Preventing Small (s,t)Cuts by Protecting Edges
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers (Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski, eds.), volume 12911 of Lecture Notes in Computer Science, pages 143–155, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[18]Engineering an Efficient Boolean Functional Synthesis Engine
Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel
IEEE/ACM International Conference On Computer Aided Design, ICCAD 2021, Munich, Germany, November 1-4, 2021, pages 1–9, 2021, IEEE.
[bibtex] [pdf] [doi]
[17]The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Robert Ganian, Viktoriia Korchemna
Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual (Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, eds.), pages 430–442, 2021.
[bibtex] [pdf]
[16]The Complexity of Object Association in Multiple Object Tracking
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021, pages 1388–1396, 2021, AAAI Press.
[bibtex] [pdf]
[15]Crossing-Optimal Extension of Simple Drawings
Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, Birgit Vogtenhuber
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference) (Nikhil Bansal, Emanuela Merelli, James Worrell, eds.), volume 198 of LIPIcs, pages 72:1–72:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[14]The Parameterized Complexity of Clustering Incomplete Data
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296–7304, 2021, AAAI Press.
[bibtex] [pdf]
[13]EPTAS for \emphk-means Clustering of Affine Subspaces
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 (Dániel Marx, ed.), pages 2649–2659, 2021, SIAM.
[bibtex] [pdf] [doi]
[12]Approximate Evaluation of First-Order Counting Queries
Jan Dreier, Peter Rossmanith
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 2021, SIAM.
[bibtex] [pdf] [doi]
[11]The Parameterized Complexity of Connected Fair Division
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 (Zhi-Hua Zhou, ed.), pages 139–145, 2021, ijcai.org.
[bibtex] [pdf]
[10]Graphs with two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, 2021, Elsevier.
[bibtex] [pdf]
[9]Davis and Putnam Meet Henkin: Solving DQBF with Resolution
Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[8]On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), 2021.
[bibtex] [pdf] [doi]
[7]Parameterized Complexity of Feature Selection for Categorical Data Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (Filippo Bonchi, Simon J. Puglisi, eds.), volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1–14:14, 2021, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[6]Worbel: Aggregating Point Labels into Word Clouds
Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nollenburg, Jules Wulms
Proceedings of the International Conference on Advances in Geographic Information Systems 2021 (ACM SIGSPATIAL 2021), 2021.
[bibtex] [pdf]
[5]Exact and heuristic approaches for solving string problems from bioinformatics
Marko Djukanovic
Dec 2021, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G. R. Raidl
[bibtex] [pdf] [doi]
[4]A Learning Large Neighborhood Search for the Staff Rerostering Problem
Fabio Francisco Oberweger
Oct 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and E. Rönnberg and M. Huber, winner of the Austrian OCG Förderpreis 2022
[bibtex] [pdf]
[3]Computational Methods for Fleet Scheduling in E-Mobility
Johannes Varga
Aug 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl
[bibtex] [pdf]
[2]Scheduling the Charging of Electric Vehicles with SOC-Dependent Maximum Charging Power
Benjamin Schaden
Apr 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and T. Jatschka
[bibtex] [pdf]
[1]Randomized Construction Approaches to the Traveling Tournament Problem using Lower Bound Based Heuristics
Giulio Pace
Mar 2021, Master's thesis, TU Wien, Institute of Logic and Computation.
Note: supervised by G. Raidl and N. Frohner
[bibtex] [pdf]

2020

82 results
2020
[82]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]
[81]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]
[80]A Lower Bound for the Smallest Uniquely Hamiltonian Planar Graph with Minimum Degree Three
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Applied Mathematics and Computation, volume 380, number 125233, 2020.
[bibtex] [pdf] [doi]
[79]A Model for Finding Transition-Minors
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Discrete Applied Mathematics, volume 228, pages 242–264, 2020.
[bibtex] [pdf] [doi]
[78]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]
[77]Placing Labels in Road Maps: Algorithms and Complexity
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Algorithmica, volume 82, pages 1881–1908, 2020.
[bibtex] [doi]
[76]Route Schematization with Landmarks
Marcelo Galvão, Jakub Krukar, Martin Nöllenburg, Angela Schwering
J. Spatial Information Science, volume 21, 2020.
[bibtex] [pdf] [doi]
[75]Finding Longest Common Subsequences: New anytime A$^*$ Search Results
Marko Djukanovic, Günther R. Raidl, Christian Blum
Applied Soft Computing, volume 95, number 106400, 2020.
[bibtex] [pdf]
[74]An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
Information Processing Letters, volume 166, number 106041, 2020.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf
[bibtex] [pdf] [doi]
[73]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]
[72]Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. Raidl
Computers & Operations Research, volume 125, number 105089, 2020.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf
[bibtex] [pdf] [doi]
[71]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]
[70]Parameterized algorithms for Module Map problems
Frank Sommer, Christian Komusiewicz
Discr. Appl. Math., volume 283, pages 396–416, 2020.
[bibtex] [pdf] [doi]
[69]Using decomposition-parameters for QBF: Mind the prefix!
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
J. Comput. Syst. Sci., volume 110, pages 1–21, 2020.
[bibtex] [pdf]
[68]On Existential MSO and Its Relation to ETH
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
ACM Trans. Comput. Theory, volume 12, number 4, pages 22:1–22:32, 2020.
[bibtex] [pdf] [doi]
[67]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]
[66]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]
[65]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]
[64]The Turing Test for Graph Drawing Algorithms
Helen C. Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 466–481, 2020, Springer.
[bibtex] [pdf] [doi]
[63]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]
[62]Labeling Nonograms
Maarten Löffler, Martin Nöllenburg
European Workshop on Computational Geometry (EuroCG'20), pages 71:1–71:8, 2020.
[bibtex] [pdf]
[61]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]
[60]Distributing Battery Swapping Stations for Electric Scooters in an Urban Area
Thomas Jatschka, Fabio F. Oberweger, Tobias Rodemann, Günther R. Raidl
Optimization and Applications, Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 150–165, 2020, Springer.
[bibtex] [pdf] [doi]
[59]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]
[58]VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
Computer Aided Systems Theory – EUROCAST 2019, volume 12013 of LNCS, pages 255–262, 2020, Springer.
[bibtex] [pdf]
[57]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]
[56]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]
[55]A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility
Nikolaus Frohner, Günther R. Raidl
Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2020: Volume I (Patrick De Causmaecker, Ender Özcan, Greet Vanden Berghe, eds.), 2020.
[bibtex] [pdf]
[54]A Beam Search Approach to the Traveling Tournament Problem
Nikolaus Frohner, Bernhard Neumann, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimization – 20th European Conference, EvoCOP 2020 (Luís Paquete, Christine Zarges, eds.), volume 12102 of LNCS, pages 67–82, 2020, Springer.
[bibtex] [pdf]
[53]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]
[52]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]
[51]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]
[50]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]
[49]On Solving a Generalized Constrained Longest Common Subsequence Problem
Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum
Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova, eds.), volume 12422 of LNCS, pages 55–79, 2020, Springer.
[bibtex] [pdf] [doi]
[48]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]
[47]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]
[46]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]
[45]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization (GD'20) (David Auber, Pavel Valtr, eds.), volume 12590 of LNCS, pages 40–54, 2020, Springer.
[bibtex] [pdf] [doi]
[44]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]
[43]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]
[42]MaxSAT-Based Postprocessing for Treedepth
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis, ed.), volume 12333 of Lecture Notes in Computer Science, pages 478–495, 2020, Springer Verlag.
[bibtex] [pdf] [doi]
[41]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]
[40]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]
[39]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]
[38]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]
[37]Computing Optimal Hypertree Decompositions
André Schidler, Stefan Szeider
Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf]
[36]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]
[35]Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings (Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora, eds.), volume 12011 of Lecture Notes in Computer Science, pages 248–259, 2020, Springer Verlag.
[bibtex] [pdf] [doi]
[34]Colored Cut Games
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 30:1–30:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[33]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]
[32]FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
Christian Komusiewicz, Frank Sommer
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020 (Guy E. Blelloch, Irene Finocchi, eds.), pages 12–26, 2020, SIAM.
[bibtex] [pdf] [doi]
[31]Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (Yixin Cao, Siu-Wing Cheng, Minming Li, eds.), volume 181 of LIPIcs, pages 20:1–20:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[30]Exploiting c-Closure in Kernelization Algorithms for Graph Problems
Tomohiro Koana, Christian Komusiewicz, Frank Sommer
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference) (Fabrizio Grandoni, Grzegorz Herman, Peter Sanders, eds.), volume 173 of LIPIcs, pages 65:1–65:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[29]String Factorizations Under Various Collision Constraints
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark (Inge Li Gørtz, Oren Weimann, eds.), volume 161 of LIPIcs, pages 17:1–17:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[28]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]
[27]Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Robert Ganian, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 392–402, 2020.
[bibtex] [pdf]
[26]On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Proceeding of AAAI-20, the Thirty-Fourth AAAI Conference on Artificial Intelligence, February 7–12, 2020, New York, pages 3906–3913, 2020, AAAI Press.
[bibtex] [pdf]
[25]An Efficient Algorithm for Counting Markov Equivalent DAGs
Robert Ganian, Thekla Hamm, Topi Talvitie
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 10136–10143, 2020, AAAI Press.
[bibtex] [pdf]
[24]The Complexity Landscape of Resource-Constrained Scheduling
Robert Ganian, Thekla Hamm, Guillaume Mescoff
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 1741–1747, 2020, ijcai.org.
[bibtex] [pdf]
[23]Building Large k-Cores from Sparse Graphs
Fedor V. Fomin, Danil Sagunov, Kirill Simonov
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) (Javier Esparza, Daniel Kráľ, eds.), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35:1–35:14, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[22]Low-Rank Binary Matrix Approximation in Column-Sum Norm
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) (Jarosław Byrka, Raghu Meka, eds.), volume 176 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1–32:18, 2020, Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[21]Towards Faster Reasoners by Using Transparent Huge Pages
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, volume 12333 of Lecture Notes in Computer Science, pages 304–322, 2020, Springer Verlag.
[bibtex]
[20]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]
[19]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]
[18]Solving the Steiner Tree Problem with few Terminals
Johannes Klaus Fichte, Markus Hecher, André Schidler
32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293–300, 2020, IEEE.
[bibtex]
[17]Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 7135–7142, 2020, AAAI Press.
[bibtex] [pdf]
[16]Extending Nearly Complete 1-Planar Drawings in Polynomial Time
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic (Javier Esparza, Daniel Král', eds.), volume 170 of LIPIcs, pages 31:1–31:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[15]Extending Partial 1-Planar Drawings
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) (Artur Czumaj, Anuj Dawar, Emanuela Merelli, eds.), volume 168 of LIPIcs, pages 43:1–43:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[14]Manipulating Districts to Win Elections: Fine-Grained Complexity
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, February 7-12, 2020, pages 1902–1909, 2020, AAAI Press.
[bibtex] [pdf]
[13]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]
[12]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]
[11]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]
[10]Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen, Robert Ganian, Thekla Hamm
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere, ed.), pages 146–152, 2020, ijcai.org.
[bibtex] [pdf]
[9]Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers (David Auber, Pavel Valtr, eds.), volume 12590 of Lecture Notes in Computer Science, pages 40–54, 2020, Springer Verlag.
[bibtex] [pdf]
[8]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]
[7]Hard QBFs for Merge Resolution
Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, Gaurav Sood
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference) (Nitin Saxena, Sunil Simon, eds.), volume 182 of LIPIcs, pages 12:1–12:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[6]On Covering Segments with Unit Intervals
Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Christophe Paul, Markus Bläser, eds.), volume 154 of LIPIcs, pages 13:1–13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf]
[5]A Large Neighborhood Search for Distributing Service Points in Mobility Applications with Capacities and Limited Resources
Thomas Jatschka, Tobias Rodemann, Günther R. Raidl
09 2020, Presentation, CPAIOR2020.
[bibtex] [pdf]
[4]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]
[3]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]
[2]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]
[1]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

71 results
2019
[71]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]
[70]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]
[69]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]
[68]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]
[67]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]
[66]Snarks with Special Spanning Trees
Arthur Hoffmann-Ostenhof, Thomas Jatschka
Graphs and Combinatorics, volume 35, number 1, pages 207–219, 2019, Springer.
[bibtex] [pdf] [doi]
[65]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]
[64]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]
[63]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]
[62]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]
[61]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]
[60]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]
[59]Dependency Learning for QBF
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
Journal of Artificial Intelligence Research, volume 65, pages 180–208, 2019.
[bibtex] [pdf] [doi]
[58]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]
[57]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]
[56]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]
[55]Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Robert Ganian, Sebastian Ordyniak
Algorithms, volume 12, number 12, pages 248, 2019.
[bibtex] [pdf]
[54]On the Complexity Landscape of Connected f-Factor Problems
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
Algorithmica, volume 81, number 6, pages 2606–2632, 2019.
[bibtex] [pdf]
[53]Parameterized Complexity of Asynchronous Border Minimization
Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa
Algorithmica, volume 81, number 1, pages 201–223, 2019.
[bibtex] [pdf]
[52]Shrub-Depth: Capturing Height of Dense Graphs
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez
Logical Methods in Computer Science, 2019.
[bibtex] [pdf]
[51]Counting linear extensions: Parameterizations by treewidth
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Algorithmica, 2019.
[bibtex] [pdf]
[50]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]
[49]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]
[48]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]
[47]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]
[46]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]
[45]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]
[44]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]
[43]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]
[42]A Novel Approach for Solving Large-Scale Bike Sharing Station Planning Problems
Christian Kloimüllner, Günther R. Raidl
Learning and Intelligent Optimization – 13th International Conference, LION 13 (Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos, eds.), volume 11968 of LNCS, pages 184–200, 2019, Springer.
[bibtex] [pdf] [doi]
[41]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]
[40]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]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks
Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anaïs Villedieu
IFIP Networking Conference (Networking'19), pages 1–9, 2019, IEEE.
[bibtex] [doi]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]Refined Complexity of PCA with Outliers
Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA (Kamalika Chaudhuri, Ruslan Salakhutdinov, eds.), volume 97 of Proceedings of Machine Learning Research, pages 5818–5826, 2019, PMLR.
[bibtex] [pdf]
[26]Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany (Michael A. Bender, Ola Svensson, Grzegorz Herman, eds.), pages 48:1–48:16, 2019.
[bibtex] [pdf]
[25]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]
[24]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]
[23]Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison
Christian Komusiewicz, Frank Sommer
SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (Barbara Catania, Rastislav Královic, Jerzy R. Nawrocki, Giovanni Pighizzini, eds.), volume 11376 of Lecture Notes in Computer Science, pages 272–284, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[22]Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time
Thekla Hamm
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen, Jan Arne Telle, eds.), volume 148 of LIPIcs, pages 20:1–20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[21]Destroying Bicolored $P_3$s by Deleting Few Edges
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings (Florin Manea, Barnaby Martin, Daniël Paulusma, Giuseppe Primiero, eds.), volume 11558 of Lecture Notes in Computer Science, pages 193–204, 2019, Springer Verlag.
[bibtex] [pdf] [doi]
[20]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]
[19]The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers (Ignasi Sau, Dimitrios M. Thilikos, eds.), pages 190–204, 2019.
[bibtex] [pdf]
[18]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]
[17]On Strict (Outer-)Confluent Graphs
Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 147–161, 2019, Springer Verlag.
[bibtex] [pdf]
[16]Solving integer quadratic programming via explicit and structural restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 (Pascal Van Hentenryck, Zhi-Hua Zhou, eds.), pages 1477–1484, 2019.
[bibtex] [pdf]
[15]The Parameterized Complexity of Cascading Portfolio Scheduling
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
Proceedings of NeurIPS 2019, the Thirty-third Conference on Neural Information Processing Systems (Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d'Alché-Buc, Emily B. Fox, Roman Garnett, eds.), pages 7666–7676, 2019.
[bibtex] [pdf]
[14]Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany (Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, eds.), pages 42:1–42:15, 2019.
[bibtex] [pdf]
[13]Integer Programming and Incidence Treedepth
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings (Andrea Lodi, Viswanath Nagarajan, eds.), volume 11480 of Lecture Notes in Computer Science, pages 194–204, 2019, Springer Verlag.
[bibtex] [pdf]
[12]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]
[11]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]
[10]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]
[9]Approximation Algorithms for BalancedCC Multiwinner Rules
Markus Brill, Piotr Faliszewski, Frank Sommer, Nimrod Talmon
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019 (Edith Elkind, Manuela Veloso, Noa Agmon, Matthew E. Taylor, eds.), pages 494–502, 2019, International Foundation for Autonomous Agents and Multiagent Systems.
[bibtex] [pdf]
[8]Parameterized Algorithms for Book Embedding Problems
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings (Daniel Archambault, Csaba D. Tóth, eds.), volume 11904 of Lecture Notes in Computer Science, pages 365–378, 2019, Springer Verlag.
[bibtex] [pdf]
[7]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]
[6]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]
[5]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]
[4]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]
[3]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]
[2]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]
[1]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]

2018

48 results
2018
[48]Exact approaches for the directed network design problem with relays
Markus Leitner, Ivana Ljubić, Martin Riedler, Mario Ruthmair
Omega, 2018.
[bibtex] [pdf] [doi]
[47]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]
[46]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]
[45]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]
[44]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]
[43]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]
[42]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]
[41]The complexity landscape of decompositional parameters for ILP
Robert Ganian, Sebastian Ordyniak
Artificial Intelligence, volume 257, pages 61–71, 2018.
[bibtex] [pdf]
[40]Meta-kernelization using well-structured modulators
Eduard Eiben, Robert Ganian, Stefan Szeider
Discr. Appl. Math., volume 248, pages 153–167, 2018.
[bibtex] [pdf] [doi]
[39]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]
[38]On the complexity of rainbow coloring problems
Eduard Eiben, Robert Ganian, Juho Lauri
Discr. Appl. Math., volume 246, pages 38–48, 2018.
[bibtex] [pdf]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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]
[21]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]
[20]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]
[19]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]
[18]Parameterized Algorithms for Module Map Problems
Frank Sommer, Christian Komusiewicz
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers (Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub, eds.), volume 10856 of Lecture Notes in Computer Science, pages 376–388, 2018, Springer Verlag.
[bibtex] [pdf] [doi]
[17]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]
[16]Portfolio-Based Algorithm Selection for Circuit QBFs
Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
QBF Workshop, 2018.
[bibtex]
[15]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]
[14]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]
[13]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]
[12]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]
[11]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]
[10]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]
[9]A Structural Approach to Activity Selection
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 203–209, 2018, ijcai.org.
[bibtex] [pdf]
[8]Unary Integer Linear Programming with Structural Restrictions
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Proceedings of IJCAI 2018, the 27th International Joint Conference on Artificial Intelligence, pages 1284–1290, 2018, ijcai.org.
[bibtex] [pdf]
[7]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]
[6]Portfolio Solvers for QDIMACS and QCIR
Holger H. Hoos, Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
2018.
Note: QBF Evaluation at SAT
[bibtex]
[5]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]
[4]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]
[3]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]
[2]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]
[1]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

58 results
2017
[58]Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381)
(Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider, eds.), volume 7 of Dagstuhl Reports, 2017.
[bibtex] [pdf] [doi]
[57]Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
M. S. Ramanujan, Saket Saurabh
ACM Trans. Algorithms, volume 13, number 4, pages 46:1–46:25, 9 2017, Assoc. Comput. Mach., New York.
[bibtex] [pdf] [doi]
[56]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]
[55]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]
[54]Euclidean Greedy Drawings of Trees
Martin Nöllenburg, Roman Prutkin
Discrete and Computational Geometry, volume 58, number 3, pages 543–579, 2017.
[bibtex] [doi]
[53]Large Neighborhood Search for the Most Strings with Few Bad Columns Problem
Evelia Lizárraga, Maria J. Blesa, Christian Blum, Günther R. Raidl
Soft Computing, volume 21, number 17, pages 4901–4915, 2017.
[bibtex] [pdf]
[52]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]
[51]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]
[50]The Treewidth of Proofs
Moritz Müller, Stefan Szeider
Information and Computation, volume 255, pages 147–164, 2017.
[bibtex] [pdf] [doi]
[49]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]
[48]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]
[47]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]
[46]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]
[45]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]
[44]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]
[43]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]
[42]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]
[41]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]
[40]Free Weak Nilpotent Minimum Algebras
Stefano Aguzzoli, Simone Bova, Diego Valota
Soft Computing, volume 21(1), pages 79–95, 2017.
[bibtex]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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]
[21]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]
[20]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]
[19]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]
[18]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]
[17]Combining Treewidth and Backdoors for CSP
Robert Ganian, M. S. Ramanujan, Stefan Szeider
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) (Heribert Vollmer, Vallée, eds.), volume 66 of Leibniz International Proceedings in Informatics (LIPIcs), pages 36:1–36:17, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
[bibtex] [pdf] [doi]
[16]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]
[15]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]
[14]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]
[13]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]
[12]Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Pavel Dvořá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]
[11]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]
[10]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]
[9]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]
[8]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]
[7]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]
[6]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]
[5]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]
[4]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]
[3]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]
[2]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]
[1]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

70 results
2016
[70]Hybrid Metaheuristics – Powerful Tools for Optimization
Christian Blum, Günther R. Raidl
2016, Springer.
[bibtex] [pdf]
[69]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]
[68]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]
[67]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]
[66]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]
[65]Extending Convex Partial Drawings of Graphs
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
Algorithmica, volume 76, number 1, pages 47–67, 2016.
[bibtex] [doi]
[64]Mixed Map Labeling
Maarten Löffler, Martin Nöllenburg, Frank Staals
J. Spatial Information Science, volume 13, pages 3–32, 2016.
[bibtex] [doi]
[63]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]
[62]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]
[61]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]
[60]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]
[59]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]
[58]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]
[57]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]
[56]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]
[55]Quantifier reordering for QBF
Friedrich Slivovsky, Stefan Szeider
Journal of Automated Reasoning, volume 56, number 4, pages 459–477, 2016.
[bibtex] [pdf] [doi]
[54]Soundness of Q-resolution with dependency schemes
Friedrich Slivovsky, Stefan Szeider
Theoretical Computer Science, volume 612, pages 83–101, 2016.
[bibtex] [pdf] [doi]
[53]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]
[52]A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
Algorithmica, volume 75, number 1, pages 1–26, 2016.
[bibtex]
[51]Complexity and monotonicity results for domination games
Stephan Kreutzer, Sebastian Ordyniak
Theor. Comput. Sci., volume 628, pages 1–29, 2016.
[bibtex]
[50]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]
[49]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]
[48]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]
[47]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]
[46]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]
[45]Directed elimination games
Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer
Discrete Applied Mathematics, volume 199, pages 187–198, 2016.
[bibtex]
[44]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]
[43]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]
[42]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]
[41]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]
[40]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]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]Edge-Editing to a Dense and a Sparse Graph Class
Michal Kotrb\vcík, Rastislav Královi\vc, Sebastian Ordyniak
LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings (Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, eds.), volume 9644 of Lecture Notes in Computer Science, pages 562–575, 2016, Springer Verlag.
[bibtex]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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]
[21]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]
[20]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]
[19]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]
[18]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]
[17]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]
[16]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]
[15]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]
[14]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]
[13]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]
[12]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]
[11]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]
[10]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]
[9]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]
[8]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]
[7]Parameterized Complexity in the Polynomial Hierarchy
Ronald de Haan
2016, PhD thesis, Technische Universität Wien.
[bibtex] [pdf]
[6]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]
[5]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]
[4]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]
[3]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]
[2]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]
[1]Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
Ronald de Haan
8 2016, Technical report 1608.02406, arXiv.org.
[bibtex] [pdf]

2015

74 results
2015
[74]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]
[73]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]
[72]Backdoors to Tractable Answer Set Programming
Johannes Klaus Fichte, Stefan Szeider
Artificial Intelligence, volume 220, pages 64–103, 3 2015.
[bibtex] [doi]
[71]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]
[70]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]
[69]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]
[68]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]
[67]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]
[66]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]
[65]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]
[64]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]
[63]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]
[62]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]
[61]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]
[60]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]
[59]Improving Vertex Cover as a Graph Parameter
Robert Ganian
Discrete Mathematics & Theoretical Computer Science, volume 17, number 2, pages 77–100, 2015.
[bibtex]
[58]Backdoors to Normality for Disjunctive Logic Programs
Johannes Klaus Fichte, Stefan Szeider
ACM Transactions on Computational Logic, volume 17, number 1, 2015.
[bibtex] [doi]
[57]On the Subexponential-Time Complexity of CSP
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Journal of Artificial Intelligence Research, volume 52, pages 203–234, 2015.
[bibtex] [pdf] [doi]
[56]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]
[55]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]
[54]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]
[53]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]
[52]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, 1 2015, Springer Verlag.
[bibtex] [pdf] [doi]
[51]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]
[50]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]
[49]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]
[48]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]
[47]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]
[46]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]
[45]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]
[44]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]
[43]On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics
Evelia Lizárraga, 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]
[42]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]
[41]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]
[40]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]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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]
[21]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]
[20]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]
[19]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]
[18]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]
[17]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]
[16]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]
[15]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]
[14]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]
[13]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]
[12]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]
[11]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]
[10]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]
[9]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]
[8]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]
[7]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]
[6]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]
[5]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]
[4]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]
[3]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]
[2]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]
[1]An Overview of Non-Uniform Parameterized Complexity
Ronald de Haan
2015, Technical report TR15-130, Electronic Colloquium on Computational Complexity (ECCC).
[bibtex] [pdf]

2014

51 results
2014
[51]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]
[50]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]
[49]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]
[48]Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Serge Gaspers, Stefan Szeider
Artificial Intelligence, volume 216, pages 1-19, 2014.
[bibtex] [doi]
[47]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]
[46]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]
[45]Unification and Projectivity in De Morgan and Kleene Algebras
Simone Bova, Leonardo Manuel Cabrer
Order, volume 31, number 2, pages 159–187, 2014.
[bibtex]
[44]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]
[43]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]
[42]A survey on automated metro map layout methods
Martin Nöllenburg
Schematic Mapping Workshop, apr 2014.
[bibtex] [pdf]
[41]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]
[40]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]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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]
[21]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]
[20]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]
[19]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]
[18]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]
[17]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]
[16]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]
[15]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]
[14]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]
[13]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]
[12]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]
[11]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]
[10]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]
[9]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]
[8]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]
[7]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]
[6]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]
[5]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]
[4]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]
[3]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]
[2]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]
[1]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

79 results
2013
[79]Proceedings of the 10th Metaheuristics International Conference
(Hoong Chuin Lau, Günther R. Raidl, Patrick van Hentenryck, eds.), 2013.
[bibtex]
[78]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]
[77]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]
[76]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]
[75]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]
[74]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]
[73]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]
[72]Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Sebastian Ordyniak, Stefan Szeider
Journal of Artificial Intelligence Research, volume 46, pages 263-302, 2013.
[bibtex] [doi]
[71]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]
[70]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]
[69]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]
[68]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]
[67]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]
[66]Polynomial space hardness without disjunction property
Simone Bova, Franco Montagna
Theor. Comput. Sci., volume 467, pages 1–11, 2013.
[bibtex]
[65]Generic expression hardness results for primitive positive formula comparison
Simone Bova, Hubie Chen, Matthew Valeriote
Inf. Comput., volume 222, pages 108–120, 2013.
[bibtex]
[64]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]
[63]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]
[62]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]
[61]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]
[60]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]
[59]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]
[58]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]
[57]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]
[56]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]
[55]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]
[54]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]
[53]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]
[52]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]
[51]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]
[50]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]
[49]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]
[48]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]
[47]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]
[46]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]
[45]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]
[44]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]
[43]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]
[42]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]
[41]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]
[40]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]
[39]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]
[38]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]
[37]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]
[36]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]
[35]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]
[34]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]
[33]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]
[32]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]
[31]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]
[30]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]
[29]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]
[28]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]
[27]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]
[26]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]
[25]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]
[24]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]
[23]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]
[22]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.
[bibtex] [doi]
[21]Meta-kernelization with Structural Parameters
Robert Ganian, Friedrich Slivovsky, 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 457-468, 2013, Springer Verlag.
[bibtex] [doi]
[20]Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
Robert Ganian, Jan Obdrzálek
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, volume 8288 of Lecture Notes in Computer Science, pages 164–177, 2013, Springer Verlag.
[bibtex]
[19]FO Model Checking of Interval Graphs
Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II, volume 7966 of Lecture Notes in Computer Science, pages 250–262, 2013, Springer Verlag.
[bibtex]
[18]Kernelization Using Structural Parameters on Sparse Graph Classes
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (Hans L. Bodlaender, Giuseppe F. Italiano, eds.), volume 8125 of Lecture Notes in Computer Science, pages 529–540, 2013, Springer Verlag.
[bibtex]
[17]Backdoors to Normality for Disjunctive Logic Programs
Johannes Klaus Fichte, 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 320-337, 2013, The AAAI Press.
[bibtex]
[16]Parameterized Complexity Results for Plan Reuse
Ronald de Haan, Anna Roubickova, 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 224-231, 2013, The AAAI Press.
[bibtex] [pdf]
[15]Local Backbones
Ronald de Haan, Iyad A. Kanj, 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 377-393, 2013, Springer Verlag.
[bibtex] [pdf] [doi]
[14]Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
Jason Crampton, Robert Crowston, Gregory Gutin, Mark Jones, M. S. Ramanujan
Frontiers in Algorithmics \emphand Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings, pages 198–209, 2013.
[bibtex] [pdf] [doi]
[13]Faster Exact Algorithms for Some Terminal Set Problems
Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, 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 150–162, 2013.
[bibtex] [pdf] [doi]
[12]Partially Polynomial Kernels for Set Cover and Test Cover
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, pages 67–78, 2013.
[bibtex] [pdf] [doi]
[11]Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings (Paul G. Spirakis, Maria J. Serna, eds.), volume 7878 of Lecture Notes in Computer Science, pages 13-24, 2013, Springer Verlag.
[bibtex] [doi]
[10]Optimization Challenges of the Future Federated Internet
Johannes Inführ
Oct 2013, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. R. Raidl and K. Tutschku
[bibtex] [pdf]
[9]Balancing Bike Sharing Systems
Andreas Pinter
Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[8]Two-Phase Local Search for the Bi-objective Connected Facility Location Problem
Thomas Petelin
Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Leitner
[bibtex] [pdf]
[7]The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays
Roman Karl
Dec 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, M. Leitner, and M. Ruthmair
[bibtex] [pdf]
[6]Metaheuristic Optimization of Electro-Hybrid Powertrains Using Machine Learning Techniques
Christopher Bacher
Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and T. Krenek. \textbf3rd price Johann Puch Innovation Award 2013 (Magna Steyr)
[bibtex] [pdf]
[5]Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems
Markus Putzenlechner
Aug 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and D. Ljubic
[bibtex] [pdf]
[4]Critical Links Detection using CUDA
Thomas Schnabl
Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
[bibtex] [pdf]
[3]Selective Graph Coloring Problem
Claus-Dieter Volko
Apr 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
[bibtex] [pdf]
[2]Metaheuristics for the Regenerator Location Problem
Peter Jahrmann
Mar 2013, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[1]PILOT, GRASP, and VNS Approaches for the Static Balancing of Bicycle Sharing Systems
Marian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl
2013, Technical report TR 186–1–13–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
[bibtex] [pdf]

2012

50 results
2012
[50]Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012
(Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, 2012, IOS Press.
Note: ISBN 978-1-61499-110-6
[bibtex]
[49]On graph contractions and induced minors
Pim van 't Hof, Marcin Kamiński, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
Discr. Appl. Math., volume 160, number 6, pages 799-809, 2012.
[bibtex] [doi]
[48]Solving the Post Enrolment Course Timetabling Problem by Ant Colony Optimization
Clemens Nothegger, Alfred Mayer, Andreas Chwatal, Günther R. Raidl
Annals of Operations Research, volume 194, number 1, pages 325–339, 2012.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/nothegger-12.pdf
[bibtex]
[47]Lombardi Drawings of Graphs
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
J. Graph Algorithms Appl., volume 16, number 1, pages 85–108, 2012.
[bibtex] [doi]
[46]Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
Jinhee Chun, Natsuda Kaothanthong, Ryosei Kasai, Matias Korman, Takeshi Tokuyama, Martin Nöllenburg
Computer Vision and Image Understanding, volume 116, number 7, pages 803–814, 2012.
[bibtex] [doi]
[45]Drawing (Complete) Binary Tanglegrams
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo Silveira, Alexander Wolff
Algorithmica, volume 62, number 1–2, pages 309–332, 2012.
[bibtex] [doi]
[44]Cover Contact Graphs
Nieves Atienza, Natalia de Castro, Carmen Cortés, M. Ángeles Garrido, Clara I. Grima, Gregorio Hernández, Alberto Márquez, Auxiliadora Moreno, Martin Nöllenburg, José Ramón Portillo, Pedro Reyes, Jesús Valenzuela, Maria Trinidad Villar, Alexander Wolff
J. Computational Geometry, volume 3, number 1, pages 102–131, 2012.
[bibtex] [pdf]
[43]Editing graphs to satisfy degree constraints: a parameterized approach
Luke Mathieson, Stefan Szeider
Journal of Computer and System Sciences, volume 78, number 1, pages 179-191, 2012.
[bibtex] [doi]
[42]Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
Gregory Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
Algorithmica, volume 64, number 1, pages 112-125, 2012.
[bibtex] [doi]
[41]Augmenting tractable fragments of abstract argumentation
Dvorák, Sebastian Ordyniak, Stefan Szeider
Artificial Intelligence, volume 186, pages 157-173, 2012.
[bibtex] [doi]
[40]Finite RDP-algebras: duality, coproducts and logic
Simone Bova, Diego Valota
J. Log. Comput., volume 22, number 3, pages 417–450, 2012.
[bibtex]
[39]On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
Simone Bova, Hubie Chen, Matthew Valeriote
Theory Comput. Syst., volume 50, number 2, pages 329–353, 2012.
[bibtex]
[38]Lewis Dichotomies in Many-Valued Logics
Simone Bova
Studia Logica, volume 100, number 6, pages 1271–1290, 2012.
[bibtex]
[37]A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Martin Schwengerer, Sandro Pirkwieser, Günther R. Raidl
Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2012 (J.-K. Hao, M. Middendorf, eds.), volume 7245 of LNCS, pages 13–24, 2012, Springer, Heidelberg.
[bibtex] [pdf]
[36]Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design
Christian Schauer, Günther R. Raidl
Parallel Problem Solving from Nature–PPSN XII (C. A. Coello Coello, others, eds.), volume 7492 of LNCS, pages 458–467, 2012, Springer.
[bibtex] [pdf]
[35]On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem
Mario Ruthmair, Günther R. Raidl
Proceedings of the 2nd International Symposium on Combinatorial Optimization (A.R. Mahjoub, others, eds.), volume 7422 of LNCS, pages 225–236, 2012, Springer.
[bibtex] [pdf]
[34]A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair, Günther R. Raidl
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer.
[bibtex] [pdf]
[33]Hybrid Heuristics for Multimodal Homecare Scheduling
Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Günther R. Raidl
9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) (Nicolas Beldiceanu, Narendra Jussien, Éric Pinson, eds.), pages 339–355, 2012, Springer.
[bibtex] [pdf]
[32]Improved Packing and Routing of Vehicles with Compartments
Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb
Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 392–399, 2012, Springer.
[bibtex] [pdf]
[31]Variable Neighborhood and Greedy Randomized Adaptive Search for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 295–302, 2012, Springer.
[bibtex] [pdf]
[30]Applying (Hybrid) Metaheuristics to Fuel Consumption Optimization of Hybrid Electric Vehicles
Thorsten Krenek, Mario Ruthmair, Günther R. Raidl, Michael Planer
Applications of Evolutionary Computation – EvoApplications 2012 (C. Di Chio, others, eds.), volume 7248 of LNCS, pages 376–385, 2012, Springer, Heidelberg.
[bibtex] [pdf]
[29]Automatic Generation of 2-AntWars Players with Genetic Programming
Johannes Inführ, Günther R. Raidl
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 248–255, 2012, Springer.
[bibtex] [pdf]
[28]An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem
Bin Hu, Günther R. Raidl
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 287–294, 2012, Springer.
[bibtex] [pdf]
[27]An Evolutionary Algorithm with Solution Archives and Bounding Extension for the Generalized Minimum Spanning Tree Problem
Bin Hu, Günther R. Raidl
Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO), pages 393–400, 2012, ACM Press.
[bibtex] [pdf]
[26]A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Martin Berlakovich, Mario Ruthmair, Günther R. Raidl
Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, F. Pichler, A. Quesada-Arencibia, eds.), volume 6927 of LNCS, pages 256–263, 2012, Springer.
[bibtex] [pdf]
[25]Computing Resolution-Path Dependencies in Linear Time
Friedrich Slivovsky, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag.
[bibtex] [doi]
[24]LP can be a cure for Parameterized Problems
N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, pages 338–349, 2012.
[bibtex] [pdf] [doi]
[23]Parameterized Algorithms for Even Cycle Transversal
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers, pages 172–183, 2012.
[bibtex] [pdf] [doi]
[22]Parameterized Tractability of Multiway Cut with Parity Constraints
Daniel Lokshtanov, M. S. Ramanujan
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pages 750–761, 2012.
[bibtex] [pdf] [doi]
[21]Valued-Based Argumentation for Tree-like Value Graphs
Eun Jung Kim, Sebastian Ordyniak
Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 (Bart Verheij, Stefan Szeider, Stefan Woltran, eds.), volume 245 of Frontiers in Artificial Intelligence and Applications, pages 378–389, 2012, IOS Press.
[bibtex]
[20]Strong Backdoors to Nested Satisfiability
Serge Gaspers, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 72-85, 2012, Springer Verlag.
[bibtex] [doi]
[19]Backdoors to Acyclic SAT
Serge Gaspers, Stefan Szeider
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I (Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, eds.), volume 7391 of Lecture Notes in Computer Science, pages 363-374, 2012, Springer Verlag.
[bibtex] [doi]
[18]Backdoors to Satisfaction
Serge Gaspers, Stefan Szeider
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday (Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx, eds.), volume 7370 of Lecture Notes in Computer Science, pages 287-317, 2012, Springer Verlag.
[bibtex] [doi]
[17]On Finding Optimal Polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press.
[bibtex]
[16]Don't Be Strict in Local Search!
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press.
[bibtex]
[15]When Trees Grow Low: Shrubs and Fast MSO1
Robert Ganian, Petr Hlinený, Jaroslav Nesetril, Jan Obdrzálek, Patrice Ossona de Mendez, Reshma Ramadurai
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings, volume 7464 of Lecture Notes in Computer Science, pages 419–430, 2012, Springer Verlag.
[bibtex]
[14]Lower Bounds on the Complexity of MSO1 Model-Checking
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 326–337, 2012, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex]
[13]k-Gap Interval Graphs
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings (David Fernández-Baca, ed.), volume 7256 of Lecture Notes in Computer Science, pages 350-361, 2012, Springer Verlag.
[bibtex] [doi]
[12]Abstract Argumentation via Monadic Second Order Logic
Wolfgang Dvorák, Stefan Szeider, Stefan Woltran
Scalable Uncertainty Management - 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012. Proceedings (Eyke Hüllermeier, Sebastian Link, Thomas Fober, Bernhard Seeger, eds.), volume 7520 of Lecture Notes in Computer Science, pages 85-98, 2012, Springer Verlag.
[bibtex] [doi]
[11]The Complexity of Planning Revisited - A Parameterized Analysis
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann, Bart Selman, eds.), 2012, AAAI Press.
[bibtex]
[10]On Solving Constrained Tree Problems and an Adaptive Layers Framework
Mario Ruthmair
pages 187, May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. R. Raidl and U. Pferschy
[bibtex] [pdf]
[9]Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation
Sandro Pirkwieser
May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. R. Raidl and K. F. Dörner
[bibtex] [pdf]
[8]Extending the Gecode Framework with Interval Constraint Programming
Ivan Ivezi\'c
Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and L. Di Gaspero
[bibtex] [pdf]
[7]The Vehicle Routing Problem with Compartments
Philipp Gebhard
Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and S. Pirkwieser
[bibtex] [pdf]
[6]Improving the Protein Identification Performance in High-Resolution Mass Spectrometry Data
Frederico Dusberger
Oct 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, K. Mechtler, and P. Pichler
[bibtex] [pdf]
[5]Solving Multimodal Resource Constrained Project Scheduling Problems
Martin Sturm
Sep 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl
[bibtex] [pdf]
[4]Metaheuristics for a Multimodal Home-Health Care Scheduling Problem
Gerhard Hiermann
May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and J. Puchinger
[bibtex] [pdf]
[3]Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents
Benjamin Biesinger
May 2012, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and C. Schauer and B. Hu
[bibtex] [pdf]
[2]Description Logic Based Reasoning on Programming Languages
Ronald de Haan
2012, Master's thesis, Technische Universität Wien.
[bibtex] [pdf]
[1]Backdoors to Tractable Answer-Set Programming
Johannes Klaus Fichte, Stefan Szeider
2012, Technical report 1104.2788, Arxiv.org.
Note: Extended and updated version of a paper that appeared in the proceedings of IJCAI 2011, the 22nd International Joint Conference on Artificial Intelligence
[bibtex]

2011

57 results
2011
[57]Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
Martin Nöllenburg, Alexander Wolff
IEEE Trans. Visualization and Computer Graphics, volume 17, number 5, pages 626-641, 2011.
[bibtex] [doi]
[56]Branch-and-Cut-and-Price for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Journal of Mathematical Modelling and Algorithms, volume 10, number 3, pages 245–267, 2011, Springer.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/leitner-10b.pdf
[bibtex] [doi]
[55]Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
Andreas Chwatal, Günther R. Raidl
Advances in Operations Research, volume 2011, number 143732, pages 1–38, 2011.
[bibtex] [pdf] [doi]
[54]Hybrid Metaheuristics in Combinatorial Optimization: A Survey
Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
Applied Soft Computing, volume 11, pages 4135–4151, 2011.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/blum-11.pdf
[bibtex]
[53]The parameterized complexity of k-flip local search for SAT and MAX SAT
Stefan Szeider
Discrete Optim., volume 8, number 1, pages 139-145, 2011.
[bibtex]
[52]Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Stefan Szeider
ACM Transactions on Computational Logic, volume 12, number 2, pages article 12, 2011.
[bibtex] [doi]
[51]Tractable cases of the extended global cardinality constraint
Marko Samer, Stefan Szeider
Constraints, volume 16, number 1, pages 1-24, 2011.
[bibtex] [doi]
[50]Algorithms and Complexity Results for Persuasive Argumentation
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
Artificial Intelligence, volume 175, pages 1722-1736, 2011.
[bibtex]
[49]A probabilistic approach to problems parameterized above or below tight bounds
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
Journal of Computer and System Sciences, volume 77, number 2, pages 422-429, 2011.
[bibtex] [pdf] [doi]
[48]On the complexity of some colorful problems parameterized by treewidth
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
Information and Computation, volume 209, number 2, pages 143-153, 2011.
[bibtex]
[47]Parameterized Proof Complexity
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
Computational Complexity, volume 20, number 1, pages 51-85, 2011.
[bibtex] [doi]
[46]Solving MAX-r-SAT above a tight lower bound
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
Algorithmica, volume 61, number 3, pages 638-655, 2011.
[bibtex] [doi]
[45]Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem
Markus Leitner, Mario Ruthmair, Günther R. Raidl
Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 124–138, Jun 2011, Springer.
[bibtex] [pdf]
[44]Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem
Markus Leitner, Mario Ruthmair, Günther R. Raidl
Proceedings of the VII ALIO/EURO – Workshop on Applied Combinatorial Optimization, pages 250–253, May 2011.
[bibtex] [pdf]
[43]A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
Mario Ruthmair, Günther R. Raidl
Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (O. Günlük, G.J. Woeginger, eds.), volume 6655 of LNCS, pages 376–388, 2011, Springer, Heidelberg.
[bibtex] [pdf]
[42]Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair, Andreas Hubmer, Günther R. Raidl
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 285–287, 2011.
[bibtex] [pdf]
[41]Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments
Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb
Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 679–681, 2011.
[bibtex] [pdf]
[40]Improved Packing and Routing of Vehicles with Compartments
Sandro Pirkwieser, Günther R. Raidl, Jens Gottlieb
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 302–304, 2011.
[bibtex] [pdf]
[39]A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetables
Michael Pimmer, Günther R. Raidl
Proceedings of the 9th Metaheuristics International Conference (Luca Di Gaspero, Andrea Schaerf, Thomas Stützle, eds.), pages 349–358, 2011.
[bibtex] [pdf]
[38]Variable Neighborhood Search for Capacitated Connected Facility Location
Markus Leitner, Günther R. Raidl
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (A. Quesada-Arencibia, others, eds.), pages 261–263, 2011.
[bibtex] [pdf]
[37]Connecting Two Trees with Optimal Routing Cost
Mong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Martin Nöllenburg, Ignaz Rutter, Dorothea Wagner
Canadian Conference on Computational Geometry (CCCG '11), pages 43–47, 2011, University of Toronto.
[bibtex] [pdf]
[36]Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
Johannes Inführ, Günther R. Raidl
Network Optimization: 5th International Conference, INOC 2011 (J. Pahl, T. Reiners, S. Voß, eds.), volume 6701 of LNCS, pages 105–117, 2011, Springer.
[bibtex] [pdf]
[35]Automatic Generation of 2-AntWars Players with Genetic Programming
Johannes Inführ, Günther R. Raidl
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 244–246, 2011.
[bibtex] [pdf]
[34]An Evolutionary Algorithm with Solution Archive for the Generalized Minimum Spanning Tree Problem
Bin Hu, Günther R. Raidl
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 256–259, 2011.
[bibtex] [pdf]
[33]Sliding Labels for Dynamic Point Labeling
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
Canadian Conference on Computational Geometry (CCCG '11), pages 205–210, 2011, University of Toronto.
[bibtex] [pdf]
[32]Consistent Labeling of Rotating Maps
Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter
Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 451–462, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[31]On d-regular Schematization of Embedded Paths
Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
Theory and Practice of Computer Science (SOFSEM'11), volume 6543 of LNCS, pages 260–271, 2011, Springer Berlin Heidelberg.
[bibtex] [doi]
[30]Automatic Generation of Route Sketches
Andreas Gemsa, Martin Nöllenburg, Thomas Pajor, Ignaz Rutter
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 391–392, 2011, Springer Berlin Heidelberg.
Note: Poster abstract
[bibtex] [doi]
[29]Boundary-Labeling Algorithms for Panorama Images
Andreas Gemsa, Jan-Henrik Haunert, Martin Nöllenburg
Advances in Geographic Information Systems (SIGSPATIAL'11), pages 289–298, 2011, ACM.
[bibtex] [pdf] [doi]
[28]Optimal 3D Angular Resolution for Low-Degree Graphs
David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 208-219, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[27]Lombardi Drawings of Graphs
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 195–207, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[26]Drawing Trees with Perfect Angular Resolution and Polynomial Area
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg
Graph Drawing (GD'10) (Ulrik Brandes, Sabine Cornelsen, eds.), volume 6502 of LNCS, pages 183–194, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[25]A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application
Andreas M. Chwatal, Corina Thöni, Karin Oberlechner, Günther R. Raidl
Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha, others, eds.), pages 239–246, 2011, IEEE Digital Library.
[bibtex] [pdf]
[24]A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Martin Berlakovich, Mario Ruthmair, Günther R. Raidl
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 247–249, 2011.
[bibtex] [pdf]
[23]Adjacency-Preserving Spatial Treemaps
Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira
Algorithms and Data Structures (WADS'11) (Frank Dehne, John Iacono, Jörg-Rüdiger Sack, eds.), volume 6844 of LNCS, pages 159–170, 2011, Springer Berlin Heidelberg.
[bibtex] [pdf] [doi]
[22]Limits of Preprocessing
Stefan Szeider
Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011, pages 93-98, 2011, AAAI Press, Menlo Park, California.
[bibtex] [pdf]
[21]Paths, Flowers and Vertex Cover
Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings, pages 382–393, 2011.
[bibtex] [pdf] [doi]
[20]Augmenting Tractable Fragments of Abstract Argumentation
Sebastian Ordyniak, Stefan Szeider
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 1033-1038, 2011, AAAI Press/IJCAI.
[bibtex]
[19]Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag.
[bibtex] [doi]
[18]A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, pages 333–343, 2011.
[bibtex]
[17]Kernels for Global Constraints
Serge Gaspers, Stefan Szeider
IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (Toby Walsh, ed.), pages 540-545, 2011, IJCAI/AAAI.
[bibtex]
[16]The Parameterized Complexity of Local Consistency
Serge Gaspers, Stefan Szeider
Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011) (Jimmy Ho-Man Lee, ed.), volume 6876 of Lecture Notes in Computer Science, pages 302-316, 2011, Springer Verlag.
[bibtex] [pdf]
[15]Clique-width: When Hard Does Not Mean Impossible
Robert Ganian, Petr Hlinený, Jan Obdrzálek
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, volume 9 of LIPIcs, pages 404–415, 2011, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[bibtex]
[14]Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Robert Ganian
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers, volume 7112 of Lecture Notes in Computer Science, pages 259–271, 2011, Springer Verlag.
[bibtex]
[13]New Results on the Complexity of the Max- and Min-Rep Problems
Robert Ganian
SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238–247, 2011, Springer Verlag.
[bibtex]
[12]Backdoors to Tractable Answer-Set Programming
Johannes Klaus Fichte, Stefan Szeider
Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011 (Toby Walsh, ed.), pages 863-868, 2011, AAAI Press/IJCAI.
[bibtex]
[11]Generic Expression Hardness Results for Primitive Positive Formula Comparison
Simone Bova, Hubie Chen, Matthew Valeriote
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 344–355, 2011.
[bibtex]
[10]Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem
Christian Gruber
Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
[bibtex] [pdf]
[9]A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem
Thomas Seidl
Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Ruthmair
[bibtex] [pdf]
[8]Heuristic Methods for the Hop Constrained Survivable Network Design Problem
Gernot Fritz
Sep 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Leitner
[bibtex] [pdf]
[7]Branch-and-Price for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
Markus Sinnl
Aug 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Leitner
[bibtex] [pdf]
[6]Optimierung der periodischen Tourenplanung in der Müllentsorgung
Karl-Michael Edlinger
Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Ruthmair
[bibtex] [pdf]
[5]Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus
Thorsten Krenek
Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Ruthmair
[bibtex] [pdf]
[4]Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten
Thomas Winkler
Jul 2011, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and C. Schauer
[bibtex] [pdf]
[3]On Stabilized Branch-and-Price for Constrained Tree Problems
Markus Leitner, Mario Ruthmair, Günther R. Raidl
2011, Technical report TR 186–1–11–01, Vienna University of Technology.
[bibtex] [pdf]
[2]Backdoors to Satisfaction
Serge Gaspers, Stefan Szeider
10 2011, Technical report 1110.6387, Arxiv.org.
[bibtex]
[1]Backdoors to Acyclic SAT
Serge Gaspers, Stefan Szeider
10 2011, Technical report 1110.6384, Arxiv.org.
[bibtex]

 

News

  • Best Paper Award at SOFSEM 2025

    Best Paper Award at SOFSEM 2025

    2025-01-23
    Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, and Martin Nöllenburg received the Best Paper Award for their paper …Read More »
  • Markus Wallinger receives Award of Excellence for his PhD Thesis

    Markus Wallinger receives Award of Excellence for his PhD Thesis

    2024-12-05
    Our former group member Markus Wallinger won the Award of Excellence by the Federal Ministry for Education, Science and Research. …Read More »
  • Thomas Depian receives State Prize for his Master’s Thesis

    Thomas Depian receives State Prize for his Master’s Thesis

    2024-11-21
    Our group member Thomas Depian won the Appreciation Award given by the Federal Ministry for Education, Science and Research. This …Read More »
  • Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer

    Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer

    2024-07-24
    Maria Bresich, Günther Raidl, and Steffen Limmer received the best paper award at the 2024 Genetic and Evolutionary Computation Conference …Read More »
  • Welcome to our Feodor Lynen Fellow Dr. Frank Sommer

    Welcome to our Feodor Lynen Fellow Dr. Frank Sommer

    2024-06-14
    On June 1, 2024, Dr. Frank Sommer has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023 and 2024.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.