Fred S. Roberts

According to our database1, Fred S. Roberts authored at least 76 papers between 1972 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Obituary: Peter C. Fishburn (1936-2021).
Discret. Appl. Math., 2022

Optimal Layered Defense For Site Protection.
CoRR, 2022

Supply Chain Threats and Countermeasures: From Elicitation through Optimization.
Proceedings of the 55th Hawaii International Conference on System Sciences, 2022

2021
Chapter 5 Robotics as an Enabler of Resiliency to Disasters: Promises and Pitfalls.
Proceedings of the Resilience in the Digital Age, 2021

Chapter 7 Data Science and Resilience.
Proceedings of the Resilience in the Digital Age, 2021

Chapter 1 Resilience Algorithms in Complex Networks.
Proceedings of the Resilience in the Digital Age, 2021

Peter C. Fishburn (1936-2021).
Soc. Choice Welf., 2021

2020
Generation of crowd arrival and destination locations/times in complex transit facilities.
Vis. Comput., 2020

2015
The little-known challenge of maritime cyber security.
Proceedings of the 6th International Conference on Information, 2015

2013
Estimating Violation Risk for Fisheries Regulations.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2011
The Challenges of Multidisciplinary Education in Computer Science.
J. Comput. Sci. Technol., 2011

A Method for Transferring Probabilistic User Models between Environments.
Proceedings of the Interactive Storytelling, 2011

2010
Greedy Algorithms in Economic Epidemiology.
Proceedings of the Modeling Paradigms and Analysis of Disease Trasmission Models, 2010

Foreword.
Proceedings of the Modeling Paradigms and Analysis of Disease Trasmission Models, 2010

2009
Voting theory and preference modeling.
Math. Soc. Sci., 2009

Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion.
Discret. Appl. Math., 2009

An Application of Stahl's Conjecture About the k-Tuple Chromatic Numbers of Kneser Graphs.
Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008
Optimization Problems for Port-of-Entry Detection Systems.
Proceedings of the Intelligence and Security Informatics, Techniques and Applications, 2008

Locating sensors in paths and cycles: The case of 2-identifying codes.
Eur. J. Comb., 2008

Computer science and decision theory: preface.
Ann. Oper. Res., 2008

Computer science and decision theory.
Ann. Oper. Res., 2008

2007
Sequential Decision Making Algorithms for Port of Entry Inspection: Overcoming Computational Challenges.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2007

2006
Full Color Theorems for L(2, 1)-Colorings.
SIAM J. Discret. Math., 2006

Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures.
Proceedings of the Intelligence and Security Informatics, 2006

2005
Why BioMath? Why Now?
Proceedings of the BioMath in the Schools, 2005

Preface.
Proceedings of the BioMath in the Schools, 2005

Applied combinatorics (2. ed.).
Prentice Hall, ISBN: 978-0-13-079603-5, 2005

2003
Characterizations of Consistent Marked Graphs.
Discret. Appl. Math., 2003

No-hole L(2, 1)-colorings.
Discret. Appl. Math., 2003

2002
Competition graphs of semiorders and the conditions C(p) and C*(p).
Ars Comb., 2002

2001
How hard is it to determine if a graph has a 2-role assignment?
Networks, 2001

The center function on trees.
Networks, 2001

The role assignment model nearly fits most social networks.
Math. Soc. Sci., 2001

A measure of discrepancy of multiple sequences.
Inf. Sci., 2001

Consensus list colorings of graphs and physical mapping of DNA.
Proceedings of the Bioconsensus, 2001

2000
Optimal Orientations of Annular Networks.
J. Interconnect. Networks, 2000

Phylogeny numbers for graphs with two triangles.
Discret. Appl. Math., 2000

1999
On balanced signed graphs and consistent marked graphs.
Electron. Notes Discret. Math., 1999

1998
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
Oper. Res., 1998

Phylogeny Numbers.
Discret. Appl. Math., 1998

The Median Procedure on Median Graphs.
Discret. Appl. Math., 1998

The Elimination Procedure for the Competition Number.
Ars Comb., 1998

1997
Amenable Colorings.
Discret. Appl. Math., 1997

Competition Numbers of Graphs with a Small Number of Triangles.
Discret. Appl. Math., 1997

Meaningless statements.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
An Impossibility Result in Axiomatic Location Theory.
Math. Oper. Res., 1996

Phylogeny graphs of arbitrary digraphs.
Proceedings of the Mathematical Hierarchies and Biology, 1996

Foreword.
Proceedings of the Spin Verification System, 1996

1995
Edge-tenacious networks.
Networks, 1995

The Reversing Number of a Digraph.
Discret. Appl. Math., 1995

1994
On the Optimal Strongly Connected Orientations of City Street Graphs IV: Four East-West Avenues or North-South Streets.
Discret. Appl. Math., 1994

Chapter 18 Limitations on conclusions using scales of measurement.
Proceedings of the Operations research and the public sector, 1994

1993
<i>p</i>-Competition Numbers.
Discret. Appl. Math., 1993

Elemantary Sequences, Sub-Fibonacci Sequences.
Discret. Appl. Math., 1993

1992
2-Competition Graphs.
SIAM J. Discret. Math., 1992

On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets.
Networks, 1992

The Role of Applications in Teaching Discrete Mathematics.
Proceedings of the Discrete Mathematics in the Schools, 1992

1991
T-colorings of graphs: recent results and open problems.
Discret. Math., 1991

On the use of augmenting chains in chain packings.
Discret. Appl. Math., 1991

(i, j) competition graphs.
Discret. Appl. Math., 1991

Acknowledgement.
Discret. Appl. Math., 1991

1990
Meaningfulness of conclusions from combinatorial optimization.
Discret. Appl. Math., 1990

Van Lier sequences.
Discret. Appl. Math., 1990

1989
On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North - South Streets.
Networks, 1989

On dimensional properties of graphs.
Graphs Comb., 1989

1988
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids.
SIAM J. Discret. Math., 1988

Unique Finite Difference Measurement.
SIAM J. Discret. Math., 1988

Tight and loose value automorphisms.
Discret. Appl. Math., 1988

1985
Applications of edge coverings by cliques.
Discret. Appl. Math., 1985

1984
Applications of Ramsey theory.
Discret. Appl. Math., 1984

1983
<i>I</i>-Colorings, <i>I</i>-Phasings, and <i>I</i>-Intersection assignments for graphs, and their applications.
Networks, 1983

Optimal <i>I</i>-Intersection assignments for graphs: A linear programming approach.
Networks, 1983

A characterization of competition graphs of arbitrary digraphs.
Discret. Appl. Math., 1983

Computing the boxicity of a graph by covering its complement by cointerval graphs.
Discret. Appl. Math., 1983

1973
Tolerance geometry.
Notre Dame J. Formal Log., 1973

1972
Partial orders of dimension 2.
Networks, 1972


  Loading...