Algorithms and Complexity E192-01

A Research Unit of The Institute of Logic and Computation

Our research unit is concerned with the development and analysis of efficient algorithms for hard computational problems that arise in practical applications, as well as the establishment of theoretical limits of algorithmic approaches.

Contact

Head: Stefan Szeider
Web: informatics.tuwien.ac.at/orgs/e192-01
Location: Favoritenstrasse 9

About

In particular, the group considers problems arising in the areas of Combinatorial Optimisation, Artificial Intelligence, Automated Reasoning, Planning and Scheduling, Network Design, Cutting and Packing, Network Visualization, and Cartography.

Among the methods the group’s research builds upon are mathematical programming techniques, satisfiability solving techniques, metaheuristics, graph algorithms, computational geometry, fixed-parameter algorithms, constraint-based methods, and machine learning.

The group contributes to the research area Logic and Computation which is among the four focus areas at our faculty.

The research Unit Algorithms and Complexity is part of the Institute of Logic and Computation.

Professors

Scientific Staff

Administrative Staff

Doris Brazda D. Brazda

Office Services
Mag.

Andreas Müller A. Müller

IT Services
DI

Student Staff

Markus Kirchweger M. Kirchweger

Student Staff
BSc

Viktoria Korchemna V. Korchemna

Student Staff
BSc

External Lecturers

Manuel Sorge M. Sorge

Lecturer
Dr.

Courses

2020W

Algorithmic Geometry / 186.122 / VU
Algorithmics / 186.814 / VU
Bachelor Thesis in Computer Science / 186.819 / PR
Fixed-Parameter Algorithms and Complexity / 186.855 / VU
Heuristic Optimization Techniques / 186.112 / VU
Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
Project in Computer Science 1 / 186.820 / PR
Project in Computer Science 2 / 186.821 / PR
Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
Project in Visual Computing / 192.090 / PR
Propädeutikum für Informatik / 180.771 / VU
Research Seminar LogiCS / 184.767 / SE
Researchseminar for PhD candidates / 186.842 / SE
Scientific Research and Writing / 193.052 / SE
Seminar for PhD candidates / 186.199 / SE
Seminar in Algorithms Graphs and Geometry / 186.862 / SE
Seminar on Algorithms / 186.182 / SE
ways of thinking in informatics / 187.B12 / VU

2021S

Algorithmic Social Choice / 192.118 / VU
Algorithms and Data Structures / 186.866 / VU
Algorithms in Graph Theory / 186.181 / VU
Bachelor Thesis in Computer Science / 186.819 / PR
Graph Drawing Algorithms / 192.053 / VU
Modeling and Solving Constrained Optimization Problems / 186.861 / VU
Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
Project in Computer Science 1 / 186.820 / PR
Project in Computer Science 2 / 186.821 / PR
Research Seminar LogiCS / 184.767 / SE
Researchseminar for PhD candidates / 186.842 / SE
Scientific Research and Writing / 193.052 / SE
Seminar for Master Students in Logic and Computation / 180.773 / SE
Seminar for PhD candidates / 186.199 / SE
Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory / 192.119 / SE
Seminar on Algorithms / 186.182 / SE
Structural Decompositions and Algorithms / 186.856 / VU

Projects

Parameterized Analysis in Artificial Intelligence
2021 – 2026 / Austrian Science Fund (FWF)
Structural Approaches in Stability Under Diversity Constraints
2021 – 2022 / Austrian Exchange Service (OeAD)
Study on advanced computational methods for planning battery exchange stations for electric scooters
2021 / Honda Motor Co., Ltd.
Erweiterung des Software-Systems zum automatisierten Dispatching bei Alfie's
2021 / Alfie's GmbH
Engineering Linear Ordering Algorithms for Optimizing Data Visualizations
2020 – 2024 / Vienna Science and Technology Fund (WWFT)
Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI
2020 – 2024 / Vienna Science and Technology Fund (WWFT)
Learning to Solve Quantified Boolean Formulas
2020 – 2023 / Vienna Science and Technology Fund (WWFT)
Studie über Algorithmen zum Scheduling des Ladens von Elektrofahrzeugen unter besonderer Berücksichtigung von variablen maximalen Ladestromstärken
2020 – 2021 / Honda Research Institute Europe Gmb
Study on computational methods for fleet scheduling in E-mobility
2020 – 2021 / Honda Research Institute Europe Gmb
Structural and Algorithmic Aspects of Preference-based Problems in Social Choice
2019 – 2027 / Vienna Science and Technology Fund (WWFT)
SAT-Based Local Improvement Methods
2019 – 2022 / Austrian Science Fund (FWF)
Studie über Algorithmen zur Standortoptimierung von Batterie-Tauschstationen für E-Scooter
2019 – 2020 / Honda Research Institute Europe Gmb
Auftragsvorhersage und Schichtplanung für Alfie's
2019 – 2020 / Alfie's GmbH
Alfies: Preliminary study on automated dispatching
2019 / Alfie's GmbH
Human-Centered Algorithm Engineering
2018 – 2023 / Austrian Science Fund (FWF)
New Frontiers for Parameterized Complexity
2018 – 2022 / Austrian Science Fund (FWF)
Doktoratskolleg "Vienna Graduate School on Computational Optimization"
2016 – 2024 / Austrian Science Fund (FWF)
Cycles in Graphs and Properties of Graphs with Special Cycle Structures
2015 – 2019 / Austrian Science Fund (FWF)
Variable Dependencies of Quantified Boolean Formulas
2015 – 2018 / Austrian Science Fund (FWF)
Developing algorithms to solve scheduling problems in radio therapy
2015 – 2017 / EBG MedAustron GmbH
Planing bike sharing systems considering the demand, distribution and maintenance works
2015 – 2017 / Austrian Research Promotion Agency (FFG)
Exploiting New Types of Structure for Fixed Parameter Tractability
2014 – 2018 / Austrian Science Fund (FWF)
Parameterized Compilation
2014 – 2018 / Austrian Science Fund (FWF)
Solution Archives in Evolutionary Combinatorial Optimization
2012 – 2016 / Austrian Science Fund (FWF)

Publications

2021

The Complexity Landscape of Resource-Constrained Scheduling / R. Ganian, T. Hamm, G. Mescoff / Talk: IJCAI 2020, Yokohama; 2021-01-07 - 2021-01-15; in: "Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence", (2020), ISBN: 978-0-9992411-6-5; 1741 - 1747
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP / J. Chen, R. Ganian, T. Hamm / 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", (2020), ISBN: 978-0-9992411-6-5; 1 - 7
Threshold Treewidth and Hypertree Width / R. Ganian, A. Schidler, M. Sorge, S. Szeider / 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)", (2020), ISBN: 978-0-9992411-6-5; 1898 - 1904

2020

On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / M. Horn, M. Djukanovic, C. Blum, G. Raidl / 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
Distributing Battery Swapping Stations for Electric Scooters in an Urban Area / T. Jatschka, T. Rodemann, G. Raidl / 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
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / M. Horn, M. Djukanovic, C. Blum, G. Raidl / Talk: CPAIOR 2020, Wien; 2020-09-21 - 2020-09-24
Fixed-Parameter Tractability of Dependency QBFwith Structural Parameters / R. Ganian, T. Peitl, F. Slivovsky, S. Szeider / 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
Towards Faster Reasoners by Using Transparent Huge Pages / J. Fichte, N. Manthey, J. Stecklina, A. Schidler / 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
Breaking Symmetries with RootClique and LexTopSort / J. Fichte, M. Hecher, S. Szeider / 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
A Time Leap Challenge for SAT-Solving / J. Fichte, M. Hecher, S. Szeider / 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
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling / S. Bhore, G. Li, M. Nöllenburg / 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
MaxSAT-Based Postprocessing for Treedepth / V. Ramaswamy, S. Szeider / 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
Finding the Hardest Formulas for Resolution / T. Peitl, S. Szeider / 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
A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem / Th. Kaufmann, M. Horn, G. Raidl / 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 Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility / N. Frohner, G. Raidl / 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
Layered Fan-Planar Graph Drawings / T. Biedl, S. Chaplick, M Kaufmann, F. Montecchiani, M. Nöllenburg, C. Raftopoulou / 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
Extending Nearly Complete 1-Planar Drawings in Polynomial Time / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / 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
Towards Data-Driven Multilinear Metro Maps / S. Nickel, M. Nöllenburg / 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
Formalizing Graph Trail Properties in Isabelle/HOL / L. Kovacs, Hanna Lachnitt, S. Szeider / 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
Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing / F. Slivovsky / 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
Extending Partial 1-Planar Drawings / E. Eiben, R. Ganian, T. Hamm, F. Klute, M. Nöllenburg / 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
Short Q-Resolution Proofswith Homomorphisms / A. Shukla, F. Slivovsky, S. Szeider / 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
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness / M. Schlaipfer, F. Slivovsky, G. Weissenbacher, F. Zuleger / 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 Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth / F. Slivovsky, S. Szeider / 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
Parameterized Study of Steiner Tree on Unit DiskGraphs / S. Bhore, P. Carmi, S. Kolay, M. Zehavi / Talk: Symposium and Workshops on Algorithm Theory (SWAT), Torshavn, Faroe Islands; 2020-06-22 - 2020-06-24; in: "17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)", LIPICS, 162 (2020), ISBN: 978-3-95977-150-4; 1 - 18
A Beam Search Approach to the Traveling Tournament Problem / N. Frohner, B. Neumann, G. Raidl / 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
Labeling Nonograms / M. Löffler, M. Nöllenburg / Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18
Balanced Independent and Dominating Sets onColored Interval Graphs / S. Bhore, J. Haunert, F. Klute, G. Li, M. Nöllenburg / Talk: EuroCG, Würzburg, Deutschland; 2020-03-16 - 2020-03-18
On Covering Segments with Unit Intervals / D. Bergren, E. Eiben, R. Ganian, I. Kanj / 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
Geometric Planar Networks on Bichromatic Points / S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg / 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
An Efficient Algorithm for Counting Markov Equivalent DAGs / R. Ganian, T. Hamm, T. Talvitie / 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
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks / E. Eiben, R. Ganian, T. Hamm, S. Ordyniak / 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
Adapting Stable Matchings to Evolving Preferences / R. Bredereck, J. Chen, D. Knop, J. Luo, R. Niedermeier / 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
On the Parameterized Complexity ofClustering Incomplete Data into Subspaces of Small Dimension / R. Ganian, I. Kanj, S. Ordyniak, S. Szeider / 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
Computing Optimal Hypertree Decompositions / A. Schidler, S. Szeider / 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
Crossing Layout in Non-planar Graph Drawings / M. Nöllenburg / in: "Beyond Planar Graphs", issued by: Hong SH., Tokuyama T.; Springer, Singapore, 2020, ISBN: 978-981-15-6532-8, 187 - 209
On Erdős-Szekeres-type problems for k-convex point sets / M. Balko, S. Bhore, L. Martinez-Sandoval, P. Valtr / European Journal of Combinatorics, 89 (2020), 1 - 22
A*-based construction of decision diagrams for a prize-collecting scheduling problem / M. Horn, J. Maschler, G. Raidl, E. Rönnberg / Computers & Operations Research, 126 (2020), 1 - 21
A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources / M. Horn, G. Raidl, E. Rönnberg / Annals of Operations Research, 82 (2020), 1 - 29
Efficient non-segregated routing for reconfigurable demand-aware networks / T. Fenz, K. Foerster, S. Schmid, A. Villedieu / Computer Communications, 164 (2020), 138 - 147
Towards a Polynomial Kernel for Directed Feedback VertexSet / B. Bergougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan / Algorithmica, 82 (2020), 1 - 21
On Existential MSO and Its Relation to ETH / R. Ganian, R. de Haan, I. Kanj, S. Szeider / ACM Transactions on Computation Theory, 12 (2020), 4; 1 - 32
Usingdecomposition-parametersforQBF:Mindtheprefix! / E. Eiben, R. Ganian, S. Ordyniak / Journal of Computer and System Sciences, 110 (2020), 1 - 21
On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem / R. Ganian, F. Klute, S. Ordyniak / Algorithmica, 82 (2020), 1 - 40
The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths / R. Ganian, S. Ordyniak / Algorithmica, 82 (2020), 1 - 27
Finding Longest Common Subsequences: New anytime A search results / M. Djukanovic, G. Raidl, C. Blum / Applied Soft Computing, 95 (2020), 1 - 21
An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem / M. Djukanovic, C. Berger, G. Raidl, C. Blum / Information Processing Letters, 166 (2020), 1 - 10
Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences / R. Bredereck, J. Chen, U. Finnendahl, R. Niedermeier / Autonomous Agents and Multi-Agent Systems, 34 (2020), 1 - 29
A Unified Model and Algorithms for Temporal Map Labeling / A. Gemsa, B. Niedermann, M. Nöllenburg / Algorithmica (online), 82 (2020), 2709 - 2736
Route schematization with landmarks / M. Galvão, J. Krukar, M. Nöllenburg, A. Schwering / Journal of Spatial Information Science, 21 (2020)
Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / Journal of Graph Algorithms and Applications, 24 (2020), 4; 603 - 620
A model for finding transition-minors / B. Klocker, H. Fleischner, G. Raidl / Discrete Applied Mathematics, 283 (2020), 242 - 264
Multi-level Area Balancing of Clustered Graphs / H. Wu, M. Nöllenburg, I. Viola / IEEE Transactions on Visualization and Computer Graphics, 12 (2020), 12; 1 - 12
Placing Labels in Road Maps: Algorithms and Complexity / A. Gemsa, B. Niedermann, M. Nöllenburg / Algorithmica (online), 82 (2020), 1881 - 1908
A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives / H. Wu, B. Niedermann, S. Takahashi, M. Roberts, M. Nöllenburg / Computer Graphics Forum, 39 (2020), 3; 619 - 646
Mixed Labeling: Integrating Internal and External Labels / L. Cmolik, V. Pavlovec, H. Wu, M. Nöllenburg / in: "IEEE Transactions on Visualization and Computer Graphics (TVCG)", K. Schmid (ed.); IEEE Computer Society Press, 2020, 1 - 14
Anytime algorithms for the longest common palindromic subsequence problem / M. Djukanovic, G. Raidl, C. Blum / Computers & Operations Research, 114 (2020), 20 pages
Solving longest common subsequence problems via a transformation to the maximum clique problem / C. Blum, M. Djukanovic, A. Santini, H. Jiang, C. Li, F. Manya, G. Raidl / Computers & Operations Research, 125 (2020), 17 pages
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada / D. Corneil, R. Ganian, A. Proskurowski / in: "Discrete Applied Mathematics", 278; Elsevier Science Publishers, 2020, 1 - 2

2019

An Introduction to Knowledge Compilation / F. Slivovsky / Talk: Kocoon Workshop, Arras, Frankreich (invited); 2019-12-16 - 2019-12-19
Parameterized Complexity Results for the Completion and Clustering of Incomplete Data / S. Szeider, R. Ganian, I. Kanj, S. Ordyniak / Talk: Kocoon Workshop, Arras, Frankreich; 2019-12-16 - 2019-12-19
Balanced Connected Subgraph Problem in Geometric Intersection Graphs / S. Bhore, S. Jana, S. Pandit, S. Roy / Talk: Annual International Conference on Combinatiorial Optimization and Applications (COCOA), Xiamen, Fujian, China; 2019-12-13 - 2019-12-15; in: "COCOA 2019: Combinatorial Optimization and Applications", LNCS, 11949 (2019), ISBN: 978-3-030-36411-3; 56 - 68
A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem / C. Blum, D. Thiruvady, A. Ernst, M. Horn, G. Raidl / 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
Computational Thinking und ADA.wien / S. Szeider / Talk: eEducation Fachtagung, Wien (invited); 2019-11-07 - 2019-11-09
Exploring Semi-Automatic Map Labeling / F. Klute, G. Li, R. Löffler, M. Nöllenburg, M. Schmidt / 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
World map of recipes / G. Li, S. Nickel, M. Nöllenburg, I. Viola, H. Wu / Poster: Graph Drawing Contest, unknown; 2019-10-19
Mixed Linear Layouts: Complexity, Heuristics, and Experiments / P. de Col, F. Klute, M. Nöllenburg / 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
On Strict (Outer-)Confluent Graphs / H. Förster, R. Ganian, F. Klute, M. Nöllenburg / 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
Maximizing Ink in Partial Edge Drawings of k-plane Graphs / M. Hummel, F. Klute, S. Nickel, M. Nöllenburg / 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
Computing Stable Demers Cartograms / S. Nickel, M. Sondag, W. Meulemans, M. Chimani, S.G. Kobourov, J. Peltonen, M. Nöllenburg / 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
Parameterized Algorithms for Book Embedding Problems / S. Bhore, R. Ganian, F. Montecchiani, M. Nöllenburg / 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
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time / T. Hamm / 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
Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers / N. Frohner, G. Raidl / 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
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation / M. Djukanovic, G. Raidl, C. Blum / 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
Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / T. Jatschka, T. Rodemann, G. Raidl / 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
Efficient Segment Folding is Hard / T. Horiyama, F. Klute, M. Korman, I. Parada, R. Uehara, K. Yamanaka / 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
Geometric Systems of Unbiased Representatives / A. Banik, B. Bhattacharya, S. Bhore, L. Martinez-Sandoval / Talk: Canadian Conference in Computational Geometry, Edmonton, Canada,; 2019-08-08 - 2019-08-10
Algorithm and Hardness Results on Liar´s Dominating Set and k-tuple Dominating Set / S. Banerjee, S. Bhore / Talk: International Workshop on Combinatorial Algorithms (IWOCA), Pisa; 2019-07-23 - 2019-07-25; in: "IWOCA 2019: Combinatorial Algorithms", LNCS, 11638 (2019), ISBN: 978-3-030-25004-1; 48 - 60
On Erdös-Szekeres-Type Problems for k-convex Point Sets / M. Balko, S. Bhore, L. Martinez-Sandoval, P. Valtr / Talk: International Workshop on Combinatorial Algorithms (IWOCA), Pisa; 2019-07-23 - 2019-07-25; in: "IWOCA 2019: Combinatorial Algorithms", LNCS, 11638 (2019), ISBN: 978-3-030-25004-1; 35 - 47
On the Potentials and Dilemmas of Cooperative/White-Label Deliveries based on Selected Austrian Demonstration Cases / M. Prandtstetter, B. Biesinger, B. Hu, P. Nolz, M. Reinthaler, J. Zajicek, A. Angelini, G. Hauger et al. / 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
Proof Complexity of Fragments of Long-Distance Q-Resolution / T. Peitl, F. Slivovsky, S. Szeider / 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
Combining Resolution-Path Dependencies with Dependency Learning / T. Peitl, F. Slivovsky, S. Szeider / 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
Extending to 1-plane drawings / T. Hamm, F. Klute, I. Parada / 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
Towards Improving Merging Heuristicsfor Binary Decision Diagrams / N. Frohner, G. Raidl / 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
A SAT Approach for Finding Sup-Transition-Minors / B. Klocker, H. Fleischner, G. Raidl / 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
Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks / T. Fenz, K. Foerster, S. Schmid, A. Villedieu / 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
A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / T. Jatschka, T. Rodemann, G. Raidl / 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
A Survey on Computing Schematic Network Maps: The Challenge to Interactivity / H. Wu, B. Niedermann, S. Takahashi, M. Nöllenburg / Talk: 2nd Schematic Mapping Workshop, TU Wien, Vienna; 2019-04-11 - 2019-04-12
Balanced Covering Problem in Bicolored point Sets / S. Bhore, S. Pandit, S. Roy / Talk: EuroCG, Utrecht, Niederlande; 2019-03-18 - 2019-03-20; in: "Proceeding of EuroCG 2019", (2019), 6 pages
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard / M. Chiu, J. Cleve, M. Nöllenburg / Talk: EuroCG, Utrecht, Niederlande; 2019-03-18 - 2019-03-20; in: "Extended abstract of EuroCG 2019", (2019), 1 - 9
VNS and PBIG as Optimization Cores in aCooperative Optimization Approach forDistributing Service Points / T. Jatschka, T. Rodemann, G. Raidl / 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
Casual Employee Scheduling with Constraint Programming and Metaheuristics / N. Frohner, S. Teuschl, G. Raidl / 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
Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem / M. Horn, G. Raidl / 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
VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / T. Jatschka, T. Rodemann, G. Raidl / 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
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem / M. Djukanovic, G. Raidl, C. Blum / 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
The Balanced Connected Subgraph Problem / S. Bhore, S. Chakraborty, S. Jana, J. Mitchell, S. Pandit, S. Roy / Talk: CALDAM, Kharagpur, India; 2019-02-14 - 2019-02-16; in: "CALDAM 2019: Algorithms and Discrete Applied Mathematics", LNCS, 11394 (2019), ISBN: 978-3-030-11508-1; 201 - 215
Strategies for Iteratively Refining Layered Graph Models / M. Riedler, M. Ruthmair, G. Raidl / 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
A Memetic Algorithm for Competitive Facility Location Problems / B. Biesinger, B. Hu, G. Raidl / in: "Business and Consumer Analytics: New Ideas", Springer, 2019, ISBN: 978-3-030-06221-7, 637 - 660
Metaheuristic Hybrids / G. Raidl, J. Puchinger, C. Blum / in: "Handbook of Metaheuristics", issued by: Michel Gendreau, Jean Yves Potvin, eds.; Springer, 2019, ISBN: 978-3-319-91085-7, 385 - 417
Parameterized Complexity of Asynchronous Border Minimization / R. Ganian, M. Kronegger, A. Pfandler, A. Popa / Algorithmica, 81 (2019), 1; 201 - 223
Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm / M. Horn, G. Raidl, C. Blum / Artificial Intelligence, 277 (2019), 1 - 26
Short Plane Supports for Spatial Hypergraphs / T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan / Journal of Graph Algorithms and Applications, 23 (2019), 3; 463 - 498
Planar drawings of fixed-mobile bigraphs / M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis / Theoretical Computer Science, 795 (2019), 408 - 419
Lombardi Drawings Of Knots And Links / P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber / Journal of Computational Geometry, 10 (2019), 1; 444 - 476
Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts / F. Klute, M. Nöllenburg / Journal of Computational Geometry, 10 (2019), 2; 45 - 69
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy / R. de Haan, S. Szeider / Algorithms, 12 (2019), 9; 1 - 28
A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / ACM Transactions on Computational Logic, 20 (2019), 3; 1 - 24
Dependency Learning for QBF / T. Peitl, F. Slivovsky, S. Szeider / Journal of Artificial Intelligence Research, 65 (2019), 65; 181 - 208
On the parameterized complexity of (k, s)-SAT / D. Paulusma, S. Szeider / Information Processing Letters, 134 (2019), 134; 34 - 36
External Labeling Techniques: A Taxonomy and Survey / M. Bekos, B. Niedermann, M. Nöllenburg / Computer Graphics Forum, 38 (2019), 3; 833 - 860
Metabopolis: scalable network layout for biological pathway diagrams in urban map style / H. Wu, M. Nöllenburg, F. Filipa L. Sousa, I. Viola / BMC Bioinformatics, 20 (2019), 187; 1 - 20
Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses / A. Nesic, M. Blaicher, T. Hoose, A. Hofmann, M. Lauermann, Y. Kutuvantavida, M. Nöllenburg, S. Randel, W. Freude, C. Koos / Optics Express, 27 (2019), 12; 17402 - 17425
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis / E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, C. Tzovas / Algorithms, Volume 12 (2019), Issue 7; 1 - 37
On the readability of leaders in boundary labeling / L. Barth, A. Gemsa, B. Niedermann, M. Nöllenburg / Information Visualization, 18 (2019), 1; 110 - 132
Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization / N. Frohner, S. Teuschl, G. Raidl / in: "Eurocast2019-EXTENDED ABSTRACTS", Universidad de Las Palmas de Gran Canaria, 2019, ISBN: 978-84-09-09208-6, 78 - 79
SAT-Encodings for Treecut Width and Treedepth / R. Ganian, N. Lodha, S. Ordyniak, S. Szeider / 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
Exact Approaches for Network Design Problems with Relays / M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair / Informs Journal on Computing, 31 (2019), 1; 23 pages

2018

Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity / E. Argyriou, S. Cornelsen, H. Förster, M Kaufmann, M. Nöllenburg, Y. Okamoto, C. Raftopoulou, A. Wolff / 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
Short Plane Supports for Spatial Hypergraphs / T. Castermans, M. van Garderen, W. Meulemans, M. Nöllenburg, X. Yuan / 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
Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem / J. Maschler, G. Raidl / 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
An {SMT} Approach to Fractional Hypertree Width / J. Fichte, M. Hecher, N. Lodha, S. Szeider / Talk: International Conference on Principles and Practice of Constraint Programming (CP), Lille, France; 2018-08-27 - 2018-08-31
Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts / F. Klute, M. Nöllenburg / 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
A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways / H. Wu, I. Viola, M. Nöllenburg / Poster: Eurographics Conference on Visualization (EuroVis 2018), Brno (invited); 2018-06-04 - 2018-06-08; in: "Proceedings of EuroVis 2018", Eurographics / VGTC, (2018)
The Travel of a Metabolite / H. Wu, M. Nöllenburg, I. Viola / 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)
Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs / M. Höller, F. Klute, S. Nickel, M. Nöllenburg, B. Schreiber / Talk: European Workshop on Computational Geometry (EuroCG'18), Berlin; 2018-03-21 - 2018-03-23
An SMT Approach to Fractional Hypertree Width / J. Fichte, M. Hecher, N. Lodha, S. Szeider / in: "Principles and Practice of Constraint Programming", issued by: Springer Verlag; Springer-Verlag, 2018, 109 - 127
Graph Visualization / Y. Hu, M. Nöllenburg / 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
Scalable Set Visualizations (Dagstuhl Seminar 17332) / Y. Hu, L. Micallef, M. Nöllenburg, P. Rodgers / 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
Bottleneck bichromatic full Steiner trees / A. Abu-Affash, S. Bhore, P. Carmi, D. Chakraborty / Information Processing Letters, 142 (2018), 14 - 19
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion / E. Eiben, R. Ganian, O. Kwon / Journal of Computer and System Sciences, 96 (2018), 121 - 146
On the Complexity of Rainbow Coloring Problems / E. Eiben, R. Ganian, J. Laurila / Discrete Applied Mathematics, 246 (2018), 38 - 48
The Complexity Landscape of Decompositional Parameters for ILP / R. Ganian, S. Ordyniak / Artificial Intelligence, 257 (2018), 61 - 71
Snarks with Special Spanning Trees / A. Hoffmann-Ostenhof, T. Jatschka / Graphs and Combinatorics, 1 (2018), 1 - 13
Cycle Double Covers via Kotzig Graphs / A. Hoffmann-Ostenhof, H. Fleischner, R. Häggkvist / Journal of Combinatorial Theory Series B, 1 (2018), 1 - 12
Planar and poly-arc Lombardi drawings / C. Duncan, D. Eppstein, M.T. Goodrich, S.G. Kobourov, M. Löffler, M. Nöllenburg / Journal of Computational Geometry, 9 (2018), 1; 328 - 355
Long-Distance Q-Resolution with Dependency Schemes / T. Peitl, F. Slivovsky, S. Szeider / Journal of Automated Reasoning, 80 (2018), 2; 1 - 29
Meta-kernelization using well-structured modulators / E. Eiben, R. Ganian, S. Szeider / Discrete Applied Mathematics, Volume 280 (2018), 153 - 167
Drawing Large Graphs by Multilevel Maxent-Stress Optimization / C. Schulz, M. Nöllenburg, H. Meyerhenke / IEEE Transactions on Visualization and Computer Graphics, 24 (2018), 5; 1814 - 1827
Solving a selective dial-a-ride problem with logic-based Benders decomposition / M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair / Computers & Operations Research, volume 96 (2018), 30 - 54
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem / R. Ganian, F. Klute, S. Ordyniak / 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
Small Resolution Proofs for QBF using Dependency Treewidth / E. Eiben, R. Ganian, S. Ordyniak / 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
Unary Integer Linear Programming with Structural Restrictions / E. Eiben, R. Ganian, D. Knop / 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
A Structural Approach to Activity Selection / E. Eiben, R. Ganian, S. Ordyniak / 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
Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments / J. Maschler, M. Riedler, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2017", issued by: Springer Verlag; Springer, 2018, ISBN: 978-3-319-74717-0, 364 - 372
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging / B. Klocker, G. Raidl / in: "Computer Aided Systems Theory -- EUROCAST 201", 10671; issued by: Springer; Springer LNCS, 2018, ISBN: 978-3-319-74727-9, 355 - 363
An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows / M. Horn, G. Raidl, E. Rönnberg / in: "Annals of Operations Research", 10479; Springer, 2018, 235 - 256
GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection / A. Expósito, G. Raidl, J. Brito, J. Moreno-Perez / in: "Computer Aided Systems Theory", 10671; issued by: Springer Verlag; Springer LNCS, 2018, 299 - 306
Portfolio-Based Algorithm Selection for Circuit QBFs / H. Hoos, T. Peitl, F. Slivovsky, S. Szeider / in: "Portfolio-Based Algorithm Selection for Circuit QBFs", 173; issued by: Springer Verlag; Springer-Verlag, 2018, 195 - 205
Polynomial-Time Validation of QCDCL Certificates / T. Peitl, F. Slivovsky, S. Szeider / 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
Parameterized Algorithms for the Matrix Completion Problem / R. Ganian, I. Kanj, S. Ordyniak, S. Szeider / in: "Proceeding of ICML", issued by: jmlr.org; Journal of Machine Learning Research, 2018, 1642 - 1651
Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments / J. Maschler, G. Raidl / Journal of Graph Theory, 96 (2018)

2017

Get Satisfaction: Das Erfüllbarkeitsproblem in Theorie und Praxis / S. Szeider / Keynote Lecture: 9. Informatiktag 2017, Tu Wien (invited); 2017-09-28
Towards Characterizing Strict Outerconfluent Graphs / F. Klute, M. Nöllenburg / 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
Minimizing Wiggles in Storyline Visualizations / T. Fröschl, M. Nöllenburg / 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
Planar L-Drawings of Directed Graphs / S. Chaplick, M. Chimani, S. Cornelsen, G. Da Lozzo, M. Nöllenburg, M. Patrignani, I. Tollis, A. Wolff / 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
Experimental Evaluation of Book Drawing Algorithms / J. Klawitter, T. Mchedlidze, M. Nöllenburg / 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
Planar Drawings of Fixed-Mobile Bigraphs / M. Bekos, F. De Luca, W. Didimo, T. Mchedlidze, M. Nöllenburg, A. Symvonis, I. Tollis / 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
Lombardi Drawings of Knots and Links / P. Kindermann, S.G. Kobourov, M. Löffler, M. Nöllenburg, A. Schulz, B. Vogtenhuber / 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
Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment / M. Horn, G. Raidl, C. Blum / 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
Capturing Structure in Instances of the Propositional Satisfiability Problem / S. Szeider / Talk: ÖMG-DMV-Congress 2017, Salzburg (invited); 2017-09-11 - 2017-09-15
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width / J. Fichte, N. Lodha, S. Szeider / 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
Towards a Polynomial Kernel for Directed Feedback Vertex Set / B. Bergnougnoux, E. Eiben, R. Ganian, S. Ordyniak, M. Ramanujan / 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
A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / 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
Using Layered Graphs to solve the Directed Network Design Problem with Relays / M. Riedler, M. Leitner, I. Ljubic, M. Ruthmair / Talk: 21st Conference of the International Federation of Operational Research Societies, Quebec Canada; 2017-07-17 - 2017-07-21
Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling / G. Raidl / Talk: University of Vienna, Department of Statistics and Operations Research, University of Vienna, Department of Statistics and Operations Research (invited); 2017-07-06
An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem / J. Maschler, T. Hackl, M. Riedler, G. Raidl / 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
Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem / C. Kloimüllner, G. Raidl / 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
Minimizing crossings in constrained two-sided circular graph layouts / F. Klute, M. Nöllenburg / Talk: EuroCG17, Schweden (invited); 2017-05-05
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control / C. Kloimüllner, G. Raidl / 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
An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem / G. Raidl / Talk: TU Graz, Institute for Discrete Mathematics, TU Graz, Institute for Discrete Mathematics (invited); 2017-03-21
Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments / J. Maschler, M. Riedler, G. Raidl / Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 106 - 107
GRASP and VNS for a periodic VRP with time windows to deal with milk collection / A. Exposit, G. Raidl, J. Brito, J. Moreno-Perez / Talk: Computer Aided Systems Theory - EUROCAST 2017, Spain; 2017-02-19 - 2017-02-24; in: "Computer Aided Systems Theory - EUROCAST 2017", (2017), 90 - 91
Going Beyond Primal Treewidth for (M)ILP / R. Ganian, S. Ordyniak, M. Ramanujan / 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
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable / M. S. Ramanujan, S. Szeider / 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
Backdoors for Constraint Satisfaction / S. Szeider / Talk: Workshop Gutin 60, Großbritanien (invited); 2017-01-07 - 2017-01-08
Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd / U. Gadiraju, S. Möller, M. Nöllenburg, D Saupe, S. Egger-Lampl, D. Archambault, B. Fisher / 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
The Constraint Satisfaction Problem: Complexity and Approximability / S. Szeider, S. Ordyniak, S. Gaspers / 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
Progress on Partial Edge Drawings / T. Bruckdorfer, S. Cornelsen, C. Gutwenger, M Kaufmann, F. Montecchiani, M. Nöllenburg, A. Wolff / Journal of Graph Algorithms and Applications, 21 (2017), 4; 757 - 786
Euclidean Greedy Drawings of Trees / R. Prutkin, M. Nöllenburg / Discrete & Computational Geometry, 58 (2017), 3; 543 - 579
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / M. Nöllenburg, R. Prutkin, I. Rutter / International Journal of Computational Geometry & Applications, 27 (2017), 1+2; 121 - 158
First order limits of sparse graphs: Plane trees and path-width / J. Gajarsky, P. Hlinený, T. Kaiser, D. Král, M. Kupec, J. Obdrzalek, S. Ordyniak, T. Vojtech / Random Structures and Algorithms, 50 (2017), 612 - 635
Kernelization using structural parameters on sparse graph classes / J. Gajarsky, P. Hlinený, J. Obdrzalek, S. Ordyniak, F. Reidl, P. Rossmanith, F. Villaamil Sanchez, S. Sikdar / Journal of Computer and System Sciences, 84 (2017), 219 - 242
Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition / C. Kloimüllner, G. Raidl / Networks, 69 (2017), 3; 270 - 289
Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm / P. Pop, S. Cosmin, B. Biesinger, B. Hu, G. Raidl / Carpathian Journal of Mathematics, 33 (2017), 3; 365 - 371
Parameterized complexity classes beyond para-NP / R. de Haan, S. Szeider / Journal of Computer and System Sciences, 87 (2017), 16 - 57
On Compiling Structured CNFs to OBDDs / S. Bova, F. Slivovsky / Theory of Computing Systems, 61 (2017), 637 - 655
The Treewidth of Proofs / M. Müller, S. Szeider / Information and Computation, 255 (2017), 147 - 164
Backdoors into heterogeneous classes of SAT and CSP / S. Gaspers, N. Misra, S. Ordyniak, S. Szeider, S. Zivný / Journal of Computer and System Sciences, 85 (2017), 38 - 56
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian, M. S. Ramanujan, S. Szeider / ACM Transactions on Algorithms, 13 (2017), 1 - 31
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances / R. de Haan, I. Kanj, S. Szeider / ACM Transactions on Computational Logic, 18 (2017), 1 - 46
Radial Contour Labeling with Straight Leaders / M. Nöllenburg, B. Niedermann, I. Rutter / in: "2017 IEEE Pacific Visualization Symposium", IEEE, 2017, 295 - 304
A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem / F. Dusberger, G. Raidl / 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
Backdoor Treewidth for SAT / R. Ganian, M. S. Ramanujan, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer-Verlag, 2017, ISBN: 978-3-319-66262-6, 20 - 37
New Width Parameters for Model Counting / R. Ganian, S. Szeider / 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
Dependency Learning for QBF / T. Peitl, F. Slivovsky, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", © Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 198 - 313
SAT-Encodings for Special Treewidth and Pathwidth / N. Lodha, S. Ordyniak, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 429 - 445
Combining Treewidth and Backdoors for CSP / R. Ganian, M. S. Ramanujan, S. Szeider / 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
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem / M. Riedler, T. Jatschka, J. Maschler, G. Raidl / International Transactions in Operational Research, 8 (2017)
Solving Problems on Graphs of High Rank-Width / E. Eiben, R. Ganian, S. Szeider / Algorithmica (online), 80 (2017), 80; 30 pages
Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems / G. Raidl / 2017

2016

Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / B. Klocker, G. Raidl / Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02
Integrating Algebraic Dynamic Programming in Combinatorial Optimization / C. Bacher, G. Raidl / Talk: Austrian Workshop on Metaheuristics, Graz; 2016-12-02
An Algorithmic Framework for Labeling Road Maps / B. Niedermann, M. Nöllenburg / 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
Robust Genealogy Drawings / F. Klute / 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
Stable Matching with Uncertain Linear Preferences / H. Aziz, P. Biro, S. Gaspers, R. de Haan, N. Mattei, B. Rastegari / 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
Backdoors to Tractable Valued CSP / R. Ganian, M. S. Ramanujan, S. Szeider / 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
Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics / G. Raidl, T. Jatschka, M. Riedler, J. Maschler / 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
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation / R. de Haan / 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
Clique-Width and Directed Width Measures for Answer-Set Programming / B. Bliem, S. Ordyniak, S. Woltran / 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
Particle Therapy Patient Scheduling: First Heuristic Approaches / J. Maschler, M. Riedler, M. Stock, G. Raidl / 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 Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion / E. Eiben, R. Ganian, O. Kwon / 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
Counting Linear Extensions Parameterizations by Treewidth / E. Eiben, R. Ganian, K. Kangas, S. Ordyniak / 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
On the Complexity Landscape of Connected f-Factor Problems* / R. Ganian, N. Narayanaswamy, S. Ordyniak, C. Rahul, M. S. Ramanujan / 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
On Existential MSO and its Relation to ETH / R. Ganian, R. de Haan, I. Kanj, S. Szeider / 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
SOBRA - Shielding Optimization for BRAchytherapy / G. Blin, M. Gasparoux, S. Ordyniak, A. Popa / 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
Capturing Structure in SAT and Related Problems / S. Szeider / Talk: Theoretical Foundations of SAT Solving Workshop, Toronto, Kanada (invited); 2016-08-15 - 2016-08-19
Algorithms for Vehicle Routing / G. Raidl / 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
Knowledge Compilation Meets Communication Complexity / S. Bova, F. Capelli, S. Mengel, F. Slivovsky / 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
A New Perspective on FO Model Checking of Dense Graph Classes / J. Gajarsky, P. Hlinený, J. Obdrzalek, D. Lokshtanov, M. S. Ramanujan / 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
Long Distance Q-Resolution with Dependency Schemes / T. Peitl, F. Slivovsky, S. Szeider / 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
A SAT Approach to Branchwidth / N. Lodha, S. Ordyniak, S. Szeider / 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
Capturing Structure in SAT and Related Problems / S. Szeider / Keynote Lecture: International Workshop on Graph Structure and Satisfiability Testing, Bordeaux, France (invited); 2016-07-04
Particle Therapy Patient Scheduling: First Heuristic Approaches / J. Maschler, M. Riedler, M. Stock, G. Raidl / Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06
Cyclic Giant Tour Decoding for the EVRPTW / C. Bacher, G. Raidl / Talk: European Conference on Operational Research, Poznan, Polen; 2016-07-03 - 2016-07-06
Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation / R. de Haan / 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
A Faster Parameterized Algorithm for Group Feedback Edge Set / M. S. Ramanujan / 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
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / B. Klocker, H. Fleischner, G. Raidl / 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
Districting and Routing for Security Control / M. Prischink, C. Kloimüllner, B. Biesinger, G. Raidl / 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
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees / R. Ganian, M. Kalany, S. Szeider, J. Träff / 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
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics / R. de Haan, S. Szeider / 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
Succinctness of Languages for Judgment Aggregation / U. Endriss, U. Grandi, R. de Haan, J. Lang / 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
Edge-Editing to a Dense and a Sparse Graph Class / M. Kotrbcık, R. Kralovic, S. Ordyniak / 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
A Parameterized Algorithm for Mixed-Cut / A. Rai, M. S. Ramanujan, S. Saurabh / 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
Software Visualization via Hierarchic Micro/Macro Layouts / M. Nöllenburg, I. Rutter, A. Schuhmacher / 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
SDDs Are Exponentially More Succinct than OBDDs / S. Bova / 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
Using Decomposition-Parameters for QBF: Mind the Prefix! / E. Eiben, R. Ganian, S. Ordyniak / 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
The Complexity Landscape of Decompositional Parameters for ILP / R. Ganian, S. Ordyniak / 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
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian, M. S. Ramanujan, S. Szeider / 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
Hybrid Metaheuristics -- Powerful Tools for Optimization / C. Blum, G. Raidl / Springer, 2016, ISBN: 978-3-319-30883-8; 172 pages
Proceedings of EmoVis 2016, ACM IUI 2016 Workshop on Emotion and Visualization / A. Kerren, D. Cernea, M. Pohl / Linköping Electronic Conference Proceedings, Linköping, Schweden, 2016, ISBN: 978-91-7685-817-2; 38 pages
Graph Drawing and Network Visualization 24th International Symposium / Y. Hu, M. Nöllenburg / Springer LNCS, 2016, ISBN: 978-3-319-50105-5
Models and algorithms for competitive facility location problems with different customer behavior. / B. Biesinger, B. Hu, G. Raidl / Annals of Mathematics and Artificial Intelligence, 76 (2016), 1; 93 - 119
New developments in metaheuristics and their applications / H. C. Lau, G. Raidl, P. Van Hentenryck / Journal of Heuristics, 22 (2016), 4; 359 - 363
Large Neighborhood Search for the Most Strings with Few Bad Columns Problem / E. Lizarraga, M. Blesa, C. Blum, G. Raidl / Journal of Heuristics, 21 (2016), 1 - 15
Tree-depth and vertex-minors / P. Hlinený, O. Kwon, J. Obdrzalek, S. Ordyniak / European Journal of Combinatorics, 56 (2016), 46 - 56
Directed elimination games / V. Engelmann, S. Ordyniak, S. Kreutzer / Discrete Applied Mathematics, 199 (2016), 187 - 198
Complexity and monotonicity results for domination games / S. Kreutzer, S. Ordyniak / Theoretical Computer Science, 628 (2016), 1 - 29
A Parameterized Study of Maximum Generalized Pattern Matching Problems / S. Ordyniak, A. Popa / Algorithmica, 75 (2016), 1 - 26
Extending Convex Partial Drawings of Graphs / T. Mchedlidze, M. Nöllenburg, I. Rutter / Algorithmica, 76 (2016), 47 - 67
Mixed map labeling / M. Löffler, M. Nöllenburg, F. Staals / Journal of Spatial Information Science, 13 (2016), 1 - 30
Consistent Labeling Of Rotating Maps / A. Gemsa, M. Nöllenburg, I. Rutter / Journal of Computational Geometry, 7 (2016), 1; 308 - 331
Meta-kernelization with structural parameters / R. Ganian, F. Slivovsky, S. Szeider / Journal of Computer and System Sciences, 82 (2016), 333 - 346
Backdoors to q-Horn / S. Gaspers, S. Ordyniak, M. S. Ramanujan, S. Saurabh, S. Szeider / Algorithmica (online), 74 (2016), 540 - 557
Soundness of Q-resolution with dependency schemes / F. Slivovsky, S. Szeider / Theoretical Computer Science, 612 (2016), 83 - 101
Quantified conjunctive queries on partially ordered sets / S. Bova, R. Ganian, S. Szeider / Theoretical Computer Science, 618 (2016), 72 - 84
Supereulerian graphs with width s and s-collapsible graphs / P. Li, H. Li, Y. Chen, H. Fleischner, H. Lai / Discrete Applied Mathematics, 200 (2016), 79 - 94
Evaluation of Labeling Strategies for Rotating Maps / A. Gemsa, M. Nöllenburg, I. Rutter / ACM Journal of Experimental Algorithmics, 21 (2016), 1; 1 - 21
On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs / M. Nöllenburg, R. Prutkin, I. Rutter / Journal of Computational Geometry, 7 (2016), 1; 47 - 69
Adjacency-Preserving Spatial Treemaps / K. Buchin, D. Eppstein, M. Löffler, M. Nöllenburg, R. Silveira / Journal of Computational Geometry, 7 (2016), 1; 100 - 122
Strict Confluent Drawing / D. Eppstein, D. Holten, M. Löffler, M. Nöllenburg, B. Speckmann, K. Verbeek / Journal of Computational Geometry, 7 (2016), 1; 22 - 46
Temporal map labeling: A new unified framework with experiments. Advances in Geographic Information Systems / L. Barth, B. Niedermann, M. Nöllenburg, D. Strash / 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
Backdoor Trees for Answer Set Programming / J. Fichte, S. Szeider / Report No. DBAI-TR-2016-98, 2016; 24 pages

2015

Generalized Basic Logic, Polynomial Space, and Disjunction Property / S. Bova / Talk: Workshop in Memoriam Franco Montagna, Siena, Italien (invited); 2015-12-16
Succinctness in Knowledge Representation / S. Bova / Talk: Research Seminar Birkbeck University of London, London, England (invited); 2015-12-10
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / M. Nöllenburg, R. Prutkin, I. Rutter / 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
Well-Structured Modulators: FPT Algorithms and Kernels / R. Ganian / Talk: Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Aussois, France (invited); 2015-10-11 - 2015-10-15
Numerical Optimisation Approach for a Large Gas Engine Considering Different Fuel Gas Qualities / W. Holly, T. Lauer, R. Pachler, F. Winter, C. Bacher, H. Schuemie, S. Murakami / Talk: 15th Conference "The Working Process of the Internal Combustion Engine", Graz; 2015-09-24 - 2015-09-25; in: "Proceedings", (2015), 16 pages
On Compiling CNFs into Structured Deterministic DNNFs / S. Bova, F. Capelli, S. Mengel, F. Slivovsky / 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
Community Structure Inspired Algorithms for SAT and #SAT / R. Ganian, S. Szeider / 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
On the Readability of Boundary Labeling / M. Nöllenburg, L. Barth, B. Niedermann, A. Gemsa / 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
Recognizing Weighted Disk Contact Graphs / M. Nöllenburg, B. Klemz, R. Prutkin / 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
Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem / M. Nöllenburg, J. Klawitter, T. Ueckerdt / 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
On Minimizing Crossings in Storyline Visualizations / M. Nöllenburg, I. Kostitsyna, V. Polishchuk, A. Schulz, D. Strash / 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
Drawing Large Graphs by Multilevel Maxent-Stress Optimization / M. Nöllenburg, H. Meyerhenke, C. Schulz / 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
Dependency Schemes for Quantified Boolean Formulas / F. Slivovsky / Talk: International Workshop on Quantified Boolean Formulas, Austin, Texas (invited); 2015-09-23
Meta-kernelization using Well-structured Modulators / E. Eiben, R. Ganian, S. Szeider / 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
First-Order Queries on Finite Abelian Groups / S. Bova, M. Barnaby / 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
A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem / J. Maschler, G. Raidl / 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
Algorithmic Applications of Tree-Cut Width / R. Ganian, Ej Kim, S. Szeider / 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
Parameterized Algorithms for Parity Games / J. Gajarsky, M. Lampis, K. Makino, V. Mitsou, S. Ordyniak / 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
Solving Problems on Graphs of High Rank-Width / E. Eiben, R. Ganian, S. Szeider / 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
On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics / E. Lizarraga, M. Blesa, C. Blum, G. Raidl / 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
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / F. Dusberger, M. Abseher, N. Musliu, S. Woltran / Talk: Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina; 2015-07-25 - 2015-07-31; in: "Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence", Q. Yang, M. Wooldridge (ed.); AAAI Press, (2015), ISBN: 978-1-57735-738-4; 275 - 282
Fixed-parameter Tractable Reductions to SAT for Planning / R. de Haan, M. Kronegger, A. Pfandler / 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
A Dichotomy Result for Ramsey Quantifiers / R. de Haan, J. Szymanik / 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
On Compiling Structured CNFs to OBDDs / S. Bova, F. Slivovsky / 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
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / R. Ganian / Talk: Contemporary Trends in Theoretical Computer Science 2015, Prag, Tschechien (invited); 2015-06-26 - 2015-06-27
Variable-Deletion Backdoors to Planning / S. Ordyniak / Talk: Postdoc Presentation Days, Masaryk University Brno (invited); 2015-06-21 - 2015-06-26
Mixed Integer Programming Models for Hybrid Electric Vehicle Routing / C. Bacher, G. Raidl / Talk: VeroLog 2015, Universität Wien (invited); 2015-06-08 - 2015-06-10
A Strongly Exponential Separation of DNNFs from CNFs / S. Bova / Talk: Symposium on New Frontiers in Knowledge Compilation, Wien (invited); 2015-06-05
A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design / C. Schauer, G. Raidl / 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
An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands / B. Biesinger, B. Hu, G. Raidl / 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
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation / R. de Haan, U. Endriss, S. Szeider / 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
Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young / R. de Haan, U. Endriss / 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
A Survey on Parameterized Complexity and SAT / S. Szeider / Talk: Dagstuhl Seminar, Schloss Dagstuhl, Deutschland (invited); 2015-04-19 - 2015-04-24
A New Solution Representation for the Firefighter Problem / B. Hu, A. Windbichler, G. Raidl / 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
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands / B. Biesinger, B. Hu, G. Raidl / 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
Parameterized Compilability of Clause Entailment / S. Bova / Talk: ANR Workshop 2015, Paris, France (invited); 2015-04-01
Algorithmic Applications of Large Well-Structured Modulators / R. Ganian / Talk: Algorithmic Model Theory Meeting 2015 - ALMOTH 2015, Bayreuth, Deutschland (invited); 2015-02-26 - 2015-02-27
Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem / C. Schauer, G. Raidl / 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
Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm / D. Markvica, C. Schauer, G. Raidl / 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
A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems / C. Kloimüllner, P. Papazek, G. Raidl, B. Hu / 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
A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles / C. Bacher, G. Raidl / 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
Heuristic Approaches for the Probabilistic Traveling Salesman Problem / B. Biesinger, C. Weiler, B. Hu, G. Raidl / 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
A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size / F. Dusberger, G. Raidl / 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
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP / R. de Haan, S. Szeider / 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
Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem / A. Tus, A. Rendl, G. Raidl / 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
A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem / B. Biesinger, B. Hu, G. Raidl / Journal of Heuristics, 21 (2015), 3; 391 - 431
Parameterized and subexponential-time complexity ofsatisfiability problems and applications / I. Kanj, S. Szeider / Theoretical Computer Science, 607 (2015), 282 - 295
Model Checking Existential Logic on Partially Ordered Sets / S. Bova, R. Ganian, S. Szeider / ACM Transactions on Computational Logic, 17 (2015), 2; 1 - 35
Model Counting for CNF Formulas of Bounded Modular Treewidth / D. Paulusma, F. Slivovsky, S. Szeider / Algorithmica, First online: 17 July 2015 (2015), 1 - 27
Quantifier Reordering for QBF / F. Slivovsky, S. Szeider / Journal of Automated Reasoning, Volume 55 (2015), 1 - 19
Decomposition based hybrid metaheuristics / G. Raidl / European Journal of Operational Research (invited), 244 (2015), 1; 66 - 76
Computing Secure Sets in Graphs using Answer Set Programming / F. Dusberger, M. Abseher, B. Bliem, G. Charwat, S. Woltran / Journal of Logic and Computation, 2015 special issue (2015), 2015 special issue; 1 - 26
Backdoors to Normality for Disjunctive Logic Programs / J. Fichte, S. Szeider / ACM Transactions on Computational Logic, 17 (2015), 1; 7:1 - 7:23
A SAT Approach to Clique-Width / M. Heule, S. Szeider / ACM Transactions on Computational Logic, 16/3 (2015), 1 - 27
On finding optimal polytrees / S. Gaspers, M. Koivisto, M. Liedloff, S. Ordyniak, S. Szeider / Theoretical Computer Science, 592 (2015), 49 - 58
A Complete Parameterized Complexity Analysis of Bounded Planning / P. Jonsson, S. Ordyniak, S. Szeider / Journal of Computer and System Sciences, 81/7 (2015), 1311 - 1332
Improving Vertex Cover as a Graph Parameter / R. Ganian / Discrete Mathematics & Theoretical Computer Science, 17/2 (2015), 77 - 100
Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem / C. Blum, G. Raidl / Optimization Letters, online 07/2015 (2015), 1 - 17
Backdoors to tractable answer-set programming / J. Fichte, S. Szeider / Artificial Intelligence, 220 (2015), 64 - 103
On the Subexponential-Time Complexity of CSP / R. de Haan, I. Kanj, S. Szeider / Journal of Artificial Intelligence Research, 52 (2015), 52; 203 - 234
Numerical Optimization of Electro Hybrid Powertrains / T. Krenek, C. Bacher, G. Raidl, T. Lauer / MTZ worldwide, 76 (2015), 3; 46 - 52
Numerische Optimierung elektrifizierter Antriebsstränge / T. Krenek, C. Bacher, G. Raidl, T. Lauer / MTZ - Motortechnische Zeitschrift, 76 (2015), 3; 66 - 74
FO Model Checking of Interval Graphs / R. Ganian, P. Hlinený, D. Král, J. Obdrzalek, J. Schwartz, J. Teska / Logical Methods in Computer Science, 11 (2015), 4; 20 pages

2014

Exact Approaches to the Network Design Problem with Relays / M. Leitner, I. Ljubic, M. Riedler, M. Ruthmair / Talk: EULOG 2014, Wien; 2014-11-17 - 2014-11-18
Balancing Bicycle Sharing Systems / C. Kloimüllner, P. Papazek, B. Hu, G. Raidl / Talk: EULOG 2014, Wien; 2014-11-17 - 2014-11-18
Variable Neighborhood Search Hybrids / G. Raidl / Keynote Lecture: VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien (invited); 2014-10-08 - 2014-10-11
Boosting an exact logic-based benders decomposition approach by variable neighborhood search. / G. Raidl, T. Baumhauer, B. Hu / 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
Variable neighbourhood search for integrated timetable design of railway infrastructure. / I. Grujicic, G. Raidl, A. Schöbel / 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
Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. / F. Dusberger, G. Raidl / 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
An Efficient Variable Neighborhood Search for Solving a Robust Dynamic Facility Location Problem in Emergency Service Network / S. Miskovic, Z. Stanimirovic, I. Grujicic / 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
The D-FLAT System for Dynamic Programming on Tree Decompositions. / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Talk: European Conference on Logics in Artificial Intelligence (JELIA), Madeira; 2014-09-24 - 2014-09-26; in: "Logics in Artificial Intelligence - 14th European Conference, JELIA 2014", E. Fermé, J. Leite (ed.); Springer, (2014), ISSN: 0302-9743; 558 - 572
Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid. / P. Papazek, C. Kloimüllner, B. Hu, G. Raidl / 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
Computing Secure Sets in Graphs using Answer Set Programming. / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, S. Woltran / Talk: ASPOCP 2014 - 7th Workshop on Answer Set Programming and Other Computing Paradigms, Wien; 2014-07-23; in: "7th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014", (2014)
An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods / S. Biffl, R. Mordinyi, G. Raidl, H. Steininger, D. Winkler / 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
A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. / F. Dusberger, G. Raidl / 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
Speeding up logic-based benders' decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem. / G. Raidl, T. Baumhauer, B. Hu / 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
A metaheuristic approach for integrated timetable based design of railway infrastructure / I. Grujicic, G. Raidl, A. Schöbel, G. Besau / 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
A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure / I. Grujicic, G. Raidl, A. Schöbel, G. Besau / Talk: 3rd 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
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. / C. Kloimüllner, P. Papazek, B. Hu, G. Raidl / 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
Reducing the number of simulations in operation strategy optimization for hybrid electric vehicles. / C. Bacher, T. Krenek, G. Raidl / 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
An evolutionary algorithm for the leader-follower facility location problem with proportional customer behavior. / B. Biesinger, B. Hu, G. Raidl / 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
A Memetic Algorithm for the Virtual Network Mapping Problem. / J. Inführ, G. Raidl / Journal of Heuristics (invited), Dezember 2014 (2014), 1 - 31
PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. / M. Rainer-Harbach, P. Papazek, G. Raidl, B. Hu, C. Kloimüllner / Journal of Global Optimization (invited), April (2014), 1 - 33
D-FLAT: Progress Report / M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran / Report for TU Wien, Institut fuer Informationssysteme; Report No. DBAI-TR-2014-86, 2014; 57 pages

2013

A memetic algorithm for the virtual network mapping problem / J. Inführ, G. Raidl / 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
Clique and independent set based grasp approaches for the regenerator location problem / P. Jahrmann, G. Raidl / Talk: Metaheuristics International Conference (MIC), Singapore; 2013-08-05 - 2013-08-08; in: "Proceedings of the 10th Metaheuristics International Conference", (2013), 1 - 10
Metaheuristics and Hybrid Optimization Approaches - A Unifying View / G. Raidl / Talk: European Conference on Operational Research, Rom (invited); 2013-07-03
Metaheuristics for the Static Balancing of Bicycle Sharing Systems / G. Raidl / Talk: European Conference on Operational Research, Rom; 2013-07-03
Robust variable selection in linear regression with compositional explanatory variables / F. Schroeder, A Braumann, P. Filzmoser, K. Hron / 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
Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations / G. Raidl, B. Hu, M. Rainer-Harbach, P. Papazek / 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
GRASP and variable neighborhood search for the virtual network mapping problem / J. Inführ, G. Raidl / 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
An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure / A. Schöbel, G. Raidl, I. Grujicic, G. Besau, G. Schuster / 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
Balancing bicycle sharing systems: A variable neighborhood search approach / M. Rainer-Harbach, P. Papazek, B. Hu, G. Raidl / 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
Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent / J. Inführ, G. Raidl / 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
Using optimized virtual network embedding for network dimensioning / J. Inführ, D. Stezenbach, M. Hartmann, K. Tutschku, G. Raidl / 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
Optimization Approaches for Balancing Bicycle Sharing Systems / G. Raidl / Talk: Department of Business Administration, Production and Operations Management Group, University of Vienna, Wien (invited); 2013-03-08
A memetic algorithm for the partition graph coloring problem / P. Pop, B. Hu, G. Raidl / 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
A pilot/vnd/grasp hybrid for balancing bicycle sharing systems / P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu / 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
A mixed integer model for the stamina-aware sightseeing tour problem / B. Hu, W. Ölz, G. Raidl / 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
Reconstructing cross cut shredded documents with a genetic algorithm with solution archive / B. Biesinger, C. Schauer, B. Hu, G. Raidl / 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
A timeslot-filling based heuristic approach to construct high-school timetables / M. Pimmer, G. Raidl / in: "Advances in Metaheuristics", Springer, 2013, ISBN: 978-1-4614-6322-1, 143 - 158
Proceedings of the 10th Metaheuristics International Conference / H. C. Lau, G. Raidl, P. Van Hentenryck / Singapore Management University, Singapore, 2013
Stabilizing branch-and-price for constrained tree problems / M. Leitner, M. Ruthmair, G. Raidl / Networks, Volume 61 (2013), 2; 150 - 170
Metaheuristics for solving a multimodal home-healthcare scheduling problem / G. Hiermann, M. Prandtstetter, A. Rendl, J. Puchinger, G. Raidl / Central European Journal of Operations Research, May 2013 (2013)
A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem / P. Pop, B. Hu, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 219 - 226
A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems / P. Papazek, G. Raidl, M. Rainer-Harbach, B. Hu / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 372 - 379
Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / B. Biesinger, C. Schauer, B. Hu, G. Raidl / in: "Computer Aided Systems Theory - EUROCAST 2013 - Part 1", Springer, 2013, ISBN: 978-3-642-53855-1, 380 - 387

2012

Balancing Bicycle Sharing Systems by Variable Neighborhood Search / M. Rainer-Harbach, P. Papazek / Talk: Austrian Workshop on Metaheuristics, Graz; 2012-12-06
Hybrid Metaheuristics and Matheuristics / G. Raidl / Talk: International Conference on Metaheuristics and Nature Inspired Computing, Port El-Kantaoiui, Tunisia (invited); 2012-10-27 - 2012-10-31
Balancing Bicycle Sharing Systems by Variable Neighborhood Search / G. Raidl, E. Causevic, B. Hu, M. Rainer-Harbach / Talk: EUROmC XXVIII VNS, Herceg Novi, Montenegro (invited); 2012-10-04 - 2012-10-07
Robust variable selection for linear regression models with compositional data / F. Schroeder, A Braumann, P. Filzmoser / Talk: Statistische Woche 2012, TU Wien; 2012-09-18 - 2012-09-21
Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design / C. Schauer, G. Raidl / 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
An Adaptive Layers Framework for Vehicle Routing Problems / M. Ruthmair, G. Raidl / Talk: International Symposium on Mathematical Programming, Berlin, Deutschland; 2012-08-19 - 2012-08-24
An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem / B. Hu, G. Raidl / 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
A hybrid heuristic for multimodal homecare scheduling / A. Rendl, M. Prandtstetter, G. Hiermann, J. Puchinger, G. Raidl / 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
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem / M. Ruthmair, G. Raidl / 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
A variable neighborhood search approach for the two-echelon location-routing problem / M. Schwengerer, S. Pirkwieser, G. Raidl / 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
Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles / T. Krenek, M. Ruthmair, G. Raidl, M. Planer / 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
An Adaptive Layers Framework for Resource-Constrained Network Design Problems / M. Ruthmair, G. Raidl / Talk: INFORMS Telecommunications Conference, Boca Raton, Florida, USA; 2012-03-15 - 2012-03-17
Solving the post enrolment course timetabling problem by ant colony optimization / C. Nothegger, A. Mayer, A Chwatal, G. Raidl / Annals of Operations Research, Volume 194 (2012), 1; 325 - 339

2011

A branch-and-cut-and-price algorithm for a fingerprint-template compression application / A Chwatal, C. Thöni, K. Oberlechner, G. Raidl / 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
Tackling the loading aspect of the vehicle routing problem with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / Talk: Metaheuristics International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 679 - 681
A timeslot-filling based heuristic approach to construct high-school timetables / M. Pimmer, G. Raidl / Talk: Metaheuristic International Conference (MIC), Udine, Italy; 2011-07-25 - 2011-07-28; in: "Proceedings of the 9th Metaheuristics International Conference", (2011), 349 - 358
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems / M. Ruthmair, G. Raidl / 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
Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem / M. Leitner, M. Ruthmair, G. Raidl / 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
Introducing the virtual network mapping problem with delay, routing and location constraints / J. Inführ, G. Raidl / 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
Stabilized column generation for the rooted delay-constrained Steiner tree problem / M. Leitner, M. Ruthmair, G. Raidl / 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
Improved packing and routing of vehicles with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / 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
Automatic generation of 2-antwars players with genetic programming / J. Inführ, G. Raidl / 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
An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / B. Hu, G. Raidl / 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
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Berlakovich, M. Ruthmair, G. Raidl / 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
A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, G. Raidl / 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
Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location / M. Leitner, G. Raidl / 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
Automatic generation of 2-AntWars players with Genetic Programming / J. Inführ, G. Raidl / 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
Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, A. Hubmer, G. Raidl / 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
Variable neighborhood search for capacitated connected facility location / M. Leitner, G. Raidl / 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
A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Berlakovich, M. Ruthmair, G. Raidl / 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
An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / B. Hu, G. Raidl / 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
Hybrid metaheuristics in combinatorial optimization: A survey / C. Blum, J. Puchinger, G. Raidl, A. Roli / Applied Soft Computing, Volume 11 (2011), Issue 6; 4135 - 4151
Branch-and-cut-and-price for capacitated connected facility location / M. Leitner, G. Raidl / Journal of Mathematical Modelling and Algorithms, Volume 10 (2011), Number 3; 245 - 267
Solving the minimum label spanning tree problem by mathematical programming techniques / A Chwatal, G. Raidl / Advances in Operations Research, Volume 2011 (2011)
Improved packing and routing of vehicles with compartments / S. Pirkwieser, G. Raidl, J. Gottlieb / 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

2010

A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem / A. Pagacz, B. Hu, G. Raidl / 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
A memetic algorithm for reconstructing cross-cut shredded text documents / C. Schauer, M. Prandtstetter, G. Raidl / 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
Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem / S. Pirkwieser, G. Raidl / 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
Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem / M. Ruthmair, G. Raidl / 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
Solving the minimum label spanning tree problem by ant colony optimization / A Chwatal, G. Raidl / 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
Fitting multi-planet transit models to photometric time-data series by evolution strategies / A Chwatal, G. Raidl, M. Zöch / 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
Matheuristics for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / 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
Similarity searching in sequences of complex events / H. Obweger, M. Suntinger, J. Schiefer, G. Raidl / 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
Trend-based similarity search in time-series data / M. Suntinger, H. Obweger, J. Schiefer, P. Limbeck, G. Raidl / 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
Enhancing genetic algorithms by a trie-based complete solution archive / G. Raidl, B. Hu / Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 239 - 251
Multilevel variable neighborhood search for periodic routing problems / S. Pirkwieser, G. Raidl / Talk: EvoCOP 2010, Istanbul, Turkey; 2010-04-07 - 2010-04-09; in: "Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010", (2010), 226 - 238
Strong lower bounds for a survivable network design problem / M. Leitner, G. Raidl / 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
Hybrid metaheuristics / C. Blum, J. Puchinger, G. Raidl, A. Roli / in: "Hybrid Optimization -The Ten Years of CPAIOR", Springer, 2010, 305 - 336
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 / M. Blesa, C. Blum, G. Raidl, A. Roli, M. Sampels / Springer, 2010, ISBN: 978-3642160530
The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search / B. Hu, M. Leitner, G. Raidl / Networks, 55 (2010), 3; 257 - 275
The multidimensional knapsack problem: Structure and algorithms / J. Puchinger, G. Raidl, U. Pferschy / Informs Journal on Computing, 22 (2010), 2; 250 - 265
A brief survey on hybrid metaheuristics / C. Blum, J. Puchinger, G. Raidl, A. Roli / 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

2009

Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Keynote Lecture: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znaim, Tschechien (invited); 2009-11-13 - 2009-11-15
Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik / G. Raidl / Talk: Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer, Wien (invited); 2009-10-21
Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search / J. Walla, M. Ruthmair, G. Raidl / 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
Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / 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
Computing optimized stock (re-)placements in last-in, first-out warehouses / U. Ritzinger, M. Prandtstetter, G. Raidl / Talk: Logistik Management, Hamburg, Deutschland; 2009-09-02 - 2009-09-04; in: "Logistik Management", (2009), ISBN: 978-3-7908-2361-5; 279 - 298
A memetic algorithm for the generalized minimum vertex-biconnected network problem / B. Hu, G. Raidl / 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
Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques / S. Pirkwieser, G. Raidl / 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
A lagrangian decomposition based heuristic for capacitated connected facility location / M. Leitner, G. Raidl / Talk: Metaheuristic International Conference (MIC), Hamburg; 2009-07-13; in: "Proceedings of the 8th Metaheuristic International Conference (MIC 2009)", (2009)
Meta-heuristics for reconstructing cross cut shredded text documents / M. Prandtstetter, G. Raidl / 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
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances / M. Gruber, G. Raidl / 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
Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme / G. Raidl / Talk: Upper Austrian University of Applied Sciences, Department of Software Engineering, Hagenberg (invited); 2009-05-06
Solving a multi-constrained network design problem by lagrangean decomposition and column generation / A Chwatal, N. Musil, G. Raidl / 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 column generation approach for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / 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
Accelerating column generation for a survivable network design problem / M. Leitner, G. Raidl, U. Pferschy / 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
Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Talk: University of Nottingham, School of Computer Science, Nottingham, United Kingdom (invited); 2009-04-22
A hybrid algorithm for computing tours in a spare parts warehouse / M. Prandtstetter, G. Raidl, T. Misar / 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
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / M. Ruthmair, G. Raidl / 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
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics / M. Gruber, G. Raidl / 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
A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem / M. Ruthmair, G. Raidl / 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
Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / 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
Fitting rectangular signals to time series data by metaheuristic algorithms / A Chwatal, G. Raidl / 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
Fitting multi-planet transit models to corot time-data series by evolutionary algorithms / A Chwatal, G. Wuchterl, G. Raidl / Poster: COROT, Paris; 2009-02-02 - 2009-02-05
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics / J. Puchinger, G. Raidl, S. Pirkwieser / in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1441913050, 71 - 102
(Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / in: "Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems", Springer, 2009, ISBN: 978-1-4419-1305-0, 209 - 230
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference / G. Raidl et al. / ACM Press, 2009, ISBN: 978-1-60558-505-5; 1728 pages
Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. / A Chwatal, G. Raidl, K. Oberlechner / Journal of Mathematical Modelling and Algorithms, Volume 8 (2009), 3; 293 - 334

2008

Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / G. Raidl / Talk: First Int. Workshop on Information Network Design, Kitakyushu City, Fukuoka, Japan (invited); 2008-12-05
Cooperative Hybrids for Combinatorial Optimization / G. Raidl / Talk: Int. Workshop on Nature Inspired Cooperative Strategies for Optimization, Puerto de La Cruz, Tenerife, Spain (invited); 2008-11-13
A variable neighborhood search for the periodic vehicle routing problem with time windows / S. Pirkwieser, G. Raidl / 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)
Combining forces to reconstruct strip shredded text documents / M. Prandtstetter, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 175 - 189
Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks / M. Leitner, G. Raidl / Talk: International Workshop on Hybrid Metaheuristics (HM), Malaga, Spanien; 2008-10-08 - 2008-10-09; in: "Hybrid Metaheuristics 2008", (2008), 158 - 174
A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / G. Raidl, M. Gruber / 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
Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem / B. Hu, G. Raidl / 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
Solving the post enrolment course timetabling problem by ant colony optimization / A. Mayer, C. Nothegger, A Chwatal, G. Raidl / 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
Variable neighborhood search for a prize collecting capacity constrained connected facility location problem / M. Leitner, G. Raidl / 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
Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / 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
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms / S. Pirkwieser, G. Raidl / 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
Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees / S. Pirkwieser, R. Ruiz-Torrubiano, G. Raidl / Poster: BIRD'08 2nd International Conference on Bioinformatics Research and Development, Wien (invited); 2008-07-07 - 2008-07-09
(Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem / M. Gruber, G. Raidl / 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)
Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / M. Gruber / Talk: Entscheidungsunterstützung in der Logistik-Geographische Informationssysteme, Simulation und Optimierung, Salzburg (invited); 2008-04-18 - 2008-04-19
Effective neighborhood structures for the generalized traveling salesman problem / B. Hu, G. Raidl / 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
Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization / G. Raidl, J. Puchinger / in: "Hybrid Metaheuristics - An Emergent Approach for Combinatorial Optimization, volume 114 of Studies in Computational Intelligence", Springer, 2008, 31 - 62
A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem / S. Pirkwieser, G. Raidl, J. Puchinger / in: "Recent Advances in Evolutionary Computation for Combinatorial Optimization", Springer, 2008, 69 - 85
Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / J. Puchinger, G. Raidl / Journal of Heuristics (invited), 14 (2008), 5; 457 - 472
An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / M. Prandtstetter, G. Raidl / European Journal of Operational Research (invited), 191 (2008), 3; 1004 - 1022
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / B. Hu, M. Leitner, G. Raidl / Journal of Heuristics, 14 (2008), 5; 473 - 499

2007

Fingerprint template compression by solving a minimum label $k$-node subtree problem / G. Raidl, A Chwatal / 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
Applying branch-and-cut for compressing fingerprint templates / A Chwatal, G. Raidl / Talk: EURO XXII: 22nd European Conference on Operational Research, Prag, Tschechische Republik; 2007-07-08 - 2007-07-11
Compressing fingerprint templates by solving an extended minimum label spanning tree problem. / A Chwatal, G. Raidl, O. Dietzel / 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 Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks / D. Wagner, U. Pferschy, P. Mutzel, G. Raidl, P. Bachhiesl / Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007)
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem / M. Leitner, B. Hu, G. Raidl / Talk: International Network Optimization Conference, Spa, Belgien; 2007-04-22 - 2007-04-25; in: "Proceedings of the International Network Optimization Conference 2007", (2007)
Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem / S. Pirkwieser, G. Raidl, J. Puchinger / 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
Determining orbital elements of extrasolar planets by evolution strategies. / A Chwatal, G. Raidl / 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)
Reconstructing Sheets of Manually Torn Paper / M. Prandtstetter, G. Raidl, P. Schüller / Talk: 11th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2007-01-08 - 2007-01-12
Models and algorithms for three-stage two-dimensional bin packing / J. Puchinger, G. Raidl / European Journal of Operational Research, 183 (2007), 3; 1304 - 1327
CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing / J. Hetzl, A.M. Foerster, G. Raidl, O. Mittelsten Scheid / Plant Journal, 51 (2007), 3; 526 - 536
Determining orbital elements of extrasolar planets by evolution strategies. / A Chwatal, G. Raidl / 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

