| 2006 |
|---|
| 77 | EE | Peter C. Fishburn,
Fred S. Roberts:
Full Color Theorems for L(2, 1)-Colorings.
SIAM J. Discrete Math. 20(2): 428-443 (2006) |
| 2004 |
|---|
| 76 | EE | Samuel Fiorini,
Peter C. Fishburn:
Weak order polytopes.
Discrete Mathematics 275(1-3): 111-127 (2004) |
| 2003 |
|---|
| 75 | EE | Peter C. Fishburn,
Fred S. Roberts:
No-hole L(2, 1)-colorings.
Discrete Applied Mathematics 130(3): 513-519 (2003) |
| 74 | EE | Samuel Fiorini,
Peter C. Fishburn:
Facets of linear signed order polytopes.
Discrete Applied Mathematics 131(3): 597-610 (2003) |
| 73 | EE | Samuel Fiorini,
Peter C. Fishburn:
Extendability of Cyclic Orders.
Order 20(2): 151-171 (2003) |
| 2002 |
|---|
| 72 | EE | Peter C. Fishburn,
J. C. Lagarias:
Pinwheel Scheduling: Achievable Densities.
Algorithmica 34(1): 14-38 (2002) |
| 71 | EE | Peter C. Fishburn:
A remarkable eight-point planar configuration.
Discrete Mathematics 252(1-3): 103-122 (2002) |
| 70 | EE | Peter C. Fishburn,
William T. Trotter:
Containment orders for similar ellipses with a common center.
Discrete Mathematics 256(1-2): 129-136 (2002) |
| 69 | EE | Peter C. Fishburn,
Aleksandar Pekec,
James A. Reeds:
Subset Comparisons for Additive Linear Orders.
Math. Oper. Res. 27(1): 227-243 (2002) |
| 68 | EE | Peter C. Fishburn,
Paul E. Wright:
Interference Patterns in Regular Graphs with Bijective Colorings.
SIAM J. Discrete Math. 15(3): 382-402 (2002) |
| 2001 |
|---|
| 67 | EE | Peter C. Fishburn,
James A. Reeds:
Counting Split Semiorders.
Order 18(2): 119-128 (2001) |
| 66 | EE | James A. Reeds,
Peter C. Fishburn:
Counting Split Interval Orders.
Order 18(2): 129-135 (2001) |
| 65 | EE | Paul J. Tanenbaum,
Ann N. Trenk,
Peter C. Fishburn:
Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets.
Order 18(3): 201-225 (2001) |
| 64 | EE | Peter C. Fishburn,
Paul J. Tanenbaum,
Ann N. Trenk:
Linear Discrepancy and Bandwidth.
Order 18(3): 237-245 (2001) |
| 63 | EE | Christopher Doble,
Jean-Paul Doignon,
Jean-Claude Falmagne,
Peter C. Fishburn:
Almost Connected Orders.
Order 18(4): 295-311 (2001) |
| 2000 |
|---|
| 62 | EE | Peter C. Fishburn,
Andrew M. Odlyzko:
Dynamic behavior of differential pricing and quality of service options for the internet.
Decision Support Systems 28(1-2): 123-136 (2000) |
| 61 | | Peter C. Fishburn,
Paul E. Wright:
Interference patterns in bijective colorings of 2-regular graphs.
Discrete Applied Mathematics 102(3): 189-204 (2000) |
| 60 | EE | Peter C. Fishburn,
Prasad Tetali,
Peter Winkler:
Optimal linear arrangement of a rectangular grid.
Discrete Mathematics 213(1-3): 123-139 (2000) |
| 59 | EE | Peter C. Fishburn,
Bernard Monjardet:
Concordance Graphs.
Eur. J. Comb. 21(4): 461-471 (2000) |
| 1999 |
|---|
| 58 | EE | Peter C. Fishburn,
William T. Trotter:
Split semiorders.
Discrete Mathematics 195(1-3): 111-126 (1999) |
| 57 | EE | Stefan Felsner,
Peter C. Fishburn,
William T. Trotter:
Finite three dimensional partial orders which are not sphere orders.
Discrete Mathematics 201(1-3): 101-132 (1999) |
| 56 | | A. Robert Calderbank,
Alexandra Duel-Hallen,
Peter C. Fishburn,
Asya Rabinovich:
Interpolation by Convolutional Codes, Overload Distortion, and the Erasure Channel.
IEEE Transactions on Information Theory 45(1): 94-105 (1999) |
| 55 | EE | Peter C. Fishburn:
Preference Structures and Their Numerical Representations.
Theor. Comput. Sci. 217(2): 359-383 (1999) |
| 1998 |
|---|
| 54 | EE | Peter C. Fishburn:
Isosceles Planar Subsets.
Discrete & Computational Geometry 19(3): 390-398 (1998) |
| 53 | EE | Peter C. Fishburn,
J. H. Kim,
J. C. Lagarias,
Paul E. Wright:
Interference-Minimizing Colorings of Regular Graphs.
SIAM J. Discrete Math. 11(1): 15-40 (1998) |
| 1997 |
|---|
| 52 | | Paul Erdös,
Peter C. Fishburn:
Minimum Planar Sets with Maximum Equidistance Counts.
Comput. Geom. 7: 207-218 (1997) |
| 51 | EE | Peter C. Fishburn,
Peter Schwander,
Larry A. Shepp,
Robert J. Vanderbei:
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
Discrete Applied Mathematics 75(1): 39-61 (1997) |
| 50 | EE | Peter C. Fishburn,
Frank K. Hwang,
Ding-Zhu Du,
Biao Gao:
On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks.
Discrete Applied Mathematics 78(1-3): 75-87 (1997) |
| 49 | EE | Paul Erdös,
Peter C. Fishburn:
Distinct distances in finite planar sets.
Discrete Mathematics 175(1-3): 97-132 (1997) |
| 48 | EE | Peter C. Fishburn,
Andrew M. Odlyzko,
Ryan C. Siders:
Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars.
First Monday 2(7): (1997) |
| 47 | EE | Peter C. Fishburn,
Jerry S. Kelly:
Super Arrovian Domains with Strict Preferences.
SIAM J. Discrete Math. 10(1): 83-95 (1997) |
| 1996 |
|---|
| 46 | EE | Peter C. Fishburn:
Decision Theory and Discrete Mathematics.
Discrete Applied Mathematics 68(3): 209-221 (1996) |
| 45 | EE | Paul Erdös,
Peter C. Fishburn:
Maximum planar sets that determine k distances.
Discrete Mathematics 160(1-3): 115-125 (1996) |
| 44 | EE | Peter C. Fishburn,
Peter L. Hammer:
Bipartite dimensions and bipartite degrees of graphs.
Discrete Mathematics 160(1-3): 127-148 (1996) |
| 1995 |
|---|
| 43 | | Peter C. Fishburn:
Convex Polygons with Few Intervertex Distances.
Comput. Geom. 5: 65-93 (1995) |
| 42 | EE | Paul Erdös,
Peter C. Fishburn:
Multiplicities of Interpoint Distances in Finite Planar Sets.
Discrete Applied Mathematics 60(1-3): 141-147 (1995) |
| 41 | EE | Paul Erdös,
Peter C. Fishburn:
Intervertex Distances in Convex Polygons.
Discrete Applied Mathematics 60(1-3): 149-158 (1995) |
| 40 | EE | Kenneth P. Bogart,
Peter C. Fishburn,
Garth Isaak,
Larry J. Langley:
Proper and Unit Tolerance Graphs.
Discrete Applied Mathematics 60(1-3): 99-117 (1995) |
| 39 | | M. R. Best,
Marat V. Burnashev,
Y. Levy,
Alexander Moshe Rabinovich,
Peter C. Fishburn,
A. Robert Calderbank,
Daniel J. Costello Jr.:
On a technique to calculate the exact performance of a convolutional code.
IEEE Transactions on Information Theory 41(2): 441-447 (1995) |
| 38 | | A. Robert Calderbank,
Peter C. Fishburn,
Alexander Moshe Rabinovich:
Covering properties of convolutional codes and associated lattices.
IEEE Transactions on Information Theory 41(3): 732-746 (1995) |
| 1994 |
|---|
| 37 | | A. Robert Calderbank,
Peter C. Fishburn:
Maximal Three-Independent Subsets of {0, 1, 2}.
Des. Codes Cryptography 4(3): 203-211 (1994) |
| 36 | | Paul Erdös,
Peter C. Fishburn:
A Postscript on Distances in Convex n-Gons.
Discrete & Computational Geometry 11: 111-117 (1994) |
| 35 | | A. Robert Calderbank,
Peter C. Fishburn:
The normalized second moment of the binary lattice determined by a convolutional code.
IEEE Transactions on Information Theory 40(1): 166- (1994) |
| 34 | EE | Peter C. Fishburn,
James A. Reeds:
Bell Inequalities, Grothendieck's Constant, and Root Two.
SIAM J. Discrete Math. 7(1): 48-56 (1994) |
| 1993 |
|---|
| 33 | | A. Robert Calderbank,
Peter C. Fishburn,
Alexander Moshe Rabinovich:
Sequence Based Methods for Data Transmission and Source Compression.
AAECC 1993: 1-12 |
| 32 | EE | Peter C. Fishburn,
Fred S. Roberts:
Elemantary Sequences, Sub-Fibonacci Sequences.
Discrete Applied Mathematics 44(1-3): 261-281 (1993) |
| 31 | | Peter C. Fishburn,
Ronald L. Graham:
Lexicographic Ramsey Theory.
J. Comb. Theory, Ser. A 62(2): 280-298 (1993) |
| 1992 |
|---|
| 30 | | Peter C. Fishburn,
James A. Reeds:
Unit Distances Between Vertices of a Convex Polygon.
Comput. Geom. 2: 81-91 (1992) |
| 29 | EE | Peter C. Fishburn:
Correlation in Partially Ordered Sets.
Discrete Applied Mathematics 39(2): 173-191 (1992) |
| 28 | EE | Peter C. Fishburn,
William T. Trotter:
Linear extensions of semiorders: a maximization problem.
Discrete Mathematics 103(1): 25-40 (1992) |
| 27 | EE | Peter C. Fishburn,
William T. Trotter:
Dimensions of hypergraphs.
J. Comb. Theory, Ser. B 56(2): 278-295 (1992) |
| 1991 |
|---|
| 26 | EE | Peter C. Fishburn,
J. C. Lagarias,
James A. Reeds,
Larry A. Shepp:
Sets uniquely determined by projections on axes II Discrete case.
Discrete Mathematics 91(2): 149-159 (1991) |
| 25 | EE | Peter C. Fishburn,
Larry A. Shepp:
On the FKB conjecture for disjoint intersections.
Discrete Mathematics 98(2): 105-122 (1991) |
| 24 | EE | Peter C. Fishburn:
A note on linear extensions and incomparable pairs.
J. Comb. Theory, Ser. A 56(2): 290-296 (1991) |
| 23 | | Paul Erdös,
Peter C. Fishburn,
Zoltán Füredi:
Midpoints of Diagonals of Convex n-GONS.
SIAM J. Discrete Math. 4(3): 329-341 (1991) |
| 1990 |
|---|
| 22 | EE | Peter C. Fishburn,
Fred S. Roberts,
Helen M. Marcus-Roberts:
Van Lier sequences.
Discrete Applied Mathematics 27(3): 209-220 (1990) |
| 21 | EE | Peter C. Fishburn,
William V. Gehrlein:
The three-permutations problem.
Discrete Mathematics 79(3): 259-264 (1990) |
| 20 | | Peter C. Fishburn:
Binary Probabilities Induced by Rankings.
SIAM J. Discrete Math. 3(4): 478-488 (1990) |
| 19 | | Peter C. Fishburn:
Thicknesses of Ordered Sets.
SIAM J. Discrete Math. 3(4): 489-501 (1990) |
| 1989 |
|---|
| 18 | EE | Peter C. Fishburn,
William V. Gehrlein:
Pick-and-choose heuristics for partial set covering.
Discrete Applied Mathematics 22(2): 119-132 (1989) |
| 17 | EE | Peter C. Fishburn,
N. J. A. Sloane:
The solution to Berlekamp's switching game.
Discrete Mathematics 74(3): 263-290 (1989) |
| 1988 |
|---|
| 16 | | Peter C. Fishburn,
Helen M. Marcus-Roberts,
Fred S. Roberts:
Unique Finite Difference Measurement.
SIAM J. Discrete Math. 1(3): 334-354 (1988) |
| 1986 |
|---|
| 15 | EE | Peter C. Fishburn,
Frank K. Hwang,
Hikyu Lee:
Do local majorities force a global majority?
Discrete Mathematics 61(2-3): 165-179 (1986) |
| 14 | EE | Peter C. Fishburn:
Proportional transitivity in linear extensions of ordered sets.
J. Comb. Theory, Ser. B 41(1): 48-60 (1986) |
| 1985 |
|---|
| 13 | EE | Peter C. Fishburn:
Interval graphs and interval orders.
Discrete Mathematics 55(2): 135-149 (1985) |
| 1984 |
|---|
| 12 | EE | Peter C. Fishburn:
Paradoxes of two-length interval orders.
Discrete Mathematics 52(2-3): 165-175 (1984) |
| 1983 |
|---|
| 11 | EE | Peter C. Fishburn:
Interval lengths for interval orders: A minimization problem.
Discrete Mathematics 47: 63-82 (1983) |
| 10 | | Peter C. Fishburn:
Balanced Integer Arrays: A Matrix Packing Theorem.
J. Comb. Theory, Ser. A 34(1): 98-101 (1983) |
| 9 | EE | Peter C. Fishburn:
On the sphericity and cubicity of graphs.
J. Comb. Theory, Ser. B 35(3): 309-318 (1983) |
| 1982 |
|---|
| 8 | EE | Peter C. Fishburn:
Aspects of semiorders within interval orders.
Discrete Mathematics 40(2-3): 181-191 (1982) |
| 7 | EE | William V. Gehrlein,
Peter C. Fishburn:
Scoring rule and majority agreements for large electorates with arbitrary preferences.
Mathematical Social Sciences 2(1): 23-33 (1982) |
| 6 | EE | Peter C. Fishburn:
Dominant strategies and restricted ballots with variable electorate.
Mathematical Social Sciences 2(4): 383-395 (1982) |
| 5 | EE | Peter C. Fishburn:
Relative probabilities of majority winners under partial information.
Mathematical Social Sciences 3(1): 73-78 (1982) |
| 1981 |
|---|
| 4 | EE | Peter C. Fishburn:
Uniqueness properties in finite-continuous additive measurement.
Mathematical Social Sciences 1(2): 145-153 (1981) |
| 1980 |
|---|
| 3 | EE | Peter C. Fishburn:
Symmetric social choices and collective rationality.
Mathematical Social Sciences 1(1): 1-9 (1980) |
| 1976 |
|---|
| 2 | EE | Peter C. Fishburn:
On linear extension majority graphs of partial orders.
J. Comb. Theory, Ser. B 21(1): 65-70 (1976) |
| 1975 |
|---|
| 1 | | Peter C. Fishburn:
Three-Valued Representative Systems.
Mathematical Systems Theory 9(3): 265-280 (1975) |
