Michal Karonski

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