Michal Karonski

According to our database, Michal Karonski authored at least 26 papers between 1982 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Thirty years...

Michal Karonski

Random Struct. Algorithms, 2020

On a perfect matching in a random digraph with average out-degree below two.

Michal Karonski, Ed Overman, Boris G. Pittel

J. Comb. Theory B, 2020

2017

The 1-2-3-Conjecture for Hypergraphs.

Maciej Kalkowski, Michal Karonski, Florian Pfender

J. Graph Theory, 2017

2015

Random Intersection Graph Process.

Mindaugas Bloznelis, Michal Karonski

Internet Math., 2015

2013

The Origins of the Theory of Random Graphs.

Michal Karonski, Andrzej Rucinski

Proceedings of the Mathematics of Paul Erdős I, 2013

2011

A New Upper Bound for the Irregularity Strength of Graphs.

Maciej Kalkowski, Michal Karonski, Florian Pfender

SIAM J. Discret. Math., 2011

2010

Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture.

Maciej Kalkowski, Michal Karonski, Florian Pfender

J. Comb. Theory B, 2010

An iterative approach to graph irregularity strength.

Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender

Discret. Appl. Math., 2010

2006

The degree of a typical vertex in generalized random intersection graph models.

Jerzy Jaworski, Michal Karonski, Dudley Stark

Discret. Math., 2006

2004

On Generalized Random Railways.

Hans Garmo, Svante Janson, Michal Karonski

Comb. Probab. Comput., 2004

2003

Existence of a perfect matching in a random (1+e^-1)--out bipartite graph.

Michal Karonski, Boris G. Pittel

J. Comb. Theory B, 2003

2002

On graph irregularity strength.

Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender

J. Graph Theory, 2002

2001

On the Distributed Complexity of Computing Maximal Matchings.

Michal Hanckowiak, Michal Karonski, Alessandro Panconesi

SIAM J. Discret. Math., 2001

On a solution of a randomized three tracks variant of the Gate Matrix Layout problem.

Michal Karonski, Magdalena Szymkowiak

Discret. Math., 2001

Distributed O(Delta log(n))-Edge-Coloring Algorithm.

Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski

Proceedings of the Algorithms, 2001

2000

Ten Years!

Michal Karonski, Joel Spencer

Random Struct. Algorithms, 2000

The Polling Primitive for Computer Networks.

Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam

Informatica (Slovenia), 2000

1999

On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.

Alan M. Frieze, Michal Karonski, Lubos Thoma

SIAM J. Discret. Math., 1999

A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.

Michal Hanckowiak, Michal Karonski, Alessandro Panconesi

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1997

The number of connected sparsely edged uniform hypergraphs.

Michal Karonski, Tomasz Luczak

Discret. Math., 1997

1995

The polling primitive for hypercube networks.

Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1993

On the connectivity of graphs generated by a sum of random mappings.

Jerzy Jaworski, Michal Karonski

J. Graph Theory, 1993

1990

Small Cliques in Random Graphs.

Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski

Random Struct. Algorithms, 1990

1989

A central limit theorem for decomposable random variables with applications to random graphs.

Andrew D. Barbour, Michal Karonski, Andrzej Rucinski

J. Comb. Theory B, 1989

1983

On 4-cycles in random bipartite tournaments.

Béla Bollobás, Ove Frank, Michal Karonski

J. Graph Theory, 1983

1982

A review of random graphs.

Michal Karonski

J. Graph Theory, 1982