Jeremy Spinrad

5.1k total citations · 1 hit paper
65 papers, 2.5k citations indexed

About

Jeremy Spinrad is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Jeremy Spinrad has authored 65 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 19 papers in Electrical and Electronic Engineering and 18 papers in Computer Networks and Communications. Recurrent topics in Jeremy Spinrad's work include Advanced Graph Theory Research (54 papers), Graph Labeling and Dimension Problems (26 papers) and Complexity and Algorithms in Graphs (20 papers). Jeremy Spinrad is often cited by papers focused on Advanced Graph Theory Research (54 papers), Graph Labeling and Dimension Problems (26 papers) and Complexity and Algorithms in Graphs (20 papers). Jeremy Spinrad collaborates with scholars based in United States, Canada and Germany. Jeremy Spinrad's co-authors include Andreas Brandstädt, Van Bang Lê, Ross M. McConnell, Dieter Kratsch, Lorna Stewart, Vijay Raghavan, R. Sritharan, Kurt Mehlhorn, Xin He and Marcelo Arenas and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Jeremy Spinrad

64 papers receiving 2.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Graph Classes: A Survey

1999 875 citations Andreas Brandstädt, Van Bang Lê et al. profile →

Peers

Jeremy Spinrad

CTM

CNC

DMC

EEE

GT

Martin Charles Golumbic Israel

Dieter Kratsch France

Andreas Brandstädt Germany

Andrzej Proskurowski United States

Douglas B. West United States

Rodney G. Downey New Zealand

Daniel Lokshtanov Norway

E. J. Cockayne Canada

Peter J. Slater United States

Dimitrios M. Thilikos Greece

Martin Charles Golumbic Israel

Jeremy Spinrad

1.9k ×0.9

CTM

834 ×1.1

CNC

395 ×0.8

DMC

372 ×1.0

EEE

343 ×1.0

GT

Citations per year, relative to Jeremy Spinrad Jeremy Spinrad (= 1×) peers Martin Charles Golumbic

Countries citing papers authored by Jeremy Spinrad

Since Specialization

Citations

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

Fields of papers citing papers by Jeremy Spinrad

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jeremy Spinrad

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

1.

Golovach, Petr A., Pinar Heggernes, Ross M. McConnell, et al.. (2015). On recognition of threshold tolerance graphs and their complements. Discrete Applied Mathematics. 216. 171–180. 3 indexed citations

2.

Bodlaender, Hans L., Andreas Brandstädt, Dieter Kratsch, Michaël Rao, & Jeremy Spinrad. (2005). On algorithms for (P5,gem)-free graphs. Theoretical Computer Science. 349(1). 2–21. 14 indexed citations

3.

Lê, Van Bang & Jeremy Spinrad. (2004). Consequences of an algorithm for bridged graphs. Discrete Mathematics. 280(1-3). 271–274.

4.

Bodlaender, Hans L., et al.. (2003). On Algorithms for (P5,Gem)-Free Graphs. Utrecht University Repository (Utrecht University). 2 indexed citations

5.

Kratsch, Dieter & Jeremy Spinrad. (2003). Between O(nm) and O(n alpha).. Symposium on Discrete Algorithms. 709–716. 1 indexed citations

6.

Kratsch, Dieter, Ross M. McConnell, Kurt Mehlhorn, & Jeremy Spinrad. (2003). Certifying algorithms for recognizing interval graphs and permutation graphs. Symposium on Discrete Algorithms. 158–167. 18 indexed citations

7.

Kratsch, Dieter & Jeremy Spinrad. (2003). Between O(nm) and O(nα). Symposium on Discrete Algorithms. 709–716. 16 indexed citations

8.

Spinrad, Jeremy, et al.. (2003). Recognition of some perfectly orderable graph classes. Discrete Applied Mathematics. 128(2-3). 355–373. 3 indexed citations

9.

Spinrad, Jeremy. (2003). Efficient Graph Representations. American Mathematical Society eBooks. 195 indexed citations

10.

McConnell, Ross M. & Jeremy Spinrad. (2002). Construction of probe interval models. Symposium on Discrete Algorithms. 866–875. 23 indexed citations

11.

Spinrad, Jeremy, et al.. (2001). A polynomial time recognition algorithm for probe interval graphs. Symposium on Discrete Algorithms. 477–486. 24 indexed citations

12.

Rusu, Irena & Jeremy Spinrad. (2001). Domination graphs: examples and counterexamples. Discrete Applied Mathematics. 110(2-3). 289–300. 2 indexed citations

13.

Hayward, Ryan, Jeremy Spinrad, & R. Sritharan. (2000). Weakly chordal graph algorithms via handles. Symposium on Discrete Algorithms. 42–49. 24 indexed citations

14.

Kloks, Ton, Dieter Kratsch, & Jeremy Spinrad. (1997). On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science. 175(2). 309–335. 40 indexed citations

15.

McConnell, Ross M. & Jeremy Spinrad. (1997). Linear-time transitive orientation. Symposium on Discrete Algorithms. 19–25. 30 indexed citations

16.

Spinrad, Jeremy & R. Sritharan. (1995). Algorithms for weakly triangulated graphs. Discrete Applied Mathematics. 59(2). 181–191. 33 indexed citations

17.

McConnell, Ross M. & Jeremy Spinrad. (1994). Linear-time modular decomposition and efficient transitive orientation of comparability graphs. Symposium on Discrete Algorithms. 536–545. 88 indexed citations

18.

Spinrad, Jeremy. (1992). P4-trees and substitution decomposition. Discrete Applied Mathematics. 39(3). 263–291. 54 indexed citations

19.

Spinrad, Jeremy, et al.. (1991). An O(n2) time algorithm for the 2-chain cover problem and related problems. Symposium on Discrete Algorithms. 363–372. 6 indexed citations

20.

Spinrad, Jeremy, Andreas Brandstädt, & Lorna Stewart. (1987). Bipartite permutation graphs. Discrete Applied Mathematics. 18(3). 279–292. 125 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