B. Jamison

576 total citations
11 papers, 350 citations indexed

About

B. Jamison is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, B. Jamison has authored 11 papers receiving a total of 350 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 2 papers in Electrical and Electronic Engineering. Recurrent topics in B. Jamison's work include Advanced Graph Theory Research (10 papers), Interconnection Networks and Systems (7 papers) and Graph Labeling and Dimension Problems (5 papers). B. Jamison is often cited by papers focused on Advanced Graph Theory Research (10 papers), Interconnection Networks and Systems (7 papers) and Graph Labeling and Dimension Problems (5 papers). B. Jamison collaborates with scholars based in United States and Ghana. B. Jamison's co-authors include Stephan Olariu and Hussein Abdel‐Wahab and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

B. Jamison

11 papers receiving 324 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
B. Jamison United States	9	341	90	87	69	52	11	350
John Frederick Fink United States	8	379 1.1×	118 1.3×	74 0.9×	118 1.7×	40 0.8×	15	418
Vassilis Giakoumakis France	11	284 0.8×	58 0.6×	119 1.4×	55 0.8×	42 0.8×	21	294
William Staton United States	8	230 0.7×	32 0.4×	146 1.7×	125 1.8×	35 0.7×	26	261
Garry L. Johns United States	7	423 1.2×	71 0.8×	167 1.9×	146 2.1×	53 1.0×	13	456
Bert Gerards Netherlands	11	229 0.7×	60 0.7×	80 0.9×	37 0.5×	65 1.3×	19	248
Reza Naserasr France	10	224 0.7×	29 0.3×	98 1.1×	59 0.9×	57 1.1×	45	260
Stanley Fiorini United Kingdom	8	280 0.8×	31 0.3×	125 1.4×	131 1.9×	77 1.5×	26	329
Alexandre Pinlou France	10	229 0.7×	32 0.4×	108 1.2×	40 0.6×	36 0.7×	38	245
Lael F. Kinch United States	7	249 0.7×	54 0.6×	39 0.4×	99 1.4×	23 0.4×	10	278
E. S. Mahmoodian Iran	8	181 0.5×	22 0.2×	70 0.8×	70 1.0×	124 2.4×	45	259

Countries citing papers authored by B. Jamison

Since Specialization

Citations

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

Fields of papers citing papers by B. Jamison

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of B. Jamison

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

11 of 11 papers shown

1.

Jamison, B. & Stephan Olariu. (1995). Linear time optimization algorithms for P4-sparse graphs. Discrete Applied Mathematics. 61(2). 155–175. 24 indexed citations

2.

Jamison, B. & Stephan Olariu. (1995). A linear-time recognition algorithm for P4-reducible graphs. Theoretical Computer Science. 145(1-2). 329–344. 11 indexed citations

3.

Jamison, B. & Stephan Olariu. (1995). P-Components and the Homogeneous Decomposition of Graphs. SIAM Journal on Discrete Mathematics. 8(3). 448–463. 43 indexed citations

4.

Jamison, B. & Stephan Olariu. (1992). A tree representation for P4-sparse graphs. Discrete Applied Mathematics. 35(2). 115–129. 81 indexed citations

5.

Jamison, B. & Stephan Olariu. (1992). Recognizing $P_4 $-Sparse Graphs in Linear Time. SIAM Journal on Computing. 21(2). 381–406. 42 indexed citations

6.

Jamison, B. & Stephan Olariu. (1991). On a unique tree representation for P4-extendible graphs. Discrete Applied Mathematics. 34(1-3). 151–164. 31 indexed citations

7.

Abdel‐Wahab, Hussein & B. Jamison. (1989). The Role of Linkage-Graphs in Prolog Relational Datenbases.. International Conference on Management of Data. 18. 43–53. 1 indexed citations

8.

Jamison, B. & Stephan Olariu. (1989). P₄‐Reducible Graphs—Class of Uniquely Tree‐Representable Graphs. Studies in Applied Mathematics. 81(1). 79–87. 45 indexed citations

9.

Jamison, B. & Stephan Olariu. (1989). A New Class of Brittle Graphs. Studies in Applied Mathematics. 81(1). 89–92. 32 indexed citations

10.

Jamison, B. & Stephan Olariu. (1989). On a Class of P₅‐Free Graphs. Studies in Applied Mathematics. 81(1). 33–39. 4 indexed citations

11.

Jamison, B. & Stephan Olariu. (1988). On the semi-perfect elimination. Advances in Applied Mathematics. 9(3). 364–376. 36 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