default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Romain Luttringer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Online Space-Time Travel Planning in Dynamic Graphs. SAND 2024: 7:1-7:14- [i7]Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol:
La ROUTOURNE va tourner. CoRR abs/2405.07584 (2024) - 2023
- [c4]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Offline Constrained Backward Time Travel Planning. SSS 2023: 466-480 - [i6]Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol:
A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing. CoRR abs/2311.17769 (2023) - 2022
- [b1]Jean-Romain Luttringer:
Path computation algorithms in IP networks: reliable hot-potato routing & deployable multi-constrained tunnels. (Calcul de chemins pour réseaux IP: routage de la patate chaude et froide lors de pannes & chemins multi-contraints pour segment routing). University of Strasbourg, France, 2022 - [j2]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) - [i5]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Constrained Backward Time Travel Planning is in P. CoRR abs/2205.03372 (2022) - 2021
- [c3]Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol:
A Fast-Convergence Routing of the Hot-Potato. INFOCOM 2021: 1-10 - [i4]Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol:
A Fast-Convergence Routing of the Hot-Potato. CoRR abs/2101.09002 (2021) - [i3]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
- [j1]Jean-Romain Luttringer, Yves Vanaubel, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
Let There Be Light: Revealing Hidden MPLS Tunnels With TNT. IEEE Trans. Netw. Serv. Manag. 17(2): 1239-1253 (2020) - [c2]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 - [i2]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)
2010 – 2019
- 2019
- [c1]Yves Vanaubel, Jean-Romain Luttringer, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels. TMA 2019: 65-72 - [i1]Yves Vanaubel, Jean-Romain Luttringer, Pascal Mérindol, Jean-Jacques Pansiot, Benoit Donnet:
TNT, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels. CoRR abs/1901.10156 (2019)
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-06-17 00:44 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:
