Publication list

This publication list has been generated automatically from the publication data of the Faculty of Informatics. Please invoke the page "Publications of the Faculty" directly for more complex searches and queries, or use the global search function of the Publication Database of the Vienna University of Technology!

Publication list for members of
E192 - Institute of Logic and Computation
E192-01 Algorithms and Complexity
as authors or essentially involved persons

787 records (2001 - 2022)

The complete list of publications of the Faculty of Informatics is available from the publication database beginning with the publication year 2002. The database may but need not necessarily contain publications dated earlier than 2002.

Books and Book Editorships

M. Bekos, B. Niedermann, M. Nöllenburg:
"External Labeling: Fundamental Concepts and Algorithmic Techniques";
Morgan & Claypool, 2021, ISBN: 9781636392042; 130 pages.

H. Beyer, G. Raidl et al. (ed.):
"GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings";
ACM Press, 2005, ISBN: 1-59593-038-8; 2229 pages.

M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels (ed.):
"Hybrid Metaheuristics, 7th Int. Workshop, HM 2010";
Springer, 2010, ISBN: 978-3642160530.

C. Blum, G. Raidl (ed.):
"Hybrid Metaheuristics -- Powerful Tools for Optimization";
Springer, 2016, ISBN: 978-3-319-30883-8; 172 pages.

J. Gottlieb, G. Raidl (ed.):
"Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings.";
Springer, Heidelberg, 2006, ISBN: 978-3-540-33178-0; 293 pages.

J. Gottlieb, G. Raidl (ed.):
"Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings";
Springer, Heidelberg, 2004, ISBN: 3-540-21367-8; 241 pages.

Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers:
"Scalable Set Visualizations (Dagstuhl Seminar 17332)";
in series "Dagstuhl Reports", series editor: Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2018, ISSN: 2192-5283, 22 pages.

Y. Hu, M. Nöllenburg (ed.):
"Graph Drawing and Network Visualization 24th International Symposium";
Springer LNCS, 2016, ISBN: 978-3-319-50105-5.

M. Jünger, P. Mutzel (ed.):
"Graph Drawing Software";
Springer, 2003, ISBN: 3-540-00881-0; 378 pages.

A. Kerren, D. Cernea, M. Pohl (ed.):
"Proceedings of EmoVis 2016, ACM IUI 2016 Workshop on Emotion and Visualization";
Linköping Electronic Conference Proceedings, Linköping, Schweden, 2016, ISBN: 978-91-7685-817-2; 38 pages.

H. C. Lau, G. Raidl, P. Van Hentenryck (ed.):
"Proceedings of the 10th Metaheuristics International Conference";
Singapore Management University, Singapore, 2013.

P. Mutzel, M. Jünger, S. Leipert (ed.):
"Graph Drawing";
Springer, 2002.

G. Raidl et al. (ed.):
"Applications of Evolutionary Computing";
Springer, LNCS 2611, 2003, ISBN: 3-540-00976-0; 708 pages.

G. Raidl et al. (ed.):
"Applications of Evolutionary Computing: EvoWorkshops 2004 - Lecture Notes in Computer Science 3004";
Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-21378-3; 562 pages.

G. Raidl et al. (ed.):
"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference";
ACM Press, 2009, ISBN: 978-1-60558-505-5; 1728 pages.

G. Raidl, J. Gottlieb (ed.):
"Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448)";
Springer, Heidelberg, 2005, ISBN: 3-540-25337-8; 271 pages.

Publications in Scientific Journals

E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, C. Tzovas:
"Guidelines for Experimental Algorithmics: A Case Study in Network Analysis";
Algorithms, Volume 12 (2019), Issue 7; 1 - 37.

B. Bagheri Gh, T. Feder, H. Fleischner, C. Subi:
"Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture";
Journal of Graph Theory, 96 (2021), 2; 269 - 288.

S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg:
"Geometric planar networks on bichromatic collinear points";
Theoretical Computer Science, 895 (2021), 124 - 136.

L. Barth, A. Gemsa, B. Niedermann, M. Nöllenburg:
"On the readability of leaders in boundary labeling";
Information Visualization, 18 (2019), 1; 110 - 132.

M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis:
"Planar drawings of fixed-mobile bigraphs";
Theoretical Computer Science, 795 (2019), 408 - 419.

M. Bekos, B. Niedermann, M. Nöllenburg:
"External Labeling Techniques: A Taxonomy and Survey";
Computer Graphics Forum, 38 (2019), 3; 833 - 860.

B. Bergougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan:
"Towards a Polynomial Kernel for Directed Feedback VertexSet";
Algorithmica, 82 (2020), 1 - 21.

O. Beyersdorff, J. Blinkhorn, L. Chew, R. Schmidt, M. Suda:
"Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF";
Journal of Automated Reasoning, J Autom Reasoning (2018), 1 - 27.

S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg:
"Parameterized Algorithms for Book Embedding Problems";
Journal of Graph Algorithms and Applications, 24 (2020), 4; 603 - 620.

B. Biesinger, B. Hu, G. Raidl:
"A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem";
Journal of Heuristics, 21 (2015), 3; 391 - 431.

B. Biesinger, B. Hu, G. Raidl:
"Models and algorithms for competitive facility location problems with different customer behavior.";
Annals of Mathematics and Artificial Intelligence, 76 (2016), 1; 93 - 119.

C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl:
"Solving longest common subsequence problems via a transformation to the maximum clique problem";
Computers & Operations Research, 125 (2020), 17 pages.

C. Blum, J. Puchinger, G. Raidl, A. Roli:
"Hybrid metaheuristics in combinatorial optimization: A survey";
Applied Soft Computing, Volume 11 (2011), Issue 6; 4135 - 4151.

C. Blum, G. Raidl:
"Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem";
Optimization Letters, online 07/2015 (2015), 1 - 17.

S. Bova, R. Ganian, S. Szeider:
"Model Checking Existential Logic on Partially Ordered Sets";
ACM Transactions on Computational Logic, 17 (2015), 2; 1 - 35.

S. Bova, R. Ganian, S. Szeider:
"Quantified conjunctive queries on partially ordered sets";
Theoretical Computer Science, 618 (2016), 72 - 84.

S. Bova, F. Slivovsky:
"On Compiling Structured CNFs to OBDDs";
Theory of Computing Systems, 61 (2017), 637 - 655.

R. Bredereck, J. Chen, U. Finnendahl, R. Niedermeier:
"Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences";
Autonomous Agents and Multi-Agent Systems, 34 (2020), 1 - 29.

T. Bruckdorfer, S. Cornelsen, C. Gutwenger, M Kaufmann, F. Montecchiani, M. Nöllenburg, A. Wolff:
"Progress on Partial Edge Drawings";
Journal of Graph Algorithms and Applications, 21 (2017), 4; 757 - 786.

K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, R. Silveira:
"Adjacency-Preserving Spatial Treemaps";
Journal of Computational Geometry, 7 (2016), 1; 100 - 122.

L. Bulteau, N. Grüttemeier, C. Komusiewicz, M. Sorge:
"Your rugby mates don´t need to know your colleagues: Triadic closure with edgecolors";
Journal of Computer and System Sciences, 120 (2021), 75 - 96.

T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan:
"Short Plane Supports for Spatial Hypergraphs";
Journal of Graph Algorithms and Applications, 23 (2019), 3; 463 - 498.

J. Chen, S. Grottke:
"Small one‑dimensional Euclidean preference profiles";
Social Choice and Welfare, 57 (2021), 117 - 144.

J. Chen, P. Skowron, M. Sorge:
"Matchings under Preferences: Strength of Stability and Tradeoffs";
ACM Transactions on Economics and Computation, 9 (2021), 4; 1 - 55.

A Chwatal, G. Raidl:
"Solving the minimum label spanning tree problem by mathematical programming techniques";
Advances in Operations Research, Volume 2011 (2011).

A Chwatal, G. Raidl, K. Oberlechner:
"Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates.";
Journal of Mathematical Modelling and Algorithms, Volume 8 (2009), 3; 293 - 334.

R. de Haan, I. Kanj, S. Szeider:
"On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances";
ACM Transactions on Computational Logic, 18 (2017), 1 - 46.

R. de Haan, I. Kanj, S. Szeider:
"On the Subexponential-Time Complexity of CSP";
Journal of Artificial Intelligence Research, 52 (2015), 52; 203 - 234.

R. de Haan, S. Szeider:
"A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy";
Algorithms, 12 (2019), 9; 1 - 28.

R. de Haan, S. Szeider:
"Parameterized complexity classes beyond para-NP";
Journal of Computer and System Sciences, 87 (2017), 16 - 57.

S. Diehl, A. Kerren:
"Generierung interaktiver Animationen von Berechnungsmodellen";
Informatik - Forschung und Entwicklung, 17 (2002), 1; 12 - 20.

M. Djukanovic, C. Berger, G. Raidl, C. Blum:
"An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem";
Information Processing Letters, 166 (2020), 1 - 10.

M. Djukanovic, G. Raidl, C. Blum:
"Anytime algorithms for the longest common palindromic subsequence problem";
Computers & Operations Research, 114 (2020), 20 pages.

M. Djukanovic, G. Raidl, C. Blum:
"Finding Longest Common Subsequences: New anytime A search results";
Applied Soft Computing, 95 (2020), 1 - 21.

C. Duncan, D. Eppstein, M.T. Goodrich, S.G. Kobourov, M. Löffler, M. Nöllenburg:
"Planar and poly-arc Lombardi drawings";
Journal of Computational Geometry, 9 (2018), 1; 328 - 355.

P. Dvorak, E. Eiben, R. Ganian, D. Knop, S. Ordyniak:
"The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints";
Artificial Intelligence, 300 (2021), 1 - 21.

E. Eiben, R. Ganian, T. Hamm, O. Kwon:
"Measuring what matters: Ahybrid approach to dynamic programming with treewidth";
Journal of Computer and System Sciences, 121 (2021), 57 - 75.

E. Eiben, R. Ganian, O. Kwon:
"A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion";
Journal of Computer and System Sciences, 96 (2018), 121 - 146.

E. Eiben, R. Ganian, J. Laurila:
"On the Complexity of Rainbow Coloring Problems";
Discrete Applied Mathematics, 246 (2018), 38 - 48.

E. Eiben, R. Ganian, S. Ordyniak:
"Usingdecomposition-parametersforQBF:Mindtheprefix!";
Journal of Computer and System Sciences, 110 (2020), 1 - 21.

E. Eiben, R. Ganian, S. Szeider:
"Meta-kernelization using well-structured modulators";
Discrete Applied Mathematics, Volume 280 (2018), 153 - 167.

E. Eiben, R. Ganian, S. Szeider:
"Solving Problems on Graphs of High Rank-Width";
Algorithmica (online), 80 (2017), 80; 30 pages.

M. Eiglsperger, C. Gutwenger, M. Kaufman, J. Kupke, M. Jünger, S. Leipert, K. Klein, P. Mutzel, M. Siebenhaller:
"Automatic layout of UML class diagrams in orthogonal style";
Information Visualization, 3 (2004), 3; 189 - 208.

J. Ekstein, H. Fleischner:
"A best possible result for the square of a 2-block to be hamiltonian";
Discrete Mathematics, 344 (2021), 1; 1 - 6.

V. Engelmann, S. Ordyniak, S. Kreutzer:
"Directed elimination games";
Discrete Applied Mathematics, 199 (2016), 187 - 198.

D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, K. Verbeek:
"Strict Confluent Drawing";
Journal of Computational Geometry, 7 (2016), 1; 22 - 46.

T. Fenz, K. Foerster, S. Schmid, A. Villedieu:
"Efficient non-segregated routing for reconfigurable demand-aware networks";
Computer Communications, 164 (2020), 138 - 147.

J. Fichte, S. Szeider:
"Backdoors to Normality for Disjunctive Logic Programs";
ACM Transactions on Computational Logic, 17 (2015), 1; 7:1 - 7:23.

J. Fichte, S. Szeider:
"Backdoors to tractable answer-set programming";
Artificial Intelligence, 220 (2015), 64 - 103.

H. Förster, R. Ganian, F. Klute, M. Nöllenburg:
"On Strict (Outer-)Confluent Graphs";
Journal of Graph Algorithms and Applications, 25 (2021), 1; 481 - 512.

J. Gajarsky, P. Hlinený, T. Kaiser, D. Král, M. Kupec, J. Obdrzalek, S. Ordyniak, T. Vojtech:
"First order limits of sparse graphs: Plane trees and path-width";
Random Structures and Algorithms, 50 (2017), 612 - 635.

J. Gajarsky, P. Hlinený, J. Obdrzalek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Villaamil Sanchez, S. Sikdar:
"Kernelization using structural parameters on sparse graph classes";
Journal of Computer and System Sciences, 84 (2017), 219 - 242.

M. Galvão, J. Krukar, M. Nöllenburg, A. Schwering:
"Route schematization with landmarks";
Journal of Spatial Information Science, 21 (2020).

R. Ganian:
"Improving Vertex Cover as a Graph Parameter";
Discrete Mathematics & Theoretical Computer Science, 17/2 (2015), 77 - 100.

R. Ganian, R. de Haan, I. Kanj, S. Szeider:
"On Existential MSO and Its Relation to ETH";
ACM Transactions on Computation Theory, 12 (2020), 4; 1 - 32.

R. Ganian, P. Hlinený, D. Král, J. Obdrzalek, J. Schwartz, J. Teska:
"FO Model Checking of Interval Graphs";
Logical Methods in Computer Science, 11 (2015), 4; 20 pages.

R. Ganian, F. Klute, S. Ordyniak:
"On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem";
Algorithmica, 82 (2020), 1 - 40.

R. Ganian, M. Kronegger, A. Pfandler, A. Popa:
"Parameterized Complexity of Asynchronous Border Minimization";
Algorithmica, 81 (2019), 1; 201 - 223.

R. Ganian, S. Ordyniak:
"The Complexity Landscape of Decompositional Parameters for ILP";
Artificial Intelligence, 257 (2018), 61 - 71.

R. Ganian, S. Ordyniak:
"The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths";
Algorithmica, 82 (2020), 1 - 27.

R. Ganian, S. Ordyniak, M. Ramanujan:
"On Structural Parameterizations of the Edge Disjoint Paths Problem";
Algorithmica, 83 (2021), 1605 - 1637.

R. Ganian, M. S. Ramanujan, S. Szeider:
"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting";
ACM Transactions on Algorithms, 13 (2017), 1 - 31.

R. Ganian, F. Slivovsky, S. Szeider:
"Meta-kernelization with structural parameters";
Journal of Computer and System Sciences, 82 (2016), 333 - 346.

R. Ganian, S. Szeider:
"New width parameters for SAT and #SAT";
Artificial Intelligence, 295 (2021), 1 - 18.

S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider:
"On finding optimal polytrees";
Theoretical Computer Science, 592 (2015), 49 - 58.

S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, S. Zivný:
"Backdoors into heterogeneous classes of SAT and CSP";
Journal of Computer and System Sciences, 85 (2017), 38 - 56.

S. Gaspers, S. Ordyniak, M. S. Ramanujan, S. Saurabh, S. Szeider:
"Backdoors to q-Horn";
Algorithmica (online), 74 (2016), 540 - 557.

A. Gemsa, B. Niedermann, M. Nöllenburg:
"A Unified Model and Algorithms for Temporal Map Labeling";
Algorithmica (online), 82 (2020), 2709 - 2736.

A. Gemsa, B. Niedermann, M. Nöllenburg:
"Placing Labels in Road Maps: Algorithms and Complexity";
Algorithmica (online), 82 (2020), 1881 - 1908.

A. Gemsa, M. Nöllenburg, I. Rutter:
"Consistent Labeling Of Rotating Maps";
Journal of Computational Geometry, 7 (2016), 1; 308 - 331.

A. Gemsa, M. Nöllenburg, I. Rutter:
"Evaluation of Labeling Strategies for Rotating Maps";
ACM Journal of Experimental Algorithmics, 21 (2016), 1; 1 - 21.

S. Gupta, S. Roy, S. Saurabh, M. Zehavi:
"Balanced stable marriage: How close is close enough?";
Theoretical Computer Science, 883 (2021), 19 - 43.

J. Hetzl, A.M. Foerster, G. Raidl, O. Mittelsten Scheid:
"CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing";
Plant Journal, 51 (2007), 3; 526 - 536.

M. Heule, S. Szeider:
"A SAT Approach to Clique-Width";
ACM Transactions on Computational Logic, 16/3 (2015), 1 - 27.

G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, G. Raidl:
"Metaheuristics for solving a multimodal home-healthcare scheduling problem";
Central European Journal of Operations Research, May 2013 (2013).

P. Hlinený, O. Kwon, J. Obdrzalek, S. Ordyniak:
"Tree-depth and vertex-minors";
European Journal of Combinatorics, 56 (2016), 46 - 56.

A. Hoffmann-Ostenhof, H. Fleischner, R. Häggkvist:
"Cycle Double Covers via Kotzig Graphs";
Journal of Combinatorial Theory Series B, 1 (2018), 1 - 12.

A. Hoffmann-Ostenhof, T. Jatschka:
"Snarks with Special Spanning Trees";
Graphs and Combinatorics, 1 (2018), 1 - 13.

M. Horn, J. Maschler, G. Raidl, E. Rönnberg:
"A*-based construction of decision diagrams for a prize-collecting scheduling problem";
Computers & Operations Research, 126 (2020), 1 - 21.

M. Horn, G. Raidl, C. Blum:
"Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm";
Artificial Intelligence, 277 (2019), 1 - 26.

M. Horn, G. Raidl, E. Rönnberg:
"A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources";
Annals of Operations Research, 82 (2020), 1 - 29.

B. Hu, M. Leitner, G. Raidl:
"Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem";
Journal of Heuristics, 14 (2008), 5; 473 - 499.

B. Hu, M. Leitner, G. Raidl:
"The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search";
Networks, 55 (2010), 3; 257 - 275.

J. Inführ, G. Raidl:
"A Memetic Algorithm for the Virtual Network Mapping Problem.";
Journal of Heuristics (invited), Dezember 2014 (2014), 1 - 31.

B. Jacobsen, M. Wallinger, S.G. Kobourov, M. Nöllenburg:
"MetroSets: Visualizing Sets as Metro Maps";
IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 2; 1257 - 1267.

T. Jatschka, G. Raidl, T. Rodemann:
"A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Algorithms, 14 (2021), 8; 1 - 24.

P. Jonsson, S. Ordyniak, S. Szeider:
"A Complete Parameterized Complexity Analysis of Bounded Planning";
Journal of Computer and System Sciences, 81/7 (2015), 1311 - 1332.

I. Kanj, S. Szeider:
"Parameterized and subexponential-time complexity ofsatisfiability problems and applications";
Theoretical Computer Science, 607 (2015), 282 - 295.

A. Kerren:
"Learning by Generation in Computer Science Education. ";
Journal of Computer Science & Technology, 4 (2004), 2; 84 - 90.

P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber:
"Lombardi Drawings Of Knots And Links";
Journal of Computational Geometry, 10 (2019), 1; 444 - 476.

G.W. Klau, P. Mutzel:
"Optimal labelling of point features in rectangular labelling models";
Mathematical Programming, 94 (2003), 2-3; 435 - 458.

B. Klocker, H. Fleischner, G. Raidl:
"A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three";
Applied Mathematics and Computation, 380 (2020), 1 - 19.

B. Klocker, H. Fleischner, G. Raidl:
"A model for finding transition-minors";
Discrete Applied Mathematics, 283 (2020), 242 - 264.

C. Kloimüllner, G. Raidl:
"Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition";
Networks, 69 (2017), 3; 270 - 289.

F. Klute, M. Löffler, M. Nöllenburg:
"Labeling nonograms: Boundary labeling for curve arrangements";
Computational Geometry - Theory and Applications, 98 (2021), 1 - 17.

F. Klute, M. Nöllenburg:
"Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts";
Journal of Computational Geometry, 10 (2019), 2; 45 - 69.

T. Krenek, C. Bacher, G. Raidl, T. Lauer:
"Numerical Optimization of Electro Hybrid Powertrains";
MTZ worldwide, 76 (2015), 3; 46 - 52.

T. Krenek, C. Bacher, G. Raidl, T. Lauer:
"Numerische Optimierung elektrifizierter Antriebsstränge";
MTZ - Motortechnische Zeitschrift, 76 (2015), 3; 66 - 74.

S. Kreutzer, S. Ordyniak:
"Complexity and monotonicity results for domination games";
Theoretical Computer Science, 628 (2016), 1 - 29.

H. C. Lau, G. Raidl, P. Van Hentenryck:
"New developments in metaheuristics and their applications";
Journal of Heuristics, 22 (2016), 4; 359 - 363.

M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair:
"Exact Approaches for Network Design Problems with Relays";
Informs Journal on Computing, 31 (2019), 1; 23 pages.

M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair:
"Solving a selective dial-a-ride problem with logic-based Benders decomposition";
Computers & Operations Research, volume 96 (2018), 30 - 54.

M. Leitner, G. Raidl:
"Branch-and-cut-and-price for capacitated connected facility location";
Journal of Mathematical Modelling and Algorithms, Volume 10 (2011), Number 3; 245 - 267.

M. Leitner, M. Ruthmair, G. Raidl:
"Stabilizing branch-and-price for constrained tree problems";
Networks, Volume 61 (2013), 2; 150 - 170.

P. Li, H. Li, Y. Chen, H. Fleischner, H. Lai:
"Supereulerian graphs with width s and s-collapsible graphs";
Discrete Applied Mathematics, 200 (2016), 79 - 94.

E. Lizarraga, M. Blesa, C. Blum, G. Raidl:
"Large Neighborhood Search for the Most Strings with Few Bad Columns Problem";
Journal of Heuristics, 21 (2016), 1 - 15.

I. Ljubic, G. Raidl:
"A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs";
Journal of Heuristics, 9 (2003), 401 - 427.

I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti:
"An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem.";
Mathematical Programming, Volume 105 (2005), 2-3; 427 - 449.

N. Lodha, S. Ordyniak, S. Szeider:
"A SAT Approach to Branchwidth";
ACM Transactions on Computational Logic, 20 (2019), 3; 1 - 24.

M. Löffler, M. Nöllenburg, F. Staals:
"Mixed map labeling";
Journal of Spatial Information Science, 13 (2016), 1 - 30.

J. Maschler, G. Raidl:
"Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources";
Annals of Operations Research, 302 (2021), 507 - 531.

J. Maschler, G. Raidl:
"Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments";
Journal of Graph Theory, 96 (2018).

T. Mchedlidze, M. Nöllenburg, I. Rutter:
"Extending Convex Partial Drawings of Graphs";
Algorithmica, 76 (2016), 47 - 67.

M. Müller, S. Szeider:
"The Treewidth of Proofs";
Information and Computation, 255 (2017), 147 - 164.

N. Mujezinovic, G. Raidl, J. Hutchins, J. Peters, K. Mechtler, F. Eisenhaber:
"Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise.";
Proteomics, Vol 6 (2006), 19; 5117 - 5131.

A. Nesic, M. Blaicher, T. Hoose, A. Hofmann, M. Lauermann, Y. Kutuvantavida, M. Nöllenburg, S. Randel, W. Freude, C. Koos:
"Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses";
Optics Express, 27 (2019), 12; 17402 - 17425.

B. Nikolic, A. Kartelj, M. Djukanovic, M. Grbic, C. Blum, G. Raidl:
"Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings";
Mathematics, 9 (2021), 1 - 25.

M. Nöllenburg, R. Prutkin, I. Rutter:
"On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs";
Journal of Computational Geometry, 7 (2016), 1; 47 - 69.

M. Nöllenburg, R. Prutkin, I. Rutter:
"Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions";
International Journal of Computational Geometry & Applications, 27 (2017), 1+2; 121 - 158.

C. Nothegger, A. Mayer, A Chwatal, G. Raidl:
"Solving the post enrolment course timetabling problem by ant colony optimization";
Annals of Operations Research, Volume 194 (2012), 1; 325 - 339.

S. Ordyniak, A. Popa:
"A Parameterized Study of Maximum Generalized Pattern Matching Problems";
Algorithmica, 75 (2016), 1 - 26.

D. Paulusma, F. Slivovsky, S. Szeider:
"Model Counting for CNF Formulas of Bounded Modular Treewidth";
Algorithmica, First online: 17 July 2015 (2015), 1 - 27.

D. Paulusma, S. Szeider:
"On the parameterized complexity of (k, s)-SAT";
Information Processing Letters, 134 (2019), 134; 34 - 36.

T. Peitl, F. Slivovsky, S. Szeider:
"Dependency Learning for QBF";
Journal of Artificial Intelligence Research, 65 (2019), 65; 181 - 208.

T. Peitl, F. Slivovsky, S. Szeider:
"Long-Distance Q-Resolution with Dependency Schemes";
Journal of Automated Reasoning, 80 (2018), 2; 1 - 29.

P. Pop, S. Cosmin, B. Biesinger, B. Hu, G. Raidl:
"Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm";
Carpathian Journal of Mathematics, 33 (2017), 3; 365 - 371.

M. Prandtstetter, G. Raidl:
"An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem";
European Journal of Operational Research (invited), 191 (2008), 3; 1004 - 1022.

C. Pronk, M. Schönhacker:
"Formal Definition of Programming Language Standards ";
ACM SIGPLAN Notices, 38 (2003), 8; 20 - 21.

R. Prutkin, M. Nöllenburg:
"Euclidean Greedy Drawings of Trees";
Discrete & Computational Geometry, 58 (2017), 3; 543 - 579.

J. Puchinger, G. Raidl:
"Bringing order into the neighborhoods: Relaxation guided variable neighborhood search";
Journal of Heuristics (invited), 14 (2008), 5; 457 - 472.

J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing";
European Journal of Operational Research, 183 (2007), 3; 1304 - 1327.

J. Puchinger, G. Raidl, U. Pferschy:
"The multidimensional knapsack problem: Structure and algorithms";
Informs Journal on Computing, 22 (2010), 2; 250 - 265.

G. Raidl:
"Decomposition based hybrid metaheuristics";
European Journal of Operational Research (invited), 244 (2015), 1; 66 - 76.

G. Raidl, J. Gottlieb:
"Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem.";
Evolutionary Computation, volume 13 (2005), number 4; 441 - 475.

G. Raidl, B. Julstrom:
"Edge-Sets: An Effective Evolutionary Coding of Spanning Trees";
IEEE Transactions on Evolutionary Computation, 7 (2003), 3; 225 - 239.

G. Raidl, G. Koller, B. Julstrom:
"Biased Mutation Operators for Subgraph-Selection Problems";
IEEE Transactions on Evolutionary Computation, Volume 10 (2006), 2; 145 - 156.

G. Raidl, I. Ljubic:
"Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem";
Information Processing Letters, 82 (2002), 39 - 45.

M. Rainer-Harbach, P. Papazek, G. Raidl, B. Hu, C. Kloimüllner:
"PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems.";
Journal of Global Optimization (invited), April (2014), 1 - 33.

M. Riedler, T. Jatschka, J. Maschler, G. Raidl:
"An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem";
International Transactions in Operational Research, 8 (2017).

B. Schaden, T. Jatschka, S. Limmer, G. Raidl:
"Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers";
ENERGIES, 14 (2021), 22; 1 - 32.

C. Schulz, M. Nöllenburg, H. Meyerhenke:
"Drawing Large Graphs by Multilevel Maxent-Stress Optimization";
IEEE Transactions on Visualization and Computer Graphics, 24 (2018), 5; 1814 - 1827.

F. Slivovsky, S. Szeider:
"Quantifier Reordering for QBF";
Journal of Automated Reasoning, Volume 55 (2015), 1 - 19.

F. Slivovsky, S. Szeider:
"Soundness of Q-resolution with dependency schemes";
Theoretical Computer Science, 612 (2016), 83 - 101.

I. van der Hoog, M. van Kreveld, W. Meulemans, K. Verbeek, J. Wulms:
"Topological stability of kinetic k-centers";
Theoretical Computer Science, 866 (2021), 145 - 159.

M. Wallinger, D. Archambault, D. Auber, M. Nöllenburg, J. Peltonen:
"Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach";
IEEE Transactions on Visualization and Computer Graphics, 28 (2022), 1; 313 - 323.

M. Wallinger, B. Jacobsen, S.G. Kobourov, M. Nöllenburg:
"On the Readability of Abstract Set Visualizations";
IEEE Transactions on Visualization and Computer Graphics, 27 (2021), 6; 2821 - 2832.

H. Wu, B. Niedermann, S. Takahashi, M. Roberts, M. Nöllenburg:
"A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives";
Computer Graphics Forum, 39 (2020), 3; 619 - 646.

H. Wu, M. Nöllenburg, F. Filipa L. Sousa, I. Viola:
"Metabopolis: scalable network layout for biological pathway diagrams in urban map style";
BMC Bioinformatics, 20 (2019), 187; 1 - 20.

H. Wu, M. Nöllenburg, I. Viola:
"Multi-level Area Balancing of Clustered Graphs";
IEEE Transactions on Visualization and Computer Graphics, 12 (2020), 12; 1 - 12.

Contributions to Books

B. Biesinger, B. Hu, G. Raidl:
"A Memetic Algorithm for Competitive Facility Location Problems";
in: "Business and Consumer Analytics: New Ideas", Springer, 2019, ISBN: 978-3-030-06221-7, 637 - 660.

C. Blum, J. Puchinger, G. Raidl, A. Roli:
"Hybrid metaheuristics";
in: "Hybrid Optimization -The Ten Years of CPAIOR", Springer, 2010, 305 - 336.

J. Fichte, M. Hecher, N. Lodha, S. Szeider:
"An SMT Approach to Fractional Hypertree Width";
in: "Principles and Practice of Constraint Programming", issued by: Springer Verlag; Springer-Verlag, 2018, 109 - 127.

U. Gadiraju, S. Möller, M. Nöllenburg, D Saupe, S. Egger-Lampl, D. Archambault, B. Fisher:
"Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd";
in: "Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments", 10264; D. Archambault, H. Purchase, T. Hossfeld (ed.); Springer International Publishing, 2017, ISBN: 978-3-319-66434-7, 6 - 26.

M. Gruber, G. Raidl:
"(Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem";
in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1-4419-1305-0, 209 - 230.

C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel:
"Go Visual: A Diagramming Software for UML Class Diagrams";
in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 257 - 278.

Y. Hu, M. Nöllenburg:
"Graph Visualization";
in: "Encyclopedia of Big Data Technologies", S. Sakr, A. Zomaya (ed.); Springer International Publishing, Cham, 2018, (invited), ISBN: 978-3-319-63962-8, 1 - 9.

M. Jünger, G.W. Klau, P. Mutzel, R. Weiskircher:
"AGD-A Library of Algorithms for Graph Drawing";
in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 149 - 172.

M. Jünger, P. Mutzel:
"Automatic Graph Drawing: Exact Optimization Helps!";
in: "The Sharpest Cut: The Impact of Manfred Padberg and His Work", M. Grötschel (ed.); issued by: MPS-SIAM Series on Optimization; MPS-SIAM, 2004, ISBN: 0-89871-552-0, 327 - 351.

M. Jünger, P. Mutzel:
"Graph Drawing Software, Introduction";
in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 1 - 7.

M. Jünger, P. Mutzel:
"Technical Foundations";
in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 9 - 53.

A. Kerren, J. Stasko:
"Algorithm Animation - Chapter Introduction";
in: "Software Visualization", Springer, 2002, 1 - 15.

P. Mutzel:
"Optimization in Graph Drawing";
in: "Handbook of Applied Optimization", Oxford University Press, 2002, 967 - 977.

P. Mutzel:
"The SPQR-Tree Data Structure in Graph Drawing";
in: "Automata, Languages and Programming; 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003; Proceedings", J.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (ed.); Springer, 2003, ISBN: 3-540-40493-7, 34 - 46.

P. Mutzel, P. Eades:
"Graphs in Software Visualization - Introduction";
in: "Software Visualization", Springer, 2002, 285 - 294.

P. Mutzel, G.W. Klau:
"Automatic Layout and Labelling of State Diagrams";
in: "Mathematics - Key Technology for the Future", W. Jäger, H.-J. Krebs (ed.); Springer, Berlin, 2003, ISBN: 3-540-44220-0, 584 - 608.

M. Nöllenburg:
"Crossing Layout in Non-planar Graph Drawings";
in: "Beyond Planar Graphs", issued by: Hong SH., Tokuyama T.; Springer, Singapore, 2020, ISBN: 978-981-15-6532-8, 187 - 209.

M. Pimmer, G. Raidl:
"A timeslot-filling based heuristic approach to construct high-school timetables";
in: "Advances in Metaheuristics", Springer, 2013, ISBN: 978-1-4614-6322-1, 143 - 158.

S. Pirkwieser, G. Raidl, J. Puchinger:
"A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem";
in: "Recent Advances in Evolutionary Computation for Combinatorial Optimization", Springer, 2008, 69 - 85.

J. Puchinger, G. Raidl, S. Pirkwieser:
"MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics";
in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1441913050, 71 - 102.

G. Raidl, J. Puchinger:
"Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization";
in: "Hybrid Metaheuristics - An Emergent Approach for Combinatorial Optimization, volume 114 of Studies in Computational Intelligence", Springer, 2008, 31 - 62.

G. Raidl, J. Puchinger, C. Blum:
"Metaheuristic Hybrids";
in: "Handbook of Metaheuristics", issued by: Michel Gendreau, Jean Yves Potvin, eds.; Springer, 2019, ISBN: 978-3-319-91085-7, 385 - 417.

M. Samer, S. Szeider:
"Fixed-Parameter Tractability";
in: "Handbook of Satisfiability", 336; A. Biere, M. Heule, H. van Maaren, T. Walsh (ed.); IOS Press, Amsterdam, 2021, ISBN: 978-1-64368-160-3, 693 - 727.

S. Szeider, S. Ordyniak, S. Gaspers:
"The Constraint Satisfaction Problem: Complexity and Approximability";
in: "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, ISBN: 978-3-95977-003-3, 137 - 157.

R. Weiskircher:
"Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen";
in: "Ausgezeichnete Informatikdissertationen 2002", D. Wagner et al. (ed.); issued by: Gesellschaft für Informatik 2003; Bonner Köllen Verlag, Bonn, 2003, ISBN: 3-88579-407-1, 201 - 210.

Contributions to Proceedings

L. Barth, B. Niedermann, M. Nöllenburg, D. Strash:
"Temporal map labeling: A new unified framework with experiments. Advances in Geographic Information Systems";
in: "Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems", 23; issued by: Acm Dl; ACM, Acm Dl, 2016, ISBN: 978-1-4503-4589-7, 1 - 10.

W. Barth, M. Jünger, P. Mutzel:
"Simple and Efficient Bilayer Cross Counting";
in: "Graph Drawing 2002", Springer, 2002, 130 - 141.

W. Barth, M. Jünger, P. Mutzel:
"Simple and Efficient Bilayer Cross Counting";
in: "Journal of Graph Algorithms and Applications", R. Tamassia, I. Tollis, G. Liotta (ed.); World Scientific, 2004, 16 pages.

M. Bauer, G.W. Klau:
"Stuctural Alignment of Two RNA Sequences with Lagrangian Relaxation";
in: "Algorithms and Computation - ISAAC 2004, Proceedings", R. Fleischer, G. Trippen (ed.); issued by: Lecture Notes in Computer Science 3341; Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-24131-0, 113 - 123.

B. Biesinger, C. Schauer, B. Hu, G. Raidl:
"Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 380 - 387.

C. Blum, J. Puchinger, G. Raidl, A. Roli:
"A brief survey on hybrid metaheuristics";
in: "Proceedings of BIOMA 2010 - 4th International Conference on Bioinspired Optimization Methods and their Applications", Jozef Stefan Institute, Ljubljana, Slovenia, 2010, ISBN: 978-961-264-017-0, 3 - 16.

F.J. Brandenburg, D. Eppstein, M.T. Goodrich, S.G. Kobourov, G. Liotta, P. Mutzel:
"Selected Open Problems in Graph Drawing";
in: "Graph Drawing 2003, 11th International Symposium, GD 2003, Perugia, Italy, September 2003, Revised Papers, LNCS 2912", G. Liotta (ed.); Springer, 2003, ISBN: 3-540-20831-3, 515 - 539.

A Chwatal, G. Raidl:
"Determining orbital elements of extrasolar planets by evolution strategies.";
in: "Computer Aided Systems Theory - EUROCAST 2007", R. Moreno-Díaz (ed.); Springer, Lecture Notes in Computer Science, Vol. 4739, 2007, ISBN: 978-3-540-75866-2, 870 - 877.

L. Cmolik, V. Pavlovec, H. Wu, M. Nöllenburg:
"Mixed Labeling: Integrating Internal and External Labels";
in: "IEEE Transactions on Visualization and Computer Graphics (TVCG)", K. Schmid (ed.); IEEE Computer Society Press, 2020, 1 - 14.

S. Diehl, C. Görg, A. Kerren:
"Animating Algorithms Live and Post Mortem";
in: "Software Visualization", Springer, 2002, 46 - 57.

S. Diehl, A. Kerren:
"Reification of Program Points for Visual Execution";
in: "IEEE Workshop on Visualizing Software for Understanding and Analysis", IEEE Computer Society Press, 2002, 100 - 109.

F. Dusberger, G. Raidl:
"A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem";
in: "Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies", issued by: Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies; Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies, 2017, ISBN: 978-3-319-42902-1, 385 - 391.

E. Eiben, R. Ganian, D. Knop:
"Unary Integer Linear Programming with Structural Restrictions";
in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", International Joint Conferences on Artificial Intelligence, Schweden, 2018, ISBN: 978-0-9992411-2-7, 1284 - 1290.

E. Eiben, R. Ganian, S. Ordyniak:
"A Structural Approach to Activity Selection";
in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", issued by: IJCAI2018; International Joint Conferences on Artificial Intelligence, Stockholm, 2018, ISBN: 978-0-9992411-2-7, 203 - 209.

E. Eiben, R. Ganian, S. Ordyniak:
"Small Resolution Proofs for QBF using Dependency Treewidth";
in: "Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France", 35th Symposium on Theoretical Aspects of Computer Science, Caen, 2018, ISBN: 978-3-95977-062-0, 1 - 14.

A. Expósito, G. Raidl, J. Brito, J. Moreno-Perez:
"GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection";
in: "Computer Aided Systems Theory", 10671; issued by: Springer Verlag; Springer LNCS, 2018, 299 - 306.

N. Frohner, S. Teuschl, G. Raidl:
"Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization";
in: "Eurocast2019-EXTENDED ABSTRACTS", Universidad de Las Palmas de Gran Canaria, 2019, ISBN: 978-84-09-09208-6, 78 - 79.

R. Ganian, I. Kanj, S. Ordyniak, S. Szeider:
"Parameterized Algorithms for the Matrix Completion Problem";
in: "Proceeding of ICML", issued by: jmlr.org; Journal of Machine Learning Research, 2018, 1642 - 1651.

R. Ganian, F. Klute, S. Ordyniak:
"On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem";
in: "Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science", 35th Symposium on Theoretical Aspects of Computer Science, Cean, 2018, ISBN: 978-3-95977-062-0, 1 - 14.

R. Ganian, N. Lodha, S. Ordyniak, S. Szeider:
"SAT-Encodings for Treecut Width and Treedepth";
in: "Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)", S.G. Kobourov, H. Meyerhenke (ed.); SIAM, 2019, ISBN: 978-1-61197-549-9, 13 pages.

R. Ganian, M. S. Ramanujan, S. Szeider:
"Backdoor Treewidth for SAT";
in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer-Verlag, 2017, ISBN: 978-3-319-66262-6, 20 - 37.

R. Ganian, M. S. Ramanujan, S. Szeider:
"Combining Treewidth and Backdoors for CSP";
in: "34th Symposium on Theoretical Aspects of Computer Science", issued by: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, ISBN: 978-3-95977-028-6, 429 - 445.

R. Ganian, S. Szeider:
"New Width Parameters for Model Counting";
in: "Theory and Applications of Satisfiability Testing - SAT 2017", International Conference on Theory and Applications of Satisfiability Testing, 2017, ISBN: 978-3-319-66262-6, 38 - 52.

C. Gutwenger, M. Jünger, G. Klau, S. Leipert, P. Mutzel:
"Graph Drawing Algorithm Engineering with AGD";
in: "Software Visualization", Springer, 2002, 307 - 323.

C. Gutwenger, M. Jünger, G. Klau, S. Leipert, P. Mutzel, R. Weiskircher:
"A Library of Algorithms for Graph Drawing";
in: "Graph Drawing 2002", Springer, 2002, 473 - 474.

C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel:
"Caesar Automatic Layout of UML Class Diagrams";
in: "Graph Drawing 2002", Springer, 2002, 461 - 462.

C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher:
"Advances in C-Planarity Testing of Clustered Graphs";
in: "Graph Drawing 2002", Springer, 2002, 220 - 236.

C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher:
"Subgraph Induced Planar Connectivity Augmentation";
in: "Graph-Theoretic Concepts in Computer Science , 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, LNCS 2880", H.L. Bodlaender (ed.); Springer, 2003, ISBN: 3-540-20452-0, 261 - 272.

C. Gutwenger, P. Mutzel:
"An Experimental Study of Crossing Minimization Heuristics";
in: "Graph Drawing 2003, 11th International Symposium, GD 2003, Perugia, Italy, September 2003, Revised Papers, LNCS 2912", G. Liotta (ed.); Springer, 2003, ISBN: 3-540-20831-3, 13 - 24.

C. Gutwenger, P. Mutzel:
"Graph Embedding with Minimum Depth and Maximum External Face (Extended Abstract)";
in: "Graph Drawing 2003, 11th International Symposium, GD 2003, Perugia, Italy, September 2003, Revised Papers, LNCS 2912", G. Liotta (ed.); Springer, 2003, ISBN: 3-540-20831-3, 259 - 272.

H. Hoos, T. Peitl, F. Slivovsky, S. Szeider:
"Portfolio-Based Algorithm Selection for Circuit QBFs";
in: "Portfolio-Based Algorithm Selection for Circuit QBFs", 173; issued by: Springer Verlag; Springer-Verlag, 2018, 195 - 205.

M. Horn, G. Raidl, E. Rönnberg:
"An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows";
in: "Annals of Operations Research", 10479; Springer, 2018, 235 - 256.

B. Julstrom, G. Raidl:
"A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem";
in: "GECCO - 2003, Genetic and Evolutionary Computation Conference Workshop Program, Workshop on Analysis and Design of Representations and Operators (ADoRo 2003)", A. Barry (ed.); University of Bath, 2003, 2 - 7.

B. Julstrom, G. Raidl:
"Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem";
in: "Proceedings of the 2003 ACM Symposium on Applied Computing, March 9-12, 2003, Melbourne, Florida, USA", ACM, 2003, 747 - 752.

B. Julstrom, G. Raidl:
"Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges ";
in: "Applied Computing 2002", ACM, New York, 2002, 547 - 552.

A. Kerren:
"Generation as Method for Explorative Learning in Computer Science Education.";
in: "ITiCSE: Annual Joint Conference Integrating Technology into Computer Science Education", ACM, 2004, ISBN: 1-58113-672-2, 77 - 81.

A. Kerren, F. Breier, P. Kügler:
"DGCVis: An Exploratory 3D Visualization of Graph Pyramids. ";
in: "Proceedings of the 2nd International Conference on Coordinated and Multiple Views in Exploratory Visualization (CMV '04)", IEEE, 2004, 73 - 83.

S. Kersting, G. Raidl, I. Ljubic:
"A Memetic Algorithm for Vertex-Biconnectivity Augmentation ";
in: "Applications of Evolutionary Computing", Springer, 2002, 102 - 111.

G.W. Klau, I. Ljubic, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. Weiskircher:
"Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem";
in: "Genetic and Evolutionary Computation - GECCO 2004", K. Deb, R. Poli, W. Banzhaf, H. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. Lanzi, A. Tettamanzi, D. Thierens, A. Tyrrell (ed.); issued by: Lecture Notes in Computer Science 3102; Springer, 2004, ISBN: 3-540-22343-6, 1304 - 1315.

G.W. Klau, S. Rahmann, A. Schliep, M. Vingron, K. Reinert:
"Optimal robust non-unique probe selection using integer linear programming. ";
in: "Proc. of ISMB/ECCB 2004 (Intelligent Systems for Molecular Biology and European Conference on Computational Biology, 2004", unbekannt, 2004.

B. Klocker, G. Raidl:
"Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging";
in: "Computer Aided Systems Theory -- EUROCAST 201", 10671; issued by: Springer; Springer LNCS, 2018, ISBN: 978-3-319-74727-9, 355 - 363.

G. Kodydek, M. Schönhacker:
"Si3Trenn and Si3Silb: Using the SiSiSi Word Analysis System for Pre-hyphenation and Syllable Counting in German Documents";
in: "Text, Speech and Dialogue, 6th International Conference, TSD 2003, Ceské Budejovice, Czech Republic, September 2003, Proceedings", V. Matousek, P. Mautner (ed.); Springer, 2003, ISBN: 3-540-20024-x, 66 - 73.

G. Koller, G. Raidl:
"An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem.";
in: "Parallel Problem Solving from Nature - PPSN VIII", X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós (ed.); issued by: Lecture Notes in Computer Science 3242; Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-23092-0, 302 - 311.

N. Lodha, S. Ordyniak, S. Szeider:
"SAT-Encodings for Special Treewidth and Pathwidth";
in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 429 - 445.

J. Maschler, M. Riedler, G. Raidl:
"Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments";
in: "Computer Aided Systems Theory - EUROCAST 2017", issued by: Springer Verlag; Springer, 2018, ISBN: 978-3-319-74717-0, 364 - 372.

P. Mutzel, C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert:
"A new Approach for Visualizing UML Class Diagrams";
in: "Proceedings of the ACM 2003 Symposium on Software Visualization, June 11-13, 2003", S. Diehl, J. Stasko (ed.); ACM, San Diego, California, 2003, ISBN: 1-58113-642-0, 179 - 188.

P. Mutzel, R. Weiskircher:
"Bend Minimization in Orthogonal Drawings Using Integer Programming";
in: "Computing and Combinatorics", Springer, 2002, 484 - 493.

M. Nöllenburg, B. Niedermann, I. Rutter:
"Radial Contour Labeling with Straight Leaders";
in: "2017 IEEE Pacific Visualization Symposium", IEEE, 2017, 295 - 304.

A. Pagacz, G. Raidl, S. Zawislak:
"Evolutionary approach to constrained minimum spanning tree problem.";
in: "Evolutionary Computation and Global Optimization 2006, Murzasichle, Poland, 2006.", J. Arabasa (ed.); Oficyna Wydawnicza Politechniki Warszawskiej, Murzasichle, Polen, 2006, ISSN: 0137-2343, 331 - 341.

P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu:
"A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 372 - 379.

T. Peitl, F. Slivovsky, S. Szeider:
"Dependency Learning for QBF";
in: "Theory and Applications of Satisfiability Testing - SAT 2017", © Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 198 - 313.

T. Peitl, F. Slivovsky, S. Szeider:
"Polynomial-Time Validation of QCDCL Certificates";
in: "Theory and Applications of Satisfiability Testing - SAT 2018", issued by: Springer Verlag; Springer-Verlag, Lecture Notes in Artificial Intelligence 8268, 2018, ISBN: 978-3-319-94143-1, 253 - 269.

S. Pirkwieser, G. Raidl, J. Gottlieb:
"Improved packing and routing of vehicles with compartments";
in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", Universidad de Las Palmas de Gran Canaria, 2011, ISBN: 978-84-693-9560-8, 302 - 304.

P. Pop, B. Hu, G. Raidl:
"A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem";
in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 219 - 226.

J. Puchinger, G. Raidl:
"An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. ";
in: "Parallel Problem Solving from Nature - PPSN VIII", X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós et al. (ed.); issued by: Lecture Notes in Computer Science 3242; Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-23092-0, 642 - 651.

J. Puchinger, G. Raidl, G. Koller:
"Solving a real-world glass cutting problem. ";
in: "Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004", issued by: Lecture Notes in Computer Science 3004; Springer, Heidelberg, 2004, ISBN: 3-540-21367-8, 165 - 176.

G. Raidl, H. Feltl:
"An improved hybrid genetic algorithm for the generalized assignment problem.";
in: "Proceedings of the 2003 ACM Symposium on Applied Computing", H. M. Haddad et al. (ed.); ACM, 2004, ISBN: 1-58113-812-1, 990 - 995.

G. Raidl, G. Kodydek, B. Julstrom:
"On Weight-Biased Mutation for Graph Problems";
in: "Parallel Problem Solving from Nature-PPSNVII", Springer, 2002, 204 - 213.

M. Schreyer, G. Raidl:
"Letting Ants Labeling Point Features";
in: "2002 IEEE Congress on Evolutionary Computation", IEEE, 2002, 1564 - 1569.

Editorials in Proceedings

D. Corneil, R. Ganian, A. Proskurowski:
"Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada";
in: "Discrete Applied Mathematics", 278; Elsevier Science Publishers, 2020, 1 - 2.

Talks and Poster Presentations (with Proceedings-Entry)

E. Argyriou, S. Cornelsen, H. Förster, M Kaufmann, M. Nöllenburg, Y. Okamoto, C. Raftopoulou, A. Wolff:
"Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Barcelona; 2018-09-26 - 2018-09-28; in: "Graph Drawing and Network Visualization (GD'2018)", T. Biedl, A. Kerren (ed.); Springer Lecture Notes in Computer Science, 11282 (2018), 509 - 523.

H. Aziz, P. Biro, S. Gaspers, R. de Haan, N. Mattei, B. Rastegari:
"Stable Matching with Uncertain Linear Preferences";
Talk: International Symposium on Algorithmic Game Theory, Liverpool, United Kingdom; 2016-09-19 - 2016-09-21; in: "Proceedings of the 9th International Symposium on Algorithmic Game Theory - SAGT 2016", (2016), ISBN: 978-3-662-53353-6; 195 - 206.

C. Bacher, T. Krenek, G. Raidl:
"Reducing the number of simulations in operation strategy optimization for hybrid electric vehicles.";
Talk: 17th European Conference, EvoApplications 2014, Granada, Spanien; 2014-04-23 - 2014-04-25; in: "Applications of Evolutionary Computation, Lecture Notes in Computer Science", A. Esparcia-Alcázar, A. Mora (ed.); Springer Berlin Heidelberg, (2014), ISBN: 978-3-662-45522-7; 553 - 564.

C. Bacher, G. Raidl:
"A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 119 - 120.

S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg:
"Geometric Planar Networks on Bichromatic Points";
Talk: CALDAM, Hyderabad , Indien; 2020-02-13 - 2020-02-15; in: "CALDAM: Conference on Algorithms and Discrete Applied Mathematics", LNCS, 12016 (2020), ISBN: 978-3-030-39218-5; 79 - 91.

S. Bandyapadhyay, F. Fomin, P. Golovach, K. Simonov:
"Parameterized Complexity of Feature Selection for Categorical Data Clustering";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Tallinn (Estonia); 2021-08-23 - 2021-08-27; in: "46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)", LIPICS, 202 (2021), ISBN: 978-3-95977-201-3; 1 - 14.

T. Batik, M. Nöllenburg, Y. Wang, H. Wu:
"Mixed Metro Maps with User-Specied Motifs";
Poster: International Symposium on Graph Drawing and Network Visualization, Tübingen; 2021-09-14 - 2021-09-17; in: "29th International Symposium on Graph Drawing and Network Visualization", (2021), 1 - 4.

M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis:
"Planar Drawings of Fixed-Mobile Bigraphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 426 - 439.

B. Bergnougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan:
"Towards a Polynomial Kernel for Directed Feedback Vertex Set";
Talk: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg Denmark; 2017-08-21 - 2017-08-25; in: "Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science", Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, (2017), ISBN: 978-3-95977-046-0; 1 - 15.

D. Bergren, E. Eiben, R. Ganian, I. Kanj:
"On Covering Segments with Unit Intervals";
Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Montpellier, Frankreich; 2020-03-10 - 2020-03-13; in: "37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)", LIPICS, 154 (2020), ISBN: 978-3-95977-140-5; Paper ID 13, 17 pages.

M. Berlakovich, M. Ruthmair, G. Raidl:
"A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 247 - 249.

M. Berlakovich, M. Ruthmair, G. Raidl:
"A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 256 - 263.

O. Beyersdorff, L. Chew, R. Schmidt, M. Suda:
"Lifting QBF Resolution Calculi to DQBF";
Talk: 19th International Conference on Theory and Applications of Satisfiability Testing, SAT 2016, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings", Springer, LNCS 9710 (2016), 490 - 499.

S. Bhore, G. Da Lozzo, F. Montecchiani, M. Nöllenburg:
"On the Upward Book Thickness Problem: Combinatorial and Complexity Results";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 242 - 256.

S. Bhore, R. Ganian, G. Li, M. Nöllenburg, J. Wulms:
"Worbel: Aggregating Point Labels intoWord Clouds";
Talk: ACM SIGSPATIAL international conference on Advances in geographic information systems, Beijing, China; 2021-11-02 - 2021-11-05; in: "SIGSPATIAL '21: Proceedings of the 29th International Conference on Advances in Geographic Information Systems", ACM, (2021), ISBN: 978-1-4503-8664-7; 256 - 267.

S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg:
"Parameterized Algorithms for Book Embedding Problems";
Talk: Graph Drawing and Network Visualization, Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 365 - 378.

S. Bhore, J. Haunert, F. Klute, G. Li, M. Nöllenburg:
"Balanced Independent and Dominating Sets on Colored Interval Graphs";
Talk: International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Bozen, Italy; 2021-01-25 - 2021-01-29; in: "SOFSEM 2021: Theory and Practice of Computer Science", Springer, LNCS 12607 (2021), ISBN: 978-3-030-67730-5; 89 - 103.

S. Bhore, G. Li, M. Nöllenburg:
"An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling";
Talk: European Symposium on Algorithms, Pisa, Italien; 2020-09-07 - 2020-09-09; in: "28th Annual European Symposium on Algorithms (ESA 2020)", LIPICS, 173 (2020), ISBN: 978-3-95977-162-7; 1 - 24.

S. Bhore, G. Li, M. Nöllenburg, I. Rutter, H. Wu:
"Untangling Circular Drawings: Algorithms and Complexity";
Talk: International Symposium on Algorithms and Computation (ISAAC), Fukuoka, Japan; 2021-12-06 - 2021-12-08; in: "32nd International Symposium on Algorithms and Computation (ISAAC 2021)", LIPICS, 212 (2021), ISBN: 978-3-95977-214-3; 1 - 17.

S. Bhore, M. Löffler, S. Nickel, M. Nöllenburg:
"Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 304 - 317.

T. Biedl, S. Chaplick, M Kaufmann, F. Montecchiani, M. Nöllenburg, C. Raftopoulou:
"Layered Fan-Planar Graph Drawings";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Prag, Tschechien; 2020-08-24 - 2020-08-28; in: "45th International Symposium on Mathematical Foundations of Computer Science", LIPICS, 170 (2020), ISBN: 978-3-95977-159-7; 1 - 13.

B. Biesinger, B. Hu, G. Raidl:
"A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands";
Talk: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015, Kopenhagen, Dänemark; 2015-04-08 - 2015-04-10; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015", G. Ochoa, F. Chicano (ed.); Springer, 9026 (2015), ISBN: 978-3-319-16467-0; 48 - 60.

B. Biesinger, B. Hu, G. Raidl:
"An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior.";
Talk: Learning and Intelligent OptimizatioN Conference LION, Gainesville; 2014-02-16 - 2014-02-21; in: "Learning and Intelligent Optimization", P. Pardalos, M. Resende, C. Vogiatzis, J. Walteros (ed.); (2014), ISBN: 978-3-319-09584-4; 203 - 217.

B. Biesinger, B. Hu, G. Raidl:
"An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands";
Talk: International Network Optimization Conference (INOC), Warschau, Polen; 2015-05-18 - 2015-05-20; in: "Proceedings of the 7th International Network Optimization Conference", Electronic Notes in Discrete Mathematics, 52 (2016), ISSN: 1571-0653; 245 - 252.

B. Biesinger, C. Schauer, B. Hu, G. Raidl:
"Reconstructing cross cut shredded documents with a genetic algorithm with solution archive";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 226 - 228.

B. Biesinger, C. Weiler, B. Hu, G. Raidl:
"Heuristic Approaches for the Probabilistic Traveling Salesman Problem";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 99 - 100.

S. Biffl, R. Mordinyi, G. Raidl, H. Steininger, D. Winkler:
"An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods";
Talk: 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track, Luxembourg, Luxemburg; 2014-06-25 - 2014-06-27; in: "Proceedings of the 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track", Delta, (2014), ISBN: 978-87-7398-157-3.

B. Bliem, S. Ordyniak, S. Woltran:
"Clique-Width and Directed Width Measures for Answer-Set Programming";
Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "ECAI 2016 - 22nd European Conference on Artificial Intelligence", G. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, F. van Harmelen (ed.); IOS Press, 285 (2016), ISBN: 978-1-61499-671-2; 1105 - 1113.

G. Blin, M. Gasparoux, S. Ordyniak, A. Popa:
"SOBRA - Shielding Optimization for BRAchytherapy";
Talk: International Workshop on Combinatorial Algorithms (IWOCA), Helsinki, Finland; 2016-08-17 - 2016-08-19; in: "Combinatorial Algorithms - 27th International Workshop", (2016), ISBN: 978-3-319-44542-7; 309 - 320.

J. Blinkhorn, T. Peitl, F. Slivovsky:
"Davis and Putnam Meet Henkin: Solving DQBF with Resolution";
Talk: International Conference on the Theory and Applications of Satisfiability Testing, Barcelona, Spanien; 2021-07-05 - 2021-07-09; in: "International Conference on Theory and Applications of Satisfiability Testing", LNCS / Springer, 12831 (2021), ISBN: 978-3-030-80222-6; 30 - 46.

C. Blum, D. Thiruvady, A. Ernst, M. Horn, G. Raidl:
"A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem";
Talk: Advances in Artificial Intelligence, North Terrace, Adelaide, South Australia; 2019-12-02 - 2019-12-05; in: "AI 2019: Advances in Artificial Intelligence", LNCS, 11919 (2019), ISBN: 978-3-030-35288-2; 549 - 560.

S. Bova:
"SDDs Are Exponentially More Succinct than OBDDs";
Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 929 - 935.

S. Bova, M. Barnaby:
"First-Order Queries on Finite Abelian Groups";
Talk: Annual Conference of the European Association for Computer Science Logic (CSL), Berlin; 2015-09-07 - 2015-09-10; in: "Proceedings of the 24th EACSL Annual Conference on Computer Science Logic", (2015), ISSN: 1868-8969; Paper ID 57, 19 pages.

S. Bova, F. Capelli, S. Mengel, F. Slivovsky:
"Knowledge Compilation Meets Communication Complexity";
Talk: International Joint Conference on Artificial Intelligence (IJCAI), New York, USA; 2016-07-09 - 2016-07-15; in: "Proceedings of the 25th International Joint Conference on Artificial Intelligence - IJCAI 2016", (2016), ISBN: 978-1-57735-770-4; 1008 - 1014.

S. Bova, F. Capelli, S. Mengel, F. Slivovsky:
"On Compiling CNFs into Structured Deterministic DNNFs";
Talk: International Conference on the Theory and Applications of Satisfiability Testing, Austin, Texas; 2015-09-24 - 2015-09-27; in: "Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing", LNCS, 9340 (2015), ISBN: 978-3-319-24317-7; 199 - 214.

S. Bova, F. Slivovsky:
"On Compiling Structured CNFs to OBDDs";
Talk: International Computer Science Symposium in Russia (CSR), Listvyanka, Russia; 2015-07-13 - 2015-07-17; in: "Proceedings of the 10th International Computer Science Symposium", LNCS, Volume 9139 2015 (2015), ISBN: 978-3-319-20296-9; 80 - 94.

A. Bracher, N. Frohner, G. Raidl:
"Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems";
Talk: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Wien; 2021-07-05 - 2021-07-08; in: "Integration of Constraint Programming, Artificial Intelligence, and Operations Research", LNCS / Springer, 12735 (2021), ISBN: 978-3-030-78229-0; 283 - 298.

R. Bredereck, J. Chen, D. Knop, J. Luo, R. Niedermeier:
"Adapting Stable Matchings to Evolving Preferences";
Talk: AAAI 2020, New York, USA; 2020-02-07 - 2020-02-12; in: "Proceedings of AAAI2020", (2020), ISBN: 978-1-57735-835-0; 1830 - 1837.

T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan:
"Short Plane Supports for Spatial Hypergraphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Barcelona; 2018-09-26 - 2018-09-28; in: "Graph Drawing and Network Visualization (GD'2018)", T. Biedl, A. Kerren (ed.); Springer Lecture Notes in Computer Science, 11282 (2018), 53 - 66.

S. Chaplick, M. Chimani, S. Cornelsen, G. Da Lozzo, M. Nöllenburg, M. Patrignani, I. Tollis, A. Wolff:
"Planar L-Drawings of Directed Graphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 465 - 478.

J. Chen, A. Chmurovic, F. Jogl, M. Sorge:
"On (Coalitional) Exchange-Stable Matching";
Talk: International Symposium on Algorithmic Game Theory, Aarhus, Denmark; 2021-09-21 - 2021-09-24; in: "International Symposium on Algorithmic Game Theory", LNCS / Springer, 12885 (2021), ISBN: 978-3-030-85946-6; 205 - 220.

J. Chen, W. Czerwinski, Y. Disser, A. Feldmann, D. Hermelin, W. Nadara, M. Pilipczuk, M. Pilipczuk, M. Sorge, B. Wróblewski, A. Zych-Pawlewicz:
"Efficient fully dynamic elimination forests with applications to detecting long paths and cycles*";
Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, Virginia, U.S.; 2021-01-10 - 2021-01-13; in: "Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)", Siam, (2021), 796 - 809.

J. Chen, R. Ganian, T. Hamm:
"Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP";
Talk: International Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence", (2021), ISBN: 978-0-9992411-6-5; 1 - 7.

J. Chen, S. Roy, M. Sorge:
"Fractional Matchings under Preferences: Stability and Optimality";
Talk: IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada; 2021-08-19 - 2021-08-27; in: "Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)", (2021), ISBN: 978-0-9992411-9-6; 89 - 95.

L. Chew:
"Hardness and Optimality for QBF Proof Systems Modulo NP";
Talk: International Conference on the Theory and Applications of Satisfiability Testing, Barcelona; 2021-07-05 - 2021-07-09; in: "SAT 2021: Theory and Applications of Satisfiability Testing - SAT 2021", Springer, 12831 (2021), ISBN: 978-3-030-80223-3; 98 - 115.

M. Chiu, J. Cleve, M. Nöllenburg:
"Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard";
Talk: EuroCG, Utrecht, Niederlande; 2019-03-18 - 2019-03-20; in: "Extended abstract of EuroCG 2019", (2019), 1 - 9.

A Chwatal, N. Musil, G. Raidl:
"Solving a multi-constrained network design problem by lagrangean decomposition and column generation";
Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 7 pages.

A Chwatal, G. Raidl:
"Determining orbital elements of extrasolar planets by evolution strategies.";
Talk: 11th International Conference on Computer Aided Systems Theory (EUROCAST), Las Palmas de Gran Canaria, Spanien; 2007-02-12 - 2007-02-16; in: "EUROCAST 2007 Conference Proceedings, 2007", R. Moreno-Díaz (ed.); (2007).

A Chwatal, G. Raidl:
"Fitting rectangular signals to time series data by metaheuristic algorithms";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 222 - 225.

A Chwatal, G. Raidl:
"Solving the minimum label spanning tree problem by ant colony optimization";
Talk: Conference on Genetic and Evolutionary Methods (GEM), Las Vegas, Nevada, USA; 2010-07-12 - 2010-07-15; in: "Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods", (2010), 91 - 97.

A Chwatal, G. Raidl, O. Dietzel:
"Compressing fingerprint templates by solving an extended minimum label spanning tree problem.";
Talk: MIC 2007: The Seventh Metaheuristics International Conference, Montréal, Canada; 2007-06-25 - 2007-06-29; in: "Proceedings of the Seventh Metaheuristics International Conference (MIC)", (2007), 3 pages.

A Chwatal, G. Raidl, M. Zöch:
"Fitting multi-planet transit models to photometric time-data series by evolution strategies";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Portland, Oregon, USA; 2010-07-07 - 2010-07-11; in: "Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation", (2010), 7 pages.

A Chwatal, C. Thöni, K. Oberlechner, G. Raidl:
"A branch-and-cut-and-price algorithm for a fingerprint-template compression application";
Poster: Federated Conference on Computer Science and Information Systems (FedCSIS), Szczecin, Poland; 2011-09-18 - 2011-09-21; in: "Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS)", (2011), 239 - 246.

P. de Col, F. Klute, M. Nöllenburg:
"Mixed Linear Layouts: Complexity, Heuristics, and Experiments";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 460 - 467.

R. de Haan:
"Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation";
Talk: International Workshop on Computational Social Choice (COMSOC), Toulouse, France; 2016-06-22 - 2016-06-24; in: "Proceedings of the Sixth International Workshop on Computational Social Choice - COMSOC 2016", (2016), 19 pages.

R. de Haan:
"Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation";
Talk: ECAI 2016 - 22nd European Conference on Artificial Intelligence, Den Haag, Niederlande; 2016-08-29 - 2016-09-02; in: "Proceedings of the 22nd European Conference on Artificial Intelligence - ECAI 2016", IOS Press, 285 (2016), ISBN: 978-1-61499-671-2; 1502 - 1510.

R. de Haan, U. Endriss:
"Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young";
Talk: International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Istanbul, Turkey; 2015-05-04 - 2015-05-08; in: "Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems - AAMAS 2015", G. Weiss, P. Yolum, R. Bordini, E. Elkind (ed.); (2015), ISBN: 978-1-4503-3413-6; 117 - 125.

R. de Haan, U. Endriss, S. Szeider:
"Parameterized Complexity Results for Agenda Safety in Judgment Aggregation";
Talk: International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Istanbul, Turkey; 2015-05-04 - 2015-05-08; in: "Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems - AAMAS 2015", G. Weiss, P. Yolum, R. Bordini, E. Elkind (ed.); (2015), ISBN: 978-1-4503-3413-6; 127 - 136.

R. de Haan, M. Kronegger, A. Pfandler:
"Fixed-parameter Tractable Reductions to SAT for Planning";
Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 2897 - 2903.

R. de Haan, S. Szeider:
"Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP";
Talk: International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Pec pod Snezkou, Czech Republic; 2015-01-24 - 2015-01-29; in: "41st International Conference on Current Trends in Theory and Practice of Computer Science - SOFSEM 2015", G. Italiano, T. Margaria, J. Pokorný, J. Quisquater, R. Wattenhofer (ed.); LNCS, 8939 (2015), ISBN: 978-3-662-46077-1; 217 - 229.

R. de Haan, S. Szeider:
"Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics";
Talk: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), Kapstadt, Südafrika; 2016-04-25 - 2016-04-29; in: "Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning - KR 2016", (2016), ISBN: 978-1-57735-755-1; 453 - 462.

R. de Haan, J. Szymanik:
"A Dichotomy Result for Ramsey Quantifiers";
Talk: WoLLIC 2015, Bloomington, USA; 2015-07-20 - 2015-07-23; in: "22nd International Workshop on Logic, Language, Information, and Computation - WoLLIC 2015", V. de Paiva, R. de Queiroz, L. Moss, D. Leivant, A. Grisi de Oliveira (ed.); 9160 (2015), ISBN: 978-3-662-47708-3; 69 - 80.

A. Deligkas, E. Eiben, R. Ganian, T. Hamm, S. Ordyniak:
"The Parameterized Complexity of Connected Fair Division";
Talk: IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada; 2021-08-19 - 2021-08-27; in: "Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)", (2021), ISBN: 978-0-9992411-9-6; 139 - 145.

M. Djukanovic, C. Berger, G. Raidl, C. Blum:
"On Solving a Generalized Constrained Longest Common Subsequence Problem";
Talk: International Conference on Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "International Conference on Optimization and Applications-OPTIMA2020", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62866-6; 55 - 70.

M. Djukanovic, G. Raidl, C. Blum:
"A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation";
Talk: International Conference on Machine Learning, Optimization, and Data Science, Certosa di Pontignano, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", LNCS, 11943 (2020), ISBN: 978-3-030-37598-0; 154 - 167.

M. Djukanovic, G. Raidl, C. Blum:
"A Heuristic Approach for Solving the Longest Common Square Subsequence Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019", IUCTC Universidad de Las Palmas de Gran Canaria, (2019), ISBN: 978-84-09-09208-6; 120 - 122.

J. Dreier:
"Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes";
Talk: LICS 2021 - Symposium on Logic in Computer Science, Rom; 2021-06-29 - 2021-07-02; in: "Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science", (2021), ISBN: 978-1-6654-4895-6; 1 - 13.

J. Dreier, P. Rossmanith:
"Approximate Evaluation of First-Order Counting Queries";
Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, Virginia, U.S.; 2021-01-10 - 2021-01-13; in: "Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms", (2021), ISBN: 978-1-61197-646-5; 1 - 20.

F. Dusberger, G. Raidl:
"A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia, J. Rodriguez, R. Moreno-Díaz, R. Moreno-Díaz (ed.); (2015), ISBN: 978-84-606-5438-4; 109 - 110.

F. Dusberger, G. Raidl:
"A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem.";
Talk: International Workshop on Hybrid Metaheuristics 2014 - HM 2014, Hamburg; 2014-06-11 - 2014-06-13; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014", M. Blesa, C. Blum, S. Voß (ed.); LNCS / Springer, 8457 (2014), ISSN: 0302-9743; 85 - 99.

F. Dusberger, G. Raidl:
"Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search.";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 133 - 140.

E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg:
"Extending Nearly Complete 1-Planar Drawings in Polynomial Time";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Prag, Tschechien; 2020-08-24 - 2020-08-28; in: "45th International Symposium on Mathematical Foundations of Computer Science", LIPIcs, 170 (2020), ISBN: 978-3-95977-159-7; 1 - 16.

E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg:
"Extending Partial 1-Planar Drawings";
Talk: International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany; 2020-07-08 - 2020-07-11; in: "47th International Colloquium on Automata, Languages, and Programming", Leibniz International Proceedings in Informatics, 168 (2020), ISBN: 978-3-95977-138-2; 1 - 19.

E. Eiben, R. Ganian, T. Hamm, S. Ordyniak:
"Parameterized Complexity of Envy-Free Resource Allocation in Social Networks";
Talk: 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, New York, USA; 2020-02-07 - 2020-02-12; in: "The Thirty-Fourth AAAI Conference on Artificial Intelligence", AAAI Press, 34 (2020), ISSN: 2159-5399; 7135 - 7142.

E. Eiben, R. Ganian, K. Kangas, S. Ordyniak:
"Counting Linear Extensions Parameterizations by Treewidth";
Talk: ESA Workshop, Aarhus, Denmark; 2016-08-22 - 2016-08-24; in: "Proceedings of the 24th Annual European Symposium on Algorithms", (2016), ISBN: 978-3-95977-015-6; 1 - 18.

E. Eiben, R. Ganian, I. Kanj, S. Ordyniak, S. Szeider:
"The Parameterized Complexity of Clustering Incomplete Data";
Talk: 35th AAAI 2021, virtual event; 2021-02-02 - 2021-02-09; in: "Thirty-Fifth AAAI Conference on Artificial Intelligence", AAAI Press, 35 (2021), ISBN: 978-1-57735-866-4; 7296 - 7304.

E. Eiben, R. Ganian, O. Kwon:
"A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14.

E. Eiben, R. Ganian, S. Ordyniak:
"Using Decomposition-Parameters for QBF: Mind the Prefix!";
Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 964 - 970.

E. Eiben, R. Ganian, S. Szeider:
"Meta-kernelization using Well-structured Modulators";
Talk: International Symposium on Parameterized and Exact Computation (IPEC), Patras, Greece; 2015-09-16 - 2015-09-18; in: "10th International Symposium on Parameterized and Exact Computation (IPEC 2015)", T. Husfeldt, I. Kanj (ed.); LIPICs, 43 (2015), ISBN: 978-3-939897-92-7; 114 - 126.

E. Eiben, R. Ganian, S. Szeider:
"Solving Problems on Graphs of High Rank-Width";
Talk: Algorithms and Data Structures Symposium, Victoria, Canada; 2015-08-05 - 2015-08-07; in: "Proceedings of the 14th International Symposium on Algorithms and Data Structures", LNCS, 9214 (2015), ISBN: 978-3-319-21839-7; 314 - 326.

U. Endriss, U. Grandi, R. de Haan, J. Lang:
"Succinctness of Languages for Judgment Aggregation";
Talk: 15th International Conference on the Principles of Knowledge Representation and Reasoning - KR 2016, Cape Town, South Africa; 2016-04-24 - 2016-04-29; in: "Proceedings of the 2016 International Conference on Principles of Knowledge Representation and Reasoning - KR 2016", AAAI Press, (2016), ISBN: 978-1-57735-755-1; 176 - 186.

A. Exposit, G. Raidl, J. Brito, J. Moreno-Perez:
"GRASP and VNS for a periodic VRP with time windows to deal with milk collection";
Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 90 - 91.

T. Fenz, K. Foerster, S. Schmid, A. Villedieu:
"Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks";
Talk: IFIP Networking Conference, Warschau, Polen; 2019-05-20 - 2019-05-22; in: "IFIP Networking Conference 2019", IEEE Conference Publications, (2019), ISBN: 978-3-903176-16-4; 1 - 9.

J. Fichte, M. Hecher, S. Szeider:
"A Time Leap Challenge for SAT-Solving";
Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming - 26th International Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings", (2020), 267 - 285.

J. Fichte, M. Hecher, S. Szeider:
"Breaking Symmetries with RootClique and LexTopSort";
Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming - 26th International Conference, {CP} 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings", (2020), 286 - 303.

J. Fichte, N. Lodha, S. Szeider:
"SAT-Based Local Improvement for Finding Tree Decompositions of Small Width";
Talk: 20th International Conference on Theory and Applications of Satisfiability Testing - SAT 2017, Melbourne, Australien; 2017-08-28 - 2017-09-01; in: "Proceedings on the 20th International Conference on Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017.", S. Gaspers, T. Walsh (ed.); Lecture Notes in Computer Science (LNCS) / Springer, 10491 (2017), ISBN: 978-3-319-66263-3; 401 - 411.

J. Fichte, N. Manthey, J. Stecklina, A. Schidler:
"Towards Faster Reasoners by Using Transparent Huge Pages";
Talk: CP 2020 - 26th International Conference - Principles and Practice of Constraint Programming, Louvain-laNeuve, Belgium; 2020-09-07 - 2020-09-11; in: "Principles and Practice of Constraint Programming. CP 2020", 12333 (2020), ISBN: 978-3-030-58475-7; 304 - 322.

H. Förster, R. Ganian, F. Klute, M. Nöllenburg:
"On Strict (Outer-)Confluent Graphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 147 - 161.

T. Fröschl, M. Nöllenburg:
"Minimizing Wiggles in Storyline Visualizations";
Poster: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 585 - 587.

N. Frohner, M. Horn, G. Raidl:
"Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines";
Talk: International Conference on Industry 4.0 and Smart Manufacturing, virtual event; 2020-11-23 - 2020-11-25; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020)", Elsevier, 180 (2020), ISSN: 1877-0509; 366 - 370.

