5th ACM SIGSPATIAL International Workshop on Computational Transportation Science

article

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

A fast search algorithm for 〈m,m,m〉 Triple Product Property triples and an application for 5×5 matrix multiplication

A near linear time approximation scheme for Steiner tree among obstacles in the plane

Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks

artículo científico publicado en 2012

Chapter 1. Foundations of Algorithm Engineering

article published in 2010

Chapter 10. Challenges in Algorithm Engineering

ChemFrag: Chemically meaningful annotation of fragment ion mass spectra

scientific article published on 01 November 2018

Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals

Dag Realizations of Directed Degree Sequences

Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS

Dealing with large hidden constants

Drawing Trees, Series-Parallel Digraphs, and Lattices

Efficient Computation of Time-Dependent Centralities in Air Transportation Networks

Efficient Timetable Information in the Presence of Delays

Empirical design of geometric algorithms

Engineering Computational Technology

Finding All Attractive Train Connections by Multi-criteria Pareto Search

Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks

Generalized Hanan Grids for Geometric Steiner Trees in Uniform Orientation Metrics

Gerbil: A Fast and Memory-Efficient k-mer Counter with GPU-Support

artículo científico publicado en 2016

Gerbil: a fast and memory-efficient k-mer counter with GPU-support

artículo científico

Getting Train Timetables into the Main Storage1 1This research was done in cooperation with DB Systems, Frankfurt/Main, Germany

article

Hexahedral Mesh Generation by Successive Dual Cycle Elimination

article published in 1999

How to Attack the NP-Complete Dag Realization Problem in Practice

How to find good night train connections

article by Thorsten Gunkel et al published 24 March 2010 in Networks

Implementing Weighted b-Matching Algorithms: Insights from a Computational Study

Implementing weighted b-matching algorithms

scholarly article by Matthias Müller-Hannemann & Alexander Schwartz published 31 December 2000 in Journal of Experimental Algorithmics

Improved approximations for minimum cardinality quadrangulations of finite element meshes

Improving the surface cycle structure for hexahedral mesh generation

In silico fragmentation for computer assisted identification of metabolite mass spectra

artículo científico publicado en 2010

Introduction to special issue ALENEX'11

Kombinatorische Algorithmen zur Netzgenerierung im CAD

MET: a Java package for fast molecule equivalence testing

scientific article published on 17 December 2020

Mesh refinement via bidirected flows: modeling, complexity, and computational results

Minimum strictly convex quadrangulations of convex polygons

Motifs in co-authorship networks and their relation to the impact of scientific publications

article published in 2011

Moving policies in cyclic assembly line scheduling

Non-approximability of just-in-time scheduling

On Optimal Read Trimming in Next Generation Sequencing and Its Complexity

On the cardinality of the Pareto set in bicriteria shortest path problems

article published in 2006

Optimal Block-Based Trimming for Next Generation Sequencing.

artículo científico publicado en 2017

PANDA: a software tool for improved train dispatching with focus on passenger flows

Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters

Pareto Shortest Paths is Often Feasible in Practice

Passenger Flow-Oriented Train Disposition

Phase synchronization in railway timetables

article published in 2010

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Recent Advances in Hexahedral Mesh Generation

Route Planning in Transportation Networks

Shelling Hexahedral Complexes for Mesh Generation

Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation

Subgraph fluctuations in random graphs

The Price of Strict and Light Robustness in Timetable Information

Timetable Information: Models and Algorithms

scholarly article

Uniform Sampling of Digraphs with a Fixed Degree Sequence

Uniform sampling of bipartite graphs with degrees in prescribed intervals