Algorithms and Complexity E192-01
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
On This Page
About
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.
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
Student Staff
Courses
2023W
- Algorithmic Geometry / 192.133 / VU
- Algorithmic Meta-Theorems / 192.122 / VU
- Algorithmics / 186.814 / VU
- Algorithms in Graph Theory / 192.018 / VU
- Bachelor Thesis in Computer Science / 186.819 / PR
- Fixed-Parameter Algorithms and Complexity / 192.135 / VU
- Heuristic Optimization Techniques / 192.137 / VU
- Introduction to Logical Methods in Computer Science / 184.766 / VO
- Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
- Project in CS1: Team-Based Research in Algorithmics / 192.105 / PR
- Propädeutikum für Informatik / 180.771 / VU
- Randomized Algorithms / 192.020 / VU
- 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 Algorithms Graphs and Geometry / 186.862 / SE
- Seminar in Artificial Intelligence Algorithmic and Computational Decision Theory / 192.119 / SE
- Seminar on Algorithms / 186.182 / SE
- ways of thinking in informatics / 187.B12 / VU
2024S
- Introduction to Logical Methods in Computer Science / 184.766 / VO
- Research Seminar LogiCS / 184.767 / SE
Projects
-
Parameterized Graph Drawing
2023 – 2027 / Vienna Science and Technology Fund (WWTF) -
Learning to Solve Dynamic Vehicle Routing Problems
2023 – 2027 / Honda Research Institute Europe Gmb -
Co-Creationspace Einreichung Transformer
2023 – 2026 / Fürst Möbel GmbH -
Structure Identification with SAT
2023 – 2026 / Austrian Science Fund (FWF) -
Cooperative Personnel Scheduling
2022 – 2026 / Honda Research Institute Europe Gmb -
Overcoming Intractability in the Knowledge Compilation Map
2022 – 2025 / Austrian Science Fund (FWF) -
QBF Proofs and Certificates
2022 – 2025 / Austrian Science Fund (FWF) -
Parameterized Analysis in Artificial Intelligence
2021 – 2026 / Austrian Science Fund (FWF)
Publications: 150338 / 150311 / 150341 / 150281 / 150347 / 152300 / 150298 / 150265 / 175987 / 142204 / 136181 / 135869 / 135877 / 136182 / 150336 / 135873 -
Cooperative Optimization (Extension)
2021 – 2022 / Honda Research Institute Europe Gmb -
From QBF to DQBF: Theory together with Practice
2021 – 2022 / Austrian Science Fund (FWF)
Publication: 154458 -
Structural Approaches in Stability Under Diversity Constraints
2021 – 2022 / Austrian Exchange Service (OeAD)
Publication: 150336 -
Study on computational methods for cooperative personnel scheduling
2021 / Honda Research Institute Europe Gmb -
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 – 2025 / Vienna Science and Technology Fund (WWTF)
Publications: 136989 / 175712 -
Learning to Solve Quantified Boolean Formulas
2020 – 2024 / Vienna Science and Technology Fund (WWTF) -
Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI
2020 – 2024 / Vienna Science and Technology Fund (WWTF)
Publications: 150311 / 150341 / 161632 / 150307 / 150347 / 152309 / 153153 / 175705 / 142212 / 153155 / 144354 / 150308 / 150344 / 150345 / 175710 / 142535 / 153154 / 142561 / 142530 / 142515 / 150301 / 176903 / 153107 -
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 (WWTF) -
SAT-Based Local Improvement Methods
2019 – 2024 / Austrian Science Fund (FWF)
Publications: 150341 / 161632 / 150307 / 150281 / 150220 / 150347 / 150308 / 176903 -
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)
Publications: 136989 / 139750 / 161631 / 150338 / 150345 / 175712 / 150268 / 144287 -
New Frontiers for Parameterized Complexity
2018 – 2022 / Austrian Science Fund (FWF)
Publications: 150311 / 152312 / 150341 / 150347 / 152300 / 150298 / 175987 / 136181 / 135877 / 136182 / 150336 / 135873 -
Doktoratskolleg "Vienna Graduate School on Computational Optimization"
2016 – 2024 / Austrian Science Fund (FWF)
Publications: 187877 / 142181 / 142513 / 142532 -
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)
Publication: 152312 -
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)
Publications: 143764 / 157455 / 157456 / 55811 / 55812 -
Parameterized Compilation
2014 – 2018 / Austrian Science Fund (FWF)
Publications: 55734 / 55806 / 55807 / 55808 / 55810 / 55811 / 55812 / 55813 -
Solution Archives in Evolutionary Combinatorial Optimization
2012 – 2016 / Austrian Science Fund (FWF)
Publications: 148209 / 150483 / 56176
Publications
2023
- Maximizing Social Welfare in Score-Based Social Distance Games / Ganian, R., Hamm, T., Knop, D., Roy, S., Schierreich, Š., & Suchý, O. (2023). Maximizing Social Welfare in Score-Based Social Distance Games. In R. Verbrugge (Ed.), Proceedings Nineteenth conference on Theoretical Aspects of Rationality and Knowledge (pp. 272–286). https://doi.org/10.4204/EPTCS.379.22
- On the parameterized complexity of clustering problems for incomplete data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2023). On the parameterized complexity of clustering problems for incomplete data. Journal of Computer and System Sciences, 134, 1–19. https://doi.org/10.1016/j.jcss.2022.12.001
- Group Activity Selection with Few Agent Types / Ganian, R., Ordyniak, S., & Rahul, C. S. (2023). Group Activity Selection with Few Agent Types. Algorithmica, 85(5), 1111–1155. https://doi.org/10.1007/s00453-022-01058-z
-
Growth of the perfect sequence covering array number
/
Iurlano, E. (2023). Growth of the perfect sequence covering array number. Designs, Codes and Cryptography, 91(4), 1487–1494. https://doi.org/10.1007/s10623-022-01168-3
Download: PDF (257 KB) - Parameterized complexity of envy-free resource allocation in social networks / Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2023). Parameterized complexity of envy-free resource allocation in social networks. Artificial Intelligence, 315, Article 103826. https://doi.org/10.1016/j.artint.2022.103826
-
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution
/
Beyersdorff, O., Blinkhorn, J., Mahajan, M., & Peitl, T. (2023). Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Transactions on Computational Logic, 24(2), Article 10. https://doi.org/10.34726/3603
Download: Posted for your personal use. Not for redistribution. (631 KB)
Project: From QBF to DQBF: Theory together with Practice (2021–2022) - The Parameterized Complexity of Network Microaggregation / Blažej, V., Ganian, R., Knop, D., Pokorný, J., Schierreich, Š., & Simonov, K. (2023). The Parameterized Complexity of Network Microaggregation. In B. Williams, Y. Chen, & J. Neville (Eds.), Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 6262–6270). AAAI Press. https://doi.org/10.1609/aaai.v37i5.25771
- The Parameterized Complexity of Coordinated Motion Planning / Eiben, E., Ganian, R., & Kanj, I. (2023). The Parameterized Complexity of Coordinated Motion Planning. In E. Chambers & J. Gudmundsson (Eds.), 39th International Symposium on Computational Geometry, SoCG 2023 (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2023.28
- The Computational Complexity of Concise Hypersphere Classification / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2023). The Computational Complexity of Concise Hypersphere Classification. In A. Krause, E. Brunskill, K. Cho, B. Engelhardt, S. Sabato, & J. Scarlett (Eds.), Proceedings of the 40th International Conference on Machine Learning (pp. 9060–9070).
- Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF / Fichte, J. K., Ganian, R., Hecher, M., Slivovsky, F., & Ordyniak, S. (2023). Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1–14). IEEE. https://doi.org/10.1109/LICS56636.2023.10175675
- Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable / Bhore, S., Ganian, R., Khazaliya, L., Montecchiani, F., & Nöllenburg, M. (2023). Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable. In E. Chambers & J. Gudmundsson (Eds.), 39th International Symposium on Computational Geometry (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2023.18
- A Structural Complexity Analysis of Synchronous Dynamical Systems / Eiben, E., Ganian, R., Hamm, T., & Korchemna, V. (2023). A Structural Complexity Analysis of Synchronous Dynamical Systems. In B. Williams, Y. Chen, & J. Neville (Eds.), Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 6313–6321). AAAI Press. https://doi.org/10.1609/aaai.v37i5.25777
- A Polyhedral Perspective on Tropical Convolutions / Brand, C., Koutecký, M., & Lassota, A. (2023). A Polyhedral Perspective on Tropical Convolutions. In S.-Y. Hsieh, L.-J. Hung, & C.-W. Lee (Eds.), Combinatorial Algorithms : 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings (pp. 111–122). Springer. https://doi.org/10.1007/978-3-031-34347-6_10
- A Parameterized Theory of PAC Learning / Brand, C., Ganian, R., & Simonov, K. (2023). A Parameterized Theory of PAC Learning. In B. Williams, Y. Chen, & J. Neville (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 6834–6841). AAAI Press. https://doi.org/10.1609/aaai.v37i6.25837
2022
-
Minimum Link Fencing
/
Bhore, S., Klute, F., Löffler, M., Nöllenburg, M., Terziadis, S., & Villedieu, A. (2022). Minimum Link Fencing. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022) (pp. 34:1-34:14). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2022.34
Download: PDF (999 KB)
Project: HumAlgo (2018–2023) -
Combinatorial and Algorithmic Aspects of Monadic Stability
/
Dreier, J., Mählmann, N., Mouawad, A., Siebertz, S., & Vigny, A. (2022). Combinatorial and Algorithmic Aspects of Monadic Stability. In S. W. Bae & H. Park (Eds.), 33rd International Symposium on Algorithms and Computation (ISAAC 2022) (pp. 1–17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2022.11
Download: PDF (868 KB) -
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
/
Bhore, S., Li, G., & Nöllenburg, M. (2022). An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. ACM Journal on Experimental Algorithmics, 27, 1–36. https://doi.org/10.1145/3514240
Download: PDF (7.65 MB) -
Algorithmic applications of tree-cut width
/
Ganian, R., Kim, E. J., & Szeider, S. (2022). Algorithmic applications of tree-cut width. SIAM Journal on Discrete Mathematics, 36(4), 2635–2666. https://doi.org/10.1137/20M137478X
Download: PDF (550 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / REVEAL-AI (2020–2024) - Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154091
- Learning for Guiding Metaheuristics / Raidl, G. (2022, November 3). Learning for Guiding Metaheuristics [Conference Presentation]. ELLIIT Focus Perios Seminar Series, Sweden.
- Learning Beam Search: Utilizing Machine Learning for Solving Combinatorial Optimization Problems / Raidl, G. (2022, November 1). Learning Beam Search: Utilizing Machine Learning for Solving Combinatorial Optimization Problems [Conference Presentation]. ELLIIIT Focus Period Workshop: Hybrid AI, Sweden.
- Multidimensional Manhattan Preferences / Chen, J., Nöllenburg, M., Simola, S., Villedieu, A., & Wallinger, M. (2022). Multidimensional Manhattan Preferences. In LATIN 2022: Theoretical Informatics (pp. 273–289). https://doi.org/10.1007/978-3-031-20624-5_17
-
Recognizing weighted and seeded disk graphs
/
Klemz, B., Nöllenburg, M., & Prutkin, R. (2022). Recognizing weighted and seeded disk graphs. Journal of Computational Geometry (JOCG), 13(1), 327–376. https://doi.org/10.20382/jocg.v13i1a13
Download: PDF (1.84 MB) - On Computing Optimal Linear Diagrams / Dobler, A., & Nöllenburg, M. (2022). On Computing Optimal Linear Diagrams. In Diagrammatic Representation and Inference (pp. 20–36). Sprnger. https://doi.org/10.1007/978-3-031-15146-0_2
-
SAT Backdoors: Depth Beats Size
/
Dreier, J., Ordyniak, S., & Szeider, S. (2022). SAT Backdoors: Depth Beats Size. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.46
Download: PDF (829 KB)
Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024) -
Finding a Cluster in Incomplete Data
/
Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2022). Finding a Cluster in Incomplete Data. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–14). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.47
Download: PDF (610 KB)
Projects: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / SLIM (2019–2024) - Testing Upward Planarity of Partial 2-Trees / Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C., & Simonov, K. (2022). Testing Upward Planarity of Partial 2-Trees. In P. Angelini & R. von Hanxleden (Eds.), Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers (pp. 175–187). Springer. https://doi.org/10.1007/978-3-031-22203-0_13
-
Turbocharging Heuristics for Weak Coloring Numbers
/
Dobler, A., Sorge, M., & Villedieu, A. (2022). Turbocharging Heuristics for Weak Coloring Numbers. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.44
Download: PDF (1.01 MB)
Projects: HumAlgo (2018–2023) / REVEAL-AI (2020–2024) -
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space
/
Chen, J., & Roy, S. (2022). Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.36
Download: PDF (740 KB) -
Bounding and Computing Obstacle Numbers of Graphs
/
Balko, M., Chaplick, S., Ganian, R., Gupta, S., Hoffmann, M., Valtr, P., & Wolff, A. (2022). Bounding and Computing Obstacle Numbers of Graphs. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.11
Download: PDF (869 KB)
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
/
Szeider, S., Ganian, R., & Silva, A. (Eds.). (2022). 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). https://doi.org/10.4230/LIPIcs.MFCS.2022.0
Download: PDF (429 KB) -
Threshold Treewidth and Hypertree Width
/
Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2022). Threshold Treewidth and Hypertree Width. Journal of Artificial Intelligence Research, 74, 1687–1713. https://doi.org/10.1613/JAIR.1.13661
Download: PDF (6.1 MB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / REVEAL-AI (2020–2024) / SLIM (2019–2024) -
Treelike Decompositions for Transductions of Sparse Graphs
/
Dreier, J., Gajarský, J., Kiefer, S., Pilipczuk, M., & Toruńczyk, S. (2022). Treelike Decompositions for Transductions of Sparse Graphs. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Thirty-Seventh Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Haifa, Israel. Association for Computing Machinery, Inc. https://doi.org/10.1145/3531130.3533349
Download: PDF (987 KB) - Model Checking on Interpretations of Classes of Bounded Local Cliquewidth / Bonnet, É., Dreier, J., Gajarský, J., Kreutzer, S., Mählmann, N., Simon, P., & Toruńczyk, S. (2022). Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). The Association for Computing Machinery. https://doi.org/10.1145/3531130.3533367
-
A SAT Attack on Rota’s Basis Conjecture
/
Kirchweger, M., Scheucher, M., & Szeider, S. (2022). A SAT Attack on Rota’s Basis Conjecture. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–18). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SAT.2022.4
Download: PDF (704 KB)
Project: SLIM (2019–2024) -
Quantified CDCL with Universal Resolution
/
Slivovsky, F. (2022). Quantified CDCL with Universal Resolution. In K. S. Meel & O. Strichman (Eds.), 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.24
Download: PDF (771 KB) -
Pedant: A Certifying DQBF Solver
/
Reichl, F. X., & Slivovsky, F. (2022). Pedant: A Certifying DQBF Solver. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–10). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.20
Download: PDF (569 KB) -
Weighted Model Counting with Twin-Width
/
Ganian, R., Pokrývka, F., Schidler, A., Simonov, K., & Szeider, S. (2022). Weighted Model Counting with Twin-Width. In K. S. Meel & O. Strichman (Eds.), 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.15
Download: PDF (719 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / REVEAL-AI (2020–2024) / SLIM (2019–2024) -
CSP Beyond Tractable Constraint Languages
/
Dreier, J., Ordyniak, S., & Szeider, S. (2022). CSP Beyond Tractable Constraint Languages. In C. Solnon (Ed.), 28th International Conference on Principles and Practice of Constraint Programming (pp. 1–17). Schloss Dagstuhl, Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CP.2022.20
Download: PDF (681 KB) - Learning for Guiding Metaheuristics / Raidl, G. (2022, July 19). Learning for Guiding Metaheuristics [Keynote Presentation]. OLA’2022: Int. Conference on Optimization and Learning, Italy.
- Parallel Beam Search for Combinatorial Optimization (Extended Abstract) / Frohner, N., Gmys, J., MELAB, N., Raidl, G., & Talbi, E. (2022). Parallel Beam Search for Combinatorial Optimization (Extended Abstract). In Fifteenth International Symposium on Combinatorial Search (pp. 273–275). https://doi.org/10.1609/socs.v15i1.21783
-
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
/
Ganian, R., Hamm, T., Korchemna, V., Okrasa, K., & Simonov, K. (2022). The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. In 49th EATCS International Conference on Automata, Languages, and Programming (pp. 66:1-66:20). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ICALP.2022.66
Download: PDF (788 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
Hedonic Diversity Games: A Complexity Picture with More than Two Colors
/
Ganian, R., Hamm, T., Knop, D., Schierreich, Š., & Suchý, O. (2022). Hedonic Diversity Games: A Complexity Picture with More than Two Colors. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5034–5042). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20435
Download: PDF (169 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) / Structural Approaches in Stability Under Diversity Constraints (2021–2022) -
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
/
Hamm, T., Klobas, N., Mertzios, G., & Spirakis, P. G. (2022). The Complexity of Temporal Vertex Cover in Small-Degree Graphs. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 10193–10201). AAAI Press. https://doi.org/10.1609/aaai.v36i9.21259
Download: PDF (352 KB) -
Tractable Abstract Argumentation via Backdoor-Treewidth
/
Dvořák, W., Hecher, M., König, M., Schidler, A., Szeider, S., & Woltran, S. (2022). Tractable Abstract Argumentation via Backdoor-Treewidth. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5608–5615). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20501
Download: PDF (1.52 MB)
Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024) / SLIM (2019–2024) -
Recognizing Map Graphs of Bounded Treewidth
/
Angelini, P., Bekos, M. A., Da Lozzo, G., Gronemann, M., Montecchiani, F., & Tappini, A. (2022). Recognizing Map Graphs of Bounded Treewidth. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SWAT.2022.8
Download: PDF (730 KB) -
A Learning Large Neighborhood Search for the Staff Rerostering Problem
/
Oberweger, F. F., Raidl, G., Rönnberg, E., & Huber, M. (2022). A Learning Large Neighborhood Search for the Staff Rerostering Problem. In P. Schaus (Ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 300–317). Springer International Publishing. https://doi.org/10.1007/978-3-031-08011-1_20
Project: Computational Optimization (DK) (2016–2024) -
Constant Congestion Brambles in Directed Graphs
/
Masařík, T., Pilipczuk, M., Rzążewski, P., & Sorge, M. (2022). Constant Congestion Brambles in Directed Graphs. SIAM Journal on Discrete Mathematics, 36(2), 922–938. https://doi.org/10.1137/21M1417661
Download: Unauthorized reproduction of this article is prohibited. (1.2 MB) -
Parameterised Partially-Predrawn Crossing Number
/
Hamm, T., & Hliněný, P. (2022). Parameterised Partially-Predrawn Crossing Number. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 46:1-46:15). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.46
Download: PDF (1.03 MB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
Parameterized Algorithms for Upward Planarity
/
Chaplick, S., Di Giacomo, E., Frati, F., Ganian, R., Raftopoulou, C., & Simonov, K. (2022). Parameterized Algorithms for Upward Planarity. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.26
Download: PDF (1010 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
On Turn-Regular Orthogonal Representations
/
Bekos, M. A., Binucci, C., Di Battista, G., Didimo, W., Gronemann, M., Klein, K., Patrignani, M., & Rutter, I. (2022). On Turn-Regular Orthogonal Representations. Journal of Graph Algorithms and Applications, 26(3), 285–306. https://doi.org/10.7155/jgaa.00595
Download: PDF (802 KB) -
Parameterized Algorithms for Queue Layouts
/
Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2022). Parameterized Algorithms for Queue Layouts. Journal of Graph Algorithms and Applications, 26(3), 335–352. https://doi.org/10.7155/jgaa.00597
Download: PDF (635 KB)
Projects: HumAlgo (2018–2023) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
Drawing Shortest Paths in Geodetic Graphs
/
Cornelsen, S., Pfister, M., Förster, H., Gronemann, M., Hoffmann, M., Kobourov, S., & Schneck, T. (2022). Drawing Shortest Paths in Geodetic Graphs. Journal of Graph Algorithms and Applications, 26(3), 353–361. https://doi.org/10.7155/jgaa.00598
Download: PDF (536 KB) -
Multicriteria Optimization for Dynamic Demers Cartograms
/
Nickel, S., Sondag, M., Meulemans, W., Kobourov, S., Peltonen, J., & Nöllenburg, M. (2022). Multicriteria Optimization for Dynamic Demers Cartograms. IEEE Transactions on Visualization and Computer Graphics, 28(6), 2376–2387. https://doi.org/10.1109/TVCG.2022.3151227
Download: PDF (2.54 MB)
Project: HumAlgo (2018–2023) - A note on algebraic techniques for subgraph detection / Brand, C. (2022). A note on algebraic techniques for subgraph detection. Information Processing Letters, 176, Article 106242. https://doi.org/10.1016/j.ipl.2021.106242
-
SAT-Based Local Search for Plane Subgraph Partitions
/
Schidler, A. (2022). SAT-Based Local Search for Plane Subgraph Partitions. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 1–8). Schloss Dagstuhl --Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.74
Download: PDF (865 KB)
Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024) -
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
/
Bekos, M. A., Gronemann, M., Montecchiani, F., & Symvonis, A. (2022). Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. In Combinatorial Algorithms (pp. 157–171). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-031-06678-8_12
Download: PDF (390 KB) - Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria / Ganian, R., Kratochvíl, J., & Szeider, S. (2022). Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. In S. Szeider, R. Ganian, & J. Kratochwill (Eds.), Ninth workshop on graph classes, optimization, and Width Parameters (Vol. 312). https://doi.org/10.1016/j.dam.2022.02.009
-
Constant Congestion Brambles
/
Hatzel, M., Pilipczuk, M., Komosa, P., & Sorge, M. (2022). Constant Congestion Brambles. Discrete Mathematics & Theoretical Computer Science, 24(1), Article 6. https://doi.org/10.46298/dmtcs.6699
Download: PDF (570 KB) -
Towards Uniform Certification in QBF
/
Chew, L., & Slivovsky, F. (2022). Towards Uniform Certification in QBF. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (pp. 1–23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.22
Download: PDF (796 KB)
Project: REVEAL-AI (2020–2024) -
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
/
Kanesh, L., Madathil, J., Roy, S., Sahu, A., & Saurabh, S. (2022). Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (pp. 1–20). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.39
Download: PDF (837 KB) - Twin-width and generalized coloring numbers / Dreier, J., Gajarský, J., Jiang, Y., Ossona de Mendez, P., & Raymond, J.-F. (2022). Twin-width and generalized coloring numbers. Discrete Mathematics, 345(3), Article 112746. https://doi.org/10.1016/j.disc.2021.112746
- An efficient algorithm for counting Markov equivalent DAGs / Ganian, R., Hamm, T., & Talvitie, T. (2022). An efficient algorithm for counting Markov equivalent DAGs. Artificial Intelligence, 304, 1–13. https://doi.org/10.1016/j.artint.2021.103648
-
Removing Popular Faces in Curve Arrangements by Inserting one more Curve
/
de Nooijer, P., Nickel, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., & Rote, G. (2022). Removing Popular Faces in Curve Arrangements by Inserting one more Curve. In 38th European Workshop on Computational Geometry - Booklet of abstracts (pp. 1–8).
Download: PDF (1.14 MB) - A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2022). A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications. In B. Dorronsora, F. Yalaoui, E.-G. Talbi, & G. Danoy (Eds.), Metaheuristics and Nature Inspired Computing (pp. 3–17). Springer International Publishing. https://doi.org/10.1007/978-3-030-94216-8_1
-
Sum-of-Products with Default Values: Algorithms and Complexity Results
/
Ganian, R., Kim, E. J., Slivovsky, F., & Szeider, S. (2022). Sum-of-Products with Default Values: Algorithms and Complexity Results. Journal of Artificial Intelligence Research, 73, 535–552. https://doi.org/10.1613/JAIR.1.12370
Download: PDF (353 KB)
Projects: NFPC (2018–2022) / QBF (2015–2018) -
Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
/
Huber, M., & Raidl, G. (2022). Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems. In Machine Learning, Optimization, and Data Science (pp. 283–298). Springer Nature Switzerland AG. https://doi.org/10.34726/3443
Download: PDF (322 KB)
Project: Computational Optimization (DK) (2016–2024) - Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs / Bhore, S., Löffler, M., Nickel, S., & Nöllenburg, M. (2022). Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs [Presentation]. Utrecht University, Netherlands (the). http://hdl.handle.net/20.500.12708/153108
- Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach / Wallinger, M., Archambault, D., Auber, D., Nöllenburg, M., & Peltonen, J. (2022). Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. IEEE Transactions on Visualization and Computer Graphics, 28(1), 313–323. https://doi.org/10.1109/tvcg.2021.3114795
- A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters / Jatschka, T., Rauscher, M., Kreutzer, B., Rodemann, T., & Raidl, G. (2022). A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scooters. In Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (pp. 32–33). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/176897
-
The Complexity of Envy-Free Graph Cutting
/
Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2022). The Complexity of Envy-Free Graph Cutting. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 237–243). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/34
Download: paper (182 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) - Slim Tree-Cut Width / Ganian, R., & Korchemna, V. (2022). Slim Tree-Cut Width. In H. Dell & J. Nederlof (Eds.), 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) (pp. 1–18). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2022.15
-
A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
/
Huber, M., & Raidl, G. (2022). A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems. In A. Quesada-Arencibia, J. C. Rodriguez, R. Moreno-Díaz, G. S. de Blasio, & C. R. Garcia (Eds.), Computer Aided Systems Theory - Extended Abstracts (pp. 22–23). IUCTC Universidad de Las Palmas de Gran Canaria.
Project: Computational Optimization (DK) (2016–2024) -
Learning Large Bayesian Networks with Expert Constraints
/
Peruvemba Ramaswamy, V., & Szeider, S. (2022). Learning Large Bayesian Networks with Expert Constraints. In Proceedings of the 38th Conference on Uncertainty in Artificial Intelligence (UAI 2022) (pp. 1592–1601). PMLR. https://doi.org/10.34726/3821
Download: PDF (606 KB) -
On Covering Segments with Unit Intervals
/
Bergren, D., Eiben, E., Ganian, R., & Kanj, I. (2022). On Covering Segments with Unit Intervals. SIAM Journal on Discrete Mathematics, 36(2), 1200–1230. https://doi.org/10.1137/20M1336412
Download: Unauthorized reproduction of this article is prohibited. (727 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation
/
Mayerhofer, J., Kirchweger, M., Huber, M., & Raidl, G. (2022). A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. In Evolutionary Computation in Combinatorial Optimization (pp. 127–142). Springer Nature Switzerland AG. https://doi.org/10.34726/3442
Download: PDF (434 KB)
Project: Computational Optimization (DK) (2016–2024) -
Learning Fast-Inference Bayesian Networks
/
Peruvemba Ramaswamy, V., & Szeider, S. (2022). Learning Fast-Inference Bayesian Networks. In Advances in Neural Information Processing Systems 34 (NeurIPS 2021). 35th conference on neural information processing systems (NeurIPS 2021), International. https://doi.org/10.34726/4023
Download: PDF (1.07 MB)
Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024) -
The Complexity of k-Means Clustering when Little is Known
/
Ganian, R., Hamm, T., Korchemna, V., Okrasa, K., & Simonov, K. (2022). The Complexity of k-Means Clustering when Little is Known. In Proceedings of the 39th International Conference on Machine Learning (pp. 6960–6987). https://doi.org/10.34726/3070
Download: PDF (856 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) -
Finding a Battleship of Uncertain Shape
/
Hainzl, E.-M., Löffler, M., Perz, D., Tkadlec, J., & Wallinger, M. (2022). Finding a Battleship of Uncertain Shape. In 38th European Workshop on Computational Geometry. March 14-16, 2022, Perugia, Italy. Booklet of abstracts. 38th European Workshop on Computational Geometry, Italy. https://doi.org/10.34726/4264
Download: PDF (214 KB) -
Transitions in Dynamic Map Labeling
/
Depian, T., Li, G., Nöllenburg, M., & Wulms, J. (2022). Transitions in Dynamic Map Labeling [Conference Presentation]. European Workshop on Computational Geometry, Perugia, Italy. https://doi.org/10.34726/3122
Download: PDF (3.01 MB)
Projects: Engineering Linear Ordering Algorithms for Optimizing Data Visualizations (2020–2025) / HumAlgo (2018–2023) - From Twin-Width to Propositional Logic and Back / Szeider, S. (2022). From Twin-Width to Propositional Logic and Back [Conference Presentation]. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Slovenia. http://hdl.handle.net/20.500.12708/153793
-
Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet
/
Varga, J., Raidl, G., & Limmer, S. (2022). Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet. IEEE Access, 10, 105786–105806. https://doi.org/10.1109/ACCESS.2022.3210168
Download: PDF (2.25 MB) - Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms / Brand, C. (2022). Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms. Journal of Computer and System Sciences, 129, 62–71. https://doi.org/10.1016/j.jcss.2022.05.004
-
Planarizing Graphs and their Drawings by Vertex Splitting
/
Nickel, S., Nöllenburg, M., Sorge, M., Villedieu, A., Wu, H.-Y., & Wulms, J. (2022). Planarizing Graphs and their Drawings by Vertex Splitting. arXiv. https://doi.org/10.34726/3828
Download: PDF (1.91 MB)
Projects: Engineering Linear Ordering Algorithms for Optimizing Data Visualizations (2020–2025) / HumAlgo (2018–2023) - SAT-based Local Improvement / Szeider, S. (2022). SAT-based Local Improvement [Keynote Presentation]. UNRAVEL-LOGICS workshop, Austria.
-
A Unifying Framework for Characterizing and Computing Width Measures
/
Eiben, E., Ganian, R., Hamm, T., Jaffke, L., & Kwon, O.-J. (2022). A Unifying Framework for Characterizing and Computing Width Measures. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) (pp. 1–23). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.ITCS.2022.63
Download: PDF (819 KB)
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) - SLIM- SAT-based Local Improvement / Szeider, S. (2022). SLIM- SAT-based Local Improvement [Conference Presentation]. Dagstuhl Seminar 22411 Theory and Practice of SAT and Combinatorial Solving, Germany.
-
The Parameterized Complexity of SAT
/
Szeider, S. (2022). The Parameterized Complexity of SAT [Conference Presentation]. Workshop Parameterized Complexity of Computational Reasoning (PCCR 2022), Israel.
Download: PDF (12.6 MB) - A SAT Approach to Twin-Width / Schidler, A., & Szeider, S. (2022). A SAT Approach to Twin-Width. In 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) (pp. 67–77). https://doi.org/10.1137/1.9781611977042.6
- A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning / Jatschka, T., Rodemann, T., & Raidl, G. (2022). A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning [Conference Presentation]. HRI EGN Symposium, Germany. http://hdl.handle.net/20.500.12708/153058
- Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences / Djukanović, M., Kartelj, A., Matić, D., Grbić, M., Blum, C., & Raidl, G. R. (2022). Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Applied Soft Computing, 122, Article 108844. https://doi.org/10.1016/j.asoc.2022.108844
-
Learning Value Functions for Same-Day Delivery Problems
/
Frohner, N., & Raidl, G. (2022). Learning Value Functions for Same-Day Delivery Problems. In Extended Abstracts of the 18th International Conference on Computer Aided Systems Theory (EUROCAST 2022) (pp. 20–21). http://hdl.handle.net/20.500.12708/142196
Download: PDF (510 KB) - Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts / Brand, C., Ceylan, E., Ganian, R., Hatschka, C., & Korchemna, V. (2022). Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. In M. A. Bekos & M. Kaufmann (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 98–113). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-031-15914-5_8
- Shape-Guided Mixed Metro Map Layout / Batik, T., Terziadis, S., Wang, Y.-S., Nöllenburg, M., & Wu, H.-Y. (2022). Shape-Guided Mixed Metro Map Layout. In N. Umetani, E. Vouga, & C. Wojtan (Eds.), Pacific Graphics 2022 (pp. 495–506). The Eurographics Association and John Wiley & Sons Ltd. https://doi.org/10.1111/cgf.14695
- The mixed page number of graphs / Md. Alam, J., Bekos, M. A., Gronemann, M., Kaufmann, M., & Pupyrev, S. (2022). The mixed page number of graphs. Theoretical Computer Science, 931, 131–141. https://doi.org/10.1016/j.tcs.2022.07.036
- QBF Solvers and their Proof Complexity / Slivovsky, F. (2022). QBF Solvers and their Proof Complexity [Conference Presentation]. Proof Complexity Workshop 2022, Israel.
-
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
/
Akitaya, H., Demaine, E., Korman, M., Kostitsyna, I., Parada, I., Sonke, W., Speckmann, B., Uehara, R., & Wulms, J. (2022, 0 0). Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares [Conference Presentation]. 38th European Workshop on Computational Geometry, Italy. https://doi.org/10.34726/3466
Download: PDF (2.33 MB)
Project: HumAlgo (2018–2023)
2021
-
Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers
/
Schaden, B., Jatschka, T., Limmer, S., & Raidl, G. (2021). Smart Charging of Electric Vehicles Considering SOC-Dependent Maximum Charging Powers. Energies, 14(22), 1–33. https://doi.org/10.3390/en14227755
Download: PDF (961 KB) -
Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources
/
Maschler, J., & Raidl, G. (2021). Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research, 302, 507–531. https://doi.org/10.1007/s10479-019-03479-6
Download: PDF (499 KB) -
A local search framework for industrial test laboratory scheduling
/
Mischek, F., & Musliu, N. (2021). A local search framework for industrial test laboratory scheduling. Annals of Operations Research, 302, 533–562. https://doi.org/10.1007/s10479-021-04007-1
Download: PDF (477 KB) - Untangling Circular Drawings: Algorithms and Complexity / Bhore, S., Li, G., Nöllenburg, M., Rutter, I., & Wu, H.-Y. (2021). Untangling Circular Drawings: Algorithms and Complexity. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021) (pp. 1–17). LIPICS. https://doi.org/10.4230/LIPIcs.ISAAC.2021.19
- Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs / Bhore, S., Löffler, M., Nickel, S., & Nöllenburg, M. (2021). Unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged Graphs. In Lecture Notes in Computer Science (pp. 304–317). LNCS / Springer. https://doi.org/10.1007/978-3-030-92931-2_22
- On the Upward Book Thickness Problem: Combinatorial and Complexity Results / Bhore, S., Da Lozzo, G., Montecchiani, F., & Nöllenburg, M. (2021). On the Upward Book Thickness Problem: Combinatorial and Complexity Results. In Lecture Notes in Computer Science (pp. 242–256). LNCS / Springer. https://doi.org/10.1007/978-3-030-92931-2_18
- Worbel: Aggregating Point Labels intoWord Clouds / Bhore, S., Ganian, R., Li, G., Nöllenburg, M., & Wulms, J. (2021). Worbel: Aggregating Point Labels intoWord Clouds. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems. ACM SIGSPATIAL international conference on Advances in geographic information systems, Irvine, California, Non-EU. ACM. https://doi.org/10.1145/3474717.3483959
- Geometric planar networks on bichromatic collinear points / Bandyapadhyay, S., Banik, A., Bhore, S., & Nöllenburg, M. (2021). Geometric planar networks on bichromatic collinear points. Theoretical Computer Science, 895, 124–136. https://doi.org/10.1016/j.tcs.2021.09.035
- Balanced Independent and Dominating Sets on Colored Interval Graphs / Bhore, S., Haunert, J.-H., Klute, F., Li, G., & Nöllenburg, M. (2021). Balanced Independent and Dominating Sets on Colored Interval Graphs. In SOFSEM 2021: Theory and Practice of Computer Science (pp. 89–103). Springer. https://doi.org/10.1007/978-3-030-67731-2_7
- Crossing-Optimal Extension of Simple Drawings / Ganian, R., Hamm, T., Klute, F., Parada, I., & Vogtenhuber, B. (2021). Crossing-Optimal Extension of Simple Drawings. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (pp. 1–17). LIPICS. https://doi.org/10.4230/LIPIcs.ICALP.2021.72
- Labeling nonograms: Boundary labeling for curve arrangements / Klute, F., Löffler, M., & Nöllenburg, M. (2021). Labeling nonograms: Boundary labeling for curve arrangements. Computational Geometry, 98(101791), 101791. https://doi.org/10.1016/j.comgeo.2021.101791
- On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2021). On Strict (Outer-)Confluent Graphs. Journal of Graph Algorithms and Applications, 25(1), 481–512. https://doi.org/10.7155/jgaa.00568
- The Parameterized Complexity of Clustering Incomplete Data / Eiben, E., Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2021). The Parameterized Complexity of Clustering Incomplete Data. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 7296–7304). AAAI Press. http://hdl.handle.net/20.500.12708/58587
- The Complexity of Object Association in Multiple Object Tracking / Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Complexity of Object Association in Multiple Object Tracking. In The Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI-21) (pp. 1388–1396). AAAI Press. http://hdl.handle.net/20.500.12708/58619
- The Parameterized Complexity of Connected Fair Division / Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2021). The Parameterized Complexity of Connected Fair Division. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/20
- Parameterized Complexity of Small Decision Tree Learning / Ordyniak, S., & Szeider, S. (2021). Parameterized Complexity of Small Decision Tree Learning. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 1–9). AAAI Press. http://hdl.handle.net/20.500.12708/58602
- The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints / Dvořák, P., Eiben, E., Ganian, R., Knop, D., & Ordyniak, S. (2021). The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artificial Intelligence, 300(103561), 103561. https://doi.org/10.1016/j.artint.2021.103561
- On Structural Parameterizations of the Edge Disjoint Paths Problem / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2021). On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica, 83(6), 1605–1637. https://doi.org/10.1007/s00453-020-00795-3
- Computing Kemeny Rankings from d-Euclidean Preferences / Hamm, T., Lackner, M., & Rapberger, A. (2021). Computing Kemeny Rankings from d-Euclidean Preferences. In Algorithmic Decision Theory (pp. 147–161). https://doi.org/10.1007/978-3-030-87756-9_10
- Approximate Evaluation of First-Order Counting Queries / Dreier, J., & Rossmanith, P. (2021). Approximate Evaluation of First-Order Counting Queries. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1720–1739). https://doi.org/10.1137/1.9781611976465.104
- Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes / Dreier, J. (2021). Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS 2021 - Symposium on Logic in Computer Science, Rom, EU. https://doi.org/10.1109/lics52264.2021.9470680
- Chapter 17. Fixed-Parameter Tractability / Samer, M., & Szeider, S. (2021). Chapter 17. Fixed-Parameter Tractability. In A. Biere, M. Heule, H. van Maaren, & T. Walsh (Eds.), Frontiers in Artificial Intelligence and Applications. IOS Press. https://doi.org/10.3233/faia201000
- On (Coalitional) Exchange-Stable Matching / Chen, J., Chmurovic, A., Jogl, F., & Sorge, M. (2021). On (Coalitional) Exchange-Stable Matching. In Algorithmic Game Theory (pp. 205–220). LNCS / Springer. https://doi.org/10.1007/978-3-030-85947-3_14
- Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP / Chen, J., Ganian, R., & Hamm, T. (2021). Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (pp. 1–7). http://hdl.handle.net/20.500.12708/55573
- Fractional Matchings under Preferences: Stability and Optimality / Chen, J., Roy, S., & Sorge, M. (2021). Fractional Matchings under Preferences: Stability and Optimality. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/13
- Fractional Matchings under Preferences: Stability and Optimality / Chen, J. (2021). Fractional Matchings under Preferences: Stability and Optimality. COMSOC Video Seminar, International Seminar Series on Social Choice, online, International. http://hdl.handle.net/20.500.12708/87317
- Computational aspects of multiwinner approval voting via p-norm Hamming distance vectors / Chen, J., Hermelin, D., & Sorge, M. (2021). Computational aspects of multiwinner approval voting via p-norm Hamming distance vectors. Aggregation across disciplines: connections and frameworks, Paris, EU. http://hdl.handle.net/20.500.12708/87316
- Efficient fully dynamic elimination forests with applications to detecting long paths and cycles / Chen, J., Czerwinski, W., Disser, Y., Feldmann, A. E., Hermelin, D., Nadara, W., Pilipczuk, M., Pilipczuk, M., Sorge, M., Wróblewski, B., & Zych-Pawlewicz, A. (2021). Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 796–809). Siam. https://doi.org/10.1137/1.9781611976465.50
- Matchings under Preferences: Strength of Stability and Tradeoffs / Chen, J., Skowron, P., & Sorge, M. (2021). Matchings under Preferences: Strength of Stability and Tradeoffs. ACM Transactions on Economics and Computation, 9(4), 1–55. https://doi.org/10.1145/3485000
- Small one‑dimensional Euclidean preference profiles / Chen, J., & Grottke, S. (2021). Small one‑dimensional Euclidean preference profiles. Social Choice and Welfare, 57(1), 117–144. https://doi.org/10.1007/s00355-020-01301-y
-
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
/
Ganian, R., & Korchemna, V. (2021). The Complexity of Bayesian Network Learning: Revisiting the Superstructure. In M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, & J. Wortman Vaughan (Eds.), Advances in Neural Information Processing Systems 34 (NeurIPS 2021) (pp. 430–442). Curran Associates, Inc. https://doi.org/10.34726/3905
Download: PDF (645 KB)
Projects: NFPC (2018–2022) / Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) - On the Readability of Abstract Set Visualizations / Wallinger, M., Jacobsen, B., Kobourov, S. G., & Nöllenburg, M. (2021). On the Readability of Abstract Set Visualizations. IEEE Transactions on Visualization and Computer Graphics, 27(6), 2821–2832. https://doi.org/10.1109/tvcg.2021.3074615
- MetroSets: Visualizing Sets as Metro Maps / Jacobsen, B., Wallinger, M., Kobourov, S. G., & Nöllenburg, M. (2021). MetroSets: Visualizing Sets as Metro Maps. IEEE Transactions on Visualization and Computer Graphics, 27(2), 1257–1267. https://doi.org/10.1109/tvcg.2020.3030475
- Mixed Metro Maps with User-Specied Motifs / Batik, T., Terziadis, S., Nöllenburg, M., Wang, Y.-S., & Wu, H.-Y. (2021). Mixed Metro Maps with User-Specied Motifs. In 29th International Symposium on Graph Drawing and Network Visualization (pp. 1–4). http://hdl.handle.net/20.500.12708/55642
- A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Raidl, G. R., & Rodemann, T. (2021). A General Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. Algorithms, 14(8), 232. https://doi.org/10.3390/a14080232
-
Graphs with Two Moplexes
/
Dallard, C., Ganian, R., Hatzel, M., Krnc, M., & Milanič, M. (2021). Graphs with Two Moplexes. In Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium (pp. 248–256). Elsevier. https://doi.org/10.1016/j.procs.2021.11.031
Download: PDF (344 KB)
Project: Parameterisierte Analyse in der Künstlichen Intelligenz (2021–2026) - Topological stability of kinetic k-centers / van der Hoog, I., van Kreveld, M., Meulemans, W., Verbeek, K., & Wulms, J. (2021). Topological stability of kinetic k-centers. Theoretical Computer Science, 866, 145–159. https://doi.org/10.1016/j.tcs.2021.03.026
- Balanced stable marriage: How close is close enough? / Gupta, S., Roy, S., Saurabh, S., & Zehavi, M. (2021). Balanced stable marriage: How close is close enough? Theoretical Computer Science, 883, 19–43. https://doi.org/10.1016/j.tcs.2021.05.015
- Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings / Nikolic, B., Kartelj, A., Djukanovic, M., Grbic, M., Blum, C., & Raidl, G. (2021). Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings. Mathematics, 9(13), 1515. https://doi.org/10.3390/math9131515
- Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture / Bagheri Gh, B., Feder, T., Fleischner, H., & Subi, C. (2021). Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette’s Conjecture. Journal of Graph Theory, 96(2), 269–288. https://doi.org/10.1002/jgt.22612
- Your rugby mates don't need to know your colleagues: Triadic closure with edgecolors / Bulteau, L., Grüttemeier, N., Komusiewicz, C., & Sorge, M. (2021). Your rugby mates don’t need to know your colleagues: Triadic closure with edgecolors. Journal of Computer and System Sciences, 120, 75–96. https://doi.org/10.1016/j.jcss.2021.03.001
- Measuring what matters: Ahybrid approach to dynamic programming with treewidth / Eiben, E., Ganian, R., Hamm, T., & Kwon, O. (2021). Measuring what matters: Ahybrid approach to dynamic programming with treewidth. Journal of Computer and System Sciences, 121, 57–75. https://doi.org/10.1016/j.jcss.2021.04.005
- A best possible result for the square of a 2-block to be hamiltonian / Ekstein, J., & Fleischner, H. (2021). A best possible result for the square of a 2-block to be hamiltonian. Discrete Mathematics, 344(112158), 112158. https://doi.org/10.1016/j.disc.2020.112158
- New width parameters for SAT and #SAT / Ganian, R., & Szeider, S. (2021). New width parameters for SAT and #SAT. Artificial Intelligence, 295(103460), 103460. https://doi.org/10.1016/j.artint.2021.103460
- Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources / Maschler, J., & Raidl, G. R. (2021). Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources. Annals of Operations Research, 302(2), 507–531. https://doi.org/10.1007/s10479-019-03479-6
- A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2021). A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications. Honda Research Institute Europe, Offenbach, Germany, Honda Research Institute Europe, Offenbach, Germany, International. http://hdl.handle.net/20.500.12708/87248
- A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem / Horn, M., & Raidl, G. R. (2021). A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 72–88). LNCS / Springer. https://doi.org/10.1007/978-3-030-78230-6_5
- Driver Shift Planning for an Online Store with Short Delivery Times / Horn, M., Frohner, N., & Raidl, G. R. (2021). Driver Shift Planning for an Online Store with Short Delivery Times. In Procedia Computer Science (pp. 517–524). Elsevier. https://doi.org/10.1016/j.procs.2021.01.270
- Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems / Bracher, A., Frohner, N., & Raidl, G. R. (2021). Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 283–298). LNCS / Springer. https://doi.org/10.1007/978-3-030-78230-6_18
- Layered Area-Proportional Rectangle Contact Representations / Nöllenburg, M., Villedieu, A., & Wulms, J. (2021). Layered Area-Proportional Rectangle Contact Representations. In Lecture Notes in Computer Science (pp. 318–326). LNCS / Springer. https://doi.org/10.1007/978-3-030-92931-2_23
- Stable Visual Summaries for Trajectory Collections / Wulms, J., Buchmüller, J., Meulemans, W., Verbeek, K., & Speckmann, B. (2021). Stable Visual Summaries for Trajectory Collections. In 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), Tianjin, China, International. 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). https://doi.org/10.1109/pacificvis52677.2021.00016
- Cluster Editing Parameterized Above Modification-Disjoint P3-Packings / Li, S., Pilipczuk, M., & Sorge, M. (2021). Cluster Editing Parameterized Above Modification-Disjoint P3-Packings. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) (pp. 1–16). LIPICS. https://doi.org/10.4230/LIPIcs.STACS.2021.49
- Optimal Discretization is Fixed-parameter Tractable / Kratsch, S., Masařík, T., Muzi, I., Pilipczuk, M., & Sorge, M. (2021). Optimal Discretization is Fixed-parameter Tractable. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1702–1719). ACM. https://doi.org/10.1137/1.9781611976465.103
- Proof Complexity of Symbolic QBF Reasoning / Mengel, S., & Slivovsky, F. (2021). Proof Complexity of Symbolic QBF Reasoning. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 399–416). LNCS / Springer. https://doi.org/10.1007/978-3-030-80223-3_28
- Davis and Putnam Meet Henkin: Solving DQBF with Resolution / Blinkhorn, J., Peitl, T., & Slivovsky, F. (2021). Davis and Putnam Meet Henkin: Solving DQBF with Resolution. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 30–46). LNCS / Springer. https://doi.org/10.1007/978-3-030-80223-3_4
- First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving / Schreiner, W., & Reichl, F.-X. (2021). First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving. In Electronic Proceedings in Theoretical Computer Science (pp. 99–113). https://doi.org/10.4204/eptcs.342.9
- Finding the Hardest Formulas for Resolution (Extended Abstract) / Peitl, T., & Szeider, S. (2021). Finding the Hardest Formulas for Resolution (Extended Abstract). In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/657
- Computing Optimal Hypertree Decompositions with SAT / Schidler, A., & Szeider, S. (2021). Computing Optimal Hypertree Decompositions with SAT. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. https://doi.org/10.24963/ijcai.2021/196
- Parameterized Complexity of Feature Selection for Categorical Data Clustering / Bandyapadhyay, S., Fomin, F., Golovach, P., & Simonov, K. (2021). Parameterized Complexity of Feature Selection for Categorical Data Clustering. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (pp. 1–14). LIPICS. https://doi.org/10.4230/LIPIcs.MFCS.2021.14
- SAT Modulo Symmetries for Graph Generation / Kirchweger, M., & Szeider, S. (2021). SAT Modulo Symmetries for Graph Generation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021) (pp. 1–16). LIPICS. https://doi.org/10.4230/LIPIcs.CP.2021.34
- Certified DQBF Solving by Definition Extraction / Reichl, F.-X., Slivovsky, F., & Szeider, S. (2021). Certified DQBF Solving by Definition Extraction. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 499–517). LNCS / Springer. https://doi.org/10.1007/978-3-030-80223-3_34
- Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms / Gupta, S., Jain, P., Panolan, F., Roy, S., & Saurabh, S. (2021). Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. In Algorithmic Game Theory (pp. 140–155). LNCS / Springer. https://doi.org/10.1007/978-3-030-85947-3_10
- SAT-based Decision Tree Learning for Large Data Sets / Schidler, A., & Szeider, S. (2021). SAT-based Decision Tree Learning for Large Data Sets. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 3904–3912). AAAI Press. http://hdl.handle.net/20.500.12708/58603
- Parameterized Complexity in Graph Drawing / Ganian, R., Montecchiani, F., Nöllenburg, M., & Zehavi, M. (2021). Parameterized Complexity in Graph Drawing. In Seminar on Parameterized Complexity in Graph Drawing (pp. 82–123). Dagstuhl Reports. https://doi.org/10.4230/DagRep.11.6.82
- ClusterSets: Optimizing Planar Clusters in Categorical Point Data / Geiger, J., Cornelsen, S., Haunert, J. ‐H., Kindermann, P., Mchedlidze, T., Nöllenburg, M., Okamoto, Y., & Wolff, A. (2021). ClusterSets: Optimizing Planar Clusters in Categorical Point Data. In Computer Graphics Forum (pp. 471–481). https://doi.org/10.1111/cgf.14322
- Turbocharging Treewidth-Bounded Bayesian Network Structure Learning / Ramaswamy, V. P., & Szeider, S. (2021). Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 3895–3903). AAAI Press. http://hdl.handle.net/20.500.12708/58598
- The Complexity Landscape of Resource-Constrained Scheduling / Ganian, R., Hamm, T., & Mescoff, G. (2021). The Complexity Landscape of Resource-Constrained Scheduling. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI 2020, Yokohama, Non-EU. https://doi.org/10.24963/ijcai.2020/241
- Threshold Treewidth and Hypertree Width / Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2021). Threshold Treewidth and Hypertree Width. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, EU. https://doi.org/10.24963/ijcai.2020/263
- Hardness and Optimality in QBF Proof Systems Modulo NP / Chew, L. (2021). Hardness and Optimality in QBF Proof Systems Modulo NP. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 98–115). Springer. https://doi.org/10.1007/978-3-030-80223-3_8
- Avoiding Monochromatic Rectangles Using Shift Patterns / Liu, Z., Chew, L., & Heule, M. (2021). Avoiding Monochromatic Rectangles Using Shift Patterns. In Proceedings of the Fourteenth International Symposium on Combinatorial Search (pp. 225–227). AAAI Press. http://hdl.handle.net/20.500.12708/55633
- External Labeling: Fundamental Concepts and Algorithmic Techniques / Bekos, M. A., Niedermann, B., & Nöllenburg, M. (2021). External Labeling: Fundamental Concepts and Algorithmic Techniques. In Synthesis Lectures on Visualization (p. 130). Morgan & Claypool. https://doi.org/10.2200/s01115ed1v01y202107vis014
2020
- Finding Longest Common Subsequences: New anytime A* search results / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Finding Longest Common Subsequences: New anytime A* search results. Applied Soft Computing, 95, Article 106499. https://doi.org/10.1016/j.asoc.2020.106499
- Balanced Independent and Dominating Sets onColored Interval Graphs / Bhore, S., Haunert, J.-H., Klute, F., Li, G., & Nöllenburg, M. (2020). Balanced Independent and Dominating Sets onColored Interval Graphs. EuroCG, Utrecht, Niederlande, EU. http://hdl.handle.net/20.500.12708/87063
- Geometric Planar Networks on Bichromatic Points / Bandyapadhyay, S., Banik, A., Bhore, S., & Nöllenburg, M. (2020). Geometric Planar Networks on Bichromatic Points. In Lecture Notes in Computer Science. CALDAM, Kharagpur, India, Non-EU. LNCS. https://doi.org/10.1007/978-3-030-39219-2
- An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling / Bhore, S., Li, G., & Nöllenburg, M. (2020). An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling. In 28th Annual European Symposium on Algorithms (ESA 2020) (pp. 1–24). LIPICS. https://doi.org/10.4230/LIPIcs.ESA.2020.19
- Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2020). Parameterized Algorithms for Book Embedding Problems. Journal of Graph Algorithms and Applications, 24(4), 603–620. https://doi.org/10.7155/jgaa.00526
- On Solving a Generalized Constrained Longest Common Subsequence Problem / Djukanovic, M., Berger, C., Raidl, G. R., & Blum, C. (2020). On Solving a Generalized Constrained Longest Common Subsequence Problem. In Optimization and Applications (pp. 55–70). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_5
- An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem / Djukanovic, M., Berger, C., Raidl, G. R., & Blum, C. (2020). An A∗Search Algorithm for the Constrained Longest Common Subsequence Problem. Information Processing Letters, 166(106041), 106041. https://doi.org/10.1016/j.ipl.2020.106041
- A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives / Wu, H., Niedermann, B., Takahashi, S., Roberts, M. J., & Nöllenburg, M. (2020). A Survey on Transit Map Layout - from Design, Machine, and Human Perspectives. Computer Graphics Forum, 39(3), 619–646. https://doi.org/10.1111/cgf.14030
- Extending Nearly Complete 1-Planar Drawings in Polynomial Time / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In 45th International Symposium on Mathematical Foundations of Computer Science (pp. 1–16). LIPIcs. https://doi.org/10.4230/LIPIcs.MFCS.2020.31
- On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2020). On Structural Parameterizations of the Bounded‑Degree Vertex Deletion Problem. Algorithmica, 83(1), 297–336. https://doi.org/10.1007/s00453-020-00758-8
- Parameterized Complexity of Envy-Free Resource Allocation in Social Networks / Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2020). Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 7135–7142). AAAI Press. https://doi.org/10.1609/aaai.v34i05.6201
- On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2020). On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 3906–3913). AAAI Press. https://doi.org/10.1609/aaai.v34i04.5804
- The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths / Ganian, R., & Ordyniak, S. (2020). The Power of Cut‑Based Parameters for Computing Edge‑Disjoint Paths. Algorithmica, 83(2), 726–752. https://doi.org/10.1007/s00453-020-00772-w
- Usingdecomposition-parametersforQBF:Mindtheprefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2020). Usingdecomposition-parametersforQBF:Mindtheprefix! Journal of Computer and System Sciences, 110, 1–21. https://doi.org/10.1016/j.jcss.2019.12.005
- Towards a Polynomial Kernel for Directed Feedback VertexSet / Bergougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2020). Towards a Polynomial Kernel for Directed Feedback VertexSet. Algorithmica, 83(5), 1201–1221. https://doi.org/10.1007/s00453-020-00777-5
-
A Time Leap Challenge for SAT-Solving
/
Fichte, J. K., Hecher, M., & Szeider, S. (2020). A Time Leap Challenge for SAT-Solving. In Lecture Notes in Computer Science (pp. 267–285). https://doi.org/10.1007/978-3-030-58475-7_16
Projects: HYPAR (2019–2024) / START (2014–2022) -
Breaking Symmetries with RootClique and LexTopSort
/
Fichte, J. K., Hecher, M., & Szeider, S. (2020). Breaking Symmetries with RootClique and LexTopSort. In Lecture Notes in Computer Science (pp. 286–303). https://doi.org/10.1007/978-3-030-58475-7_17
Projects: HYPAR (2019–2024) / START (2014–2022) - Towards Faster Reasoners by Using Transparent Huge Pages / Fichte, J., Manthey, N., Stecklina, J., & Schidler, A. (2020). Towards Faster Reasoners by Using Transparent Huge Pages. In H. Simonis (Ed.), Principles and Practice of Constraint Programming CP 2020 (pp. 304–322). Springer Cham. https://doi.org/10.1007/978-3-030-58475-7_18
- Multi-level Area Balancing of Clustered Graphs / Wu, H.-Y., Nöllenburg, M., & Viola, I. (2020). Multi-level Area Balancing of Clustered Graphs. IEEE Transactions on Visualization and Computer Graphics, 28(7), 2682–2696. https://doi.org/10.1109/tvcg.2020.3038154
- A Beam Search Approach to the Traveling Tournament Problem / Frohner, N., Neumann, B., & Raidl, G. R. (2020). A Beam Search Approach to the Traveling Tournament Problem. In Evolutionary Computation in Combinatorial Optimization (pp. 67–82). LNCS. https://doi.org/10.1007/978-3-030-43680-3_5
- Adapting Stable Matchings to Evolving Preferences / Bredereck, R., Chen, J., Knop, D., Luo, J., & Niedermeier, R. (2020). Adapting Stable Matchings to Evolving Preferences. In Proceedings of AAAI2020 (pp. 1830–1837). http://hdl.handle.net/20.500.12708/58335
- Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences / Bredereck, R., Chen, J., Finnendahl, U. P., & Niedermeier, R. (2020). Stable roommates with narcissistic, single-peaked, andsingle-crossing preferences. Autonomous Agents and Multi-Agent Systems, 34(53). https://doi.org/10.1007/s10458-020-09470-x
- A model for finding transition-minors / Klocker, B., Fleischner, H., & Raidl, G. R. (2020). A model for finding transition-minors. Discrete Applied Mathematics, 283, 242–264. https://doi.org/10.1016/j.dam.2020.01.006
- A*-based construction of decision diagrams for a prize-collecting scheduling problem / Horn, M., Maschler, J., Raidl, G. R., & Rönnberg, E. (2020). A*-based construction of decision diagrams for a prize-collecting scheduling problem. Computers and Operations Research, 126(105125), 105125. https://doi.org/10.1016/j.cor.2020.105125
- Anytime algorithms for the longest common palindromic subsequence problem / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). Anytime algorithms for the longest common palindromic subsequence problem. Computers and Operations Research, 114(104827), 104827. https://doi.org/10.1016/j.cor.2019.104827
- Solving longest common subsequence problems via a transformation to the maximum clique problem / Blum, C., Djukanovic, M., Santini, A., Jiang, H., Li, C.-M., Manyà, F., & Raidl, G. R. (2020). Solving longest common subsequence problems via a transformation to the maximum clique problem. Computers and Operations Research, 125(105089), 105089. https://doi.org/10.1016/j.cor.2020.105089
- Efficient non-segregated routing for reconfigurable demand-aware networks / Fenz, T., Foerster, K.-T., Schmid, S., & Villedieu, A. (2020). Efficient non-segregated routing for reconfigurable demand-aware networks. Computer Communications, 164, 138–147. https://doi.org/10.1016/j.comcom.2020.10.003
- A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three / Klocker, B., Fleischner, H., & Raidl, G. R. (2020). A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Applied Mathematics and Computation, 380(125233), 125233. https://doi.org/10.1016/j.amc.2020.125233
- A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources / Horn, M., Raidl, G. R., & Rönnberg, E. (2020). A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Annals of Operations Research, 302(2), 477–505. https://doi.org/10.1007/s10479-020-03550-7
- A Unified Model and Algorithms for Temporal Map Labeling / Gemsa, A., Niedermann, B., & Nöllenburg, M. (2020). A Unified Model and Algorithms for Temporal Map Labeling. Algorithmica, 82(10), 2709–2736. https://doi.org/10.1007/s00453-020-00694-7
- Placing Labels in Road Maps: Algorithms and Complexity / Gemsa, A., Niedermann, B., & Nöllenburg, M. (2020). Placing Labels in Road Maps: Algorithms and Complexity. Algorithmica, 82(7), 1881–1908. https://doi.org/10.1007/s00453-020-00678-7
- Route schematization with landmarks / Galvão, M. D. L., Krukar, J., Nöllenburg, M., & Schwering, A. (2020). Route schematization with landmarks. Journal of Spatial Information Science, 21. https://doi.org/10.5311/josis.2020.21.589
- On Existential MSO and Its Relation to ETH / Ganian, R., Haan, R. de, Kanj, I., & Szeider, S. (2020). On Existential MSO and Its Relation to ETH. ACM Transactions on Computation Theory, 12(4), 1–32. https://doi.org/10.1145/3417759
- Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers / Frohner, N., & Raidl, G. (2020). Merging Quality Estimation for Binary Decision Diagrams with Binary Classifiers. In G. Nicosia, P. Pardalos, R. Umeton, G. GIUFFRIDA, & V. Sciacca (Eds.), Machine Learning, Optimization, and Data Science (pp. 445–457). LNCS. https://doi.org/10.1007/978-3-030-37599-7_37
- Towards Improving Merging Heuristics for Binary Decision Diagrams / Frohner, N., & Raidl, G. (2020). Towards Improving Merging Heuristics for Binary Decision Diagrams. In N. Matsatsinis, Y. (Ioannis) Marinakis, & P. Pardalos (Eds.), Learning and Intelligent Optimization : 13th International Conference, LION 13, Chania, Crete, Greece, May 27–31, 2019, Revised Selected Papers (pp. 30–45). LNCS. https://doi.org/10.1007/978-3-030-38629-0_3
- On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. CPAIOR 2020, Wien, Austria. http://hdl.handle.net/20.500.12708/87120
- Labeling Nonograms / Löffler, M., & Nöllenburg, M. (2020). Labeling Nonograms. EuroCG, Utrecht, Niederlande, EU. http://hdl.handle.net/20.500.12708/87064
- On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. R. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. In Optimization and Applications (pp. 134–149). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_11
- A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem / Kaufmann, T., Horn, M., & Raidl, G. R. (2020). A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. In Parallel Problem Solving from Nature – PPSN XVI (pp. 385–398). LNCS / Springer. https://doi.org/10.1007/978-3-030-58115-2_27
- VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / Jatschka, T., Rodemann, T., & Raidl, G. R. (2020). VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. In Computer Aided Systems Theory – EUROCAST 2019 (pp. 255–262). LNCS. https://doi.org/10.1007/978-3-030-45093-9_31
- Fixed-Parameter Tractability of Dependency QBF with Structural Parameters / Ganian, R., Peitl, T., Slivovsky, F., & Szeider, S. (2020). Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. In Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, Non-EU. https://doi.org/10.24963/kr.2020/40
- Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada / Corneil, D. G., Ganian, R., & Proskurowski, A. (2020). Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. In Discrete Applied Mathematics (pp. 1–2). Elsevier Science Publishers. https://doi.org/10.1016/j.dam.2020.04.001
- On Covering Segments with Unit Intervals / Bergren, D., Eiben, E., Ganian, R., & Kanj, I. (2020). On Covering Segments with Unit Intervals. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (p. 17). LIPICS. https://doi.org/10.4230/LIPIcs.STACS.2020.13
- An Efficient Algorithm for Counting Markov Equivalent DAGs / Ganian, R., Hamm, T., & Talvitie, T. (2020). An Efficient Algorithm for Counting Markov Equivalent DAGs. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 10136–10143). AAAI Press. https://doi.org/10.1609/aaai.v34i06.6573
- A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility / Frohner, N., & Raidl, G. (2020). A Double-Horizon Approach to a Purely Dynamic and Stochastic Vehicle Routing Problem with Delivery Deadlines and Shift Flexibility. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 58–76). http://hdl.handle.net/20.500.12708/58363
- Short Q-Resolution Proofs with Homomorphisms / Shukla, A., Slivovsky, F., & Szeider, S. (2020). Short Q-Resolution Proofs with Homomorphisms. In Theory and Applications of Satisfiability Testing – SAT 2020 (pp. 412–428). LNCS. https://doi.org/10.1007/978-3-030-51825-7_29
- Mixed Labeling: Integrating Internal and External Labels / Cmolik, L., Pavlovec, V., Wu, H.-Y., & Nöllenburg, M. (2020). Mixed Labeling: Integrating Internal and External Labels. In K. Schmid (Ed.), IEEE Transactions on Visualization and Computer Graphics (pp. 1848–1861). IEEE Computer Society Press. https://doi.org/10.1109/tvcg.2020.3027368
- Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness / Schlaipfer, M., Slivovsky, F., Weissenbacher, G., & Zuleger, F. (2020). Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. In Theory and Applications of Satisfiability Testing – SAT 2020 (pp. 429–446). LNCS. https://doi.org/10.1007/978-3-030-51825-7_30
- Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing / Slivovsky, F. (2020). Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing. In Computer Aided Verification (pp. 508–528). LNCS. https://doi.org/10.1007/978-3-030-53288-8_24
- MaxSAT-Based Postprocessing for Treedepth / Peruvemba Ramaswamy, V., & Szeider, S. (2020). MaxSAT-Based Postprocessing for Treedepth. In Lecture Notes in Computer Science (pp. 478–495). LNCS. https://doi.org/10.1007/978-3-030-58475-7_28
- Finding the Hardest Formulas for Resolution / Peitl, T., & Szeider, S. (2020). Finding the Hardest Formulas for Resolution. In Lecture Notes in Computer Science (pp. 514–530). LNCS. https://doi.org/10.1007/978-3-030-58475-7_30
- Formalizing Graph Trail Properties in Isabelle/HOL / Kovács, L., Lachnitt, H., & Szeider, S. (2020). Formalizing Graph Trail Properties in Isabelle/HOL. In Lecture Notes in Computer Science (pp. 190–205). LNCS. https://doi.org/10.1007/978-3-030-53518-6_12
- A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth / Slivovsky, F., & Szeider, S. (2020). A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. In Theory and Applications of Satisfiability Testing – SAT 2020 (pp. 267–276). LNCS. https://doi.org/10.1007/978-3-030-51825-7_19
- Computing Optimal Hypertree Decompositions / Schidler, A., & Szeider, S. (2020). Computing Optimal Hypertree Decompositions. In 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 1–11). siam. https://doi.org/10.1137/1.9781611976007.1
- Layered Fan-Planar Graph Drawings / Biedl, T., Chaplick, S., Kaufmann, M., Montecchiani, F., Nöllenburg, M., & Raftopoulou, C. (2020). Layered Fan-Planar Graph Drawings. In 45th International Symposium on Mathematical Foundations of Computer Science (pp. 1–13). LIPICS. https://doi.org/10.4230/LIPIcs.MFCS.2020.14
- Towards Data-Driven Multilinear Metro Maps / Nickel, S., & Nöllenburg, M. (2020). Towards Data-Driven Multilinear Metro Maps. In Lecture Notes in Computer Science. International Conference on Theory and Application of Diagrams, Tallinn, Estonia, EU. LNAI. https://doi.org/10.1007/978-3-030-54249-8
- Extending Partial 1-Planar Drawings / Eiben, E., Ganian, R., Hamm, T., Klute, F., & Nöllenburg, M. (2020). Extending Partial 1-Planar Drawings. In 47th International Colloquium on Automata, Languages, and Programming (pp. 1–19). Leibniz International Proceedings in Informatics. https://doi.org/10.4230/LIPIcs.ICALP.2020.0
- A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation / Djukanovic, M., Raidl, G. R., & Blum, C. (2020). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. In Machine Learning, Optimization, and Data Science (pp. 154–167). LNCS. https://doi.org/10.1007/978-3-030-37599-7_14
- Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines / Frohner, N., Horn, M., & Raidl, G. R. (2020). Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines. In Procedia Computer Science (pp. 366–370). Elsevier. https://doi.org/10.1016/j.procs.2021.01.175
- Distributing Battery Swapping Stations for Electric Scooters in an Urban Area / Jatschka, T., Rodemann, T., & Raidl, G. (2020). Distributing Battery Swapping Stations for Electric Scooters in an Urban Area. In Optimization and Applications (pp. 150–165). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_12
- Crossing Layout in Non-planar Graph Drawings / Nöllenburg, M. (2020). Crossing Layout in Non-planar Graph Drawings. In Beyond Planar Graphs (pp. 187–209). Springer, Singapore. https://doi.org/10.1007/978-981-15-6533-5_11
2019
- Lombardi drawings of knots and links / Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., & Vogtenhuber, B. (2019). Lombardi drawings of knots and links. Journal of Computational Geometry, 10(1), 444–476. https://doi.org/10.20382/jocg.v10i1
-
Particle therapy patient scheduling with limited starting time variations of daily treatments
/
Maschler, J., & Raidl, G. (2019). Particle therapy patient scheduling with limited starting time variations of daily treatments. International Transactions in Operational Research, 27(1), 458–479. https://doi.org/10.1111/itor.12579
Download: PDF (352 KB) - Parameterized Algorithms for Book Embedding Problems / Bhore, S., Ganian, R., Montecchiani, F., & Nöllenburg, M. (2019). Parameterized Algorithms for Book Embedding Problems. In Lecture Notes in Computer Science (pp. 365–378). LNCS. https://doi.org/10.1007/978-3-030-35802-0_28
- Parameterized Complexity Results for the Completion and Clustering of Incomplete Data / Szeider, S., Ganian, R., Kanj, I., & Ordyniak, S. (2019). Parameterized Complexity Results for the Completion and Clustering of Incomplete Data. Kocoon Workshop, Arras, Frankreich, EU. http://hdl.handle.net/20.500.12708/86961
- SAT-Encodings for Treecut Width and Treedepth / Ganian, R., Lodha, N., Ordyniak, S., & Szeider, S. (2019). SAT-Encodings for Treecut Width and Treedepth. In S. G. Kobourov & H. Meyerhenke (Eds.), Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM. https://doi.org/10.1137/1.9781611975499
- Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts / Klute, F., & Nöllenburg, M. (2019). Minimizing Crossings In Constrained Two-Sided Circular Graph Layouts. Journal of Computational Geometry, 10(2), 45–69. https://doi.org/10.20382/jocg.v10i2
- On the Potentials and Dilemmas of Cooperative/White-Label Deliveries based on Selected Austrian Demonstration Cases / Prandtstetter, M., Biesinger, B., Hu, B., Nolz, P., Reinthaler, M., Zajicek, J., Angelini, A., & Hauger, G. (2019). On the Potentials and Dilemmas of Cooperative/White-Label Deliveries based on Selected Austrian Demonstration Cases. In Proceedings of the 6th International Physical Internet Conference IPIC 2019 (pp. 1–7). http://hdl.handle.net/20.500.12708/65001
- Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time / Hamm, T. (2019). Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. In B. M. P. Jansen & J. A. Telle (Eds.), 14th International Symposium on Parameterized and Exact Computation (pp. 1–14). LIPIcs. https://doi.org/10.4230/LIPIcs.IPEC.2019.20
- World map of recipes / Li, G., Nickel, S., Nöllenburg, M., Viola, I., & Wu, H.-Y. (2019). World map of recipes. Graph Drawing Contest, unknown, EU. http://hdl.handle.net/20.500.12708/86915
- Guidelines for Experimental Algorithmics: A Case Study in Network Analysis / Angriman, E., Grinten, A. van der, Looz, M. von, Meyerhenke, H., Nöllenburg, M., Predari, M., & Tzovas, C. (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms, 12(7), 127. https://doi.org/10.3390/a12070127
- A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy / Haan, R. de, & Szeider, S. (2019). A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms, 12(9), 188. https://doi.org/10.3390/a12090188
-
Parameterized Complexity of Asynchronous Border Minimization
/
Ganian, R., Kronegger, M., Pfandler, A., & Popa, A. (2019). Parameterized Complexity of Asynchronous Border Minimization. Algorithmica, 81(1), 201–223. https://doi.org/10.1007/s00453-018-0442-5
Projects: FAIR (2013–2018) / START (2014–2022) / X-TRACT (2014–2018) - Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm / Horn, M., Raidl, G., & Blum, C. (2019). Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm. Artificial Intelligence, 277(103173), 103173. https://doi.org/10.1016/j.artint.2019.103173
- Planar drawings of fixed-mobile bigraphs / Bekos, M. A., De Luca, F., Didimo, W., Mchedlidze, T., Nöllenburg, M., Symvonis, A., & Tollis, I. (2019). Planar drawings of fixed-mobile bigraphs. Theoretical Computer Science, 795, 408–419. https://doi.org/10.1016/j.tcs.2019.07.025
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2019). A SAT Approach to Branchwidth. ACM Transactions on Computational Logic, 20(3), 1–24. https://doi.org/10.1145/3326159
- Dependency Learning for QBF / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Dependency Learning for QBF. Journal of Artificial Intelligence Research, 65, 181–208. https://doi.org/10.1613/jair.1.11529
- On the parameterized complexity of (k, s)-SAT / Paulusma, D., & Szeider, S. (2019). On the parameterized complexity of (k, s)-SAT. Information Processing Letters, 143, 34–36. https://doi.org/10.1016/j.ipl.2018.11.005
- Exact Approaches for Network Design Problems with Relays / Leitner, M., Ljubić, I., Riedler, M., & Ruthmair, M. (2019). Exact Approaches for Network Design Problems with Relays. INFORMS Journal on Computing, 31(1), 171–192. https://doi.org/10.1287/ijoc.2018.0820
- External Labeling Techniques: A Taxonomy and Survey / Bekos, M. A., Niedermann, B., & Nöllenburg, M. (2019). External Labeling Techniques: A Taxonomy and Survey. Computer Graphics Forum, 38(3), 833–860. https://doi.org/10.1111/cgf.13729
- Metabopolis: scalable network layout for biological pathway diagrams in urban map style / Wu, H.-Y., Nöllenburg, M., Sousa, F. L., & Viola, I. (2019). Metabopolis: scalable network layout for biological pathway diagrams in urban map style. BMC Bioinformatics, 20(187). https://doi.org/10.1186/s12859-019-2779-4
- Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses / Nesic, A., Blaicher, M., Hoose, T., Hofmann, A., Lauermann, M., Kutuvantavida, Y., Nöllenburg, M., Randel, S., Freude, W., & Koos, C. (2019). Photonic-integrated circuits with non-planar topologies realized by 3D-printed waveguide overpasses. Optics Express, 27(12), 17402. https://doi.org/10.1364/oe.27.017402
- On the readability of leaders in boundary labeling / Barth, L., Gemsa, A., Niedermann, B., & Nöllenburg, M. (2019). On the readability of leaders in boundary labeling. Information Visualization, 18(1), 110–132. https://doi.org/10.1177/1473871618799500
- Short Plane Supports for Spatial Hypergraphs / Castermans, T., van Garderen, M., Meulemans, W., Nöllenburg, M., & Yuan, X. (2019). Short Plane Supports for Spatial Hypergraphs. Journal of Graph Algorithms and Applications, 23(3), 463–498. https://doi.org/10.7155/jgaa.00499
- Algorithm and Hardness Results on Liar's Dominating Set and k-tuple Dominating Set / Banerjee, S., & Bhore, S. (2019). Algorithm and Hardness Results on Liar’s Dominating Set and k-tuple Dominating Set. In C. Colbourn, R. Grossi, & N. PISANTI (Eds.), Combinatorial Algorithms - 30th International Workshop IWOCA 2019 (pp. 48–60). LNCS. https://doi.org/10.1007/978-3-030-25005-8_5
- Metaheuristic Hybrids / Raidl, G., Puchinger, J., & Blum, C. (2019). Metaheuristic Hybrids. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (Vol. 272, pp. 385–417). Springer. https://doi.org/10.1007/978-3-319-91086-4_12
- A Survey on Computing Schematic Network Maps: The Challenge to Interactivity / Wu, H.-Y., Niedermann, B., Takahashi, S., & Nöllenburg, M. (2019). A Survey on Computing Schematic Network Maps: The Challenge to Interactivity. 2nd Schematic Mapping Workshop, TU Wien, Vienna, Austria. http://hdl.handle.net/20.500.12708/86926
- An Introduction to Knowledge Compilation / Slivovsky, F. (2019). An Introduction to Knowledge Compilation. Kocoon Workshop, Arras, Frankreich, EU. http://hdl.handle.net/20.500.12708/86962
- Computational Thinking und ADA.wien / Szeider, S. (2019). Computational Thinking und ADA.wien. eEducation Fachtagung, Wien, Austria. http://hdl.handle.net/20.500.12708/86955
- Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization / Frohner, N., Teuschl, S., & Raidl, G. (2019). Casual Employee Scheduling with Constraint Programming and Ant Colony Optimization. In Eurocast2019-EXTENDED ABSTRACTS (pp. 78–79). Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/58361
- Casual Employee Scheduling with Constraint Programming and Metaheuristics / Frohner, N., Teuschl, S., & Raidl, G. R. (2019). Casual Employee Scheduling with Constraint Programming and Metaheuristics. In Computer Aided Systems Theory – EUROCAST 2019 (pp. 279–287). LNCS. https://doi.org/10.1007/978-3-030-45093-9_34
- Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2019). Exploiting Similar Behavior of Users in a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. In Machine Learning, Optimization, and Data Science (pp. 738–750). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/58158
- Efficient non-segregated routing for reconfigurable demand-aware networks / Fenz, T., Foerster, K.-T., Schmid, S., & Villedieu, A. (2019). Efficient non-segregated routing for reconfigurable demand-aware networks. In 2019 IFIP Networking Conference (IFIP Networking). IFIP Networking Conference, Warschau, Polen, EU. IEEE Conference Publications. https://doi.org/10.23919/ifipnetworking46909.2019.8999473
- A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem / Blum, C., Thiruvady, D., Ernst, A. T., Horn, M., & Raidl, G. R. (2019). A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. In AI 2019: Advances in Artificial Intelligence (pp. 549–560). LNCS. https://doi.org/10.1007/978-3-030-35288-2_44
- Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem / Horn, M., & Raidl, G. (2019). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. In Computer Aided System Theory - EUROCAST 2019 (pp. 94–95). http://hdl.handle.net/20.500.12708/58004
- A SAT Approach for Finding Sup-Transition-Minors / Klocker, B., Fleischner, H., & Raidl, G. R. (2019). A SAT Approach for Finding Sup-Transition-Minors. In Lecture Notes in Computer Science (pp. 325–341). LNCS. https://doi.org/10.1007/978-3-030-38629-0_27
- Efficient Segment Folding is Hard / Horiyama, T., Klute, F., Korman, M., Parada, I., Uehara, R., & Yamanaka, K. (2019). Efficient Segment Folding is Hard. In Proceedings of the 31st Canadian Conference on Computational Geometry (p. 8). http://hdl.handle.net/20.500.12708/57996
- Extending to 1-plane drawings / Hamm, T., Klute, F., & Parada, I. (2019). Extending to 1-plane drawings. In Abstracts of the XVIII Spanish Meeting on Computational Geometry (p. 30). http://hdl.handle.net/20.500.12708/57995
- Exploring Semi-Automatic Map Labeling / Klute, F., Li, G., Löffler, R., Nöllenburg, M., & Schmidt, M. (2019). Exploring Semi-Automatic Map Labeling. In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM SIGSPATIAL international conference on Advances in geographic information systems, Irvine, California, Non-EU. https://doi.org/10.1145/3347146.3359359
- Mixed Linear Layouts: Complexity, Heuristics, and Experiments / de Col, P., Klute, F., & Nöllenburg, M. (2019). Mixed Linear Layouts: Complexity, Heuristics, and Experiments. In Lecture Notes in Computer Science (pp. 460–467). LNCS. https://doi.org/10.1007/978-3-030-35802-0_35
- On Strict (Outer-)Confluent Graphs / Förster, H., Ganian, R., Klute, F., & Nöllenburg, M. (2019). On Strict (Outer-)Confluent Graphs. In Lecture Notes in Computer Science (pp. 147–161). LNCS. https://doi.org/10.1007/978-3-030-35802-0_12
- Maximizing Ink in Partial Edge Drawings of k-plane Graphs / Hummel, M., Klute, F., Nickel, S., & Nöllenburg, M. (2019). Maximizing Ink in Partial Edge Drawings of k-plane Graphs. In Lecture Notes in Computer Science (pp. 323–336). LNCS. https://doi.org/10.1007/978-3-030-35802-0_25
- Computing Stable Demers Cartograms / Nickel, S., Sondag, M., Meulemans, W., Chimani, M., Kobourov, S., Peltonen, J., & Nöllenburg, M. (2019). Computing Stable Demers Cartograms. In Lecture Notes in Computer Science (pp. 46–60). LNCS. https://doi.org/10.1007/978-3-030-35802-0_4
- Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard / Chiu, M.-K., Cleve, J., & Nöllenburg, M. (2019). Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard. In Extended abstract of EuroCG 2019 (pp. 1–9). http://hdl.handle.net/20.500.12708/57989
- Proof Complexity of Fragments of Long-Distance Q-Resolution / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Proof Complexity of Fragments of Long-Distance Q-Resolution. In Lecture Notes in Computer Science. Theory and Application of Satisfiability Testing -- SAT, Guangzhou, Non-EU. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-24258-9
- Combining Resolution-Path Dependencies with Dependency Learning / Peitl, T., Slivovsky, F., & Szeider, S. (2019). Combining Resolution-Path Dependencies with Dependency Learning. In Lecture Notes in Computer Science. Int. Conference on Theory and Applications of Satisfiability Testing, Trento, EU. LNCS. https://doi.org/10.1007/978-3-030-24258-9
- VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points / Jatschka, T., Rodemann, T., & Raidl, G. (2019). VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points. In EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019 (pp. 70–71). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/57826
- A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications / Jatschka, T., Rodemann, T., & Raidl, G. (2019). A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications. In Evolutionary Computation in Combinatorial Optimization 2019 (pp. 1–16). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57824
- A Heuristic Approach for Solving the Longest Common Square Subsequence Problem / Djukanovic, M., Raidl, G., & Blum, C. (2019). A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. In EXTENDED ABSTRACTS-Computer Aided Systems Theory 2019 (pp. 120–122). IUCTC Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/57818
- Strategies for Iteratively Refining Layered Graph Models / Riedler, M., Ruthmair, M., & Raidl, G. (2019). Strategies for Iteratively Refining Layered Graph Models. In Hybrid Metaheuristics: 11th International Workshop (pp. 46–62). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57817
- A Memetic Algorithm for Competitive Facility Location Problems / Biesinger, B., Hu, B., & Raidl, G. R. (2019). A Memetic Algorithm for Competitive Facility Location Problems. In Business and Consumer Analytics: New Ideas (pp. 637–660). Springer. https://doi.org/10.1007/978-3-030-06222-4_15
2018
-
An SMT Approach to Fractional Hypertree Width
/
Fichte, J., Hecher, M., Lodha, N., & Szeider, S. (2018). An SMT Approach to Fractional Hypertree Width. In J. Hooker (Ed.), Principles and Practice of Constraint Programming, 24th International Conference, CP 2018 (pp. 109–127). Springer-Verlag. https://doi.org/10.1007/978-3-319-98334-9_8
Project: START (2014–2022) - Planar and poly-arc Lombardi drawings / Duncan, C. A., Eppstein, D., Goodrich, M. T., Kobourov, S. G., Löffler, M., & Nöllenburg, M. (2018). Planar and poly-arc Lombardi drawings. Journal of Computational Geometry (JOCG), 9(1), 328–355. https://doi.org/10.20382/jocg.v9i1a11
- A Structural Approach to Activity Selection / Eiben, E., Ganian, R., & Ordyniak, S. (2018). A Structural Approach to Activity Selection. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 203–209). International Joint Conferences on Artificial Intelligence. http://hdl.handle.net/20.500.12708/57663
- Small Resolution Proofs for QBF using Dependency Treewidth / Eiben, E., Ganian, R., & Ordyniak, S. (2018). Small Resolution Proofs for QBF using Dependency Treewidth. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57665
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem / Ganian, R., Klute, F., & Ordyniak, S. (2018). On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. In Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science (pp. 1–14). 35th Symposium on Theoretical Aspects of Computer Science. http://hdl.handle.net/20.500.12708/57666
- Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts / Klute, F., & Nöllenburg, M. (2018). Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. In B. Speckmann & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry (pp. 53:1-53:14). LIPICS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2018.53
- Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments / Maschler, J., & Raidl, G. (2018). Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments. International Transactions in Operational Research, 27(1), 458–479. https://doi.org/10.1111/itor.12579
- Solving a selective dial-a-ride problem with logic-based Benders decomposition / Riedler, M., & Raidl, G. (2018). Solving a selective dial-a-ride problem with logic-based Benders decomposition. Computers and Operations Research, 96, 30–54. https://doi.org/10.1016/j.cor.2018.03.008
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization / Meyerhenke, H., Nöllenburg, M., & Schulz, C. (2018). Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Transactions on Visualization and Computer Graphics, 24(5), 1814–1827. https://doi.org/10.1109/tvcg.2017.2689016
- Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF / Beyersdorff, O., Blinkhorn, J., Chew, L., Schmidt, R., & Suda, M. (2018). Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning, 63(3), 597–623. https://doi.org/10.1007/s10817-018-9482-4
- On the Complexity of Rainbow Coloring Problems / Eiben, E., Ganian, R., & Lauri, J. (2018). On the Complexity of Rainbow Coloring Problems. Discrete Applied Mathematics, 246, 38–48. https://doi.org/10.1016/j.dam.2016.10.021
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion / Eiben, E., Ganian, R., & Kwon, O. (2018). A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Journal of Computer and System Sciences, 97, 121–146. https://doi.org/10.1016/j.jcss.2018.05.005
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2018). The Complexity Landscape of Decompositional Parameters for ILP. Artificial Intelligence, 257, 61–71. https://doi.org/10.1016/j.artint.2017.12.006
- Snarks with Special Spanning Trees / Hoffmann-Ostenhof, A., & Jatschka, T. (2018). Snarks with Special Spanning Trees. Graphs and Combinatorics, 35(1), 207–219. https://doi.org/10.1007/s00373-018-1973-x
- Cycle Double Covers via Kotzig Graphs / Hoffmann-Ostenhof, A., Fleischner, H., & Häggkvist, R. (2018). Cycle Double Covers via Kotzig Graphs. Journal of Combinatorial Theory, Series B, 135, 212–226. https://doi.org/10.1016/j.jctb.2018.08.005
- Long-Distance Q-Resolution with Dependency Schemes / Peitl, T., Slivovsky, F., & Szeider, S. (2018). Long-Distance Q-Resolution with Dependency Schemes. Journal of Automated Reasoning, 63(1), 127–155. https://doi.org/10.1007/s10817-018-9467-3
- Meta-kernelization using well-structured modulators / Eiben, E., Ganian, R., & Szeider, S. (2018). Meta-kernelization using well-structured modulators. Discrete Applied Mathematics, 248, 153–167. https://doi.org/10.1016/j.dam.2017.09.018
- Polynomial-Time Validation of QCDCL Certificates / Peitl, T., Slivovsky, F., & Szeider, S. (2018). Polynomial-Time Validation of QCDCL Certificates. In O. Beyersdorff & C. M. Wintersteiger (Eds.), Theory and Applications of Satisfiability Testing – SAT 2018 (pp. 253–269). Springer-Verlag, Lecture Notes in Artificial Intelligence 8268. https://doi.org/10.1007/978-3-319-94144-8_16
- Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs / Höller, M., Klute, F., Nickel, S., Nöllenburg, M., & Schreiber, B. (2018). Maximizing Ink in Symmetric Partial Edge Drawings of k-plane Graphs. European Workshop on Computational Geometry (EuroCG’18), Berlin, EU. http://hdl.handle.net/20.500.12708/86882
- Scalable Set Visualizations (Dagstuhl Seminar 17332) / Hu, Y., Micallef, L., Nöllenburg, M., & Rodgers, P. (Eds.). (2018). Scalable Set Visualizations (Dagstuhl Seminar 17332). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DagRep.7.8.1
- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity / Argyriou, E., Cornelsen, S., Förster, H., Kaufmann, M., Nöllenburg, M., Okamoto, Y., Raftopoulou, C., & Wolff, A. (2018). Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. In T. Biedl & A. Kerren (Eds.), Lecture Notes in Computer Science (pp. 509–523). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-04414-5_36
- Short Plane Supports for Spatial Hypergraphs / Castermans, T., van Garderen, M., Meulemans, W., Nöllenburg, M., & Yuan, X. (2018). Short Plane Supports for Spatial Hypergraphs. In T. Biedl & A. Kerren (Eds.), Lecture Notes in Computer Science (pp. 53–66). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-04414-5_4
- Unary Integer Linear Programming with Structural Restrictions / Eiben, E., Ganian, R., & Knop, D. (2018). Unary Integer Linear Programming with Structural Restrictions. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (pp. 1284–1290). International Joint Conferences on Artificial Intelligence. http://hdl.handle.net/20.500.12708/57664
- Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem / Maschler, J., & Raidl, G. (2018). Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem. In PATAT 2018: Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling} (pp. 375–397). http://hdl.handle.net/20.500.12708/57564
- Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments / Maschler, J., Riedler, M., & Raidl, G. R. (2018). Particle Therapy Patient Scheduling: Time Estimation for Scheduling Sets of Treatments. In Computer Aided Systems Theory – EUROCAST 2017 (pp. 364–372). Springer. https://doi.org/10.1007/978-3-319-74718-7_44
- Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging / Klocker, B., & Raidl, G. (2018). Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging. In Computer Aided Systems Theory -- EUROCAST 201 (pp. 355–363). Springer LNCS. http://hdl.handle.net/20.500.12708/57551
- An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows / Horn, M., Raidl, G., & Rönnberg, E. (2018). An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows. In Annals of Operations Research (pp. 235–256). Springer. http://hdl.handle.net/20.500.12708/57525
- GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection / Expósito, A., Raidl, G., Brito, J., & Moreno-Perez, J. (2018). GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. In Computer Aided Systems Theory (pp. 299–306). Springer LNCS. http://hdl.handle.net/20.500.12708/57521
- Portfolio-Based Algorithm Selection for Circuit QBFs / Hoos, H. H., Peitl, T., Slivovsky, F., & Szeider, S. (2018). Portfolio-Based Algorithm Selection for Circuit QBFs. In Lecture Notes in Computer Science (pp. 195–209). Springer-Verlag. https://doi.org/10.1007/978-3-319-98334-9_13
- Towards Characterizing Strict Outerconfluent Graphs / Klute, F., & Nöllenburg, M. (2018). Towards Characterizing Strict Outerconfluent Graphs. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization (GD 2017) (pp. 612–614). Springer Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57517
- Minimizing Wiggles in Storyline Visualizations / Fröschl, T., & Nöllenburg, M. (2018). Minimizing Wiggles in Storyline Visualizations. In F. Frati & K.-L. Ma (Eds.), Graph Drawing and Network Visualization (GD 2017) (pp. 585–587). Springer Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/57516
- Planar L-Drawings of Directed Graphs / Chaplick, S., Chimani, M., Cornelsen, S., Da Lozzo, G., Nöllenburg, M., Patrignani, M., Tollis, I. G., & Wolff, A. (2018). Planar L-Drawings of Directed Graphs. In F. Frati & K.-L. Ma (Eds.), Lecture Notes in Computer Science (pp. 465–478). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-73915-1_36
- Planar Drawings of Fixed-Mobile Bigraphs / Bekos, M. A., De Luca, F., Didimo, W., Mchedlidze, T., Nöllenburg, M., Symvonis, A., & Tollis, I. G. (2018). Planar Drawings of Fixed-Mobile Bigraphs. In F. Frati & K.-L. Ma (Eds.), Lecture Notes in Computer Science (pp. 426–439). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-73915-1_33
- Experimental Evaluation of Book Drawing Algorithms / Klawitter, J., Mchedlidze, T., & Nöllenburg, M. (2018). Experimental Evaluation of Book Drawing Algorithms. In F. Frati & K.-L. Ma (Eds.), Lecture Notes in Computer Science (pp. 224–238). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-73915-1_19
- Lombardi Drawings of Knots and Links / Kindermann, P., Kobourov, S., Löffler, M., Nöllenburg, M., Schulz, A., & Vogtenhuber, B. (2018). Lombardi Drawings of Knots and Links. In F. Frati & K.-L. Ma (Eds.), Lecture Notes in Computer Science (pp. 113–126). Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-73915-1_10
- Parameterized Algorithms for the Matrix Completion Problem / Ganian, R., Kanj, I., Ordyniak, S., & Szeider, S. (2018). Parameterized Algorithms for the Matrix Completion Problem. In Proceeding of ICML (pp. 1642–1651). Journal of Machine Learning Research. http://hdl.handle.net/20.500.12708/57440
- The Travel of a Metabolite / Wu, H.-Y., Nöllenburg, M., & Viola, I. (2018). The Travel of a Metabolite. In Proceedings of PacificVis 2018 Data Story Telling Contest. IEEE Pacific Visualization Symposium (PacificVis), Yokohama, Non-EU. http://hdl.handle.net/20.500.12708/57386
- A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways / Wu, H.-Y., Viola, I., & Nöllenburg, M. (2018). A Visual Comparison of Hand-Drawn and Machine-Generated Human Metabolic Pathways. In Proceedings of EuroVis 2018. Eurographics Conference on Visualization (EuroVis 2018), Brno, Czech Republic, EU. Eurographics / VGTC. http://hdl.handle.net/20.500.12708/57354
- Graph Visualization / Hu, Y., & Nöllenburg, M. (2018). Graph Visualization. In S. Sakr & A. Y. Zomaya (Eds.), Encyclopedia of Big Data Technologies (pp. 1–9). Springer International Publishing. https://doi.org/10.1007/978-3-319-63962-8_324-1
2017
- Kernelization using structural parameters on sparse graph classes / Gajarsky, J., Hlinený, P., Obdrzalek, J., Ordyniak, S., Reidl, F., Rossmanith, P., Villaamil Sanchez, F., & Sikdar, S. (2017). Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences, 84, 219–242. https://doi.org/10.1016/j.jcss.2016.09.002
- Euclidean Greedy Drawings of Trees / Nöllenburg, M., & Prutkin, R. (2017). Euclidean Greedy Drawings of Trees. Discrete and Computational Geometry, 58(3), 543–579. https://doi.org/10.1007/s00454-017-9913-8
- Using Layered Graphs to solve the Directed Network Design Problem with Relays / Riedler, M., Leitner, M., Ljubic, I., & Ruthmair, M. (2017). Using Layered Graphs to solve the Directed Network Design Problem with Relays. 21st Conference of the International Federation of Operational Research Societies, Quebec Canada, Non-EU. http://hdl.handle.net/20.500.12708/86686
- Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem / Kloimüllner, C., & Raidl, G. (2017). Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem. In Conference Proceedings of Learning and Intelligent Optimization Conference (pp. 1–16). http://hdl.handle.net/20.500.12708/57287
- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control / Kloimüllner, C., & Raidl, G. (2017). Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control. In Evolutionary Computation in Combinatorial Optimization (pp. 91–107). Evolutionary Computation in Combinatorial Optimization. http://hdl.handle.net/20.500.12708/57288
- Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition / Kloimüllner, C., & Raidl, G. (2017). Full-Load Route Planning for Balancing Bike Sharing Systems by Logic-Based Benders Decomposition. Networks, 69(3), 270–289. http://hdl.handle.net/20.500.12708/147719
- An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem / Maschler, J., Hackl, T., Riedler, M., & Raidl, G. (2017). An Enhanced Iterated Greedy Metaheuristic for the Particle Therapy Patient Scheduling Problem. In Proceedings of the 12th Metaheuristics International Conference (MIC 2017) (pp. 463–472). http://hdl.handle.net/20.500.12708/57298
- Parameterized complexity classes beyond para-NP / de Haan, R., & Szeider, S. (2017). Parameterized complexity classes beyond para-NP. Journal of Computer and System Sciences, 87, 16–57. https://doi.org/10.1016/j.jcss.2017.02.002
- Combining Treewidth and Backdoors for CSP / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Combining Treewidth and Backdoors for CSP. In H. Vollmer & B. Vallée (Eds.), 34th Symposium on Theoretical Aspects of Computer Science (pp. 429–445). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/LIPIcs.STACS.2017.36
- SAT-Based Local Improvement for Finding Tree Decompositions of Small Width / Fichte, J. K., Lodha, N., & Szeider, S. (2017). SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. In S. Gaspers & T. Walsh (Eds.), Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 401–411). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-66263-3_25
- Backdoors into heterogeneous classes of SAT and CSP / Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., & Živný, S. (2017). Backdoors into heterogeneous classes of SAT and CSP. Journal of Computer and System Sciences, 85, 38–56. https://doi.org/10.1016/j.jcss.2016.10.007
- First order limits of sparse graphs: Plane trees and path-width / Gajarsky, J., Hlinený, P., Kaiser, T., Král, D., Kupec, M., Obdrzalek, J., Ordyniak, S., & Vojtech, T. (2017). First order limits of sparse graphs: Plane trees and path-width. Random Structures and Algorithms, 50, 612–635. http://hdl.handle.net/20.500.12708/147742
- Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm / Pop, P., Cosmin, S., Biesinger, B., Hu, B., & Raidl, G. (2017). Solving the Two-State Fixed-Charge Transportation Problem with a Hybrid Genetic Algorithm. Carpathian Journal of Mathematics, 33(3), 365–371. http://hdl.handle.net/20.500.12708/147704
- The Treewidth of Proofs / Müller, M., & Szeider, S. (2017). The Treewidth of Proofs. Information and Computation, 255, 147–164. http://hdl.handle.net/20.500.12708/147673
- An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem / Riedler, M., Jatschka, T., Maschler, J., & Raidl, G. (2017). An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. International Transactions in Operational Research, 8. http://hdl.handle.net/20.500.12708/147676
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances / Haan, R. D., Kanj, I., & Szeider, S. (2017). On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Transactions on Computational Logic, 18(3), 1–46. https://doi.org/10.1145/3091528
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. ACM Transactions on Algorithms, 13(2), 1–32. https://doi.org/10.1145/3014587
- Solving Problems on Graphs of High Rank-Width / Eiben, E., Ganian, R., & Szeider, S. (2017). Solving Problems on Graphs of High Rank-Width. Algorithmica, 80(2), 742–771. https://doi.org/10.1007/s00453-017-0290-8
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / Nöllenburg, M., Prutkin, R., & Rutter, I. (2017). Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. International Journal of Computational Geometry and Applications, 27(01n02), 121–158. https://doi.org/10.1142/s0218195917600068
- Progress on Partial Edge Drawings / Bruckdorfer, T., Cornelsen, S., Gutwenger, C., Kaufmann, M., Montecchiani, F., Nöllenburg, M., & Wolff, A. (2017). Progress on Partial Edge Drawings. Journal of Graph Algorithms and Applications, 21(4), 757–786. https://doi.org/10.7155/jgaa.00438
- An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem / Raidl, G. (2017). An Iterative Time-Bucket Refinement Algorithm for a Resource-Constrained Project Scheduling Problem. TU Graz, Institute for Discrete Mathematics, TU Graz, Institute for Discrete Mathematics, Austria. http://hdl.handle.net/20.500.12708/86688
- Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling / Raidl, G. (2017). Mixed Integer Programming Approaches for Resource-Constrained Project Scheduling. University of Vienna, Department of Statistics and Operations Research, University of Vienna, Department of Statistics and Operations Research, Austria. http://hdl.handle.net/20.500.12708/86687
- Backdoors for Constraint Satisfaction / Szeider, S. (2017). Backdoors for Constraint Satisfaction. Workshop Gutin 60, Großbritanien, EU. http://hdl.handle.net/20.500.12708/86682
- Capturing Structure in Instances of the Propositional Satisfiability Problem / Szeider, S. (2017). Capturing Structure in Instances of the Propositional Satisfiability Problem. ÖMG-DMV-Congress 2017, Salzburg, Austria. http://hdl.handle.net/20.500.12708/86681
- Get Satisfaction: Das Erfüllbarkeitsproblem in Theorie und Praxis / Szeider, S. (2017). Get Satisfaction: Das Erfüllbarkeitsproblem in Theorie und Praxis. 9. Informatiktag 2017, Tu Wien, Austria. http://hdl.handle.net/20.500.12708/86680
- Minimizing crossings in constrained two-sided circular graph layouts / Klute, F., & Nöllenburg, M. (2017). Minimizing crossings in constrained two-sided circular graph layouts. EuroCG17, Schweden, EU. http://hdl.handle.net/20.500.12708/86553
- Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment / Horn, M., Raidl, G., & Blum, C. (2017). Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. In Lecture Notes in Computer Science (pp. 506–518). LNCS. https://doi.org/10.1007/978-3-319-72926-8_42
- Towards a Polynomial Kernel for Directed Feedback Vertex Set / Bergnougnoux, B., Eiben, E., Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Towards a Polynomial Kernel for Directed Feedback Vertex Set. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (pp. 1–15). Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science. http://hdl.handle.net/20.500.12708/57302
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem / Dusberger, F., & Raidl, G. (2017). A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem. In Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (pp. 385–391). Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies. http://hdl.handle.net/20.500.12708/57290
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2017). A SAT Approach to Branchwidth. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) (pp. 4894–4898). http://hdl.handle.net/20.500.12708/57272
- Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable / Ramanujan, M. S., & Szeider, S. (2017). Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. In Thirty-First AAAI Conference on Artificial Intelligence (pp. 3929–3935). http://hdl.handle.net/20.500.12708/57271
- New Width Parameters for Model Counting / Ganian, R., & Szeider, S. (2017). New Width Parameters for Model Counting. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 38–52). International Conference on Theory and Applications of Satisfiability Testing. https://doi.org/10.1007/978-3-319-66263-3_3
- SAT-Encodings for Special Treewidth and Pathwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2017). SAT-Encodings for Special Treewidth and Pathwidth. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 429–445). Springer International Publishing AG 2017. https://doi.org/10.1007/978-3-319-66263-3_27
- Radial contour labeling with straight leaders / Nöllenburg, M., Niedermann, B., & Rutter, I. (2017). Radial contour labeling with straight leaders. In 2017 IEEE Pacific Visualization Symposium (PacificVis). IEEE. https://doi.org/10.1109/pacificvis.2017.8031608
- Going Beyond Primal Treewidth for (M)ILP / Ganian, R., Ordyniak, S., & Ramanujan, M. S. (2017). Going Beyond Primal Treewidth for (M)ILP. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (pp. 815–821). http://hdl.handle.net/20.500.12708/57013
- Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments / Maschler, J., Riedler, M., & Raidl, G. (2017). Particle Therapy Patient Scheduling: Time Estimation to Schedule Sets of Treatments. In Computer Aided Systems Theory - EUROCAST 2017 (pp. 106–107). http://hdl.handle.net/20.500.12708/57296
- GRASP and VNS for a periodic VRP with time windows to deal with milk collection / Exposit, A., Raidl, G., Brito, J., & Moreno-Perez, J. (2017). GRASP and VNS for a periodic VRP with time windows to deal with milk collection. In Computer Aided Systems Theory - EUROCAST 2017 (pp. 90–91). http://hdl.handle.net/20.500.12708/57289
- Backdoor Treewidth for SAT / Ganian, R., Ramanujan, M. S., & Szeider, S. (2017). Backdoor Treewidth for SAT. In Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 20–37). Springer-Verlag. https://doi.org/10.1007/978-3-319-66263-3_2
- Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems / Raidl, G. (2017). Hybrid Metaheuristics for Optimization Problems in Public Bike Sharing Systems. http://hdl.handle.net/20.500.12708/39377
- Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd / Gadiraju, U., Möller, S., Nöllenburg, M., Saupe, D., Egger-Lampl, S., Archambault, D., & Fisher, B. (2017). Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowd. In D. Archambault, H. Purchase, & T. Hossfeld (Eds.), Evaluation in the Crowd. Crowdsourcing and Human-Centered Experiments (pp. 6–26). Springer International Publishing. https://doi.org/10.1007/978-3-319-66435-4_2
- The Constraint Satisfaction Problem: Complexity and Approximability / Szeider, S., Ordyniak, S., & Gaspers, S. (2017). The Constraint Satisfaction Problem: Complexity and Approximability. In The Constraint Satisfaction Problem: Complexity and Approximability (pp. 137–157). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http://hdl.handle.net/20.500.12708/29616
2016
- Supereulerian graphs with width s and s-collapsible graphs / Li, P., Li, H., Chen, Y., Fleischner, H., & Lai, H.-J. (2016). Supereulerian graphs with width s and s-collapsible graphs. Discrete Applied Mathematics, 200, 79–94. https://doi.org/10.1016/j.dam.2015.07.013
- Stable Matching with Uncertain Linear Preferences / Aziz, H., Biro, P., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2016). Stable Matching with Uncertain Linear Preferences. In Proceedings of the 9th International Symposium on Algorithmic Game Theory - SAGT 2016 (pp. 195–206). http://hdl.handle.net/20.500.12708/56827
- Backdoors to q-Horn / Gaspers, S., Ordyniak, S., Ramanujan, M. S., Saurabh, S., & Szeider, S. (2016). Backdoors to q-Horn. Algorithmica, 74(1), 540–557. https://doi.org/10.1007/s00453-014-9958-5
- New developments in metaheuristics and their applications / Lau, H. C., Raidl, G., & Van Hentenryck, P. (2016). New developments in metaheuristics and their applications. Journal of Heuristics, 22(4), 359–363. http://hdl.handle.net/20.500.12708/149930
- Large Neighborhood Search for the Most Strings with Few Bad Columns Problem / Lizárraga, E., Blesa, M. J., Blum, C., & Raidl, G. R. (2016). Large Neighborhood Search for the Most Strings with Few Bad Columns Problem. Journal of Heuristics, 21(17), 4901–4915. https://doi.org/10.1007/s00500-016-2379-4
- Tree-depth and vertex-minors / Hlinený, P., Kwon, O.-J., Obdrzalek, J., & Ordyniak, S. (2016). Tree-depth and vertex-minors. European Journal of Combinatorics, 56, 46–56. http://hdl.handle.net/20.500.12708/149904
- Directed elimination games / Engelmann, V., Ordyniak, S., & Kreutzer, S. (2016). Directed elimination games. Discrete Applied Mathematics, 199, 187–198. https://doi.org/10.1016/j.dam.2014.08.030
- Complexity and monotonicity results for domination games / Kreutzer, S., & Ordyniak, S. (2016). Complexity and monotonicity results for domination games. Theoretical Computer Science, 628, 1–29. https://doi.org/10.1016/j.tcs.2016.03.003
- A Parameterized Study of Maximum Generalized Pattern Matching Problems / Ordyniak, S., & Popa, A. (2016). A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica, 75(1), 1–26. https://doi.org/10.1007/s00453-015-0008-8
- Extending Convex Partial Drawings of Graphs / Mchedlidze, T., Nöllenburg, M., & Rutter, I. (2016). Extending Convex Partial Drawings of Graphs. Algorithmica, 76(1), 47–67. https://doi.org/10.1007/s00453-015-0018-6
- Consistent Labeling Of Rotating Maps / Gemsa, A., Nöllenburg, M., & Rutter, I. (2016). Consistent Labeling Of Rotating Maps. Journal of Computational Geometry, 7(1), 308–331. https://doi.org/10.20382/jocg.v7i1a15
- Meta-kernelization with structural parameters / Ganian, R., Slivovsky, F., & Szeider, S. (2016). Meta-kernelization with structural parameters. Journal of Computer and System Sciences, 82(2), 333–346. https://doi.org/10.1016/j.jcss.2015.08.003
- Soundness of Q-resolution with dependency schemes / Slivovsky, F., & Szeider, S. (2016). Soundness of Q-resolution with dependency schemes. Theoretical Computer Science, 612, 83–101. https://doi.org/10.1016/j.tcs.2015.10.020
- Quantified conjunctive queries on partially ordered sets / Bova, S., Ganian, R., & Szeider, S. (2016). Quantified conjunctive queries on partially ordered sets. Theoretical Computer Science, 618, 72–84. https://doi.org/10.1016/j.tcs.2016.01.010
- On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs / Nöllenburg, M., Prutkin, R., & Rutter, I. (2016). On Self-Approaching And Increasing-Chord Drawings Of 3-Connected Planar Graphs. Journal of Computational Geometry, 7(1), 47–69. http://hdl.handle.net/20.500.12708/148588
- Adjacency-Preserving Spatial Treemaps / Buchin, K., Eppstein, D., Löffler, M., Nöllenburg, M., & Silveira, R. I. (2016). Adjacency-Preserving Spatial Treemaps. Journal of Computational Geometry, 7(1), 100–122. https://doi.org/10.20382/jocg.v7i1a6
- Strict Confluent Drawing / Eppstein, D., Holten, D., Löffler, M., Nöllenburg, M., Speckmann, B., & Verbeek, K. (2016). Strict Confluent Drawing. Journal of Computational Geometry, 7(1), 22–46. http://hdl.handle.net/20.500.12708/148586
-
Models and algorithms for competitive facility location problems with different customer behavior.
/
Biesinger, B., Hu, B., & Raidl, G. (2016). Models and algorithms for competitive facility location problems with different customer behavior. Annals of Mathematics and Artificial Intelligence, 76(1–2), 93–119. https://doi.org/10.1007/s10472-014-9448-0
Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016) - Robust Genealogy Drawings / Klute, F. (2016). Robust Genealogy Drawings. In Lecture Notes in Computer Science. International Symposium on Graph Drawing and Network Visualization (GD), Athen, Griechenland, EU. LNCS. http://hdl.handle.net/20.500.12708/55449
- Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / Klocker, B., Fleischner, H., & Raidl, G. (2016). Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. In M. J. Blesa, C. Blum, A. Cangelosi, V. Cutello, A. Di Nuovo, M. Pavone, & E.-G. Talbi (Eds.), Hybrid Metaheuristics - 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings (pp. 1–16). LNCS. https://doi.org/10.1007/978-3-319-39636-1_1
- Evaluation of Labeling Strategies for Rotating Maps / Gemsa, A., Nöllenburg, M., & Rutter, I. (2016). Evaluation of Labeling Strategies for Rotating Maps. ACM Journal on Experimental Algorithmics, 21, 1–21. https://doi.org/10.1145/2851493
- Mixed map labeling / Löffler, M., Nöllenburg, M., & Staals, F. (2016). Mixed map labeling. Journal of Spatial Information Science, 13. https://doi.org/10.5311/josis.2016.13.264
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R., Ramanujan, M. S., & Szeider, S. (2016). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. In R. Krauthgamer (Ed.), Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1670–1681). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974331.ch114
- Proceedings of EmoVis 2016, ACM IUI 2016 Workshop on Emotion and Visualization, Sonoma, CA, USA, March 10, 2016 / Kerren, A., Cernea, D., & Pohl, M. (Eds.). (2016). Proceedings of EmoVis 2016, ACM IUI 2016 Workshop on Emotion and Visualization, Sonoma, CA, USA, March 10, 2016 (Vol. 103). Linköping Electronic Conference Proceedings. https://doi.org/10.3384/ecp103
- Particle Therapy Patient Scheduling: First Heuristic Approaches / Maschler, J., Riedler, M., Stock, M., & Raidl, G. (2016). Particle Therapy Patient Scheduling: First Heuristic Approaches. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/86452
- Integrating Algebraic Dynamic Programming in Combinatorial Optimization / Bacher, C., & Raidl, G. (2016). Integrating Algebraic Dynamic Programming in Combinatorial Optimization. Austrian Workshop on Metaheuristics, Graz, Austria. http://hdl.handle.net/20.500.12708/86419
- Cyclic Giant Tour Decoding for the EVRPTW / Bacher, C., & Raidl, G. (2016). Cyclic Giant Tour Decoding for the EVRPTW. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/86418
- Algorithms for Vehicle Routing / Raidl, G. (2016). Algorithms for Vehicle Routing. Workshop on Advances and Improvements in Service Delivery to Regional Development: Cases of Transportation and Health, La Laguna, Spain, EU. http://hdl.handle.net/20.500.12708/86459
- Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers / Klocker, B., & Raidl, G. (2016). Heuristic Approaches for Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. Austrian Workshop on Metaheuristics, Graz, Austria. http://hdl.handle.net/20.500.12708/86436
- Capturing Structure in SAT and Related Problems / Szeider, S. (2016). Capturing Structure in SAT and Related Problems. Theoretical Foundations of SAT Solving Workshop, Toronto, Kanada, Non-EU. http://hdl.handle.net/20.500.12708/86384
- Capturing Structure in SAT and Related Problems / Szeider, S. (2016). Capturing Structure in SAT and Related Problems. International Workshop on Graph Structure and Satisfiability Testing, Bordeaux, France, EU. http://hdl.handle.net/20.500.12708/86383
- Hybrid Metaheuristics / Blum, C., & Raidl, G. (2016). Hybrid Metaheuristics. Springer. https://doi.org/10.1007/978-3-319-30883-8
- Temporal map labeling / Barth, L., Niedermann, B., Nöllenburg, M., & Strash, D. (2016). Temporal map labeling. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. Acm Dl, Austria. ACM. https://doi.org/10.1145/2996913.2996957
-
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees
/
Ganian, R., Kalany, M., Szeider, S., & Träff, J. L. (2016). Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE 30th International Parallel and Distributed Processing Symposium (IPDPS 2016), Chicago, Illinois, USA, Non-EU. IEEE Computer Society. https://doi.org/10.1109/ipdps.2016.13
Project: EPiGRAM (2013–2016) - Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics / Raidl, G., Jatschka, T., Riedler, M., & Maschler, J. (2016). Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics. In Proceedings of the Sixth International Workshop on Model-based Metaheuristics (pp. 104–107). http://hdl.handle.net/20.500.12708/56887
- SOBRA - Shielding Optimization for BRAchytherapy / Blin, G., Gasparoux, M., Ordyniak, S., & Popa, A. (2016). SOBRA - Shielding Optimization for BRAchytherapy. In Combinatorial Algorithms - 27th International Workshop (pp. 309–320). http://hdl.handle.net/20.500.12708/56880
- Edge-Editing to a Dense and a Sparse Graph Class / Kotrbcık, M., Kralovic, R., & Ordyniak, S. (2016). Edge-Editing to a Dense and a Sparse Graph Class. In Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium (pp. 562–575). http://hdl.handle.net/20.500.12708/56878
- Software Visualization via Hierarchic Micro/Macro Layouts / Nöllenburg, M., Rutter, I., & Schuhmacher, A. (2016). Software Visualization via Hierarchic Micro/Macro Layouts. In Information Visualization Theory and Applications Conf IVAPP 2016 (pp. 153–160). http://hdl.handle.net/20.500.12708/56855
- Particle Therapy Patient Scheduling: First Heuristic Approaches / Maschler, J., Riedler, M., Stock, M., & Raidl, G. (2016). Particle Therapy Patient Scheduling: First Heuristic Approaches. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (pp. 223–244). http://hdl.handle.net/20.500.12708/56854
- A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem / Maschler, J., & Raidl, G. (2016). A Logic-based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. In Operations Research Proceedings 2015 Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (pp. 85–102). http://hdl.handle.net/20.500.12708/56847
- A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design / Schauer, C., & Raidl, G. (2016). A Multi-Commodity FLow Based Model for Multi Layer Hierarchical Ring Network Design. In Proceedings of INOC 2015 - 7th International Network Optimization Conference (pp. 189–196). http://hdl.handle.net/20.500.12708/56834
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation / de Haan, R. (2016). Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation. In Proceedings of the 22nd European Conference on Artificial Intelligence - ECAI 2016 (pp. 1502–1510). IOS Press. http://hdl.handle.net/20.500.12708/56830
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation / de Haan, R. (2016). Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation. In Proceedings of the Sixth International Workshop on Computational Social Choice - COMSOC 2016 (p. 19). http://hdl.handle.net/20.500.12708/56829
- Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics / de Haan, R., & Szeider, S. (2016). Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. In Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning - KR 2016 (pp. 453–462). http://hdl.handle.net/20.500.12708/56825
- Succinctness of Languages for Judgment Aggregation / Endriss, U., Grandi, U., de Haan, R., & Lang, J. (2016). Succinctness of Languages for Judgment Aggregation. In Proceedings of the 2016 International Conference on Principles of Knowledge Representation and Reasoning - KR 2016 (pp. 176–186). AAAI Press. http://hdl.handle.net/20.500.12708/56820
- Knowledge Compilation Meets Communication Complexity / Bova, S. M., Capelli, F., Mengel, S., & Slivovsky, F. (2016). Knowledge Compilation Meets Communication Complexity. In Proceedings of the 25th International Joint Conference on Artificial Intelligence - IJCAI 2016 (pp. 1008–1014). http://hdl.handle.net/20.500.12708/56819
- A Parameterized Algorithm for Mixed-Cut / Rai, A., Ramanujan, M. S., & Saurabh, S. (2016). A Parameterized Algorithm for Mixed-Cut. In Proceedings of LATIN 2016: Theoretical Informatics - 12th Latin American Symposium (pp. 672–685). http://hdl.handle.net/20.500.12708/56818
- A New Perspective on FO Model Checking of Dense Graph Classes / Gajarsky, J., Hlinený, P., Obdrzalek, J., Lokshtanov, D., & Ramanujan, M. S. (2016). A New Perspective on FO Model Checking of Dense Graph Classes. In Proceedings of the 31st Annual Symposium on Logic in Computer Science (pp. 176–184). http://hdl.handle.net/20.500.12708/56803
- A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion / Eiben, E., Ganian, R., & Kwon, O.-J. (2016). A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56801
- A Faster Parameterized Algorithm for Group Feedback Edge Set / Ramanujan, M. S. (2016). A Faster Parameterized Algorithm for Group Feedback Edge Set. In Graph-Theoretic Concepts in Computer Science (pp. 269–281). http://hdl.handle.net/20.500.12708/56802
- Counting Linear Extensions Parameterizations by Treewidth / Eiben, E., Ganian, R., Kangas, K., & Ordyniak, S. (2016). Counting Linear Extensions Parameterizations by Treewidth. In Proceedings of the 24th Annual European Symposium on Algorithms (pp. 1–18). http://hdl.handle.net/20.500.12708/56800
- An Algorithmic Framework for Labeling Road Maps / Niedermann, B., & Nöllenburg, M. (2016). An Algorithmic Framework for Labeling Road Maps. In Geographic Information Science 9th International Conference (pp. 308–322). http://hdl.handle.net/20.500.12708/56797
- Lifting QBF Resolution Calculi to DQBF / Beyersdorff, O., Chew, L., Schmidt, R. A., & Suda, M. (2016). Lifting QBF Resolution Calculi to DQBF. In Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 490–499). Springer. https://doi.org/10.1007/978-3-319-40970-2_30
- On the Complexity Landscape of Connected f-Factor Problems* / Ganian, R., Narayanaswamy, N. S., Ordyniak, S., Rahul, C. S., & Ramanujan, M. S. (2016). On the Complexity Landscape of Connected f-Factor Problems*. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56689
- SDDs Are Exponentially More Succinct than OBDDs / Bova, S. M. (2016). SDDs Are Exponentially More Succinct than OBDDs. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 929–935). http://hdl.handle.net/20.500.12708/56688
- Using Decomposition-Parameters for QBF: Mind the Prefix! / Eiben, E., Ganian, R., & Ordyniak, S. (2016). Using Decomposition-Parameters for QBF: Mind the Prefix! In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 964–970). http://hdl.handle.net/20.500.12708/56686
- The Complexity Landscape of Decompositional Parameters for ILP / Ganian, R., & Ordyniak, S. (2016). The Complexity Landscape of Decompositional Parameters for ILP. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (pp. 710–716). http://hdl.handle.net/20.500.12708/56685
- A SAT Approach to Branchwidth / Lodha, N., Ordyniak, S., & Szeider, S. (2016). A SAT Approach to Branchwidth. In Proceedings of SAT 2016: Theory and Applications of Satisfiability Testing - SAT 2016 (pp. 179–195). http://hdl.handle.net/20.500.12708/56670
- On Existential MSO and its Relation to ETH / Ganian, R., de Haan, R., Kanj, I., & Szeider, S. (2016). On Existential MSO and its Relation to ETH. In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (pp. 1–14). http://hdl.handle.net/20.500.12708/56669
- Backdoors to Tractable Valued CSP / Ganian, R., Ramanujan, M. S., & Szeider, S. (2016). Backdoors to Tractable Valued CSP. In Principles and Practice of Constraint Programming (Proceedings of 22nd CP) (pp. 233–250). LNCS. http://hdl.handle.net/20.500.12708/56665
- Districting and Routing for Security Control / Prischink, M., Kloimüllner, C., Biesinger, B., & Raidl, G. R. (2016). Districting and Routing for Security Control. In Hybrid Metaheuristics (pp. 87–103). LNCS. https://doi.org/10.1007/978-3-319-39636-1_7
- An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands / Biesinger, B., Hu, B., & Raidl, G. (2016). An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands. In Electronic Notes in Discrete Mathematics (pp. 245–252). Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2016.03.033
-
Clique-Width and Directed Width Measures for Answer-Set Programming
/
Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 1105–1113). IOS Press. http://hdl.handle.net/20.500.12708/56679
Project: START (2014–2022) -
Backdoor Trees for Answer Set Programming
/
Fichte, J., & Szeider, S. (2016). Backdoor Trees for Answer Set Programming (DBAI-TR-2016-98). http://hdl.handle.net/20.500.12708/39079
Project: START (2014–2022) - Graph Drawing and Network Visualization 24th International Symposium / Hu, Y., & Nöllenburg, M. (Eds.). (2016). Graph Drawing and Network Visualization 24th International Symposium. Springer LNCS. http://hdl.handle.net/20.500.12708/24263
2015
- A Complete Parameterized Complexity Analysis of Bounded Planning / Bäckström, C., Jonsson, P., Ordyniak, S., & Szeider, S. (2015). A Complete Parameterized Complexity Analysis of Bounded Planning. Journal of Computer and System Sciences, 81(7), 1311–1332. https://doi.org/10.1016/j.jcss.2015.04.002
- Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure / Grujicic, I., Raidl, G., & Schöbel, A. (2015). Variable Neighborhood Search for Integrated Timetable Based Design of Railway Infrastructure. Electronic Notes in Discrete Mathematics, 47, 141–148. https://doi.org/10.1016/j.endm.2014.11.019
- On finding optimal polytrees / Gaspers, S., Koivisto, M., Liedloff, M., Ordyniak, S., & Szeider, S. (2015). On finding optimal polytrees. Theoretical Computer Science, 592, 49–58. https://doi.org/10.1016/j.tcs.2015.05.012
- Meta-kernelization using Well-structured Modulators / Eiben, E., Ganian, R., & Szeider, S. (2015). Meta-kernelization using Well-structured Modulators. In T. Husfeldt & I. Kanj (Eds.), 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) (pp. 114–126). LIPICs. https://doi.org/10.4230/LIPIcs.IPEC.2015.114
- On the Subexponential-Time Complexity of CSP / De Haan, R., Kanj, I., & Szeider, S. (2015). On the Subexponential-Time Complexity of CSP. Journal of Artificial Intelligence Research, 52, 203–234. https://doi.org/10.1613/jair.4540
- Model Checking Existential Logic on Partially Ordered Sets / Bova, S., Ganian, R., & Szeider, S. (2015). Model Checking Existential Logic on Partially Ordered Sets. ACM Transactions on Computational Logic, 17(2), 1–35. https://doi.org/10.1145/2814937
- Model Counting for CNF Formulas of Bounded Modular Treewidth / Paulusma, D., Slivovsky, F., & Szeider, S. (2015). Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica, 76(1), 168–194. https://doi.org/10.1007/s00453-015-0030-x
- Quantifier Reordering for QBF / Slivovsky, F., & Szeider, S. (2015). Quantifier Reordering for QBF. Journal of Automated Reasoning, 56(4), 459–477. https://doi.org/10.1007/s10817-015-9353-1
- Parameterized and subexponential-time complexity ofsatisfiability problems and applications / Kanj, I., & Szeider, S. (2015). Parameterized and subexponential-time complexity ofsatisfiability problems and applications. Theoretical Computer Science, 607, 282–295. https://doi.org/10.1016/j.tcs.2015.08.029
- FO Model Checking of Interval Graphs / Ganian, R., Hlineny, P., Kral, D., Obdrzalek, J., Schwartz, J., & Teska, J. (2015). FO Model Checking of Interval Graphs. Logical Methods in Computer Science, 11(4). https://doi.org/10.2168/lmcs-11(4:11)2015
-
Backdoors to Normality for Disjunctive Logic Programs
/
Fichte, J. K., & Szeider, S. (2015). Backdoors to Normality for Disjunctive Logic Programs. ACM Transactions on Computational Logic, 17(1), 1–23. https://doi.org/10.1145/2818646
Project: START (2014–2022) - Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem / Blum, C., & Raidl, G. R. (2015). Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Problem. Optimization Letters, 10(1), 189–205. https://doi.org/10.1007/s11590-015-0921-4
- Improving Vertex Cover as a Graph Parameter / Ganian, R. (2015). Improving Vertex Cover as a Graph Parameter. Discrete Mathematics & Theoretical Computer Science, 17/2, 77–100. http://hdl.handle.net/20.500.12708/151557
- A SAT Approach to Clique-Width / Heule, M. J. H., & Szeider, S. (2015). A SAT Approach to Clique-Width. ACM Transactions on Computational Logic, 16(3), 1–27. https://doi.org/10.1145/2736696
-
Backdoors to tractable answer-set programming
/
Fichte, J. K., & Szeider, S. (2015). Backdoors to tractable answer-set programming. Artificial Intelligence, 220, 64–103. https://doi.org/10.1016/j.artint.2014.12.001
Project: START (2014–2022) - Decomposition based hybrid metaheuristics / Raidl, G. R. (2015). Decomposition based hybrid metaheuristics. European Journal of Operational Research, 244(1), 66–76. https://doi.org/10.1016/j.ejor.2014.12.005
-
A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem
/
Biesinger, B., Hu, B., & Raidl, G. (2015). A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. Journal of Heuristics, 21(3), 391–431. https://doi.org/10.1007/s10732-015-9282-5
Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016) - Numerische Optimierung elektrifizierter Antriebsstränge / Krenek, T., Bacher, C., Raidl, G., & Lauer, T. (2015). Numerische Optimierung elektrifizierter Antriebsstränge. MTZ: Verbrennungsmotor Und Gasturbine, 76(3), 66–74. https://doi.org/10.1007/s35146-015-0007-y
- Numerical Optimization of Electro Hybrid Powertrains / Krenek, T., Bacher, C., Raidl, G., & Lauer, T. (2015). Numerical Optimization of Electro Hybrid Powertrains. MTZ Worldwide, 76(3), 46–52. https://doi.org/10.1007/s38311-015-0007-9
- A Dichotomy Result for Ramsey Quantifiers / de Haan, R., & Szymanik, J. (2015). A Dichotomy Result for Ramsey Quantifiers. In V. de Paiva, R. J. G. B. de Queiroz, L. Moss, D. Leivant, & A. Grisi de Oliveira (Eds.), Logic, Language, Information, and Computation (pp. 69–80). Springer. https://doi.org/10.1007/978-3-662-47709-0_6
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / Nöllenburg, M., Prutkin, R., & Rutter, I. (2015). Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions. In K. Elbassioni & K. Makino (Eds.), Algorithms and Computation (pp. 637–649). LNCS. https://doi.org/10.1007/978-3-662-48971-0_54
- On the Readability of Boundary Labeling / Barth, L., Gemsa, A., Niedermann, B., & Nöllenburg, M. (2015). On the Readability of Boundary Labeling. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (pp. 515–527). Springer. https://doi.org/10.1007/978-3-319-27261-0_42
- Recognizing Weighted Disk Contact Graphs / Klemz, B., Nöllenburg, M., & Prutkin, R. (2015). Recognizing Weighted Disk Contact Graphs. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (pp. 433–446). Springer. https://doi.org/10.1007/978-3-319-27261-0_36
- Dependency Schemes for Quantified Boolean Formulas / Slivovsky, F. (2015). Dependency Schemes for Quantified Boolean Formulas. International Workshop on Quantified Boolean Formulas, Helsinki, EU. http://hdl.handle.net/20.500.12708/86264
- A Survey on Parameterized Complexity and SAT / Szeider, S. (2015). A Survey on Parameterized Complexity and SAT. Dagstuhl Seminar, Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/86232
- Mixed Integer Programming Models for Hybrid Electric Vehicle Routing / Bacher, C., & Raidl, G. (2015). Mixed Integer Programming Models for Hybrid Electric Vehicle Routing. VeroLog 2015, Universität Wien, Austria. http://hdl.handle.net/20.500.12708/86135
- Generalized Basic Logic, Polynomial Space, and Disjunction Property / Bova, S. M. (2015). Generalized Basic Logic, Polynomial Space, and Disjunction Property. Workshop in Memoriam Franco Montagna, Siena, Italien, EU. http://hdl.handle.net/20.500.12708/86171
- A Strongly Exponential Separation of DNNFs from CNFs / Bova, S. M. (2015). A Strongly Exponential Separation of DNNFs from CNFs. Symposium on New Frontiers in Knowledge Compilation, Wien, Austria. http://hdl.handle.net/20.500.12708/86170
- Succinctness in Knowledge Representation / Bova, S. M. (2015). Succinctness in Knowledge Representation. Research Seminar Birkbeck University of London, London, England, EU. http://hdl.handle.net/20.500.12708/86169
- Parameterized Compilability of Clause Entailment / Bova, S. M. (2015). Parameterized Compilability of Clause Entailment. ANR Workshop 2015, Paris, France, EU. http://hdl.handle.net/20.500.12708/86168
- Well-Structured Modulators: FPT Algorithms and Kernels / Ganian, R. (2015). Well-Structured Modulators: FPT Algorithms and Kernels. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/86165
- Algorithmic Applications of Large Well-Structured Modulators / Ganian, R. (2015). Algorithmic Applications of Large Well-Structured Modulators. Algorithmic Model Theory Meeting 2015 - ALMOTH 2015, Bayreuth, Deutschland, EU. http://hdl.handle.net/20.500.12708/86163
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting / Ganian, R. (2015). Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. Contemporary Trends in Theoretical Computer Science 2015, Prag, Tschechien, EU. http://hdl.handle.net/20.500.12708/86164
- Variable-Deletion Backdoors to Planning / Ordyniak, S. (2015). Variable-Deletion Backdoors to Planning. Postdoc Presentation Days, Masaryk University Brno, EU. http://hdl.handle.net/20.500.12708/86162
- First-Order Queries on Finite Abelian Groups / Bova, S. M., & Barnaby, M. (2015). First-Order Queries on Finite Abelian Groups. In Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (p. 19). https://doi.org/10.4230/LIPIcs.CSL.2015.41
- Boosting an exact logic-based benders decomposition approach by variable neighborhood search. / Raidl, G., Baumhauer, T., & Hu, B. (2015). Boosting an exact logic-based benders decomposition approach by variable neighborhood search. In B. Jarboui, A. Sifaleras, & A. Rebai (Eds.), Electronic Notes in Discrete Mathematics (pp. 1–4). Elsevier Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2014.11.001
- Solving Problems on Graphs of High Rank-Width / Eiben, E., Ganian, R., & Szeider, S. (2015). Solving Problems on Graphs of High Rank-Width. In Proceedings of the 14th International Symposium on Algorithms and Data Structures (pp. 314–326). LNCS. http://hdl.handle.net/20.500.12708/56453
- Community Structure Inspired Algorithms for SAT and #SAT / Ganian, R., & Szeider, S. (2015). Community Structure Inspired Algorithms for SAT and #SAT. In Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing (pp. 223–238). LNCS / Springer. http://hdl.handle.net/20.500.12708/56452
- Algorithmic Applications of Tree-Cut Width / Ganian, R., Kim, E. J., & Szeider, S. (2015). Algorithmic Applications of Tree-Cut Width. In Proceedings of the 40th International Symposium Mathematical Foundations of Computer Science 2015 (pp. 348–361). http://hdl.handle.net/20.500.12708/56451
- On Compiling CNFs into Structured Deterministic DNNFs / Bova, S. M., Capelli, F., Mengel, S., & Slivovsky, F. (2015). On Compiling CNFs into Structured Deterministic DNNFs. In Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing (pp. 199–214). LNCS. http://hdl.handle.net/20.500.12708/56447
- Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem / Nöllenburg, M., Klawitter, J., & Ueckerdt, T. (2015). Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem. In E. Di Giacomo & A. Lubiw (Eds.), Graph Drawing and Network Visualization (GD’15) (pp. 231–244). Springer. http://hdl.handle.net/20.500.12708/56342
- Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem / Schauer, C., & Raidl, G. (2015). Analyzing Decoding Strategies in a Memetic Algorithm for the Multi-Layer Hierarchical Ring Network Design Problem. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 81–82). http://hdl.handle.net/20.500.12708/56328
- On Minimizing Crossings in Storyline Visualizations / Nöllenburg, M., Kostitsyna, I., Polishchuk, V., Schulz, A., & Strash, D. (2015). On Minimizing Crossings in Storyline Visualizations. In E. Di Giacomo & A. Lubiw (Eds.), Lecture Notes in Computer Science (pp. 192–198). Springer. https://doi.org/10.1007/978-3-319-27261-0_16
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization / Nöllenburg, M., Meyerhenke, H., & Schulz, C. (2015). Drawing Large Graphs by Multilevel Maxent-Stress Optimization. In Lecture Notes in Computer Science (pp. 30–43). Springer. https://doi.org/10.1007/978-3-319-27261-0_3
- On Compiling Structured CNFs to OBDDs / Bova, S. M., & Slivovsky, F. (2015). On Compiling Structured CNFs to OBDDs. In Proceedings of the 10th International Computer Science Symposium (pp. 80–94). LNCS. http://hdl.handle.net/20.500.12708/56230
- On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics / Lizarraga, E., Blesa, M. J., Blum, C., & Raidl, G. (2015). On Solving the Most Strings With Few Bad Columns Problem: An ILP Model and Heuristics. In D. Camacho (Ed.), Innovations in Intelligent Systems and Applications (INISTA), 2015 International Symposium on (pp. 1–8). http://hdl.handle.net/20.500.12708/56227
- A New Solution Representation for the Firefighter Problem / Hu, B., Windbichler, A., & Raidl, G. (2015). A New Solution Representation for the Firefighter Problem. In G. Ochoa & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2015 (pp. 25–35). http://hdl.handle.net/20.500.12708/56226
- Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm / Markvica, D., Schauer, C., & Raidl, G. (2015). Solving the Longest Common Subsequence Problem Using a Parallel Ant Colony Optimization Algorithm. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 113–114). http://hdl.handle.net/20.500.12708/56225
- Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem / Tus, A., Rendl, A., & Raidl, G. (2015). Metaheuristics for the Two-Dimensional Container-Pre-Marshalling-Problem. In C. Dhaenens, L. Jourdan, & M.-E. Marmion (Eds.), Learning and Intelligent Optimization (pp. 186–201). http://hdl.handle.net/20.500.12708/56224
- Parameterized Algorithms for Parity Games / Gajarsky, J., Lampis, M., Makino, K., Mitsou, V., & Ordyniak, S. (2015). Parameterized Algorithms for Parity Games. In G. F. Italiano, G. Pighizzini, & D. Sannella (Eds.), Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II} (pp. 336–347). http://hdl.handle.net/20.500.12708/56223
- A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems / Kloimüllner, C., Papazek, P., Raidl, G., & Hu, B. (2015). A Cluster-First Route-Second Approach for Balancing Bicycle Sharing Systems. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 125–126). http://hdl.handle.net/20.500.12708/56222
- A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size / Dusberger, F., & Raidl, G. (2015). A Value-Correction Construction Heuristic for the Two-Dimensional Cutting Stock Problem with Variable Sheet Size. In A. Quesada-Arencibia, J. C. Rodriguez, R. Moreno-Díaz, & R. Jr. Moreno-Díaz (Eds.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 109–110). http://hdl.handle.net/20.500.12708/56207
- Heuristic Approaches for the Probabilistic Traveling Salesman Problem / Biesinger, B., Weiler, C., Hu, B., & Raidl, G. (2015). Heuristic Approaches for the Probabilistic Traveling Salesman Problem. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 99–100). http://hdl.handle.net/20.500.12708/56204
- A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles / Bacher, C., & Raidl, G. (2015). A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicles. In A. Quesada-Arencibia (Ed.), Extended Abstracts of the 15th International Conference on Computer Aided Systems Theory (pp. 119–120). http://hdl.handle.net/20.500.12708/56203
- Parameterized Complexity Results for Agenda Safety in Judgment Aggregation / de Haan, R., Endriss, U., & Szeider, S. (2015). Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. In G. Weiss, P. Yolum, R. H. Bordini, & E. Elkind (Eds.), Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems - AAMAS 2015 (pp. 127–136). http://hdl.handle.net/20.500.12708/56187
- Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young / de Haan, R., & Endriss, U. (2015). Complexity of the Winner Determination Problem in Judgment Aggregation: Kemeny, Slater, Tideman, Young. In G. Weiss, P. Yolum, R. H. Bordini, & E. Elkind (Eds.), Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems - AAMAS 2015 (pp. 117–125). http://hdl.handle.net/20.500.12708/56185
-
Fixed-parameter Tractable Reductions to SAT for Planning
/
de Haan, R., Kronegger, M., & Pfandler, A. (2015). Fixed-parameter Tractable Reductions to SAT for Planning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2897–2903). AAAI Press. http://hdl.handle.net/20.500.12708/56184
Project: FAIR (2013–2018) - Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP / de Haan, R., & Szeider, S. (2015). Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. In G. F. Italiano, T. Margaria, J. Pokorný, J.-J. Quisquater, & R. Wattenhofer (Eds.), Lecture Notes in Computer Science. LNCS. https://doi.org/10.1007/978-3-662-46078-8
-
A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands
/
Biesinger, B., Hu, B., & Raidl, G. R. (2015). A Variable Neighborhood Search for the Generalized Vehicle Routing Problem with Stochastic Demands. In G. Ochoa & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization (pp. 48–60). Springer. https://doi.org/10.1007/978-3-319-16468-7_5
Project: Solution Archives in Evolutionary Combinatorial Optimization (2012–2016) - Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search / Dusberger, F., & Raidl, G. R. (2015). Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood Search. In B. Jarboui, A. Sifaleras, & A. Rebai (Eds.), Electronic Notes in Discrete Mathematics (pp. 133–140). Elsevier Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2014.11.018
- Numerical Optimisation Approach for a Large Gas Engine Considering Different Fuel Gas Qualities / Holly, W., Lauer, T., Pachler, R., Winter, F., Bacher, C., Schuemie, H. A., & Murakami, S. (2015). Numerical Optimisation Approach for a Large Gas Engine Considering Different Fuel Gas Qualities. In Proceedings (p. 16). http://hdl.handle.net/20.500.12708/49086
2014
- Exact Approaches to the Network Design Problem with Relays / Leitner, M., Ljubic, I., Riedler, M., & Ruthmair, M. (2014). Exact Approaches to the Network Design Problem with Relays. EULOG 2014, Wien, Austria. http://hdl.handle.net/20.500.12708/85934
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. / Rainer-Harbach, M., Papazek, P., Raidl, G. R., Hu, B., & Kloimüllner, C. (2014). PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems. Journal of Global Optimization, 63(3), 597–629. https://doi.org/10.1007/s10898-014-0147-5
- A Memetic Algorithm for the Virtual Network Mapping Problem. / Inführ, J., & Raidl, G. (2014). A Memetic Algorithm for the Virtual Network Mapping Problem. Journal of Heuristics, 22(4), 475–505. https://doi.org/10.1007/s10732-014-9274-x
- Variable Neighborhood Search Hybrids / Raidl, G. (2014). Variable Neighborhood Search Hybrids. VNS 2014 - 3rd Int. Conference on Variable Neighborhood Search, Djerba, Tunesien, Non-EU. http://hdl.handle.net/20.500.12708/85983
- Balancing Bicycle Sharing Systems / Kloimüllner, C., Papazek, P., Hu, B., & Raidl, G. (2014). Balancing Bicycle Sharing Systems. EULOG 2014, Wien, Austria. http://hdl.handle.net/20.500.12708/85933
- A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure / Grujicic, I., Raidl, G., Schöbel, A., & Besau, G. (2014). A Metaheuristic Approach for Integrated Timetable based Design of Railway Infrastructure. In S. Lakusic (Ed.), Road and Rail Infrastructure III, Proceedings of the Conference CETRA 2014 (pp. 691–696). Department of Transportation, University of Zagreb. http://hdl.handle.net/20.500.12708/61314
- An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior / Biesinger, B., Hu, B., & Raidl, G. (2014). An Evolutionary Algorithm for the Leader-Follower Facility Location Problem with Proportional Customer Behavior. In P. M. Pardalos, M. G. Resende, C. Vogiatzis, & J. L. Walteros (Eds.), Lecture Notes in Computer Science (pp. 203–217). https://doi.org/10.1007/978-3-319-09584-4_19
- A metaheuristic approach for integrated timetable based design of railway infrastructure / Grujicic, I., Raidl, G., Schöbel, A., & Besau, G. (2014). A metaheuristic approach for integrated timetable based design of railway infrastructure. In S. Lakusic (Ed.), Proceedings of the 3rd International Conference on Road and Rail Infrastructure CETRA 2014 (pp. 691–696). http://hdl.handle.net/20.500.12708/55215
- A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. / Dusberger, F., & Raidl, G. (2014). A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock Problem. In M. J. Blesa, C. Blum, & S. Voß (Eds.), Hybrid Metaheuristics (pp. 183–197). LNCS / Springer. https://doi.org/10.1007/978-3-319-07644-7_14
-
Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case.
/
Kloimüllner, C., Papazek, P., Hu, B., & Raidl, G. (2014). Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case. In C. Blum & G. Ochoa (Eds.), Lecture Notes in Computer Science. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-44320-0
Project: BBSS (2011–2016) -
Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid.
/
Papazek, P., Kloimüllner, C., Hu, B., & Raidl, G. (2014). Balancing bicycle sharing systems: An analysis of path relinking and recombination within a GRASP hybrid. In T. Bartz - Beielstein, J. Branke, B. Filipic, & J. Smith (Eds.), Lecture Notes in Computer Science. Lecture Notes in Computer Science, Springer International Publishing. https://doi.org/10.1007/978-3-319-10762-2
Project: BBSS (2011–2016) - Speeding Up Logic-Based Benders’ Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem / Raidl, G. R., Baumhauer, T., & Hu, B. (2014). Speeding Up Logic-Based Benders’ Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem. In M. J. Blesa, C. Blum, & S. Voß (Eds.), Hybrid Metaheuristics (pp. 183–197). https://doi.org/10.1007/978-3-319-07644-7_14
- An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods / Biffl, S., Mordinyi, R., Raidl, G., Steininger, H., & Winkler, D. (2014). An SME Transition from Plan-Driven to Hybrid Project Management with Agile Software Development Methods. In Proceedings of the 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track. 21th EuroSPI Conference on Systems Software and Service Process Improvement, Industrial Track, Luxembourg, Luxemburg, EU. Delta. http://hdl.handle.net/20.500.12708/55762
- Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles / Bacher, C., Krenek, T., & Raidl, G. R. (2014). Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicles. In A. I. Esparcia-Alcázar & A. M. Mora (Eds.), Applications of Evolutionary Computation (pp. 553–564). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-45523-4_45
- An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network / Mišković, S., Stanimirović, Z., & Grujičić, I. (2014). An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network. In B. Jarboui, A. Sifaleras, & A. Rebai (Eds.), Electronic Notes in Discrete Mathematics (pp. 261–268). https://doi.org/10.1016/j.endm.2014.11.034
2013
- Metaheuristics for solving a multimodal home-healthcare scheduling problem / Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., & Raidl, G. R. (2013). Metaheuristics for solving a multimodal home-healthcare scheduling problem. Central European Journal of Operations Research, 23(1), 89–113. https://doi.org/10.1007/s10100-013-0305-8
- Stabilizing branch-and-price for constrained tree problems / Leitner, M., Ruthmair, M., & Raidl, G. (2013). Stabilizing branch-and-price for constrained tree problems. Networks, 61(2), 150–170. http://hdl.handle.net/20.500.12708/155748
- Optimization Approaches for Balancing Bicycle Sharing Systems / Raidl, G. (2013). Optimization Approaches for Balancing Bicycle Sharing Systems. Department of Business Administration, Production and Operations Management Group, University of Vienna, Wien, Austria. http://hdl.handle.net/20.500.12708/85752
- Metaheuristics and Hybrid Optimization Approaches - A Unifying View / Raidl, G. (2013). Metaheuristics and Hybrid Optimization Approaches - A Unifying View. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/85750
- Metaheuristics for the Static Balancing of Bicycle Sharing Systems / Raidl, G. (2013). Metaheuristics for the Static Balancing of Bicycle Sharing Systems. European Conference on Operational Research, Vilnius, Litauen, EU. http://hdl.handle.net/20.500.12708/85751
- An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure / Schöbel, A., Raidl, G., Grujicic, I., Besau, G., & Schuster, G. (2013). An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure. In Proceedings (p. 10). http://hdl.handle.net/20.500.12708/61049
- Using optimized virtual network embedding for network dimensioning / Inführ, J., Stezenbach, D., Hartmann, M., Tutschku, K., & Raidl, G. (2013). Using optimized virtual network embedding for network dimensioning. In Proceedings of Networked Systems 2013 (pp. 118–125). IEEE Computer Society. http://hdl.handle.net/20.500.12708/54824
- Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent / Inführ, J., & Raidl, G. (2013). Solving the virtual network mapping problem with construction heuristics, local search and variable neighborhood descent. In Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013 (pp. 250–261). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/54822
- A memetic algorithm for the virtual network mapping problem / Inführ, J., & Raidl, G. (2013). A memetic algorithm for the virtual network mapping problem. In Proceedings of the 10th Metaheuristics International Conference (p. 10). http://hdl.handle.net/20.500.12708/54820
- GRASP and variable neighborhood search for the virtual network mapping problem / Inführ, J., & Raidl, G. (2013). GRASP and variable neighborhood search for the virtual network mapping problem. In Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (pp. 159–173). Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/54819
- A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem / Pop, P., Hu, B., & Raidl, G. (2013). A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 219–226). Springer. http://hdl.handle.net/20.500.12708/55036
- A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems / Papazek, P., Raidl, G., Rainer-Harbach, M., & Hu, B. (2013). A PILOT/VND/GRASP Hybrid for the Static Balancing of Public Bicycle Sharing Systems. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 372–379). Springer. http://hdl.handle.net/20.500.12708/55035
- Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents / Biesinger, B., Schauer, C., Hu, B., & Raidl, G. (2013). Enhancing a Genetic Algorithm with a Solution Archive to Reconstruct Cross Cut Shredded Text Documents. In Computer Aided Systems Theory - EUROCAST 2013 - Part 1 (pp. 380–387). Springer. http://hdl.handle.net/20.500.12708/55033
- Clique and independent set based grasp approaches for the regenerator location problem / Jahrmann, P., & Raidl, G. (2013). Clique and independent set based grasp approaches for the regenerator location problem. In Proceedings of the 10th Metaheuristics International Conference (pp. 1–10). http://hdl.handle.net/20.500.12708/55032
- A memetic algorithm for the partition graph coloring problem / Pop, P., Hu, B., & Raidl, G. (2013). A memetic algorithm for the partition graph coloring problem. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 167–169). http://hdl.handle.net/20.500.12708/55030
- A pilot/vnd/grasp hybrid for balancing bicycle sharing systems / Papazek, P., Raidl, G., Rainer-Harbach, M., & Hu, B. (2013). A pilot/vnd/grasp hybrid for balancing bicycle sharing systems. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 223–225). http://hdl.handle.net/20.500.12708/55029
- A mixed integer model for the stamina-aware sightseeing tour problem / Hu, B., Ölz, W., & Raidl, G. (2013). A mixed integer model for the stamina-aware sightseeing tour problem. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 200–202). http://hdl.handle.net/20.500.12708/55028
- Reconstructing cross cut shredded documents with a genetic algorithm with solution archive / Biesinger, B., Schauer, C., Hu, B., & Raidl, G. (2013). Reconstructing cross cut shredded documents with a genetic algorithm with solution archive. In Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory (pp. 226–228). http://hdl.handle.net/20.500.12708/55027
- Balancing bicycle sharing systems: A variable neighborhood search approach / Rainer-Harbach, M., Papazek, P., Hu, B., & Raidl, G. (2013). Balancing bicycle sharing systems: A variable neighborhood search approach. In Evolutionary Computation in Combinatorial Optimisation - 13th European Conference, EvoCOP 2013 (pp. 121–132). http://hdl.handle.net/20.500.12708/55026
- Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations / Raidl, G., Hu, B., Rainer-Harbach, M., & Papazek, P. (2013). Balancing bicycle sharing systems: Improving a VNS by efficiently determining optimal loading operations. In Hybrid Metaheuristics, 8th Int. Workshop, HM 2013 (pp. 130–143). http://hdl.handle.net/20.500.12708/55025
- Robust variable selection in linear regression with compositional explanatory variables / Schroeder, F., Braumann, A., Filzmoser, P., & Hron, K. (2013). Robust variable selection in linear regression with compositional explanatory variables. In K. Hron, P. Filzmoser, & M. Templ (Eds.), Proceedings of the 5th International Workshop on Compositional Data Analysis CoDaWork 2013 June 3-7, 2013, Vorau, Austria (p. 55). http://hdl.handle.net/20.500.12708/41259
- Proceedings of the 10th Metaheuristics International Conference / Lau, H. C., Raidl, G., & Van Hentenryck, P. (Eds.). (2013). Proceedings of the 10th Metaheuristics International Conference. Singapore Management University. http://hdl.handle.net/20.500.12708/23726
- A timeslot-filling based heuristic approach to construct high-school timetables / Pimmer, M., & Raidl, G. (2013). A timeslot-filling based heuristic approach to construct high-school timetables. In Advances in Metaheuristics (pp. 143–158). Springer. http://hdl.handle.net/20.500.12708/28150
2012
- A hybrid heuristic for multimodal homecare scheduling / Rendl, A., Prandtstetter, M., Hiermann, G., Puchinger, J., & Raidl, G. (2012). A hybrid heuristic for multimodal homecare scheduling. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (pp. 339–355). http://hdl.handle.net/20.500.12708/54406
- Solving the post enrolment course timetabling problem by ant colony optimization / Nothegger, C., Mayer, A., Chwatal, A., & Raidl, G. R. (2012). Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research, 194(1), 325–339. https://doi.org/10.1007/s10479-012-1078-5
- Robust variable selection for linear regression models with compositional data / Schroeder, F., Braumann, A., & Filzmoser, P. (2012). Robust variable selection for linear regression models with compositional data. Statistische Woche 2012, TU Wien, Austria. http://hdl.handle.net/20.500.12708/120300
- An Adaptive Layers Framework for Resource-Constrained Network Design Problems / Ruthmair, M., & Raidl, G. (2012). An Adaptive Layers Framework for Resource-Constrained Network Design Problems. INFORMS Telecommunications Conference, Boca Raton, Florida, USA, Non-EU. http://hdl.handle.net/20.500.12708/85473
- An Adaptive Layers Framework for Vehicle Routing Problems / Ruthmair, M., & Raidl, G. (2012). An Adaptive Layers Framework for Vehicle Routing Problems. International Symposium on Mathematical Programming, Berlin, Deutschland, EU. http://hdl.handle.net/20.500.12708/85466
- Hybrid Metaheuristics and Matheuristics / Raidl, G. (2012). Hybrid Metaheuristics and Matheuristics. International Conference on Metaheuristics and Nature Inspired Computing, Port El-Kantaoiui, Tunisia, Non-EU. http://hdl.handle.net/20.500.12708/85481
- Balancing Bicycle Sharing Systems by Variable Neighborhood Search / Raidl, G., Causevic, E., Hu, B., & Rainer-Harbach, M. (2012). Balancing Bicycle Sharing Systems by Variable Neighborhood Search. EUROmC XXVIII VNS, Herceg Novi, Montenegro, Non-EU. http://hdl.handle.net/20.500.12708/85480
- Balancing Bicycle Sharing Systems by Variable Neighborhood Search / Rainer-Harbach, M., & Papazek, P. (2012). Balancing Bicycle Sharing Systems by Variable Neighborhood Search. Austrian Workshop on Metaheuristics, Graz, Austria. http://hdl.handle.net/20.500.12708/85464
- On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem / Ruthmair, M., & Raidl, G. (2012). On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. In Proceedings of the 2nd International Symposium on Combinatorial Optimization (pp. 225–236). http://hdl.handle.net/20.500.12708/54404
- Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design / Schauer, C., & Raidl, G. (2012). Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. In Parallel Problem Solving from Nature-PPSN XII (pp. 458–467). http://hdl.handle.net/20.500.12708/54405
- Improved packing and routing of vehicles with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2012). Improved packing and routing of vehicles with compartments. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 392–399). http://hdl.handle.net/20.500.12708/54400
- A variable neighborhood search approach for the two-echelon location-routing problem / Schwengerer, M., Pirkwieser, S., & Raidl, G. (2012). A variable neighborhood search approach for the two-echelon location-routing problem. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2012 (pp. 13–24). http://hdl.handle.net/20.500.12708/54401
- Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles / Krenek, T., Ruthmair, M., Raidl, G., & Planer, M. (2012). Applying (hybrid) metaheuristics to fuel consumption optimization of hybrid electric vehicles. In Applications of Evolutionary Computation - EvoApplications 2012 (pp. 376–385). http://hdl.handle.net/20.500.12708/54398
- Automatic generation of 2-antwars players with genetic programming / Inführ, J., & Raidl, G. (2012). Automatic generation of 2-antwars players with genetic programming. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 248–255). http://hdl.handle.net/20.500.12708/54385
- An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2012). An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. In Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference - GECCO ’12. GECCO: Genetic and Evolutionary Computation Conference, Seattle, Non-EU. https://doi.org/10.1145/2330163.2330220
- An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2012). An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 287–294). http://hdl.handle.net/20.500.12708/54377
- A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Berlakovich, M., Ruthmair, M., & Raidl, G. (2012). A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 256–263). http://hdl.handle.net/20.500.12708/54296
2011
- Solving the minimum label spanning tree problem by mathematical programming techniques / Chwatal, A. M., & Raidl, G. R. (2011). Solving the minimum label spanning tree problem by mathematical programming techniques. Advances in Operations Research, 2011, 1–38. https://doi.org/10.1155/2011/143732
- A branch-and-cut-and-price algorithm for a fingerprint-template compression application / Chwatal, A., Thöni, C., Oberlechner, K., & Raidl, G. (2011). A branch-and-cut-and-price algorithm for a fingerprint-template compression application. In Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (pp. 239–246). http://hdl.handle.net/20.500.12708/53804
- Branch-and-cut-and-price for capacitated connected facility location / Leitner, M., & Raidl, G. R. (2011). Branch-and-cut-and-price for capacitated connected facility location. Journal of Mathematical Modelling and Algorithms, 10(3), 245–267. https://doi.org/10.1007/s10852-011-9153-5
- Hybrid metaheuristics in combinatorial optimization: A survey / Blum, C., Puchinger, J., Raidl, G. R., & Roli, A. (2011). Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing, 11(6), 4135–4151. https://doi.org/10.1016/j.asoc.2011.02.032
- Tackling the loading aspect of the vehicle routing problem with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2011). Tackling the loading aspect of the vehicle routing problem with compartments. In Proceedings of the 9th Metaheuristics International Conference (pp. 679–681). http://hdl.handle.net/20.500.12708/53845
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems / Ruthmair, M., & Raidl, G. (2011). A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. In Fifteenth Conference on Integer Programming and Combinatorial Optimization (IPCO XV) (pp. 376–388). http://hdl.handle.net/20.500.12708/53813
- A timeslot-filling based heuristic approach to construct high-school timetables / Pimmer, M., & Raidl, G. (2011). A timeslot-filling based heuristic approach to construct high-school timetables. In Proceedings of the 9th Metaheuristics International Conference (pp. 349–358). http://hdl.handle.net/20.500.12708/53810
- Stabilized column generation for the rooted delay-constrained Steiner tree problem / Leitner, M., Ruthmair, M., & Raidl, G. (2011). Stabilized column generation for the rooted delay-constrained Steiner tree problem. In Proceedings of the VII ALIO/EURO - Workshop on Applied Combinatorial Optimization (pp. 250–253). http://hdl.handle.net/20.500.12708/53807
- Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem / Leitner, M., Ruthmair, M., & Raidl, G. (2011). Stabilized branch-and-price for the rooted delay-constrained Steiner tree problem. In Network Optimization: 5th International Conference, INOC 2011 (pp. 124–138). http://hdl.handle.net/20.500.12708/53806
- A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., & Raidl, G. (2011). A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 351–358). http://hdl.handle.net/20.500.12708/53781
- Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., Hubmer, A., & Raidl, G. (2011). Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 285–287). http://hdl.handle.net/20.500.12708/53779
- Variable neighborhood search for capacitated connected facility location / Leitner, M., & Raidl, G. (2011). Variable neighborhood search for capacitated connected facility location. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 261–263). http://hdl.handle.net/20.500.12708/53778
- Improved packing and routing of vehicles with compartments / Pirkwieser, S., Raidl, G., & Gottlieb, J. (2011). Improved packing and routing of vehicles with compartments. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 302–304). Universidad de Las Palmas de Gran Canaria. http://hdl.handle.net/20.500.12708/53777
- Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location / Leitner, M., & Raidl, G. (2011). Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location. In Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (pp. 295–302). http://hdl.handle.net/20.500.12708/53776
- Introducing the virtual network mapping problem with delay, routing and location constraints / Inführ, J., & Raidl, G. (2011). Introducing the virtual network mapping problem with delay, routing and location constraints. In Network Optimization: 5th International Conference (pp. 105–117). http://hdl.handle.net/20.500.12708/53774
- Automatic generation of 2-AntWars players with Genetic Programming / Inführ, J., & Raidl, G. (2011). Automatic generation of 2-AntWars players with Genetic Programming. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 244–246). http://hdl.handle.net/20.500.12708/53773
- An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem / Hu, B., & Raidl, G. (2011). An evolutionary algorithm with solution archive for the generalized minimum spanning tree problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 256–258). http://hdl.handle.net/20.500.12708/53772
- A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Berlakovich, M., Ruthmair, M., & Raidl, G. (2011). A Multilevel Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Extended Abstracts of EUROCAST 2011 - 13th International Conference on Computer Aided Systems Theory (pp. 247–249). http://hdl.handle.net/20.500.12708/53768
2010
- A memetic algorithm for reconstructing cross-cut shredded text documents / Schauer, C., Prandtstetter, M., & Raidl, G. (2010). A memetic algorithm for reconstructing cross-cut shredded text documents. In Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010 (pp. 103–117). http://hdl.handle.net/20.500.12708/53290
- Fitting multi-planet transit models to photometric time-data series by evolution strategies / Chwatal, A., Raidl, G., & Zöch, M. (2010). Fitting multi-planet transit models to photometric time-data series by evolution strategies. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (p. 7). http://hdl.handle.net/20.500.12708/53275
- Solving the minimum label spanning tree problem by ant colony optimization / Chwatal, A., & Raidl, G. (2010). Solving the minimum label spanning tree problem by ant colony optimization. In Proceedings of the 2010 International Conference on Genetic and Evolutionary Methods (pp. 91–97). http://hdl.handle.net/20.500.12708/53276
- The multidimensional knapsack problem: Structure and algorithms / Puchinger, J., Raidl, G., & Pferschy, U. (2010). The multidimensional knapsack problem: Structure and algorithms. INFORMS Journal on Computing, 22(2), 250–265. http://hdl.handle.net/20.500.12708/167303
- The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search / Hu, B., Leitner, M., & Raidl, G. (2010). The generalized minimum edge biconnected network problem: Efficient neighborhood structures for variable neighborhood search. Networks, 55(3), 257–275. http://hdl.handle.net/20.500.12708/167297
- Trend-based similarity search in time-series data / Suntinger, M., Obweger, H., Schiefer, J., Limbeck, P., & Raidl, G. (2010). Trend-based similarity search in time-series data. In Proceedings of the Second International Conference on Advances in Database, Knowledge, and Data Applications - DBKDA 2010 (pp. 97–106). http://hdl.handle.net/20.500.12708/53291
- Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem / Ruthmair, M., & Raidl, G. (2010). Variable neighborhood search and ant colony optimization for the rooted delay-constrained minimum spanning tree problem. In Parallel Problem Solving from Nature - PPSN XI (pp. 391–400). http://hdl.handle.net/20.500.12708/53289
- Enhancing genetic algorithms by a trie-based complete solution archive / Raidl, G., & Hu, B. (2010). Enhancing genetic algorithms by a trie-based complete solution archive. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010 (pp. 239–251). http://hdl.handle.net/20.500.12708/53288
- Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem / Pirkwieser, S., & Raidl, G. (2010). Variable neighborhood search coupled with ILP-based large neighborhood searches for the (periodic) location-routing problem. In Proceedings of Hybrid Metaheuristics - Seventh International Workshop, HM 2010 (pp. 174–189). http://hdl.handle.net/20.500.12708/53285
- Matheuristics for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2010). Matheuristics for the periodic vehicle routing problem with time windows. In Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, (pp. 83–95). http://hdl.handle.net/20.500.12708/53283
- Multilevel variable neighborhood search for periodic routing problems / Pirkwieser, S., & Raidl, G. (2010). Multilevel variable neighborhood search for periodic routing problems. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2010 (pp. 226–238). http://hdl.handle.net/20.500.12708/53284
- A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem / Pagacz, A., Hu, B., & Raidl, G. (2010). A memetic algorithm with population management for the generalized minimum vertex-biconnected network problem. In 2nd International Conference on Intelligent Networking and Collaborative Systems, Workshop on Information Network Design (pp. 356–361). http://hdl.handle.net/20.500.12708/53282
- Similarity searching in sequences of complex events / Obweger, H., Suntinger, M., Schiefer, J., & Raidl, G. (2010). Similarity searching in sequences of complex events. In Proceedings of the Fourth International Conference on Research Challenges in Information Science - RCIS 2010 (pp. 631–639). http://hdl.handle.net/20.500.12708/53281
- Strong lower bounds for a survivable network design problem / Leitner, M., & Raidl, G. (2010). Strong lower bounds for a survivable network design problem. In ISCO 2010 - International Symposium on Combinatorial Optimization (pp. 295–302). http://hdl.handle.net/20.500.12708/53278
- A brief survey on hybrid metaheuristics / Blum, C., Puchinger, J., Raidl, G., & Roli, A. (2010). A brief survey on hybrid metaheuristics. In Proceedings of BIOMA 2010 - 4th International Conference on Bioinspired Optimization Methods and their Applications (pp. 3–16). Jozef Stefan Institute. http://hdl.handle.net/20.500.12708/53274
- Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 / Blesa, M. J., Blum, C., Raidl, G., Roli, A., & Sampels, M. (Eds.). (2010). Hybrid Metaheuristics, 7th Int. Workshop, HM 2010. Springer. http://hdl.handle.net/20.500.12708/23160
- Hybrid metaheuristics / Blum, C., Puchinger, J., Raidl, G., & Roli, A. (2010). Hybrid metaheuristics. In Hybrid Optimization -The Ten Years of CPAIOR (pp. 305–336). Springer. http://hdl.handle.net/20.500.12708/26905
2009
- A hybrid algorithm for computing tours in a spare parts warehouse / Prandtstetter, M., Raidl, G., & Misar, T. (2009). A hybrid algorithm for computing tours in a spare parts warehouse. In Evolutionary Computation in Combinatorial Optimization - EvoCOP 2009 (pp. 25–36). Springer. http://hdl.handle.net/20.500.12708/52690
- Meta-heuristics for reconstructing cross cut shredded text documents / Prandtstetter, M., & Raidl, G. (2009). Meta-heuristics for reconstructing cross cut shredded text documents. In Proceedings of the 11th annual conference on Genetic and evolutionary computation (p. 8). http://hdl.handle.net/20.500.12708/52832
- Computing optimized stock (re-)placements in last-in, first-out warehouses / Ritzinger, U., Prandtstetter, M., & Raidl, G. (2009). Computing optimized stock (re-)placements in last-in, first-out warehouses. In Logistik Management (pp. 279–298). http://hdl.handle.net/20.500.12708/52995
- Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. / Chwatal, A. M., Raidl, G. R., & Oberlechner, K. (2009). Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates. Journal of Mathematical Modelling and Algorithms, 8(3), 293–334. https://doi.org/10.1007/s10852-009-9109-1
- Solving a multi-constrained network design problem by lagrangean decomposition and column generation / Chwatal, A., Musil, N., & Raidl, G. (2009). Solving a multi-constrained network design problem by lagrangean decomposition and column generation. In Proceedings of the International Network Optimization Conference 2009 (p. 7). http://hdl.handle.net/20.500.12708/52712
- Fitting rectangular signals to time series data by metaheuristic algorithms / Chwatal, A., & Raidl, G. (2009). Fitting rectangular signals to time series data by metaheuristic algorithms. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 222–225). http://hdl.handle.net/20.500.12708/52685
- Fitting multi-planet transit models to corot time-data series by evolutionary algorithms / Chwatal, A., Wuchterl, G., & Raidl, G. (2009). Fitting multi-planet transit models to corot time-data series by evolutionary algorithms. COROT, Paris, EU. http://hdl.handle.net/20.500.12708/84870
- Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik / Raidl, G. (2009). Innovative Lösungen für Routenplanung, Packungsprobleme und Lagerlogistik. Aktuelles Know-How der TU Wien für Logistik und Distribution, Ausseninstitut-Technologietransfer, Wien, Austria. http://hdl.handle.net/20.500.12708/84922
- Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme / Raidl, G. (2009). Kombinationen von Metaheuristiken und Methoden der mathematischen Programmierung zur Lösung schwieriger Netzwerkdesign-Probleme. Upper Austrian University of Applied Sciences, Department of Software Engineering, Hagenberg, Austria. http://hdl.handle.net/20.500.12708/84921
- Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2009). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znaim, Tschechien, EU. http://hdl.handle.net/20.500.12708/84892
- Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2009). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. University of Nottingham, School of Computer Science, Nottingham, United Kingdom, EU. http://hdl.handle.net/20.500.12708/84081
- Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search / Walla, J., Ruthmair, M., & Raidl, G. (2009). Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search. In Hybrid Metaheuristics 2009, volume 5818 of LNCS (pp. 84–99). http://hdl.handle.net/20.500.12708/53000
- A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem / Ruthmair, M., & Raidl, G. (2009). A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem. In Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of LNCS (pp. 713–720). http://hdl.handle.net/20.500.12708/52997
- Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2009). Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In Proceedings of Hybrid Metaheuristics - Sixth International Workshop (pp. 45–59). http://hdl.handle.net/20.500.12708/52831
- Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques / Pirkwieser, S., & Raidl, G. (2009). Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ILP techniques. In Proceedings of the 8th Metaheuristic International Conference (MIC 2009) (p. 10). http://hdl.handle.net/20.500.12708/52830
- A memetic algorithm for the generalized minimum vertex-biconnected network problem / Hu, B., & Raidl, G. (2009). A memetic algorithm for the generalized minimum vertex-biconnected network problem. In 9th International Conference on Hybrid Intelligent Systems - HIS 2009 (p. 6). http://hdl.handle.net/20.500.12708/52828
- Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics / Gruber, M., & Raidl, G. (2009). Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics. In Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference on Computer Aided Systems Theory (pp. 665–672). http://hdl.handle.net/20.500.12708/52826
- Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances / Gruber, M., & Raidl, G. (2009). Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on Euclidean instances. In Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (p. 8). http://hdl.handle.net/20.500.12708/52804
- A lagrangian decomposition based heuristic for capacitated connected facility location / Leitner, M., & Raidl, G. (2009). A lagrangian decomposition based heuristic for capacitated connected facility location. In Proceedings of the 8th Metaheuristic International Conference (MIC 2009). Metaheuristic International Conference (MIC), Hamburg, EU. http://hdl.handle.net/20.500.12708/52730
- A column generation approach for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2009). A column generation approach for the periodic vehicle routing problem with time windows. In Proceedings of the International Network Optimization Conference 2009 (p. 6). http://hdl.handle.net/20.500.12708/52689
- Accelerating column generation for a survivable network design problem / Leitner, M., Raidl, G., & Pferschy, U. (2009). Accelerating column generation for a survivable network design problem. In Proceedings of the International Network Optimization Conference 2009 (p. 8). http://hdl.handle.net/20.500.12708/52688
- Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2009). Cluster-based (meta-)heuristics for the Euclidean bounded diameter minimum spanning tree problem. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 228–231). http://hdl.handle.net/20.500.12708/52686
- A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem / Ruthmair, M., & Raidl, G. (2009). A Kruskal-based heuristic for the rooted delay-constrained minimum spanning tree problem. In Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009) (pp. 244–246). http://hdl.handle.net/20.500.12708/52687
- MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics / Puchinger, J., Raidl, G., & Pirkwieser, S. (2009). MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics. In Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,Volume 10 of Annals of Information Systems (pp. 71–102). Springer. http://hdl.handle.net/20.500.12708/26527
- (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2009). (Meta-)heuristic separation of jump cuts in a branch&cut approach for the bounded diameter minimum spanning tree problem. In Matheuristics - Hybridizing Metaheuristics and Mathematical Programming,volume 10 of Annals of Information Systems (pp. 209–230). Springer. http://hdl.handle.net/20.500.12708/26522
- Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference / Raidl, G. (Ed.). (2009). Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference. ACM Press. http://hdl.handle.net/20.500.12708/22977
2008
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem / Prandtstetter, M., & Raidl, G. (2008). An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research, 191(3), 1004–1022. http://hdl.handle.net/20.500.12708/171068
- Combining forces to reconstruct strip shredded text documents / Prandtstetter, M., & Raidl, G. (2008). Combining forces to reconstruct strip shredded text documents. In Hybrid Metaheuristics 2008 (pp. 175–189). http://hdl.handle.net/20.500.12708/52609
- Solving the post enrolment course timetabling problem by ant colony optimization / Mayer, A., Nothegger, C., Chwatal, A., & Raidl, G. (2008). Solving the post enrolment course timetabling problem by ant colony optimization. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (p. 13). http://hdl.handle.net/20.500.12708/52602
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search / Puchinger, J., & Raidl, G. (2008). Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. Journal of Heuristics, 14(5), 457–472. http://hdl.handle.net/20.500.12708/171065
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem / Hu, B., Leitner, M., & Raidl, G. (2008). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. Journal of Heuristics, 14(5), 473–499. http://hdl.handle.net/20.500.12708/171058
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization / Raidl, G., & Puchinger, J. (2008). Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In C. Blum, M. J. Blesa Aguilera, A. Roli, & M. Sampels (Eds.), Hybrid Metaheuristics. An Emergent Approach for Combinatorial Optimization (Vol. 114, pp. 31–62). Springer. https://doi.org/10.1007/978-3-540-78295-7_2
- Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees / Pirkwieser, S., Ruiz-Torrubiano, R., & Raidl, G. (2008). Exact methods and metaheuristic approaches for deriving high quality fully resolved consensus trees. BIRD’08 2nd International Conference on Bioinformatics Research and Development, Wien, Austria. http://hdl.handle.net/20.500.12708/84853
- Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / Gruber, M. (2008). Heuristic Jump Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Entscheidungsunterstützung in der Logistik-Geographische Informationssysteme, Simulation und Optimierung, Salzburg, Austria. http://hdl.handle.net/20.500.12708/84852
- Cooperative Hybrids for Combinatorial Optimization / Raidl, G. (2008). Cooperative Hybrids for Combinatorial Optimization. Int. Workshop on Nature Inspired Cooperative Strategies for Optimization, Puerto de La Cruz, Tenerife, Spain, EU. http://hdl.handle.net/20.500.12708/84849
- Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems / Raidl, G. (2008). Combining Metaheuristics with Mathematical Programming Techniques for Solving Difficult Network Design Problems. First Int. Workshop on Information Network Design, Kitakyushu City, Fukuoka, Japan, Non-EU. http://hdl.handle.net/20.500.12708/84848
- A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem / Raidl, G., & Gruber, M. (2008). A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. In Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (pp. 446–449). http://hdl.handle.net/20.500.12708/52630
- Effective neighborhood structures for the generalized traveling salesman problem / Hu, B., & Raidl, G. (2008). Effective neighborhood structures for the generalized traveling salesman problem. In Evolutionary Computation in Combinatorial Optimisation - EvoCOP 2008 (pp. 36–47). LNCS/Springer Berlin. http://hdl.handle.net/20.500.12708/52610
- Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks / Leitner, M., & Raidl, G. (2008). Lagrangian decomposition, metaheuristics, and hybrid approaches for the design of the last mile in fiber optic networks. In Hybrid Metaheuristics 2008 (pp. 158–174). http://hdl.handle.net/20.500.12708/52607
- A variable neighborhood search for the periodic vehicle routing problem with time windows / Pirkwieser, S., & Raidl, G. (2008). A variable neighborhood search for the periodic vehicle routing problem with time windows. In Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing. EU/MEeting, Troyes, Frankreich, EU. http://hdl.handle.net/20.500.12708/52604
- Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms / Pirkwieser, S., & Raidl, G. (2008). Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. In Proceedings of the 10th annual conference on Genetic and evolutionary computation (pp. 323–330). http://hdl.handle.net/20.500.12708/52603
- Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem / Hu, B., & Raidl, G. (2008). Solving the railway traveling salesman problem via a transformation into the classical traveling salesman problem. In 8th International Conference on Hybrid Intelligent Systems (pp. 73–77). http://hdl.handle.net/20.500.12708/52600
- (Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2008). (Meta-)heuristic separation of jump cuts for the bounded diameter minimum spanning tree problem. In Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics. Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/52598
- Variable neighborhood search for a prize collecting capacity constrained connected facility location problem / Leitner, M., & Raidl, G. (2008). Variable neighborhood search for a prize collecting capacity constrained connected facility location problem. In Proceedings of the 2008 International Symposium on Applications and the Internet (pp. 233–236). IEEE Computer Society. http://hdl.handle.net/20.500.12708/52596
- Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem / Gruber, M., & Raidl, G. (2008). Heuristic cut separation in a branch&cut approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2008 International Symposium on Applications and the Internet (pp. 261–264). IEEE Computer Society. http://hdl.handle.net/20.500.12708/52551
- A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem / Pirkwieser, S., Raidl, G., & Puchinger, J. (2008). A Lagrangian decomposition/evolutionary algorithm hybrid for the knapsack constrained maximum spanning tree problem. In Recent Advances in Evolutionary Computation for Combinatorial Optimization (pp. 69–85). Springer. http://hdl.handle.net/20.500.12708/26083
2007
- Reconstructing Sheets of Manually Torn Paper / Prandtstetter, M., Raidl, G., & Schüller, P. (2007). Reconstructing Sheets of Manually Torn Paper. 11th International Workshop on Combinatorial Optimization, Aussois, Frankreich, EU. http://hdl.handle.net/20.500.12708/84603
- Fingerprint template compression by solving a minimum label $k$-node subtree problem / Raidl, G., & Chwatal, A. (2007). Fingerprint template compression by solving a minimum label $k$-node subtree problem. In International Conference of Numerical Analysis and Applied Mathematics (pp. 444–447). http://hdl.handle.net/20.500.12708/51947
- Compressing fingerprint templates by solving an extended minimum label spanning tree problem. / Chwatal, A., Raidl, G., & Dietzel, O. (2007). Compressing fingerprint templates by solving an extended minimum label spanning tree problem. In Proceedings of the Seventh Metaheuristics International Conference (MIC) (p. 3). http://hdl.handle.net/20.500.12708/51853
- Determining orbital elements of extrasolar planets by evolution strategies. / Chwatal, A., & Raidl, G. (2007). Determining orbital elements of extrasolar planets by evolution strategies. In R. Moreno-Díaz (Ed.), EUROCAST 2007 Conference Proceedings, 2007. http://hdl.handle.net/20.500.12708/51852
- Applying branch-and-cut for compressing fingerprint templates / Chwatal, A., & Raidl, G. (2007). Applying branch-and-cut for compressing fingerprint templates. EURO XXII: 22nd European Conference on Operational Research, Prague, EU. http://hdl.handle.net/20.500.12708/84610
- Determining orbital elements of extrasolar planets by evolution strategies. / Chwatal, A., & Raidl, G. (2007). Determining orbital elements of extrasolar planets by evolution strategies. In R. Moreno-Díaz (Ed.), Computer Aided Systems Theory - EUROCAST 2007 (pp. 870–877). Springer. http://hdl.handle.net/20.500.12708/51851
- CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing / Hetzl, J., Foerster, A. M., Raidl, G., & Mittelsten Scheid, O. (2007). CyMATE: A new tool for methylation analysis of plant genomic DNA after bisulfite sequencing. The Plant Journal, 51(3), 526–536. http://hdl.handle.net/20.500.12708/169659
- Models and algorithms for three-stage two-dimensional bin packing / Puchinger, J., & Raidl, G. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304–1327. http://hdl.handle.net/20.500.12708/169628
- Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem / Pirkwieser, S., Raidl, G., & Puchinger, J. (2007). Combining Lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem. In Evolutionary Computation in Combinatorial Optimization: 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings (pp. 176–187). http://hdl.handle.net/20.500.12708/51946
- A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks / Wagner, D., Pferschy, U., Mutzel, P., Raidl, G., & Bachhiesl, P. (2007). A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks. In Proceedings of the International Network Optimization Conference 2007. International Network Optimization Conference, Spa, Belgien, EU. http://hdl.handle.net/20.500.12708/51928
- Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem / Leitner, M., Hu, B., & Raidl, G. (2007). Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem. In Proceedings of the International Network Optimization Conference 2007. International Network Optimization Conference, Spa, Belgien, EU. http://hdl.handle.net/20.500.12708/51927
- A new approximation algorithm for bend minimization in the kandinsky model. / Yildiz, C., Mutzel, P., & Barth, W. (2007). A new approximation algorithm for bend minimization in the kandinsky model. In M. Kaufmann & D. Wagner (Eds.), Graph Drawing - 14th International Symposium, GD 2006 Karlsruhe, Germany, September 18-20, 2006 Revised Papers. Springer. http://hdl.handle.net/20.500.12708/51765
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. / Wagner, D., Raidl, G., Pferschy, U., Mutzel, P., & Bachhiesl, P. (2007). A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks. In Operations Research Proceedings 2006, Karlsruhe. Operations Research, Karlsruhe, Deutschland, EU. Springer. http://hdl.handle.net/20.500.12708/51766
2006
- Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem / Prandtstetter, M., & Raidl, G. (2006). Two Integer Linear Programming Approaches for Solving the Car Sequencing Problem. 10th International Workshop on Combinatorial Optimization, Aussois, Frankreich, EU. http://hdl.handle.net/20.500.12708/84604
- Biased Mutation Operators for Subgraph-Selection Problems / Raidl, G., Koller, G., & Julstrom, B. (2006). Biased Mutation Operators for Subgraph-Selection Problems. IEEE Transactions on Evolutionary Computation, 10(2), 145–156. http://hdl.handle.net/20.500.12708/173461
- Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. / Mujezinovic, N., Raidl, G., Hutchins, J. R. A., Peters, J. M., Mechtler, K., & Eisenhaber, F. (2006). Cleaning of raw peptide ms/ms spectra: Improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. Proteomics, VOL 6(19), 5117–5131. http://hdl.handle.net/20.500.12708/173460
- Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems / Hu, B., Leitner, M., & Raidl, G. (2006). Large Neighborhoods in Variable Neighborhood Search Approaches for Generalized Network Design Problems. 1st Workshop on Mathematical Contributions to Metaheuristics (Matheuristics 2006), Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/84596
- Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem / Raidl, G., Hu, B., & Leitner, M. (2006). Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem. 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brasilien, Non-EU. http://hdl.handle.net/20.500.12708/84595
- Metaheuristics for Solving a Scheduling Problem in Car Manufacturing / Raidl, G. (2006). Metaheuristics for Solving a Scheduling Problem in Car Manufacturing. ICAM5 - Fifth International Conference on Applied Mathematics, Baia Mare, Rumänien, Non-EU. http://hdl.handle.net/20.500.12708/84597
- A unified view on hybrid metaheuristics. / Raidl, G. (2006). A unified view on hybrid metaheuristics. In F. Almeida (Ed.), Hybrid Metaheuristics - Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-14, 2006, Proceedings (pp. 1–12). Springer. http://hdl.handle.net/20.500.12708/51761
- The core concept for the multidimensional knapsack problem. / Puchinger, J., Raidl, G., & Pferschy, U. (2006). The core concept for the multidimensional knapsack problem. In J. Gottlieb & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization - EvoCOP 2006, volume 3906 of LNCS (pp. 195–208). Springer. http://hdl.handle.net/20.500.12708/51759
- Evolutionary approach to constrained minimum spanning tree problem. / Pagacz, A., Raidl, G., & Zawislak, S. (2006). Evolutionary approach to constrained minimum spanning tree problem. In J. Arabasa (Ed.), Evolutionary Computation and Global Optimization 2006, Murzasichle, Poland, 2006. (pp. 331–341). Oficyna Wydawnicza Politechniki Warszawskiej. http://hdl.handle.net/20.500.12708/51757
- Variable neighborhood descent with self-adaptive neighborhood-ordering. / Hu, B., & Raidl, G. (2006). Variable neighborhood descent with self-adaptive neighborhood-ordering. In C. Cotta, A. J. Fernandez, & J. E. Gallardo (Eds.), Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics. http://hdl.handle.net/20.500.12708/51756
- Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. / Gruber, M., van Hemert, J., & Raidl, G. (2006). Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In M. Keijzer (Ed.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO 2006 (pp. 1187–1194). http://hdl.handle.net/20.500.12708/51755
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. / Puchinger, J., & Raidl, G. (2006). Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. (TR 186-1-06-02). http://hdl.handle.net/20.500.12708/33076
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. / Hu, B., Leitner, M., & Raidl, G. (2006). Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. (Technical Report TR 186-1-06-01). http://hdl.handle.net/20.500.12708/33075
- Models and algorithms for three-stage two-dimensional bin packing. / Puchinger, J., & Raidl, G. (2006). Models and algorithms for three-stage two-dimensional bin packing. http://hdl.handle.net/20.500.12708/33040
- Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. / Gottlieb, J., & Raidl, G. (Eds.). (2006). Evolutionary Computation in Combinatorial Optimization - 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006. Proceedings. Springer. http://hdl.handle.net/20.500.12708/22339
2005
- Solving the prize-collecting Steiner tree problem to optimality. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2005). Solving the prize-collecting Steiner tree problem to optimality. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO). ALENEX 2005 (Seventh Workshop on Algorithm Engineering and Experiments), Vancouver, Kanada, Non-EU. SIAM. http://hdl.handle.net/20.500.12708/51229
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2005). An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, 105(2–3), 427–449. http://hdl.handle.net/20.500.12708/173363
- A variable neihborhood search approach for solving the car sequencing problem. / Prandtstetter, M., & Raidl, G. (2005). A variable neihborhood search approach for solving the car sequencing problem. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51230
- A variable neihborhood search approach for solving the car sequencing problem. / Prandtstetter, M., & Raidl, G. (2005). A variable neihborhood search approach for solving the car sequencing problem. http://hdl.handle.net/20.500.12708/33039
- Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / Raidl, G., & Gottlieb, J. (2005). Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. Evolutionary Computation, 13(4), 441–475. http://hdl.handle.net/20.500.12708/173365
- Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. / Puchinger, J., Raidl, G., & Gruber, M. (2005). Cooperating memetic and branch-and-cut algorithms for solving the multidimensional knapsack problem. In Proceedings of MIC2005, the 6th Metaheuristics International Conference. MIC2005 (The 6th Metaheuristics International Conference), Wien, Austria. http://hdl.handle.net/20.500.12708/51233
- Relaxation guided variable neighborhood search. / Puchinger, J., & Raidl, G. (2005). Relaxation guided variable neighborhood search. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51232
- Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. / Puchinger, J., & Raidl, G. (2005). Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In J. Mira (Ed.), Artifical Intelligence and Knowledge Engineering Applications: A Bioinspired Approach (pp. 41–53). Springer. http://hdl.handle.net/20.500.12708/51231
- Computing generalized minimum spanning trees with variable neighborhood search. / Hu, B., Leitner, M., & Raidl, G. (2005). Computing generalized minimum spanning trees with variable neighborhood search. In P. Hansen (Ed.), Proceedings of the XVIII Mini EURO Conference on VNS. http://hdl.handle.net/20.500.12708/51226
- Variable neighborhood search for the bounded diameter minimum spanning tree problem. / Gruber, M., & Raidl, G. (2005). Variable neighborhood search for the bounded diameter minimum spanning tree problem. In P. Hansen (Ed.), Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search. http://hdl.handle.net/20.500.12708/51225
- A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. / Gruber, M., & Raidl, G. (2005). A new 0-1 ILP approach for the bounded diameter minimum spanning tree problem. In Proceedings of the 2nd International Network Optimization Conference (pp. 178–185). http://hdl.handle.net/20.500.12708/51224
- GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings / Beyer, H.-G., & Raidl, G. (Eds.). (2005). GECCO: Genetic And Evolutionary Computation Conference Conference Proceedings. ACM Press. http://hdl.handle.net/20.500.12708/22340
- Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448) / Raidl, G., & Gottlieb, J. (Eds.). (2005). Evolutionary Computation in Combinatorial Optimization, 5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings (LNCS 3448). Springer. http://hdl.handle.net/20.500.12708/22297
2004
- Solving the prize-collecting Steiner tree problem to optimality. / Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G. W., Mutzel, P., & Fischetti, M. (2004). Solving the prize-collecting Steiner tree problem to optimality. http://hdl.handle.net/20.500.12708/33020
- An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem / Raidl, G. (2004). An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem. ACM Symposium on Applied Computing, Santa Fe, New Mexico, Austria. http://hdl.handle.net/20.500.12708/84428
- New ILP Approaches for 3-Staged Two-Dimensional Bin Packing / Raidl, G. (2004). New ILP Approaches for 3-Staged Two-Dimensional Bin Packing. EUROXX: 20th European Conference on Operational Research, Rhodos, Austria. http://hdl.handle.net/20.500.12708/84427
- An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / Raidl, G. (2004). An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84426
- An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing / Raidl, G. (2004). An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84425
- Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems / Raidl, G. (2004). Some Thoghts on How to Make Memetic Algorithms for Multiobjective Knapsack Problems. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84424
- Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems / Raidl, G. (2004). Hybrid Estimation of Distribution on Algorithm for Multiobjective Knapsack Problems. EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal, Austria. http://hdl.handle.net/20.500.12708/84423
- Anwendung der Computional Intelligence in der Kombinatorischen Optimierung / Mutzel, P. (2004). Anwendung der Computional Intelligence in der Kombinatorischen Optimierung. Universität Dortmund, SFB Meeting, Dortmund, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84422
- Maximum Planar Subgraphs and Crossing Minimization in Graph Drawing / Mutzel, P. (2004). Maximum Planar Subgraphs and Crossing Minimization in Graph Drawing. ADONET/Socrates Doctoral Courses in Discrete Systems and Optimization, Köln, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84421
- Die SPQR-Baum Datenstruktur im Graph Drawing / Mutzel, P. (2004). Die SPQR-Baum Datenstruktur im Graph Drawing. Universität Dortmund, Dortmund, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84420
- Generation as Method for Explorative Learning in Computer Science Education / Kerren, A. (2004). Generation as Method for Explorative Learning in Computer Science Education. 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, Austria. http://hdl.handle.net/20.500.12708/84419
- DGCVis: An Exploratory 3D Visualization of Graph Pyramids / Kerren, A. (2004). DGCVis: An Exploratory 3D Visualization of Graph Pyramids. CMV: 2nd International Conference on Coordinated and Multiple Views in Exploratory Visualization, IEEE, London, Austria. http://hdl.handle.net/20.500.12708/84417
- Probe Selection by Integer Linear Programming / Klau, G. W. (2004). Probe Selection by Integer Linear Programming. Séminaire BIOINFO, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Nancy, Frankreich, Austria. http://hdl.handle.net/20.500.12708/84416
- Optimale Probenauswahl für Microarrays bei mehrdeutigen Proben / Klau, G. W. (2004). Optimale Probenauswahl für Microarrays bei mehrdeutigen Proben. Universität Wien, Institut für Statistik und Decision Support Systems, Privatissimum-Seminar “Biostatistik und Optimierung,” Wien, Austria. http://hdl.handle.net/20.500.12708/84414
- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation / Klau, G. W. (2004). Structural Alignment of Two RNA Sequences with Lagrangian Relaxation. OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande, Austria. http://hdl.handle.net/20.500.12708/84413
- Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / Klau, G. W. (2004). Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming. OR 2004: International Conference of the German and Dutch Operations Research Societies, Tilburg, Niederlande, Austria. http://hdl.handle.net/20.500.12708/84412
- Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / Klau, G. W. (2004). Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming. ISMB/ECCB: 12th International Conference on Intelligent Systems for Molecular Biology und 3rd European Conference on Computational Biology, Glasgow, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84411
- Robustness and Resilience / Klau, G. W. (2004). Robustness and Resilience. Dagstuhl: Seminar Network Analysis, Dagstuhl, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84410
- Optomal Robust Non-Unique Probe Selection Using Integer Linear Programming / Klau, G. W. (2004). Optomal Robust Non-Unique Probe Selection Using Integer Linear Programming. Hong Kong University of Science, Theory Group, Hong Kong, China, Austria. http://hdl.handle.net/20.500.12708/84409
- Human-Guided Search: System, Current and Future Work / Klau, G. W. (2004). Human-Guided Search: System, Current and Future Work. The University of Sidney, School of Information Technologies, Information Visualization Research Group, Sydney, Austria. http://hdl.handle.net/20.500.12708/84408
- Automatic Graph Drawing / Weiskircher, R. (2004). Automatic Graph Drawing. Ars Electronica, Language of Network Conference, Linz, Austria. http://hdl.handle.net/20.500.12708/84406
- An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem / Koller, G. (2004). An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. PPSN: International Conference on Parallel Problem Solving From Nature VIII, Birmingham, Großbritannien, Austria. http://hdl.handle.net/20.500.12708/84404
- Solving a real-world glass cutting problem / Puchinger, J., Raidl, G., & Koller, G. (2004). Solving a real-world glass cutting problem. EVOCOP: 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal, Austria. http://hdl.handle.net/20.500.12708/84403
- Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming / Klau, G. W. (2004). Optimal Robust Non-Unique Probe Selection Using Integer Linear Programming. SIGOPT International Conference on Optimization (ICO 2004), Wittenberg, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84401
- Mathematik in der Bioinformatik / Klau, G. W. (2004). Mathematik in der Bioinformatik. Jahrestagung der Deutschen Mathematikervereinigung (DMV 2004), Heidelberg, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84402
- An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. / Koller, G., & Raidl, G. (2004). An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. In X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós, J. A. Bullinaria, J. E. Rowe, P. Tiňo, A. Kabán, & H.-P. Schwefel (Eds.), Parallel Problem Solving from Nature - PPSN VIII (pp. 302–311). Springer. https://doi.org/10.1007/978-3-540-30217-9_31
- Bend minimization in planar orthogonal drawings using integer programming. / Mutzel, P., & Weiskircher, R. (2004). Bend minimization in planar orthogonal drawings using integer programming. http://hdl.handle.net/20.500.12708/33019
- Models and algorithms for three-stage two-dimensional bin packing. / Puchinger, J., & Raidl, G. (2004). Models and algorithms for three-stage two-dimensional bin packing. http://hdl.handle.net/20.500.12708/33018
- Biased mutation operators for subgraph-selection problems. / Raidl, G., Koller, G., & Julstrom, B. (2004). Biased mutation operators for subgraph-selection problems. http://hdl.handle.net/20.500.12708/33016
- Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. / Raidl, G., & Gottlieb, J. (2004). Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: A case study for the multidimensional knapsack problem. http://hdl.handle.net/20.500.12708/33017
- Non-planar orthogonal drawings with fixed topology / Chimani, M., Klau, G. W., & Weiskircher, R. (2004). Non-planar orthogonal drawings with fixed topology. http://hdl.handle.net/20.500.12708/33015
2003
- The fractional prize-collecting Steiner tree problem on trees / Weiskircher, R., Klau, G. W., Ljubic, I., Mutzel, P., & Pferschy, U. (2003). The fractional prize-collecting Steiner tree problem on trees. http://hdl.handle.net/20.500.12708/32937
- Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen / Weiskircher, R. (2003). Neue Anwendungen von SPQR-Bäumen im Graphenzeichnen. Gi-Dissertationspreis, Mainz, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84269
- An O(n log n) Algorithm for the Fractional Prize Collecting Steiner Tree Problem on Trees / Weiskircher, R. (2003). An O(n log n) Algorithm for the Fractional Prize Collecting Steiner Tree Problem on Trees. 7th Combinatorial Optimization Workshop, Aussois, Frankreich, Austria. http://hdl.handle.net/20.500.12708/84268
- Evolutionary Computation for Combinatorial Optimization / Raidl, G. (2003). Evolutionary Computation for Combinatorial Optimization. EvoNet Summer School 2003, University of Parma, Italy, Austria. http://hdl.handle.net/20.500.12708/84267
- On the Hybridization of Evolutionary Algorithms / Raidl, G. (2003). On the Hybridization of Evolutionary Algorithms. Genetic and Evolutionary Computation Conference (GECCO 2003), Chicago, IL, Austria. http://hdl.handle.net/20.500.12708/84265
- Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Raidl, G. (2003). Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem. Research Institute of Molecular Pathology, Biocenter Vienna, Wien, Austria. http://hdl.handle.net/20.500.12708/84266
- Recent Advances on ArchEd / Mutzel, P. (2003). Recent Advances on ArchEd. Enter-The-Past: The E-way into the four Dimensions of Cultural Heritage, Wien, Austria. http://hdl.handle.net/20.500.12708/84264
- SPQR-Trees in Automatic Graph Drawing / Mutzel, P. (2003). SPQR-Trees in Automatic Graph Drawing. Ecole polytechnique fédérale de Lausanne (EPFL), Lausanne, Schweiz, Austria. http://hdl.handle.net/20.500.12708/84263
- Effizientes Zählen von Schnittpunkten / Mutzel, P. (2003). Effizientes Zählen von Schnittpunkten. Institut für Hochenergiephysik (HEPHY) - TU Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/84241
- Force-based label number maximization / Ebner, D., Klau, G. W., & Weiskircher, R. (2003). Force-based label number maximization. http://hdl.handle.net/20.500.12708/32939
Theses
2023
-
A learning multilevel optimization approach for a large location allocation problem
/
Tomandl, L. (2023). A learning multilevel optimization approach for a large location allocation problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108220
Download: PDF (2.52 MB) -
Dynamic symmetry breaking for SAT-encodings of combinatorial problems
/
Kirchweger, M. (2023). Dynamic symmetry breaking for SAT-encodings of combinatorial problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98841
Download: PDF (807 KB) -
Establishing hereditary graph properties via vertex splitting
/
Firbas, A. (2023). Establishing hereditary graph properties via vertex splitting [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.103864
Download: PDF (1.96 MB) -
Elastic set visualization : Hypergraph visualization with moving objects and fat edges
/
Adam, S. (2023). Elastic set visualization : Hypergraph visualization with moving objects and fat edges [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.103507
Download: PDF (1.72 MB) -
Computational optimization approaches for distributing battery exchange stations for electric scooters
/
Kreutzer, B. (2023). Computational optimization approaches for distributing battery exchange stations for electric scooters [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.106880
Download: PDF (1.66 MB) -
Hybrid metaheuristics based on large neighborhood search and mixed integer linear programming for the directed feedback vertex set problem
/
Bresich, M. (2023). Hybrid metaheuristics based on large neighborhood search and mixed integer linear programming for the directed feedback vertex set problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.102404
Download: PDF (1.66 MB) -
Hybrid approaches to sports league scheduling using constraint programming and simulated annealing
/
Neumann, B. (2023). Hybrid approaches to sports league scheduling using constraint programming and simulated annealing [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98488
Download: PDF (1.39 MB) -
Certifying unsatisfiability in an expansion-based DQBF solver
/
Breitenbrunner, M. (2023). Certifying unsatisfiability in an expansion-based DQBF solver [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.99521
Download: PDF (12.9 MB) -
Engineering human-in-the-loop graph drawing algorithms
/
Villedieu, A. (2023). Engineering human-in-the-loop graph drawing algorithms [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.116748
Download: PDF (3.14 MB) -
Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning
/
Frohner, N. (2023). Advancing State Space Search for Static and Dynamic Optimization by Parallelization and Learning [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113960
Download: PDF (4.89 MB) -
Scalability for SAT-based combinatorial problem solving
/
Schidler, A. (2023). Scalability for SAT-based combinatorial problem solving [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113248
Download: PDF (6.06 MB) -
Scalable Bayesian Network Structure Learning using SAT-based Methods
/
Peruvemba Ramaswamy, V. (2023). Scalable Bayesian Network Structure Learning using SAT-based Methods [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113249
Download: PDF (3.17 MB)
2022
-
Heuristic approaches for solving the interdependent lock scheduling problem
/
Schmidt, P. (2022). Heuristic approaches for solving the interdependent lock scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.25760
Download: PDF (3 MB) -
Optimal Seat arrangement: Structure, algorithms, and complexity
/
Ceylan, E. (2022). Optimal Seat arrangement: Structure, algorithms, and complexity [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98801
Download: PDF (1.67 MB) -
Algorithmic Advances via Graph Decomposition
/
Hamm, T. (2022). Algorithmic Advances via Graph Decomposition [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.108300
Download: PDF (2.12 MB) -
Using graph neural networks in local search for edge-based relaxations of the maximum clique problem
/
Ettrich, R. (2022). Using graph neural networks in local search for edge-based relaxations of the maximum clique problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107601
Download: PDF (1.73 MB) -
Optimization of container transportation for fixed-schedule block trains with optional round trips in collaborative logistics
/
Krasel, L. F. (2022). Optimization of container transportation for fixed-schedule block trains with optional round trips in collaborative logistics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99460
Download: PDF (2.96 MB) -
Computational optimization approaches for distributing service points for mobility applications and smart charging of electric vehicles
/
Jatschka, T. (2022). Computational optimization approaches for distributing service points for mobility applications and smart charging of electric vehicles [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107309
Download: PDF (10.2 MB) -
Enhancing meta-agent conflict-based search for the multi-agent pathnding problem with informed merging and heuristics
/
Ederer, I. (2022). Enhancing meta-agent conflict-based search for the multi-agent pathnding problem with informed merging and heuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.98487
Download: PDF (2.08 MB) -
Representing normative reasoning in answer set programming using weak constraints
/
Hatschka, C. (2022). Representing normative reasoning in answer set programming using weak constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99420
Download: PDF (925 KB) -
An algorithmic study of practical map labeling
/
Li, G. (2022). An algorithmic study of practical map labeling [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107040
Download: PDF (12 MB) -
SAT-based optimization of octolinear metro map layouts
/
Fuchs, S. (2022). SAT-based optimization of octolinear metro map layouts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.95250
Download: PDF (1.13 MB) -
Minimizing makespan in flow shops with a reinforcement learning like approach : A learning beam search for the no-wait flow shop scheduling problem with release times
/
Mayerhofer, J. (2022). Minimizing makespan in flow shops with a reinforcement learning like approach : A learning beam search for the no-wait flow shop scheduling problem with release times [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99461
Download: PDF (4.84 MB)
2021
-
A Matheuristic for battery exchange station location planning for electric scooters
/
Rauscher, M. (2021). A Matheuristic for battery exchange station location planning for electric scooters [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.94720
Download: PDF (947 KB) -
Turbocharging heuristics for weak coloring numbers
/
Dobler, A. (2021). Turbocharging heuristics for weak coloring numbers [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.91580
Download: PDF (4.86 MB) -
Learning large neighborhood search for the staff resortering problem
/
Oberweger, F. F. (2021). Learning large neighborhood search for the staff resortering problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.92421
Download: PDF (1.68 MB) -
Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches
/
Horn, M. (2021). Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.96303
Download: PDF (3.77 MB) -
Computational Methods for fleet scheduling in E-mobility
/
Varga, J. (2021). Computational Methods for fleet scheduling in E-mobility [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87627
Download: PDF (1.26 MB) -
Exact and heuristic approaches for solving string problems from bioinformatics
/
Djukanovic, M. (2021). Exact and heuristic approaches for solving string problems from bioinformatics [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.93203
Download: PDF (5.06 MB) -
Parameterized algorithms for Bayesian network learning
/
Korchemna, V. (2021). Parameterized algorithms for Bayesian network learning [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90847
Download: PDF (913 KB) -
Scheduling the charging of electric vehicles with SOC-dependent maximum charging power
/
Schaden, B. (2021). Scheduling the charging of electric vehicles with SOC-dependent maximum charging power [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87361
Download: PDF (1.23 MB) -
Randomized construction approaches for the traveling tournament problem using lower bound based heuristics
/
Pace, G. (2021). Randomized construction approaches for the traveling tournament problem using lower bound based heuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.87881
Download: PDF (1.37 MB)
2020
-
Casual employee scheduling with constraint programming and metaheuristics
/
Teuschl, S. (2020). Casual employee scheduling with constraint programming and metaheuristics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.77621
Download: PDF (920 KB) -
Evaluierung der Nutzer-Aufmerksamkeit für dynamische Kartenbeschriftung
/
Zernpfennig, V. (2020). Evaluierung der Nutzer-Aufmerksamkeit für dynamische Kartenbeschriftung [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.72544
Download: PDF (10.2 MB) -
Visualizing set data with the metro map metaphor
/
Wallinger, M. (2020). Visualizing set data with the metro map metaphor [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.73941
Download: PDF (8.99 MB) -
Solving a generalized constrained longest common subsequence problem : exact and heuristic methods
/
Berger, C. (2020). Solving a generalized constrained longest common subsequence problem : exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.72420
Download: PDF (756 KB) -
Avoiding crossings in non-planar graph layouts
/
Klute, F. (2020). Avoiding crossings in non-planar graph layouts [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.77281
Download: PDF (5.76 MB) -
Heuristic optimization methods for seasonal airport slot allocation
/
Kuran, S. J. (2020). Heuristic optimization methods for seasonal airport slot allocation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.37426
Download: PDF (2.82 MB)
2019
-
Advanced dependency analysis for QBF
/
Peitl, T. (2019). Advanced dependency analysis for QBF [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.71708
Download: PDF (3.47 MB) -
Combinatorial optimization approaches for graph construction problems
/
Klocker, B. (2019). Combinatorial optimization approaches for graph construction problems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.76220
Download: PDF (1.49 MB) -
A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem
/
Kaufmann, T. (2019). A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.59930
Download: PDF (5.46 MB) -
Engineering an algorithm for strict outerconfluent graph drawings
/
Buchta, M. (2019). Engineering an algorithm for strict outerconfluent graph drawings [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.67822
Download: PDF (628 KB) -
Generating stable demers Cartograms and Iso-Hexagon cartograms
/
Nickel, S. (2019). Generating stable demers Cartograms and Iso-Hexagon cartograms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.68421
Download: PDF (4.8 MB) -
Algorithms and drawings for Mixed linear layouts of graphs
/
Col, P. de. (2019). Algorithms and drawings for Mixed linear layouts of graphs [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.60623
Download: PDF (1.1 MB) -
Perfect pseudo matchings on snarks
/
Schwendinger, B. (2019). Perfect pseudo matchings on snarks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.60527
Download: PDF (702 KB) -
Solving a weighted set covering problem for improving algorithms for cutting stock problems with setup costs by solution merging
/
Klocker, B. (2019). Solving a weighted set covering problem for improving algorithms for cutting stock problems with setup costs by solution merging [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.64801
Download: PDF (1.78 MB) -
Techniques for multiple sink placement in undirected flow networks
/
Hubmer, O. (2019). Techniques for multiple sink placement in undirected flow networks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.40725
Download: PDF (2.73 MB) -
Algorithmic approaches for Optimization problems in bike sharing and security control
/
Kloimüllner, C. (2019). Algorithmic approaches for Optimization problems in bike sharing and security control [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.25373
Download: PDF (3.58 MB) -
A Heuristic approach to aircraft trajectory optimization with constraints
/
Windbichler, A. (2019). A Heuristic approach to aircraft trajectory optimization with constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.59020
Download: PDF (3.76 MB) -
Patient scheduling in particle therapy
/
Maschler, J. (2019). Patient scheduling in particle therapy [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.64848
Download: PDF (2.54 MB) - Automatisierte Berechnung optimaler Einstellungsparameter myoelektrischer Handprothesen / Gerger, S. (2019). Automatisierte Berechnung optimaler Einstellungsparameter myoelektrischer Handprothesen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79386
- Practical algorithms for Deletion to Small Components : With applications to planning and ILP / Maleki, H. (2019). Practical algorithms for Deletion to Small Components : With applications to planning and ILP [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/79312
2018
-
Methods for intraday scheduling in particle therapy
/
Höfler, M. (2018). Methods for intraday scheduling in particle therapy [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.42364
Download: PDF (2.97 MB) -
Parallel hybrid metaheuristics for solving the firefighter problem using the GPU
/
Gajic, G. (2018). Parallel hybrid metaheuristics for solving the firefighter problem using the GPU [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.50524
Download: PDF (2.84 MB) -
SAT approach for decomposition methods
/
Lodha, N. (2018). SAT approach for decomposition methods [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.67787
Download: PDF (1.56 MB) -
Advances in decomposition approaches for mixed Integer linear programming
/
Riedler, M. (2018). Advances in decomposition approaches for mixed Integer linear programming [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.60465
Download: PDF (1.94 MB) -
Local search methods for the particle therapy patient scheduling problem
/
Hackl, T. (2018). Local search methods for the particle therapy patient scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.45164
Download: PDF (827 KB) -
Minimizing wiggles in storyline visualizations
/
Fröschl, T. (2018). Minimizing wiggles in storyline visualizations [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.53581
Download: PDF (1.65 MB) -
Monero cross-chain traceability : empirical analysis of privacy implications from currency hard-forks
/
Hinteregger, A. (2018). Monero cross-chain traceability : empirical analysis of privacy implications from currency hard-forks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.57770
Download: PDF (842 KB) -
An interactive optimization framework for point feature label placement
/
Löffler, R. (2018). An interactive optimization framework for point feature label placement [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.55340
Download: PDF (6.58 MB) -
Exploiting new types of structure for fixed-parameter tractability
/
Eiben, E. (2018). Exploiting new types of structure for fixed-parameter tractability [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.55516
Download: PDF (2.26 MB) -
Strukturelle Parameter von ILP und MILP -Instanzen aus der Praxis
/
Dittmer, V. (2018). Strukturelle Parameter von ILP und MILP -Instanzen aus der Praxis [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.52362
Download: PDF (1.09 MB)
2017
-
An iterative time-bucket refinement algorithm for high resolution scheduling problems
/
Jatschka, T. (2017). An iterative time-bucket refinement algorithm for high resolution scheduling problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.45162
Download: PDF (900 KB) -
Driving-range estimation of electric vehicles using graph algorithms
/
Gstrein, F. (2017). Driving-range estimation of electric vehicles using graph algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.40940
Download: PDF (4.41 MB) -
A heuristic framework for dynamic vehicle routing with site-dependent constraints
/
Horn, M. (2017). A heuristic framework for dynamic vehicle routing with site-dependent constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.37527
Download: PDF (849 KB)
2016
-
A SAT spproach to clique-width of a digraph and an application on model counting problems
/
Parlak, A. (2016). A SAT spproach to clique-width of a digraph and an application on model counting problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.39609
Download: PDF (679 KB) -
Parameterized complexity in the polynomial hierarchy
/
Haan, R. de. (2016). Parameterized complexity in the polynomial hierarchy [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.40633
Download: PDF (2.59 MB) -
A hybrid evolutionary algorithm for the vehicle routing problem with stochastic demands
/
Pourmanouchehri, S. (2016). A hybrid evolutionary algorithm for the vehicle routing problem with stochastic demands [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.27924
Download: PDF (8.71 MB) -
Metaheuristics for the districting and routing problem for security control
/
Prischink, M. (2016). Metaheuristics for the districting and routing problem for security control [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.35903
Download: PDF (805 KB) -
Complete solution archives for evolutionary combinatorial optimization : application to a competitive location and a stochastic vehicle routing problem
/
Biesinger, B. (2016). Complete solution archives for evolutionary combinatorial optimization : application to a competitive location and a stochastic vehicle routing problem [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36672
Download: PDF (4.69 MB) -
Visibility-based obstacle placing : automated obstacle placing based on circularity
/
Schwab, C. (2016). Visibility-based obstacle placing : automated obstacle placing based on circularity [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.24629
Download: PDF (3.24 MB) -
Column generation at strip level for the K-staged two-dimensional Cutting Stock Problem
/
Leberl, F. (2016). Column generation at strip level for the K-staged two-dimensional Cutting Stock Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.27981
Download: PDF (897 KB)
2015
-
Solving the travelling thief problem with an evolutionary algorithm
/
Wachter, C. (2015). Solving the travelling thief problem with an evolutionary algorithm [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.27702
Download: PDF (1.11 MB) -
Solving the multi-objective Steiner Tree problem with resources
/
Brandstätter, G. (2015). Solving the multi-objective Steiner Tree problem with resources [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.23734
Download: PDF (673 KB) -
A branch-and-bound approach for the constrained K-staged 2-dimensional cutting stock problem
/
Bonigl, B. (2015). A branch-and-bound approach for the constrained K-staged 2-dimensional cutting stock problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.31767
Download: PDF (697 KB) -
Electric vehicles recharge scheduling with logic-based Benders decomposition
/
Ölsböck, K. (2015). Electric vehicles recharge scheduling with logic-based Benders decomposition [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.26531
Download: PDF (786 KB) -
Structure in #SAT and QBF
/
Slivovsky, F. (2015). Structure in #SAT and QBF [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.29740
Download: PDF (1.44 MB) - Optimierungsansätze zur Planung von Freizeit-Fahrradrouten / Klocker, B. (2015). Optimierungsansätze zur Planung von Freizeit-Fahrradrouten [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/158764
2014
-
Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows
/
Trummer, D. (2014). Applying Ant Colony Optimization to the Periodic Vehicle Routing Problem with Time Windows [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23986
Download: PDF (4.08 MB) -
Detecting structure in permutations and preferences
/
Lackner, M. (2014). Detecting structure in permutations and preferences [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24943
Download: PDF (1.08 MB) -
Heuristic solution approaches for the two dimensional pre-marshalling problem
/
Tus, A. (2014). Heuristic solution approaches for the two dimensional pre-marshalling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24992
Download: PDF (806 KB) -
Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework
/
Klaffenböck, P. H. W. (2014). Pfadsuche in einer Triangulation Reduction im Mammoth Massive Multiplayer Online Research Framework [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23963
Download: PDF (1010 KB) - Finding longest common subsequences by GPU-based parallel Ant Colony Optimization / Markvica, D. (2014). Finding longest common subsequences by GPU-based parallel Ant Colony Optimization [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159087
2013
-
Optimization challenges of the future federated internet : heuristic and exact approaches
/
Inführ, J. (2013). Optimization challenges of the future federated internet : heuristic and exact approaches [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21654
Download: PDF (2.3 MB) -
Metaheuristics for the regenerator location problem
/
Jahrmann, P. (2013). Metaheuristics for the regenerator location problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-46305
Download: PDF (787 KB) -
A hybrid algorithm for the Partition Coloring Problem
/
Fritz, G. (2013). A hybrid algorithm for the Partition Coloring Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22460
Download: PDF (1.07 MB) -
Balancing bike sharing systems : a hybrid metaheuristic approach for the dynamic case
/
Pinter, A. (2013). Balancing bike sharing systems : a hybrid metaheuristic approach for the dynamic case [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.23274
Download: PDF (1.22 MB) -
Two-phase local search for the bi-objective connected facility location problem
/
Petelin, T. (2013). Two-phase local search for the bi-objective connected facility location problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22949
Download: PDF (2.8 MB) -
The rooted delay-constrained Steiner tree problem with uncertain delays
/
Karl, R. (2013). The rooted delay-constrained Steiner tree problem with uncertain delays [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21652
Download: PDF (646 KB) -
Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems
/
Putzenlechner, M. (2013). Analyse und Implementierung von Fallzusammenführungen diagnosebezogener Fallgruppen aus Sicht eines Krankenhausinformationssystems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21802
Download: PDF (2.8 MB) -
Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques
/
Bacher, C. (2013). Metaheuristic optimization of electro-hybrid powertrains using machine learning techniques [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.21840
Download: PDF (4.16 MB) - Critical links detection using CUDA / Schnabl, T. (2013). Critical links detection using CUDA [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159715
- Selective graph coloring problem / Volko, C.-D. (2013). Selective graph coloring problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159739
2012
-
Enhancing an evolutionary algorithm with a solution archive to reconstruct cross cut shredded text documents
/
Biesinger, B. (2012). Enhancing an evolutionary algorithm with a solution archive to reconstruct cross cut shredded text documents [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-59288
Download: PDF (2.68 MB) -
The Vehicle Routing Problem with Compartments : exact and metaheuristic approaches
/
Gebhard, P. (2012). The Vehicle Routing Problem with Compartments : exact and metaheuristic approaches [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-56025
Download: PDF (1.39 MB) -
Improving the protein identification performance in high-resolution mass spectrometry data
/
Dusberger, F. (2012). Improving the protein identification performance in high-resolution mass spectrometry data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-59974
Download: PDF (6.04 MB) -
On solving constrained tree problems and an adaptive layers framework
/
Ruthmair, M. (2012). On solving constrained tree problems and an adaptive layers framework [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-54456
Download: PDF (1.19 MB) -
Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation
/
Pirkwieser, S. (2012). Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-55573
Download: PDF (1.99 MB) - Metaheuristics for a multimodal home-healthcare scheduling problem / Hiermann, G. (2012). Metaheuristics for a multimodal home-healthcare scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161084
- Solving multimodal resource constrained project scheduling problems / Sturm, M. (2012). Solving multimodal resource constrained project scheduling problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160599
- Extending the Gecode framework with interval constraint programming / Ivezić, I. (2012). Extending the Gecode framework with interval constraint programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160590
2011
-
A Multilevel Refinement approach to the Rooted Delay-Constrained Steiner Tree Problem
/
Seidl, T. (2011). A Multilevel Refinement approach to the Rooted Delay-Constrained Steiner Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-41486
Download: PDF (488 KB) -
Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods
/
Oberlechner, K. (2011). Solving the k-node minimum label spanning arborescence problem with exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-45697
Download: PDF (573 KB) -
Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten
/
Winkler, T. (2011). Anwendung von kombinatorischen Optimierungsmethoden zur Rekonstruktion von in Streifen geschnittenen Papierdokumenten [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38069
Download: PDF (3.13 MB) -
Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus
/
Krenek, T. (2011). Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38051
Download: PDF (1.16 MB) -
Clustering heuristics for the hierarchical ring network problem
/
Schuster, R. (2011). Clustering heuristics for the hierarchical ring network problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-58321
Download: PDF (445 KB) - Heuristic methods for the Hop Constrained Survivable Network Design Problem / Fritz, G. (2011). Heuristic methods for the Hop Constrained Survivable Network Design Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160799
- Image denoising with variational methods via graph cuts / Lang, L. (2011). Image denoising with variational methods via graph cuts [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161500
- Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem / Gruber, C. (2011). Ein Lösungsarchiv mit Branch-and-Bound-Erweiterung für das Generalized Minimum Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160798
- Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints / Sinnl, M. (2011). Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160792
- Optimierung der periodischen Tourenplanung in der Müllentsorgung / Edlinger, K.-M. (2011). Optimierung der periodischen Tourenplanung in der Müllentsorgung [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160202
2010
-
Compressing fingerprint templates by solving the k-node minimum label spanning arborescence problem by branch-and-price
/
Thöni, C. (2010). Compressing fingerprint templates by solving the k-node minimum label spanning arborescence problem by branch-and-price [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-35773
Download: PDF (1.71 MB) -
Automatic generation of 2-AntWars players with genetic programming
/
Inführ, J. (2010). Automatic generation of 2-AntWars players with genetic programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-39519
Download: PDF (65 MB) -
Heuristic methods for solving two Generalized Network Problems
/
Pagacz, A. (2010). Heuristic methods for solving two Generalized Network Problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-35977
Download: PDF (942 KB) -
Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem
/
Berlakovich, M. (2010). Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-43399
Download: PDF (1.01 MB) -
On the minimum label spanning tree problem : solution methods and applications
/
Chwatal, A. M. (2010). On the minimum label spanning tree problem : solution methods and applications [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-30618
Download: PDF (927 KB) -
Solving two network design problems by mixed integer programming and hybrid optimization methods
/
Leitner, M. (2010). Solving two network design problems by mixed integer programming and hybrid optimization methods [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36359
Download: PDF (772 KB) -
Reconstructing cross-cut shredded documents by means of evolutionary algorithms
/
Schauer, C. (2010). Reconstructing cross-cut shredded documents by means of evolutionary algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-36198
Download: PDF (4.97 MB) - Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem / Sonnleitner, M. (2010). Ein neues Lösungsarchiv für das Generalized Minimum Spanning Tree-Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/161374
- A timeslot-based heuristic approach to construct high-school timetables / Pimmer, M. (2010). A timeslot-based heuristic approach to construct high-school timetables [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160861
2009
-
Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents
/
Prandtstetter, M. (2009). Hybrid optimization methods for warehouse logistics and the reconstruction of destroyed paper documents [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32849
Download: PDF (3.36 MB) -
Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem
/
Gruber, M. (2009). Exact and heuristic approaches for solving the bounded diameter minimum spanning tree problem [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24552
Download: PDF (1.22 MB) -
Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifschen Nebenbedingungen
/
Misar, T. (2009). Ein hybrides Verfahren basierend auf Variabler Nachbarschaftssuche und Dynamischer Programmierung zur Tourenfindung in einem Ersatzteillager mit domänenspezifschen Nebenbedingungen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26098
Download: PDF (563 KB) -
Enhancing a genetic algorithm by a complete solution archive based on a trie data structure
/
Šramko, A. (2009). Enhancing a genetic algorithm by a complete solution archive based on a trie data structure [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-27056
Download: PDF (1.63 MB) - Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das GMST-Problem / Wolf, M. (2009). Ein Lösungsarchiv-unterstützter evolutionärer Algorithmus für das GMST-Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186093
- Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing / Walla, J. (2009). Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186033
- Similarity searching in complex business events and sequences thereof / Obweger, H. (2009). Similarity searching in complex business events and sequences thereof [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185664
- Event-based similarity search and its applications in business analytics / Suntinger, M. (2009). Event-based similarity search and its applications in business analytics [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185660
2008
-
Evaluation and reconstruction of strip-shredded text documents
/
Morandell, W. (2008). Evaluation and reconstruction of strip-shredded text documents [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26233
Download: PDF (1.8 MB) -
Parallel Variable Neighbourhood Search for the Car Sequencing Problem
/
Knausz, M. (2008). Parallel Variable Neighbourhood Search for the Car Sequencing Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24045
Download: PDF (621 KB) -
Hybrid metaheuristics for generalized network design problems
/
Hu, B. (2008). Hybrid metaheuristics for generalized network design problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-24387
Download: PDF (676 KB) -
Reconstructing borders of manually torn paper sheets using integer linear programming
/
Schüller, P. (2008). Reconstructing borders of manually torn paper sheets using integer linear programming [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-15999
Download: PDF (841 KB) -
Combinatorial optimization for the compression of biometric templates
/
Dietzel, O. (2008). Combinatorial optimization for the compression of biometric templates [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-22579
Download: PDF (2.63 MB) -
Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie mit kundenspezifischen Auslagerpräferenzen
/
Ritzinger, U. M. (2008). Generierung von Ein- und Umlagervorschlägen in Lagern mit einer Last-In First-Out Strategie mit kundenspezifischen Auslagerpräferenzen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-29245
Download: PDF (7.67 MB) -
Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung
/
Musil, N. (2008). Design eines sicherheits-, zeit- und kostenkritischen Kommunikationsnetzwerkes mittels Lagrange Relaxierung und Spaltengenerierung [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-22850
Download: PDF (883 KB) - An incremental Dynamic Programming Approach for multidimensional allocation problems / Bonitz, C. (2008). An incremental Dynamic Programming Approach for multidimensional allocation problems [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183777
- Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems / Zaubzer, F. (2008). Lagrangian relax-and-cut and hybrid methods for the bounded diameter and the hop constrained minimum spanning tree problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183762
- A complete archive genetic algorithm for the Multidimensional Knapsack Problem / Zaubzer, S. (2008). A complete archive genetic algorithm for the Multidimensional Knapsack Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183761
- Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen / Berger, F. (2008). Ein hybrides Verfahren zur automatischen Rekonstruktion von handzerrissenen Dokumentenseiten mittels geometrischer Informationen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179753
- Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren / Potocka, A. K. (2008). Webbasierte Darstellung großer Datenmengen als Pivot-Tabelle mithilfe ressourcenoptimierter Aggregationsverfahren [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179722
2007
-
Algorithmic approaches to the string barcoding problem
/
Neuner, P. (2007). Algorithmic approaches to the string barcoding problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-16487
Download: PDF (832 KB) -
Metaheuristic approaches for designing survivable fiber-optic networks
/
Bucsics, T. (2007). Metaheuristic approaches for designing survivable fiber-optic networks [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-32479
Download: PDF (657 KB) -
Improved protein identification after fast elimination of non-interpretable peptide MS/MS spectra and noise reduction
/
Mujezinovic, N. (2007). Improved protein identification after fast elimination of non-interpretable peptide MS/MS spectra and noise reduction [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-18901
Download: PDF (2.76 MB) - Subgradient optimization based Lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem / Putz, P. (2007). Subgradient optimization based Lagrangian relaxation and relax-and-cut approaches for the bounded-diameter minimum spanning tree problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184168
- Map-Matching und Wegsuche in einem geografischen Informationssystem / Braumann, A. (2007). Map-Matching und Wegsuche in einem geografischen Informationssystem [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181909
2006
-
An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem
/
Kopinitsch, B. (2006). An ant colony optimisation algorithm for the bounded diameter minimum spanning tree problem [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-25663
Download: PDF (440 KB) -
A Lagrangian decomposition approach combined with metaheuristics for the Knapsack Constrained Maximum Spanning Tree problem
/
Pirkwieser, S. (2006). A Lagrangian decomposition approach combined with metaheuristics for the Knapsack Constrained Maximum Spanning Tree problem [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-34434
Download: PDF (1.03 MB) - Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen / Chwatal, A. M. (2006). Bestimmung der Bahnelemente von extrasolaren Planeten aufgrund von Radialgeschwindigkeitsmessdaten mittels evolutionärer Algorithmen [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185520
- Solving two generalized network design problems with exact and heuristic methods / Leitner, M. (2006). Solving two generalized network design problems with exact and heuristic methods [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185040
- Cluster planarity testing for the case of not necessarily connected clusters / Beibl, R. (2006). Cluster planarity testing for the case of not necessarily connected clusters [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/178002
2005
-
Combining metaheuristics and integer programming for solving cutting and packing problems
/
Puchinger, J. (2005). Combining metaheuristics and integer programming for solving cutting and packing problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-21487
Download: PDF (764 KB) - An extended local branching framework and its application to the multidimensional Knapsack problem / Lichtenberger, D. (2005). An extended local branching framework and its application to the multidimensional Knapsack problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184602
- Option pricing by means of genetic programming / Heigl, A. (2005). Option pricing by means of genetic programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184545
- An application of the Dijkstra's algorithm for a (on-board) route (re-) planning module / Verlut, G. (2005). An application of the Dijkstra’s algorithm for a (on-board) route (re-) planning module [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182706
- Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem / Wagner, D. (2005). Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179893
- Exact and heuristic methods for solving the car sequencing problem / Prandtstetter, M. (2005). Exact and heuristic methods for solving the car sequencing problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179890
- Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation / Gamper, V. (2005). Multiple structural RNA alignment with affine gap costs based on Lagrangian relaxation [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179889
2004
-
Exact and memetic algorithms for two network design problems
/
Ljubić, I. (2004). Exact and memetic algorithms for two network design problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-13664
Download: PDF (10 MB) - Multiple constant multiplication by time-multiplexed mapping of addition chains / Tummeltshammer, P. (2004). Multiple constant multiplication by time-multiplexed mapping of addition chains [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184119
- An alignment graph based evolutionary algorithm for the multiple sequence alignment problem / Leopold, S. (2004). An alignment graph based evolutionary algorithm for the multiple sequence alignment problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/184100
- Ein genetischer Algorithmus für das Optimum Communication Spanning Tree Problem / Gruber, G. (2004). Ein genetischer Algorithmus für das Optimum Communication Spanning Tree Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182575
2003
- Evolutionäre Algorithmen für das kapazitätsbeschränkte minimale Spannbaumproblem / Braun, J. (2003). Evolutionäre Algorithmen für das kapazitätsbeschränkte minimale Spannbaumproblem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185824
- Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems / Kersting, S. A. (2003). Ein evolutionärer Algorithmus zur Lösung des Vertex-Biconnectivity Augmentation Problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183449
- Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem / Fauster, J. (2003). Neue heuristische Lösungsansätze für das Multiple Sequence Alignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183024
- Ein genetischer Algorithmus für das Generalized Assignment Problem / Feltl, H. (2003). Ein genetischer Algorithmus für das Generalized Assignment Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183022
2002
- Ein effizienter hybrider evolutionärer Algorithmus für kapazitätenbeschränkte minimale Spannbaumprobleme / Bleyer, M. (2002). Ein effizienter hybrider evolutionärer Algorithmus für kapazitätenbeschränkte minimale Spannbaumprobleme [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181291
2001
- Ant Colony Optimization für Entwurf und Optimierung von Netzwerkstrukturen / Fauster, W. (2001). Ant Colony Optimization für Entwurf und Optimierung von Netzwerkstrukturen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/182450
Awards
-
Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
2010 / ERC Europäischer Forschungsrat -
Günther Raidl:
Marie-Curie Research Training Network: Algorithmic Descrete Optimization Network (ADONET) - Austrian Coordinator
2004 / EC Europäische Komission - Marie Curie / Website / Project
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 .