Michal Morayne

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Secretary problem with hidden information; searching for a high merit candidate.
Adv. Appl. Math., 2023

2016
Random Hypergraph Irregularity.
SIAM J. Discret. Math., 2016

2015
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path.
SIAM J. Discret. Math., 2015

2014
Inform friends, do not inform enemies.
IMA J. Math. Control. Inf., 2014

A Note on Counting Homomorphisms of Paths.
Graphs Comb., 2014

2013
Repeated Degrees in Random Uniform Hypergraphs.
SIAM J. Discret. Math., 2013

2012
How to Choose the Best Twins.
SIAM J. Discret. Math., 2012

The Bergman-Shelah preorder on transformation semigroups.
Math. Log. Q., 2012

2010
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.
Ann. Pure Appl. Log., 2010

2009
Counting embeddings of a chain into a binary tree.
Ars Comb., 2009

2008
On a universal best choice algorithm for partially ordered sets.
Random Struct. Algorithms, 2008

2006
Counting chains and antichains in the complete binary tree.
Ars Comb., 2006

2005
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case.
SIAM J. Discret. Math., 2005

Counting embeddings of a chain into a tree.
Discret. Math., 2005

2003
An Asymptotic Ratio in the Complete Binary Tree.
Order, 2003

2002
Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory, Ser. B, 2002

A Ratio Inequality For Binary Trees And The Best Secretary.
Comb. Probab. Comput., 2002

1998
Partial-order analogue of the secretary problem the binary tree case.
Discret. Math., 1998


  Loading...