Luitpold Babel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2023

Coordinated flight path planning for a fleet of missiles in high-risk areasLuitpold Babel. robotica, 41(5):1568-1589, May 2023. [doi]

2020

New heuristic algorithms for the Dubins traveling salesman problemLuitpold Babel. heuristics, 26(4):503-530, 2020. [doi]

2019

Coordinated Target Assignment and UAV Path Planning with Timing ConstraintsLuitpold Babel. jirs, 94(3-4):857-869, 2019. [doi]

2017

Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstaclesLuitpold Babel. eor, 262(1):335-346, 2017. [doi]

2015

Planning safe navigation routes through mined watersLuitpold Babel, Thomas Zimmermann. eor, 241(1):99-108, 2015. [doi]

2014

Flight path planning for unmanned aerial vehicles with landmark-based visual navigationLuitpold Babel. ras, 62(2):142-150, 2014. [doi]

2013

Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk EnvironmentLuitpold Babel. jirs, 71(2):255-269, 2013. [doi]

2011

Trajectory planning for unmanned aerial vehicles: a network optimization approachLuitpold Babel. mmor, 74(3):343-360, 2011. [doi]

2004

Algorithms for on-line bin-packing problems with cardinality constraintsLuitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov. DAM, 143(1-3):238-251, 2004. [doi]

2003

Design of tariff zones in public transportation networks: theoretical results and heuristicsLuitpold Babel, Hans Kellerer. mmor, 58(3):359-374, 2003. [doi]

2002

Recognizing the P::4::-structure of claw-free graphs and a larger graph classLuitpold Babel, Andreas Brandstädt, Van Bang Le. dmtcs, 5(1):127-146, 2002. [doi]

2001

Efficient algorithms for graphs with few ::::P::::::4:: sLuitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu. DM, 235(1-3):29-51, 2001. [doi]

On-Line Algorithms for Cardinality Constrained Bin Packing ProblemsLuitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov. isaac 2001: 695-706 [doi]

2000

Recognition and Isomorphism of Tree-like P::4::-connected GraphsLuitpold Babel. DAM, 99(1-3):295-315, 2000. [doi]

Pseudo-Hamiltonian GraphsLuitpold Babel, Gerhard J. Woeginger. actaC, 14(4):553-567, 2000. [doi]

1999

On the p-connectedness of Graphs - A SurveyLuitpold Babel, Stephan Olariu. DAM, 95(1-3):11-33, 1999. [doi]

Recognizing the P::4::-structure of Bipartite GraphsLuitpold Babel, Andreas Brandstädt, Van Bang Le. DAM, 93(2-3):157-168, 1999. [doi]

1998

Tree-like P::4::-connected graphsLuitpold Babel. DM, 191(1-3):13-23, 1998. [doi]

Triangulating Graphs with Few P::4:: sLuitpold Babel. DAM, 89(1-3):45-57, 1998. [doi]

k-partitioning problemLuitpold Babel, Hans Kellerer, Vladimir Kotov. mmor, 47(1):59-82, 1998. [doi]

Domination and Steiner Tree Problems on Graphs with Few P4SLuitpold Babel, Stephan Olariu. criwg 1998: 337-350

On the Structure of Graphs with Few P::4::sLuitpold Babel, Stephan Olariu. DAM, 84(1-3):1-13, 1998. [doi]

1997

Pseudo-Hamiltonian GraphsLuitpold Babel, Gerhard J. Woeginger. criwg 1997: 38-51

On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract)Luitpold Babel, Stephan Olariu. criwg 1997: 25-37

1996

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path GraphsLuitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. jal, 21(3):542-564, 1996.

A New Characterization of P4-connected GraphsLuitpold Babel, Stephan Olariu. criwg 1997: 17-30

1995

Isomorphism of Chordal (6, 3) GraphsLuitpold Babel. computing, 54(4):303-316, 1995. [doi]

On the Isomorphism of Graphs with Few P4sLuitpold Babel, Stephan Olariu. criwg 1995: 24-36

1994

Direct Path Graph Isomorphism (Extended Abstract)Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer. criwg 1995: 395-406

Hard-to-color Graphs for Connected Sequential ColoringsLuitpold Babel, Gottfried Tinhofer. DAM, 51(1-2):3-25, 1994. [doi]

A fast algorithm for the maximum weight clique problemLuitpold Babel. computing, 52(1):31-38, 1994. [doi]

1991

Finding maximum cliques in arbitrary and in special graphsLuitpold Babel. computing, 46(4):321-341, 1991. [doi]

1990

A branch and bound algorithm for the maximum clique problemLuitpold Babel, Gottfried Tinhofer. mmor, 34(3):207-217, 1990. [doi]

Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-ProblemsLuitpold Babel. PhD thesis, Technical University Munich, Germany, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL