default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFred S. Roberts
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c16]Rong Lei, Samar Saleh, Weihong Grace Guo, Elsayed A. Elsayed, Fred S. Roberts, Paul B. Kantor:
Evaluating the Effectiveness of Countermeasures in ICT Supply Chains Through Elicitation-Informed Simulation. WSC 2023: 1292-1303- 2022
- [j54]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Obituary: Peter C. Fishburn (1936-2021). Discret. Appl. Math. 310: 109-110 (2022) - [c15]Weihong (Grace) Guo, Paul B. Kantor, Elsayed A. Elsayed, Eric Rosenberg, Rong Lei, Sachin Patel, Brendan Ruskey, Fred S. Roberts:
Supply Chain Threats and Countermeasures: From Elicitation through Optimization. HICSS 2022: 1-10 - [i1]Tsvetan Asamov, Emre Yamangil, Endre Boros, Paul B. Kantor, Fred S. Roberts:
Optimal Layered Defense For Site Protection. CoRR abs/2204.08961 (2022) - 2021
- [j53]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Peter C. Fishburn (1936-2021). Math. Soc. Sci. 113: 230-231 (2021) - [j52]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Peter C. Fishburn (1936-2021). Soc. Choice Welf. 57(1): 1-3 (2021) - [p6]Fred S. Roberts:
Chapter 1 Resilience Algorithms in Complex Networks. Resilience in the Digital Age 2021: 3-15 - [p5]Rui Wang, Daniel Nakhimovich
, Fred S. Roberts, Kostas E. Bekris:
Chapter 5 Robotics as an Enabler of Resiliency to Disasters: Promises and Pitfalls. Resilience in the Digital Age 2021: 75-101 - [p4]Fred S. Roberts:
Chapter 7 Data Science and Resilience. Resilience in the Digital Age 2021: 118-138 - [e11]Fred S. Roberts, Igor A. Sheremet:
Resilience in the Digital Age. Lecture Notes in Computer Science 12660, Springer 2021, ISBN 978-3-030-70369-1 [contents] - 2020
- [j51]Brian Ricks, Andrew Dobson, Athanasios Krontiris, Kostas E. Bekris, Mubbasir Kapadia, Fred S. Roberts:
Generation of crowd arrival and destination locations/times in complex transit facilities. Vis. Comput. 36(8): 1651-1661 (2020)
2010 – 2019
- 2015
- [c14]Joseph DiRenzo, Dana A. Goward, Fred S. Roberts:
The little-known challenge of maritime cyber security. IISA 2015: 1-5 - 2013
- [c13]Hans Chalupsky, Robert DeMarco, Eduard H. Hovy, Paul B. Kantor, Alisa Matlin, Priyam Mitra, Birnur Ozbas, Fred S. Roberts, James Wojtowicz, Minge Xie:
Estimating Violation Risk for Fisheries Regulations. ADT 2013: 297-308 - 2011
- [j50]Fred S. Roberts:
The Challenges of Multidisciplinary Education in Computer Science. J. Comput. Sci. Technol. 26(4): 636-642 (2011) - [c12]David L. Roberts, Fred S. Roberts:
A Method for Transferring Probabilistic User Models between Environments. ICIDS 2011: 43-54 - [e10]Ronen I. Brafman, Fred S. Roberts, Alexis Tsoukiàs:
Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings. Lecture Notes in Computer Science 6992, Springer 2011, ISBN 978-3-642-24872-6 [contents] - [e9]Margaret B. Cozzens, Fred S. Roberts:
BioMath in the Schools, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, April 29-30, 2005. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 76, DIMACS/AMS 2011, ISBN 978-0-8218-4295-9 [contents] - 2010
- [c11]Fred S. Roberts:
Greedy Algorithms in Economic Epidemiology. Modeling Paradigms and Analysis of Disease Trasmission Models 2010: 249-268 - [c10]Fred S. Roberts:
Foreword. Modeling Paradigms and Analysis of Disease Trasmission Models 2010: vii-
2000 – 2009
- 2009
- [j49]Paul A. Dreyer Jr., Fred S. Roberts:
Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discret. Appl. Math. 157(7): 1615-1627 (2009) - [j48]Fred S. Roberts, Alexis Tsoukiàs:
Voting theory and preference modeling. Math. Soc. Sci. 57(3): 289-291 (2009) - [p3]Svata Poljak, Fred S. Roberts:
An Application of Stahl's Conjecture About the k-Tuple Chromatic Numbers of Kneser Graphs. The Mathematics of Preference, Choice and Order 2009: 345-352 - [e8]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
The Mathematics of Preference, Choice and Order. Studies in Choice and Welfare, Springer 2009, ISBN 978-3-540-79127-0 [contents] - 2008
- [j47]Fred S. Roberts, Alexis Tsoukiàs:
Computer science and decision theory: preface. Ann. Oper. Res. 163(1): 1-4 (2008) - [j46]Fred S. Roberts:
Computer science and decision theory. Ann. Oper. Res. 163(1): 209-253 (2008) - [j45]David L. Roberts, Fred S. Roberts:
Locating sensors in paths and cycles: The case of 2-identifying codes. Eur. J. Comb. 29(1): 72-82 (2008) - [p2]Endre Boros, Elsayed A. Elsayed, Paul B. Kantor, Fred S. Roberts, Minge Xie:
Optimization Problems for Port-of-Entry Detection Systems. Intelligence and Security Informatics 2008: 319-335 - 2007
- [c9]David Madigan, Sushil Mittal, Fred S. Roberts:
Sequential Decision Making Algorithms for Port of Entry Inspection: Overcoming Computational Challenges. ISI 2007: 1-7 - 2006
- [j44]Peter C. Fishburn, Fred S. Roberts:
Full Color Theorems for L(2, 1)-Colorings. SIAM J. Discret. Math. 20(2): 428-443 (2006) - [c8]Saket Anand, David Madigan, Richard J. Mammone, Saumitr Pathak, Fred S. Roberts:
Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures. ISI 2006: 319-330 - 2005
- [b1]Fred S. Roberts, Barry A. Tesman:
Applied combinatorics (2. ed.). Prentice Hall 2005, ISBN 978-0-13-079603-5, pp. I-XXII, 1-824 - [c7]Fred S. Roberts:
Why BioMath? Why Now? BioMath in the Schools 2005: 3-34 - [c6]Margaret B. Cozzens, Fred S. Roberts:
Preface. BioMath in the Schools 2005: ix- - [e7]Siemion Fajtlowicz, Patrick W. Fowler, Pierre Hansen, Melvin F. Janowitz, Fred S. Roberts:
Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69, DIMACS/AMS 2005, ISBN 978-0-8218-4380-2 [contents] - [e6]Paul B. Kantor, Gheorghe Muresan, Fred S. Roberts, Daniel Dajun Zeng, Fei-Yue Wang, Hsinchun Chen, Ralph C. Merkle:
Intelligence and Security Informatics, IEEE International Conference on Intelligence and Security Informatics, ISI 2005, Atlanta, GA, USA, May 19-20, 2005, Proceedings. Lecture Notes in Computer Science 3495, Springer 2005, ISBN 3-540-25999-6 [contents] - 2003
- [j43]Fred S. Roberts, Shaoji Xu:
Characterizations of Consistent Marked Graphs. Discret. Appl. Math. 127(2): 357-371 (2003) - [j42]Peter C. Fishburn, Fred S. Roberts:
No-hole L(2, 1)-colorings. Discret. Appl. Math. 130(3): 513-519 (2003) - [e5]Melvin F. Janowitz, François-Joseph Lapointe, Fred R. McMorris, Boris G. Mirkin, Fred S. Roberts:
Bioconsensus, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 61, DIMACS/AMS 2003, ISBN 978-0-8218-3197-7 [contents] - 2002
- [j41]Suh-Ryung Kim, Fred S. Roberts:
Competition graphs of semiorders and the conditions C(p) and C*(p). Ars Comb. 63 (2002) - 2001
- [j40]Weiwu Fang, Fred S. Roberts, Zhengrong Ma:
A measure of discrepancy of multiple sequences. Inf. Sci. 137(1-4): 75-102 (2001) - [j39]Aleksandar Pekec, Fred S. Roberts:
The role assignment model nearly fits most social networks. Math. Soc. Sci. 41(3): 275-293 (2001) - [j38]Fred S. Roberts, Li Sheng:
How hard is it to determine if a graph has a 2-role assignment? Networks 37(2): 67-73 (2001) - [j37]Fred R. McMorris, Fred S. Roberts, Chi Wang:
The center function on trees. Networks 38(2): 84-87 (2001) - [c5]Nadimpalli V. R. Mahadev, Fred S. Roberts:
Consensus list colorings of graphs and physical mapping of DNA. Bioconsensus 2001: 83-95 - 2000
- [j36]Fred S. Roberts, Li Sheng:
Phylogeny numbers for graphs with two triangles. Discret. Appl. Math. 103(1-3): 191-207 (2000) - [j35]Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts:
Optimal Orientations of Annular Networks. J. Interconnect. Networks 1(1): 21-46 (2000)
1990 – 1999
- 1999
- [j34]Fred S. Roberts:
On balanced signed graphs and consistent marked graphs. Electron. Notes Discret. Math. 2: 94-105 (1999) - [e4]Martin Farach-Colton, Fred S. Roberts, Martin Vingron, Michael S. Waterman:
Mathematical Support for Molecular Biology, Proceedings from the DIMACS Special Year, 1998. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 47, DIMACS/AMS 1999, ISBN 978-0-8218-0826-9 [contents] - [e3]Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts:
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, DIMACS/AMS 1999, ISBN 0-8218-0963-6 [contents] - 1998
- [j33]Suh-Ryung Kim, Fred S. Roberts:
The Elimination Procedure for the Competition Number. Ars Comb. 50 (1998) - [j32]Fred R. McMorris, Henry Martyn Mulder, Fred S. Roberts:
The Median Procedure on Median Graphs. Discret. Appl. Math. 84(1-3): 165-181 (1998) - [j31]Fred S. Roberts, Li Sheng:
Phylogeny Numbers. Discret. Appl. Math. 87(1-3): 213-228 (1998) - [j30]Nadimpalli V. R. Mahadev, Aleksandar Pekec, Fred S. Roberts:
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal? Oper. Res. 46(3-Supplement-3): S120-S134 (1998) - 1997
- [j29]Nadimpalli V. R. Mahadev, Fred S. Roberts:
Amenable Colorings. Discret. Appl. Math. 76(1-3): 225-238 (1997) - [j28]Suh-Ryung Kim, Fred S. Roberts:
Competition Numbers of Graphs with a Small Number of Triangles. Discret. Appl. Math. 78(1-3): 153-162 (1997) - [c4]Fred S. Roberts:
Meaningless statements. Contemporary Trends in Discrete Mathematics 1997: 257-274 - [e2]Boris G. Mirkin, Fred R. McMorris, Fred S. Roberts, Andrey Rzhetsky:
Mathematical Hierarchies and Biology, Proceedings of a DIMACS Workshop, November 13-15, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 37, DIMACS/AMS 1997, ISBN 978-0-8218-0762-0 [contents] - 1996
- [j27]Pierre Hansen, Fred S. Roberts:
An Impossibility Result in Axiomatic Location Theory. Math. Oper. Res. 21(1): 195-208 (1996) - [c3]Fred S. Roberts, Li Sheng:
Phylogeny graphs of arbitrary digraphs. Mathematical Hierarchies and Biology 1996: 233-238 - [c2]Fred S. Roberts, Bernard Chazelle, Stephen R. Mahaney:
Foreword. The Spin Verification System 1996: vii- - 1995
- [j26]Jean-Pierre Barthélemy, Olivier Hudry, Garth Isaak, Fred S. Roberts, Barry A. Tesman:
The Reversing Number of a Digraph. Discret. Appl. Math. 60(1-3): 39-76 (1995) - [j25]Barry L. Piazza, Fred S. Roberts, Sam Stueckle:
Edge-tenacious networks. Networks 25(1): 7-17 (1995) - 1994
- [j24]Fred S. Roberts, Yonghua Xu:
On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets. Discret. Appl. Math. 49(1-3): 331-356 (1994) - [p1]Fred S. Roberts:
Chapter 18 Limitations on conclusions using scales of measurement. Operations research and the public sector 1994: 621-671 - 1993
- [j23]Peter C. Fishburn, Fred S. Roberts:
Elemantary Sequences, Sub-Fibonacci Sequences. Discret. Appl. Math. 44(1-3): 261-281 (1993) - [j22]Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
p-Competition Numbers. Discret. Appl. Math. 46(1): 87-92 (1993) - 1992
- [j21]Fred S. Roberts, Yonghua Xu:
On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets. Networks 22(2): 109-143 (1992) - [j20]Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
2-Competition Graphs. SIAM J. Discret. Math. 5(4): 524-538 (1992) - [c1]Fred S. Roberts:
The Role of Applications in Teaching Discrete Mathematics. Discrete Mathematics in the Schools 1992: 105-117 - [e1]Joseph G. Rosenstein, Deborah S. Franzblau, Fred S. Roberts:
Discrete Mathematics in the Schools, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 2-4, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 36, DIMACS/AMS 1992, ISBN 978-0-8218-1137-5 [contents] - 1991
- [j19]Peter L. Hammer, Pierre Hansen, Fred S. Roberts:
Acknowledgement. Discret. Appl. Math. 30(2-3): 99 (1991) - [j18]Dominique de Werra, Fred S. Roberts:
On the use of augmenting chains in chain packings. Discret. Appl. Math. 30(2-3): 137-149 (1991) - [j17]Kim A. S. Hefner, Kathryn Fraughnaugh Jones, Suh-Ryung Kim, J. Richard Lundgren, Fred S. Roberts:
(i, j) competition graphs. Discret. Appl. Math. 32(3): 241-262 (1991) - [j16]Fred S. Roberts:
T-colorings of graphs: recent results and open problems. Discret. Math. 93(2-3): 229-245 (1991) - 1990
- [j15]Peter C. Fishburn, Fred S. Roberts, Helen M. Marcus-Roberts:
Van Lier sequences. Discret. Appl. Math. 27(3): 209-220 (1990) - [j14]Fred S. Roberts:
Meaningfulness of conclusions from combinatorial optimization. Discret. Appl. Math. 29(2-3): 221-241 (1990)
1980 – 1989
- 1989
- [j13]Margaret B. Cozzens, Fred S. Roberts:
On dimensional properties of graphs. Graphs Comb. 5(1): 29-46 (1989) - [j12]Fred S. Roberts, Yonghua Xu:
On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North - South Streets. Networks 19(2): 221-233 (1989) - 1988
- [j11]Fred S. Roberts, Zangwill Rosenbaum:
Tight and loose value automorphisms. Discret. Appl. Math. 22(1): 69-79 (1988) - [j10]Fred S. Roberts, Yonghua Xu:
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids. SIAM J. Discret. Math. 1(2): 199-222 (1988) - [j9]Peter C. Fishburn, Helen M. Marcus-Roberts, Fred S. Roberts:
Unique Finite Difference Measurement. SIAM J. Discret. Math. 1(3): 334-354 (1988) - 1985
- [j8]Fred S. Roberts:
Applications of edge coverings by cliques. Discret. Appl. Math. 10(1): 93-109 (1985) - 1984
- [j7]Fred S. Roberts:
Applications of Ramsey theory. Discret. Appl. Math. 9(3): 251-261 (1984) - 1983
- [j6]Margaret B. Cozzens, Fred S. Roberts:
Computing the boxicity of a graph by covering its complement by cointerval graphs. Discret. Appl. Math. 6(3): 217-228 (1983) - [j5]Fred S. Roberts, Jeffrey E. Steif:
A characterization of competition graphs of arbitrary digraphs. Discret. Appl. Math. 6(3): 323-326 (1983) - [j4]Robert J. Opsut, Fred S. Roberts:
Optimal I-Intersection assignments for graphs: A linear programming approach. Networks 13(3): 317-326 (1983) - [j3]Robert J. Opsut, Fred S. Roberts:
I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications. Networks 13(3): 327-345 (1983)
1970 – 1979
- 1973
- [j2]Fred S. Roberts:
Tolerance geometry. Notre Dame J. Formal Log. 14(1): 68-76 (1973) - 1972
- [j1]K. A. Baker, Peter C. Fishburn, Fred S. Roberts:
Partial orders of dimension 2. Networks 2(1): 11-28 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
