A Ratio Inequality for Binary Trees and the Best Secretary
Combinatorics, Probability and Computing
On a universal best choice algorithm for partially ordered sets
Random Structures & Algorithms
Hiring a secretary from a poset
Proceedings of the 12th ACM conference on Electronic commerce
Note: Optimal stopping in a search for a vertex with full degree in a random graph
Discrete Applied Mathematics
Gusein-Zade problem for directed path
Discrete Optimization
The best-choice problem for partially ordered objects
Operations Research Letters
SIAM Journal on Discrete Mathematics
Note: The best choice problem for a union of two linear orders with common maximum
Discrete Applied Mathematics
Hi-index | 0.05 |