World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
9037
World Ranking
7523
National Ranking
3271

Overview

Renato F. Werneck is affiliated with Microsoft in the United States. Their research is primarily in the field of Computer Science, with a focus on various subfields including Signal Processing, Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Transportation, and Automotive Engineering.

The scientist's work covers multiple main topics, emphasizing Data Management and Algorithms, Computational Geometry and Mesh Generation, Graph Theory and Algorithms, Transportation Planning and Optimization, and Transportation and Mobility Innovations.

Renato F. Werneck has published research papers, notably in the Proceedings of the International Symposium on Combinatorial Search. Two recent papers include:

  • Customizable Route Planning in Road Networks (2021, Proceedings of the International Symposium on Combinatorial Search)
  • Round-Based Public Transit Routing (2021, Proceedings of the International Symposium on Combinatorial Search)

The frequent co-authors collaborating with Werneck are:

  • Daniel Delling
  • Thomas Pajor
  • Andrew V. Goldberg

The venue with which Werneck most frequently publishes is the Proceedings of the International Symposium on Combinatorial Search.

Best Publications

  • Route Planning in Transportation Networks

    Hannah Bast;Daniel Delling;Andrew V. Goldberg;Matthias Müller-Hannemann

  • Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

    Ricardo Fukasawa;Humberto Longo;Jens Lysgaard;Marcus Poggi de Aragão

  • Round-Based Public Transit Routing

    Daniel Delling;Thomas Pajor;Renato F. Werneck

  • A Hybrid Heuristic for the p -Median Problem

    Mauricio G. C. Resende;Renato F. Werneck

  • Reach for A : efficient point-to-point shortest path algorithms

    Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck

  • A hub-based labeling algorithm for shortest paths in road networks

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

  • Computing point-to-point shortest paths from external memory

    Andrew V. Goldberg;Renato Werneck

  • Highway dimension, shortest paths, and provably efficient algorithms

    Ittai Abraham;Amos Fiat;Andrew V. Goldberg;Renato F. Werneck

  • PHAST: Hardware-accelerated shortest path trees

    Daniel Delling;Andrew V. Goldberg;Andreas Nowatzyk;Renato F. Werneck

  • Sketch-based Influence Maximization and Computation: Scaling up with Guarantees

    Edith Cohen;Daniel Delling;Thomas Pajor;Renato F. Werneck

  • Hierarchical hub labelings for shortest paths

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

  • A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

    Celso C. Ribeiro;Eduardo Uchoa;Renato F. Werneck

  • Fast local search for the maximum independent set problem

    Diogo V. Andrade;Mauricio G. Resende;Renato F. Werneck

  • Customizable route planning

    Daniel Delling;Andrew V. Goldberg;Thomas Pajor;Renato F. Werneck

  • Alternative routes in road networks

    Ittai Abraham;Daniel Delling;Andrew V. Goldberg;Renato F. Werneck

  • Customizable Route Planning in Road Networks

    Daniel Delling;Andrew V. Goldberg;Thomas Pajor;Renato F. Werneck

  • A hybrid multistart heuristic for the uncapacitated facility location problem

    Mauricio G. C. Resende;Renato Fonseca F. Werneck

  • Graph Partitioning with Natural Cuts

    Daniel Delling;Andrew V. Goldberg;Ilya Razenshteyn;Renato F. Werneck

  • Better landmarks within reach

    Andrew V. Goldberg;Haim Kaplan;Renato F. Werneck

  • Maximum flows by incremental breadth-first search

    Andrew V. Goldberg;Sagi Hed;Haim Kaplan;Robert E. Tarjan

  • Discrete Optimization A hybrid multistart heuristic for the uncapacitated facility location problem

    Mauricio G. C. Resende;Renato F. Werneck

Frequent Co-Authors

Daniel Delling
Daniel Delling Apple (United States)
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Robert E. Tarjan
Robert E. Tarjan Princeton University
Haim Kaplan
Haim Kaplan Tel Aviv University
Edith Cohen
Edith Cohen Tel Aviv University
Mauricio G. C. Resende
Mauricio G. C. Resende University of Washington
Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Christian Schulz
Christian Schulz Heidelberg University
Amos Fiat
Amos Fiat Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science opens doors to a wide range of related degrees and career options, especially with the flexibility of online learning. For example, pursuing an online bachelor’s in electrical engineering can complement a foundation in computer science and help you qualify for roles in robotics, hardware design, or embedded systems.

If you’re seeking faster ways to boost your career, quick certifications that pay well can sharpen your resume. These routes are ideal for those who want to specialize in fields such as cybersecurity, cloud computing, or data analytics without the time commitment of a full degree program.

Graduates aiming for advanced positions may opt for one of the quickest masters degree online to gain additional expertise within a year or less. It’s also smart to look into the most useful masters degrees in high demand, like artificial intelligence or information systems, which can lead to specialized and lucrative roles in tech.

Whatever your career goal, the expanding landscape of online degrees and certifications offers flexible and valuable pathways to success.

Best Scientists Citing Renato F. Werneck

Trending Scientists

Recently Published Articles