Michal Morayne - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2023

Secretary problem with hidden information; searching for a high merit candidateEwa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Michal Morayne. aam, 144:102468, 2023. [doi]

2016

Random Hypergraph IrregularityPaul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne. siamdm, 30(1):465-473, 2016. [doi]

2015

From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed PathAndrzej Grzesik, Michal Morayne, Malgorzata Sulkowska. siamdm, 29(1):500-513, 2015. [doi]

2014

A Note on Counting Homomorphisms of PathsRoger B. Eggleton, Michal Morayne. gc, 30(1):159-170, 2014. [doi]

Inform friends, do not inform enemiesAdam Kurpisz, Michal Morayne. imamci, 31(3):435-440, 2014. [doi]

2013

Repeated Degrees in Random Uniform HypergraphsPaul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne. siamdm, 27(1):145-154, 2013. [doi]

2012

How to Choose the Best TwinsBryn Garrod, Grzegorz Kubicki, Michal Morayne. siamdm, 26(1):384-398, 2012. [doi]

The Bergman-Shelah preorder on transformation semigroupsZak Mesyan, James D. Mitchell, Michal Morayne, Yann H. Péresse. mlq, 58(6):424-433, 2012. [doi]

2009

Counting embeddings of a chain into a binary treeMalgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec. arscom, 91, 2009.

2008

On a universal best choice algorithm for partially ordered setsNicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec. rsa, 32(3):263-273, 2008. [doi]

2006

Counting chains and antichains in the complete binary treeGrzegorz Kubicki, Jeno Lehel, Michal Morayne. arscom, 79, 2006.

2005

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path CaseGrzegorz Kubicki, Michal Morayne. siamdm, 19(3):622-632, 2005. [doi]

Counting embeddings of a chain into a treeMalgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec. DM, 297(1-3):49-59, 2005. [doi]

2003

An Asymptotic Ratio in the Complete Binary TreeGrzegorz Kubicki, Jenö Lehel, Michal Morayne. order, 20(2):91-97, 2003. [doi]

2002

A Ratio Inequality For Binary Trees And The Best SecretaryGrzegorz Kubicki, Jenö Lehel, Michal Morayne. cpc, 11(2):149-161, 2002.

Patch Colorings and Rigid Colorings of the Rational n-SpaceGrzegorz Kubicki, Jenö Lehel, Michal Morayne. JCT, 84(1):45-53, 2002. [doi]

1998

Partial-order analogue of the secretary problem the binary tree caseMichal Morayne. DM, 184(1-3):165-181, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL