Michal Pióro

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Deep Medhi

> Home > Persons > Michal Pióro

Publications

2014
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/icnp/LiuMPM14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnp/LiuMPM14
Xuan Liu, Sudhir Mohanraj, Michal Pióro, Deep Medhi:
Multipath Routing from a Traffic Engineering Perspective: How Beneficial Is It? ICNP 2014: 143-154
2005
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tnsm/SrivastavaAPM05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tnsm/SrivastavaAPM05
Shekhar Srivastava, Gaurav Agrawal, Michal Pióro, Deep Medhi:
Determining link weight system under various objectives for OSPF networks using a Lagrangian relaxation-based approach. IEEE Trans. Netw. Serv. Manag. 2(1): 9-18 (2005)
2004
[b1]
- no documents available
  - details & citations
- export record
  dblp key:
  - books/daglib/0018443
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/daglib/0018443
Michal Pióro, Deepankar Medhi:
Routing, flow, and capacity design in communication and computer networks. Morgan Kaufmann 2004, ISBN 978-0-12-557189-0, pp. I-XXVIII, 1-765
2003
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/drcn/KrithikaivasanS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/drcn/KrithikaivasanS03
Balaji Krithikaivasan, Shekhar Srivastava, Michal Pióro, Deep Medhi:
Backup path restoration design using path generation technique. DRCN 2003: 77-84

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.