default search action
Michal Morayne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j18]Ewa M. Kubicka, Grzegorz Kubicki
, Malgorzata Kuchta, Michal Morayne:
Secretary problem with hidden information; searching for a high merit candidate. Adv. Appl. Math. 144: 102468 (2023)
2010 – 2019
- 2016
- [j17]Paul N. Balister
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30(1): 465-473 (2016) - 2015
- [j16]Andrzej Grzesik
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path. SIAM J. Discret. Math. 29(1): 500-513 (2015) - 2014
- [j15]Roger B. Eggleton, Michal Morayne:
A Note on Counting Homomorphisms of Paths. Graphs Comb. 30(1): 159-170 (2014) - [j14]Adam Kurpisz
Inform friends, do not inform enemies. IMA J. Math. Control. Inf. 31(3): 435-440 (2014) - 2013
- [j13]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27(1): 145-154 (2013) - 2012
- [j12]Zak Mesyan, James D. Mitchell
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. Discret. Math. 26(1): 384-398 (2012) - 2010
- [j10]James D. Mitchell
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. Ann. Pure Appl. Log. 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
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
Counting embeddings of a chain into a tree. Discret. Math. 297(1-3): 49-59 (2005) - [j5]Grzegorz Kubicki, Michal Morayne:
Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case. SIAM J. Discret. 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. Comb. Probab. Comput. 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 B 84(1): 45-53 (2002)
1990 – 1999
- 1998
- [j1]Michal Morayne:
Partial-order analogue of the secretary problem the binary tree case. Discret. Math. 184(1-3): 165-181 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: