Heiko Schilling: Talks & Posters
2006
|
November 13, 2006 - 9th DIMACS Implementation Challenge - The Shortest Path Problem, Rutgers University, Piscataway, NJ, USA
Fast Point-to-Point Shortest Path Computations with Arc-Flags.
|
20061113-DIMACS.pdf |
|
October 19, 2006 - Phd Defense, TU Berlin
Route Assignment Problems on Large Networks.
|
20061019-Phd.pdf |
|
August 02, 2006 - 19th International Symposium on Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil
Fast Shortest Path Computations on Large Networks.
|
20060802-ISMP-Rio.pdf |
|
July 31, 2006 - 19th International Symposium on Mathematical Programming (ISMP 2006), Rio de Janeiro, Brazil
Length-bounded Cuts and Flows.
|
20060731-ISMP-Rio.pdf |
|
July 14, 2006 - 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), Venice, Italy
Length-bounded Cuts and Flows.
|
2006.07.14.ICALP.pdf |
|
July 12, 2006 - SIAM: Society for Industrial and Applied Mathematics - Annual Meeting, Boston, Massachusetts, USA
Fast Shortest Path Computations on Large Networks.
|
2006.07.12.SIAM.pdf |
|
June 12, 2006 - DFG Jahres-Kolloquium, Aachen
Efficient Algorithms for Path-Based and Dynamic Flow Problems in Large Networks.
|
dfg2006.pdf |
|
May 22, 2006 - Monday Lecture of the DFG Graduate Program CGC at TU Berlin
Length-Bounded Cuts and Flows.
|
20060522-CGC.pdf |
|
May 15, 2006 - University of Liverpool, England
Length-Bounded Cuts and Flows.
|
20060515-Liverpool.pdf |
|
May 04, 2006 - Università degli Studi di Milano, Italy
Length-Bounded Cuts and Flows.
|
20060504-Milano.pdf |
|
March 10, 2006 - 3rd International Conference on High Performance Scientific Computing, Hanoi, Vietnam
A Column Generation Approach for Routing and Scheduling Freight Trains
|
sbb-2006-03-10.ppt |
2005
|
May 10, 2005 - 4th International Workshop on Efficient and Experimental Algorithms (WEA), Santorini Island, Greece
Partitioning Graphs to Speed Up Dijkstra's Algorithm.
|
wea2005.2.pdf |
|
May 10, 2005 - 4th International Workshop on Efficient and Experimental Algorithms (WEA), Santorini Island, Greece
Acceleration of Shortest Path and Constrained Shortest Path Computation.
|
wea2005.1.pdf |
|
May 03, 2005 - Oberseminar at the TU Berlin
Shortest Path Computation - An Overview.
|
seminar20050503.pdf |
|
March 12, 2005 - DFG Jahres-Kolloquium, Paderborn
Efficient Algorithms for Path-Based and Dynamic Flow Problems in Large Networks.
|
dfg2005.pdf |
|
February 7, 2005 - Monday Lecture of the DFG Graduate Program CGC
Flows over Time: Towards a more Realistic and Computationally Tractable Model.
|
slides.ppt |
2004
|
December 16, 2004 - Oberseminar at the TU Berlin
Flows over Time: Towards a more Realistic and Computationally Tractable Model.
|
slides.ppt |
|
November 02, 2004 - DFG Workshop "Flüsse in großen Netzwerken", Dortmund
Flexible Implementation von Graphenalgorithmen mittels generischer Techniken in C++.
|
slides.pdf |
|
September 02, 2004 - OR Conference, Tilburg
Acceleration of Shortest Path Computation.
|
slides.pdf |
|
July 22, 2004 - DFG Jahres-Kolloquium, Karlsruhe
Efficient Algorithms for Path-Based and Dynamic Flow Problems in Large Networks.
|
dfg2004.pdf |
|
June 15, 2004 - Mittagsseminar at the University of Karlsruhe
Acceleration of Shortest Path Computation.
|
slides.pdf |
|
May 26, 2004 - SOS Seminar at the ETH Zürich
Acceleration of Shortest Path Computation.
|
slides.pdf |
|
March 16, 2004 - DFG Workshop "Shortest Paths", Karlsruhe
Acceleration of Shortest Path Computation.
|
slides.pdf |
2003
|
December 15, 2003 - Matheon Netzwerktag at the TU Berlin
Acceleration of Shortest Path Computation.
|
slides.pdf |
|
November 03, 2003 - Monday Lecture of the DFG Graduate Program CGC
Acceleration of Shortest Path Computation.
|
slides.pdf |
|
March 27, 2003 - DFG Jahres-Kolloquium, Tübingen
Efficient Algorithms for Path-based Multicommodity Flows in Large Networks.
|
slides.pdf |
2002
|
July 22, 2002 - DFG Jahres-Kolloquium, Konstanz
Path-based Multicommodity Flows in Large Networks.
|
slides.pdf |
|
June 24, 2002 - Postersession of the DFG Graduate Program CGC at the FU Berlin
Path-based Flow Problems in Large Networks.
|
cgc-poster.ps.gz |
Heiko Schilling: Talks & Posters