Sprungmarken

Servicenavigation

Fakultät für Mathematik

Hauptnavigation



Sie sind hier:

Bereichsnavigation



Hauptinhalt

Dr. Moritz Mühlenthaler

Kontakt

Technische Universität Dortmund
Fakultät für Mathematik
Vogelpothsweg 87
44227 Dortmund
Germany

Email: Moritz Mühlenthaler

Telefon: (0231) 755-7226
Raum: M/520

Interessengebiete

  • kombinatorische Optimierung
  • Rekonfigurationsprobleme
  • Analyse von Algorithmen

Lehre

Sommersemester 2017

Wintersemester 2016/17


Veröffentlichungen

  • Mühlenthaler, M.; Raß, A.; Schmitt, M.; Siegling, A.; Wanka, R.:
    Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax;
    Proc. 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA), pp. 13-24, 2017.
    [doi:10.1145/3040718.3040721]
  • Mühlenthaler, M.
    Degree-constrained Subgraph Reconfiguration is in P;
    Proc. 40th Int. Symp. on Mathematical Foundations of Computer Science, pp 505-516, 2015.
    [doi:10.1007/978-3-662-48054-0_42, full version]
  • Mühlenthaler, M.:
    Fairness in Academic Course Timetabling;
    Lecture Notes in Economics and Mathematical Systems, Volume 678, 2015, (dissertation)
    [doi:10.1007/978-3-319-12799-6]
  • Mühlenthaler, M. ; Wanka, R.:
    The Connectedness of Clash-free Timetables;
    in: Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), pp. 330-346, 2014. (full version)
  • Mühlenthaler, M. ; Wanka, R.:
    Fairness in Academic Course Timetabling;
    Annals of Operations Research, 2014. (preprint; full version of the PATAT 2012 paper)
    [doi:10.1007/s10479-014-1553-2]
  • Mühlenthaler, M. ; Wanka, R.:
    A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem: The Impact of Solving Subproblems to Optimality;
    in: Proc. 6th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA), 2013,
    full version (revised)
  • Mühlenthaler, M. ; Wanka, R.:
    Fairness in Academic Course Timetabling;
    in: Proc. 9th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), pp. 114-130, 2012.
  • Hoffmann, M.; Mühlenthaler, M.; Helwig, S.; Wanka, R.:
    Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations.
    in: Proc. International Conference on Adaptive and Intelligent Systems (ICAIS); pp. 416-427, 2011.
    [doi:10.1007/978-3-642-23857-4_40]
  • Omeltschuk, L.; Helwig, S.; Mühlenthaler, M.; Wanka, R.:
    Heterogeneous Constraint Handling for Particle Swarm Optimization;
    Proc. IEEE Swarm Intelligence Symposium (SIS), pp. 37-43, 2011.
    [doi:10.1109/SIS.2011.5952578]
  • Mühlenthaler, M. ; Wanka, R.:
    A Novel Event Insertion Heuristic for Finding Feasible Solutions of Course Timetabling Problems;
    in: Proc. 8th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) 2010, pp. 294-304. [pdf,conference proceedings]
  • Mühlenthaler, M. ; Wanka, R.:
    Improving Bitonic Sorting by Wire Elimination;
    in: Proc. 23rd PARS-Workshop on Parallel Systems and Architectures of the 23rd Int. Conf. on Architecture of Computing Systems (ARCS); pp. 15--22, 2010. [pdf]