Projects
This is a list of my research software projects that are publicly available.
Influence Computation and Maximization
This project constitutes the original C++ implementation of the influence oracle and influence maximization algorithms, which were developed in the paper “Sketch-based Influence Maximization and Computation: Scaling Up with Guarantees” by Edith Cohen, Daniel Delling, Thomas Pajor, and Renato Werneck. The paper was presented at CIKM 2014 in Shanghai, China.
The code was developed at Microsoft Research and has been released under MIT license.
[documentation and reference] [github]
Route Planning Benchmark
This project implements a simple benchmark with the goal of making the empirical running times of route planning algorithms developed by different research groups comparable. The benchmark computes a number of shortest path trees rooted at random vertices on a continental road network, and reports the median running time as score.
The benchmark was used in the survey article “Route Planning in Transportation Networks” to scale running times from different papers in order to make them comparable. Researchers working on new algorithms are highly encouraged to use the benchmark when comparing their running times with the state of the art.
The code was developed at Microsoft Research and has been released under an open source license.