N. Frohner, B. Neumann, G. Raidl:
"A Beam Search Approach to the Traveling Tournament Problem";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Sevilla, Spain; 2020-04-15 - 2020-04-17; in: "EvoCOP 2020: Evolutionary Computation in Combinatorial Optimization", LNCS, 12102 (2020), ISBN: 978-3-030-43680-3; 67 - 82.

N. Frohner, G. Raidl:
"A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility";
Talk: International Conference of the Practice and Theory of Automated Timetabling (PATAT), Bruges, Belgium; 2020-08-25 - 2020-08-29; in: "Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling", (2020), ISBN: 978-0-9929984-3-1; 58 - 76.

N. Frohner, G. Raidl:
"Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers";
Talk: International Conference on Machine Learning, Optimization, and Data Science, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", LNCS, 11943 (2020), ISBN: 978-3-030-37599-7; 445 - 457.

N. Frohner, G. Raidl:
"Towards Improving Merging Heuristicsfor Binary Decision Diagrams";
Talk: Learning and Intelligent OptimizatioN Conference LION, Chania, Greece; 2019-05-27 - 2019-05-31; in: "LION 2019: Learning and Intelligent Optimization", LNCS, 11968 (2020), ISBN: 978-3-030-38628-3; 30 - 45.

N. Frohner, S. Teuschl, G. Raidl:
"Casual Employee Scheduling with Constraint Programming and Metaheuristics";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EUROCAST 2019: Computer Aided Systems Theory - EUROCAST 2019", LNCS, 12013 (2019), ISBN: 978-3-030-45092-2; 279 - 287.

J. Gajarsky, P. Hlinený, J. Obdrzalek, D. Lokshtanov, M. S. Ramanujan:
"A New Perspective on FO Model Checking of Dense Graph Classes";
Talk: Symposium on Logic in Computer Science (LICS), New York, USA; 2016-07-05 - 2016-07-08; in: "Proceedings of the 31st Annual Symposium on Logic in Computer Science", (2016), ISBN: 978-1-4503-4391-6; 176 - 184.

J. Gajarsky, M. Lampis, K. Makino, V. Mitsou, S. Ordyniak:
"Parameterized Algorithms for Parity Games";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Mailand, Italien; 2015-08-24 - 2015-08-28; in: "Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II}", G. Italiano, G. Pighizzini, D. Sannella (ed.); (2015), ISBN: 978-3-662-48053-3; 336 - 347.

R. Ganian, R. de Haan, I. Kanj, S. Szeider:
"On Existential MSO and its Relation to ETH";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14.

R. Ganian, T. Hamm, F. Klute, I. Parada, B. Vogtenhuber:
"Crossing-Optimal Extension of Simple Drawings";
Talk: International Colloquium on Automata, Languages and Programming (ICALP), Glasgow, Scotland; 2021-07-12 - 2021-07-16; in: "48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)", LIPICS, 198 (2021), ISBN: 978-3-95977-195-5; 1 - 17.

R. Ganian, T. Hamm, G. Mescoff:
"The Complexity Landscape of Resource-Constrained Scheduling";
Talk: IJCAI 2020, Yokohama; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence", (2021), ISBN: 978-0-9992411-6-5; 1741 - 1747.

R. Ganian, T. Hamm, S. Ordyniak:
"The Complexity of Object Association in Multiple Object Tracking";
Talk: 35th AAAI Conference on Artificial Intelligence (AAAI-21), virtual event; 2021-02-02 - 2021-02-09; in: "The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21)", AAAI Press, 35/2 (2021), ISBN: 978-1-57735-866-4; 1388 - 1396.

R. Ganian, T. Hamm, T. Talvitie:
"An Efficient Algorithm for Counting Markov Equivalent DAGs";
Talk: 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, New York, USA; 2020-02-07 - 2020-02-12; in: "The Thirty-Fourth AAAI Conference on Artificial Intelligence", AAAI Press, 34 (2020), ISSN: 2159-5399; 10136 - 10143.

R. Ganian, M. Kalany, S. Szeider, J. Träff:
"Polynomial-Time Construction of Optimal MPI Derived Datatype Trees";
Talk: IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016), Chicago, Illinois, USA; 2016-05-23 - 2016-05-27; in: "Proceedings of the IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016)", IEEE Computer Society, (2016), ISBN: 978-1-5090-2140-6; 638 - 647.

R. Ganian, I. Kanj, S. Ordyniak, S. Szeider:
"On the Parameterized Complexity ofClustering Incomplete Data into Subspaces of Small Dimension";
Talk: AAAI 2020, New York, USA; 2020-02-07 - 2020-02-12; in: "Proceedings of AAAI2020", AAAI Press, 34 (2020), ISSN: 2374-3468; 3906 - 3913.

R. Ganian, Ej Kim, S. Szeider:
"Algorithmic Applications of Tree-Cut Width";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Milan, Italy; 2015-08-24 - 2015-08-28; in: "Proceedings of the 40th International Symposium Mathematical Foundations of Computer Science 2015", LNCS 9235 (2015), ISBN: 978-3-662-48053-3; 348 - 361.

R. Ganian, F. Montecchiani, M. Nöllenburg, M. Zehavi:
"Parameterized Complexity in Graph Drawing";
Talk: Dagstuhl Seminar 21293, Dagstuhl, Deutschland; 2021-07-18 - 2021-07-23; in: "Seminar on Parameterized Complexity in Graph Drawing", Dagstuhl Reports, 11/06 (2021), ISSN: 2192-5283; 82 - 123.

R. Ganian, N. Narayanaswamy, S. Ordyniak, C. Rahul, M. S. Ramanujan:
"On the Complexity Landscape of Connected f-Factor Problems*";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Krakau, Polen; 2016-08-22 - 2016-08-26; in: "Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science", (2016), ISBN: 978-3-95977-016-3; 1 - 14.

R. Ganian, S. Ordyniak:
"The Complexity Landscape of Decompositional Parameters for ILP";
Talk: AAAI Conference, Phoenix, Arizona, USA; 2016-02-12 - 2016-02-17; in: "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence", (2016), ISBN: 978-1-57735-760-5; 710 - 716.

R. Ganian, S. Ordyniak, M. Ramanujan:
"Going Beyond Primal Treewidth for (M)ILP";
Talk: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, California; 2017-02-04 - 2017-02-09; in: "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence", (2017), ISBN: 978-1-57735-781-0; 815 - 821.

R. Ganian, T. Peitl, F. Slivovsky, S. Szeider:
"Fixed-Parameter Tractability of Dependency QBFwith Structural Parameters";
Talk: 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece; 2020-09-12 - 2020-09-18; in: "Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020", (2020), ISSN: 2334-1033; 392 - 402.

R. Ganian, M. S. Ramanujan, S. Szeider:
"Backdoors to Tractable Valued CSP";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Toulouse, Frankreich; 2016-09-05 - 2016-09-09; in: "Principles and Practice of Constraint Programming (Proceedings of 22nd CP)", LNCS, 9898 (2016), ISBN: 978-3-319-44952-4; 233 - 250.

R. Ganian, M. S. Ramanujan, S. Szeider:
"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting";
Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Arlington, VA, USA; 2016-01-10 - 2016-01-12; in: "Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms", (2016), ISBN: 978-1-61197-433-1; 1670 - 1681.

R. Ganian, A. Schidler, M. Sorge, S. Szeider:
"Threshold Treewidth and Hypertree Width";
Talk: IJCAI - International Joint Conference on Artificial Intelligence, Yokohama, Japan; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)", (2021), ISBN: 978-0-9992411-6-5; 1898 - 1904.

R. Ganian, S. Szeider:
"Community Structure Inspired Algorithms for SAT and #SAT";
Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Austin, Texas; 2015-09-24 - 2015-09-27; in: "Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing", LNCS / Springer, 9340 (2015), ISBN: 978-3-319-24317-7; 223 - 238.

J. Geiger, S. Cornelsen, J. Haunert, P. Kindermann, T. Mchedlidze, M. Nöllenburg, Y. Okamoto, A. Wolff:
"ClusterSets: Optimizing Planar Clusters in Categorical Point Data";
Talk: EuroVis, Zürich, Schweiz; 2021-06-14 - 2021-06-18; in: "Proceedings of the EuroVIS 2021", 40/3 (2021), 471 - 481.

M. Gruber, G. Raidl:
"(Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem";
Talk: Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien; 2008-06-16 - 2008-06-18; in: "Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics", (2008).

M. Gruber, G. Raidl:
"A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem.";
Talk: INOC 2005 (2nd International Network Optimization Conference), Lissabon, Portugal; 2005-03-20 - 2005-03-23; in: "Proceedings of the 2nd International Network Optimization Conference", Volume 1 (2005), ISSN: 1762-5734; 178 - 185.

M. Gruber, G. Raidl:
"Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 228 - 231.

M. Gruber, G. Raidl:
"Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Montreal, Kanada; 2009-07-08 - 2009-07-12; in: "Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation", (2009), 8 pages.

M. Gruber, G. Raidl:
"Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem";
Talk: 2008 International Symposium on Applications and the Internet SAINT 2008, Turku, Finland; 2008-07-28 - 2008-08-01; in: "Proceedings of the 2008 International Symposium on Applications and the Internet", IEEE Computer Society, (2008), ISBN: 978-0-7695-3297-4; 261 - 264.

M. Gruber, G. Raidl:
"Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spanien; 2009-02-15 - 2009-02-20; in: "Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference on Computer Aided Systems Theory", (2009), ISBN: 978-3-642-04771-8; 665 - 672.

M. Gruber, G. Raidl:
"Variable neighborhood search for the bounded diameter minimum spanning tree problem.";
Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1.

M. Gruber, J van Hemert, G. Raidl:
"Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO.";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Seattle; 2006-07-08 - 2006-07-12; in: "Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2006", M. Keijzer et al. (ed.); New York (2006), ISBN: 1-59593-186-4; 1187 - 1194.

I. Grujicic, G. Raidl, A. Schöbel:
"Variable neighbourhood search for integrated timetable design of railway infrastructure.";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 141 - 148.

I. Grujicic, G. Raidl, A. Schöbel, G. Besau:
"A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure";
Talk: 3^rd International Conference on Road and Rail Infrastructure CETRA 2014, Split/HR; 2014-04-28 - 2014-04-30; in: "Road and Rail Infrastructure III, Proceedings of the Conference CETRA 2014", S. Lakusic (ed.); Department of Transportation, University of Zagreb, Zagreb/HR (2014), ISSN: 1848-9842; 691 - 696.

I. Grujicic, G. Raidl, A. Schöbel, G. Besau:
"A metaheuristic approach for integrated timetable based design of railway infrastructure";
Talk: CETRA 2014, Split; 2014-04-28 - 2014-04-30; in: "Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014", S. Lakusic (ed.); (2014), ISSN: 1848-9850; 691 - 696.

S. Gupta, P. Jain, F. Panolan, S. Roy, S. Saurabh:
"Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms";
Talk: International Symposium on Algorithmic Game Theory, Aarhus, Denmark; 2021-09-21 - 2021-09-24; in: "International Symposium on Algorithmic Game Theory", LNCS / Springer, 12885 (2021), ISBN: 978-3-030-85946-6; 140 - 155.

T. Hamm:
"Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time";
Talk: International Symposium on Parameterized and Exact Computation (IPEC), München; 2019-09-11 - 2019-09-13; in: "14th International Symposium on Parameterized and Exact Computation", LIPIcs, 148 (2019), ISBN: 978-3-95977-129-0; 1 - 14.

T. Hamm, F. Klute, I. Parada:
"Extending to 1-plane drawings";
Talk: Spanish Meeting on Computational Geometry, Girona; 2019-07-01 - 2019-07-03; in: "Abstracts of the XVIII Spanish Meeting on Computational Geometry", (2019), 30 pages.

T. Hamm, M. Lackner, A. Rapberger:
"Computing Kemeny Rankings from d-Euclidean Preferences";
Talk: ADT 2021 - Algorithmic Decision Theory - 7th International Conference, Toulouse, France; 2021-11-03 - 2021-11-05; in: "Algorithmic Decision Theory - 7th International Conference, {ADT} 2021, Toulouse, France, November 3-5, 2021, Proceedings", (2021), 147 - 161.

W. Holly, T. Lauer, R. Pachler, F. Winter, C. Bacher, H. Schuemie, S. Murakami:
"Numerical Optimisation Approach for a Large Gas Engine Considering Different Fuel Gas Qualities";
Talk: 15^th Conference "The Working Process of the Internal Combustion Engine", Graz; 2015-09-24 - 2015-09-25; in: "Proceedings", (2015), 16 pages.

T. Horiyama, F. Klute, M. Korman, I. Parada, R. Uehara, K. Yamanaka:
"Efficient Segment Folding is Hard";
Talk: Canadian Conference on Computational Geometry, Edmonton, Alberta, Canada; 2019-08-08 - 2019-08-10; in: "Proceedings of the 31st Canadian Conference on Computational Geometry", (2019), 8 pages.

M. Horn, M. Djukanovic, C. Blum, G. Raidl:
"On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences";
Talk: International Conference Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "Optimization and Applications", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62866-6; 134 - 149.

M. Horn, N. Frohner, G. Raidl:
"Driver Shift Planning for an Online Store with Short Delivery Times";
Talk: International Conference on Industry 4.0 and Smart Manufacturing, virtual event; 2021-11-17 - 2021-11-19; in: "Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing", Elsevier, 180 (2021), ISSN: 1877-0509; 517 - 524.

M. Horn, G. Raidl:
"A∗-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem";
Talk: CPAIOR 2021 - 18th International Conference of Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Wien; 2021-07-05 - 2021-07-08; in: "International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research", LNCS / Springer, 12735 (2021), ISBN: 978-3-030-78229-0; 72 - 88.

M. Horn, G. Raidl:
"Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "Computer Aided System Theory - EUROCAST 2019", (2019), ISBN: 978-84-09-09208-6; 94 - 95.

M. Horn, G. Raidl, C. Blum:
"Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment";
Talk: International Workshop on Machine Learning, Optimization, and Big Data, Volterra, Italy; 2017-09-14 - 2017-09-17; in: "MOD 2017: Machine Learning, Optimization, and Big Data - Third International Conference", LNCS, 10710 (2017), ISBN: 978-3-319-72925-1; 506 - 518.

B. Hu, M. Leitner, G. Raidl:
"Computing generalized minimum spanning trees with variable neighborhood search.";
Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1.

B. Hu, W. Ölz, G. Raidl:
"A mixed integer model for the stamina-aware sightseeing tour problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 200 - 202.

B. Hu, G. Raidl:
"A memetic algorithm for the generalized minimum vertex-biconnected network problem";
Talk: Conference on Hybrid Intelligent Systems - HIS, Shenyang, China; 2009-08-12 - 2009-08-14; in: "9th International Conference on Hybrid Intelligent Systems - HIS 2009", (2009), 6 pages.

B. Hu, G. Raidl:
"An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 256 - 258.

B. Hu, G. Raidl:
"An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 287 - 294.

B. Hu, G. Raidl:
"An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Philadelphia, USA; 2012-07-07 - 2012-07-11; in: "Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation", (2012), 393 - 400.

B. Hu, G. Raidl:
"Effective neighborhood structures for the generalized traveling salesman problem";
Talk: 8th European Conference, EvoCOP 2008, Naples, Italy; 2008-03-26 - 2008-03-28; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2008", LNCS/Springer Berlin, 4972/2008/ Heidelberg (2008), ISSN: 0302-9743; 36 - 47.

B. Hu, G. Raidl:
"Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem";
Talk: Conference on Hybrid Intelligent Systems - HIS, Barcelona, Spanien; 2008-09-10 - 2008-09-12; in: "8th International Conference on Hybrid Intelligent Systems", (2008), 73 - 77.

B. Hu, G. Raidl:
"Variable neighborhood descent with self-adaptive neighborhood-ordering.";
Talk: 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics, Malaga; 2006-11-16 - 2006-11-17; in: "Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics", C. Cotta, A. Fernandez, J. Gallardo (ed.); Malaga, Spanien (2006).

B. Hu, A. Windbichler, G. Raidl:
"A New Solution Representation for the Firefighter Problem";
Talk: Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015, Kopenhagen, Dänemark; 2015-04-08 - 2015-04-10; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015", G. Ochoa, F. Chicano (ed.); 9026 (2015), ISBN: 978-3-319-16467-0; 25 - 35.

M. Hummel, F. Klute, S. Nickel, M. Nöllenburg:
"Maximizing Ink in Partial Edge Drawings of k-plane Graphs";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 323 - 336.

J. Inführ, G. Raidl:
"A memetic algorithm for the virtual network mapping problem";
Talk: Metaheuristics International Conference (MIC), Singapore; 2013-08-05 - 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference", (2013), Paper ID 28, 10 pages.

J. Inführ, G. Raidl:
"Automatic generation of 2-AntWars players with Genetic Programming";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 244 - 246.

J. Inführ, G. Raidl:
"Automatic generation of 2-antwars players with genetic programming";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 248 - 255.

J. Inführ, G. Raidl:
"GRASP and variable neighborhood search for the virtual network mapping problem";
Talk: International Workshop on Hybrid Metaheuristics (HM), Ischia, Italien; 2013-05-23 - 2013-05-25; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013", Lecture Notes in Computer Science, Volume 7919 (2013), ISBN: 978-3-642-38515-5; 159 - 173.

J. Inführ, G. Raidl:
"Introducing the virtual network mapping problem with delay, routing and location constraints";
Talk: International Network Optimization Conference (INOC), Hamburg, Deutschland; 2011-06-13 - 2011-06-16; in: "Network Optimization: 5th International Conference", (2011), ISBN: 978-3642215261; 105 - 117.

J. Inführ, G. Raidl:
"Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Wien; 2013-04-03 - 2013-04-05; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013", Lecture Notes in Computer Science, Volume 7832 (2013), ISBN: 978-3-642-37197-4; 250 - 261.

J. Inführ, D. Stezenbach, M. Hartmann, K. Tutschku, G. Raidl:
"Using optimized virtual network embedding for network dimensioning";
Talk: International Conference on Networked Systems, NetSys 2013, Stuttgart, Germany; 2013-03-11 - 2013-03-15; in: "Proceedings of Networked Systems 2013", IEEE Computer Society, (2013), ISBN: 978-0-7695-4950-7; 118 - 125.

P. Jahrmann, G. Raidl:
"Clique and independent set based grasp approaches for the regenerator location problem";
Talk: Metaheuristics International Conference (MIC), Singapore; 2013-08-05 - 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference", (2013), 1 - 10.

T. Jatschka, T. Rodemann, G. Raidl:
"A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Leipzig, Germany; 2019-04-24 - 2019-04-26; in: "Evolutionary Computation in Combinatorial Optimization 2019", Lecture Notes in Computer Science, 11452 (2019), ISBN: 978-3-030-16711-0; 1 - 16.

T. Jatschka, T. Rodemann, G. Raidl:
"Distributing Battery Swapping Stations for Electric Scooters in an Urban Area";
Talk: International Conference Optimization and Applications, Moscow, Russia; 2020-09-28 - 2020-10-02; in: "Optimization and Applications", LNCS / Springer, 12422 (2020), ISBN: 978-3-030-62867-3; 150 - 165.

T. Jatschka, T. Rodemann, G. Raidl:
"Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications";
Talk: International Conference on Machine Learning, Optimization, and Data Science, Certosa di Pontignano, Siena, Italy; 2019-09-10 - 2019-09-13; in: "Machine Learning, Optimization, and Data Science", Lecture Notes in Computer Science, 11943 (2019), ISBN: 978-3-030-37599-7; 738 - 750.

T. Jatschka, T. Rodemann, G. Raidl:
"VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Las Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019", IUCTC Universidad de Las Palmas de Gran Canaria, (2019), ISBN: 978-84-09-09208-6; 70 - 71.

T. Jatschka, T. Rodemann, G. Raidl:
"VNS and PBIG as Optimization Cores in aCooperative Optimization Approach forDistributing Service Points";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), lLas Palmas de Gran Canaria, Spain; 2019-02-17 - 2019-02-22; in: "Computer Aided Systems Theory - EUROCAST 2019", LNCS, 12013 (2020), ISBN: 978-3-030-45092-2; 255 - 262.

Th. Kaufmann, M. Horn, G. Raidl:
"A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem";
Talk: International Conference on Parallel Problem Solving From Nature (PPSN), Leiden, The Netherlands; 2020-09-05 - 2020-09-09; in: "Parallel Problem Solving from Nature - PPSN XVI", LNCS / Springer, 12270 (2020), ISBN: 978-3-030-58115-2; 385 - 398.

A. Kerren:
"Exploratives Lernen durch partiell generierte Lehr- und Lernsoftware";
Talk: Workshop Grundfragen multimedialer Lehre (GML 03), Potsdam; 2003-03-10 - 2003-03-11; in: "Tagungsband zum Workshop Grundfragen multimedialer Lehre (GML '03)", A. Schwill (ed.); (2003), ISBN: 3-8330-0761-3; 153 - 163.

P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber:
"Lombardi Drawings of Knots and Links";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 113 - 126.

M. Kirchweger, S. Szeider:
"SAT Modulo Symmetries for Graph Generation";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Montpellier, France; 2021-10-25 - 2021-10-29; in: "27th International Conference on Principles and Practice of Constraint Programming (CP 2021)", LIPICS, 210 (2021), ISBN: 978-3-95977-211-2; 1 - 16.

G.W. Klau, I. Ljubic, P. Mutzel, U. Pferschy, R. Weiskircher:
"The Fractional Prize-Collecting Steiner Tree Problem on Trees";
Talk: 11^th Annual European Symposium on Algorithms (ESA 2003), Budapest, Hungary; 2003-09-16 - 2003-09-19; in: "Algorithms - ESA 2003", G. Di Battista, U. Zwick (ed.); Springer, LNCS 2832 (2003), ISBN: 3-540-20064-9; 691 - 702.

J. Klawitter, T. Mchedlidze, M. Nöllenburg:
"Experimental Evaluation of Book Drawing Algorithms";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 224 - 238.

B. Klocker, H. Fleischner, G. Raidl:
"A SAT Approach for Finding Sup-Transition-Minors";
Talk: Learning and Intelligent OptimizatioN Conference LION, Chania, Crete, Greece; 2019-05-27 - 2019-05-31; in: "Learning and Intelligent Optimization", LNCS, 11968 (2019), ISBN: 978-3-030-38628-3; 325 - 341.

B. Klocker, H. Fleischner, G. Raidl:
"Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers";
Talk: International Workshop on Hybrid Metaheuristics (HM), Plymouth, United Kingdom; 2016-06-08 - 2016-06-10; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics", LNCS, 9668 (2016), ISBN: 978-3-319-39635-4; 87 - 103.

C. Kloimüllner, P. Papazek, B. Hu, G. Raidl:
"Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Granada; 2014-04-23 - 2014-04-25; in: "Evolutionary Computation in Combinatorial Optimization", C. Blum, G. Ochoa (ed.); Springer Berlin Heidelberg, 8600 (2014), ISBN: 978-3-662-44319-4; 73 - 84.

C. Kloimüllner, P. Papazek, G. Raidl, B. Hu:
"A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia et al. (ed.); (2015), ISBN: 978-84-606-5438-4; 125 - 126.

C. Kloimüllner, G. Raidl:
"Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Amsterdam; 2017-04-19 - 2017-04-21; in: "Evolutionary Computation in Combinatorial Optimization", Evolutionary Computation in Combinatorial Optimization, (2017), ISBN: 978-3-319-55452-5; 91 - 107.

C. Kloimüllner, G. Raidl:
"Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem";
Talk: Conference Proceedings of Learning and Intelligent Optimization Conference, onference Proceedings of Learning and Intelligent Optimization Conference; 2017-06-19 - 2017-06-21; in: "Conference Proceedings of Learning and Intelligent Optimization Conference", (2017), ISBN: 978-3-319-69404-7; 1 - 16.

F. Klute:
"Robust Genealogy Drawings";
Poster: International Symposium on Graph Drawing and Network Visualization (GD), Athen, Griechenland; 2016-09-19 - 2016-09-21; in: "Graph Drawing and Network Visualization: 24th International Symposium, GD 2016", LNCS, (2016), ISBN: 978-3-319-50105-5; 637 - 639.

F. Klute, G. Li, R. Löffler, M. Nöllenburg, M. Schmidt:
"Exploring Semi-Automatic Map Labeling";
Talk: ACM SIGSPATIAL international conference on Advances in geographic information systems, Chicago, USA; 2019-11-05 - 2019-11-08; in: "Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems", (2019), ISBN: 978-1-4503-6909-1; 13 - 22.

F. Klute, M. Nöllenburg:
"Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts";
Talk: International Symposium on Computational Geometry (SoCG), Budapest; 2018-06-11 - 2018-06-14; in: "34th International Symposium on Computational Geometry", B. Speckmann, C. Tóth (ed.); LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 99 (2018), ISBN: 978-3-95977-066-8; 53:1 - 53:14.

F. Klute, M. Nöllenburg:
"Towards Characterizing Strict Outerconfluent Graphs";
Poster: International Symposium on Graph Drawing and Network Visualization (GD), Boston; 2017-09-25 - 2017-09-27; in: "Graph Drawing and Network Visualization (GD 2017)", F. Frati, K.-L. Ma (ed.); Springer Lecture Notes in Computer Science, 10692 (2018), ISBN: 978-3-319-73914-4; 612 - 614.

M. Kotrbcık, R. Kralovic, S. Ordyniak:
"Edge-Editing to a Dense and a Sparse Graph Class";
Talk: Latin American Theoretical Informatics Symposium, Ensenada, Mexico; 2016-04-11 - 2016-04-15; in: "Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium", (2016), ISBN: 978-3-662-49528-5; 562 - 575.

L. Kovacs, Hanna Lachnitt, S. Szeider:
"Formalizing Graph Trail Properties in Isabelle/HOL";
Talk: International Conference on Intelligent Computer Mathematics (CICM), Bertinoro, Forli, Italy; 2020-07-26 - 2020-07-31; in: "CICM 2020: Intelligent Computer Mathematics", LNCS, 12236 (2020), ISBN: 978-3-030-53518-6; 190 - 205.

S. Kratsch, T. Masarík, I. Muzi, M. Pilipczuk, M. Sorge:
"Optimal Discretization is Fixed-parameter Tractable";
Talk: ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, Virginia, U.S.; 2021-01-10 - 2021-01-13; in: "Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)", ACM, (2021), ISBN: 978-1-61197-646-5; 1702 - 1720.

T. Krenek, M. Ruthmair, G. Raidl, M. Planer:
"Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles";
Talk: EvoStar, Malaga, Spain; 2012-04-11 - 2012-04-13; in: "Applications of Evolutionary Computation - EvoApplications 2012", volume 7248 of LNCS (2012), ISBN: 978-3-642-29177-7; 376 - 385.

M. Leitner, B. Hu, G. Raidl:
"Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem";
Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007).

M. Leitner, G. Raidl:
"A lagrangian decomposition based heuristic for capacitated connected facility location";
Talk: Metaheuristic International Conference (MIC), Hamburg; 2009-07-13; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)", (2009).

M. Leitner, G. Raidl:
"Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks";
Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 158 - 174.

M. Leitner, G. Raidl:
"Strong lower bounds for a survivable network design problem";
Talk: International Symposium on Combinatorial Optimization (ISCO), Hammamet, Tunesien; 2010-03-24 - 2010-03-26; in: "ISCO 2010 - International Symposium on Combinatorial Optimization", 36 (2010), 295 - 302.

M. Leitner, G. Raidl:
"Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", Volume 6927 (2011), ISBN: 978-3-642-27548-7; 295 - 302.

M. Leitner, G. Raidl:
"Variable neighborhood search for a prize collecting capacity constrained connected facility location problem";
Talk: 2008 International Symposium on Applications and the Internet SAINT 2008, Turku, Finland; 2008-07-28 - 2008-08-01; in: "Proceedings of the 2008 International Symposium on Applications and the Internet", IEEE Computer Society, (2008), ISBN: 978-0-7695-3297-4; 233 - 236.

M. Leitner, G. Raidl:
"Variable neighborhood search for capacitated connected facility location";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 261 - 263.

M. Leitner, G. Raidl, U. Pferschy:
"Accelerating column generation for a survivable network design problem";
Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 8 pages.

M. Leitner, M. Ruthmair, G. Raidl:
"Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem";
Talk: International Network Optimization Conference (INOC), Hamburg, Deutschland; 2011-06-13 - 2011-06-16; in: "Network Optimization: 5th International Conference, INOC 2011", (2011), 124 - 138.

M. Leitner, M. Ruthmair, G. Raidl:
"Stabilized column generation for the rooted delay-constrained Steiner tree problem";
Talk: Workshop on Applied Combinatorial Optimization (ALIO/EURO), Porto, Portugal; 2011-05-04 - 2011-05-06; in: "Proceedings of the VII ALIO/EURO - Workshop on Applied Combinatorial Optimization", (2011), 250 - 253.

S. Li, M. Pilipczuk, M. Sorge:
"Cluster Editing Parameterized Above Modification-Disjoint P3-Packings";
Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Saarbrücken (Germany); 2021-03-16 - 2021-03-19; in: "38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)", LIPICS, 187 (2021), ISBN: 978-3-95977-180-1; 1 - 16.

Z. Liu, L. Chew, M. Heule:
"Avoiding Monochromatic Rectangles Using Shift Patterns";
Talk: International Symposium on Combinatorial Search, Jinan, China; 2021-07-26 - 2021-07-30; in: "Proceedings of the Fourteenth International Symposium on Combinatorial Search", AAAI Press, 12 (2021), ISBN: 978-1-57735-870-1; 225 - 227.

E. Lizarraga, M. Blesa, C. Blum, G. Raidl:
"On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics";
Talk: INISTA 2015, Madrid, Spain; 2015-08-02 - 2015-08-05; in: "Innovations in Intelligent Systems and Applications (INISTA), 2015 International Symposium on", D. Camacho et al. (ed.); (2015), ISBN: 978-1-4673-7751-5; 1 - 8.

I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti:
"Solving the prize-collecting Steiner tree problem to optimality.";
Talk: ALENEX 2005 (Seventh Workshop on Algorithm Engineering and Experiments), Vancouver, Kanada; 2005-01-22; in: "Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO)", SIAM, (2005), ISBN: 0-89871-596-2.

N. Lodha, S. Ordyniak, S. Szeider:
"A SAT Approach to Branchwidth";
Talk: Theory and Application of Satisfiability Testing -- SAT, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016", (2016), ISBN: 978-3-319-40969-6; 179 - 195.

N. Lodha, S. Ordyniak, S. Szeider:
"A SAT Approach to Branchwidth";
Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia (invited); 2017-08-19 - 2017-08-25; in: "Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017)", (2017), 4894 - 4898.

D. Markvica, C. Schauer, G. Raidl:
"Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia et al. (ed.); (2015), ISBN: 978-84-606-5438-4; 113 - 114.

J. Maschler, T. Hackl, M. Riedler, G. Raidl:
"An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem";
Talk: Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences, Metaheuristics: Proceeding of the MIC and MAEB 2017 Conferences; 2017-07-04 - 2017-07-07; in: "http://mic2017.upf.edu/proceedings/", (2017), 463 - 472.

J. Maschler, G. Raidl:
"A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem";
Talk: International Conference of the German, Austrian and Swiss Operations Research Societies, Wien; 2015-09-01 - 2015-09-04; in: "Operations Research Proceedings 2015 Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies", (2016), ISBN: 978-3-319-42901-4; 85 - 102.

J. Maschler, G. Raidl:
"Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem";
Talk: Patat2018, Wien; 2018-08-28 - 2018-08-31; in: "PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling}", (2018), 375 - 397.

J. Maschler, M. Riedler, G. Raidl:
"Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments";
Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 106 - 107.

J. Maschler, M. Riedler, M. Stock, G. Raidl:
"Particle Therapy Patient Scheduling: First Heuristic Approaches";
Talk: International Conference of the Practice and Theory of Automated Timetabling (PATAT), Udine, Italien; 2016-08-23 - 2016-08-26; in: "PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling", (2016), ISBN: 978-0-9929984-1-7; 223 - 244.

A. Mayer, C. Nothegger, A Chwatal, G. Raidl:
"Solving the post enrolment course timetabling problem by ant colony optimization";
Talk: PATAT 2008, Montreal, Canada; 2008-08-18 - 2008-08-22; in: "Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling", (2008), 13 pages.

S. Mengel, F. Slivovsky:
"Proof Complexity of Symbolic QBF Reasoning";
Talk: International Conference on the Theory and Applications of Satisfiability Testing, Barcelona, Spanien; 2021-07-05 - 2021-07-09; in: "Theory and Applications of Satisfiability Testing - SAT 2021", LNCS / Springer, 12831 (2021), ISBN: 978-3-030-80222-6; 399 - 416.

S. Miskovic, Z. Stanimirovic, I. Grujicic:
"An Efficient Variable Neighborhood Search for Solving a Robust Dynamic Facility Location Problem in Emergency Service Network";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search (VNS'14), volume 47 of Electronic Notes in Discrete Mathematics, Elsevier.", B. Jarboui, A. Sifaleras, A. Rebai (ed.); 47 (2014), 261 - 268.

P. Mutzel, I. Pouchkarev, B. Reitgruber, B. Schuhmacher:
"ArchEd: An Interactive Tool for Visualizing Harris Matrices";
Talk: Archäologie und Computer, Wien; 2001-11-05 - 2001-11-06; in: "Archäologie und Computer, Workshop 6", Phoibos Verlag, (2001).

S. Nickel, M. Nöllenburg:
"Towards Data-Driven Multilinear Metro Maps";
Talk: International Conference on Theory and Application of Diagrams, Tallinn, Estonia; 2020-08-24 - 2020-08-28; in: "Proceedings International Conference on Theory and Application of Diagrams", LNAI, 12169 (2020), ISBN: 978-3-030-54248-1; 153 - 161.

S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S.G. Kobourov, J. Peltonen, M. Nöllenburg:
"Computing Stable Demers Cartograms";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Prag; 2019-09-17 - 2019-09-20; in: "GD 2019: Graph Drawing and Network Visualization", LNCS, 11904 (2019), ISBN: 978-3-030-35801-3; 46 - 60.

B. Niedermann, M. Nöllenburg:
"An Algorithmic Framework for Labeling Road Maps";
Talk: International Conference on Geographic Information Science, Montreal, Canada; 2016-09-27 - 2016-09-30; in: "Geographic Information Science 9th International Conference", (2016), ISBN: 978-3-319-45737-6; 308 - 322.

M. Nöllenburg, L. Barth, B. Niedermann, A. Gemsa:
"On the Readability of Boundary Labeling";
Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 515 - 527.

M. Nöllenburg, J. Klawitter, T. Ueckerdt:
"Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem";
Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 231 - 244.

M. Nöllenburg, B. Klemz, R. Prutkin:
"Recognizing Weighted Disk Contact Graphs";
Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 433 - 446.

M. Nöllenburg, I. Kostitsyna, V. Polishchuk, A. Schulz, D. Strash:
"On Minimizing Crossings in Storyline Visualizations";
Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", E. Di Giacomo, A. Lubiw (ed.); Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 192 - 198.

M. Nöllenburg, H. Meyerhenke, C. Schulz:
"Drawing Large Graphs by Multilevel Maxent-Stress Optimization";
Talk: Graph Drawing and Network Visualization (GD´15), Los Angeles, USA; 2015-09-24 - 2015-09-26; in: "Graph Drawing and Network Visualization (GD'15)", Springer, LNCS 9411 (2015), ISBN: 978-3-319-27260-3; 30 - 43.

M. Nöllenburg, R. Prutkin, I. Rutter:
"Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions";
Talk: Algorithms and Computation (ISAAC´15), Nagoya, Japan; 2015-12-09 - 2015-12-11; in: "Algorithms and Computation", K. Elbassioni, K. Makino (ed.); LNCS, 9472 (2015), ISBN: 978-3-662-48971-0; 637 - 649.

M. Nöllenburg, I. Rutter, A. Schuhmacher:
"Software Visualization via Hierarchic Micro/Macro Layouts";
Talk: The International Conference on Information Visualization Theory and Applications IVAPP, Rom; 2016-02-27 - 2016-02-29; in: "Information Visualization Theory and Applications Conf IVAPP 2016", (2016), ISBN: 978-989-758-175-5; 153 - 160.

M. Nöllenburg, A. Villedieu, J. Wulms:
"Layered Area-Proportional Rectangle Contact Representations";
Talk: International Symposium on Graph Drawing and Network Visualization (GD), Tübingen, Germany; 2021-09-14 - 2021-09-17; in: "International Symposium on Graph Drawing and Network Visualization-GD2021", LNCS / Springer, 12868 (2021), ISBN: 978-3-030-92930-5; 318 - 326.

H. Obweger, M. Suntinger, J. Schiefer, G. Raidl:
"Similarity searching in sequences of complex events";
Talk: International Conference on Research Challenges in Information Science (RCIS), Nizza, Frankreich; 2010-05-19 - 2010-05-21; in: "Proceedings of the Fourth International Conference on Research Challenges in Information Science - RCIS 2010", (2010), 631 - 639.

S. Ordyniak, S. Szeider:
"Parameterized Complexity of Small Decision Tree Learning";
Talk: 35th AAAI 2021, virtual event; 2021-02-02 - 2021-02-09; in: "Thirty-Fifth AAAI Conference on Artificial Intelligence", AAAI Press, 35 (2021), ISBN: 978-1-57735-866-4; 1 - 9.

A. Pagacz, B. Hu, G. Raidl:
"A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem";
Talk: International Conference on INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS, Thessaloniki, Greece; 2010-11-24 - 2010-11-26; in: "2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design", (2010), 356 - 361.

P. Papazek, C. Kloimüllner, B. Hu, G. Raidl:
"Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid.";
Talk: Parallel Problem solving from Nature - PPSN XIII, Ljubljana; 2014-09-13 - 2014-09-17; in: "Parallel Problem Solving from nature - PPSN XIII", T. Bartz - Beielstein, J. Branke, B. Filipic, J. Smith (ed.); Lecture Notes in Computer Science, Springer International Publishing, 8672 (2014), ISBN: 978-3-319-10761-5; 792 - 801.

P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu:
"A pilot/vnd/grasp hybrid for balancing bicycle sharing systems";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 223 - 225.

T. Peitl, F. Slivovsky, S. Szeider:
"Combining Resolution-Path Dependencies with Dependency Learning";
Talk: Int. Conference on Theory and Applications of Satisfiability Testing, Lissabon; 2019-07-07 - 2019-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2019", LNCS, 11628 (2019), ISBN: 978-3-030-24257-2; 306 - 318.

T. Peitl, F. Slivovsky, S. Szeider:
"Long Distance Q-Resolution with Dependency Schemes";
Talk: Theory and Application of Satisfiability Testing -- SAT, Bordeaux, France; 2016-07-05 - 2016-07-08; in: "Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016", (2016), ISBN: 978-3-319-40969-6; 500 - 518.

T. Peitl, F. Slivovsky, S. Szeider:
"Proof Complexity of Fragments of Long-Distance Q-Resolution";
Talk: Theory and Application of Satisfiability Testing -- SAT, Lissabon; 2019-07-07 - 2019-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2019", Lecture Notes in Computer Science, 11628 (2019), ISBN: 978-3-030-24257-2; 319 - 335.

T. Peitl, S. Szeider:
"Finding the Hardest Formulas for Resolution";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Louvain-la-Neuve, Belgium; 2020-09-07 - 2020-09-11; in: "CP 2020: Principles and Practice of Constraint Programming", LNCS, 12333 (2020), ISBN: 978-3-030-58474-0; 514 - 530.

T. Peitl, S. Szeider:
"Finding the Hardest Formulas for Resolution (Extended Abstract)";
Talk: IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada; 2021-08-19 - 2021-08-27; in: "Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)", (2021), ISBN: 978-0-9992411-9-6; 4814 - 4818.

M. Pimmer, G. Raidl:
"A timeslot-filling based heuristic approach to construct high-school timetables";
Talk: Metaheuristic International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 349 - 358.

S. Pirkwieser, G. Raidl:
"A column generation approach for the periodic vehicle routing problem with time windows";
Talk: International Network Optimization Conference (INOC), Pisa; 2009-04-26 - 2009-04-29; in: "Proceedings of the International Network Optimization Conference 2009", (2009), 6 pages.

S. Pirkwieser, G. Raidl:
"A variable neighborhood search for the periodic vehicle routing problem with time windows";
Talk: EU/MEeting, Troyes, Frankreich; 2008-10-23 - 2008-10-24; in: "Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing", (2008).

S. Pirkwieser, G. Raidl:
"Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques";
Talk: Metaheuristic International Conference (MIC), Hamburg, Deutschland; 2009-07-13 - 2009-07-16; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)", (2009), 10 pages.

S. Pirkwieser, G. Raidl:
"Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Atlanta, USA; 2008-07-12 - 2008-07-16; in: "Proceedings of the 10th annual conference on Genetic and evolutionary computation", (2008), 323 - 330.

S. Pirkwieser, G. Raidl:
"Matheuristics for the periodic vehicle routing problem with time windows";
Talk: International Workshop on Model-Based Metaheuristics, Wien; 2010-06-28 - 2010-06-30; in: "Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics,", (2010), 83 - 95.

S. Pirkwieser, G. Raidl:
"Multilevel variable neighborhood search for periodic routing problems";
Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 226 - 238.

S. Pirkwieser, G. Raidl:
"Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows";
Talk: International Workshop on Hybrid Metaheuristics (HM), Udine, Italien; 2009-10-16 - 2009-10-17; in: "Proceedings of Hybrid Metaheuristics - Sixth International Workshop", (2009), 45 - 59.

S. Pirkwieser, G. Raidl:
"Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem";
Talk: International Workshop on Hybrid Metaheuristics (HM), Wien; 2010-10-01 - 2010-10-02; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010", (2010), 174 - 189.

S. Pirkwieser, G. Raidl, J. Gottlieb:
"Improved packing and routing of vehicles with compartments";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", volume 6927 of LNCS (2012), ISBN: 978-3642275487; 392 - 399.

S. Pirkwieser, G. Raidl, J. Gottlieb:
"Tackling the loading aspect of the vehicle routing problem with compartments";
Talk: Metaheuristics International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 679 - 681.

S. Pirkwieser, G. Raidl, J. Puchinger:
"Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem";
Talk: EvoCOP 2007 - Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, Valencia, Spanien; 2007-04-11 - 2007-04-13; in: "Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings", (2007), ISBN: 978-3540716143; 176 - 187.

P. Pop, B. Hu, G. Raidl:
"A memetic algorithm for the partition graph coloring problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2013-02-10 - 2013-02-15; in: "Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory", (2013), ISBN: 978-84-695-6971-9; 167 - 169.

M. Prandtstetter, B. Biesinger, B. Hu, P. Nolz, M. Reinthaler, J. Zajicek, A. Angelini, G. Hauger et al.:
"On the Potentials and Dilemmas of Cooperative/White-Label Deliveries based on Selected Austrian Demonstration Cases";
Talk: 6th International Physical Internet Conference IPIC 2019, London; 2019-07-09 - 2019-07-11; in: "Proceedings of the 6th International Physical Internet Conference IPIC 2019", London (2019), 1 - 7.

M. Prandtstetter, G. Raidl:
"A variable neihborhood search approach for solving the car sequencing problem.";
Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1.

M. Prandtstetter, G. Raidl:
"Combining forces to reconstruct strip shredded text documents";
Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 175 - 189.

M. Prandtstetter, G. Raidl:
"Meta-heuristics for reconstructing cross cut shredded text documents";
Talk: GECCO: Genetic and Evolutionary Computation Conference, Montreal, Kanada; 2009-07-08 - 2009-07-12; in: "Proceedings of the 11th annual conference on Genetic and evolutionary computation", (2009), 8 pages.

M. Prandtstetter, G. Raidl, T. Misar:
"A hybrid algorithm for computing tours in a spare parts warehouse";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Tübingen, Deutschland; 2009-04-15 - 2009-04-17; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009", Springer, (2009), 25 - 36.

M. Prischink, C. Kloimüllner, B. Biesinger, G. Raidl:
"Districting and Routing for Security Control";
Talk: International Workshop on Hybrid Metaheuristics (HM), Plymouth, United Kingdom; 2016-06-08 - 2016-06-10; in: "Hybrid Metaheuristics - 10th International Workshop on Hybrid Metaheuristics", LNCS, 9668 (2016), ISBN: 978-3-319-39636-1; 87 - 103.

J. Puchinger, G. Raidl:
"Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification.";
Talk: IWINAC 2005 (First International Work-Conference on the Interplay Between Natural and Artificial Computation), Canary Islands, Spanien; 2005-06-15 - 2005-06-18; in: "Artifical Intelligence and Knowledge Engineering Applications: A Bioinspired Approach", J. Mira (ed.); Springer, Lecture Notes in Computer Science 3562 (2005), ISBN: 3-540-26319-5; 41 - 53.

J. Puchinger, G. Raidl:
"Relaxation guided variable neighborhood search.";
Talk: MECVNS 2005 (XVIII Mini EURO Conference on VNS), Teneriffa, Spanien; 2005-11-23 - 2005-11-25; in: "Proceedings of the XVIII Mini EURO Conference on VNS", P. Hansen et al. (ed.); (2005), ISBN: 84-689-5679-1.

J. Puchinger, G. Raidl, M. Gruber:
"Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem.";
Talk: MIC2005 (The 6th Metaheuristics International Conference), Wien; 2005-08-22 - 2005-08-26; in: "Proceedings of MIC2005, the 6th Metaheuristics International Conference", (2005).

J. Puchinger, G. Raidl, U. Pferschy:
"The core concept for the multidimensional knapsack problem.";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Budapest, Ungarn; 2006-04-10 - 2006-04-12; in: "Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS", J. Gottlieb, G. Raidl (ed.); Springer, Heidelberg (2006), ISBN: 978-3-540-33178-0; 195 - 208.

A. Rai, M. S. Ramanujan, S. Saurabh:
"A Parameterized Algorithm for Mixed-Cut";
Talk: Latin American Theoretical Informatics Symposium, Ensenada, Mexico; 2016-04-11 - 2016-04-15; in: "Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium", (2016), ISBN: 978-3-662-49528-5; 672 - 685.

G. Raidl:
"A unified view on hybrid metaheuristics.";
Talk: International Workshop on Hybrid Metaheuristics (HM), Gran Canaria, Spanien; 2006-10-13 - 2006-10-15; in: "Hybrid Metaheuristics - Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings", F. Almeida et al. (ed.); Springer, Heidelberg (2006), ISBN: 978-3-540-46384-9; 1 - 12.

G. Raidl, T. Baumhauer, B. Hu:
"Boosting an exact logic-based benders decomposition approach by variable neighborhood search.";
Talk: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien; 2014-10-08 - 2014-10-11; in: "Proceedings of the 3rd International Conference on Variable Neighborhood Search", B. Jarboui, A. Sifaleras, A. Rebai (ed.); Elsevier Electronic Notes in Discrete Mathematics, 47 (2015), 149 - 156.

G. Raidl, T. Baumhauer, B. Hu:
"Speeding up logic-based benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem.";
Talk: International Workshop on Hybrid Metaheuristics 2014 - HM 2014, Hamburg; 2014-06-11 - 2014-06-13; in: "Hybrid Metaheuristics, 9th Int. Workshop, HM 2014", M. Blesa, C. Blum, S. Voß (ed.); (2014), ISBN: 978-3-319-07643-0; 183 - 197.

G. Raidl, A Chwatal:
"Fingerprint template compression by solving a minimum label $k$-node subtree problem";
Talk: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM), Korfu, Griechenland; 2007-09-16 - 2007-09-20; in: "International Conference of Numerical Analysis and Applied Mathematics", (2007), ISBN: 978-0-7354-0447-2; 444 - 447.

G. Raidl, M. Gruber:
"A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem";
Talk: International Conference of Numerical Analysis and Applied Mathematics (ICNAAM), Korfu, Griechenland; 2008-09-16 - 2008-09-20; in: "Proceedings of the International Conference on Numerical Analysis and Applied Mathematics", (2008), 446 - 449.

G. Raidl, B. Hu:
"Enhancing genetic algorithms by a trie-based complete solution archive";
Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 239 - 251.

G. Raidl, B. Hu, M. Rainer-Harbach, P. Papazek:
"Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations";
Talk: International Workshop on Hybrid Metaheuristics (HM), Ischia, Italien; 2013-05-23 - 2013-05-25; in: "Hybrid Metaheuristics, 8th Int. Workshop, HM 2013", Volume 7919 (2013), ISBN: 978-3-642-38515-5; 130 - 143.

G. Raidl, T. Jatschka, M. Riedler, J. Maschler:
"Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics";
Talk: International Workshop on Model-Based Metaheuristics, Brüssel, Belgien; 2016-09-04 - 2016-09-07; in: "Proceedings of the Sixth International Workshop on Model-based Metaheuristics", (2016), 104 - 107.

M. Rainer-Harbach, P. Papazek, B. Hu, G. Raidl:
"Balancing bicycle sharing systems: A variable neighborhood search approach";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Wien; 2013-04-03 - 2013-04-05; in: "Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013", Volume 7832 (2013), ISBN: 978-3-642-37197-4; 121 - 132.

M. S. Ramanujan:
"A Faster Parameterized Algorithm for Group Feedback Edge Set";
Talk: International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Istanbul, Türkei; 2016-06-22 - 2016-06-24; in: "Graph-Theoretic Concepts in Computer Science", (2016), ISBN: 978-3-662-53535-6; 269 - 281.

M. S. Ramanujan, S. Szeider:
"Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable";
Talk: Thirty-First AAAI Conference on Artificial Intelligence, Thirty-First AAAI Conference on Artificial Intelligence (invited); 2017-02-04 - 2017-02-09; in: "Thirty-First AAAI Conference on Artificial Intelligence", (2017), 3929 - 3935.

V. Ramaswamy, S. Szeider:
"MaxSAT-Based Postprocessing for Treedepth";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Louvain-la-Neuve, Belgium; 2020-09-07 - 2020-09-11; in: "CP 2020: Principles and Practice of Constraint Programming", LNCS, 12333 (2020), ISBN: 978-3-030-58474-0; 478 - 495.

V. Ramaswamy, S. Szeider:
"Turbocharging Treewidth-Bounded Bayesian Network Structure Learning";
Talk: 35th AAAI 2021, virtual event; 2021-02-02 - 2021-02-09; in: "Thirty-Fifth AAAI Conference on Artificial Intelligence", AAAI Press, 35 (2021), ISBN: 978-1-57735-866-4; 3895 - 3903.

F. Reichl, F. Slivovsky, S. Szeider:
"Certified DQBF Solving by Definition Extraction";
Talk: Int. Conference on Theory and Applications of Satisfiability Testing, Barcelona, Spanien; 2021-07-05 - 2021-07-09; in: "Theory and Applications of Satisfiability Testing - SAT 2021", LNCS / Springer, 12831 (2021), ISBN: 978-3-030-80222-6; 499 - 517.

A. Rendl, M. Prandtstetter, G. Hiermann, J. Puchinger, G. Raidl:
"A hybrid heuristic for multimodal homecare scheduling";
Talk: International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, Nantes, Frankreich; 2012-05-28 - 2012-06-01; in: "Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems", volume 7298 of LNCS (2012), ISBN: 978-3-642-29827-1; 339 - 355.

M. Riedler, M. Ruthmair, G. Raidl:
"Strategies for Iteratively Refining Layered Graph Models";
Talk: International Workshop on Hybrid Metaheuristics (HM), Concepcion, Chile; 2019-01-16 - 2019-01-18; in: "Hybrid Metaheuristics: 11th International Workshop", Lecture Notes in Computer Science, 11299 (2019), ISBN: 978-3-030-05982-8; 46 - 62.

U. Ritzinger, M. Prandtstetter, G. Raidl:
"Computing optimized stock (re-)placements in last-in, first-out warehouses";
Talk: Logistik Management, Hamburg, Deutschland; 2009-09-02 - 2009-09-04; in: "Logistik Management", (2009), ISBN: 978-3-7908-2361-5; 279 - 298.

M. Ruthmair, A. Hubmer, G. Raidl:
"Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory", (2011), ISBN: 978-84-693-9560-8; 285 - 287.

M. Ruthmair, G. Raidl:
"A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria; 2009-02-15 - 2009-02-20; in: "Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)", (2009), 244 - 246.

M. Ruthmair, G. Raidl:
"A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spanien; 2009-02-15 - 2009-02-20; in: "Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of LNCS", (2009), ISBN: 978-3-642-04771-8; 713 - 720.

M. Ruthmair, G. Raidl:
"A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems";
Talk: Conference on Integer Programming and Combinatorial Optimization (IPCO), New York, USA; 2011-06-15 - 2011-06-17; in: "Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV)", (2011), 376 - 388.

M. Ruthmair, G. Raidl:
"A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem";
Talk: International Conference on Computer Aided Systems Theory (Eurocast), Gran Canaria, Spain; 2011-02-06 - 2011-02-11; in: "Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I", (2011), ISBN: 978-84-693-9560-8; 351 - 358.

M. Ruthmair, G. Raidl:
"On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem";
Talk: International Symposium on Combinatorial Optimization (ISCO), Athen, Griechenland; 2012-04-17 - 2012-04-21; in: "Proceedings of the 2nd International Symposium on Combinatorial Optimization", volume 7422 of LNCS (2012), ISBN: 978-3-642-32146-7; 225 - 236.

M. Ruthmair, G. Raidl:
"Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem";
Talk: International Conference on Parallel Problem Solving From Nature (PPSN), Krakow, Poland; 2010-09-11 - 2010-09-15; in: "Parallel Problem Solving from Nature - PPSN XI", (2010), 391 - 400.

C. Schauer, M. Prandtstetter, G. Raidl:
"A memetic algorithm for reconstructing cross-cut shredded text documents";
Talk: International Workshop on Hybrid Metaheuristics (HM), Wien; 2010-10-01 - 2010-10-02; in: "Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010", (2010), 103 - 117.

C. Schauer, G. Raidl:
"A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design";
Talk: International Network Optimization Conference (INOC), Warschau, Polen; 2015-05-18 - 2015-05-20; in: "Proceedings of INOC 2015 - 7th International Network Optimization Conference", (2016), ISSN: 1571-0653; 189 - 196.

C. Schauer, G. Raidl:
"Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem";
Talk: Eurocast 2015, Gran Canaria, Spain; 2015-02-08 - 2015-02-13; in: "Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory", A. Quesada-Arencibia (ed.); (2015), ISBN: 978-84-606-5438-4; 81 - 82.

C. Schauer, G. Raidl:
"Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design";
Poster: International Conference on Parallel Problem Solving From Nature (PPSN), Taormina, Italien; 2012-09-01 - 2012-09-05; in: "Parallel Problem Solving from Nature-PPSN XII", volume 7491 of LNCS (2012), ISBN: 978-3-642-32936-4; 458 - 467.

A. Schidler, S. Szeider:
"Computing Optimal Hypertree Decompositions";
Talk: Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, USA; 2020-01-05 - 2020-01-06; in: "Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)", siam, (2020), ISBN: 978-1-61197-600-7; 1 - 11.

A. Schidler, S. Szeider:
"Computing Optimal Hypertree Decompositions with SAT";
Talk: IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada; 2021-08-19 - 2021-08-27; in: "Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21)", (2021), ISBN: 978-0-9992411-9-6; 1418 - 1424.

A. Schidler, S. Szeider:
"SAT-based Decision Tree Learning for Large Data Sets";
Talk: 35th AAAI 2021, virtual event; 2021-02-02 - 2021-02-09; in: "Thirty-Fifth AAAI Conference on Artificial Intelligence", AAAI Press, 35 (2021), ISBN: 978-1-57735-866-4; 3904 - 3912.

M. Schlaipfer, F. Slivovsky, G. Weissenbacher, F. Zuleger:
"Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness";
Talk: International Conference on the Theory and Applications of Satisfiability Testing, Alghero, Italien; 2020-07-03 - 2020-07-10; in: "SAT 2020: Theory and Applications of Satisfiability Testing - SAT 2020", LNCS, 12178 (2020), ISBN: 978-3-030-51824-0; 429 - 446.

A. Schöbel, G. Raidl, I. Grujicic, G. Besau, G. Schuster:
"An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure";
Talk: 5th International Seminar on Railway Operations Modelling and Analysis, Copenhagen; 2013-05-13 - 2013-05-15; in: "Proceedings", (2013), ISBN: 978-87-7327-246-6; Paper ID 21, 10 pages.

W. Schreiner, F. Reichl:
"First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving";
Talk: International Symposium on Symbolic Computation in Software Science, Linz; 2021-09-08 - 2021-09-10; in: "Electronic Proceedings in Theoretical Computer Science", (2021), ISSN: 2075-2180; 99 - 113.

F. Schroeder, A Braumann, P. Filzmoser, K. Hron:
"Robust variable selection in linear regression with compositional explanatory variables";
Talk: CoDaWork 2013, Vorau; 2013-06-06 - 2013-06-07; in: "Proceedings of the 5th International Workshop on Compositional Data Analysis CoDaWork 2013 June 3-7, 2013, Vorau, Austria", K. Hron, P. Filzmoser, M. Templ (ed.); (2013), ISBN: 978-3-200-03103-6; 55.

M. Schwengerer, S. Pirkwieser, G. Raidl:
"A variable neighborhood search approach for the two-echelon location-routing problem";
Talk: Evolutionary Computation in Combinatorial Optimization (EvoCOP), Malaga, Spain; 2012-04-11 - 2012-04-13; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012", volume 7245 of LNCS (2012), ISBN: 978-3-642-29123-4; 13 - 24.

A. Shukla, F. Slivovsky, S. Szeider:
"Short Q-Resolution Proofswith Homomorphisms";
Talk: SAT 2020 - 23rd International Conference on Theory and Applications of Satisfiability Testing, Alghero, Italy; 2020-07-03 - 2020-07-10; in: "Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing", LNCS, 12178 (2020), ISBN: 978-3-030-51824-0; 412 - 428.

F. Slivovsky:
"Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing";
Talk: International Conference on Computer Aided Verification (CAV), Los Angeles, USA; 2020-07-19 - 2020-07-24; in: "CAV 2020: Computer Aided Verification", LNCS, 12224 (2020), ISBN: 978-3-030-53287-1; 508 - 528.

F. Slivovsky, S. Szeider:
"A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth";
Talk: Theory and Applications of Satisfiability Testing, Alghero, Italien; 2020-07-03 - 2020-07-10; in: "Theory and Applications of Satisfiability Testing - SAT 2020", LNCS, 12178 (2020), ISBN: 978-3-030-51824-0; 267 - 276.

M. Suntinger, H. Obweger, J. Schiefer, P. Limbeck, G. Raidl:
"Trend-based similarity search in time-series data";
Talk: International Conference on Advances in Databases, Knowledge, and Data Applications (DBKDA), Menuires, FRANCE; 2010-04-11 - 2010-04-16; in: "Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications - DBKDA 2010", (2010), 97 - 106.

A. Tus, A. Rendl, G. Raidl:
"Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem";
Talk: LION 9, Lille, France; 2015-01-12 - 2015-01-15; in: "Learning and Intelligent Optimization", C. Dhaenens, L. Jourdan, M. Marmion (ed.); 8994 (2015), ISBN: 978-3-319-19084-6; 186 - 201.

D. Wagner, U. Pferschy, P. Mutzel, G. Raidl, P. Bachhiesl:
"A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks";
Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007).

D. Wagner, G. Raidl, U. Pferschy, P. Mutzel, P. Bachhiesl:
"A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks.";
Talk: Operations Research, Karlsruhe, Deutschland; 2006-09-06 - 2006-09-08; in: "Operations Research Proceedings 2006, Karlsruhe", Springer, Heidelberg (2007), ISBN: 978-3-540-69994-1.

J. Walla, M. Ruthmair, G. Raidl:
"Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search";
Talk: International Workshop on Hybrid Metaheuristics (HM), Udine, Italien; 2009-10-16 - 2009-10-17; in: "Hybrid Metaheuristics 2009, volume 5818 of LNCS", (2009), ISBN: 978-3-642-04917-0; 84 - 99.

H. Wu, M. Nöllenburg, I. Viola:
"The Travel of a Metabolite";
Talk: IEEE Pacific Visualization Symposium (PacificVis), Kobe, Japan (invited); 2018-04-10 - 2018-04-13; in: "Proceedings of PacificVis 2018 Data Story Telling Contest", (2018).

H. Wu, I. Viola, M. Nöllenburg:
"A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways";
Poster: Eurographics Conference on Visualization (EuroVis 2018), Brno (invited); 2018-06-04 - 2018-06-08; in: "Proceedings of EuroVis 2018", Eurographics / VGTC, (2018).

J. Wulms, J. Buchmüller, W. Meulemans, K. Verbeek, B. Speckmann:
"Stable Visual Summaries for Trajectory Collections";
Talk: 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), Tianjin, China; 2021-04-19 - 2021-04-22; in: "Proceedings of the 14th IEEE Pacific Visualization Symposium", 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), (2021), ISBN: 978-1-6654-3931-2; 61 - 70.

C Yildiz, P. Mutzel, W. Barth:
"A new approximation algorithm for bend minimization in the kandinsky model.";
Talk: 14th International Symposium on Graph Drawing, Karlsruhe, Deutschland; 2006-09-18 - 2006-09-20; in: "Graph Drawing - 14th International Symposium, GD 2006 Karlsruhe, Germany, September 18-20, 2006 Revised Papers", M Kaufmann, D. Wagner (ed.); Springer, Heidelberg (2007), ISBN: 978-3-540-70903-9.

Talks and Poster Presentations (without Proceedings-Entry)

C. Bacher, G. Raidl:
"Cyclic Giant Tour Decoding for the EVRPTW";
Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06.

C. Bacher, G. Raidl:
"Integrating Algebraic Dynamic Programming in Combinatorial Optimization";
Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02.

C. Bacher, G. Raidl:
"Mixed Integer Programming Models for Hybrid Electric Vehicle Routing";
Talk: VeroLog 2015, Universität Wien (invited); 2015-06-08 - 2015-06-10.

S. Bhore, J. Haunert, F. Klute, G. Li, M. Nöllenburg:
"Balanced Independent and Dominating Sets onColored Interval Graphs";
Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18.

S. Bova:
"A Strongly Exponential Separation of DNNFs from CNFs";
Talk: Symposium on New Frontiers in Knowledge Compilation, Wien (invited); 2015-06-05.

S. Bova:
"Generalized Basic Logic, Polynomial Space, and Disjunction Property";
Talk: Workshop in Memoriam Franco Montagna, Siena, Italien (invited); 2015-12-16.

S. Bova:
"Parameterized Compilability of Clause Entailment";
Talk: ANR Workshop 2015, Paris, France (invited); 2015-04-01.

S. Bova:
"Succinctness in Knowledge Representation";
Talk: Research Seminar Birkbeck University of London, London, England (invited); 2015-12-10.

J. Chen:
"Fractional Matchings under Preferences: Stability and Optimality";
Talk: COMSOC Video Seminar, International Seminar Series on Social Choice, online (invited); 2021-10-14.

J. Chen, D. Hermelin, M. Sorge:
"Computational aspects of multiwinner approval voting via p-norm Hamming distance vectors";
Talk: Aggregation across disciplines: connections and frameworks, Paris (invited); 2021-12-15 - 2021-12-17.

A Chwatal, G. Raidl:
"Applying branch-and-cut for compressing fingerprint templates";
Talk: EURO XXII: 22nd European Conference on Operational Research, Prag, Tschechische Republik; 2007-07-08 - 2007-07-11.

A Chwatal, G. Wuchterl, G. Raidl:
"Fitting multi-planet transit models to corot time-data series by evolutionary algorithms";
Poster: COROT, Paris; 2009-02-02 - 2009-02-05.

J. Fichte, M. Hecher, N. Lodha, S. Szeider:
"An {SMT} Approach to Fractional Hypertree Width";
Talk: International Conference on Principles and Practice of Constraint Programming (CP), Lille, France; 2018-08-27 - 2018-08-31.

R. Ganian:
"Algorithmic Applications of Large Well-Structured Modulators";
Talk: Algorithmic Model Theory Meeting 2015 - ALMOTH 2015, Bayreuth, Deutschland (invited); 2015-02-26 - 2015-02-27.

R. Ganian:
"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting";
Talk: Contemporary Trends in Theoretical Computer Science 2015, Prag, Tschechien (invited); 2015-06-26 - 2015-06-27.

R. Ganian:
"Well-Structured Modulators: FPT Algorithms and Kernels";
Talk: Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Aussois, France (invited); 2015-10-11 - 2015-10-15.

M. Gruber:
"Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem";
Talk: Entscheidungsunterstützung in der Logistik-Geographische Informationssysteme, Simulation und Optimierung, Salzburg (invited); 2008-04-18 - 2008-04-19.

M. Höller, F. Klute, S. Nickel, M. Nöllenburg, B. Schreiber:
"Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs";
Talk: European Workshop on Computational Geometry (EuroCG'18), Berlin; 2018-03-21 - 2018-03-23.

M. Horn, M. Djukanovic, C. Blum, G. Raidl:
"On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences";
Talk: CPAIOR 2020, Wien; 2020-09-21 - 2020-09-24.

B. Hu, M. Leitner, G. Raidl:
"Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems";
Talk: 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006), Bertinoro, Italien; 2006-08-27 - 2006-08-30.

T. Jatschka, T. Rodemann, G. Raidl:
"A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications";
Talk: Honda Research Institute Europe, Offenbach, Germany, Honda Research Institute Europe, Offenbach, Germany (invited); 2021-09-08 - 2021-09-09.

A. Kerren:
"DGCVis: An Exploratory 3D Visualization of Graph Pyramids";
Talk: CMV: 2nd International Conference on Coordinated and Multiple Views in Exploratory Visualization, IEEE, London; 2004-07-13.

A. Kerren:
"Generation as Method for Explorative Learning in Computer Science Education";
Talk: ACM: 9th Annual Conference on Innovation and Technology in Computer Science Education Generation as Method for Explorative Learning in Computer Science Education, Leeds, Großbritannien; 2004-06-28 - 2004-06-30.

G.W. Klau:
"Human-Guided Search: System, Current and Future Work";
Talk: The University of Sidney, School of Information Technologies, Information Visualization Research Group, Sydney; 2004-02-05.

G.W. Klau:
"Mathematik in der Bioinformatik";
Talk: Jahrestagung der Deutschen Mathematikervereinigung (DMV 2004), Heidelberg, Deutschland; 2004-09-12 - 2004-09-17.

G.W. Klau:
"Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming";
Talk: SIGOPT International Conference on Optimization (ICO 2004), Wittenberg, Deutschland; 2004-02-15 - 2004-02-18.

G.W. Klau:
"Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming";
Talk: ISMB/ECCB: 12th International Conference on Intelligent Systems for Molecular Biology und 3rd European Conference on Computational Biology, Glasgow, Großbritannien; 2004-08-02.

G.W. Klau:
"Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming";
Talk: OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande; 2004-09-01.

G.W. Klau:
"Optimale Probenauswahl für Microarrays bei mehrdeutigen Proben";
Talk: Universität Wien, Institut für Statistik und Decision Support Systems, Privatissimum-Seminar "Biostatistik und Optimierung", Wien; 2004-11-05.

G.W. Klau:
"Optomal Robust Non-Unique Probe Selection Using Integer Linear Programming";
Talk: Hong Kong University of Science, Theory Group, Hong Kong, China; 2004-02-16.

G.W. Klau:
"Probe Selection by Integer Linear Programming";
Talk: Séminaire BIOINFO, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Nancy, Frankreich; 2004-11-11.

G.W. Klau:
"Robustness and Resilience";
Talk: Dagstuhl: Seminar Network Analysis, Dagstuhl, Deutschland; 2004-04-15.

G.W. Klau:
"Structural Alignment of Two RNA Sequences with Lagrangian Relaxation";
Talk: OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande; 2004-09-01.

B. Klocker, G. Raidl:
"Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers";
Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02.

C. Kloimüllner, P. Papazek, B. Hu, G. Raidl:
"Balancing Bicycle Sharing Systems";
Talk: EULOG 2014, Wien; 2014-11-17 - 2014-11-18.

F. Klute, M. Nöllenburg:
"Minimizing crossings in constrained two-sided circular graph layouts";
Talk: EuroCG17, Schweden (invited); 2017-05-05.

G. Koller:
"An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem";
Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22.

M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair:
"Exact Approaches to the Network Design Problem with Relays";
Talk: EULOG 2014, Wien; 2014-11-17 - 2014-11-18.

G. Li, S. Nickel, M. Nöllenburg, I. Viola, H. Wu:
"World map of recipes";
Poster: Graph Drawing Contest, unknown; 2019-10-19.

M. Löffler, M. Nöllenburg:
"Labeling Nonograms";
Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18.

J. Maschler, M. Riedler, M. Stock, G. Raidl:
"Particle Therapy Patient Scheduling: First Heuristic Approaches";
Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06.

P. Mutzel:
"Anwendung der Computional Intelligence in der Kombinatorischen Optimierung";
Talk: Universität Dortmund, SFB Meeting, Dortmund, Deutschland; 2004-09-15.

P. Mutzel:
"Die SPQR-Baum Datenstruktur im Graph Drawing";
Talk: Universität Dortmund, Dortmund, Deutschland; 2004-04-19.

P. Mutzel:
"Effizientes Zählen von Schnittpunkten";
Talk: Institut für Hochenergiephysik (HEPHY) - TU Wien, Wien; 2003-03-31.

P. Mutzel:
"Maximum Planar Subgraphs and Crossing Minimization in Graph Drawing";
Talk: ADONET/Socrates Doctoral Courses in Discrete Systems and Optimization, Köln, Deutschland; 2004-09-09.

P. Mutzel:
"Recent Advances on ArchEd";
Talk: Enter-The-Past: The E-way into the four Dimensions of Cultural Heritage, Wien; 2003-04-08 - 2003-04-12.

P. Mutzel:
"SPQR-Trees in Automatic Graph Drawing";
Talk: Ecole polytechnique fédérale de Lausanne (EPFL), Lausanne, Schweiz; 2003-02-13.

S. Ordyniak:
"Variable-Deletion Backdoors to Planning";
Talk: Postdoc Presentation Days, Masaryk University Brno (invited); 2015-06-21 - 2015-06-26.

S. Pirkwieser, R. Ruiz-Torrubiano, G. Raidl:
"Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees";
Poster: BIRD'08 2nd International Conference on Bioinformatics Research and Development, Wien (invited); 2008-07-07 - 2008-07-09.

M. Prandtstetter, G. Raidl:
"Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem";
Talk: 10th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2006-01-09 - 2006-01-13.

M. Prandtstetter, G. Raidl, P. Schüller:
"Reconstructing Sheets of Manually Torn Paper";
Talk: 11th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2007-01-08 - 2007-01-12.

J. Puchinger, G. Raidl, G. Koller:
"Solving a real-world glass cutting problem";
Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07.

G. Raidl:
"Algorithms for Vehicle Routing";
Talk: Workshop on Advances and Improvements in Service Delivery to Regional Development: Cases of Transportation and Health, La Laguna, Spain (invited); 2016-07-14 - 2016-07-16.

G. Raidl:
"An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing";
Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22.

G. Raidl:
"An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem";
Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22.

G. Raidl:
"An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem";
Talk: ACM Symposium on Applied Computing, Nicosia; 2004-03-14 - 2004-03-17.

G. Raidl:
"An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem";
Talk: TU Graz, Institute for Discrete Mathematics, TU Graz, Institute for Discrete Mathematics (invited); 2017-03-21.

G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Talk: First Int. Workshop on Information Network Design, Kitakyushu City, Fukuoka, Japan (invited); 2008-12-05.

G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Talk: University of Nottingham, School of Computer Science, Nottingham, United Kingdom (invited); 2009-04-22.

G. Raidl:
"Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems";
Keynote Lecture: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znaim, Tschechien (invited); 2009-11-13 - 2009-11-15.

G. Raidl:
"Cooperative Hybrids for Combinatorial Optimization";
Talk: Int. Workshop on Nature Inspired Cooperative Strategies for Optimization, Puerto de La Cruz, Tenerife, Spain (invited); 2008-11-13.

G. Raidl:
"Evolutionary Computation for Combinatorial Optimization";
Talk: EvoNet Summer School 2003, University of Parma, Italy; 2003-08-24 - 2003-08-31.

G. Raidl:
"Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems";
Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07.

G. Raidl:
"Hybrid Metaheuristics and Matheuristics";
Talk: International Conference on Metaheuristics and Nature Inspired Computing, Port El-Kantaoiui, Tunisia (invited); 2012-10-27 - 2012-10-31.

G. Raidl:
"Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik";
Talk: Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer, Wien (invited); 2009-10-21.

G. Raidl:
"Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme";
Talk: Upper Austrian University of Applied Sciences, Department of Software Engineering, Hagenberg (invited); 2009-05-06.

G. Raidl:
"Metaheuristics and Hybrid Optimization Approaches - A Unifying View";
Talk: European Conference on Operational Research, Rom (invited); 2013-07-03.

G. Raidl:
"Metaheuristics for Solving a Scheduling Problem in Car Manufacturing";
Talk: ICAM5 - Fifth International Conference on Applied Mathematics, Baia Mare, Rumänien; 2006-09-21 - 2006-09-25.

G. Raidl:
"Metaheuristics for the Static Balancing of Bicycle Sharing Systems";
Talk: European Conference on Operational Research, Rom; 2013-07-03.

G. Raidl:
"Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling";
Talk: University of Vienna, Department of Statistics and Operations Research, University of Vienna, Department of Statistics and Operations Research (invited); 2017-07-06.

G. Raidl:
"Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem";
Talk: Research Institute of Molecular Pathology, Biocenter Vienna, Wien; 2003-08-31.

G. Raidl:
"New ILP Approaches for 3-Staged Two-Dimensional Bin Packing";
Talk: EUROXX: 20th European Conference on Operational Research, Rhodos; 2004-07-04 - 2004-07-07.

G. Raidl:
"On the Hybridization of Evolutionary Algorithms";
Talk: Genetic and Evolutionary Computation Conference (GECCO 2003), Chicago, IL; 2003-07-12 - 2003-07-16.

G. Raidl:
"Optimization Approaches for Balancing Bicycle Sharing Systems";
Talk: Department of Business Administration, Production and Operations Management Group, University of Vienna, Wien (invited); 2013-03-08.

G. Raidl:
"Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems";
Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham; 2004-09-18 - 2004-09-22.

G. Raidl:
"Variable Neighborhood Search Hybrids";
Keynote Lecture: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien (invited); 2014-10-08 - 2014-10-11.

G. Raidl, E. Causevic, B. Hu, M. Rainer-Harbach:
"Balancing Bicycle Sharing Systems by Variable Neighborhood Search";
Talk: EUROmC XXVIII VNS, Herceg Novi, Montenegro (invited); 2012-10-04 - 2012-10-07.

G. Raidl, B. Hu, M. Leitner:
"Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem";
Talk: 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brasilien; 2006-07-30 - 2006-08-04.

M. Rainer-Harbach, P. Papazek:
"Balancing Bicycle Sharing Systems by Variable Neighborhood Search";
Talk: Austrian Workshop on Metaheuristics, Graz; 2012-12-06.

M. Riedler, M. Leitner, I. Ljubic, M. Ruthmair:
"Using Layered Graphs to solve the Directed Network Design Problem with Relays";
Talk: 21st Conference of the International Federation of Operational Research Societies, Quebec Canada; 2017-07-17 - 2017-07-21.

M. Ruthmair, G. Raidl:
"An Adaptive Layers Framework for Resource-Constrained Network Design Problems";
Talk: INFORMS Telecommunications Conference, Boca Raton, Florida, USA; 2012-03-15 - 2012-03-17.

M. Ruthmair, G. Raidl:
"An Adaptive Layers Framework for Vehicle Routing Problems";
Talk: International Symposium on Mathematical Programming, Berlin, Deutschland; 2012-08-19 - 2012-08-24.

F. Schroeder, A Braumann, P. Filzmoser:
"Robust variable selection for linear regression models with compositional data";
Talk: Statistische Woche 2012, TU Wien; 2012-09-18 - 2012-09-21.

F. Slivovsky:
"An Introduction to Knowledge Compilation";
Talk: Kocoon Workshop, Arras, Frankreich (invited); 2019-12-16 - 2019-12-19.

F. Slivovsky:
"Dependency Schemes for Quantified Boolean Formulas";
Talk: International Workshop on Quantified Boolean Formulas, Austin, Texas (invited); 2015-09-23.

S. Szeider:
"A Survey on Parameterized Complexity and SAT";
Talk: Dagstuhl Seminar, Schloss Dagstuhl, Deutschland (invited); 2015-04-19 - 2015-04-24.

S. Szeider:
"Backdoors for Constraint Satisfaction";
Talk: Workshop Gutin 60, Großbritanien (invited); 2017-01-07 - 2017-01-08.

S. Szeider:
"Capturing Structure in Instances of the Propositional Satisfiability Problem";
Talk: ÖMG-DMV-Congress 2017, Salzburg (invited); 2017-09-11 - 2017-09-15.

S. Szeider:
"Capturing Structure in SAT and Related Problems";
Keynote Lecture: International Workshop on Graph Structure and Satisfiability Testing, Bordeaux, France (invited); 2016-07-04.

S. Szeider:
"Capturing Structure in SAT and Related Problems";
Talk: Theoretical Foundations of SAT Solving Workshop, Toronto, Kanada (invited); 2016-08-15 - 2016-08-19.

S. Szeider:
"Computational Thinking und ADA.wien";
Talk: eEducation Fachtagung, Wien (invited); 2019-11-07 - 2019-11-09.

S. Szeider:
"Get Satisfaction: Das Erfüllbarkeitsproblem in Theorie und Praxis";
Keynote Lecture: 9. Informatiktag 2017, Tu Wien (invited); 2017-09-28.

S. Szeider, R. Ganian, I. Kanj, S. Ordyniak:
"Parameterized Complexity Results for the Completion and Clustering of Incomplete Data";
Talk: Kocoon Workshop, Arras, Frankreich; 2019-12-16 - 2019-12-19.

R. Weiskircher:
"An O(n log n) Algorithm for the Fractional Prize Collecting Steiner Tree Problem on Trees";
Talk: 7th Combinatorial Optimization Workshop, Aussois, Frankreich; 2003-03-10 - 2003-03-14.

R. Weiskircher:
"Automatic Graph Drawing";
Talk: Ars Electronica, Language of Network Conference, Linz; 2004-09-01.

R. Weiskircher:
"Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen";
Talk: Gi-Dissertationspreis, Mainz, Deutschland; 2003-06-23 - 2003-06-24.

H. Wu, B. Niedermann, S. Takahashi, M. Nöllenburg:
"A Survey on Computing Schematic Network Maps: The Challenge to Interactivity";
Talk: 2nd Schematic Mapping Workshop, TU Wien, Vienna; 2019-04-11 - 2019-04-12.

Habilitation Theses

G. Raidl:
"Hybrid Evolutionary Algorithms for Combinatorial Optimization";
Technische Universität Wien, 2003.

Doctor's Theses (authored and supervised)

B. Biesinger:
"Complete Solution Archives for Evolutionary Combinatorial Optimization";
Supervisor, Reviewer: G. Raidl, C. Blum, U. Pferschy; Institut für Computergraphik und Algorithmen, 2016; oral examination: 2016-06-03.

A Chwatal:
"On the Minimum Label Spanning Tree Problem: Solution Methods and Applications";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16.

R. de Haan:
"Parameterized Complexity in the Polynomial Hierarchy";
Supervisor, Reviewer: S. Szeider, M. Grohe, R. Pichler; Institut für Computergraphik und Algorithmen, 2016; oral examination: 2016-11-08.

M. Djukanovic:
"Exact and Heuristic Approaches for Solving String Problems from Bioinformatics";
Supervisor, Reviewer: G. Raidl, C. Blum; Institute of Logic and Computation, 2021; oral examination: 2021-05-05.

R. El-Berry:
"Selbstausrichtende Prozesse - Elemente der Künstlichen Intelligenz im Geschäftsmanagement";
Supervisor, Reviewer: J. Dorn, G. Raidl; Institut für Informationssysteme, Arbeitsbereich Datenbanker & Artificial Intelligence, 2006.

M. Gruber:
"Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009; oral examination: 2009-06-16.

M. Horn:
"Advances in Search Techniques for Combinatorial Optimization: New Anytime A* Search and Decision Diagram Based Approaches";
Supervisor, Reviewer: G. Raidl, C. Blum, L. Di Gaspero; Institute of Logic and Computation, 2021; oral examination: 2021-09-09.

B. Hu:
"Hybrid Metaheuristics for Generalized Network Design Problems";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2008; oral examination: 2008-12-11.

J. Inführ:
"Optimization Challenges of the Future Federated Internet";
Supervisor, Reviewer: G. Raidl, K. Tutschku; Institut für Computergraphik and Algorithmen, 2013; oral examination: 2013-11-27.

A. Kerren:
"Generierung interaktiver Animationen für den Übersetzerbau"; Saarland University, Saarbrücken, 2002.

B. Klocker:
"Combinatorial Optimization Approaches for Graph Construction Problems";
Supervisor, Reviewer: G. Raidl, H. Fleischner; Institute of Logic and Computation, 2020; oral examination: 2020-03-25.

C. Kloimüllner:
"Algorithmic approaches for Optimization problems in bike sharing and security control";
Supervisor, Reviewer: G. Raidl, K. Sörensen, N. Musliu; Institute of Logic and Computation, 2019; oral examination: 2019-01-31.

F. Klute:
"Avoiding Crossings in Non-Planar Graph Layouts";
Supervisor, Reviewer: M. Nöllenburg, F. Frati, S.G. Kobourov; Institut für Logic and Computation, 2020; oral examination: 2020-03-13.

T. Krenek:
"Optimierung von elektro-hybriden Antriebskonzepten mittels heuristischer Optimierungsverfahren";
Supervisor, Reviewer: T. Lauer, G. Raidl; Institut für Fahrzeugantriebe und Automobiltechnik, 2015; oral examination: 2015-09-07.

M. Leitner:
"Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16.

I. Ljubic:
"Exact and Memetic Algorithms for Two Network Design Problems";
Supervisor, Reviewer: P. Mutzel; Institut für Computergraphik und Algorithmen, 2004.

J. Maschler:
"Patient scheduling in particle therapy";
Supervisor, Reviewer: G. Raidl, L. Di Gaspero, N. Musliu; Institute of Logic and Computation, 2019; oral examination: 2019-03-20.

N. Mujezinovic:
"Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction";
Supervisor, Reviewer: G. Raidl, F. Eisenhaber; Institut für Computergraphik und Algorithmen, TU Wien, 2007; oral examination: 2007-05.

B. Niedermann:
"Automatic Label Placement in Maps and Figures: Models, Algorithms and Experiments";
Supervisor, Reviewer: M. Nöllenburg, J. Haunert; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-02-02.

S. Pirkwieser:
"Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation";
Supervisor, Reviewer: G. Raidl, K. Dörner; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-14.

M. Prandtstetter:
"Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009.

R. Prutkin:
"Graph Embeddings Motivated by Greedy Routing";
Supervisor, Reviewer: D. Wagner, M. Nöllenburg, M Kaufmann; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-11-29.

J. Puchinger:
"Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems.";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2006; oral examination: 2006-01.

M. Ruthmair:
"On Solving Constrained Tree Problems and an Adaptive Layers Framework";
Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-21.

F. Slivovsky:
"Structure in #SAT and QBF";
Supervisor, Reviewer: S. Szeider, H. Chen; Institut für Computergraphik und Algorithmen, 2015; oral examination: 2015-05-05.

C Yildiz:
"Knickminimales orthogonales Zeichnen planarer Graphen im Kandinsky Modell.";
Supervisor, Reviewer: P. Mutzel, W. Barth; Institut für Computergraphik und Algorithmen, 2006; oral examination: 2006-01.

Diploma and Master Theses (authored and supervised)

C. Bacher:
"Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques";
Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08.

M. Bauer:
"RNA structural alignment by means of Lagrangian relaxation";
Supervisor: G.W. Klau; Institut für Computergraphik und Algorithmen, 2004.

C. Berger:
"Solving a Generalized Constrained Longest Common Subsequence Problem";
Supervisor: G. Raidl, M. Djukanovic; Institute of Logic and Computation, 2020; final examination: 2020-06.

F. Berger:
"Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-09.

M. Berlakovich:
"Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem";
Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07.

B. Biesinger:
"Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents";
Supervisor: G. Raidl, C. Schauer, B. Hu; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05.

B. Bonigl:
"A Branch-and-Bound Approach for the Constrained K-Staged 2-Dimensional Cutting Stock Problem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11.

C. Bonitz:
"An incremental dynamic programming approach for multidimensional allocation problems";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05.

A Braumann:
"Map-Matching und Wegsuche in einem geografischen Informationssystem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-01.

M. Buchta:
"Engineering an Algorithm for Strict Outerconfluent Graph Drawings";
Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019.

Th. Bucsics:
"Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks";
Supervisor: G. Raidl, D. Wagner; Institut für Computergraphik und Algorithmen, TU Wien, 2007; final examination: 2007-03.

M. Chimani:
"Bend minimal orthogonal drawing of non planar graphs. ";
Supervisor: G.W. Klau, R. Weiskircher; Institut für Computergraphik und Algorithmen, 2004.

A Chwatal:
"Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen.";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01.

P. de Col:
"Algorithms and Drawings for Mixed Linear Layouts of Graphs";
Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019.

O. Dietzel:
"Combinatorial Optimization for the Compression of Biometric Templates";
Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05.

F. Dusberger:
"Improving the protein identification performance in high-resolution mass spectrometry data";
Supervisor: G. Raidl, K. Mechtler, P. Pichler; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10.

K. Edlinger:
"Optimierung der periodischen Tourenplanung in der Müllentsorgung";
Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07.

J. Fauster:
"Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem";
Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2003.

H. Feltl:
"Ein genetischer Algorithmus für das Generalized Assignment Problem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003.

J. Fichte:
"Backdoors to Tractability of Disjunctive Answer Set Programming";
Supervisor: S. Szeider; Institut für Informationssysteme, 2015.

D. Fischinger:
"Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken.";
Supervisor: G. Raidl, W. Stöcher; Institut für Computergraphik und Algorithmen, 2005.

G. Fritz:
"A hybrid algorithm for the partition coloring problem.";
Supervisor: G. Raidl, B. Hu; Computergraphik und Algorithmen, 2014.

G. Fritz:
"Heuristic methods for the hop constrained survivable network design problem";
Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09.

T. Fröschl:
"Minimizing wiggles in storyline visualizations";
Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2018.

V. Gamper:
"Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation.";
Supervisor: G. Raidl, G.W. Klau; Insitut für Computergraphik und Algorithmen, 2005.

P. Gebhard:
"The vehicle routing problem with compartments";
Supervisor: G. Raidl, S. Pirkwieser; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10.

C. Gruber:
"Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09.

G. Gruber:
"Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem.";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2004.

M. Gruber:
"Effiziente Gestaltung der Wortanalyse in SiSiSi";
Supervisor: W. Barth, G. Koller, M. Schönhacker; Institut für Computergraphik und Algorithmen, 2003.

F. Gstrein:
"Driving-range estimation of electric vehicles using graph algorithms";
Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017.

A. Heigl:
"Option pricing by means of genetic programming.";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005.

G. Hiermann:
"Metaheuristics for a multimodal home-health care scheduling problem";
Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05.

B. Hu:
"Interaktive Reihenfolgeplanung für die Automobilindustrie. ";
Supervisor: G.W. Klau; Institut für Computergraphik und Algorithmen, 2004.

O. Hubmer:
"Techniques for multiple sink placement in undirected flow networks";
Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017.

J. Inführ:
"Automatic generation of 2-antwars players with genetic programming";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07.

I. Ivezic:
"Extending the gecode framework with interval constraint programming";
Supervisor: G. Raidl, L. Di Gaspero; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10.

P. Jahrmann:
"Metaheuristics for the regenerator location problem";
Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-03.

R. Karl:
"The rooted delay-constrained steiner tree problem with uncertain delays";
Supervisor: G. Raidl, M. Leitner, M. Ruthmair; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12.

S. Kersting:
"Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003.

P. Klaffenböck:
"Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework.";
Supervisor: G. Raidl; Institut für Computergrafik und Algorithmen, 2014.

B. Klocker:
"Optimierungsansätze zur Planung von Freizeit-Fahrradrouten";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2015; final examination: 2015-04.

M. Knausz:
"Parallel variable neighborhood search for the car sequencing problem";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10.

B. Kopinitsch:
"An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem.";
Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01.

T. Krenek:
"Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus";
Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07.

S. Kuran:
"Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots";
Supervisor: G. Raidl, A Chwatal; Institute of Logic and Computation, 2020; final examination: 2020-03.

F. Leberl:
"Column Generation at Strip Level for the K-Staged Two-Dimensional Cutting Stock Problem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-03-22.

M. Leitner:
"Solving two generalized network design problems with exact and heuristic methods.";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-05.

S. Leopold:
"An alignment graph based evolutionary algorithm for the multiple sequence alignment problem";
Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2004.

D. Lichtenberger:
"An extended local branching framework and its application to the multidimensional knapsack problem.";
Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005.

R. Löffler:
"An interactive optimization framework for point feature label placement";
Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2018.

D. Markvica:
"Finding longest common subsequences by GPU-based parallel ant colony optimization.";
Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014.

T. Misar:
"Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenndung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-04.

W. Morandell:
"Evaluation and reconstruction of strip-shredded text documents";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05.

N. Musil:
"Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung";
Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12.

P. Neuner:
"Algorithmic Approaches to the String Barcoding Problem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10.

S. Nickel:
"Generating Stable Demers Cartograms and Iso-Hexagon Cartograms";
Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2019.

K. Oberlechner:
"Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods";
Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-08.

H. Obweger:
"Similarity searching in complex business events and sequences thereof";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03.

A. Pagacz:
"Heuristic methods for solving two generalized network problems";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02.

T. Petelin:
"Two-phase local search for the bi-objective connected facility location problem";
Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12.

M. Pimmer:
"A timeslot-based heuristic approach to construct high-school timetables";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-12.

A. Pinter:
"Balancing bike sharing systems";
Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12.

S. Pirkwieser:
"A Lagrangian decomposition approach combined with metaheuristics for the knapsack constrained maximum spanning tree problem.";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-10.

A. Potocka:
"Webbasierte Darstellung großer Datenmengen als pivot-tabelle mithilfe ressourcenoptimierter Aggregationsverfahren";
Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10.

S. Pourmanouchehri:
"A Hybrid Evolutionary Algorithm for the Vehicle Routing Problem with Stochastic Demands";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-09-01.

M. Prandtstetter:
"Exact and heuristic methods for solving the car sequencing problem.";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2005.

M. Prischink:
"Metaheuristics for the Districting and Routing Problem for Security Control";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-05-09.

J. Puchinger:
"Verfahren zur Lösung eines Glasverschnittproblems";
Supervisor: G. Raidl, G. Kodydek; Institut für Computergraphik und Algorithmen - E186, 2003.

P. Putz:
"Subgradient optimization based lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem";
Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10.

M. Putzenlechner:
"Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems";
Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08.

M. Riedler:
"Exact approaches to the network design problem with relays";
Supervisor: I. Ljubic, M. Leitner, M. Ruthmair; Computergraphik und Algorithmen, 2014.

U. Rietzinger:
"Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12.

C. Schauer:
"Reconstructing cross-cut shredded documents by means of evolutionary algorithms";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-05.

T. Schnabl:
"Critical Links Detection using CUDA";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04.

P. Schüller:
"Reconstructing borders of manually torn paper scheets using integer linear programming";
Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-01.

R. Schuster:
"Clustering Heuristics for the Hierarchical Ring Network Problem";
Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-11.

C. Schwab:
"Visibility-Based Obstacle Placing";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11.

T. Seidl:
"A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem";
Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09.

M. Sinnl:
"Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints";
Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-08.

M. Sonnleitner:
"Ein neues lösungsarchiv für das generalized minimum spanning tree-problem";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-09.

A. Sramko:
"Enhancing a genetic algorithm by a complete solution archive based on a trie data structure";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-02.

M. Sturm:
"Solving multimodal resource constrained project scheduling problems";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-09.

M. Suntinger:
"Event based similarity search and its applications in business analytics";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03.

S. Teuschl:
"Casual Employee Scheduling with Constraint Programming and Metaheuristics";
Supervisor: G. Raidl, N. Frohner; Institute of Logic and Computation, 2020; final examination: 2020-11.

C. Thöni:
"Compressing fingerprint templates by solving the $k$-node minimum label spanning arborescence problem by branch-and-price";
Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02.

D. Trummer:
"Applying ant colony optimization to the periodic vehicle routing problem with time windows.";
Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014.

A. Tus:
"Heuristic solution approaches for the two dimensional pre-marshalling problem.";
Supervisor: G. Raidl, A. Rendl; Institut für Computergrafik und Algorithmen, 2014.

J. Varga:
"Computational Methods for Fleet Scheduling in E-Mobility";
Supervisor: G. Raidl; Institute of Logic and Computation, 2021; final examination: 2021-08-16.

G. Verlut:
"An application of Dijkstra's algorithm for a (on-board) route (re-)planning module.";
Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005.

C. Volko:
"Selective Graph Coloring Problem";
Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04.

D. Wagner:
"Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem.";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005.

J. Walla:
"Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing";
Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2009.

M. Wallinger:
"Visualizing Set Data with the Metro Map Metaphor";
Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2020; final examination: 2020-06-26.

A. Windbichler:
"A Heuristic Approach to Aircraft Trajectory Optimization with Constraints";
Supervisor: G. Raidl; Institute of Logic and Computation, 2019; final examination: 2019-03-13.

T. Winkler:
"Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten";
Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07.

M. Wolf:
"Ein lösungsarchiv-unterstützter evolutionärer algorithmus für das generalized minimum spanning tree-problem";
Supervisor: G. Raidl, B. Hu; Institute of Computer Graphics and Algorithms, 2009.

F. Zaubzer:
"Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems";
Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05.

S. Zaubzer:
"A complete archive genetic algorithm for the multidimensional knapsack problem";
Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05.

V. Zernpfennig:
"Evaluierung der Nutzer-Aufmerksamkeit für dynamische Kartenbeschriftung";
Supervisor: M. Nöllenburg, M. Pohl; Institut für Logic and Computation, 2020; final examination: 2020-09-30.

Scientific Reports

M. Chimani, G.W. Klau, R. Weiskircher:
"Non-planar orthogonal drawings with fixed topology";
Report for Technischer Report TR 186 1 04 03; 2004.

D. Ebner, G.W. Klau, R. Weiskircher:
"Force-based label number maximization";
2003.

J. Fichte, S. Szeider:
"Backdoor Trees for Answer Set Programming";
Report No. DBAI-TR-2016-98, 2016; 24 pages.

B. Hu, M. Leitner, G. Raidl:
"Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.";
Report for Journal of Heuristics; Report No. Technical Report TR 186-1-06-01, 2006; 36 pages.

I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti:
"Solving the prize-collecting Steiner tree problem to optimality. ";
Report for Institut für Computergraphik und Algorithmen, Technical Report TR 186-1-04-01; 2004.

P. Mutzel, R. Weiskircher:
"Bend minimization in planar orthogonal drawings using integer programming. ";
Report for Technical Report TR 186-1-04-04, Institut für Computergraphik und Algorithmen; 2004.

M. Prandtstetter, G. Raidl:
"A variable neihborhood search approach for solving the car sequencing problem.";
Report for European Journal of Operations Research (EJOR); 2005; 24 pages.

J. Puchinger, G. Raidl:
"Bringing order into the neighborhoods: Relaxation guided variable neighborhood search.";
Report for submitted to Journal of Heuristics.; Report No. TR 186-1-06-02, 2006; 33 pages.

J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing.";
Report for Technical Report TR 186-1-04-04, submitted to EJOR; 2004.

J. Puchinger, G. Raidl:
"Models and algorithms for three-stage two-dimensional bin packing.";
Report for European Journal of Operations Research, Feature Issue on Cutting and Packing; 2006; 33 pages.

G. Raidl:
"Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems";
2017.

G. Raidl, J. Gottlieb:
"Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. ";
Report for Technischer Report TR 186-1-04-05; 2004.

G. Raidl, G. Koller, B. Julstrom:
"Biased mutation operators for subgraph-selection problems. ";
Report for Technischer Report TR 186-1-04-06; 2004.

R. Weiskircher, G.W. Klau, I. Ljubic, P. Mutzel, U. Pferschy:
"The fractional prize-collecting Steiner tree problem on trees";
Report for submitted to ESA, Technical Report TR-186-1-03-01; 2003.