TU Wien Informatics

Overview
Services
Office of the Dean Infrastructure Communications eduLAB
Institutes
Computer Engineering Information Systems Engineering Logic and Computation Visual Computing and Human-Centered Technology
Research Units
Algorithms and Complexity Artifact-based Computing and User Research Artificial Intelligence Techniques Automation Systems Business Informatics Compilers and Languages Computer Graphics Computer Vision Cyber-Physical Systems Data Science Databases and Artificial Intelligence Distributed Systems Embedded Computing Systems Formal Methods in Systems Engineering Human Computer Interaction Knowledge-Based Systems Machine Learning Parallel Computing Security and Privacy Software Engineering Theory and Logic Virtual and Augmented Reality Visual Analytics

Algorithms and Complexity E192-01

  • A Research Unit of The Institute of Logic and Computation

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

Research Unit Algorithms and Complexity

Contact

On This Page

About People Activities

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.

Jiehua Chen
Jiehua Chen J. Chen

Associate Professor
Assoc.Prof. Dr.

Robert Ganian
Robert Ganian R. Ganian

Associate Professor
Assoc.Prof. / PhD

Martin Nöllenburg
Martin Nöllenburg M. Nöllenburg

Full Professor
Univ.Prof. Dipl.-Inf. Dr.

Günther Raidl
Günther Raidl G. Raidl

Associate Professor
Ao.Univ.Prof. DI Dr.

Stefan Szeider
Stefan Szeider S. Szeider

Head of Research Unit
Univ.Prof. Mag. Dr.

Cornelius Brand
Cornelius Brand C. Brand

PostDoc Researcher
Dr.

Maria Bresich
Maria Bresich M. Bresich

PreDoc Researcher
DI / BSc

Leroy Nicholas Chew
Leroy Nicholas Chew L. Chew

PostDoc Researcher
PhD

Alexis de Colnet
Alexis de Colnet A. de Colnet

PostDoc Researcher
PhD

Alexander Dobler
Alexander Dobler A. Dobler

PreDoc Researcher
DI / BSc

Jan Niclas Dreier
Jan Niclas Dreier J. Dreier

PostDoc Researcher
Dr.

Martin Durand
Martin Durand M. Durand

PostDoc Researcher
Dr.

Christian Hatschka
Christian Hatschka C. Hatschka

PreDoc Researcher
DI / BSc

Phuc Hung Hoang
Phuc Hung Hoang P. Hoang

PostDoc Researcher
Dr.

Marc Huber
Marc Huber M. Huber

PreDoc Researcher
MSc

Enrico Iurlano
Enrico Iurlano E. Iurlano

PreDoc Researcher
DI / BSc

Liana Khazaliya
Liana Khazaliya L. Khazaliya

PreDoc Researcher

Markus Kirchweger
Markus Kirchweger M. Kirchweger

PreDoc Researcher
DI / BSc

Viktoria Korchemna
Viktoria Korchemna V. Korchemna

PreDoc Researcher
DI / BSc

Fionn Aidan Mc Inerney
Fionn Aidan Mc Inerney F. Mc Inerney

PostDoc Researcher
Dr.

Tomas Peitl
Tomas Peitl T. Peitl

PostDoc Researcher
Dr.

Vaidyanathan Peruvemba Ramaswamy
Vaidyanathan Peruvemba Ramaswamy V. Peruvemba Ramaswamy

PostDoc Researcher
Dr.

Franz Xaver Reichl
Franz Xaver Reichl F. Reichl

PreDoc Researcher
DI

Mathis Teva Rocton
Mathis Teva Rocton M. Rocton

PreDoc Researcher

Andre Schidler
Andre Schidler A. Schidler

PostDoc Researcher
DI Dr. / BSc

Sofia Henna Elisa Simola
Sofia Henna Elisa Simola S. Simola

PreDoc Researcher

Manuel Sorge
Manuel Sorge M. Sorge

PostDoc Researcher
Dipl.-Inf. Dr.

Laurenz Tomandl
Laurenz Tomandl L. Tomandl

PreDoc Researcher
DI / BSc

Johannes Varga
Johannes Varga J. Varga

PreDoc Researcher
DI / BSc BSc

Markus Wallinger
Markus Wallinger M. Wallinger

PreDoc Researcher
DI

Simon Wietheger
Simon Wietheger S. Wietheger

PreDoc Researcher
MSc

Hai Xia
Hai Xia H. Xia

PreDoc Researcher

Tianwei Zhang
Tianwei Zhang T. Zhang

PreDoc Researcher

Doris Brazda
Doris Brazda D. Brazda

Office Services
Mag.

Olga Ganian
Olga Ganian O. Ganian

Project Services
Mag.

Andreas Müller
Andreas Müller A. Müller

IT Services
DI

Florentina Voboril
Florentina Voboril F. Voboril

Student Staff
BSc

Shuyin Zheng
Shuyin Zheng S. Zheng

Student Staff
BSc

2023W

2024S

 

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

2021

2020

2019

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

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

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

 

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

 

  • 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
  • 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"

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 .