Author of the publication

Sequential search using question-sets with bounded intersections

. Journal of Statistical Planning and Inference, 7 (2): 139--150 (December 1982)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Generating All Sets With Bounded Unions., , and . Comb. Probab. Comput., 17 (5): 641-660 (2008)Coloring precolored perfect graphs., and . J. Graph Theory, 25 (3): 207-215 (1997)The salesman's improved tours for fundamental classes., and . Math. Program., 186 (1): 289-307 (2021)On the Clique-Rank and the Coloration of Perfect Graphs., and . IPCO, page 201-216. University of Waterloo Press, (1990)Circuit packings on surfaces with at most three cross-caps.. IPCO, page 433-446. CIACO, (1993)The Cographic Multiflow Problem: An Epilogue.. Polyhedral Combinatorics, volume 1 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 203-234. DIMACS/AMS, (1990)Characterizing Noninteger Polyhedra with 0-1 Constraints.. IPCO, том 1412 из Lecture Notes in Computer Science, стр. 37-52. Springer, (1998)The Salesman's Improved Paths: A 3/2+1/34 Approximation., и . FOCS, стр. 118-127. IEEE Computer Society, (2016)Forcing Colorations and the Strong Perfect Graph Conjecture.. IPCO, стр. 353-366. Carnegie Mellon University, (1992)How many matchings cover the nodes of a graph?, , , и . CoRR, (2018)