Robert S. Garfinkel

According to our database1, Robert S. Garfinkel authored at least 34 papers between 1971 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Risk aversion and loss aversion in core-selecting auctions.
Decis. Support Syst., 2015

2014
Identity matching and information acquisition: Estimation of optimal threshold parameters.
Decis. Support Syst., 2014

2012
Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons.
Manufacturing & Service Operations Management, 2012

2011
Optimal Testing of Digital Microfluidic Biochips.
INFORMS J. Comput., 2011

A Clock-and-Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs.
INFORMS J. Comput., 2011

2010
Empirical Analysis of the Impact of Recommender Systems on Sales.
J. Manag. Inf. Syst., 2010

Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection.
INFORMS J. Comput., 2010

Improving patient flow in a hospital through dynamic allocation of cardiac diagnostic testing time slots.
Decis. Support Syst., 2010

2009
OR Practice - Efficient Short-Term Allocation and Reallocation of Patients to Floors of a Hospital During Demand Surges.
Oper. Res., 2009

2008
A Market Design for Grid Computing.
INFORMS J. Comput., 2008

CVC-STAR: Protecting data confidentiality while increasing flexibility and quality of responses.
IJICS, 2008

Shopbot 2.0: Integrating recommendations and promotions with comparison shopping.
Decis. Support Syst., 2008

2007
Releasing Individually Identifiable Microdata with Privacy Protection Against Stochastic Threat: An Application to Health Information.
Inf. Syst. Res., 2007

Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction.
Oper. Res., 2007

2006
Secure electronic markets for private information.
IEEE Trans. Syst. Man Cybern. Part A, 2006

Design of a shopbot and recommender system for bundle purchases.
Decis. Support Syst., 2006

Electronic Markets for Private Information: Economic and Security Considerations.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

New Approaches to Disclosure Limitation While Answering Queries to a Database: Protecting Numerical Confidential Data against Insider Threat Based on Data or Algorithms.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

2004
Security, Privacy and a Trusted Information Intermediary: A Compensation Model and Markets for Private Information.
Proceedings of the 10th Americas Conference on Information Systems, 2004

2003
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation.
Oper. Res., 2003

Design of an interactive spell checker: optimizing the list of offered words.
Decis. Support Syst., 2003

2002
Privacy Protection of Binary Confidential Data Against Deterministic, Stochastic, and Insider Threat.
Manag. Sci., 2002

Confidentiality via Camouflage: The CVC Approach to Disclosure Limitation When Answering Queries to Databases.
Oper. Res., 2002

1999
On crossings, the Crossing Postman Problem, and the Rural Postman Problem.
Networks, 1999

1998
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths.
Oper. Res., 1998

Interval Protection of Confidential Information in a Database.
INFORMS J. Comput., 1998

1991
Finite Dominating Sets for Network Location Problems.
Oper. Res., 1991

1989
On the Vector Assignment <i>p</i>-Median Problem.
Transportation Science, 1989

1982
The generalized diameter of a graph.
Networks, 1982

1978
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis.
J. ACM, 1978

1977
Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems.
Oper. Res., 1977

1976
Bottleneck linear programming.
Math. Program., 1976

1973
Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem.
Oper. Res., 1973

1971
Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem.
Oper. Res., 1971


  Loading...