| Obituary: Peter C. Fishburn (1936-2021). | 0 | 0.34 | 2022 |
| Estimating Violation Risk for Fisheries Regulations. | 0 | 0.34 | 2013 |
| The Challenges of Multidisciplinary Education in Computer Science. | 0 | 0.34 | 2011 |
| Greedy Algorithms in Economic Epidemiology. | 0 | 0.34 | 2010 |
| Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion | 86 | 3.47 | 2009 |
| Locating sensors in paths and cycles: The case of 2-identifying codes | 18 | 0.95 | 2008 |
| Computer science and decision theory | 7 | 0.78 | 2008 |
| Full Color Theorems for L(2,1)-Colorings | 13 | 0.85 | 2006 |
| Characterizations of consistent marked graphs | 4 | 0.62 | 2003 |
| No-hole L(2,1)-colorings | 13 | 0.88 | 2003 |
| How hard is it to determine if a graph has a 2-role assignment? | 15 | 1.85 | 2001 |
| Consensus list colorings of graphs and physical mapping of DNA. | 3 | 0.41 | 2001 |
| A measure of discrepancy of multiple sequences | 11 | 0.83 | 2001 |
| The role assignment model nearly fits most social networks | 10 | 0.52 | 2001 |
| Phylogeny numbers for graphs with two triangles | 3 | 0.46 | 2000 |
| Optimal Orientations of Annular Networks | 1 | 0.42 | 2000 |
| On balanced signed graphs and consistent marked graphs | 4 | 0.64 | 1999 |
| The Elimination Procedure For The Competition Number | 2 | 0.66 | 1998 |
| Phylogeny numbers | 2 | 0.66 | 1998 |
| On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can An Optimal Solution Be Nonoptimal? | 7 | 1.27 | 1998 |
| The median procedure on median graphs | 39 | 3.21 | 1998 |
| Amenable colorings | 0 | 0.34 | 1997 |
| Competition numbers of graphs with a small number of triangles | 15 | 2.27 | 1997 |
| Meaningless statements. | 0 | 0.34 | 1997 |
| Phylogeny graphs of arbitrary digraphs. | 0 | 0.34 | 1996 |
| An impossibility result in axiomatic location theory | 5 | 3.41 | 1996 |
| The reversing number of a digraph | 10 | 2.14 | 1995 |
| On the optimal strongly connected orientations of city street graphs IV: four east-west avenues or north-south streets | 19 | 1.52 | 1994 |
| p-competition numbers | 1 | 0.51 | 1993 |
| Elementary sequences, sub-Fibonacci sequences | 1 | 0.41 | 1993 |
| 2-competition graphs | 3 | 1.81 | 1992 |
| The Role of Applications in Teaching Discrete Mathematics. | 0 | 0.34 | 1992 |
| (i,j) competition graphs | 5 | 0.57 | 1991 |
| T-colorings of graphs: recent results and open problems | 90 | 22.38 | 1991 |
| Meaningfulness of conclusions from combinatorial optimization | 5 | 0.69 | 1990 |
| On dimensional properties of graphs. | 7 | 0.94 | 1989 |
| On The Optimal Strongly Connected Orientations Of City Street Graphs .2. 2 East West Avenues Or North South Streets | 13 | 1.11 | 1989 |
| On the optimal strongly connected orientations of city street graphs I: large grids | 19 | 1.30 | 1988 |
| Unique finite difference measurement | 3 | 0.83 | 1988 |
| Applications Of Edge Coverings By Cliques | 34 | 6.23 | 1985 |
| Applications Of Ramsey Theory | 0 | 0.34 | 1984 |
| A Characterization Of Competition Graphs Of Arbitrary Digraphs | 16 | 13.03 | 1983 |
| Optimal I-Intersection Assignments For Graphs - A Linear-Programming Approach | 2 | 0.77 | 1983 |
| Computing The Boxicity Of A Graph By Covering Its Complement By Cointerval Graphs | 34 | 2.42 | 1983 |
| I-Colorings, I-Phasings, And I-Intersection Assignments For Graphs, And Their Applications | 4 | 0.92 | 1983 |
| Tolerance geometry. | 3 | 0.93 | 1973 |
