Michal Morayne

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 2

Top Topics

Hypergraph Model

Randomly Distributed

Top Venues

SIAM J. Discret. Math.

IMA J. Math. Control. Inf.

Publications

Ewa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Michal Morayne
Secretary problem with hidden information; searching for a high merit candidate. Adv. Appl. Math. 144 (2023)
Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30 (1) (2016)
Andrzej Grzesik, Michal Morayne, Malgorzata Sulkowska
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path. SIAM J. Discret. Math. 29 (1) (2015)
Roger B. Eggleton, Michal Morayne
A Note on Counting Homomorphisms of Paths. Graphs Comb. 30 (1) (2014)
Adam Kurpisz, Michal Morayne
Inform friends, do not inform enemies. IMA J. Math. Control. Inf. 31 (3) (2014)
Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27 (1) (2013)
Zak Mesyan, James D. Mitchell, Michal Morayne, Yann H. Péresse
The Bergman-Shelah preorder on transformation semigroups. Math. Log. Q. 58 (6) (2012)
Bryn Garrod, Grzegorz Kubicki, Michal Morayne
How to Choose the Best Twins. SIAM J. Discret. Math. 26 (1) (2012)
James D. Mitchell, Michal Morayne, Yann H. Péresse, Martyn Quick
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. Ann. Pure Appl. Log. 161 (12) (2010)
Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec
Counting embeddings of a chain into a binary tree. Ars Comb. 91 (2009)
Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec
On a universal best choice algorithm for partially ordered sets. Random Struct. Algorithms 32 (3) (2008)
Grzegorz Kubicki, Jeno Lehel, Michal Morayne
Counting chains and antichains in the complete binary tree. Ars Comb. 79 (2006)
Grzegorz Kubicki, Michal Morayne
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case. SIAM J. Discret. Math. 19 (3) (2005)
Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec
Counting embeddings of a chain into a tree. Discret. Math. 297 (1-3) (2005)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
An Asymptotic Ratio in the Complete Binary Tree. Order 20 (2) (2003)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
A Ratio Inequality For Binary Trees And The Best Secretary. Comb. Probab. Comput. 11 (2) (2002)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory, Ser. B 84 (1) (2002)
Michal Morayne
Partial-order analogue of the secretary problem the binary tree case. Discret. Math. 184 (1-3) (1998)