Author of the publication

A Ratio Inequality For Binary Trees And The Best Secretary.

, , and . Combinatorics, Probability & Computing, 11 (2): 149-161 (2002)

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

Planar graphs and greatest common subgraphs.. Graphs and Combinatorics, 9 (2-4): 239-253 (1993)Chromatic sums for colorings avoiding monochromatic subgraphs., , and . Discussiones Mathematicae Graph Theory, 35 (3): 541-555 (2015)Agreement Subtrees, Metric and Consensus for Labeled Binary Trees., , , and . Partitioning Data Sets, volume 19 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 97-104. DIMACS/AMS, (1993)Patch Colorings and Rigid Colorings of the Rational n-Space., , and . J. Comb. Theory, Ser. B, 84 (1): 45-53 (2002)On multipartite tournaments., , , and . J. Comb. Theory, Ser. B, 52 (2): 284-300 (1991)A Ratio Inequality For Binary Trees And The Best Secretary., , and . Combinatorics, Probability & Computing, 11 (2): 149-161 (2002)Using Graph Distance in Object Recognition., , and . ACM Conference on Computer Science, page 43-48. ACM, (1990)Counting chains and antichains in the complete binary tree., , and . Ars Comb., (2006)On domination and reinforcement numbers in trees., , , , , and . Discrete Mathematics, 308 (7): 1165-1175 (2008)Approximation Algorithms for the Chromatic Sum., , and . Great Lakes Computer Science Conference, volume 507 of Lecture Notes in Computer Science, page 15-21. Springer, (1989)