Luitpold Babel

796 total citations
27 papers, 484 citations indexed

About

Luitpold Babel is a scholar working on Computational Theory and Mathematics, Computer Vision and Pattern Recognition and Aerospace Engineering. According to data from OpenAlex, Luitpold Babel has authored 27 papers receiving a total of 484 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 10 papers in Computer Vision and Pattern Recognition and 9 papers in Aerospace Engineering. Recurrent topics in Luitpold Babel's work include Advanced Graph Theory Research (14 papers), Robotic Path Planning Algorithms (10 papers) and Graph Labeling and Dimension Problems (7 papers). Luitpold Babel is often cited by papers focused on Advanced Graph Theory Research (14 papers), Robotic Path Planning Algorithms (10 papers) and Graph Labeling and Dimension Problems (7 papers). Luitpold Babel collaborates with scholars based in Germany, United States and Austria. Luitpold Babel's co-authors include Stephan Olariu, Hans Kellerer, G. Tinhofer, В. М. Котов, Bo Chen, Thomas Zimmermann, Ilia Ponomarenko, Andreas Brandstädt, Ton Kloks and Van Bang Lê and has published in prestigious journals such as European Journal of Operational Research, Robotics and Autonomous Systems and Discrete Applied Mathematics.

In The Last Decade

Luitpold Babel

27 papers receiving 463 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Luitpold Babel Germany	13	184	146	136	123	122	27	484
Sergio Cabello Slovenia	18	382 2.1×	197 1.3×	116 0.9×	29 0.2×	44 0.4×	75	762
Daniel Leven Israel	8	145 0.8×	356 2.4×	79 0.6×	142 1.2×	62 0.5×	10	694
Sergei Bespamyatnikh Canada	11	68 0.4×	85 0.6×	75 0.6×	25 0.2×	37 0.3×	29	339
Jianghan Zhu China	11	142 0.8×	83 0.6×	290 2.1×	193 1.6×	58 0.5×	40	586
Wolfgang Bein United States	10	80 0.4×	21 0.1×	134 1.0×	30 0.2×	85 0.7×	49	371
Donald K. Wagner United States	9	170 0.9×	29 0.2×	140 1.0×	24 0.2×	64 0.5×	32	403
Sandip Das India	10	72 0.4×	69 0.5×	50 0.4×	20 0.2×	52 0.4×	71	289
Tiziana Calamoneri Italy	14	483 2.6×	89 0.6×	283 2.1×	57 0.5×	34 0.3×	74	773
Christian Icking Germany	14	49 0.3×	203 1.4×	200 1.5×	92 0.7×	28 0.2×	46	501

Countries citing papers authored by Luitpold Babel

Since Specialization

Citations

This map shows the geographic impact of Luitpold Babel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luitpold Babel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luitpold Babel more than expected).

Fields of papers citing papers by Luitpold Babel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luitpold Babel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luitpold Babel. The network helps show where Luitpold Babel may publish in the future.

Co-authorship network of co-authors of Luitpold Babel

This figure shows the co-authorship network connecting the top 25 collaborators of Luitpold Babel. A scholar is included among the top collaborators of Luitpold Babel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Luitpold Babel. Luitpold Babel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Babel, Luitpold. (2023). Coordinated flight path planning for a fleet of missiles in high-risk areas. Robotica. 41(5). 1568–1589. 1 indexed citations

Babel, Luitpold. (2021). Online flight path planning with flight time constraints for fixed-wing UAVs in dynamic environments. 10(4). 416–443. 10 indexed citations

Babel, Luitpold. (2020). New heuristic algorithms for the Dubins traveling salesman problem. Journal of Heuristics. 26(4). 503–530. 12 indexed citations

Babel, Luitpold. (2017). Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles. European Journal of Operational Research. 262(1). 335–346. 32 indexed citations

Babel, Luitpold. (2013). Flight path planning for unmanned aerial vehicles with landmark-based visual navigation. Robotics and Autonomous Systems. 62(2). 142–150. 26 indexed citations

Babel, Luitpold. (2012). Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment. Journal of Intelligent & Robotic Systems. 71(2). 255–269. 28 indexed citations

Babel, Luitpold, Bo Chen, Hans Kellerer, & В. М. Котов. (2004). Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics. 143(1-3). 238–251. 36 indexed citations

Babel, Luitpold & Hans Kellerer. (2003). Design of tariff zones in public transportation networks: theoretical results and heuristics. Mathematical Methods of Operations Research. 58(3). 359–374. 10 indexed citations

Babel, Luitpold, Ton Kloks, Jan Kratochvı́l, et al.. (2001). Efficient algorithms for graphs with few P4's. Discrete Mathematics. 235(1-3). 29–51. 16 indexed citations

10.

Babel, Luitpold. (2000). Recognition and isomorphism of tree-like P4-connected graphs. Discrete Applied Mathematics. 99(1-3). 295–315. 4 indexed citations

11.

Babel, Luitpold & Stephan Olariu. (1999). On the p-connectedness of graphs – a survey. Discrete Applied Mathematics. 95(1-3). 11–33. 15 indexed citations

12.

Babel, Luitpold, Andreas Brandstädt, & Van Bang Lê. (1999). Recognizing the P4-structure of bipartite graphs. Discrete Applied Mathematics. 93(2-3). 157–168. 7 indexed citations

13.

Babel, Luitpold. (1998). Tree-like P4-connected graphs. Discrete Mathematics. 191(1-3). 13–23. 5 indexed citations

14.

Babel, Luitpold & Stephan Olariu. (1998). On the structure of graphs with few P4s. Discrete Applied Mathematics. 84(1-3). 1–13. 33 indexed citations

15.

Babel, Luitpold. (1998). Triangulating graphs with few P4's. Discrete Applied Mathematics. 89(1-3). 45–57. 3 indexed citations

16.

Babel, Luitpold, Hans Kellerer, & В. М. Котов. (1998). Thek-partitioning problem. Mathematical Methods of Operations Research. 47(1). 59–82. 34 indexed citations

17.

Babel, Luitpold, Ilia Ponomarenko, & G. Tinhofer. (1996). The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. Journal of Algorithms. 21(3). 542–564. 12 indexed citations

18.

Babel, Luitpold & G. Tinhofer. (1994). Hard-to-color graphs for connected sequential colorings. Discrete Applied Mathematics. 51(1-2). 3–25. 4 indexed citations

19.

Babel, Luitpold. (1994). A fast algorithm for the maximum weight clique problem. Computing. 52(1). 31–38. 42 indexed citations

20.

Babel, Luitpold & G. Tinhofer. (1990). A branch and bound algorithm for the maximum clique problem. Mathematical Methods of Operations Research. 34(3). 207–217. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact