# Fred S. Roberts

Orcid: 0000-0001-8421-4759
According to our database

Collaborative distances:

^{1}, Fred S. Roberts authored at least 77 papers between 1972 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

Evaluating the Effectiveness of Countermeasures in ICT Supply Chains Through Elicitation-Informed Simulation.

Proceedings of the Winter Simulation Conference, 2023

2022

Discret. Appl. Math., 2022

CoRR, 2022

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

Proceedings of the Resilience in the Digital Age, 2021

Proceedings of the Resilience in the Digital Age, 2021

Soc. Choice Welf., 2021

2020

Generation of crowd arrival and destination locations/times in complex transit facilities.

Vis. Comput., 2020

2015

Proceedings of the 6th International Conference on Information, 2015

2013

Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2011

J. Comput. Sci. Technol., 2011

Proceedings of the Interactive Storytelling, 2011

2010

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

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

Proceedings of the Intelligence and Security Informatics, Techniques and Applications, 2008

Eur. J. Comb., 2008

Ann. Oper. Res., 2008

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

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

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

Discret. Appl. Math., 2003

Discret. Appl. Math., 2003

2002

Competition graphs of semiorders and the conditions C(p) and C*(p).

Ars Comb., 2002

2001

Networks, 2001

Networks, 2001

Math. Soc. Sci., 2001

Inf. Sci., 2001

Proceedings of the Bioconsensus, 2001

2000

J. Interconnect. Networks, 2000

Discret. Appl. Math., 2000

1999

Electron. Notes Discret. Math., 1999

1998

On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?

Oper. Res., 1998

Discret. Appl. Math., 1998

Discret. Appl. Math., 1998

The Elimination Procedure for the Competition Number.

Ars Comb., 1998

1997

Discret. Appl. Math., 1997

Discret. Appl. Math., 1997

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

1996

Math. Oper. Res., 1996

Proceedings of the Mathematical Hierarchies and Biology, 1996

Foreword.

Proceedings of the Spin Verification System, 1996

1995

Networks, 1995

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

Proceedings of the Operations research and the public sector, 1994

1993

Discret. Appl. Math., 1993

Discret. Appl. Math., 1993

1992

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

Proceedings of the Discrete Mathematics in the Schools, 1992

1991

Discret. Math., 1991

Discret. Appl. Math., 1991

Discret. Appl. Math., 1991

Discret. Appl. Math., 1991

1990

Discret. Appl. Math., 1990

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

Graphs Comb., 1989

1988

On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids.

SIAM J. Discret. Math., 1988

SIAM J. Discret. Math., 1988

Discret. Appl. Math., 1988

1985

Discret. Appl. Math., 1985

1984

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

Discret. Appl. Math., 1983

Computing the boxicity of a graph by covering its complement by cointerval graphs.

Discret. Appl. Math., 1983

1973

Notre Dame J. Formal Log., 1973

1972

Networks, 1972