Luitpold Babel

According to our database, Luitpold Babel authored at least 34 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Coordinated flight path planning for a fleet of missiles in high-risk areas.

Luitpold Babel

Robotica, May, 2023

2020

New heuristic algorithms for the Dubins traveling salesman problem.

Luitpold Babel

J. Heuristics, 2020

2019

Coordinated Target Assignment and UAV Path Planning with Timing Constraints.

Luitpold Babel

J. Intell. Robotic Syst., 2019

2017

Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles.

Luitpold Babel

Eur. J. Oper. Res., 2017

2015

Planning safe navigation routes through mined waters.

Luitpold Babel, Thomas Zimmermann

Eur. J. Oper. Res., 2015

2014

Flight path planning for unmanned aerial vehicles with landmark-based visual navigation.

Luitpold Babel

Robotics Auton. Syst., 2014

2013

Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment.

Luitpold Babel

J. Intell. Robotic Syst., 2013

2011

Trajectory planning for unmanned aerial vehicles: a network optimization approach.

Luitpold Babel

Math. Methods Oper. Res., 2011

2004

Algorithms for on-line bin-packing problems with cardinality constraints.

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov

Discret. Appl. Math., 2004

2003

Design of tariff zones in public transportation networks: theoretical results and heuristics.

Luitpold Babel, Hans Kellerer

Math. Methods Oper. Res., 2003

2002

Recognizing the P₄-structure of claw-free graphs and a larger graph class.

Luitpold Babel, Andreas Brandstädt, Van Bang Le

Discret. Math. Theor. Comput. Sci., 2002

2001

Efficient algorithms for graphs with few <i>P</i>₄'s.

Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu

Discret. Math., 2001

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Recognition and Isomorphism of Tree-like P₄-connected Graphs.

Luitpold Babel

Discret. Appl. Math., 2000

Pseudo-Hamiltonian Graphs.

Luitpold Babel, Gerhard J. Woeginger

Acta Cybern., 2000

1999

On the p-connectedness of Graphs - A Survey.

Luitpold Babel, Stephan Olariu

Discret. Appl. Math., 1999

Recognizing the P₄-structure of Bipartite Graphs.

Luitpold Babel, Andreas Brandstädt, Van Bang Le

Discret. Appl. Math., 1999

1998

The<i>k</i>-partitioning problem.

Luitpold Babel, Hans Kellerer, Vladimir Kotov

Math. Methods Oper. Res., 1998

Tree-like P₄-connected graphs.

Luitpold Babel

Discret. Math., 1998

On the Structure of Graphs with Few P₄s.

Luitpold Babel, Stephan Olariu

Discret. Appl. Math., 1998

Triangulating Graphs with Few P₄'s.

Luitpold Babel

Discret. Appl. Math., 1998

Domination and Steiner Tree Problems on Graphs with Few P4S.

Luitpold Babel, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract).

Luitpold Babel, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs.

Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer

J. Algorithms, 1996

A New Characterization of P4-connected Graphs.

Luitpold Babel, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995

Isomorphism of Chordal (6, 3) Graphs.

Luitpold Babel

Computing, 1995

On the Isomorphism of Graphs with Few P4s.

Luitpold Babel, Stephan Olariu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

Hard-to-color Graphs for Connected Sequential Colorings.

Luitpold Babel, Gottfried Tinhofer

Discret. Appl. Math., 1994

A fast algorithm for the maximum weight clique problem.

Luitpold Babel

Computing, 1994

Direct Path Graph Isomorphism (Extended Abstract).

Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1991

Heuristic coloring of weighted graphs and the maximum weight clique problem

Luitpold Babel

Forschungsberichte, TU Munich, 1991

Finding maximum cliques in arbitrary and in special graphs.

Luitpold Babel

Computing, 1991

1990

Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems.

Luitpold Babel

PhD thesis, 1990

A branch and bound algorithm for the maximum clique problem.

Luitpold Babel, Gottfried Tinhofer

ZOR Methods Model. Oper. Res., 1990