Luitpold Babel

36 papers B 7Journal 28
YearRankTypeTitle / Venue / Authors
2023 J jnl
Coordinated flight path planning for a fleet of missiles in high-risk areas.
Robotica
Luitpold Babel
2020 J jnl
New heuristic algorithms for the Dubins traveling salesman problem.
J. Heuristics
Luitpold Babel
2019 J jnl
Coordinated Target Assignment and UAV Path Planning with Timing Constraints.
J. Intell. Robotic Syst.
Luitpold Babel
2017 J jnl
Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles.
Eur. J. Oper. Res.
Luitpold Babel
2015 J jnl
Planning safe navigation routes through mined waters.
Eur. J. Oper. Res.
Luitpold Babel, Thomas Zimmermann
2014 J jnl
Flight path planning for unmanned aerial vehicles with landmark-based visual navigation.
Robotics Auton. Syst.
Luitpold Babel
2013 J jnl
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment.
J. Intell. Robotic Syst.
Luitpold Babel
2011 J jnl
Trajectory planning for unmanned aerial vehicles: a network optimization approach.
Math. Methods Oper. Res.
Luitpold Babel
2004 J jnl
Algorithms for on-line bin-packing problems with cardinality constraints.
Discret. Appl. Math.
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
2003 J jnl
Design of tariff zones in public transportation networks: theoretical results and heuristics.
Math. Methods Oper. Res.
Luitpold Babel, Hans Kellerer
2002 J jnl
Recognizing the P
Discret. Math. Theor. Comput. Sci.
Luitpold Babel, Andreas Brandstädt, Van Bang Le
2001 J jnl
Efficient algorithms for graphs with few
Discret. Math.
Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
2001 B conf
On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
ISAAC
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
2000 J jnl
Pseudo-Hamiltonian Graphs.
Acta Cybern.
Luitpold Babel, Gerhard J. Woeginger
2000 J jnl
Recognition and Isomorphism of Tree-like P
Discret. Appl. Math.
Luitpold Babel
1999 J jnl
On the p-connectedness of Graphs - A Survey.
Discret. Appl. Math.
Luitpold Babel, Stephan Olariu
1999 J jnl
Recognizing the P
Discret. Appl. Math.
Luitpold Babel, Andreas Brandstädt, Van Bang Le
1998 B conf
Domination and Steiner Tree Problems on Graphs with Few P4S.
WG
Luitpold Babel, Stephan Olariu
1998 J jnl
On the Structure of Graphs with Few P
Discret. Appl. Math.
Luitpold Babel, Stephan Olariu
1998 J jnl
The
Math. Methods Oper. Res.
Luitpold Babel, Hans Kellerer, Vladimir Kotov
1998 J jnl
Tree-like P
Discret. Math.
Luitpold Babel
1998 J jnl
Triangulating Graphs with Few P
Discret. Appl. Math.
Luitpold Babel
1997 B conf
On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract).
WG
Luitpold Babel, Stephan Olariu
1997 B conf
Pseudo-Hamiltonian Graphs.
WG
Luitpold Babel, Gerhard J. Woeginger
1996 B conf
A New Characterization of P4-connected Graphs.
WG
Luitpold Babel, Stephan Olariu
1996 J jnl
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs.
J. Algorithms
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
1995 J jnl
Isomorphism of Chordal (6, 3) Graphs.
Computing
Luitpold Babel
1995 B conf
On the Isomorphism of Graphs with Few P4s.
WG
Luitpold Babel, Stephan Olariu
1994 J jnl
A fast algorithm for the maximum weight clique problem.
Computing
Luitpold Babel
1994 B conf
Direct Path Graph Isomorphism (Extended Abstract).
WG
Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer
1994 J jnl
Hard-to-color Graphs for Connected Sequential Colorings.
Discret. Appl. Math.
Luitpold Babel, Gottfried Tinhofer
1991 J jnl
Finding maximum cliques in arbitrary and in special graphs.
Computing
Luitpold Babel
1991 J jnl
Heuristic coloring of weighted graphs and the maximum weight clique problem
Forschungsberichte, TU Munich
Luitpold Babel
1990 J jnl
A branch and bound algorithm for the maximum clique problem.
ZOR Methods Model. Oper. Res.
Luitpold Babel, Gottfried Tinhofer
1990 — —
Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems.
Luitpold Babel
1990 J jnl
Finding maximum cliques in arbitrary and in special graphs
Forschungsberichte, TU Munich
Luitpold Babel