Michal Morayne

According to our database, Michal Morayne authored at least 18 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Secretary problem with hidden information; searching for a high merit candidate.

Ewa M. Kubicka, Grzegorz Kubicki, Malgorzata Kuchta, Michal Morayne

Adv. Appl. Math., 2023

2016

Random Hypergraph Irregularity.

Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2016

2015

From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path.

Andrzej Grzesik, Michal Morayne, Malgorzata Sulkowska

SIAM J. Discret. Math., 2015

2014

Inform friends, do not inform enemies.

Adam Kurpisz, Michal Morayne

IMA J. Math. Control. Inf., 2014

A Note on Counting Homomorphisms of Paths.

Roger B. Eggleton, Michal Morayne

Graphs Comb., 2014

2013

Repeated Degrees in Random Uniform Hypergraphs.

Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2013

2012

How to Choose the Best Twins.

Bryn Garrod, Grzegorz Kubicki, Michal Morayne

SIAM J. Discret. Math., 2012

The Bergman-Shelah preorder on transformation semigroups.

Zak Mesyan, James D. Mitchell, Michal Morayne, Yann H. Péresse

Math. Log. Q., 2012

2010

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.

James D. Mitchell, Michal Morayne, Yann H. Péresse, Martyn Quick

Ann. Pure Appl. Log., 2010

2009

Counting embeddings of a chain into a binary tree.

Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec

Ars Comb., 2009

2008

On a universal best choice algorithm for partially ordered sets.

Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec

Random Struct. Algorithms, 2008

2006

Counting chains and antichains in the complete binary tree.

Grzegorz Kubicki, Jeno Lehel, Michal Morayne

Ars Comb., 2006

2005

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case.

Grzegorz Kubicki, Michal Morayne

SIAM J. Discret. Math., 2005

Counting embeddings of a chain into a tree.

Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec

Discret. Math., 2005

2003

An Asymptotic Ratio in the Complete Binary Tree.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

Order, 2003

2002

Patch Colorings and Rigid Colorings of the Rational n-Space.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

J. Comb. Theory B, 2002

A Ratio Inequality For Binary Trees And The Best Secretary.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

Comb. Probab. Comput., 2002

1998

Partial-order analogue of the secretary problem the binary tree case.

Michal Morayne

Discret. Math., 1998