Michal Karonski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2020

Thirty years..Michal Karonski. rsa, 56(1):3-4, 2020. [doi]

On a perfect matching in a random digraph with average out-degree below twoMichal Karonski, Ed Overman 0001, Boris G. Pittel. jctb, 143:226-258, 2020. [doi]

2017

The 1-2-3-Conjecture for HypergraphsMaciej Kalkowski, Michal Karonski, Florian Pfender. jgt, 85(3):706-715, 2017. [doi]

2015

Random Intersection Graph ProcessMindaugas Bloznelis, Michal Karonski. im, 11(4-5):385-402, 2015. [doi]

2013

Random Intersection Graph ProcessMindaugas Bloznelis, Michal Karonski. waw 2013: 93-105 [doi]

The Origins of the Theory of Random GraphsMichal Karonski, Andrzej Rucinski 0001. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 371-397, Springer, 2013. [doi]

2011

A New Upper Bound for the Irregularity Strength of GraphsMaciej Kalkowski, Michal Karonski, Florian Pfender. siamdm, 25(3):1319-1321, 2011. [doi]

2010

An iterative approach to graph irregularity strengthMichael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender. DAM, 158(11):1189-1194, 2010. [doi]

Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureMaciej Kalkowski, Michal Karonski, Florian Pfender. JCT, 100(3):347-349, 2010. [doi]

2006

The degree of a typical vertex in generalized random intersection graph modelsJerzy Jaworski, Michal Karonski, Dudley Stark. DM, 306(18):2152-2165, 2006. [doi]

2004

On Generalized Random RailwaysHans Garmo, Svante Janson, Michal Karonski. cpc, 13(1):31-35, 2004.

2003

Existence of a perfect matching in a random (1+e:::-1:::)--out bipartite graphMichal Karonski, Boris Pittel. JCT, 88(1):1-16, 2003. [doi]

2002

On graph irregularity strengthAlan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender. jgt, 41(2):120-137, 2002. [doi]

2001

Distributed O(Delta log(n))-Edge-Coloring AlgorithmAndrzej Czygrinow, Michal Hanckowiak, Michal Karonski. esa 2001: 345-355 [doi]

On the Distributed Complexity of Computing Maximal MatchingsMichal Hanckowiak, Michal Karonski, Alessandro Panconesi. siamdm, 15(1):41-57, 2001. [doi]

On a solution of a randomized three tracks variant of the Gate Matrix Layout problemMichal Karonski, Magdalena Szymkowiak. DM, 236(1-3):179-189, 2001. [doi]

2000

The Polling Primitive for Computer NetworksAndrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam. informaticaSI, 24(2), 2000.

Ten Years!Michal Karonski, Joel Spencer. rsa, 16(1):1-3, 2000.

1999

On Perfect Matchings and Hamilton Cycles in Sums of Random TreesAlan M. Frieze, Michal Karonski, Lubos Thoma. siamdm, 12(2):208-216, 1999. [doi]

A Faster Distributed Algorithm for Computing Maximal Matchings DeterministicallyMichal Hanckowiak, Michal Karonski, Alessandro Panconesi. podc 1999: 219-228 [doi]

1998

On the Distributed Complexity of Computing Maximal MatchingsMichal Hanckowiak, Michal Karonski, Alessandro Panconesi. soda 1998: 219-225

1997

The number of connected sparsely edged uniform hypergraphsMichal Karonski, Tomasz Luczak. DM, 171(1-3):153-167, 1997. [doi]

1995

The polling primitive for hypercube networksAndrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam. spdp 1995: 138-144 [doi]

1993

On the connectivity of graphs generated by a sum of random mappingsJerzy Jaworski, Michal Karonski. jgt, 17(2):135-150, 1993. [doi]

1990

Small Cliques in Random GraphsAndrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski. rsa, 1(4):403-434, 1990.

1989

A central limit theorem for decomposable random variables with applications to random graphsAndrew D. Barbour, Michal Karonski, Andrzej Rucinski. JCT, 47(2):125-145, 1989. [doi]

1983

On 4-cycles in random bipartite tournamentsBéla Bollobés, Ove Frank, Michal Karonski. jgt, 7(2):183-194, 1983. [doi]

1982

A review of random graphsMichal Karonski. jgt, 6(4):349-389, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL