Forschungsgebiete

  • Diskrete Mathematik, Strukturelle und Algorithmische Graphentheorie
  • Kombinatorische Optimierung, Effiziente Algorithmen
  • Operations Research, Anwendungen in der Wehrtechnik
  • Routenplanung für unbemannte Luftfahrzeuge

 

Projekte / Drittmittelprojekte

  • Bundesministerium der Verteidigung: Risikoanalysen für den Übungsschussbetrieb der deutschen Marine (2010-2011)
  • MBDA Deutschland GmbH: All Electric Missile (AEM) System Demonstrator - Algorithmen für die Flugwegplanung (2014)
  • MBDA Deutschland GmbH: Konzeption von Planungsalgorithmen für kooperierende UAS (2015-2016)
  • MBDA Deutschland GmbH: Aspekte für den Einsatz von Flugkörpern mit SAL-Suchkopf zur Zielerfassung und Zielverfolgung (2016-2017)

 

Publikationen

Dissertation und Habilitationsschrift

  • Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems, Mathematisches Institut, Technische Universität München, 1990.
  • On the P4-structure of Graphs, Zentrum Mathematik, Technische Universität München, 1997.

 

Zeitschriften und Proceedings

  • A Branch and Bound Algorithm for the Maximum Clique Problem, ZOR-Methods and Models of Operations Research 34 (1990) 207-217 (mit G. Tinhofer).
  • Finding Maximum Cliques in Arbitrary and in Special Graphs, Computing 46 (1991) 321-341.
  • Hard-to-color Graphs for Connected Sequential Colorings, Discrete Applied Mathematics 51 (1994) 3-25 (mit G. Tinhofer).
  • A Fast Algorithm for the Maximum Weight Clique Problem, Computing 52 (1994) 31-38.
  • Directed Path Graph Isomorphism, in: Graph-Theoretic Concepts in Computer Science,
    20th Intern. Workshop, WG'94, Lecture Notes in Computer Science 903, 395-406, 1994 (mit I. Ponomarenko und G. Tinhofer).
  • Isomorphism of Chordal (6,3)-Graphs, Computing 54 (1995) 303-316.
  • On the Isomorphism of Graphs with Few P4s, in: Graph-Theoretic Concepts in Computer
    Science, 21st Intern. Workshop, WG'95, Lecture Notes in Computer Science 1017, 24-36,
    1995 (mit S. Olariu).
  • The Isomorphism Problem for Directed Path Graphs and for Rooted Directed Path Graphs,
    Journal of Algorithms 26 (1996) 542-564 (mit I. Ponomarenko und G. Tinhofer).
  • A New Characterization of P4-connected Graphs, in: Graph-Theoretic Concepts in
    Computer Science, 22nd Intern. Workshop, WG'96, Lecture Notes in Computer Science
    1197, 17-30, 1996 (mit S. Olariu).
  • The k-partitioning Problem, ZOR-Methods and Models of Operations Research 47 (1998)
    59-82 (mit H. Kellerer und V. Kotov).
  • On the Structure of Graphs with Few P4s, Discrete Applied Mathematics 84 (1998) 1-13.
    Auch in: Discrete Applied Mathematics, Editorial Choice 1998 (mit S. Olariu).
  • On the Separable-homogeneous Decomposition of Graphs, in: Graph-Theoretic Concepts
    in Computer Science, 23rd Intern. Workshop, WG'97, Lecture Notes in Computer Science 1335, 25-37 (mit S. Olariu).
  • Tree-like P4-connected Graphs, Discrete Mathematics 191 (1998) 13-23.
  • Domination and Steiner Tree Problems on Graphs with Few P4s, in: Graph-Theoretic
    Concepts in Computer Science, 24th Intern. Workshop, WG'98, Lecture Notes in Computer
    Science 1517, 337-350 (mit S. Olariu).
  • Triangulating Graphs with Few P4s, Discrete Applied Mathematics 89 (1998) 45-57.
  • On the p-connectedness of Graphs - a Survey, Discrete Applied Mathematics 95 (1999)
    11-33. Auch in: Discrete Applied Mathematics, Editorial Choice 1999 (mit S. Olariu).
  • Recognizing the P4-structure of Bipartite Graphs, Discrete Applied Mathematics 93 (1999)
    157-168 (mit A. Brandstädt und V.B. Le).
  • Pseudo-hamiltonian Graphs, Acta Cybernetica 14 (2000) 553-567. Auch in: Graph-
    Theoretic Concepts in Computer Science, 23rd Intern. Workshop, WG' 97, Lecture Notes
    in Computer Science 1335, 38-51, 1997 (mit G. Woeginger).
  • Recognition and Isomorphism of Tree-like P4-connected Graphs, Discrete Applied
    Mathematics 99 (2000) 295-315.
  • Efficient Optimization Algorithms for Graphs with Few P4s, Discrete Mathematics 235
    (2001) 29-51 (mit T. Kloks, J. Kratochvil, D. Kratsch, H. Müller und S. Olariu).
  • On-Line Algorithms for Cardinality Constrained Bin Packing Problems, in: Algorithms and
    Computations, 12th Intern. Symposium, ISAAC 2001, Lecture Notes in Computer Science
    2223, 695-706 (mit B. Chen, H. Kellerer und V. Kotov).
  • Recognizing the P4-structure of Claw-free Graphs and a Larger Graph Class, Discrete
    Mathematics and Theoretical Computer Science 5:1 (2002) 127-146 (mit A. Brandstädt
    und V.B. Le).
  • Design of Tariff Zones in Public Transportation Networks: Theoretical Results and
    Heuristics, ZOR-Mathematical Methods of Operations Research 58 (2003) 359-374
    (mit H. Kellerer).
  • Algorithms for On-line Bin Packing Problems with Cardinality Constraints, Discrete Applied
    Mathematics 143 (2004) 238-251 (mit B. Chen, H. Kellerer und V. Kotov).
  • Trajectory Planning for Unmanned Aerial Vehicles: A Network Optimization Approach, Mathematical Methods of Operations Research 74:3 (2011) 343-360.
  • Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment, Journal of Intelligent and Robotic Systems 71:2 (2013) 255-269.
  • Flight Path Planning for Unmanned Aerial Vehicles with Landmark-based Visual Navigation, Robotics and Autonomous Systems 62:2 (2014) 142-150.
  • Planning Safe Navigation Routes through Mined Waters, European Journal of Operational Reseach 241:1 (2015) 99-108 (mit T. Zimmermann).
  • Curvature-constrained Traveling Salesman Tours for Aerial Surveillance in Scenarios with Obstacles, European Journal of Operational Research 262:1 (2017) 335-346.
  • Coordinated Target Assignment and UAV Path Planning with Timing Constraints, Journal of Intelligent and Robotic Systems (2018). 
  • Flight Path Optimization with Application to In-Flight Replanning to Changing Destinations, to appear (2018).

 

Berichte

  • Connected Sequential Colorings: The Smallest Partially Hard-to-color Graph, Technical Report TUM-M8901 Mathematisches Institut, Technische Universität München, 1989 (mit G. Tinhofer).
  • Heuristic Coloring of Weighted Graphs and the Maximum Weight Clique Problem, Technical
    Report TUM-M9107, 1991.
  • Computational Aspects of Coherent Algebras, Technical Report TUM-M9406, 1994.
  • STABCOL: An Efficient Implementation of the Weisfeiler-Leman Algorithm, Technical
    Report TUM-M9611, 1996 (mit S. Baumann und M. Lüdecke).
  • Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program
    Implementation of the Weisfeiler-Leman Algorithm, Technical Report TUM-M9701, 1997
    (mit I.V. Chuvaeva, M. Klin und D.V. Pasechnik).
  • Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm, Technical Report
    TUM-M9702, 1997 (mit S. Baumann, M. Lüdecke und G. Tinhofer).
  • Traversing and Optimizing Tree-like P4-connected Graphs, Technical Report TUM-M9711,
  • On the P4-structure of Line Graphs, Technical Report TUM-M9807, 1998.
  • On Graphs with Simple P4-structure, Technical Report TUM-M9901, 1999.
  • An Allocation Problem in Cable Manufacturing, Technical Report TUM-M9903
    (mit O. Bastert).
  • UAV Routing with Onboard Replanning Capability to Changing Destinations, 2013.