Robert Garfinkel

Available identifiers

zbMath Open garfinkel.robert-sMaRDI QIDQ997930

List of research outcomes

Publication	Date of Publication	Type
A clock-and-offer auction market for grid resources when bidders face stochastic computational needs	2012-07-28	Paper
Freedom of privacy: anonymous data collection with respondent-defined privacy protection	2012-07-28	Paper
Optimal testing of digital microfluidic biochips	2012-07-28	Paper
Stochastic Protection of Confidential Information in Databases: A Hybrid of Data Perturbation and Query Restriction	2009-08-13	Paper
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation	2009-07-05	Paper
Confidentiality via Camouflage: The CVC Approach to Disclosure Limitation When Answering Queries to Databases	2009-07-03	Paper
The \(k\)-centrum shortest path problem	2007-08-08	Paper
Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths	2002-03-18	Paper
On crossings, the crossing postman problem, and the rural postman problem	2002-01-27	Paper
Interval Protection of Confidential Information in a Database	1998-01-01	Paper
Fixed Cycle Scheduling: A Solvable Problem with Empty Precedence Structure	1990-01-01	Paper
On the Vector Assignment p-Median Problem	1989-01-01	Paper
Error Localization for Erroneous Data: Continuous Data, Linear Constraints	1988-01-01	Paper
Optimal Imputation of Erroneous Data: Categorical Data, General Edits	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3686458	1985-01-01	Paper
Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem	1984-01-01	Paper
The generalized diameter of a graph	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3900073	1981-01-01	Paper
Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3879043	1979-01-01	Paper
The Bottleneck Traveling Salesman Problem	1978-01-01	Paper
Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems	1977-01-01	Paper
Bottleneck linear programming	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3214706	1973-01-01	Paper
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5675139	1972-01-01	Paper
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem	1971-01-01	Paper
Optimal Political Districting by Implicit Enumeration Techniques	1970-01-01	Paper
The Set-Partitioning Problem: Set Covering with Equality Constraints	1969-01-01	Paper

Research outcomes over time

This page was built for person: Robert Garfinkel