Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

François Clad

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 Thomas Alfroy

> Home > Persons > François Clad

Publications

2022
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/cn/LuttringerAMBCP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cn/LuttringerAMBCP22
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser:
Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks. Comput. Networks 212: 109015 (2022)
2021
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-09320
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-09320
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser:
Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks. CoRR abs/2110.09320 (2021)
2020
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/nca/LuttringerAMBCP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nca/LuttringerAMBCP20
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser:
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. NCA 2020: 1-8
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2011-05191
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2011-05191
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser:
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. CoRR abs/2011.05191 (2020)

a service of

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.