Thomas M. Liebling

707 total citations
32 papers, 387 citations indexed

About

Thomas M. Liebling is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computational Mechanics. According to data from OpenAlex, Thomas M. Liebling has authored 32 papers receiving a total of 387 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Graphics and Computer-Aided Design, 9 papers in Computational Theory and Mathematics and 7 papers in Computational Mechanics. Recurrent topics in Thomas M. Liebling's work include Computational Geometry and Mesh Generation (11 papers), Advanced Graph Theory Research (6 papers) and Computer Graphics and Visualization Techniques (5 papers). Thomas M. Liebling is often cited by papers focused on Computational Geometry and Mesh Generation (11 papers), Advanced Graph Theory Research (6 papers) and Computer Graphics and Visualization Techniques (5 papers). Thomas M. Liebling collaborates with scholars based in Switzerland, United States and Italy. Thomas M. Liebling's co-authors include Komei Fukuda, Andrea Lodi, Alain Mocellin, François Margot, Lionel Pournin, Martin Vetterli, Gautier Stauffer, J.-F. Pusztaszeri, P. Rensing and Gianpaolo Oriolo and has published in prestigious journals such as European Journal of Operational Research, Mathematical Programming and Philosophical Magazine B.

In The Last Decade

Thomas M. Liebling

30 papers receiving 349 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas M. Liebling Switzerland 12 119 98 71 71 53 32 387
Alberto Paoluzzi Italy 12 59 0.5× 45 0.5× 136 1.9× 181 2.5× 17 0.3× 54 409
Chuck Baker United States 8 147 1.2× 18 0.2× 36 0.5× 15 0.2× 58 1.1× 15 303
A. G. Chent︠s︡ov Russia 13 83 0.7× 269 2.7× 31 0.4× 8 0.1× 61 1.2× 186 741
Sergey Bereg United States 10 97 0.8× 45 0.5× 20 0.3× 161 2.3× 37 0.7× 80 365
Xingsi Li China 9 159 1.3× 12 0.1× 39 0.5× 7 0.1× 34 0.6× 28 347
S.S. Keerthi Singapore 8 49 0.4× 20 0.2× 47 0.7× 9 0.1× 83 1.6× 12 527
Stephen J. Leary United Kingdom 8 331 2.8× 43 0.4× 52 0.7× 4 0.1× 92 1.7× 9 521
Christophe Tribes Canada 13 148 1.2× 17 0.2× 70 1.0× 4 0.1× 78 1.5× 40 393
Carren Holden United Kingdom 9 300 2.5× 22 0.2× 87 1.2× 9 0.1× 114 2.2× 19 445
Dipankar Ghosh United States 5 231 1.9× 46 0.5× 40 0.6× 7 0.1× 52 1.0× 10 383

Countries citing papers authored by Thomas M. Liebling

Since Specialization
Citations

This map shows the geographic impact of Thomas M. Liebling'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 Thomas M. Liebling with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas M. Liebling more than expected).

Fields of papers citing papers by Thomas M. Liebling

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas M. Liebling. 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 Thomas M. Liebling. The network helps show where Thomas M. Liebling may publish in the future.

Co-authorship network of co-authors of Thomas M. Liebling

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas M. Liebling. A scholar is included among the top collaborators of Thomas M. Liebling 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 Thomas M. Liebling. Thomas M. Liebling is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bonomo, Flavia, et al.. (2011). LAGOS 2011 – VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electronic Notes in Discrete Mathematics. 37. 1–2. 1 indexed citations
2.
Durán, Guillermo, Thomas M. Liebling, Martı́n Matamala, & Jayme L. Szwarcfiter. (2010). Traces from LAGOS’07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007. Discrete Applied Mathematics. 158(12). 1213–1215. 1 indexed citations
3.
Pournin, Lionel & Thomas M. Liebling. (2005). A generalization of distinct element method to tridimensional particles with complex shapes. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1375–1378. 21 indexed citations
4.
Liebling, Thomas M., et al.. (2004). On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Mathematical Methods of Operations Research. 59(1). 25–35. 19 indexed citations
5.
Liebling, Thomas M., et al.. (2004). On the Stable Set Polytope of Claw-free and Circulant Graphs. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
6.
Stauffer, Gautier & Thomas M. Liebling. (2004). The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs. Electronic Notes in Discrete Mathematics. 18. 213–218. 1 indexed citations
7.
Bierlaire, Michel, et al.. (2003). Decision-aid Methodology for the School Bus Routing and Scheduling Problem. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 5 indexed citations
8.
Liebling, Thomas M., et al.. (2003). Computational analysis of mesh simplification using global error. Computational Geometry. 25(3). 171–196. 11 indexed citations
9.
Werra, D. de, et al.. (2003). Recherche opérationnelle pour ingénieurs II. 2 indexed citations
10.
Liebling, Thomas M., et al.. (2002). Robust 3D Dynamic Triangulations for Collision Detection in DEM Simulations of Granular Materials. Northern Clinics of Istanbul. 13(1). 41–48. 2 indexed citations
11.
Liebling, Thomas M., et al.. (2001). Computational analysis of 4-8 meshes with application to surface simplification using global error. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 33–36. 4 indexed citations
12.
Fukuda, Komei, et al.. (2000). Extended Convex Hull. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 57–63. 1 indexed citations
13.
Lodi, Andrea, et al.. (1999). An evolutionary heuristic for quadratic 0–1 programming. European Journal of Operational Research. 119(3). 662–670. 59 indexed citations
14.
Liebling, Thomas M., et al.. (1997). Finding minimum area simple pentagons. Operations Research Letters. 21(5). 229–233. 2 indexed citations
15.
Fukuda, Komei, Thomas M. Liebling, & François Margot. (1997). Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Computational Geometry. 8(1). 1–12. 46 indexed citations
16.
Liebling, Thomas M. & D. de Werra. (1997). Lectures on mathematical programming ismp97. Mathematical Programming. 79(1-3). 1–2. 1 indexed citations
17.
Liebling, Thomas M., et al.. (1997). The laguerre model for grain growth in three dimensions. Philosophical Magazine B. 75(4). 567–585. 29 indexed citations
18.
Pusztaszeri, J.-F., P. Rensing, & Thomas M. Liebling. (1996). Tracking elementary particles near their primary vertex: A combinatorial approach. Journal of Global Optimization. 9(1). 41–64. 17 indexed citations
19.
Liebling, Thomas M., et al.. (1981). Connected and alternating vectors: Polyhedra and algorithms. Mathematical Programming. 20(1). 233–244. 8 indexed citations
20.
Liebling, Thomas M.. (1970). Graphentheorie in Planungs- und Tourenproblemen am Beispiel des städtischen Straßendienstes. Springer eBooks. 1 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

Rankless by CCL
2026