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

AC42 PhD Seminar

The slides from the weekly PhD seminar of Günther's group can be found here.
For those unfamiliar with WordPress, a short how-to can be found below the list.

Date Speaker Title
2023-01-19 Johannes Varga Interactive Job Scheduling with Partially Known Personnel Availabilities
2023-01-10 Marc Huber Trial Talk for VGSCO Open Problem Session: Utilizing Machine Learning to Enhance Anytime Tree Search Algorithms for Planning Problems
2022-12-13 Enrico Iurlano Perfect Sequence Covering Arrays
2022-09-19 Thomas Jatschka Trial Talk: EGN Symposium
2022-06-20 Thomas Jatschka Trial Talk: PhD Defense
2022-05-16 Johannes Varga A Large Neighborhood Search for the Directed Feedback Vertex Set Problem
2022-04-25 Thomas Jatschka A Multilevel Refinement Approach for Large Scale Battery Exchange Station Location Planning
2022-02-16 Marc Huber Trial Talk for EUROCAST 2022: A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problems
2022-02-07 Thomas Jatschka Trial Talk for EUROCAST 2022: A Matheuristic for Battery Exchange Station Location Planning for Electric Scooters
2021-12-20 Thomas Jatschka Vienna Scientific Cluster: Introduction
2021-10-18 Marc Huber Trial Talk for LOD 2021: Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems
2021-10-11 Thomas Jatschka Trial Talk for Meta 2021: A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications
2021-06-22 Matthias Horn Trial Talk for CPAIOR 2021: A*-based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem
2021-05-18 Marc Huber Learning Beam Search: On the Utilization of Machine Learning Techniques for Guiding Beam Search to solve Combinatorial Optimization Problems
2021-04-27 Marko Djukanovic A Trial Talk to the PhD Defense
2021-04-27 Matthias Horn A*-Based Compilation of Decision Diagrams for the Longest Common Subsequence Problem
2021-04-20 Thomas Jatschka A Large Neighborhood Search for a Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
2021-04-13 Daniel Obszelka Alpha Zero for solving the Longest Common Subsequence Problem, Alpha Zero for solving the Longest Common Subsequence Problem (annotated)
2021-03-16 Marko Djukanovic Solving a Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings
2020-12-07 Marc Huber Learning Beam Search: Training ML-Models for Guiding Beam Search to Solve Longest Common Subsequence Problems
2020-11-16 Matthias Horn Driver Shift Planning for an Online Store with Short Delivery Times: ISM Trial Talk
2020-11-16 Nikolaus Frohner Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines: ISM Trial Talk
2020-11-09 Thomas Jatschka Extending a Cooperative Optimization Approach for
Distributing Service Points in Mobility Applications
2020-10-19 Matthias Horn A*-based compilation of decision diagrams for the maximum independent set problem
2020-10-12 Marc Huber Solving NP-Hard Problems On Graphs With Extended AlphaGO Zero
2020-09-16 Marko Djukanovic On Solving a Generalized Constrained Longest Common Subsequence Problem
2020-09-16 Matthias Horn On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences
2020-09-16 Thomas Jatschka Distributing Battery Swapping Stations for Electric
Scooters in an Urban Area
2020-06-23 Daniel Obszelka and Günther Raidl Using Reinforcement Learning to solve the Longest Common Substring Problem, Using Reinforcement Learning to solve the Longest Common Substring Problem (annotated)
2020-06-16 Matthias Horn On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences
2020-06-09 Nikolaus Frohner Combinations of Machine Learning Methods and Decision Diagrams with Classic Metaheuristics Applied to Transport and Scheduling Problems: Proficiency Evaluation Trial Talk
2020-06-02 Marko Djukanovic Application of the Max-Clique Solvers to Solve String Problems
2020-05-20 Thomas Jatschka Distributing Battery Swapping Stations for Electric
Scooters in an Urban Area
2020-05-05 Nikolaus Frohner, Matthias Horn, and Günther Raidl Order Prediction and Driver Shift Planning at Alfies
2020-04-28 Daniel Obszelka Monte-Carlo Tree Search, Monte-Carlo Tree Search (annotated)
2020-04-14 Nikolaus Frohner A Beam Search Approach to the Traveling Tournament Problem: EvoCOP 2020 Trial Talk
2019-12-04 Thomas Jatschka Distributing Battery Swapping Stations for Electric
Scooters in an Urban Area
2019-11-06 Nikolaus Frohner A Beam Search Approach to the Traveling Tournament Problem
2019-10-30 Marko Djukanovic Exact and Heuristic Approaches for a Generalized Constrained Longest Common Subsequence Problem
2019-10-23 Matthias Horn Battle Plan CPAIOR
2019-10-09 Thomas Jatschka A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications - Trial Talk: Proficiency Evaluation
2019-08-26 Thomas Jatschka A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications - LOD/HRI Trial Talk
2019-08-26 Marko Djukanovic A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation: trial talk for LOD 2019
2019-06-19 Marko Djukanovic Exact and Heuristic Approaches for Solving LCS Problem
2019-05-22 Daniel Obszelka Alfies - A Stochastic and Dynamic Vehicle Routing Problem
2019-05-22 Nikolaus Frohner Towards Improving Merging Heuristics for Binary Decision Diagrams
2019-05-08 Nikolaus Frohner Merging Quality Estimation for BDDs with Binary Classifiers
2019-04-17 Thomas Jatschka A Cooperative Optimization Approach for Distributing Service Points in Mobility Applications
2019-04-03 Thomas Jatschka Cooperative Optimization Approaches for Distributing Service Points: Extension to a Large Number of Users
2019-03-27 Matthias Horn Resource Constrained Job Scheduling
2019-02-13 Matthias Horn Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem
2019-02-13 Marko Djukanovic A Heuristic Approach for Solving the Longest Common Square Subsequence Problem - Trial Talk for EUROCAST 2019
2019-02-13 Nikolaus Frohner Casual Employee Scheduling with CP, ACO, and VND
2019-02-13 Thomas Jatschka VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Points
2018-11-26 Marko Djukanovic Exact and Heuristic Approaches for Solving String Problems in Bioinformatics - Trial Talk for Proficiency Evaluation
2018-11-19 Nikolaus Frohner Tie Breaking By State Similarity in Relaxed BDD Merging Strategies
2018-11-05 Benedikt Klocker Finding Sup-Transition-Minors with SAT
2018-10-29 Thomas Jatschka Machine Learning Models in a Cooperative Optimization Approach for Distributing Service Points
2018-10-08 Matthias Horn
&
Johannes Maschler
Decision Diagrams for a Prize-Collecting Sequencing Problem - Trial Talk DDOPT 2018
2018-07-02 Johannes Maschler Decision Diagrams for a Prize-Collecting Sequencing Problem (EURO18)
2018-06-18 Matthias Horn Construction Methods for Decision Diagrams
2018-06-08 Marko Djukanovic Anytime Algorithms for the Longest Common Palindromic Subsequence Problem
2018-06-08 Marko Djukanovic Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem (LION 12)
2018-05-16 Nikolaus Frohner Multivalued Decision Diagrams for the Maximum Independent Set Problem
2018-05-02 Martin Riedler An Iterative Refinement Algorithm for (Rooted) Layered Graph Models
2018-04-25 Johannes Maschler Multivalued Decision Diagrams for a Prize-Collecting Sequencing Problem
2018-04-16 Thomas Jatschka Cooperative Optimization Approaches for Distributing Service Points
2018-04-09 Benedikt Klocker A Model for Finding Sup-Transition-Minors
2018-03-19 Matthias Horn An A* Algorithm for a Prize-Collecting Sequencing Problem
2018-03-12 Marko Djukanovic The Longest Common Palindromic Subsequence Problem - part II
2018-01-22 Martin Riedler An Iterative Refinement Algorithm for (Rooted) Layered Graph Models
2018-01-08 Johannes Maschler Sequencing Jobs with One Common and Multiple Individual Resources with Multivalued Decision Diagrams
2017-12-18 Benedikt Klocker Checking Unique Hamiltonicity
2017-12-11 Matthias Horn Job Sequencing with One Common and Multiple Secondary Resources - Anytime A* Algorithms
2017-12-04 Marko Djukanovic Algorithms for Solving Classical (2D)-LCPS: Some comparisons with $A^*$ approach
2017-11-27 Martin Riedler Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
2017-11-13 Johannes Maschler Particle Therapy Patient Scheduling with Limited Starting Time Variations of Daily Treatments
2017-10-30 Benedikt Klocker A Model for Finding Sup-Transition-Minors
2017-10-23 Matthias Horn Sequencing Jobs with One Common and Multiple Secondary Resources - Part 2
2017-10-16 Marko Djukanovic Exact and Heuristic Search for the Longest Common Palindromic Subsequence Problem
2017-07-10 Martin Riedler Using Layered Graphs to solve the Directed Network Design Problem with Relays (IFORS trial presentation)
2017-06-26 Marko Djukanovic The Longest Common Palindromic Subsequence Problem (LCPS)
2017-06-19 Martin Riedler MedAustron Closing Meeting (trial presentation)
2017-05-22 Johannes Maschler Particle Therapy Patient Scheduling: Ancillary Treatment
2017-05-15 Benedikt Klocker A Model for Checking Transition-Minors
2017-05-08 Matthias Horn Sequencing Jobs with One Common and Multiple Individual Resources
2017-03-27 Christopher Bacher Search for Indexed Algebraic Dynamic Programming
2017-01-30 Martin Riedler PTPSP - Exact Approaches for Time Assignment
2016-12-19 Johannes Maschler Time Estimation for Scheduling Sets of Treatments
2016-12-12 Martin Riedler Using Layered Graphs to solve the Directed Network Design Problem with Relays
2016-12-05 Benedikt Klocker Weighted Set Covering Problem for Cutting Stock Problems with Setup Costs
2016-11-26 Airam Exposito Marquez GRASP and VNS for a periodic VRP with time windows to deal with milk collection problem
2016-11-21 Martin Sturm A model for scheduling and staffing multiple projects with a multi-skilled workforce organized in teams
2016-11-07 Christopher Bacher Extensions for Algebraic Dynamic Programming
2016-10-24 Christian Kloimüllner

 

How-To

  1. Click on the first talk in table, select: Table > Row > Insert before
  2. Enter your data

    For the sake of future archeologists [1] [2] and my sanity, I propose a ISO 8601 date format
    --Christopher

  3. Name your PDF according to this scheme:

phd<YEAR><TERM>_<LASTNAME>_<SHORTTITLE>.pdf (without the <>)

and upload it to our public webdav share, directory files/pub/phd_seminar/

Do NOT upload any PDFs as media in WordPress!

News

  • New FWF ESPRIT Postdocs

    New FWF ESPRIT Postdocs

    2022-11-09
    Leroy Chew and Alexis de Colnet just joined the Algorithms and Complexity group as PIs of their own FWF ESPRIT …Read More »
  • Best student paper award at DIAGRAMS 2022

    Best student paper award at DIAGRAMS 2022

    2022-10-01
    Alexander Dobler received the Best Student Paper Award at the 13th International Conference on the Theory and Application of Diagrams …Read More »
  • Robert Ganian promoted to Associate Professor

    Robert Ganian promoted to Associate Professor

    2022-07-01
    Effective as of today, Robert Ganian is promoted to a tenured Associate Professor at the Algorithms and Complexity group. Congratulations, …Read More »
  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …Read More »

News archive

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