Articles Authored by F.S. Roberts

Where indicated in blue, these articles are available for reading or download, either in manuscript form or as preprints in the DIMACS Technical Report Series. CAVEAT: In most cases, the final journal version has been updated from the technical report version.

1. Some problems in the geometry of visual perception (with P. Suppes), Synthese, 17 (1967), 173-201.
2. Axiomatic thermodynamics and extensive measurement (with R.D. Luce), Synthese, 18 (1968), 311-326.
3. Indifference graphs, in F. Harary (ed.), Proof Techniques in Graph Theory, Academic Press, NY, 1969, 139-146.
4. On the boxicity and cubicity of a graph, in W.T. Tutte (ed.), Recent Progress in Combinatorics, Academic Press, NY, 1969, 301-310.
5. A characterization of clique graphs (with J.Spencer), in R. Guy, H. Hanani, N. Sauer, and J. Schonheim (eds.), Combinatorial Structures and Their Applications, Gordon and Breach, NY, 1970, 367-368.
6. A new characterization of partial orders of dimension two (with K.A. Baker & P.C. Fishburn), Annals of NY Acad. of Sci., 175 (1970), 23-24.
7. Intersection graphs of families of convex sets with distinguished points (with W.F.Ogden), in R. Guy, H. Hanani, N. Sauer, & J. Schonheim (eds.), Combinatorial Structures and Their Applications, Gordon and Breach, NY, 1970, 311-313.
8. On nontransitive indifference, Jour. of Math. Psychology, 7 (1970), 243-258.
9. A characterization of clique graphs (with J. Spencer), Jour. of Comb. Theory, 10B (1971), 102-108 (an expanded version of #5).
10. Homogeneous families of semiorders and the theory of probabilistic consistency, Jour. of Math. Psychology, 8 (1971), 248-263.
11. On the compatibility between a graph and a simple order, Jour. of Combinatorial Theory, 11 (1971), 28-38.
12. Signed digraphs and the growing demand for energy, Environment and Planning, 3 (1971), 395-410.
13. Noise pollution: The unseen problem, Coast Environment, 1 (1971), 13-15.
14. A derivation of a measure of relative balance for signed digraphs and a characterization of extensive ratio systems (with R.Z. Norman), Jour. of Math. Psychology, 9 (1972), 66-91.
15. A measure of relative balance for social structures (with R.Z. Norman), in J. Berger, M. Zelditch & B. Anderson (eds.), Structural Theories in Progress, II, Houghton-Mifflin, NY, 1972, 358-391.
16. Partial orders of dimension 2 (with K.A. Baker & P.C. Fishburn), Networks, 2 (1972), 11-28.
17. What if utility functions do not exist?, Theory and Decision, 3 (1972), 126-139.
18. A note on Fine's axioms for qualitative probability, Annals of Probability, 1 (1973), 484-487.
19. Building and analyzing an energy demand signed digraph, Environment and Planning, 5 (1973), 199-221.
20. Tolerance geometry, Notre Dame Jour. of Formal Logic, 14 (1973), 68-76.
21. Laws of exchange and their applications, SIAM Jour. of Applied Math.,, 26 (1974), 260-284.
22. Structural characterizations of stability of signed digraphs under pulse processes, in R. Bari & F. Harary (eds.), Graphs and Combinatorics, Springer Verlag Lecture Notes #406, 1974, 330-338.
23. Signed digraphs and the energy crisis (with T.A. Brown), Amer. Math. Monthly, 82 (1975), 577-594.
24. Weighted digraph models for the assessment of energy use and air pollution in transportation systems, Environment and Planning, 7 (1975), 703-724.
25. Structural analysis of energy systems, in F.S. Roberts (ed.), Energy: Mathematics and Models, SIAM Publications (1976), 84-101.
26. Commuter transportation and the energy crisis, in R. Axelrod (ed.), The Structure of Decision, Princeton Univ. Press, 1976, 142-179.
27. Graphs, garbage, and a pollution solution, in D.P. Maki and M. Thompson (eds.), Mathematical Models in the Undergraduate Curriculum, Proc of Conf. held at Indiana Univ., 1976, 58-94.
28. On the theory of uniqueness in measurement (with C.H. Franke), Jour. of Math. Psychology, 14 (1976), 211-218.
29. The questionnaire method, in R. Axelrod (ed.), The Structure of Decision, Princeton Univ. Press, 1976, 333-342.
30. DNA counts, pesticide projections, and vehicular vectors, in D. Tarwater (ed.), The Bicentennial Tribute to American Mathematics, Math. Asso. of America, 1977, 209-218.
31. Food webs, competition graphs, and the boxicity of ecological phase space, in Y. Alavi and D. Lick (eds.), Theory and Applications of Graphs, Springer-Verlag Lecture Notes #642, 1978, 477-490.
32. Mixture axioms in linear and multilinear utility theories (with P.C. Fishburn), Theory and Decision, 9 (1978), 161-171.
33. Energy modeling and net energy analysis: an overview, in Energy Modeling and Net Energy Analysis, Inst. of Gas Technology, Chicago, 1979, 1-25. (Reprinted in Current Engr. Practice, 1979.)
34. Graph theory and the social sciences, in R. Wilson and L. Beineke (eds.), Applications of Graph Theory, Academic Press, 1979, 255-291.
35. Indifference and seriation, in F. Harary (ed.), Advances in Graph Theory, NY Academy of Sciences, 1979, 171-180.
36. On the mobile radio frequency assignment problem and the traffic light phasing problem, Annals, NY Acad. of Sci., 319 (1979), 466-483.
37. Structure and stability in weighted digraph models, Annals, NY Acad. of Sciences, 321 (1979), 64-77.
38. Structural modeling and measurement theory, Tech. Forecasting and Social Change, 14 (1979), 353-365.
39. Energy modeling: The interface between model builder and decision maker, in Energy Modeling II: The Interface Between Model Builder and Decision-Maker, Inst. of Gas Technology, Chicago, 1980, 1-10.
40. On Luce's theory of meaningfulness, Philos. of Sci., 47 (1980), 424-433.
41. Energy modeling: Dealing with energy uncertainty, in Energy Modeling III: Dealing with Energy Uncertainty, Inst. of Gas Technology, Chicago, 1981, 1-13.
42. On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems (with R.J.Opsut), in G. Chartrand, et al (eds.), The Theory and Applications of Graphs, Wiley, New York, 1981, 479-492.
43. Structural models and graph theory, in H. Greenberg and J. Maybee (eds.), Computer Assisted Analysis and Model Simplification, Academic Press, New York, 1981, 59-67.
44. Analogues of the Shannon capacity of a graph (with P. Hell), Annals of Discrete Math., 12 (1982), 155-168.
45. T-colorings of graphs and the channel assignment problem (with M.B. Cozzens), Congressus Numerantium, 35 (1982), 191-208.
46. Double semiorders and double indifference graphs (with M.B. Cozzens), SIAM Jour. on Algebraic & Discrete Methods, 3 (1982), 566-583.
47. Planning for energy disruptions, in Energy Modeling IV: Planning for Energy Disruptions, Inst. of Gas Tech., Chicago, 1982, 1-13.
48. A characterization of competition graphs of arbitrary digraphs (with J. Steif), Discrete Applied Math., 6 (1983), 323-326.
49. Computing the boxicity of a graph by covering its complement by cointerval graphs (with M.B. Cozzens), Discrete Applied Math., 6 (1983), 217-228.
50. Efficiency of energy use in obtaining food I: Humans, in H. Marcus-Roberts and M. Thompson (eds.), Life Science Models, Springer-Verlag, NY, 1983, 250-285.
51. Efficiency of energy use in obtaining food II: Animals (with H. Marcus-Roberts), in H. Marcus-Roberts and M. Thompson (eds.), Life Science Models, Springer-Verlag, NY, 1983, 286-348.
52. How to cure the plague of calculus (or revisions in the introductory mathematics curriculum), in A. Ralston & G.S. Young (eds.), The Future of College Mathematics, Springer-Verlag, NY, 1983, 121-133.
53. Malaria (models of the population dynamics of the malaria parasite) (with H.Marcus-Roberts), in H. Marcus-Roberts and M. Thompson (eds.), Life Science Models, Springer-Verlag, NY, 1983, 161-177.
54. I-colorings, I-phasings, and I-intersection assignments for graphs and their applications (with R.J. Opsut), Networks, 13 (1983), 327-345.
55. Is calculus necessary, in M. Zweng, et al (eds.), Proc. of the Fourth Internat'l Congress on Math. Education, Birkhauser-Boston, Boston, Mass., 1983, 52-53.
56. Optimal I-intersection assignments for graphs: A linear programming approach (with R.J. Opsut), Networks, 13 (1983), 317-326.
57. Applications of the theory of meaningfulness to order and matching experiments, in E. DeGreef and J. Van Buggenhaut (eds.), Trends in Mathematical Psychology, North-Holland, Amsterdam, 1984, 283-292.
58. Applications of Ramsey theory, Discrete Applied Math., 9 (1984), 251-261.
59. On k-suitable sets of arrangements and the boxicity of a graph (with M.B. Cozzens), J. Comb., Info. & Syst. Sci., 9 (1984), 14-24.
60. On the theory of meaningfulness of ordinal comparisons in measurement, Measurement, 2 (1984), 35-38.
61. The introductory mathematics curriculum: misleading, outdated, and unfair, College Math. Journal, 15 (1984), 383-385 & 397-399.
62. Applications of edge coverings by cliques, Discrete Applied Math., 10 (1985), 93-109.
63. Applications of the theory of meaningfulness to psychology, Jour. of Math. Psych., 29 (1985), 311-332.
64. Generalized competition graphs and their applications (with A. Raychaudhuri), in P. Brucker and R. Pauly (eds.), Methods of Operations Research, 49, Anton Hain, Konigstein, West Germany, 1985, 295-311.
65. Some results on automorphisms of ordered relational systems and the theory of scale type in measurement (with Z. Rosenbaum), in Y. Alavi, et al (eds.), Graph Theory and its Applications to Algorithms and Computer Science, Wiley, NY, 1985, 659-669.
66. Issues in the theory of uniqueness in measurement, in I. Rival (ed.), Graphs and Orders, D. Reidel, 1985, 415-444.
67. On scientific laws without dimensional constants (with J. Aczel and Z. Rosenbaum), J. Math. Anal. & Appl., 119 (1986), 389-416.
68. Scale type, meaningfulness, and the possible psychophysical laws (with Z. Rosenbaum), Math. Soc. Sci., 12 (1986), 77-95.
69. Meaningless statistics (with H. Marcus-Roberts), J. Educ. Stat., 12 (1987), 383-394.
70. Some remarks on the double competition number of a graph (with K.F. Jones, J.R. Lundgren, and S. Seager), Congr. Numerantium, 60 (1987), 17-24.
71. On the optimal orientations of city street graphs I: Large grids (with Y. Xu), SIAM J. Discr. Math., 1 (1988), 199-222.
72. Tight and loose value automorphisms (with Z. Rosenbaum), Discrete Applied Math., 22 (1988), 69-79.
73. Unique finite conjoint measurement (with P.C. Fishburn), Math. Soc. Sci., 16 (1988), 107-143.
74. Unique finite difference measurement (with P.C. Fishburn and H. Marcus-Roberts), SIAM J. Discrete Math., 1 (1988), 334-354.
75. On dimensional properties of graphs (with M.B. Cozzens), Graphs and Combinatorics, 5 (1989), 29-46.
76. On the theory of meaningfulness of ordinal comparisons in measurement II (with L.H. Harvey), Annals NY Acad. Sci., 555 (1989), 220-229.
77. On the optimal orientations of city street graphs II: Two east-west avenues or north-south streets (with Y. Xu), Networks,, 19 (1989), 221-233.
78. Uniqueness in finite measurement (with P.C. Fishburn), in Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, Vol. 17 of IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989, 103-137.
79. Meaningless statements, matching experiments, and colored digraphs (applications of graph theory and combinatorics to the theory of measurement), in Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, Vol. 17 of IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989, 275-294.
80. Axioms for unique subjective probability on finite sets (with P.C. Fishburn), Jour. of Math. Psych., 33 (1989), 117-130.
81. On the possible merging functions (with J. Aczel), Math. Soc. Sci., 17 (1989), 205-243.
82. Seven fundamental ideas in the application of combinatorics and graph theory in the biological and social sciences, in Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, Volume 17 of IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989, 1-37.
83. Two-sided generalized Fibonacci sequences (with P.C. Fishburn and A.M. Odlyzko), Fibonacci Quart., 27 (1989), 352-361.
84. Extremal competition numbers as a generalization of Turan's theorem (with F. Harary and S. Kim), J. Ramanujan Math. Society, 5 (1990), 33-43.
85. On Opsut's conjecture for the competition number (with S. Kim), Congr. Num., 71 (1990), 173-176.
86. Meaningfulness of conclusions from combinatorial optimization, Discrete Applied Math., 29 (1990), 221-241.
87. Merging relative scores, J. Math. Anal. & Appl., 147 (1990), 30-52.
88. Van Lier sequences (with P.C. Fishburn and H. Marcus-Roberts), Discrete Applied Math., 27 (1990), 209-220.
89. Characterizations of the plurality function, Math. Soc. Sci.,, 21 (1991), 101-127.
90. From garbage to rainbows: Generalizations of graph coloring and their applications, in Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (eds.), Graph Theory, Combinatorics, and Applications, Vol. 2, Wiley, New York, 1991, 1031-1052.
91. i,j Competition graphs (with K. Hefner, K. Jones, S. Kim, and J.R. Lundgren), Discrete Applied Math., 32 (1991), 241-262.
92. On the use of augmenting chains in chain packings (with D. de Werra), Discrete Applied Math., 30 (1991), 137-149.
93. T-colorings of graphs: Recent results and open problems, Discrete Math., 93 (1991), 229-245.
94. On the indicator function of the plurality function, Math. Soc. Sci., 22 (1991), 163-174.
95. Greedy algorithms for T-colorings of complete graphs and the meaningfulness of conclusions about them (with M.B. Cozzens), J. Comb., Info., & Syst. Sci., 16 (1991), 286-299.
96. On the optimal orientations of city street graphs III: Three east-west avenues or north-south streets (with Y. Xu), Networks, 22 (1992), 109-143.
97. On 1 0 1-clear (0,1) matrices and the double competition number of bipartite graphs (with S. Kim and S. Seager), J. Comb., Info., & Syst. Sci., 17 (1992), 302-315.
98. 2-Competition graphs (with G. Isaak, S. Kim, T. McKee, and F. McMorris), SIAM J. on Discrete Math., 5 (1992), 524-538.
99. No-Hole 2-distant colorings, Math. & Computer Modelling, 17 (1993), 139-144.
100. New directions in graph theory, with an emphasis on applications, Annals of Discrete Math., 55 (1993), 13-44.
101. On the median procedure, in B. Bouchon-Meunier, L. Valverde, and R.R. Yager (eds.), Uncertainty in Intelligent Systems, Elsevier, Amsterdam, 1993, 451-462.
102. p-competition numbers (with S. Kim, T. McKee, and F. McMorris), Discrete Applied Math., 46 (1993), 87-92.
103. Consensus functions and patterns in molecular sequences (with B. Mirkin), Bull. Math. Biology, 55 (1993), 695-713.
104. Elementary sequences, sub-Fibonacci sequences (with P.C. Fishburn), Discrete Applied Math., 44 (1993), 261-281.
105. On the optimal orientations of city street graphs IV: Four east-west avenues or north-south streets (with Y. Xu), Discrete Applied Math., 49 (1994), 331-356.
106. Limitations on conclusions using scales of measurement, in A. Barnett, S.M. Pollock, and M.H. Rothkopf (eds.), Operations Research and the Public Sector, Elsevier, Amsterdam, 1994, 621-671.
107. The meaningfulness of ordinal comparisons for general order relational systems (with Z. Rosenbaum), in P. Humphreys (ed.), Patrick Suppes: Scientific Philosopher, Kluwer Academic Publishers, Dordrecht, 1994, 251-274.
108. The reversing number of a digraph (with J.P. Barthelemy, O. Hudry, G. Isaak, and B. Tesman), Discrete Applied Math., 60 (1995), 39-76.
109. p-Competition graphs (with S. Kim, T. McKee, and F. McMorris), Linear Algebra and Applications, 217 (1995), 167-178.
110. On the problem of consistent marking of a graph, Linear Algebra and Applications, 217 (1995), 255-263.
111. Edge-tenacious networks (with B. Piazza and S. Stueckle), Networks, 25 (1995), 7-17.
112. A functional equation that arises in problems of scheduling with priorities and lateness/earliness penalties, Mathematical and Computer Modelling, 21 (1995), 77-83.
Full Article: Mathematical and Computer Modelling
113. An impossibility result in axiomatic location theory (with P. Hansen), Math. of Operations Research, 21 (1996), 195-208.
114. Calculus and mathematical modeling, in Calculus of a Single and Multivariable, D. Zill and S. Wright (eds), Student Resource Manual, Jones and Bartlett Publishers, 2009.
115. The one-way street problem (how to teach discrete mathematics), submitted.
116. 3-choosable complete bipartite graphs (with N.V.R. Mahadev and P. Santhanakrishnan), submitted.
117. Role primitive indifference graphs and role assignments on w-fan graphs (with L. Sheng), Congr. Numer., 121 (1996), 65-75.
118. Amenable colorings (with N.V.R. Mahadev), Discrete Appl. Math., 76 (1997), 225-238.
119. The role of applications in teaching discrete mathematics, in Discrete Mathematics in the Schools, DIMACS Series, Vol. 36, American Mathematical Society, Providence, RI, 1997, 105-117.
120. Effect of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (with N.V.R. Mahadev and A. Pekec), Mathematical and Computer Modelling, 25 (1997), 9-22.
Full Article: Mathematical and Computer Modelling
121. Competition numbers of graphs with a small number of triangles (with S. Kim), Discrete Applied Math., 78 (1997), 153-162.
122. Phylogeny graphs of arbitrary digraphs (with L. Sheng), in Mathematical Hierarchies and Biology, DIMACS Series, Vol. 37, American Mathematical Society, Providence, RI, 1997, 233-237.
123. Threshold role assignments (with L. Sheng), Congr. Numer., 123 (1997), 135-148.
124. On the meaningfulness of optimal solutions to scheduling problems: Can an optimal solution be non-optimal? (with N.V.R. Mahadev and A. Pekec), Operations Research, 46 supp. (1998), S120-S134.
Full article: Operations Research
125. Role assignments and indifference graphs, in Recent Trends in Mathematical Psychology, Lawrence Erlbaum Associates, Mahwah, NJ, 1998, 33-46.
126. The median procedure on median graphs (with F.R. McMorris and H.M. Mulder), Discrete Applied Math., 84 (1998), 165-181.
127. The elimination procedure for the competition number (with S. Kim), Ars Combinatoria, 50 (1998), 97-113.
128. Phylogeny numbers (with L. Sheng), Discrete Applied Math., 87 (1998), 213-228.
129. Role assignments (with L. Sheng), in Y. Alavi, D. Lick, and A. Schwenk (eds.), Combinatorics, Graph Theory, and Algorithms, Vol. II, New Issues Press, Kalamazoo, MI, 1999, 729-745.
130. Meaningless statements, in Contemporary Trends in Discrete Mathematics, DIMACS Series, Vol. 49, American Mathematical Society, Providence, RI, 1999, 257-274.
Manuscript of article 130.
131. Competition graphs and phylogeny graphs, in L. Lovasz (ed.), Graph Theory and Combinatorial Biology, Bolyai Society Mathematical Studies 7 (1999), J. Bolyai Mathematical Society, Budapest, Hungary, 333-362.
132. Balanced signed graphs and consistent marked graphs, Electronic Notes in Discrete Mathematics (ENDM), 2 (1999), http://www.elsevier.nl/locate/endm.
133. Orientations of annular cities (with J-C. Bermond, J. Bond, C. Martin, and A. Pekec), J. of Interconnection Networks, 1 (2000), 21-46.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-13.ps.gz
134. Phylogeny numbers for graphs with two triangles (with L. Sheng), Discrete Applied Math., 103 (2000), 191-207.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1998/98-49.ps.gz
135. How hard is it to determine if a graph has a 2-role assignment? (with L. Sheng), Networks, 37 (2001), 67-73.
Manuscript of article 135.
136. The role assignment model nearly fits most social networks (with A. Pekec), Math. Social Sci., 41 (2001), 275-293.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-35.ps.gz
137. Characterizations of consistent marked graphs (with S. Xu), Discrete Applied Math., 127 (2003), 357-371.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-16.ps.gz
138. Extremal phylogeny numbers (with L. Sheng), J. Comb. Info., Syst. Sci., 24 (1999), 143-149.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1998/98-50.ps.gz
139. Competition graphs of semiorders and the condition C(p) (with S-R. Kim), Ars Combinatoria, 63 (2002), 161-173.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2000/2000-09.ps.gz
140. Applications of Graph Theory, in S. Hong, J.H. Kwak, J.H. Kim, and F.W. Roush (eds.), Combinatorial and Computational Mathematics, World Scientific Press, Singapore, 2001, 210-242.
Manuscript of article 140.
141. A measure of discrepancy of multiple sequences (with W. Fang and Z. Ma), J. Information Sciences, 137 (2001), 75-102.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-56.ps.gz
142. Minimal forbidden graphs for L(2,1)-colorings (with P.C. Fishburn), submitted.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2000/2000-32.ps.gz
143. The center function on trees (with F.R. McMorris and C. Wang), Networks, 38 (2001), 84-87.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2000/2000-41.ps.gz
144. Discrete mathematics, International Encyclopedia of the Social and Behavioral Sciences, Elsevier, 2001, 3743-3746.
Full article: Discrete mathematics
145. Consensus list colorings of graphs and physical mapping of DNA (with N.V.R. Mahadev), in M. Janowitz, F-J. Lapointe, F.R. McMorris, B. Mirkin, and F.S. Roberts (eds.), Bioconsensus, DIMACS Volume 61, American Mathematical Society, Providence, RI, 2003, 83-95.
PostScript version
LaTex version
146. No-hole L(2,1)-colorings (with P.C. Fishburn), Discrete Applied Mathematics, 130 (2003), 513-519.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-10.ps.gz
147. Challenges for discrete mathematics and theoretical computer science in the defense against bioterrorism, in C. Castillo-Chavez and H.T. Banks (eds.), Mathematical and Modeling Approaches in Homeland Security, SIAM Frontiers in Applied Mathematics Series, 2003, 1-34.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2002/2002-40.ps.gz
148. Monitoring message streams: Algorithmic methods for automatic processing of messages (with P.B. Kantor), Journal of the Intelligence Community Research and Development, February 2, 2007.
PS Version
149. Computational and mathematical epidemiology, Science: Next Wave, 2004. (Also Science, 303 (2004), 717.)
http://nextwave.sciencemag.org/cgi/content/full/2004/02/03/2 (AAAS Membership required to log-in to this article)
150. Digital biology: An emerging and promising discipline (with R.W. Morris, C.A. Bean, G.K. Farber, D. Gallahan, A. R. Hight-Walker, Y. Liu, P.M. Lyster, G.C.Y. Peng, M. Twery, and J. Whitmarsh), Trends in Biotechnology, 23 (2005), 113-117.
http://dx.doi.org/10.1016/j.tibtech.2005.01.005
151. Decision support algorithms for port-of-entry inspection, in Working Together: Research & Development Partnerships in Homeland Security, Proceedings of DHS/IEEE Conference, Boston, 2005.
MS Word Version
152. Locating sensors in paths and cycles: The case of 2-identifying codes (with D.L. Roberts).
Journal version: European Journal of Combinatorics, 29 (2008), 72-82. (PDF Format)
Technical Report version (slightly longer, PDF Format, with different title: The paradoxical nature of locating sensors in paths and cycles: The case of 2-identifying codes)
153. Experimental analysis of sequential decision making algorithms for port of entry inspection procedures (with S. Anand, D. Madigan, R. Mammone, S. Pathak), in S. Mehrotra, D. Zeng, H. Chen, B. Thuraisingham, and F-X Wang (eds.), Intelligence and Security Informatics, Proceedings of ISI-2006, Lecture Notes in Computer Science #3975, Springer-Verlag, New York, 2006, 319-330.
PDF Version
154. TOPOFF 3 comments and recommendations by members of New Jersey Universities Consortium for Homeland Security Research (with P.J. Lioy, B. McCluskey, M.J. Lioy, A. Cross, L. Clarke, L.L. Stanton, W. Tepfenhart, E. Ferrara), Journal of Emergency Management, 4 (2006), 41-51.
PDF Version
155. Full color theorems for L(2,1)-colorings (with P.C. Fishburn), SIAM Journal on Discrete Mathematics, 20 (2006), 428-443.
ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2000/2000-08.ps.gz
156. Computer science and decision theory, Annals of Operations Research, 163 (2008), 209-253.
PS Version
157. Sequential decision making algorithms for port of entry inspection: Overcoming computational challenges (with D. Madigan and S. Mittal), in G. Muresan, T. Altiok, B. Melamed, and D. Zeng (eds.), Proceedings of IEEE International Conference on Intelligence and Security Informatics (ISI-2007), IEEE Press, Piscataway, NJ, May 2007, 1-7.
PDF Version
158. Optimization problems for port-of-entry detection systems, (with E. Boros, E. Elsayed, P, Kantor, and M. Xie), in Intelligence and Security Informatics: Techniques and Applications, H. Chen and C. C. Yang (eds), Springer, 2008, 319-335.
PDF Version
159. Decision making using multi-attributed alternatives: Raiffa's contributions in the context of 21st century decision problems, J. of Multi-Criteria Decision Analysis, 14 (2008), 161-168.
PS Version
160. An application of Stahl's conjecture about the k-tuple chromatic numbers of Kneser graphs, in The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, 2009, 345-352.
PDF Version
161. The REU Program at DIMACS/Rutgers University (with B.J. Latka), J. A. Gallian (ed.), Proceedings of the Conference on Promoting Undergraduate Research in Mathematics, American Mathematical Society, Providence, RI, 2007, 131-136.
PDF Version
162. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (with P.A. Dreyer, Jr.), Discrete Applied Mathematics, 157 (2009), 1615-1627.
PDF Version
163. Efficient sequential decision-making algorithms for container inspection operations (with D. Madigan and S. Mittal), Naval Research Logistics, 58 (2011), 637-654.
PDF Version
164. Why BioMath? Why now?, M.B. Cozzens, and F.S. Roberts (eds.), BioMathematics in the Schools, DIMACS Volume Series, American Mathematical Society, Providence, RI, Vol. 76 (2011), 3-34.
PDF Version
165. Meaningful and meaningless statements in epidemiology and public health, in B. Berglund, G. B. Rossi, J. Townsend and L. Pendrill (Eds.), Measurements with Persons, Taylor and Francis, 2012, 75-95.
PDF Version
166. Design and deployment of a mobile sensor network for the surveillance of nuclear materials in metropolitan areas (with J. Cheng and M. Xie), in Proceedings of 15th International Conference on Reliability and Quality of Design (ISSAT09), 2009.
PDF Version
167. Greedy algorithms in economic epidemiology, A. Gumel and S. Lenhart (eds.), Modeling Paradigms and Analysis of Disease Transmission Models, American Mathematical Society, Providence, RI, Vol. 75 (2010), 249-268.
PDF Version
168. Sensor management problems of nuclear detection (with T. Carpenter, J. Cheng, F. Roberts and M. Xie), H. Pham (ed.), Safety and Risk Modeling and Their Applications, Springer, Springer, London, 2011, 299-322.
PDF Version
169. The port reopening scheduling problem, in H. Kaul and H.M. Mulder (eds.), Advances in Interdisciplinary Applied Discrete Mathematics. Interconnections between Consensus and Voting Theory, Clustering, Location Theory, Mathematical Biology, and Optimization, World Scientific, Vol. 11 (2011), 199-210.
PDF Version
170. The contributions of F.R. McMorris to discrete mathematics and its applications (with G.F. Estabrook, T.A. McKee, H.M. Mulder, and R.C. Powers), in H. Kaul and H.M. Mulder (eds.), Advances in Interdisciplinary Applied Discrete Mathematics Interconnections between Consensus and Voting Theory, Clustering, Location Theory, Mathematical Biology, and Optimization, World Scientific, 11 (2011), 225-241.
PDF Version
171. Urban commerce and security study, Journal of Homeland Security, 2011.
PDF Version
172. A set of blended risk-based decision support tools for protecting passenger rail-centered transit corridors against cascading impacts of terrorist attacks (with M. Greenberg, T. Altiok, N. Fefferman, P. Georgopoulos, C. Lacy, M. Lahr, P. Lioy, K. Lowrie, H.Mayer, B. Ozbas), Journal of Homeland Security, 2011.
PDF Version
173. The challenges of multidisciplinary education in computer science, Journal of Computer Science and Technology, 26 (2011), 636-642.
PDF Version
174. A method for transferring probabilistic user models between environments (with D. Roberts), Proceedings of the Fourth International Conference on Interactive Digital Storytelling (ICIDS 2011), Vancouver, Canada, Lecture Notes in Computer Science, Springer, Vol 7065, (2011), 43-54.
PDF Version
175. A latent model to detect multiple spatial clusters with application in a mobile sensor network for surveillance of nuclear materials (with J. Cheng, R. Chen, and M. Xie), Journal of the American Statistical Association, Journal of the American Statistical Association, 108 (2013), 902-913.
PDF Version
176. Meaningful and meaningless statements in landscape ecology and environmental sustainability, (2013), in P. Pardalos, B. Goldengorin, and F. Aleskerov (eds.), Clusters, Orders, Trees: Methods and Applications, Springer, 2014. 297-312.
PDF Version
177. Strategy-proof location functions on finite graphs (with F.R. McMorris and H.M. Mulder), (2013), in P. Pardalos, B. Goldengorin, and F. Aleskerov (eds.), Clusters, Orders, Trees: Methods and Applications, Springer, 2014, 63-75.
PDF Version
178. Estimating violation risk for fisheries regulations (with H. Chalupsky, R. DeMarco, E. Hovy, P. Kantor, A. Matlin, P. Mitra, B. Ozbas, J. Wojtowicz, M. Xie), in P. Perny, M. Pirlot, and A. Tsoukias (eds), Proceedings of International Conference on Algorithmic Decision Theory III, Lecture Notes in Computer Science, LNAI 8176, Springer, 2013, 297-308.
PDF Version
179. Modeling the impact of patron screening at an NFL stadium (with B.C. Ricks, B. Nakamura, A. Almaz, R. DeMarco, C. Hui, P. Kantor, A. Matlin, C. Nelson, H. Powell, and B. Thompson), in Y. Guan and H. Liao (eds), Proceedings of 2014 IIE Industrial and Systems Engineering Research Conference (ISERC2014), 2014, to appear.
PDF Version
180. ACCAM global optimization model for the USCG aviation air stations (with C. Nelson, P. Ball, E. Boros, C. Conrad, K. Hanson, J. Rubio-Herrero, P. Kantor, C. McGinity, B. Nakamura, T. Rader, B. Ricks), in Y. Guan and H. Liao (eds), Proceedings of 2014 IIE Industrial and Systems Engineering Research Conference (ISERC2014), 2014, to appear.
PDF Version
181. Risk analysis for flood mitigation on the Raritan (with G. Guo, P. Kantor, D. Robinson, C.A. Correa, B. Cignarella), Proceeding of the 6th International Conference on Flood Management - ICFM6: Floods in a changing Environment, Associocao Brasilera de Recursos Hidricos, (Brazilian Water Resource Association), 2014. http://www.abrh.org.br/icfm6/proceedings/.
PDF Version
182. Experimental designs for testing metal detectors at a large sports stadium (with C. Nelson, P. Kantor, D. Egan, A. Matlin, B. Nakamura, B. Ricks, M. Tobia, R. Whytlaw, M. Young),Proceedings 2015 IEEE Technologies for Homeland Security Symposium, IEEE, 2015.
PDF Version
183. The ACCAM model: Simulating aviation mission readiness for United States Coast Guard stations (with C. McGinity, E. Boros, K. Hanson, P. Kantor, B. Nakamura, C. Nelson, R. Rader, C. Conrad, B. Ricks, P. Ball),Proceedings 2015 IEEE Technologies for Homeland Security Symposium, IEEE, 2015, 1-7.
PDF Version
184. Optimal US Coast Guard boat allocations with sharing (with B. Nakamura, P. Ball, C. Conrad, E. Boros, K. Hanson, P. Kantor, C. McGinity, C. Nelson, M. Oster, B. Ricks, T. Rader, W. Yao), in S. Cetinkaya and J. K. Ryan, (eds.), Proceedings of the 2015 Industrial and Systems Engineering Research Conference, 2015, (winner of Best Paper award).
PDF Version
185. The Little-known Challenge of maritime cyber security (with D.A. Goward and J. DiRenzo III),Proceedings of the 6th International Conference on Information, Intelligence, Systems and Applications (IISA), IEEE, 2015, 1-5.
PDF Version
186. Meaningful and meaningless statements using metrics for the border condition, Proceedings of 2016 IEEE International Symposium on Technologies for Homeland Security, IEEE, in press (winner of Best Paper award).
PDF Version
187. Highly efficient evaluation design (HEED) for comparing algorithms used to detect nuclear materials (with P. Kantor, C. Nelson, W.M. Pottenger), in S. Cetinkaya and J.K. Ryan (eds.), Proc. 2015 Industrial and Systems Engineering Research Conference.
188. Information sharing for maritime cyber risk management (with D. Egan, D. Hering, P. Kantor, C. Nelson), in J. Direnzo, III, N. Drumhiller, and F.S. Roberts (eds.) Maritime Cyber Security, PSO/Westphalia Press, to appear.

DIMACS Homepage
Document last modified on November 29, 2016.