Publications:
Distributed approximation algorithms for weighted problems in minor-closed
families, The 13th Annual International Computing and
Combinatorics Conference, COCOON 2007, LNCS 4598, (2007), 515--525, (with
M. Hanckowiak), pdf.
Expanded version: pdf.
Distributed approximation algorithms in unit-disk graphs, 20th International Symposium on Distributed Computing, DISC 2006, LNCS 4167, (2006), 385--398, (with M. Hanckowiak), pdf.
Distributed almost exact approximations for minor-closed families, 14th Annual European Symposium on Algorithms, ESA 2006, (2006), 244--255, (with M. Hanckowiak), pdf.
Distributed approximation algorithms for planar graphs, 6th Conference on Algorithms and Complexity, CIAC 2006 , LNCS 3998, (2006), 296--307, (with M. Hanckowiak, E. Szymanska), pdf.
Distributed algorithms for weighted problems in sparse graphs, Journal of Discrete Algorithms, Volume 4, (4), (2006), 588--607, (with M. Hanckowiak), pdf.
Girth, Pebbling, and Grid Thresholds, SIAM Journal on Discrete Mathematics, Volume 20, No. 1, (2006), 1--10, (with G. Hurlbert), pdf.
Strong edge colorings of uniform graphs, Discrete Mathematics, Volume 286, Issue 3, (2004), 219--223, (with B. Nagle), pdf. Expanded version: pdf.
A Fast Distributed Algorithm for Approximating the Maximum Matching, Algorithms - ESA 2004, LNCS 3221, (2004), 252--263, (with M. Hanckowiak, E. Szymanska), pdf.
Distributed algorithm for approximating the maximum matching, Discrete Applied Mathematics, Volume 143, Issues 1-3, (2004), 62--71, (with M. Hanckowiak and E. Szymanska), pdf.
Bounding the strong chromatic index of dense random graphs, Discrete Mathematics, Volume 281, Issues 1-3, (2004), 129--136, (with B. Nagle), pdf.
Pebbling in Dense Graphs, Australasian Journal of Combinatorics, 29, (2003), 201--208, (with G. Hurlbert), pdf.
Matrix-Free Proof of a Regularity Characterization, Electronic Journal of Combinatorics, 10(1), (2003), #R39, (with B. Nagle), link.
Distributed Algorithm for Better Approximation of the Maximum Matching, COCOON 2003, LNCS 2697, (2003), 242--251, (with M. Hanckowiak), pdf. Expanded version: pdf.
Thresholds for families of multisets with an application to graph pebbling, Discrete Mathematics, 269, 1-3, (2003), 21--34, (with A. Bekmetjev, G. Brightwell, and G. Hurlbert), pdf.
2-factors in bipartite graphs, Discrete Mathematics, 257, 2-3, 28, (2002), 357--369, (with H. Kierstead), pdf.
Partitioning problems in dense hypergraphs, Discrete Applied Mathematics, Vol. 116, 3, (2002), 179--191, pdf.
A note on a graph pebbling, Graphs and Combinatorics, 18, 2 (2002), 219--225, (with G.Hurlbert, H. Kierstead, and W. T. Trotter), pdf.
Pebbling threshold functions for graph sequences, Discrete Mathematics, 247, no. 1-3, (2002), 93--105, (with N. Eaton, G. Hurlbert, P. M. Kayll), pdf.
Distributed O(Delta logn)-edge-coloring algorithm, Algorithms - ESA 2001 LNCS 2161, (2001), 345--355, (with M. Hanckowiak, M. Karonski), pdf.
Spanning trees of bounded degree, Electronic Journal of Combinatorics, 8, (2001), #R33, (with G. Fan, G. Hurlbert, H. A. Kierstead, W. T. Trotter ), link.
A note on a codegree problem for hypergraphs, Bulletin of ICA, 32, (2001), 63--69, (with B. Nagle), pdf.
A dense case of the dispersion problem, Operation Research Letters, 27, (2000), 223--227, pdf.
An algorithmic regularity lemma for hypergraphs, SIAM Journal on Computing, 30, (2000), 1041--1066, (with V. Rodl), pdf.
The polling primitive for computer networks, Informatica, 24, (2000), 211--216, (with M. Karonski and V. S. Sunderam), pdf.
Constructive Quasi-Ramsey numbers and the tournament ranking, SIAM Journal on Discrete Mathematics, 12, no. 1, (1999), 48--63, (with S. Poljak and V. Rodl), pdf.
The polling primitive for hypercube networks, Proc.of 7th IEEE Symp. on Parallel and Distributed Processing, (1995), 138--144, (with M. Karonski and V.S. Sunderam).
Distributed approximation algorithms in unit-disk graphs, 20th International Symposium on Distributed Computing, DISC 2006, LNCS 4167, (2006), 385--398, (with M. Hanckowiak), pdf.
Distributed almost exact approximations for minor-closed families, 14th Annual European Symposium on Algorithms, ESA 2006, (2006), 244--255, (with M. Hanckowiak), pdf.
Distributed approximation algorithms for planar graphs, 6th Conference on Algorithms and Complexity, CIAC 2006 , LNCS 3998, (2006), 296--307, (with M. Hanckowiak, E. Szymanska), pdf.
Distributed algorithms for weighted problems in sparse graphs, Journal of Discrete Algorithms, Volume 4, (4), (2006), 588--607, (with M. Hanckowiak), pdf.
Girth, Pebbling, and Grid Thresholds, SIAM Journal on Discrete Mathematics, Volume 20, No. 1, (2006), 1--10, (with G. Hurlbert), pdf.
Strong edge colorings of uniform graphs, Discrete Mathematics, Volume 286, Issue 3, (2004), 219--223, (with B. Nagle), pdf. Expanded version: pdf.
A Fast Distributed Algorithm for Approximating the Maximum Matching, Algorithms - ESA 2004, LNCS 3221, (2004), 252--263, (with M. Hanckowiak, E. Szymanska), pdf.
Distributed algorithm for approximating the maximum matching, Discrete Applied Mathematics, Volume 143, Issues 1-3, (2004), 62--71, (with M. Hanckowiak and E. Szymanska), pdf.
Bounding the strong chromatic index of dense random graphs, Discrete Mathematics, Volume 281, Issues 1-3, (2004), 129--136, (with B. Nagle), pdf.
Pebbling in Dense Graphs, Australasian Journal of Combinatorics, 29, (2003), 201--208, (with G. Hurlbert), pdf.
Matrix-Free Proof of a Regularity Characterization, Electronic Journal of Combinatorics, 10(1), (2003), #R39, (with B. Nagle), link.
Distributed Algorithm for Better Approximation of the Maximum Matching, COCOON 2003, LNCS 2697, (2003), 242--251, (with M. Hanckowiak), pdf. Expanded version: pdf.
Thresholds for families of multisets with an application to graph pebbling, Discrete Mathematics, 269, 1-3, (2003), 21--34, (with A. Bekmetjev, G. Brightwell, and G. Hurlbert), pdf.
2-factors in bipartite graphs, Discrete Mathematics, 257, 2-3, 28, (2002), 357--369, (with H. Kierstead), pdf.
Partitioning problems in dense hypergraphs, Discrete Applied Mathematics, Vol. 116, 3, (2002), 179--191, pdf.
A note on a graph pebbling, Graphs and Combinatorics, 18, 2 (2002), 219--225, (with G.Hurlbert, H. Kierstead, and W. T. Trotter), pdf.
Pebbling threshold functions for graph sequences, Discrete Mathematics, 247, no. 1-3, (2002), 93--105, (with N. Eaton, G. Hurlbert, P. M. Kayll), pdf.
Distributed O(Delta logn)-edge-coloring algorithm, Algorithms - ESA 2001 LNCS 2161, (2001), 345--355, (with M. Hanckowiak, M. Karonski), pdf.
Spanning trees of bounded degree, Electronic Journal of Combinatorics, 8, (2001), #R33, (with G. Fan, G. Hurlbert, H. A. Kierstead, W. T. Trotter ), link.
A note on a codegree problem for hypergraphs, Bulletin of ICA, 32, (2001), 63--69, (with B. Nagle), pdf.
A dense case of the dispersion problem, Operation Research Letters, 27, (2000), 223--227, pdf.
An algorithmic regularity lemma for hypergraphs, SIAM Journal on Computing, 30, (2000), 1041--1066, (with V. Rodl), pdf.
The polling primitive for computer networks, Informatica, 24, (2000), 211--216, (with M. Karonski and V. S. Sunderam), pdf.
Constructive Quasi-Ramsey numbers and the tournament ranking, SIAM Journal on Discrete Mathematics, 12, no. 1, (1999), 48--63, (with S. Poljak and V. Rodl), pdf.
The polling primitive for hypercube networks, Proc.of 7th IEEE Symp. on Parallel and Distributed Processing, (1995), 138--144, (with M. Karonski and V.S. Sunderam).
Manuscripts:
Distributed approximation algorithms for weighted problems in minor-closed
families (expanded version), (with M. Hanckowiak), pdf.
Distributed Algorithm for Better Approximation of the Maximum Matching (expanded version), (with M. Hanckowiak), pdf.
Strong Edge Colorings of Uniform Graphs (expanded version), (with B. Nagle), pdf.
Distributed Algorithm for Better Approximation of the Maximum Matching (expanded version), (with M. Hanckowiak), pdf.
Strong Edge Colorings of Uniform Graphs (expanded version), (with B. Nagle), pdf.
Presentations:
Distributed algorithms and graph theory, (AMS, 2007),
pdf.
Distributed approximations for minor-closed families, (ESA, 2006), pdf.
Distributed approximations for unit-disk graphs, (DISC, 2006), pdf.
Uniformity of sub-hypergraphs, (Seminar ASU, 2004), pdf.
Pebbling and connectivity of graphs, (SIAM, 2004), pdf.
Distributed algorithms for graph-theoretic problems, (UNR, 2004), pdf.
Much better slides with distributed algorithms prepared by my co-authors (Algorithmic Seminar, Poznan, 2004): Edyta Szymanska and Michal Hanckowiak.
Distributed approximations for minor-closed families, (ESA, 2006), pdf.
Distributed approximations for unit-disk graphs, (DISC, 2006), pdf.
Uniformity of sub-hypergraphs, (Seminar ASU, 2004), pdf.
Pebbling and connectivity of graphs, (SIAM, 2004), pdf.
Distributed algorithms for graph-theoretic problems, (UNR, 2004), pdf.
Much better slides with distributed algorithms prepared by my co-authors (Algorithmic Seminar, Poznan, 2004): Edyta Szymanska and Michal Hanckowiak.