AMORE - Algorithmic Methods for Optimizing the Railways in Europe
> AMORE was a Research Training Network funded by the Research Directorate-General of the European Commission. It had started on March 1st, 2000, and lasted for four years, with participating research groups from Denmark, Germany, Greece, Italy, The Netherlands, and Switzerland.

Within AMORE, models for railway optimization problems have been developed, and algorithms for solving them have been proposed and implemented. Besides its core disciplines algorithms design and algorithms engineering, this is an interdisciplinary endeavour requiring a close cooperation between computer science, mathematics, and traffic engineering.
 
 ARRIVAL -Algorithms for Robust and online Railway optimization:
Improving the Validity and reliAbility of Large scale systems
> ARRIVAL is the follow-up project of AMORE, founded by the European Commission. It has startet in February, 2006, und will last for three years. The participants are the french railroad company SNCF and 12 research groups in Greece, Germany, Italia, Spain, Switzerland, and the Netherlands.

The goal of ARRIVAL is to optimize the perhaps most complex and largest in scale (transportation) setting: that of railway systems. Railway optimization deals with planning and scheduling problems over several time horizons. Unlike AMORE, this project focuses on two important and actually unexplored facets of planning that pose even harder optimization questions: robust planning and online (real-time) planning.

 
 COSIN - CO-evolution and Self-organization In dynamic Networks
> COSIN is a research project funded by the European Commission in the 5th Framework Programme. It has officially started in April, 2002, and will last for three years, with participating research groups from France, Germany, Italy, Spain, and Switzerland.

The goal of COSIN is to develop theoretical methodologies for the characterization of complex networks, statistical models for network growth and evolution, and visualization tools for large-scale systems. The notion of complexity in this project rests on the assumption that quantitatively larger systems are qualitatively different.

 
 DELIS - Dynamically Evolving Large-scale Information Systems
> The DELIS project was initiated by a consortium of 18 european institutes which will be extendend to 19 after one year. It is funded by the European Comission in a specific framework for "Integrating and Strengthening the European Research Area". It has officially started in January, 2004 with a duration of four years.

The goal of this project is to develop methods, techniques and tools to cope with challenges imposed by large scale systems like the physical Internet. An interdisciplinary approach to the problems is achieved by combining the fields of Computer Science, Physics and Economy.

 
 GEONET - Geometric Networks and Their Visualization
> GEONET is a research project funded by the German Science Foundation (DFG) in the framework of the "Aktionsplan Informatik" that helps young scientists to build up their own research group. The project has started on April 1, 2003, and will last for at most five years.

The project consists of two parts: (a) analysis and construction, and (b) visualization of geometric networks. In part (a) the focus is on networks where the distance of two geometric objects (like points or rectangles) within the network is bounded by a constant times their bee-line (i.e. Euclidean) distance. Such networks are called Euclidean spanners. They have many applications in distributed systems, communication network design, robotics, pattern recognition, data compression, and in biology. Part (b) deals with the question how networks with an underlying geometry (like subway networks) have to be distorted in the visualization process in order to improve their readability.

More information...

 
 GraphDB - Exchanging and archiving public and private graphs
> GraphDB is partially supported by the Future and Emerging Technologies Unit of EC (IST priority -- 6th FP), under contract no. FP6-021235-2 (project ARRIVAL), and by the Deutsche Forschungsgemeinschaft (DFG) within DFG-Schwerpunkt Nr. 1126.

GraphDB is an exchange and archive system for graphs. The system allows users to dynamically create metadata, graphs and graph groups. These items can then be associated with each other. The database can be queried and the resulting graphs are downloadable.
 
 Time Table Information in Public Transport
> DFG-funded project on "Exact algorithms for the evaluation of large, weakly structured data sets for time table information in public transport.

The goal is to develop a time table information system for wide-area public transport networks and its emperical evaluation. We develop exact algorithms for the evaluation of large weakly structured data sets under various optimization criteria. The research projects includes the development of speed-up techniques for online shortest path computation.

 
 visone - analysis and visualization of social networks
> visone is a DFG-funded project within the research cluster on Algorithmics of Large and Complex Networks.

The goal of visone is to develop models and algorithms to integrate and advance the analysis and visualization of social networks. An important aspect of visone is the design and implementation of a software tool intended for research and teaching in social network analysis. It is specifically designed to allow experts and novices alike to apply innovative and advanced visual methods with ease and accuracy.

 
 CREEN -  Critical Events in Evolving Networks
> The aim of the CREEN project is the development of new methods for detecting upcoming critical events in dynamic networks. This multidisciplinary project is funded by the European Commission in the sixth EU Framework Programme.

Our current focus is the extension of the network analysis application VISONE. We are working on tools and methods for the visualisation of dynamic events in networks. We are currently extending the internal graph data structures and storage mechanism to handle dynamic graphs.

 
 GRK 1194 -  Self-organizing Sensor-Actuator-Networks
> GRK 1194 is a DFG-founded research training group on self-organizing sensor-actuator-networks. The goal is to bring together competences from different research areas working on aspects of those networks. These aspects are grouped into three main categories: hardware, communication and information processing. Topics range from low-power hardware desing and algorithmic aspects to decentralized reconstruction of distributed phenomena.
GRK 1194 has officially started in November 2005 and will last for nine years. There are 11 chairs from the Faculty of Informatics and the Faculty of Electrical Engineering and Information Technology participating in this project.
The work of the algorithmic group aims at algorithmic aspects of combinatorial and gemoetric problems in sensor-actuator networks, such as localization, clustering and topology control.
 
 SPP 1307 - Algorithm Engineering
> Within the Priority Programme 1307 "Algorithm Engineering" of the Deutsche Forschungsgemeinschaft (German Research Foundation) we concern ourselves with the clustering of static and temporal graphs. The core of Algorithm Engineering is a cycle driven by falsifiable hypotheses. It consist of design, analysis, implementation and experimental evaluation of practicable algorithms. Realistic models for both computers and applications, as well as algorithm libraries and collections of real input data allow a close coupling to applications.
In our subproject algorithms for the clustering of graphs shall be developed. The focal point of our interest are clusterings which are based on the intuition of identifying as clusters dense subgraphs that are loosely connected among one another.
 
top