default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenato F. Werneck
- > Home > Persons > Renato F. Werneck
Publications
- 2018
[j24]Thomas Pajor, Eduardo Uchoa
, Renato F. Werneck:
A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1): 69-118 (2018)- 2017
- [j22]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks. Transp. Sci. 51(2): 566-591 (2017) - 2016
- [p1]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - 2015
- [j18]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing. Transp. Sci. 49(3): 591-604 (2015) - [c47]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. SEA 2015: 273-285 - [i8]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - [i7]Daniel Delling, Julian Dibbelt, Thomas Pajor, Renato F. Werneck:
Public Transit Labeling. CoRR abs/1505.01446 (2015) - 2014
- [c46]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CIKM 2014: 629-638 - [c45]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing classic closeness centrality, at scale. COSN 2014: 37-50 - [c44]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Robust Distance Queries on Massive Networks. ESA 2014: 321-333 - [i5]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. CoRR abs/1408.6282 (2014) - [i4]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Computing Classic Closeness Centrality, at Scale. CoRR abs/1409.0035 (2014) - [i3]Edith Cohen, Daniel Delling, Thomas Pajor, Renato F. Werneck:
Timed Influence: Computation and Maximization. CoRR abs/1410.6976 (2014) - [i2]Thomas Pajor, Eduardo Uchoa, Renato F. Werneck:
A Robust and Scalable Algorithm for the Steiner Problem in Graphs. CoRR abs/1412.2787 (2014) - 2013
- [c39]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck:
Customizable Route Planning in Road Networks (Extended Abstract). SOCS 2013: 212 - [c38]Daniel Delling, Thomas Pajor, Renato F. Werneck:
Round-Based Public Transit Routing (Extended Abstract). SOCS 2013: 213 - [c35]Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, Renato F. Werneck:
Computing Multimodal Journeys in Practice. SEA 2013: 260-271 - 2012
- [c33]Daniel Delling, Thomas Pajor, Renato Fonseca F. Werneck:
Round-Based Public Transit Routing. ALENEX 2012: 130-140 - 2011
- [c20]Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato Fonseca F. Werneck:
Customizable Route Planning. SEA 2011: 376-387
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-08-22 20:51 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:
