P. M. Dearing

569 total citations
24 papers, 391 citations indexed

About

P. M. Dearing is a scholar working on Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, P. M. Dearing has authored 24 papers receiving a total of 391 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Industrial and Manufacturing Engineering, 14 papers in Organizational Behavior and Human Resource Management and 8 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in P. M. Dearing's work include Facility Location and Emergency Management (14 papers), Vehicle Routing Optimization Methods (9 papers) and Computational Geometry and Mesh Generation (8 papers). P. M. Dearing is often cited by papers focused on Facility Location and Emergency Management (14 papers), Vehicle Routing Optimization Methods (9 papers) and Computational Geometry and Mesh Generation (8 papers). P. M. Dearing collaborates with scholars based in United States, Germany and Italy. P. M. Dearing's co-authors include Richard L. Francis, Timothy J. Lowe, Douglas R. Shier, Kathrin Klamroth, Warren P. Adams, H.W. Hamacher, P. L. Hammer, Bruno Simeone, James P. Jarvis and Jeffrey D. Camm and has published in prestigious journals such as Management Science, Operations Research and Computers & Operations Research.

In The Last Decade

P. M. Dearing

23 papers receiving 360 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
P. M. Dearing United States	12	268	216	80	76	69	24	391
Elisabeth Gassner Austria	11	203 0.8×	109 0.5×	102 1.3×	106 1.4×	70 1.0×	20	283
Yoram J. Sussmann United States	7	80 0.3×	90 0.4×	64 0.8×	32 0.4×	135 2.0×	7	258
B. Dasarathy United States	10	44 0.2×	39 0.2×	140 1.8×	13 0.2×	118 1.7×	16	356
Marc Demange France	12	18 0.1×	133 0.6×	238 3.0×	54 0.7×	124 1.8×	58	403
Kavindra Malik United States	6	37 0.1×	150 0.7×	116 1.4×	11 0.1×	121 1.8×	11	372
Chenchen Wu China	8	98 0.4×	121 0.6×	44 0.6×	12 0.2×	97 1.4×	53	230
Nir Halman Israel	9	20 0.1×	129 0.6×	53 0.7×	22 0.3×	98 1.4×	35	290
Zachary Friggstad Canada	9	36 0.1×	67 0.3×	63 0.8×	8 0.1×	96 1.4×	30	247
Manoel Campêlo Brazil	9	17 0.1×	101 0.5×	147 1.8×	7 0.1×	29 0.4×	34	253
Simone L. Martins Brazil	9	20 0.1×	167 0.8×	47 0.6×	9 0.1×	46 0.7×	14	255

Countries citing papers authored by P. M. Dearing

Since Specialization

Citations

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

Fields of papers citing papers by P. M. Dearing

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of P. M. Dearing

This figure shows the co-authorship network connecting the top 25 collaborators of P. M. Dearing. A scholar is included among the top collaborators of P. M. Dearing 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 P. M. Dearing. P. M. Dearing 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

Dearing, P. M., et al.. (2015). A primal algorithm for the weighted minimum covering ball problem in $$\mathbb {R}^n$$ R n. Top. 24(2). 466–492. 2 indexed citations

Dearing, P. M., et al.. (2011). A dual algorithm for the minimum covering weighted ball problem in $${\mathbb{R}^n}$$. Journal of Global Optimization. 55(2). 261–278. 1 indexed citations

Dearing, P. M., et al.. (2009). A dual algorithm for the minimum covering ball problem in. Operations Research Letters. 37(3). 171–175. 8 indexed citations

Dearing, P. M., et al.. (2006). One-Center Location With Block and Euclidean Distance. Journal of Research of the National Institute of Standards and Technology. 111(2). 89–89. 1 indexed citations

Dearing, P. M., et al.. (2005). Planar Location Problems with Block Distance and Barriers. Annals of Operations Research. 136(1). 117–143. 23 indexed citations

Dearing, P. M., H.W. Hamacher, & Kathrin Klamroth. (2002). Dominating sets for rectilinear center location problems with polyhedral barriers. Naval Research Logistics (NRL). 49(7). 647–665. 25 indexed citations

Dearing, P. M., et al.. (2002). Solving Rectilinear Planar Location Problems with Barriers by a Polynomial Partitioning. Annals of Operations Research. 111(1-4). 111–133. 17 indexed citations

Dearing, P. M., et al.. (2002). An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers. Annals of Operations Research. 111(1-4). 89–110. 20 indexed citations

Dearing, P. M., et al.. (1999). Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers. Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology). 2 indexed citations

10.

Adams, Warren P. & P. M. Dearing. (1994). On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems. Discrete Applied Mathematics. 48(1). 1–20. 20 indexed citations

11.

Dearing, P. M., et al.. (1993). Neighborhood subtree tolerance graphs. Discrete Applied Mathematics. 43(1). 13–26. 10 indexed citations

12.

Dearing, P. M., P. L. Hammer, & Bruno Simeone. (1992). Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem. Transportation Science. 26(2). 138–148. 11 indexed citations

13.

Dearing, P. M., et al.. (1988). Maximal chordal subgraphs. Discrete Applied Mathematics. 20(3). 181–190. 16 indexed citations

14.

Camm, Jeffrey D., P. M. Dearing, & Suresh K. Tadisina. (1987). The Calhoun Textile Mill Case: An Exercise on the Significance of Linear Programming Model Formulation. IIE Transactions. 19(1). 23–28. 4 indexed citations

15.

Dearing, P. M.. (1985). Location problems. Operations Research Letters. 4(3). 95–98. 14 indexed citations

16.

Shier, Douglas R. & P. M. Dearing. (1983). Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network. Operations Research. 31(2). 292–303. 25 indexed citations

17.

Dearing, P. M. & James P. Jarvis. (1978). A location model with queueing constraints. Computers & Operations Research. 5(4). 273–277. 3 indexed citations

18.

Dearing, P. M., Richard L. Francis, & Timothy J. Lowe. (1976). Convex Location Problems on Tree Networks. Operations Research. 24(4). 628–642. 77 indexed citations

19.

Dearing, P. M. & Richard L. Francis. (1974). A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances. Transportation Science. 8(2). 126–141. 34 indexed citations

20.

Dearing, P. M. & Richard L. Francis. (1974). A Minimax Location Problem on a Network. Transportation Science. 8(4). 333–343. 52 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