Michal Karonski

Publication Activity (10 Years)

Years Active: 1982-2020
Publications (10 Years): 3

Top Topics

Higher Order Relations

Bipartite Graph

Top Venues

Random Struct. Algorithms

J. Graph Theory

Publications

Michal Karonski
Thirty years... Random Struct. Algorithms 56 (1) (2020)
Michal Karonski, Ed Overman, Boris G. Pittel
On a perfect matching in a random digraph with average out-degree below two. J. Comb. Theory, Ser. B 143 (2020)
Maciej Kalkowski, Michal Karonski, Florian Pfender
The 1-2-3-Conjecture for Hypergraphs. J. Graph Theory 85 (3) (2017)
Mindaugas Bloznelis, Michal Karonski
Random Intersection Graph Process. Internet Math. 11 (4-5) (2015)
Mindaugas Bloznelis, Michal Karonski
Random Intersection Graph Process. WAW (2013)
Maciej Kalkowski, Michal Karonski, Florian Pfender
A New Upper Bound for the Irregularity Strength of Graphs. SIAM J. Discret. Math. 25 (3) (2011)
Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158 (11) (2010)
Maciej Kalkowski, Michal Karonski, Florian Pfender
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. J. Comb. Theory, Ser. B 100 (3) (2010)
Jerzy Jaworski, Michal Karonski, Dudley Stark
The degree of a typical vertex in generalized random intersection graph models. Discret. Math. 306 (18) (2006)
Hans Garmo, Svante Janson, Michal Karonski
On Generalized Random Railways. Comb. Probab. Comput. 13 (1) (2004)
Michal Karonski, Boris G. Pittel
)--out bipartite graph. J. Comb. Theory, Ser. B 88 (1) (2003)
Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender
On graph irregularity strength. J. Graph Theory 41 (2) (2002)
Michal Karonski, Magdalena Szymkowiak
On a solution of a randomized three tracks variant of the Gate Matrix Layout problem. Discret. Math. 236 (1-3) (2001)
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
On the Distributed Complexity of Computing Maximal Matchings. SIAM J. Discret. Math. 15 (1) (2001)
Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski
Distributed O(Delta log(n))-Edge-Coloring Algorithm. ESA (2001)
Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam
The Polling Primitive for Computer Networks. Informatica (Slovenia) 24 (2) (2000)
Michal Karonski, Joel Spencer
Ten Years! Random Struct. Algorithms 16 (1) (2000)
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically. PODC (1999)
Alan M. Frieze, Michal Karonski, Lubos Thoma
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. SIAM J. Discret. Math. 12 (2) (1999)
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
On the Distributed Complexity of Computing Maximal Matchings. SODA (1998)
Michal Karonski, Tomasz Luczak
The number of connected sparsely edged uniform hypergraphs. Discret. Math. 171 (1-3) (1997)
Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam
The polling primitive for hypercube networks. SPDP (1995)
Jerzy Jaworski, Michal Karonski
On the connectivity of graphs generated by a sum of random mappings. J. Graph Theory 17 (2) (1993)
Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski
Small Cliques in Random Graphs. Random Struct. Algorithms 1 (4) (1990)
Andrew D. Barbour, Michal Karonski, Andrzej Rucinski
A central limit theorem for decomposable random variables with applications to random graphs. J. Comb. Theory, Ser. B 47 (2) (1989)
Béla Bollobás, Ove Frank, Michal Karonski
On 4-cycles in random bipartite tournaments. J. Graph Theory 7 (2) (1983)
Michal Karonski
A review of random graphs. J. Graph Theory 6 (4) (1982)