2006

Variable neighborhood descent with self-adaptive neighborhood-ordering. / B. Hu, G. Raidl / 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)
A unified view on hybrid metaheuristics. / G. Raidl / 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
Metaheuristics for Solving a Scheduling Problem in Car Manufacturing / G. Raidl / Talk: ICAM5 - Fifth International Conference on Applied Mathematics, Baia Mare, Rumänien; 2006-09-21 - 2006-09-25
A new approximation algorithm for bend minimization in the kandinsky model. / C Yildiz, P. Mutzel, W. Barth / 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
A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. / D. Wagner, G. Raidl, U. Pferschy, P. Mutzel, P. Bachhiesl / 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
Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems / B. Hu, M. Leitner, G. Raidl / Talk: 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006), Bertinoro, Italien; 2006-08-27 - 2006-08-30
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem / G. Raidl, B. Hu, M. Leitner / Talk: 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brasilien; 2006-07-30 - 2006-08-04
Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. / M. Gruber, J van Hemert, G. Raidl / 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
The core concept for the multidimensional knapsack problem. / J. Puchinger, G. Raidl, U. Pferschy / 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
Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem / M. Prandtstetter, G. Raidl / Talk: 10th International Workshop on Combinatorial Optimization, Aussois, Frankreich; 2006-01-09 - 2006-01-13
Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. / J. Gottlieb, G. Raidl / Springer, Heidelberg, 2006, ISBN: 978-3-540-33178-0; 293 pages
Biased Mutation Operators for Subgraph-Selection Problems / G. Raidl, G. Koller, B. Julstrom / IEEE Transactions on Evolutionary Computation, Volume 10 (2006), 2; 145 - 156
Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. / N. Mujezinovic, G. Raidl, J. Hutchins, J. Peters, K. Mechtler, F. Eisenhaber / Proteomics, Vol 6 (2006), 19; 5117 - 5131
Evolutionary approach to constrained minimum spanning tree problem. / A. Pagacz, G. Raidl, S. Zawislak / 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
Models and algorithms for three-stage two-dimensional bin packing. / J. Puchinger, G. Raidl / Report for European Journal of Operations Research, Feature Issue on Cutting and Packing; 2006; 33 pages
Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. / J. Puchinger, G. Raidl / Report for submitted to Journal of Heuristics.; Report No. TR 186-1-06-02, 2006; 33 pages
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. / B. Hu, M. Leitner, G. Raidl / Report for Journal of Heuristics; Report No. Technical Report TR 186-1-06-01, 2006; 36 pages

