Project List

The open source software SGDT is an interactive user-friendly tool for displaying simultaneous drawings of a set of up to 32 graphs in 2.5D style. SGDT allows rotations around three axis, zooming into the drawing, choosing colors for various items and blinding out different layers. Using OGDF algorithms, SGDT is able to recalculate and visualize the given graph.

M. Jünger, M. Schulz, W.Zychowicz, T. Dehling.

Automatic Graph Drawing is a relatively new field in Computer Science. The task is to draw diagrams of objects and their relations in such a way that they are easy to read and understand. Applications are, e.g., animation of algorithms, data and flow models, PERT- and ER-diagrams, and the visualization of data in archeology or data mining. This project aims to develop efficient algorithms for automatic graph drawing that are integrated in a library (AGD-Library). This is a project within the DFG-Research Cluster "Efficient Algorithms for Discrete Problems and Their Applications" of the German Science Foundation (DFG).

C. Buchheim, M. Jünger, T. Lange, S. Leipert

Technische Universität Wien, Universität Trier

German Science Foundation (DFG)

SCIL is a C++ class library for modelling and implementing Integer Linear Programming based algorithms for Combinatorial Optimization Problems

M. Elf, M. Jünger

Max-Planck-Institut für Informatik, Saarbrücken

European Union: Program IST-1999-14186
ALCOM-FT - ALgorithms and COMplexity - Future Technology

Together with our industrial partner Lufthansa Systems GmbH in Frankfurt a.M. we developed techniques to optimize the aircraft rotations of European Airlines with respect to minimizing delay risks.

M. Elf, M. Jünger, V. Kaibel

Lufthansa Systems GmbH, Frankfurt a.M.

Bundesministerium für Bildung und Forschung (BMBF)

These are the downloadable implementations of various efficient algorithms for minimum cuts in undirected graphs as used in the study zpr97-271 (published in: Algorithmica 26 (2000) 172-195) along with some data files.

M. Jünger, G. Rinaldi, S. Thienel

IASI-CNR, Rome

European Union ESPRIT Long Term Research Project No. 20244 (ALCOM-IT)

The VBCTOOL is a graphical tool specially designed to draw binary and general rooted trees, as they occur during an algorithmic process. It can be used in three different contexts: simple drawing of trees, drawing a tree during a computational process, and emulating a tree growing process after the computation is finished.

M. Diehl, J. Kupke, M. Jünger, S. Leipert

The problem of optimizing a quadratic objective function over binary variables subject to linear constraints arises in many applications. In our project, we focus on problems that could be solved efficiently if the objective function was linear. For this, we use the standard linearization and solve the problem with a cutting plane approach.

C. Buchheim, F. Liers

European Commission (RTN ADONET 504438)

The visualization of large and complex networks is indispensable in order to get a deeper understanding of their structures. The big challenge is to obtain well-readable layouts in provable fast running times. We investigate a general approaches to improve the readability of such drawings by reducing the number of edge crossings and preserving esthetic requirements like uniformity of edge length and the display of symmetries.

S. Hachul, M. Jünger

European Union