Michal Hanckowiak

29 papers A* 2A 8B 5C 1Misc 2Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Distributed approximation for f-matching.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Andrzej Ruminski, Marcin Witkowski
2022 J jnl
Distributed distance domination in graphs with no
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2022 J jnl
Distributed distance domination in graphs with no K
CoRR
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2021 B conf
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2020 J jnl
Distributed approximation algorithms for
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2019 J jnl
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2018 B conf
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2017 — conf
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs.
ICTCS/CILC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2017 J jnl
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
2016 J jnl
On the distributed complexity of the semi-matching problem.
J. Comput. Syst. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
2014 B conf
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.
OPODIS
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
2012 A conf
Distributed 2-Approximation Algorithm for the Semi-matching Problem.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
2011 A conf
Brief Announcement: Distributed Approximations for the Semi-matching Problem.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak
2009 B conf
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2008 B conf
Distributed packing in planar graphs.
SPAA
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak
2008 A conf
Fast Distributed Approximations in Planar Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak
2007 Misc conf
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
COCOON
Andrzej Czygrinow, Michal Hanckowiak
2007 A conf
Distributed Approximations for Packing in Unit-Disk Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak
2006 A conf
Distributed Almost Exact Approximations for Minor-Closed Families.
ESA
Andrzej Czygrinow, Michal Hanckowiak
2006 C conf
Distributed Approximation Algorithms for Planar Graphs.
CIAC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2006 A conf
Distributed Approximation Algorithms in Unit-Disk Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak
2006 J jnl
Distributed algorithms for weighted problems in sparse graphs.
J. Discrete Algorithms
Andrzej Czygrinow, Michal Hanckowiak
2004 A conf
A Fast Distributed Algorithm for Approximating the Maximum Matching.
ESA
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2004 J jnl
Distributed algorithm for approximating the maximum matching.
Discret. Appl. Math.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2003 Misc conf
Distributed Algorithm for Better Approximation of the Maximum Matching.
COCOON
Andrzej Czygrinow, Michal Hanckowiak
2001 A conf
Distributed O(Delta log(n))-Edge-Coloring Algorithm.
ESA
Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski
2001 J jnl
On the Distributed Complexity of Computing Maximal Matchings.
SIAM J. Discret. Math.
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
1999 A* conf
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.
PODC
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
1998 A* conf
On the Distributed Complexity of Computing Maximal Matchings.
SODA
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi