| 2008 |
|---|
| 27 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Wojciech Wawrzyniak:
Fast Distributed Approximations in Planar Graphs.
DISC 2008: 78-92 |
| 26 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Wojciech Wawrzyniak:
Distributed packing in planar graphs.
SPAA 2008: 55-61 |
| 25 | EE | Andrzej Czygrinow,
Glenn H. Hurlbert:
On the pebbling threshold of paths and the pebbling threshold spectrum.
Discrete Mathematics 308(15): 3297-3307 (2008) |
| 2007 |
|---|
| 24 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
COCOON 2007: 515-525 |
| 23 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximations for Packing in Unit-Disk Graphs.
DISC 2007: 152-164 |
| 2006 |
|---|
| 22 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
Distributed Approximation Algorithms for Planar Graphs.
CIAC 2006: 296-307 |
| 21 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximation Algorithms in Unit-Disk Graphs.
DISC 2006: 385-398 |
| 20 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Almost Exact Approximations for Minor-Closed Families.
ESA 2006: 244-255 |
| 19 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed algorithms for weighted problems in sparse graphs.
J. Discrete Algorithms 4(4): 588-607 (2006) |
| 18 | EE | Andrzej Czygrinow,
Glenn Hurlbert:
Girth, Pebbling, and Grid Thresholds.
SIAM J. Discrete Math. 20(1): 1-10 (2006) |
| 2004 |
|---|
| 17 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
A Fast Distributed Algorithm for Approximating the Maximum Matching.
ESA 2004: 252-263 |
| 16 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
Distributed algorithm for approximating the maximum matching.
Discrete Applied Mathematics 143(1-3): 62-71 (2004) |
| 15 | EE | Andrzej Czygrinow,
Brendan Nagle:
Bounding the strong chromatic index of dense random graphs.
Discrete Mathematics 281(1-3): 129-136 (2004) |
| 14 | EE | Andrzej Czygrinow,
Brendan Nagle:
Strong edge colorings of uniform graphs.
Discrete Mathematics 286(3): 219-223 (2004) |
| 2003 |
|---|
| 13 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Algorithm for Better Approximation of the Maximum Matching.
COCOON 2003: 242-251 |
| 12 | EE | Airat Bekmetjev,
Graham Brightwell,
Andrzej Czygrinow,
Glenn Hurlbert:
Thresholds for families of multisets, with an application to graph pebbling.
Discrete Mathematics 269(1-3): 21-34 (2003) |
| 11 | EE | Andrzej Czygrinow,
Brendan Nagle:
Matrix-Free Proof of a Regularity Characterization.
Electr. J. Comb. 10: (2003) |
| 2002 |
|---|
| 10 | | Andrzej Czygrinow:
Partitioning problems in dense hypergraphs.
Discrete Applied Mathematics 116(3): 179-191 (2002) |
| 9 | EE | Andrzej Czygrinow,
Nancy Eaton,
Glenn H. Hurlbert,
P. Mark Kayll:
On pebbling threshold functions for graph sequences.
Discrete Mathematics 247(1-3): 93-105 (2002) |
| 8 | EE | Andrzej Czygrinow,
Henry A. Kierstead:
2-factors in dense bipartite graphs.
Discrete Mathematics 257(2-3): 357-369 (2002) |
| 7 | EE | Andrzej Czygrinow,
Glenn Hurlbert,
Hal A. Kierstead,
William T. Trotter:
A Note on Graph Pebbling.
Graphs and Combinatorics 18(2): 219-225 (2002) |
| 2001 |
|---|
| 6 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Michal Karonski:
Distributed O(Delta log(n))-Edge-Coloring Algorithm.
ESA 2001: 345-355 |
| 5 | EE | Andrzej Czygrinow,
Genghua Fan,
Glenn Hurlbert,
Henry A. Kierstead,
William T. Trotter:
Spanning Trees of Bounded Degree.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 4 | | Andrzej Czygrinow,
Michal Karonski,
Vaidy S. Sunderam:
The Polling Primitive for Computer Networks.
Informatica (Slovenia) 24(2): (2000) |
| 3 | EE | Andrzej Czygrinow:
Maximum dispersion problem in dense graphs.
Oper. Res. Lett. 27(5): 223-227 (2000) |
| 2 | EE | Andrzej Czygrinow,
Vojtech Rödl:
An Algorithmic Regularity Lemma for Hypergraphs.
SIAM J. Comput. 30(4): 1041-1066 (2000) |
| 1999 |
|---|
| 1 | EE | Andrzej Czygrinow,
Svatopluk Poljak,
Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discrete Math. 12(1): 48-63 (1999) |
