Source

Computer Science Publication Server (University of Cologne)

Source type: repository

Full text for all works: No

OpenAlex ID: S4306401304

A cellular automaton model for freeway traffic

1992 · Kai Nagel, Michael Schreckenberg · Journal de Physique I · 3,846

Microscopic Modeling of Traffic Flow: Investigation of Collision Free Vehicle Dynamics.

1998 · S. Krauß · Computer Science Publication Server (University of Cologne) · 551

Discrete stochastic models for traffic flow

1995 · M. Schreckenberg, A. Schadschneider, et al. · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 497

PDF

Two lane traffic simulations using cellular automata

1996 · M. Rickert, K. Nagel, et al. · Physica A Statistical Mechanics and its Applications · 474

PDF

Emergent traffic jams

1995 · Kai Nagel, Maya Paczuski · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 334

PDF

A Cutting Plane Algorithm for the Linear Ordering Problem

1984 · Martin Grötschel, Michael Jünger, et al. · Operations Research · 318

Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm

2005 · Stefan Hachul, Michael Jünger · Lecture notes in computer science · 264

Using hidden Markov models to analyze gene expression time course data

2003 · Alexander Schliep, Alexander Schönhuth, et al. · Bioinformatics · 246

An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model

1998 · C. Gawron · International Journal of Modern Physics C · 212

Realistic multi-lane traffic rules for cellular automata

1997 · Peter Wagner, Kai Nagel, et al. · Physica A Statistical Mechanics and its Applications · 206

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

1997 · Michael Jünger, Petra Mutzel · Journal of Graph Algorithms and Applications · 199

Experiments in quadratic 0–1 programming

1989 · F. Barahona, M. Jünger, et al. · Mathematical Programming · 195

Facets of the linear ordering polytope

1985 · Martin Grötschel, Michael Jünger, et al. · Mathematical Programming · 177

Fast and robust registration of PET and MR images of human brain

2004 · Jiřı́ Čı́žek, Karl Herholz, et al. · NeuroImage · 172

Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm

1995 · C. De Simone, M. Diehl, et al. · Journal of Statistical Physics · 160

New classes of fast lower bounds for bin packing problems

2001 · Sándor P. Fekete, Jörg Schepers · Mathematical Programming · 157

Vertex Colouring and Forbidden Subgraphs ? A Survey

2004 · Bert Randerath, Ingo Schiermeyer · Graphs and Combinatorics · 149

Deterministic Models for Traffic Jams

1993 · Kai Nagel, Hans J. Herrmann · Computer Science Publication Server (University of Cologne) · 141

A fast parallel SAT-solver — efficient workload balancing

1996 · Max Böhm, Ewald Speckenmeyer · Annals of Mathematics and Artificial Intelligence · 130

Small Molecule Subgraph Detector (SMSD) toolkit

2009 · Syed Asad Rahman, Matthew Bashton, et al. · Journal of Cheminformatics · 127

PDF

Selecting signature oligonucleotides to identify organisms using DNA arrays

2002 · Lars Kaderali, Alexander Schliep · Bioinformatics · 120

Two Dimensional Rendezvous Search

2001 · Edward J. Anderson, Sándor P. Fekete · Operations Research · 113

On the acyclic subgraph polytope

1985 · Martin Grötschel, Michael Jünger, et al. · Mathematical Programming · 112

Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition

2000 · Elias Dahlhaus · Journal of Algorithms · 107

The critical exponents of the two-dimensional Ising spin glass revisited: exact ground-state calculations and Monte Carlo simulations

1996 · H Rieger, L Santen, et al. · Journal of Physics A Mathematical and General · 107

PDF

Works count: 319

Citation count: 1,080

H-index: 12

I10-index: 16

2yr mean citedness: