Luitpold Babel

ORCID

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 5

Top Venues

J. Intell. Robotic Syst.

Eur. J. Oper. Res.

Robotics Auton. Syst.

J. Heuristics

Technical University Munich, Germany (PHD)

Education History

Technical University Munich, Germany

PHD

Publications

Luitpold Babel
Coordinated flight path planning for a fleet of missiles in high-risk areas. Robotica 41 (5) (2023)
Luitpold Babel
New heuristic algorithms for the Dubins traveling salesman problem. J. Heuristics 26 (4) (2020)
Luitpold Babel
Coordinated Target Assignment and UAV Path Planning with Timing Constraints. J. Intell. Robotic Syst. 94 (3-4) (2019)
Luitpold Babel
Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles. Eur. J. Oper. Res. 262 (1) (2017)
Luitpold Babel, Thomas Zimmermann
Planning safe navigation routes through mined waters. Eur. J. Oper. Res. 241 (1) (2015)
Luitpold Babel
Flight path planning for unmanned aerial vehicles with landmark-based visual navigation. Robotics Auton. Syst. 62 (2) (2014)
Luitpold Babel
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment. J. Intell. Robotic Syst. 71 (2) (2013)
Luitpold Babel
Trajectory planning for unmanned aerial vehicles: a network optimization approach. Math. Methods Oper. Res. 74 (3) (2011)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143 (1-3) (2004)
Luitpold Babel, Hans Kellerer
Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Methods Oper. Res. 58 (3) (2003)
Luitpold Babel, Andreas Brandstädt, Van Bang Le
-structure of claw-free graphs and a larger graph class. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
's. Discret. Math. 235 (1-3) (2001)
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC (2001)
Luitpold Babel
-connected Graphs. Discret. Appl. Math. 99 (1-3) (2000)
Luitpold Babel, Gerhard J. Woeginger
Pseudo-Hamiltonian Graphs. Acta Cybern. 14 (4) (2000)
Luitpold Babel, Andreas Brandstädt, Van Bang Le
-structure of Bipartite Graphs. Discret. Appl. Math. 93 (2-3) (1999)
Luitpold Babel, Stephan Olariu
On the p-connectedness of Graphs - A Survey. Discret. Appl. Math. 95 (1-3) (1999)
Luitpold Babel
's. Discret. Appl. Math. 89 (1-3) (1998)
Luitpold Babel, Stephan Olariu
Domination and Steiner Tree Problems on Graphs with Few P4S. WG (1998)
Luitpold Babel, Hans Kellerer, Vladimir Kotov
-partitioning problem. Math. Methods Oper. Res. 47 (1) (1998)
Luitpold Babel, Stephan Olariu
s. Discret. Appl. Math. 84 (1-3) (1998)
Luitpold Babel
-connected graphs. Discret. Math. 191 (1-3) (1998)
Luitpold Babel, Gerhard J. Woeginger
Pseudo-Hamiltonian Graphs. WG (1997)
Luitpold Babel, Stephan Olariu
On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). WG (1997)
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21 (3) (1996)
Luitpold Babel, Stephan Olariu
A New Characterization of P4-connected Graphs. WG (1996)
Luitpold Babel
Isomorphism of Chordal (6, 3) Graphs. Computing 54 (4) (1995)
Luitpold Babel, Stephan Olariu
On the Isomorphism of Graphs with Few P4s. WG (1995)
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
Direct Path Graph Isomorphism (Extended Abstract). WG (1994)
Luitpold Babel
A fast algorithm for the maximum weight clique problem. Computing 52 (1) (1994)
Luitpold Babel, Gottfried Tinhofer
Hard-to-color Graphs for Connected Sequential Colorings. Discret. Appl. Math. 51 (1-2) (1994)
Luitpold Babel
Heuristic coloring of weighted graphs and the maximum weight clique problem Forschungsberichte, TU Munich (1991)
Luitpold Babel
Finding maximum cliques in arbitrary and in special graphs. Computing 46 (4) (1991)
Luitpold Babel
Finding maximum cliques in arbitrary and in special graphs Forschungsberichte, TU Munich (1990)
Luitpold Babel, Gottfried Tinhofer
A branch and bound algorithm for the maximum clique problem. ZOR Methods Model. Oper. Res. 34 (3) (1990)

Luitpold Babel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Luitpold Babel