List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Exact combinatorial branch-and-bound for graph bisection 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Round-Based Public Transit Routing 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Robust mobile route planning with limited connectivity 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Finding near-optimal independent sets at scale 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Fast local search for Steiner trees in graphs 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| An experimental study of minimum mean cycle algorithms 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Shortest path feasibility algorithms: an experimental evaluation 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Reach for \(A^\ast\): efficient point-to-point shortest path algorithms 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
| Highway dimension and provably efficient shortest path algorithms Journal of the ACM | 2018-08-02 | Paper |
| On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| A robust and scalable algorithm for the Steiner problem in graphs Mathematical Programming Computation | 2018-06-25 | Paper |
| Finding near-optimal independent sets at scale Journal of Heuristics | 2017-09-08 | Paper |
| Fast local search for the maximum independent set problem Journal of Heuristics | 2017-04-04 | Paper |
| Faster and more dynamic maximum flow by incremental breadth-first search Algorithms - ESA 2015 | 2015-11-19 | Paper |
| An exact combinatorial algorithm for minimum graph bisection Mathematical Programming. Series A. Series B | 2015-10-19 | Paper |
| Alternative routes in road networks ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
| Self-adjusting top trees | 2014-10-13 | Paper |
| Robust distance queries on massive networks Algorithms - ESA 2014 | 2014-10-08 | Paper |
| Data structures for mergeable trees ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Highway dimension, shortest paths, and provably efficient algorithms | 2014-05-22 | Paper |
| Shortest-path feasibility algorithms, an experimental evaluation ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Dynamic trees in practice ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Fast local search for the Steiner problem in graphs ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Computing multimodal journeys in practice | 2014-01-21 | Paper |
| Hierarchical hub labelings for shortest paths Algorithms – ESA 2012 | 2012-09-25 | Paper |
| Better Bounds for Graph Bisection Algorithms – ESA 2012 | 2012-09-25 | Paper |
| A hybrid GRASP with perturbations for the Steiner problem in graphs INFORMS Journal on Computing | 2012-05-30 | Paper |
| Maximum flows by incremental breadth-first search Algorithms – ESA 2011 | 2011-09-16 | Paper |
| VC-dimension and shortest path algorithms Automata, Languages and Programming | 2011-07-06 | Paper |
| Design of data structures for mergeable trees Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Reach for \(A^*\): shortest path algorithms with preprocessing | 2010-07-09 | Paper |
| Virtual Ring Routing Trends Lecture Notes in Computer Science | 2009-11-19 | Paper |
| Finding Dominators in Practice Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
| Finding Dominators in Practice Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
| A fast swap-based local search procedure for location problems Annals of Operations Research | 2008-03-31 | Paper |
| A hybrid multistart heuristic for the uncapacitated facility location problem European Journal of Operational Research | 2007-01-09 | Paper |
| Robust branch-and-cut-and-price for the capacitated vehicle routing problem Mathematical Programming. Series A. Series B | 2006-06-14 | Paper |
| Integer Programming and Combinatorial Optimization Lecture Notes in Computer Science | 2005-12-23 | Paper |
| Algorithms – ESA 2004 Lecture Notes in Computer Science | 2005-08-18 | Paper |
| Finding minimum congestion spanning trees ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
| A hybrid heuristic for the \(p\)-median problem Journal of Heuristics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1926656 (Why is no real title available?) | 2003-06-11 | Paper |
| Dual heuristics on the exact solution of large Steiner problems | 2001-10-24 | Paper |
Research outcomes over time
This page was built for person: Renato F. Werneck
