Citations per year, relative to Th. M. Liebling Th. M. Liebling (= 1×)
peers
Thomas M. Liebling
Countries citing papers authored by Th. M. Liebling
Since
Specialization
Citations
This map shows the geographic impact of Th. 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 Th. 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 Th. M. Liebling more than expected).
This network shows the impact of papers produced by Th. 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 Th. M. Liebling. The network helps show where Th. M. Liebling may publish in the future.
Co-authorship network of co-authors of Th. M. Liebling
This figure shows the co-authorship network connecting the top 25 collaborators of Th. M. Liebling.
A scholar is included among the top collaborators of Th. 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 Th. M. Liebling. Th. M. Liebling is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Liebling, Th. M., Denis Naddef, & Laurence A. Wolsey. (2003). The Aussois 2000 workshop in combinatorial optimization. Infoscience (Ecole Polytechnique Fédérale de Lausanne).1 indexed citations
Liebling, Th. M., et al.. (2000). Using Dynamic Triangulations in Distinct Element Simulations. Infoscience (Ecole Polytechnique Fédérale de Lausanne).2 indexed citations
10.
Liebling, Th. M., et al.. (1995). Disjoint Paths in the Plane. INFORMS Journal on Computing. 7(1). 84–88.1 indexed citations
11.
Margot, F., A. Prodon, & Th. M. Liebling. (1994). Tree polytope on 2-trees. Mathematical Programming. 63(1-3). 183–191.22 indexed citations
12.
Liebling, Th. M., et al.. (1992). Nouvelles approches dans la modelisation et simulation de processus de croissance en science des materiaux et en biologie. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 34. 117–138.2 indexed citations
13.
Liebling, Th. M., et al.. (1992). Referee assignment for volleyball championship: A competition between three local search heuristics. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2(3). 199–219.1 indexed citations
14.
Liebling, Th. M., et al.. (1992). Un algoritmo polinomial para el problema de la equipartición sobre un grafo serie-paralelo. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 17(3). 31–36.1 indexed citations
15.
Mocellin, A., et al.. (1989). 2D grain growth viewed as a purely topological phenomenon : models and computational results. Image Analysis & Stereology. 8(2). 453–458.2 indexed citations
16.
Righetti, Francesca, Th. M. Liebling, & A. Mocellin. (1989). The use of large scale potts pseudo-atomic model for 3D grain growth simulation. Image Analysis & Stereology. 8(2). 459–464.3 indexed citations
17.
Liebling, Th. M., et al.. (1988). Simulation of grain growth in 2-Dimensions: influence of the energy expression for the grain boundary network. Infoscience (Ecole Polytechnique Fédérale de Lausanne).1 indexed citations
18.
Liebling, Th. M., et al.. (1988). Infographie et applications. Infoscience (Ecole Polytechnique Fédérale de Lausanne).
19.
Scartezzini, Jean‐Louis, et al.. (1987). Using Markovian stochastic modelling to predict energy performances and thermal comfort of passive solar system. Image Analysis & Stereology. 135–150.1 indexed citations
20.
Liebling, Th. M.. (1973). Routing problems for street cleaning and snow removal. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 363–372.7 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.