Michał Hańćkowiak
- Computer Networks and Communications top 10%
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Electrical and Electronic Engineering
- Hardware and Architecture
- Topics
- Complexity and Algorithms in Graphs (12 papers)Advanced Graph Theory Research (9 papers)Optimization and Search Problems (7 papers)
- Cited by
- Computational Theory and MathematicsComputer Networks and CommunicationsComputer Graphics and Computer-Aided Design
- Journals
- Theoretical Computer ScienceJournal of Computer and System SciencesLecture notes in computer science
- Partner nations
- United StatesPolandDenmark
In The Last Decade
Michał Hańćkowiak
12 papers receiving 151 citations
Peers
Comparison fields: 5 of 16
- Computer Networks and Communications 132
- Computational Theory and Mathematics 111
- Artificial Intelligence 63
- Electrical and Electronic Engineering 13
- Hardware and Architecture 10
Countries citing papers authored by Michał Hańćkowiak
This map shows the geographic impact of Michał Hańćkowiak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michał Hańćkowiak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michał Hańćkowiak more than expected).
Fields of papers citing papers by Michał Hańćkowiak
This network shows the impact of papers produced by Michał Hańćkowiak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michał Hańćkowiak. The network helps show where Michał Hańćkowiak may publish in the future.
Co-authorship network of co-authors of Michał Hańćkowiak
This figure shows the co-authorship network connecting the top 25 collaborators of Michał Hańćkowiak. A scholar is included among the top collaborators of Michał Hańćkowiak based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michał Hańćkowiak. Michał Hańćkowiak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 0 | |
| 4 | 3 | |
| 5 | 3 | |
| 6 | 8 | |
| 7 | 5 | |
| 8 | A fast distributed algorithm for approximating the maximum matching | 2 |
| 9 | 13 | |
| 10 | 68 | |
| 11 | 16 | |
| 12 | 18 | |
| 13 | 19 |
About Michał Hańćkowiak
Michał Hańćkowiak is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, having authored 13 papers that have together received 157 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (12 papers), Advanced Graph Theory Research (9 papers) and Optimization and Search Problems (7 papers). The work is most often cited by research in Computational Theory and Mathematics (111 citations), Computer Networks and Communications (132 citations) and Computer Graphics and Computer-Aided Design (7 citations). Michał Hańćkowiak has collaborated with scholars based in United States, Poland and Denmark. Frequent co-authors include Alessandro Panconesi, Michał Karoński and Andrzej Czygrinow. Their work appears in journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.