default search action
Wojciech Kmiecik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]Wojciech Kmiecik, Krzysztof Walkowiak:
A performance study of dynamic routing algorithm for SDM translucent optical networks with assistive storage. Opt. Switch. Netw. 38: 100572 (2020)
2010 – 2019
- 2017
- [c10]Wojciech Kmiecik, Krzysztof Walkowiak:
Dynamic overlay multicasting for deadline-driven requests provisioning in elastic optical networks. ICIN 2017: 31-35 - 2016
- [c9]Massimo Tornatore, João André, Péter Babarczi, Torsten Braun, Eirik Larsen Følstad, Poul E. Heegaard, Ali Hmaity, Marija Furdek, Luísa Jorge, Wojciech Kmiecik, Carmen Mas Machuca, Lúcia Martins, Carmo Medeiros, Francesco Musumeci, Alija Pasic, Jacek Rak, Steven Simpson, Rui Travanca, Artemios G. Voyiatzis:
A survey on network resiliency methodologies against weather-based disruptions. RNDM 2016: 23-34 - 2015
- [j4]Krzysztof Walkowiak, Michal Wozniak, Miroslaw Klinkowski, Wojciech Kmiecik:
Optical networks for cost-efficient and scalable provisioning of big data traffic. Int. J. Parallel Emergent Distributed Syst. 30(1): 15-28 (2015) - [j3]Wojciech Kmiecik, Krzysztof Walkowiak:
Flow assignment (FA) and capacity and flow assignment (CFA) problems for survivable overlay multicasting in dual homing networks. Telecommun. Syst. 60(4): 553-565 (2015) - [c8]Wojciech Kmiecik:
Survivability Aspects of Tree Construction for Overlay Multicasting with Dual Homing Architecture. ENIC 2015: 47-52 - 2014
- [j2]Wojciech Kmiecik, Róza Goscien, Krzysztof Walkowiak, Miroslaw Klinkowski:
Two-layer optimization of survivable overlay multicasting in elastic optical networks. Opt. Switch. Netw. 14: 164-178 (2014) - [c7]Wojciech Kmiecik, Krzysztof Walkowiak:
Survivable overlay multicasting in WDM optical networks with dual homing architecture. ONDM 2014: 19-24 - 2013
- [j1]Wojciech Kmiecik, Krzysztof Walkowiak:
Metaheuristic Algorithms for Optimization of Survivable Multicast Overlay in Dual homing Networks. Cybern. Syst. 44(6-7): 606-626 (2013) - [c6]Wojciech Kmiecik, Krzysztof Walkowiak:
Capacity and Flow Assignment in survivable overlay networks with dual homing architecture. ICUMT 2013: 125-131 - 2012
- [c5]Wojciech Kmiecik, Krzysztof Walkowiak:
Survivability aspects of overlay multicasting in dual homing networks. ICUMT 2012: 786-792 - [c4]Wojciech Kmiecik, Krzysztof Walkowiak:
Metaheuristic Approach for Survivable P2P Multicasting Flow Assignment in Dual Homing Networks. CISIS/ICEUTE/SOCO Special Sessions 2012: 215-224 - 2011
- [c3]Wojciech Kmiecik, Leszek Koszalka, Iwona Pozniak-Koszalka, Andrzej Kasprzak:
Evaluation Scheme of Tasks Allocation with Metaheuristic Algorithms in Mesh Connected Processors. ICSEng 2011: 241-246 - [c2]Wojciech Kmiecik, Krzysztof Walkowiak:
Survivable P2P multicasting flow assignment in dual homing networks. ICUMT 2011: 1-7 - 2010
- [c1]Wojciech Kmiecik, Marek Wójcikowski, Leszek Koszalka, Andrzej Kasprzak:
Task Allocation in Mesh Connected Processors with Local Search Meta-heuristic Algorithms. ACIIDS (2) 2010: 215-224
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:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint