default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Kucharzak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j5]Kamil Staniec
, Michal Kucharzak, Zbigniew Jóskiewicz, Bartlomiej Chowanski:
Measurement-Based Investigations of the NB-IoT Downlink Performance in Fading Channels. IEEE Wirel. Commun. Lett. 10(8): 1780-1784 (2021)- [c9]Lukasz Chmielowski, Michal Kucharzak:
Impact of Software Bug Report Preprocessing and Vectorization on Bug Assignment Accuracy. CORES/IP&C/ACS 2021: 153-162
2010 – 2019
- 2019
- [j4]Róza Goscien, Michal Kucharzak:
On the efficient optimization of unicast, anycast and multicast flows in survivable elastic optical networks. Opt. Switch. Netw. 31: 114-126 (2019) - 2015
- [j3]Michal Kucharzak, Krzysztof Walkowiak, Pawel Kopec, Damian Bulira, Andrzej Kasprzak:
Integer programming, Constraint programming, and metaheuristic approaches for static optimization of anycast flows in elastic optical networks. Networks 66(4): 253-266 (2015) - 2014
- [j2]Michal Kucharzak, Krzysztof Walkowiak:
Modeling and optimization of maximum flow survivable overlay multicast with predefined routing trees. Telecommun. Syst. 56(1): 121-139 (2014) - 2012
- [j1]Grzegorz Chmaj, Krzysztof Walkowiak, Michal Tarnawski, Michal Kucharzak:
Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems. Int. J. Appl. Math. Comput. Sci. 22(3): 733-748 (2012) - [c8]Michal Kucharzak, Jacek Kibilda, Marcin Filo, Radoslaw Piesiewicz:
The 802.11g relaying MAC that saves energy. BCFIC 2012: 40-45 - [c7]Michal Kucharzak, Krzysztof Walkowiak:
Maximum flow trees in overlay multicast: Modeling and optimization. BCFIC 2012: 260-267 - [c6]Jacek Kibilda, Michal Kucharzak, Marcin Filo, Radoslaw Piesiewicz:
Energy efficient mobile relay service in future networks. Future Network & Mobile Summit 2012: 1-8 - 2011
- [c5]Michal Kucharzak, Jacek Kibilda, Marcin Filo, Radoslaw Piesiewicz:
Self-enforcement strategy for energy-efficient relaying in wireless ad-hoc networks. CrownCom 2011: 316-320 - [c4]Michal Kucharzak, Krzysztof Walkowiak:
An Improved Annealing Algorithm for Throughput Maximization in Static Overlay-Based Multicast Systems. HAIS (1) 2011: 364-371 - [c3]Michal Kucharzak, Krzysztof Walkowiak:
Fractional spanning tree packing problem with survivability constraints for throughput maximization in overlay multicast networks. ICUMT 2011: 1-7 - [c2]Michal Kucharzak, Krzysztof Walkowiak:
On Modelling of Fair Throughput Allocation in Overlay Multicast Networks. NEW2AN 2011: 529-540
2000 – 2009
- 2009
- [c1]Michal Kucharzak, Leszek Koszalka, Andrzej Kasprzak:
Shortest Multilayered Path for Dimensioning in Two-Layer Connection-Oriented Networks. ISPAN 2009: 332-337
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
