What is he best known for?
The fields of study he is best known for:
- Algorithm
- Artificial intelligence
- Mathematical optimization
Shortest path problem, K shortest path routing, Mathematical optimization, Algorithm and Heuristics are his primary areas of study.
His study in K shortest path routing is interdisciplinary in nature, drawing from both Contraction hierarchies, Machine learning, Theoretical computer science and Artificial intelligence.
Renato F. Werneck focuses mostly in the field of Contraction hierarchies, narrowing it down to topics relating to Road networks and, in certain cases, Real-time computing.
His Mathematical optimization study integrates concerns from other disciplines, such as Vehicle routing problem, GRASP and Distance-hereditary graph.
His Algorithm research integrates issues from Column generation, Polytope and Relaxation.
His Heuristics research includes themes of Local search, Overhead, Greedy algorithm and Graph.
His most cited work include:
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (359 citations)
- Route Planning in Transportation Networks (283 citations)
- A Hybrid Heuristic for the p -Median Problem (240 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Algorithm, Shortest path problem, Theoretical computer science, Mathematical optimization and Combinatorics.
Renato F. Werneck interconnects Kernelization, Graph and Heuristics in the investigation of issues within Algorithm.
The study incorporates disciplines such as Tree and Vertex in addition to Shortest path problem.
His Theoretical computer science research is multidisciplinary, relying on both Preprocessor, Graph, Road networks and Point of interest.
His research integrates issues of Vehicle routing problem and GRASP in his study of Mathematical optimization.
Within one scientific family, Renato F. Werneck focuses on topics pertaining to Discrete mathematics under Combinatorics, and may sometimes address concerns connected to Data structure.
He most often published in these fields:
- Algorithm (31.62%)
- Shortest path problem (23.93%)
- Theoretical computer science (23.08%)
What were the highlights of his more recent work (between 2013-2018)?
- Algorithm (31.62%)
- Theoretical computer science (23.08%)
- Distributed computing (11.11%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Algorithm, Theoretical computer science, Distributed computing, Preprocessor and Road networks.
His Algorithm research is multidisciplinary, incorporating elements of Kernelization, Independent set, Graph, Heuristics and Speedup.
His Heuristics study incorporates themes from Scalability, Set and Steiner tree problem.
His studies in Theoretical computer science integrate themes in fields like Discrete mathematics, Centrality, Graph, Approximation algorithm and Search engine indexing.
His Graph research incorporates elements of Time complexity and Shortest path problem.
In Distributed computing, Renato F. Werneck works on issues like Public transport, which are connected to State and Operations research.
Between 2013 and 2018, his most popular works were:
- Route Planning in Transportation Networks (283 citations)
- Sketch-based Influence Maximization and Computation: Scaling up with Guarantees (177 citations)
- Route Planning in Transportation Networks (88 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Artificial intelligence
- Graph theory
The scientist’s investigation covers issues in Graph, Distributed computing, Theoretical computer science, Algorithm and Variety.
Graph and Shortest path problem are commonly linked in his work.
As part of the same scientific family, Renato F. Werneck usually focuses on Distributed computing, concentrating on Road networks and intersecting with Scalable algorithms and Simulation.
His work on Greedy algorithm as part of general Algorithm study is frequently linked to Node, therefore connecting diverse disciplines of science.
His study looks at the relationship between Variety and topics such as Operations research, which overlap with Public transport and Range query.
His biological study spans a wide range of topics, including Mathematical optimization, Heuristics, Computational problem, Graph and Greedy randomized adaptive search procedure.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
