| 2008 |
|---|
| 8 | EE | Nicholas Georgiou,
Malgorzata Kuchta,
Michal Morayne,
Jaroslaw Niemiec:
On a universal best choice algorithm for partially ordered sets.
Random Struct. Algorithms 32(3): 263-273 (2008) |
| 2006 |
|---|
| 7 | | Grzegorz Kubicki,
Jeno Lehel,
Michal Morayne:
Counting chains and antichains in the complete binary tree.
Ars Comb. 79: (2006) |
| 2005 |
|---|
| 6 | EE | Malgorzata Kuchta,
Michal Morayne,
Jaroslaw Niemiec:
Counting embeddings of a chain into a tree.
Discrete Mathematics 297(1-3): 49-59 (2005) |
| 5 | EE | Grzegorz Kubicki,
Michal Morayne:
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case.
SIAM J. Discrete Math. 19(3): 622-632 (2005) |
| 2003 |
|---|
| 4 | EE | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
An Asymptotic Ratio in the Complete Binary Tree.
Order 20(2): 91-97 (2003) |
| 2002 |
|---|
| 3 | | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
A Ratio Inequality For Binary Trees And The Best Secretary.
Combinatorics, Probability & Computing 11(2): (2002) |
| 2 | EE | Grzegorz Kubicki,
Jenö Lehel,
Michal Morayne:
Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory, Ser. B 84(1): 45-53 (2002) |
| 1998 |
|---|
| 1 | EE | Michal Morayne:
Partial-order analogue of the secretary problem the binary tree case.
Discrete Mathematics 184(1-3): 165-181 (1998) |
