skip to content
Theoretical Computer Science / Theoretische Informatik
Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]
User Tools
Log In
Site Tools
Tools
Old revisions
Recent Changes
Media Manager
Sitemap
Log In
>
Recent Changes
Media Manager
Sitemap
Sidebar
General Information
Staff & Contact
Teaching
Research++
Crossing Number
CS(S)P
Electr. Networks in GD
Genus
KCT
LIP
MLCM
MLVO
MOSP
MPS
MSP
Spanner
Upward Crossing Minimization
Upward Planarity
External Links:
OGDF
Crossing Number - WebCompute
research
Table of Contents
Research Interests
Permanent Projects
DFG Projects
Other Projects
Publications
Benchmark Instances and Solutions
Research, Benchmarks, ...
Research Interests
Algorithm Engineering
Combinatorial Optimization
Exact Solutions for NP-hard problems
Approximation algorithms
(Computation of) Crossing number and other non-planarity measures; Graph Drawing; Graph Theory
Network Optimization
ILP, Branch-and-Cut, Column Generation
Permanent Projects
OGDF: Open Graph Drawing Framework
Exact Computation of Crossing Numbers
DFG Projects
CH 897/7-1
Green Segment Routing
on-going
, starting summer 2021, 1 full PhD position,
together with partner project AS 341/7-1, headed by Nils Aschenbruck
CH 897/2-2
Algorithmische Methoden für Kreuzungszahlen und andere Nichtplanaritätsmaße
English translation:
Algorithmic methods for crossing numbers and other non-planarity measures
completed
, 2016–2020, 1 full PhD position
CH 897/3-1
Starke Approximationsalgorithmen für das Steinerbaumproblem und verwandte Probleme
English translation:
Strong approximation algorithms for the Steiner tree and related problems
completed
, 2016–2018, 1 full PhD position
CH 897/2-1
Algorithmische Methoden für Kreuzungszahlen und andere Nichtplanaritätsmaße
English translation:
Algorithmic methods for crossing numbers and other non-planarity measures
completed
, 2016–2018, 1 full PhD position
CH 897/1-1
Approximationsalgorithmen für topologisches Netzwerkdesign in Theorie und Praxis
English translation:
Approximation algorithms for topological network design in theory and practice
completed
, 2012–2016, 1 full PhD position
Other Projects
Interdisciplinary Graduate School
Graphs and Networks
University-funded, Speaker: Markus Chimani
Mathematics and Computer Science
on-going
, since autumn 2017
Publications
For publication lists of the different staff members, please look at their
individual pages
.
Benchmark Instances and Solutions
Crossing Number
CS(S)P: Closest String and Closest Substring Problems
Electrical Networks in Graph Drawing
Graph Genus
KCT: k-Cardinality Trees
LIP: Longest Induced Path
MLCM: Multi-Level Crossing Minimization
MLVO: Multi-Level Verticality Optimization
MOSP: Multiobjective Shortest Path
MPS: Maximum Planar Subgraph
MSP: Multistage Shortest Path
Spanner Approximations
Upward Crossing Minimization
Upward Planarity
research.txt
· Last modified: 2023/01/11 11:21 by
troost
Page Tools
Old revisions
Back to top