2008 |
15 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Wojciech Wawrzyniak:
Fast Distributed Approximations in Planar Graphs.
DISC 2008: 78-92 |
14 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Wojciech Wawrzyniak:
Distributed packing in planar graphs.
SPAA 2008: 55-61 |
2007 |
13 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
COCOON 2007: 515-525 |
12 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximations for Packing in Unit-Disk Graphs.
DISC 2007: 152-164 |
2006 |
11 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
Distributed Approximation Algorithms for Planar Graphs.
CIAC 2006: 296-307 |
10 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Approximation Algorithms in Unit-Disk Graphs.
DISC 2006: 385-398 |
9 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Almost Exact Approximations for Minor-Closed Families.
ESA 2006: 244-255 |
8 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed algorithms for weighted problems in sparse graphs.
J. Discrete Algorithms 4(4): 588-607 (2006) |
2004 |
7 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
A Fast Distributed Algorithm for Approximating the Maximum Matching.
ESA 2004: 252-263 |
6 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Edyta Szymanska:
Distributed algorithm for approximating the maximum matching.
Discrete Applied Mathematics 143(1-3): 62-71 (2004) |
2003 |
5 | EE | Andrzej Czygrinow,
Michal Hanckowiak:
Distributed Algorithm for Better Approximation of the Maximum Matching.
COCOON 2003: 242-251 |
2001 |
4 | EE | Andrzej Czygrinow,
Michal Hanckowiak,
Michal Karonski:
Distributed O(Delta log(n))-Edge-Coloring Algorithm.
ESA 2001: 345-355 |
3 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SIAM J. Discrete Math. 15(1): 41-57 (2001) |
1999 |
2 | EE | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.
PODC 1999: 219-228 |
1998 |
1 | | Michal Hanckowiak,
Michal Karonski,
Alessandro Panconesi:
On the Distributed Complexity of Computing Maximal Matchings.
SODA 1998: 219-225 |