![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Robert S. Garfinkel
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j35]Mark Schneider, Robert Day, Robert S. Garfinkel:
Risk aversion and loss aversion in core-selecting auctions. Decis. Support Syst. 79: 161-170 (2015) - 2014
- [j34]Pantea Alirezazadeh, Fidan Boylu, Robert S. Garfinkel, Ram D. Gopal
, Paulo B. Góes:
Identity matching and information acquisition: Estimation of optimal threshold parameters. Decis. Support Syst. 57: 160-171 (2014) - 2012
- [j33]Robert Day, Robert S. Garfinkel, Steven M. Thompson:
Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons. Manuf. Serv. Oper. Manag. 14(4): 567-583 (2012) - 2011
- [j32]Bogdan Pasaniuc, Robert S. Garfinkel, Ion I. Mandoiu, Alexander Zelikovsky
:
Optimal Testing of Digital Microfluidic Biochips. INFORMS J. Comput. 23(4): 518-529 (2011) - [j31]Ravi Bapna, Sanjukta Das, Robert Day, Robert S. Garfinkel, Jan Stallaert:
A Clock-and-Offer Auction Market for Grid Resources When Bidders Face Stochastic Computational Needs. INFORMS J. Comput. 23(4): 630-647 (2011) - 2010
- [j30]Robert W. Day, Matthew D. Dean, Robert S. Garfinkel, Steven M. Thompson:
Improving patient flow in a hospital through dynamic allocation of cardiac diagnostic testing time slots. Decis. Support Syst. 49(4): 463-473 (2010) - [j29]Rajeev Kumar, Ram D. Gopal
, Robert S. Garfinkel:
Freedom of Privacy: Anonymous Data Collection with Respondent-Defined Privacy Protection. INFORMS J. Comput. 22(3): 471-481 (2010) - [j28]Bhavik Pathak, Robert S. Garfinkel, Ram D. Gopal
, Rajkumar Venkatesan, Fang Yin:
Empirical Analysis of the Impact of Recommender Systems on Sales. J. Manag. Inf. Syst. 27(2): 159-188 (2010)
2000 – 2009
- 2009
- [j27]Steven M. Thompson, Manuel A. Nunez, Robert S. Garfinkel, Matthew D. Dean:
OR Practice - Efficient Short-Term Allocation and Reallocation of Patients to Floors of a Hospital During Demand Surges. Oper. Res. 57(2): 261-273 (2009) - 2008
- [j26]Robert S. Garfinkel, Ram D. Gopal
, Bhavik Pathak, Fang Yin:
Shopbot 2.0: Integrating recommendations and promotions with comparison shopping. Decis. Support Syst. 46(1): 61-69 (2008) - [j25]Daniel O. Rice, Robert S. Garfinkel, Ram D. Gopal:
CVC-STAR: Protecting data confidentiality while increasing flexibility and quality of responses. Int. J. Inf. Comput. Secur. 2(2): 175-196 (2008) - [j24]Ravi Bapna, Sanjukta Das, Robert S. Garfinkel, Jan Stallaert:
A Market Design for Grid Computing. INFORMS J. Comput. 20(1): 100-111 (2008) - 2007
- [j23]Manuel A. Nunez, Robert S. Garfinkel, Ram D. Gopal
:
Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction. Oper. Res. 55(5): 890-908 (2007) - [j22]Robert S. Garfinkel, Ram D. Gopal
, Steven M. Thompson:
Releasing Individually Identifiable Microdata with Privacy Protection Against Stochastic Threat: An Application to Health Information. Inf. Syst. Res. 18(1): 23-41 (2007) - 2006
- [j21]Robert S. Garfinkel, Ram D. Gopal
, Arvind K. Tripathi, Fang Yin:
Design of a shopbot and recommender system for bundle purchases. Decis. Support Syst. 42(3): 1974-1986 (2006) - [j20]Robert S. Garfinkel, Ram D. Gopal
, Manuel A. Nunez, Daniel O. Rice:
Secure electronic markets for private information. IEEE Trans. Syst. Man Cybern. Part A 36(3): 461-471 (2006) - [c3]Robert S. Garfinkel, Ram D. Gopal, Daniel O. Rice:
New Approaches to Disclosure Limitation While Answering Queries to a Database: Protecting Numerical Confidential Data against Insider Threat Based on Data or Algorithms. HICSS 2006 - [c2]Ram D. Gopal, Robert S. Garfinkel, Manuel A. Nunez, Daniel O. Rice:
Electronic Markets for Private Information: Economic and Security Considerations. HICSS 2006 - 2004
- [c1]Daniel O. Rice, Robert S. Garfinkel, Ram D. Gopal:
Security, Privacy and a Trusted Information Intermediary: A Compensation Model and Markets for Private Information. AMCIS 2004: 177 - 2003
- [j19]Robert S. Garfinkel, Elena Fernández
, Ram D. Gopal
:
Design of an interactive spell checker: optimizing the list of offered words. Decis. Support Syst. 35(3): 385-397 (2003) - [j18]Elena Fernández
, Oscar Meza, Robert S. Garfinkel, Maruja Ortega:
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation. Oper. Res. 51(2): 281-291 (2003) - 2002
- [j17]Ram D. Gopal
, Robert S. Garfinkel, Paulo B. Góes:
Confidentiality via Camouflage: The CVC Approach to Disclosure Limitation When Answering Queries to Databases. Oper. Res. 50(3): 501-516 (2002) - [j16]Robert S. Garfinkel, Ram D. Gopal
, Paulo B. Góes:
Privacy Protection of Binary Confidential Data Against Deterministic, Stochastic, and Insider Threat. Manag. Sci. 48(6): 749-764 (2002)
1990 – 1999
- 1999
- [j15]Robert S. Garfinkel, Ian R. Webb:
On crossings, the Crossing Postman Problem, and the Rural Postman Problem. Networks 34(3): 173-180 (1999) - 1998
- [j14]Ram D. Gopal, Paulo B. Góes, Robert S. Garfinkel:
Interval Protection of Confidential Information in a Database. INFORMS J. Comput. 10(3): 309-322 (1998) - [j13]Elena Fernández
, Robert S. Garfinkel, Román Arbiol:
Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths. Oper. Res. 46(3): 293-304 (1998) - 1991
- [j12]John N. Hooker, Robert S. Garfinkel, C. K. Chen:
Finite Dominating Sets for Network Location Problems. Oper. Res. 39(1): 100-118 (1991) - 1990
- [j11]Robert S. Garfinkel, W. J. Plotnicki:
Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure. Oper. Res. 38(4): 629-633 (1990)
1980 – 1989
- 1989
- [j10]John N. Hooker, Robert S. Garfinkel:
On the Vector Assignment p-Median Problem. Transp. Sci. 23(2): 139-140 (1989) - 1986
- [j9]Robert S. Garfinkel, Anand S. Kunnathur, Gunar E. Liepins:
Optimal Imputation of Erroneous Data: Categorical Data, General Edits. Oper. Res. 34(5): 744-751 (1986) - 1982
- [j8]Chih-Kang Eric Chen, Robert S. Garfinkel:
The generalized diameter of a graph. Networks 12(3): 335-340 (1982) - 1980
- [j7]Robert S. Garfinkel, W. J. Plotnicki:
Technical Note - A Solvable Cyclic Scheduling Problem with Serial Precedence Structure. Oper. Res. 28(5): 1236-1240 (1980)
1970 – 1979
- 1978
- [j6]Robert S. Garfinkel, K. C. Gilbert:
The Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis. J. ACM 25(3): 435-448 (1978) - 1977
- [j5]Robert S. Garfinkel:
Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems. Oper. Res. 25(5): 741-751 (1977) - 1976
- [j4]Robert S. Garfinkel, Mendu Rao:
Bottleneck linear programming. Math. Program. 11(1): 291-298 (1976) - 1973
- [j3]Robert S. Garfinkel:
Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem. Oper. Res. 21(1): 340-343 (1973) - 1971
- [j2]Robert S. Garfinkel:
Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem. Oper. Res. 19(7): 1747-1751 (1971)
1960 – 1969
- 1969
- [j1]Robert S. Garfinkel, George L. Nemhauser:
The Set-Partitioning Problem: Set Covering with Equality Constraints. Oper. Res. 17(5): 848-856 (1969)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint