Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michal Morayne
2010 – today
- 2013
[j13]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne: Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discrete Math. 27(1): 145-154 (2013)- 2012
- [j12]Zak Mesyan, James D. Mitchell, Michal Morayne, Yann H. Péresse: The Bergman-Shelah preorder on transformation semigroups. Math. Log. Q. 58(6): 424-433 (2012)
- [j11]Bryn Garrod, Grzegorz Kubicki, Michal Morayne: How to Choose the Best Twins. SIAM J. Discrete Math. 26(1): 384-398 (2012)
- 2010
- [j10]James D. Mitchell, Michal Morayne, Yann H. Péresse, M. Quick: Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. Ann. Pure Appl. Logic 161(12): 1471-1485 (2010)
2000 – 2009
- 2009
- [j9]Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec: Counting embeddings of a chain into a binary tree. Ars Comb. 91 (2009)
- 2008
- [j8]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
- [j7]Grzegorz Kubicki, Jeno Lehel, Michal Morayne: Counting chains and antichains in the complete binary tree. Ars Comb. 79 (2006)
- 2005
- [j6]Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec: Counting embeddings of a chain into a tree. Discrete Mathematics 297(1-3): 49-59 (2005)
- [j5]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
- [j4]Grzegorz Kubicki, Jenö Lehel, Michal Morayne: An Asymptotic Ratio in the Complete Binary Tree. Order 20(2): 91-97 (2003)
- 2002
- [j3]Grzegorz Kubicki, Jenö Lehel, Michal Morayne: A Ratio Inequality For Binary Trees And The Best Secretary. Combinatorics, Probability & Computing 11(2): 149-161 (2002)
- [j2]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)
1990 – 1999
- 1998
- [j1]Michal Morayne: Partial-order analogue of the secretary problem the binary tree case. Discrete Mathematics 184(1-3): 165-181 (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-20 20:24 CEST by the dblp team