default search action
Luitpold Babel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Luitpold Babel
:
Coordinated flight path planning for a fleet of missiles in high-risk areas. Robotica 41(5): 1568-1589 (2023) - 2020
- [j25]Luitpold Babel
New heuristic algorithms for the Dubins traveling salesman problem. J. Heuristics 26(4): 503-530 (2020)
2010 – 2019
- 2019
- [j24]Luitpold Babel
Coordinated Target Assignment and UAV Path Planning with Timing Constraints. J. Intell. Robotic Syst. 94(3-4): 857-869 (2019) - 2017
- [j23]Luitpold Babel:
Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles. Eur. J. Oper. Res. 262(1): 335-346 (2017) - 2015
- [j22]Luitpold Babel, Thomas Zimmermann:
Planning safe navigation routes through mined waters. Eur. J. Oper. Res. 241(1): 99-108 (2015) - 2014
- [j21]Luitpold Babel:
Flight path planning for unmanned aerial vehicles with landmark-based visual navigation. Robotics Auton. Syst. 62(2): 142-150 (2014) - 2013
- [j20]Luitpold Babel:
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment. J. Intell. Robotic Syst. 71(2): 255-269 (2013) - 2011
- [j19]Luitpold Babel:
Trajectory planning for unmanned aerial vehicles: a network optimization approach. Math. Methods Oper. Res. 74(3): 343-360 (2011)
2000 – 2009
- 2004
- [j18]Luitpold Babel, Bo Chen
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143(1-3): 238-251 (2004) - 2003
- [j17]Luitpold Babel, Hans Kellerer:
Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Methods Oper. Res. 58(3): 359-374 (2003) - 2002
- [j16]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of claw-free graphs and a larger graph class. Discret. Math. Theor. Comput. Sci. 5(1): 127-146 (2002) - 2001
- [j15]Luitpold Babel, Ton Kloks, Jan Kratochvíl
Efficient algorithms for graphs with few P4's. Discret. Math. 235(1-3): 29-51 (2001) - [c7]Luitpold Babel, Bo Chen
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706 - 2000
- [j14]Luitpold Babel, Gerhard J. Woeginger:
Pseudo-Hamiltonian Graphs. Acta Cybern. 14(4): 553-567 (2000) - [j13]Luitpold Babel:
Recognition and Isomorphism of Tree-like P4-connected Graphs. Discret. Appl. Math. 99(1-3): 295-315 (2000)
1990 – 1999
- 1999
- [j12]Luitpold Babel, Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Bipartite Graphs. Discret. Appl. Math. 93(2-3): 157-168 (1999) - [j11]Luitpold Babel, Stephan Olariu:
On the p-connectedness of Graphs - A Survey. Discret. Appl. Math. 95(1-3): 11-33 (1999) - 1998
- [j10]Luitpold Babel, Stephan Olariu:
On the Structure of Graphs with Few P4s. Discret. Appl. Math. 84(1-3): 1-13 (1998) - [j9]Luitpold Babel:
Triangulating Graphs with Few P4's. Discret. Appl. Math. 89(1-3): 45-57 (1998) - [j8]Luitpold Babel:
Tree-like P4-connected graphs. Discret. Math. 191(1-3): 13-23 (1998) - [j7]Luitpold Babel, Hans Kellerer, Vladimir Kotov
Thek-partitioning problem. Math. Methods Oper. Res. 47(1): 59-82 (1998) - [c6]Luitpold Babel, Stephan Olariu:
Domination and Steiner Tree Problems on Graphs with Few P4S. WG 1998: 337-350 - 1997
- [c5]Luitpold Babel, Stephan Olariu:
On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). WG 1997: 25-37 - [c4]Luitpold Babel, Gerhard J. Woeginger:
Pseudo-Hamiltonian Graphs. WG 1997: 38-51 - 1996
- [j6]Luitpold Babel, Ilia N. Ponomarenko
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. J. Algorithms 21(3): 542-564 (1996) - [c3]Luitpold Babel, Stephan Olariu:
A New Characterization of P4-connected Graphs. WG 1996: 17-30 - 1995
- [j5]Luitpold Babel:
Isomorphism of Chordal (6, 3) Graphs. Computing 54(4): 303-316 (1995) - [c2]Luitpold Babel, Stephan Olariu:
On the Isomorphism of Graphs with Few P4s. WG 1995: 24-36 - 1994
- [j4]Luitpold Babel:
A fast algorithm for the maximum weight clique problem. Computing 52(1): 31-38 (1994) - [j3]Luitpold Babel, Gottfried Tinhofer:
Hard-to-color Graphs for Connected Sequential Colorings. Discret. Appl. Math. 51(1-2): 3-25 (1994) - [c1]Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
Direct Path Graph Isomorphism (Extended Abstract). WG 1994: 395-406 - 1991
- [j2]Luitpold Babel:
Finding maximum cliques in arbitrary and in special graphs. Computing 46(4): 321-341 (1991) - [i2]Luitpold Babel:
Heuristic coloring of weighted graphs and the maximum weight clique problem. Forschungsberichte, TU Munich TUM M 9107: 1-21 (1991) - 1990
- [b1]Luitpold Babel:
Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems. Technical University Munich, Germany, 1990, pp. 1-114 - [j1]Luitpold Babel, Gottfried Tinhofer:
A branch and bound algorithm for the maximum clique problem. ZOR Methods Model. Oper. Res. 34(3): 207-217 (1990) - [i1]Luitpold Babel:
Finding maximum cliques in arbitrary and in special graphs. Forschungsberichte, TU Munich TUM M 9008: 1-28 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: