Michal Hanckowiak

According to our database, Michal Hanckowiak authored at least 28 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Distributed approximation for f-matching.

Andrzej Czygrinow, Michal Hanckowiak, Andrzej Ruminski, Marcin Witkowski

Theor. Comput. Sci., 2024

2022

Distributed distance domination in graphs with no <i>K</i>_{2, <i>t</i>}-minor.

Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski

Theor. Comput. Sci., 2022

Distributed distance domination in graphs with no K_2,t-minor.

Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski

CoRR, 2022

2021

Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion.

Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Distributed approximation algorithms for <i>k</i>-dominating set in graphs of bounded genus and linklessly embeddable graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski

Theor. Comput. Sci., 2020

2019

Distributed CONGESTBC constant approximation of MDS in bounded genus graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski

Theor. Comput. Sci., 2019

2018

Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski

Theor. Comput. Sci., 2017

Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016

On the distributed complexity of the semi-matching problem.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak

J. Comput. Syst. Sci., 2016

2014

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2012

Distributed 2-Approximation Algorithm for the Semi-matching Problem.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Brief Announcement: Distributed Approximations for the Semi-matching Problem.

Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2009

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Fast Distributed Approximations in Planar Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Distributed packing in planar graphs.

Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007

Distributed Approximations for Packing in Unit-Disk Graphs.

Andrzej Czygrinow, Michal Hanckowiak

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.

Andrzej Czygrinow, Michal Hanckowiak

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Distributed algorithms for weighted problems in sparse graphs.

Andrzej Czygrinow, Michal Hanckowiak

J. Discrete Algorithms, 2006

Distributed Approximation Algorithms in Unit-Disk Graphs.

Andrzej Czygrinow, Michal Hanckowiak

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Distributed Almost Exact Approximations for Minor-Closed Families.

Andrzej Czygrinow, Michal Hanckowiak

Proceedings of the Algorithms, 2006

Distributed Approximation Algorithms for Planar Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2004

Distributed algorithm for approximating the maximum matching.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Discret. Appl. Math., 2004

A Fast Distributed Algorithm for Approximating the Maximum Matching.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms, 2004

2003

Distributed Algorithm for Better Approximation of the Maximum Matching.

Andrzej Czygrinow, Michal Hanckowiak

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2001

On the Distributed Complexity of Computing Maximal Matchings.

Michal Hanckowiak, Michal Karonski, Alessandro Panconesi

SIAM J. Discret. Math., 2001

Distributed O(Delta log(n))-Edge-Coloring Algorithm.

Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski

Proceedings of the Algorithms, 2001

1999

A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically.

Michal Hanckowiak, Michal Karonski, Alessandro Panconesi

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999