default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Karonski
Person information
- affiliation: Adam Mickiewicz University in Poznan, Poland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j22]Michal Karonski, Ed Overman
, Boris G. Pittel:
On a perfect matching in a random digraph with average out-degree below two. J. Comb. Theory B 143: 226-258 (2020)- [j21]Michal Karonski:
Thirty years... Random Struct. Algorithms 56(1): 3-4 (2020)
2010 – 2019
- 2017
- [j20]Maciej Kalkowski, Michal Karonski, Florian Pfender:
The 1-2-3-Conjecture for Hypergraphs. J. Graph Theory 85(3): 706-715 (2017) - 2015
- [j19]Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. Internet Math. 11(4-5): 385-402 (2015) - 2013
- [c5]Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. WAW 2013: 93-105 - [p1]Michal Karonski, Andrzej Rucinski:
The Origins of the Theory of Random Graphs. The Mathematics of Paul Erdős I 2013: 371-397 - 2011
- [j18]Maciej Kalkowski, Michal Karonski, Florian Pfender:
A New Upper Bound for the Irregularity Strength of Graphs. SIAM J. Discret. Math. 25(3): 1319-1321 (2011) - 2010
- [j17]Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender:
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158(11): 1189-1194 (2010) - [j16]Maciej Kalkowski, Michal Karonski, Florian Pfender:
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. J. Comb. Theory B 100(3): 347-349 (2010)
2000 – 2009
- 2006
- [j15]Jerzy Jaworski, Michal Karonski, Dudley Stark:
The degree of a typical vertex in generalized random intersection graph models. Discret. Math. 306(18): 2152-2165 (2006) - 2004
- [j14]Hans Garmo, Svante Janson, Michal Karonski:
On Generalized Random Railways. Comb. Probab. Comput. 13(1): 31-35 (2004) - 2003
- [j13]Michal Karonski, Boris G. Pittel:
Existence of a perfect matching in a random (1+e-1)--out bipartite graph. J. Comb. Theory B 88(1): 1-16 (2003) - 2002
- [j12]Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender:
On graph irregularity strength. J. Graph Theory 41(2): 120-137 (2002) - 2001
- [j11]Michal Karonski, Magdalena Szymkowiak:
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem. Discret. Math. 236(1-3): 179-189 (2001) - [j10]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings. SIAM J. Discret. Math. 15(1): 41-57 (2001) - [c4]Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski:
Distributed O(Delta log(n))-Edge-Coloring Algorithm. ESA 2001: 345-355 - 2000
- [j9]Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The Polling Primitive for Computer Networks. Informatica (Slovenia) 24(2) (2000) - [j8]Michal Karonski, Joel Spencer:
Ten Years! Random Struct. Algorithms 16(1): 1-3 (2000)
1990 – 1999
- 1999
- [j7]Alan M. Frieze, Michal Karonski, Lubos Thoma:
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM J. Discret. Math. 12(2): 208-216 (1999) - [c3]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. PODC 1999: 219-228 - 1998
- [c2]Michal Hanckowiak, Michal Karonski, Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings. SODA 1998: 219-225 - 1997
- [j6]Michal Karonski, Tomasz Luczak:
The number of connected sparsely edged uniform hypergraphs. Discret. Math. 171(1-3): 153-167 (1997) - 1995
- [c1]Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The polling primitive for hypercube networks. SPDP 1995: 138-144 - 1993
- [j5]Jerzy Jaworski, Michal Karonski:
On the connectivity of graphs generated by a sum of random mappings. J. Graph Theory 17(2): 135-150 (1993) - 1990
- [j4]Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski:
Small Cliques in Random Graphs. Random Struct. Algorithms 1(4): 403-434 (1990)
1980 – 1989
- 1989
- [j3]Andrew D. Barbour, Michal Karonski, Andrzej Rucinski:
A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory B 47(2): 125-145 (1989) - 1983
- [j2]Béla Bollobás, Ove Frank, Michal Karonski:
On 4-cycles in random bipartite tournaments. J. Graph Theory 7(2): 183-194 (1983) - 1982
- [j1]Michal Karonski:
A review of random graphs. J. Graph Theory 6(4): 349-389 (1982)
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:25 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:
