Mateusz Zotkiewicz

According to our database1, Mateusz Zotkiewicz authored at least 29 papers between 2009 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On optimal trajectory for the multi-period evolution of FTTx networks.
Telecommun. Syst., 2019

2018
MIP model for efficient dimensioning of real-world FTTH trees.
Telecommun. Syst., 2018

Uncertainty in FTTH splitter installation.
Networks, 2018

Multipolar robust optimization.
EURO J. Comput. Optim., 2018

2016
Minimum Dependencies Energy-Efficient Scheduling in Data Centers.
IEEE Trans. Parallel Distributed Syst., 2016

Profitable areas in large-scale FTTH network optimization.
Telecommun. Syst., 2016

2015
Generalized elastic flow rerouting scheme.
Networks, 2015

2014
Exact approach to reliability of wireless mesh networks with directional antennas.
Telecommun. Syst., 2014

Resilient arcs and node disjointness in diverse routing.
Opt. Switch. Netw., 2014

Max-Min Fairness in WMNs with Interference Cancelation Using Overheard Transmissions.
J. Appl. Math., 2014

Fractional routing using pairs of failure-disjoint paths.
Discret. Appl. Math., 2014

On max-min fair flow optimization in wireless mesh networks.
Ad Hoc Networks, 2014

After Failure Repair Optimization in dynamic flexgrid optical networks.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

2013
Volume-oriented routing and its modifications.
Telecommun. Syst., 2013

Column generation algorithm for RSA problems in flexgrid optical networks.
Photonic Netw. Commun., 2013

Complexity of a classical flow restoration problem.
Networks, 2013

Efficient MIP formulation for optimal 1-for-N diversity coding.
Electron. Notes Discret. Math., 2013

Multipolar routing: where dynamic and static routing meet.
Electron. Notes Discret. Math., 2013

Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs.
Proceedings of the 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2013

2011
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é).
PhD thesis, 2011

Robust routing and optimal partitioning of a traffic demand polytope.
Int. Trans. Oper. Res., 2011

Reliability of wireless mesh networks with directional antennas.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

A polynomial multicommodity flow problem with difficult path generation.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010
On the complexity of resilient network design.
Networks, 2010

Finding Failure-Disjoint Paths for Path Diversity Protection in Communication Networks.
IEEE Commun. Lett., 2010

Failure disjoint paths.
Electron. Notes Discret. Math., 2010

Polynomial traffic demand polytope partitioning.
Electron. Notes Discret. Math., 2010

2009
Complexity of resilient network optimisation.
Eur. Trans. Telecommun., 2009

More Adaptive Robust Stable Routing.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009


  Loading...