Michal Hanckowiak

Available identifiers

zbMath Open hanckowiak.michalWikidataQ24431047 ScholiaQ24431047MaRDI QIDQ736604

List of research outcomes

Publication	Date of Publication	Type
Distributed approximation for \(f\)-matching	2024-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q6187827	2024-01-15	Paper
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs	2022-07-21	Paper
Distributed distance domination in graphs with no \(K_{2,t}\)-minor	2022-05-31	Paper
Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs	2020-01-29	Paper
Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs	2019-01-18	Paper
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs	2017-01-09	Paper
On the distributed complexity of the semi-matching problem	2016-08-04	Paper
A faster distributed algorithm for computing maximal matchings deterministically	2015-09-11	Paper
Distributed 2-Approximation Algorithm for the Semi-matching Problem	2013-03-13	Paper
Brief Announcement: Distributed Approximations for the Semi-matching Problem	2011-10-28	Paper
Distributed Algorithm for Better Approximation of the Maximum Matching	2011-03-18	Paper
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs	2009-12-17	Paper
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families	2009-03-06	Paper
Fast Distributed Approximations in Planar Graphs	2008-11-20	Paper
Distributed Approximation Algorithms in Unit-Disk Graphs	2008-09-09	Paper
Distributed Approximations for Packing in Unit-Disk Graphs	2008-09-02	Paper
Distributed Almost Exact Approximations for Minor-Closed Families	2008-03-11	Paper
Distributed Approximation Algorithms for Planar Graphs	2007-05-02	Paper
Distributed algorithms for weighted problems in sparse graphs	2007-02-14	Paper
Algorithms – ESA 2004	2005-08-18	Paper
Distributed algorithm for approximating the maximum matching	2004-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4796186	2003-03-02	Paper
On the distributed complexity of computing maximal matchings	2002-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4250185	1999-06-17	Paper

Research outcomes over time

This page was built for person: Michal Hanckowiak