2005

Computing generalized minimum spanning trees with variable neighborhood search. / B. Hu, M. Leitner, G. Raidl / 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
Variable neighborhood search for the bounded diameter minimum spanning tree problem. / M. Gruber, G. Raidl / 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
A variable neihborhood search approach for solving the car sequencing problem. / M. Prandtstetter, G. Raidl / 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
Relaxation guided variable neighborhood search. / J. Puchinger, G. Raidl / 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
Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. / J. Puchinger, G. Raidl, M. Gruber / Talk: MIC2005 (The 6th Metaheuristics International Conference), Wien; 2005-08-22 - 2005-08-26; in: "Proceedings of MIC2005, the 6th Metaheuristics International Conference", (2005)
Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. / J. Puchinger, G. Raidl / 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
A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. / M. Gruber, G. Raidl / 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
Solving the prize-collecting Steiner tree problem to optimality. / I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti / 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
GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings / H. Beyer, G. Raidl et al. / ACM Press, 2005, ISBN: 1-59593-038-8; 2229 pages
Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448) / G. Raidl, J. Gottlieb / Springer, Heidelberg, 2005, ISBN: 3-540-25337-8; 271 pages
Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / G. Raidl, J. Gottlieb / Evolutionary Computation, volume 13 (2005), number 4; 441 - 475
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. / I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti / Mathematical Programming, Volume 105 (2005), 2-3; 427 - 449
A variable neihborhood search approach for solving the car sequencing problem. / M. Prandtstetter, G. Raidl / Report for European Journal of Operations Research (EJOR); 2005; 24 pages

2004

Probe Selection by Integer Linear Programming / G.W. Klau / Talk: Séminaire BIOINFO, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Nancy, Frankreich; 2004-11-11
Optimale Probenauswahl für Microarrays bei mehrdeutigen Proben / G.W. Klau / Talk: Universität Wien, Institut für Statistik und Decision Support Systems, Privatissimum-Seminar "Biostatistik und Optimierung", Wien; 2004-11-05
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22
An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22
Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems / G. Raidl / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham; 2004-09-18 - 2004-09-22
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / G. Koller / Talk: PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien; 2004-09-18 - 2004-09-22
Anwendung der Computional Intelligence in der Kombinatorischen Optimierung / P. Mutzel / Talk: Universität Dortmund, SFB Meeting, Dortmund, Deutschland; 2004-09-15
Mathematik in der Bioinformatik / G.W. Klau / Talk: Jahrestagung der Deutschen Mathematikervereinigung (DMV 2004), Heidelberg, Deutschland; 2004-09-12 - 2004-09-17
Maximum Planar Subgraphs and Crossing Minimization in Graph Drawing / P. Mutzel / Talk: ADONET/Socrates Doctoral Courses in Discrete Systems and Optimization, Köln, Deutschland; 2004-09-09
Structural Alignment of Two RNA Sequences with Lagrangian Relaxation / G.W. Klau / Talk: OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande; 2004-09-01
Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / G.W. Klau / Talk: OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande; 2004-09-01
Automatic Graph Drawing / R. Weiskircher / Talk: Ars Electronica, Language of Network Conference, Linz; 2004-09-01
Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / G.W. Klau / 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
DGCVis: An Exploratory 3D Visualization of Graph Pyramids / A. Kerren / Talk: CMV: 2nd International Conference on Coordinated and Multiple Views in Exploratory Visualization, IEEE, London; 2004-07-13
New ILP Approaches for 3-Staged Two-Dimensional Bin Packing / G. Raidl / Talk: EUROXX: 20th European Conference on Operational Research, Rhodos; 2004-07-04 - 2004-07-07
Generation as Method for Explorative Learning in Computer Science Education / A. Kerren / 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
Die SPQR-Baum Datenstruktur im Graph Drawing / P. Mutzel / Talk: Universität Dortmund, Dortmund, Deutschland; 2004-04-19
Robustness and Resilience / G.W. Klau / Talk: Dagstuhl: Seminar Network Analysis, Dagstuhl, Deutschland; 2004-04-15
Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems / G. Raidl / Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07
Solving a real-world glass cutting problem / J. Puchinger, G. Raidl, G. Koller / Talk: EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal; 2004-04-05 - 2004-04-07
An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem / G. Raidl / Talk: ACM Symposium on Applied Computing, Nicosia; 2004-03-14 - 2004-03-17
Optomal Robust Non-Unique Probe Selection Using Integer Linear Programming / G.W. Klau / Talk: Hong Kong University of Science, Theory Group, Hong Kong, China; 2004-02-16
Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / G.W. Klau / Talk: SIGOPT International Conference on Optimization (ICO 2004), Wittenberg, Deutschland; 2004-02-15 - 2004-02-18
Human-Guided Search: System, Current and Future Work / G.W. Klau / Talk: The University of Sidney, School of Information Technologies, Information Visualization Research Group, Sydney; 2004-02-05
Automatic Graph Drawing: Exact Optimization Helps! / M. Jünger, P. Mutzel / 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
Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings / J. Gottlieb, G. Raidl / Springer, Heidelberg, 2004, ISBN: 3-540-21367-8; 241 pages
Applications of Evolutionary Computing: EvoWorkshops 2004 - Lecture Notes in Computer Science 3004 / G. Raidl et al. / Springer, Berlin Heidelberg New York, 2004, ISBN: 3-540-21378-3; 562 pages
Automatic layout of UML class diagrams in orthogonal style / M. Eiglsperger, C. Gutwenger, M. Kaufman, J. Kupke, M. Jünger, S. Leipert, K. Klein, P. Mutzel, M. Siebenhaller / Information Visualization, 3 (2004), 3; 189 - 208
Learning by Generation in Computer Science Education. / A. Kerren / Journal of Computer Science & Technology, 4 (2004), 2; 84 - 90
An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. / G. Koller, G. Raidl / 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
Optimal robust non-unique probe selection using integer linear programming. / G.W. Klau, S. Rahmann, A. Schliep, M. Vingron, K. Reinert / in: "Proc. of ISMB/ECCB 2004 (Intelligent Systems for Molecular Biology and European Conference on Computational Biology, 2004", unbekannt, 2004
An improved hybrid genetic algorithm for the generalized assignment problem. / G. Raidl, H. Feltl / 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
An evolutionary algorithm for column generation in integer programming: an effective approach for 2D bin packing. / J. Puchinger, G. Raidl / 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
Solving a real-world glass cutting problem. / J. Puchinger, G. Raidl, G. Koller / 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
DGCVis: An Exploratory 3D Visualization of Graph Pyramids. / A. Kerren, F. Breier, P. Kügler / in: "Proceedings of the 2nd International Conference on Coordinated and Multiple Views in Exploratory Visualization (CMV '04)", IEEE, 2004, 73 - 83
Generation as Method for Explorative Learning in Computer Science Education. / A. Kerren / in: "ITiCSE: Annual Joint Conference Integrating Technology into Computer Science Education", ACM, 2004, ISBN: 1-58113-672-2, 77 - 81
Stuctural Alignment of Two RNA Sequences with Lagrangian Relaxation / M. Bauer, G.W. Klau / 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
Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem / G.W. Klau, I. Ljubic, A. Moser, P. Mutzel, P. Neuner, U. Pferschy, G. Raidl, R. Weiskircher / 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
Simple and Efficient Bilayer Cross Counting / W. Barth, M. Jünger, P. Mutzel / in: "Journal of Graph Algorithms and Applications", R. Tamassia, I. Tollis, G. Liotta (ed.); World Scientific, 2004, 16 pages
Solving the prize-collecting Steiner tree problem to optimality. / I. Ljubic, R. Weiskircher, U. Pferschy, G.W. Klau, P. Mutzel, M. Fischetti / Report for Institut für Computergraphik und Algorithmen, Technical Report TR 186-1-04-01; 2004
Bend minimization in planar orthogonal drawings using integer programming. / P. Mutzel, R. Weiskircher / Report for Technical Report TR 186-1-04-04, Institut für Computergraphik und Algorithmen; 2004
Models and algorithms for three-stage two-dimensional bin packing. / J. Puchinger, G. Raidl / Report for Technical Report TR 186-1-04-04, submitted to EJOR; 2004
Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / G. Raidl, J. Gottlieb / Report for Technischer Report TR 186-1-04-05; 2004
Biased mutation operators for subgraph-selection problems. / G. Raidl, G. Koller, B. Julstrom / Report for Technischer Report TR 186-1-04-06; 2004
Non-planar orthogonal drawings with fixed topology / M. Chimani, G.W. Klau, R. Weiskircher / Report for Technischer Report TR 186 1 04 03; 2004

2003

The Fractional Prize-Collecting Steiner Tree Problem on Trees / G.W. Klau, I. Ljubic, P. Mutzel, U. Pferschy, R. Weiskircher / Talk: 11th 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
Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / G. Raidl / Talk: Research Institute of Molecular Pathology, Biocenter Vienna, Wien; 2003-08-31
Evolutionary Computation for Combinatorial Optimization / G. Raidl / Talk: EvoNet Summer School 2003, University of Parma, Italy; 2003-08-24 - 2003-08-31
On the Hybridization of Evolutionary Algorithms / G. Raidl / Talk: Genetic and Evolutionary Computation Conference (GECCO 2003), Chicago, IL; 2003-07-12 - 2003-07-16
Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen / R. Weiskircher / Talk: Gi-Dissertationspreis, Mainz, Deutschland; 2003-06-23 - 2003-06-24
Recent Advances on ArchEd / P. Mutzel / Talk: Enter-The-Past: The E-way into the four Dimensions of Cultural Heritage, Wien; 2003-04-08 - 2003-04-12
Effizientes Zählen von Schnittpunkten / P. Mutzel / Talk: Institut für Hochenergiephysik (HEPHY) - TU Wien, Wien; 2003-03-31
Exploratives Lernen durch partiell generierte Lehr- und Lernsoftware / A. Kerren / 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
An O(n log n) Algorithm for the Fractional Prize Collecting Steiner Tree Problem on Trees / R. Weiskircher / Talk: 7th Combinatorial Optimization Workshop, Aussois, Frankreich; 2003-03-10 - 2003-03-14
SPQR-Trees in Automatic Graph Drawing / P. Mutzel / Talk: Ecole polytechnique fédérale de Lausanne (EPFL), Lausanne, Schweiz; 2003-02-13
Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen / R. Weiskircher / 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
Automatic Layout and Labelling of State Diagrams / P. Mutzel, G.W. Klau / in: "Mathematics - Key Technology for the Future", W. Jäger, H.-J. Krebs (ed.); Springer, Berlin, 2003, ISBN: 3-540-44220-0, 584 - 608
AGD-A Library of Algorithms for Graph Drawing / M. Jünger, G.W. Klau, P. Mutzel, R. Weiskircher / in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 149 - 172
The SPQR-Tree Data Structure in Graph Drawing / P. Mutzel / 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
Technical Foundations / M. Jünger, P. Mutzel / in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 9 - 53
Graph Drawing Software, Introduction / M. Jünger, P. Mutzel / in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 1 - 7
Go Visual: A Diagramming Software for UML Class Diagrams / C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel / in: "Graph Drawing Software", M. Jünger, P. Mutzel (ed.); Springer, 2003, ISBN: 3-540-00881-0, 257 - 278
Applications of Evolutionary Computing / G. Raidl et al. / Springer, LNCS 2611, 2003, ISBN: 3-540-00976-0; 708 pages
Graph Drawing Software / M. Jünger, P. Mutzel / Springer, 2003, ISBN: 3-540-00881-0; 378 pages
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees / G. Raidl, B. Julstrom / IEEE Transactions on Evolutionary Computation, 7 (2003), 3; 225 - 239
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs / I. Ljubic, G. Raidl / Journal of Heuristics, 9 (2003), 401 - 427
Formal Definition of Programming Language Standards / C. Pronk, M. Schönhacker / ACM SIGPLAN Notices, 38 (2003), 8; 20 - 21
Optimal labelling of point features in rectangular labelling models / G.W. Klau, P. Mutzel / Mathematical Programming, 94 (2003), 2-3; 435 - 458
Selected Open Problems in Graph Drawing / F.J. Brandenburg, D. Eppstein, M.T. Goodrich, S.G. Kobourov, G. Liotta, P. Mutzel / 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
Graph Embedding with Minimum Depth and Maximum External Face (Extended Abstract) / C. Gutwenger, P. Mutzel / 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
Si3Trenn and Si3Silb: Using the SiSiSi Word Analysis System for Pre-hyphenation and Syllable Counting in German Documents / G. Kodydek, M. Schönhacker / 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
Subgraph Induced Planar Connectivity Augmentation / C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher / 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
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem / B. Julstrom, G. Raidl / in: "Proceedings of the 2003 ACM Symposium on Applied Computing, March 9-12, 2003, Melbourne, Florida, USA", ACM, 2003, 747 - 752
An Experimental Study of Crossing Minimization Heuristics / C. Gutwenger, P. Mutzel / 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
A new Approach for Visualizing UML Class Diagrams / P. Mutzel, C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert / 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
A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem / B. Julstrom, G. Raidl / 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
The fractional prize-collecting Steiner tree problem on trees / R. Weiskircher, G.W. Klau, I. Ljubic, P. Mutzel, U. Pferschy / Report for submitted to ESA, Technical Report TR-186-1-03-01; 2003
Force-based label number maximization / D. Ebner, G.W. Klau, R. Weiskircher / 2003

2002

Graphs in Software Visualization - Introduction / P. Mutzel, P. Eades / in: "Software Visualization", Springer, 2002, 285 - 294
Optimization in Graph Drawing / P. Mutzel / in: "Handbook of Applied Optimization", Oxford University Press, 2002, 967 - 977
Algorithm Animation - Chapter Introduction / A. Kerren, J. Stasko / in: "Software Visualization", Springer, 2002, 1 - 15
Graph Drawing / P. Mutzel, M. Jünger, S. Leipert / Springer, 2002
Evolutionary Local Search for the Edge-Biconnectivity Augmentation Problem / G. Raidl, I. Ljubic / Information Processing Letters, 82 (2002), 39 - 45
Generierung interaktiver Animationen von Berechnungsmodellen / S. Diehl, A. Kerren / Informatik - Forschung und Entwicklung, 17 (2002), 1; 12 - 20
Letting Ants Labeling Point Features / M. Schreyer, G. Raidl / in: "2002 IEEE Congress on Evolutionary Computation", IEEE, 2002, 1564 - 1569
On Weight-Biased Mutation for Graph Problems / G. Raidl, G. Kodydek, B. Julstrom / in: "Parallel Problem Solving from Nature-PPSNVII", Springer, 2002, 204 - 213
Bend Minimization in Orthogonal Drawings Using Integer Programming / P. Mutzel, R. Weiskircher / in: "Computing and Combinatorics", Springer, 2002, 484 - 493
A Memetic Algorithm for Vertex-Biconnectivity Augmentation / S. Kersting, G. Raidl, I. Ljubic / in: "Applications of Evolutionary Computing", Springer, 2002, 102 - 111
Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges / B. Julstrom, G. Raidl / in: "Applied Computing 2002", ACM, New York, 2002, 547 - 552
A Library of Algorithms for Graph Drawing / C. Gutwenger, M. Jünger, G. Klau, S. Leipert, P. Mutzel, R. Weiskircher / in: "Graph Drawing 2002", Springer, 2002, 473 - 474
Caesar Automatic Layout of UML Class Diagrams / C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel / in: "Graph Drawing 2002", Springer, 2002, 461 - 462
Advances in C-Planarity Testing of Clustered Graphs / C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher / in: "Graph Drawing 2002", Springer, 2002, 220 - 236
Graph Drawing Algorithm Engineering with AGD / C. Gutwenger, M. Jünger, G. Klau, S. Leipert, P. Mutzel / in: "Software Visualization", Springer, 2002, 307 - 323
Animating Algorithms Live and Post Mortem / S. Diehl, C. Görg, A. Kerren / in: "Software Visualization", Springer, 2002, 46 - 57
Reification of Program Points for Visual Execution / S. Diehl, A. Kerren / in: "IEEE Workshop on Visualizing Software for Understanding and Analysis", IEEE Computer Society Press, 2002, 100 - 109
Simple and Efficient Bilayer Cross Counting / W. Barth, M. Jünger, P. Mutzel / in: "Graph Drawing 2002", Springer, 2002, 130 - 141

2001

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

Theses

2020

Casual Employee Scheduling with Constraint Programming and Metaheuristics / Master Thesis by S. Teuschl / Supervisor: G. Raidl, N. Frohner; Institute of Logic and Computation, 2020; final examination: 2020-11
Evaluierung der Nutzer-Aufmerksamkeit für dynamische Kartenbeschriftung / Master Thesis by V. Zernpfennig / Supervisor: M. Nöllenburg, M. Pohl; Institut für Logic and Computation, 2020; final examination: 2020-09-30
Visualizing Set Data with the Metro Map Metaphor / Master Thesis by M. Wallinger / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2020; final examination: 2020-06-26
Solving a Generalized Constrained Longest Common Subsequence Problem / Master Thesis by C. Berger / Supervisor: G. Raidl, M. Djukanovic; Institute of Logic and Computation, 2020; final examination: 2020-06
Combinatorial Optimization Approaches for Graph Construction Problems / Doctoral Thesis by B. Klocker / Supervisor, Reviewer: G. Raidl, H. Fleischner; Institute of Logic and Computation, 2020; oral examination: 2020-03-25
Avoiding Crossings in Non-Planar Graph Layouts / Doctoral Thesis by F. Klute / Supervisor, Reviewer: M. Nöllenburg, F. Frati, S.G. Kobourov; Institut für Logic and Computation, 2020; oral examination: 2020-03-13
Heuristische Optimierungsverfahren für die Koordinierung von Flughafenslots / Master Thesis by S. Kuran / Supervisor: G. Raidl, A Chwatal; Institute of Logic and Computation, 2020; final examination: 2020-03

2019

Engineering an Algorithm for Strict Outerconfluent Graph Drawings / Master Thesis by M. Buchta / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019
Generating Stable Demers Cartograms and Iso-Hexagon Cartograms / Master Thesis by S. Nickel / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2019
Algorithms and Drawings for Mixed Linear Layouts of Graphs / Master Thesis by P. de Col / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2019

2018

Minimizing wiggles in storyline visualizations / Master Thesis by T. Fröschl / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2018
An interactive optimization framework for point feature label placement / Master Thesis by R. Löffler / Supervisor: M. Nöllenburg, F. Klute; Institut für Logic and Computation, 2018

2017

Graph Embeddings Motivated by Greedy Routing / Doctoral Thesis by R. Prutkin / Supervisor, Reviewer: D. Wagner, M. Nöllenburg, M Kaufmann; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-11-29
Automatic Label Placement in Maps and Figures: Models, Algorithms and Experiments / Doctoral Thesis by B. Niedermann / Supervisor, Reviewer: M. Nöllenburg, J. Haunert; Institut für Theoretische Informatik, KIT, 2017; oral examination: 2017-02-02
Techniques for multiple sink placement in undirected flow networks / Master Thesis by O. Hubmer / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017
Driving-range estimation of electric vehicles using graph algorithms / Master Thesis by F. Gstrein / Supervisor: M. Nöllenburg; Institut für Logic and Computation, 2017

2016

Parameterized Complexity in the Polynomial Hierarchy / Doctoral Thesis by R. de Haan / Supervisor, Reviewer: S. Szeider, M. Grohe, R. Pichler; Institut für Computergraphik und Algorithmen, 2016; oral examination: 2016-11-08
A Hybrid Evolutionary Algorithm for the Vehicle Routing Problem with Stochastic Demands / Master Thesis by S. Pourmanouchehri / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-09-01
Complete Solution Archives for Evolutionary Combinatorial Optimization / Doctoral Thesis by B. Biesinger / Supervisor, Reviewer: G. Raidl, C. Blum, U. Pferschy; Institut für Computergraphik und Algorithmen, 2016; oral examination: 2016-06-03
Metaheuristics for the Districting and Routing Problem for Security Control / Master Thesis by M. Prischink / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-05-09
Column Generation at Strip Level for the K-Staged Two-Dimensional Cutting Stock Problem / Master Thesis by F. Leberl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-03-22
Visibility-Based Obstacle Placing / Master Thesis by C. Schwab / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11
A Branch-and-Bound Approach for the Constrained K-Staged 2-Dimensional Cutting Stock Problem / Master Thesis by B. Bonigl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2016; final examination: 2016-02-11

2015

Optimierung von elektro-hybriden Antriebskonzepten mittels heuristischer Optimierungsverfahren / Doctoral Thesis by T. Krenek / Supervisor, Reviewer: T. Lauer, G. Raidl; Institut für Fahrzeugantriebe und Automobiltechnik, 2015; oral examination: 2015-09-07
Structure in #SAT and QBF / Doctoral Thesis by F. Slivovsky / Supervisor, Reviewer: S. Szeider, H. Chen; Institut für Computergraphik und Algorithmen, 2015; oral examination: 2015-05-05
Optimierungsansätze zur Planung von Freizeit-Fahrradrouten / Master Thesis by B. Klocker / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2015; final examination: 2015-04
Backdoors to Tractability of Disjunctive Answer Set Programming / Master Thesis by J. Fichte / Supervisor: S. Szeider; Institut für Informationssysteme, 2015

2014

Heuristic solution approaches for the two dimensional pre-marshalling problem. / Master Thesis by A. Tus / Supervisor: G. Raidl, A. Rendl; Institut für Computergrafik und Algorithmen, 2014
Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework. / Master Thesis by P. Klaffenböck / Supervisor: G. Raidl; Institut für Computergrafik und Algorithmen, 2014
A hybrid algorithm for the partition coloring problem. / Master Thesis by G. Fritz / Supervisor: G. Raidl, B. Hu; Computergraphik und Algorithmen, 2014
Finding longest common subsequences by GPU-based parallel ant colony optimization. / Master Thesis by D. Markvica / Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014
Applying ant colony optimization to the periodic vehicle routing problem with time windows. / Master Thesis by D. Trummer / Supervisor: G. Raidl; Computergraphik und Algorithmen, 2014
Exact approaches to the network design problem with relays / Master Thesis by M. Riedler / Supervisor: I. Ljubic, M. Leitner, M. Ruthmair; Computergraphik und Algorithmen, 2014

2013

Balancing bike sharing systems / Master Thesis by A. Pinter / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
Two-phase local search for the bi-objective connected facility location problem / Master Thesis by T. Petelin / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
The rooted delay-constrained steiner tree problem with uncertain delays / Master Thesis by R. Karl / Supervisor: G. Raidl, M. Leitner, M. Ruthmair; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-12
Optimization Challenges of the Future Federated Internet / Doctoral Thesis by J. Inführ / Supervisor, Reviewer: G. Raidl, K. Tutschku; Institut für Computergraphik and Algorithmen, 2013; oral examination: 2013-11-27
Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems / Master Thesis by M. Putzenlechner / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08
Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques / Master Thesis by C. Bacher / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-08
Selective Graph Coloring Problem / Master Thesis by C. Volko / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04
Critical Links Detection using CUDA / Master Thesis by T. Schnabl / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-04
Metaheuristics for the regenerator location problem / Master Thesis by P. Jahrmann / Supervisor: G. Raidl; Institut für Computergraphik and Algorithmen, 2013; final examination: 2013-03

2012

Extending the gecode framework with interval constraint programming / Master Thesis by I. Ivezic / Supervisor: G. Raidl, L. Di Gaspero; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
The vehicle routing problem with compartments / Master Thesis by P. Gebhard / Supervisor: G. Raidl, S. Pirkwieser; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
Improving the protein identification performance in high-resolution mass spectrometry data / Master Thesis by F. Dusberger / Supervisor: G. Raidl, K. Mechtler, P. Pichler; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-10
Solving multimodal resource constrained project scheduling problems / Master Thesis by M. Sturm / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-09
On Solving Constrained Tree Problems and an Adaptive Layers Framework / Doctoral Thesis by M. Ruthmair / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-21
Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation / Doctoral Thesis by S. Pirkwieser / Supervisor, Reviewer: G. Raidl, K. Dörner; Institut für Computergraphik und Algorithmen, 2012; oral examination: 2012-06-14
Metaheuristics for a multimodal home-health care scheduling problem / Master Thesis by G. Hiermann / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05
Enhancing an Evolutionary Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / Master Thesis by B. Biesinger / Supervisor: G. Raidl, C. Schauer, B. Hu; Institut für Computergraphik und Algorithmen, 2012; final examination: 2012-05

2011

Clustering Heuristics for the Hierarchical Ring Network Problem / Master Thesis by R. Schuster / Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-11
A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem / Master Thesis by T. Seidl / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem / Master Thesis by C. Gruber / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
Heuristic methods for the hop constrained survivable network design problem / Master Thesis by G. Fritz / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-09
Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints / Master Thesis by M. Sinnl / Supervisor: G. Raidl, M. Leitner; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-08
Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten / Master Thesis by T. Winkler / Supervisor: G. Raidl, C. Schauer; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07
Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus / Master Thesis by T. Krenek / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07
Optimierung der periodischen Tourenplanung in der Müllentsorgung / Master Thesis by K. Edlinger / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2011; final examination: 2011-07

2010

A timeslot-based heuristic approach to construct high-school timetables / Master Thesis by M. Pimmer / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-12
Ein neues lösungsarchiv für das generalized minimum spanning tree-problem / Master Thesis by M. Sonnleitner / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-09
Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods / Master Thesis by K. Oberlechner / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-08
Automatic generation of 2-antwars players with genetic programming / Master Thesis by J. Inführ / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07
Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem / Master Thesis by M. Berlakovich / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-07
Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods / Doctoral Thesis by M. Leitner / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16
On the Minimum Label Spanning Tree Problem: Solution Methods and Applications / Doctoral Thesis by A Chwatal / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2010; oral examination: 2010-06-16
Reconstructing cross-cut shredded documents by means of evolutionary algorithms / Master Thesis by C. Schauer / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-05
Compressing fingerprint templates by solving the $k$-node minimum label spanning arborescence problem by branch-and-price / Master Thesis by C. Thöni / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02
Heuristic methods for solving two generalized network problems / Master Thesis by A. Pagacz / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2010; final examination: 2010-02

2009

Exact and Heuristic Approaches for Solving the Bounded Diameter Minimum Spanning Tree Problem / Doctoral Thesis by M. Gruber / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009; oral examination: 2009-06-16
Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenndung in einem Ersatzteillager mit domänenspezifischen Nebenbedingungen / Master Thesis by T. Misar / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-04
Event based similarity search and its applications in business analytics / Master Thesis by M. Suntinger / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03
Similarity searching in complex business events and sequences thereof / Master Thesis by H. Obweger / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-03
Enhancing a genetic algorithm by a complete solution archive based on a trie data structure / Master Thesis by A. Sramko / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2009; final examination: 2009-02
Hybrid Optimization Methods for Warehouse Logistics and the Reconstruction of Destroyed Paper Documents / Doctoral Thesis by M. Prandtstetter / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2009
Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing / Master Thesis by J. Walla / Supervisor: G. Raidl, M. Ruthmair; Institut für Computergraphik und Algorithmen, 2009
Ein lösungsarchiv-unterstützter evolutionärer algorithmus für das generalized minimum spanning tree-problem / Master Thesis by M. Wolf / Supervisor: G. Raidl, B. Hu; Institute of Computer Graphics and Algorithms, 2009

2008

Hybrid Metaheuristics for Generalized Network Design Problems / Doctoral Thesis by B. Hu / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2008; oral examination: 2008-12-11
Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie und kundenspezifischen Auslagerpräferenzen / Master Thesis by U. Rietzinger / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12
Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung / Master Thesis by N. Musil / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-12
Webbasierte Darstellung großer Datenmengen als pivot-tabelle mithilfe ressourcenoptimierter Aggregationsverfahren / Master Thesis by A. Potocka / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10
Parallel variable neighborhood search for the car sequencing problem / Master Thesis by M. Knausz / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-10
Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen / Master Thesis by F. Berger / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-09
A complete archive genetic algorithm for the multidimensional knapsack problem / Master Thesis by S. Zaubzer / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems / Master Thesis by F. Zaubzer / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
Evaluation and reconstruction of strip-shredded text documents / Master Thesis by W. Morandell / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
Combinatorial Optimization for the Compression of Biometric Templates / Master Thesis by O. Dietzel / Supervisor: G. Raidl, A Chwatal; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
An incremental dynamic programming approach for multidimensional allocation problems / Master Thesis by C. Bonitz / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-05
Reconstructing borders of manually torn paper scheets using integer linear programming / Master Thesis by P. Schüller / Supervisor: G. Raidl, M. Prandtstetter; Institut für Computergraphik und Algorithmen, 2008; final examination: 2008-01

2007

Algorithmic Approaches to the String Barcoding Problem / Master Thesis by P. Neuner / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10
Subgradient optimization based lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem / Master Thesis by P. Putz / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-10
Improved Protein Identification After Fast Elimination of Non-Interpretable Peptide MS/MS Spectra and Noise Reduction / Doctoral Thesis by N. Mujezinovic / Supervisor, Reviewer: G. Raidl, F. Eisenhaber; Institut für Computergraphik und Algorithmen, TU Wien, 2007; oral examination: 2007-05
Metaheuristic Approaches for Designing Survivable Fiber-Optic Networks / Master Thesis by Th. Bucsics / Supervisor: G. Raidl, D. Wagner; Institut für Computergraphik und Algorithmen, TU Wien, 2007; final examination: 2007-03
Map-Matching und Wegsuche in einem geografischen Informationssystem / Master Thesis by A Braumann / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2007; final examination: 2007-01

2006

A Lagrangian decomposition approach combined with metaheuristics for the knapsack constrained maximum spanning tree problem. / Master Thesis by S. Pirkwieser / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-10
Solving two generalized network design problems with exact and heuristic methods. / Master Thesis by M. Leitner / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-05
Selbstausrichtende Prozesse - Elemente der Künstlichen Intelligenz im Geschäftsmanagement / Doctoral Thesis by R. El-Berry / Supervisor, Reviewer: J. Dorn, G. Raidl; Institut für Informationssysteme, Arbeitsbereich Datenbanker & Artificial Intelligence, 2006
Combining Metaheuristics and Integer Programming for Solving Cutting and Packing Problems. / Doctoral Thesis by J. Puchinger / Supervisor, Reviewer: G. Raidl, U. Pferschy; Institut für Computergraphik und Algorithmen, 2006; oral examination: 2006-01
Knickminimales orthogonales Zeichnen planarer Graphen im Kandinsky Modell. / Doctoral Thesis by C Yildiz / Supervisor, Reviewer: P. Mutzel, W. Barth; Institut für Computergraphik und Algorithmen, 2006; oral examination: 2006-01
An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem. / Master Thesis by B. Kopinitsch / Supervisor: G. Raidl, M. Gruber; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01
Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen. / Master Thesis by A Chwatal / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2006; final examination: 2006-01

2005

Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem. / Master Thesis by D. Wagner / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005
Exact and heuristic methods for solving the car sequencing problem. / Master Thesis by M. Prandtstetter / Supervisor: G. Raidl, B. Hu; Institut für Computergraphik und Algorithmen, 2005
Option pricing by means of genetic programming. / Master Thesis by A. Heigl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2005
Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation. / Master Thesis by V. Gamper / Supervisor: G. Raidl, G.W. Klau; Insitut für Computergraphik und Algorithmen, 2005
An extended local branching framework and its application to the multidimensional knapsack problem. / Master Thesis by D. Lichtenberger / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005
An application of Dijkstra's algorithm for a (on-board) route (re-)planning module. / Master Thesis by G. Verlut / Supervisor: G. Raidl, J. Puchinger; Institut für Computergraphik und Algorithmen, 2005
Dynamische Reihenfolgeoptimierung mittels Simulation und Meta-Heuristiken. / Master Thesis by D. Fischinger / Supervisor: G. Raidl, W. Stöcher; Institut für Computergraphik und Algorithmen, 2005

2004

Exact and Memetic Algorithms for Two Network Design Problems / Doctoral Thesis by I. Ljubic / Supervisor, Reviewer: P. Mutzel; Institut für Computergraphik und Algorithmen, 2004
Interaktive Reihenfolgeplanung für die Automobilindustrie. / Master Thesis by B. Hu / Supervisor: G.W. Klau; Institut für Computergraphik und Algorithmen, 2004
Ein Genetischer Algorithmus für das Optimum Communication Spanning Tree Problem. / Master Thesis by G. Gruber / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2004
Bend minimal orthogonal drawing of non planar graphs. / Master Thesis by M. Chimani / Supervisor: G.W. Klau, R. Weiskircher; Institut für Computergraphik und Algorithmen, 2004
RNA structural alignment by means of Lagrangian relaxation / Master Thesis by M. Bauer / Supervisor: G.W. Klau; Institut für Computergraphik und Algorithmen, 2004
An alignment graph based evolutionary algorithm for the multiple sequence alignment problem / Master Thesis by S. Leopold / Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2004

2003

Hybrid Evolutionary Algorithms for Combinatorial Optimization / Habilitation Thesis by G. Raidl / Technische Universität Wien, 2003
Ein genetischer Algorithmus für das Generalized Assignment Problem / Master Thesis by H. Feltl / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003
Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems / Master Thesis by S. Kersting / Supervisor: G. Raidl; Institut für Computergraphik und Algorithmen, 2003
Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Master Thesis by J. Fauster / Supervisor: G. Raidl, G. Koller; Institut für Computergraphik und Algorithmen, 2003
Verfahren zur Lösung eines Glasverschnittproblems / Master Thesis by J. Puchinger / Supervisor: G. Raidl, G. Kodydek; Institut für Computergraphik und Algorithmen - E186, 2003
Effiziente Gestaltung der Wortanalyse in SiSiSi / Master Thesis by M. Gruber / Supervisor: W. Barth, G. Koller, M. Schönhacker; Institut für Computergraphik und Algorithmen, 2003

2002

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

Awards

Stefan Szeider: The Parameterized Complexity of Reasoning Problems
2010 / ERC Europäischer Forschungsrat
Hermann Kaindl: Auszeichnung: Distinguished Scientist Member der ACM
2008 / Distinguished Scientist Member der ACM / Website
Hermann Kaindl: Ernennung zum Distinguished Scientist Member der ACM (Association for Computing Machinery)
2008 / USA
Günther Raidl: Marie-Curie Research Training Network: Algorithmic Descrete Optimization Network (ADONET) - Austrian Coordinator
2004 / EC Europäische Komission - Marie Curie / Website / Project
Hermann Kaindl: Auszeichnung: Senior Member IEEE
1998 / Senior Member IEEE
Hermann Kaindl: Ernennung zum Senior Member der IEEE (The Institute of Electrical and Electronics Engineers)
1998 / USA

Guests

Dragoslav Ljubic, Austria / Lehrveranstaltung zu den Themen: Affine Koordinaten, affine Hülle Kombinatorische Dualität, Polarität Konvexe Hülle Delaunay-Triangulierung Voronoi-Diagramme Triangulierung von Polygonen Punktlokalisierung etc.
Luca Di Gaspero, Italy / Modeling and Solving Constrained Optimization Problems - Constraint Programming basics: fundamental concepts, types of domains (finite domains, intervals, sets), constraints, search, branch and bound - CP modeling techniques: global constraints, redundant constraints, symmetry elimination, special-purpose constraints (e.g., scheduling), modeling of optimization problems, problem reduction - CP languages/libraries: GECODE, COMET, ... - Modeling examples: n-Queens, Cryptoarithmetic, Sudoku, Scheduling, Timetabling, ... - Basic solution methods: propagation, consistency, search - Advanced solution methods: heuristic methods, hybrid approaches, integration with heuristic/metaheuristic techniques - Statistical analysis of optimization algorithms - Lab practice
Alina Fernandez Arias, Cuba
Luca DiGaspero, Italy / Modeling and Solving Constrained Optimization Problems
Marek Linder, Slovakia
Luca Di Gaspero, Italy / Lehrveranstaltung "Modeling and Solving Constrained Optimization Problems"
Ashwin Arulselvan, Germany
Olaf Maurer, Germany
Luca Di Gaspero, Italy / Lehrveranstaltung "Modeling and Solving Constrained Optimization Problems"
Eduardo Alvarez-Miranda, Italy
Ashwin Arulselvan, Germany
Olaf Maurer, Germany
Andreas Bley, Germany
Werner Axel, Germany
María Belén Melián Batista, Spain / Gastvortrag bei der 3. Sitzung des Arbeitskreises Metaheuristics (AWM 3'05), "Metaheuristics in Machine Learning", Gastvortrag in der LVA "186.137 AK der Algorithmik 5 VU 2.0"

And more…

Soon, this page will include additional information such as reference projects, conferences, events, and other research activities.

Until then, please visit Algorithms and Complexity’s research profile in TISS .

Services

Institutes

Research Units

Algorithms and Complexity E192-01

Contact

On This Page

About

Professors

Scientific Staff

Administrative Staff

Student Staff

External Lecturers

Courses

2020W

2021S

Projects

Publications

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

Theses

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

Awards

Guests

And more…