default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMateusz Zotkiewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c14]Stanislaw Kozdrowski
, Magdalena Banaszek, Bartosz Jedrzejczak, Mateusz Zotkiewicz, Zbigniew Kopertowski:
Application of the Ant Colony Algorithm for Routing in Next Generation Programmable Networks. ICCS (4) 2021: 526-539
2010 – 2019
- 2019
- [j27]Mariusz Mycek, Mateusz Zotkiewicz:
On optimal trajectory for the multi-period evolution of FTTx networks. Telecommun. Syst. 71(3): 353-376 (2019) - 2018
- [j26]Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz:
Multipolar robust optimization. EURO J. Comput. Optim. 6(4): 395-434 (2018) - [j25]Mateusz Zotkiewicz:
Classifiers Applied to Dimensioning of Splitters in PON Design. JOCN 10(6): 633-642 (2018) - [j24]Mateusz Zotkiewicz:
Uncertainty in FTTH splitter installation. Networks 71(2): 153-165 (2018) - [j23]Mariusz Mycek, Michal Pióro, Mateusz Zotkiewicz:
MIP model for efficient dimensioning of real-world FTTH trees. Telecommun. Syst. 68(2): 239-258 (2018) - [c13]Stanislaw Kozdrowski, Mateusz Zotkiewicz, Slawomir Sujecki:
Resource Optimization in Fully Flexible Optical Node Architectures. ICTON 2018: 1-4 - [c12]Mateusz Zotkiewicz:
Optimizing Backup Fibers in Passive Optical Networks. ICTON 2018: 1-4 - 2017
- [j22]Mateusz Zotkiewicz, Mariusz Mycek:
Reducing the Costs of FTTH Networks by Optimized Splitter and OLT Card Deployment. JOCN 9(5): 412-422 (2017) - [c11]Mateusz Zotkiewicz, Mariusz Mycek:
On cost of the uniformity in FTTH network design. ICTON 2017: 1-4 - 2016
- [j21]Miroslaw Klinkowski, Mateusz Zotkiewicz, Krzysztof Walkowiak, Michal Pióro, Marc Ruiz, Luis Velasco:
Solving Large Instances of the RSA Problem in Flexgrid Elastic Optical Networks. JOCN 8(5): 320-330 (2016) - [j20]Mateusz Zotkiewicz, Mariusz Mycek, Artur Tomaszewski:
Profitable areas in large-scale FTTH network optimization. Telecommun. Syst. 61(3): 591-608 (2016) - [j19]Mateusz Zotkiewicz, Mateusz Guzek, Dzmitry Kliazovich, Pascal Bouvry:
Minimum Dependencies Energy-Efficient Scheduling in Data Centers. IEEE Trans. Parallel Distributed Syst. 27(12): 3561-3574 (2016) - [c10]Mateusz Zotkiewicz, Mariusz Mycek:
Impact of demand uncertainty models on FTTH network design. ICTON 2016: 1-4 - 2015
- [j18]Mateusz Zotkiewicz, Marc Ruiz, Miroslaw Klinkowski, Michal Pióro, Luis Velasco:
Reoptimization of Dynamic Flexgrid Optical Networks After Link Failure Repairs. JOCN 7(1): 49-61 (2015) - [j17]Yoann Fouquet, Dritan Nace, Michal Pióro, Michael Poss, Mateusz Zotkiewicz:
Generalized elastic flow rerouting scheme. Networks 66(4): 267-281 (2015) - [c9]Miroslaw Klinkowski, Michal Pióro, Mateusz Zotkiewicz, Krzysztof Walkowiak, Marc Ruiz, Luis Velasco:
Spectrum allocation problem in elastic optical networks - a branch-and-price approach. ICTON 2015: 1-5 - [c8]Jordi Ferrer Riera, Xavier Hesselbach, Mateusz Zotkiewicz, Maciej Szostak, Juan Felipe Botero:
Modelling the NFV forwarding graph for an optimal network service deployment. ICTON 2015: 1-4 - 2014
- [j16]Michal Pióro, Mateusz Zotkiewicz, Barbara Staehle, Dirk Staehle, Di Yuan:
On max-min fair flow optimization in wireless mesh networks. Ad Hoc Networks 13: 134-152 (2014) - [j15]Walid Ben-Ameur, Michal Pióro, Mateusz Zotkiewicz:
Fractional routing using pairs of failure-disjoint paths. Discret. Appl. Math. 164: 47-60 (2014) - [j14]Mateusz Zotkiewicz:
Max-Min Fairness in WMNs with Interference Cancelation Using Overheard Transmissions. J. Appl. Math. 2014: 625642:1-625642:9 (2014) - [j13]Teresa Gomes, Mateusz Zotkiewicz:
Resilient arcs and node disjointness in diverse routing. Opt. Switch. Netw. 14: 149-163 (2014) - [j12]Mateusz Zotkiewicz, Michal Pióro:
Exact approach to reliability of wireless mesh networks with directional antennas. Telecommun. Syst. 56(1): 201-211 (2014) - [c7]Miroslaw Klinkowski, Michal Pioaro, Mateusz Zotkiewicz, Marc Ruiz, Luis Velasco:
Valid inequalities for the routing and spectrum allocation problem in elastic optical networks. ICTON 2014: 1-5 - [c6]Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz, Miroslaw Klinkowski, Marek Jaworski, Matthias Gunkel:
Elastic multi-layer resilient IP-over-Flexgrid networking: Detailed cost analysis with bandwidth-variable transponders. ICTON 2014: 1-5 - [c5]Marc Ruiz, Mateusz Zotkiewicz, Alberto Castro, Miroslaw Klinkowski, Luis Velasco, Michal Pióro:
After Failure Repair Optimization in dynamic flexgrid optical networks. OFC 2014: 1-3 - 2013
- [j11]Walid Ben-Ameur, Mateusz Zotkiewicz:
Multipolar routing: where dynamic and static routing meet. Electron. Notes Discret. Math. 41: 61-68 (2013) - [j10]Mateusz Zotkiewicz:
Efficient MIP formulation for optimal 1-for-N diversity coding. Electron. Notes Discret. Math. 41: 133-140 (2013) - [j9]Dritan Nace, Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz:
Complexity of a classical flow restoration problem. Networks 62(2): 149-160 (2013) - [j8]Marc Ruiz, Michal Pióro, Mateusz Zotkiewicz, Miroslaw Klinkowski, Luis Velasco:
Column generation algorithm for RSA problems in flexgrid optical networks. Photonic Netw. Commun. 26(2-3): 53-64 (2013) - [j7]Mateusz Zotkiewicz, Walid Ben-Ameur:
Volume-oriented routing and its modifications. Telecommun. Syst. 52(2): 935-945 (2013) - [c4]Teresa Gomes, Mateusz Zotkiewicz:
Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs. ICUMT 2013: 179-186 - 2011
- [b1]Mateusz Zotkiewicz:
Robust routing optimization in resilient networks : Polyhedral model and complexity issues. (Optimisation robuste du routage dans les réseaux résilients : Modèle polyédrique et problèmes de complexité). Telecom & Management SudParis, Évry, Essonne, France, 2011 - [j6]Walid Ben-Ameur, Mateusz Zotkiewicz:
Robust routing and optimal partitioning of a traffic demand polytope. Int. Trans. Oper. Res. 18(3): 307-333 (2011) - [c3]Dritan Nace, Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz:
A polynomial multicommodity flow problem with difficult path generation. ICUMT 2011: 1-5 - [c2]Mateusz Zotkiewicz, Michal Pióro:
Reliability of wireless mesh networks with directional antennas. ICUMT 2011: 1-7 - 2010
- [j5]Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro:
Failure disjoint paths. Electron. Notes Discret. Math. 36: 1105-1112 (2010) - [j4]Walid Ben-Ameur, Mateusz Zotkiewicz:
Polynomial traffic demand polytope partitioning. Electron. Notes Discret. Math. 36: 1113-1120 (2010) - [j3]Mateusz Zotkiewicz, Walid Ben-Ameur, Michal Pióro:
Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks. IEEE Commun. Lett. 14(8): 776-778 (2010) - [j2]Artur Tomaszewski, Michal Pióro, Mateusz Zotkiewicz:
On the complexity of resilient network design. Networks 55(2): 108-118 (2010)
2000 – 2009
- 2009
- [j1]Mateusz Zotkiewicz, Michal Pióro, Artur Tomaszewski:
Complexity of resilient network optimisation. Eur. Trans. Telecommun. 20(7): 701-709 (2009) - [c1]Mateusz Zotkiewicz, Walid Ben-Ameur:
More Adaptive Robust Stable Routing. GLOBECOM 2009: 1-6
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-05-08 21: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
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:
