Springe zum Hauptinhalt
Professur Algorithmische und Diskrete Mathematik
Algorithmische und Diskrete Mathematik
FRICO 2018
FRICO 2018

Registration

Sponsored by

Siemens Logo

Inform Logo


The registration is closed.

If you have any questions, please do not hesitate to contact us via frico@tu-chemnitz.de .


Participants

No Name Affiliation Title
1 Sheir Yarkoni Leiden University Using quantum annealing to solve combinatorial optimization problems
2 Timo Gersing RWTH Aachen A New Approach for Extending Cover Inequalities for the Robust Knapsack Polytope
3 Tabea Krabs RWTH Aachen A Multiobjective Approach to Hospital Patient to Room Assignment
4 Farzaneh Ramezani K.N. Toosi University of Technology Primal Dual method for coloring signed graphs
5 Bernd Perscheid Trier University Strategies for Maximum Clique Algorithms on Graphs with Special Structures
6 Dennis Kreber Trier University Bounds for the subset selection regression
7 Yida Zhu Trier University Stochastic scheduling with interval-constraint
8 Stefan Krupp University of Cologne Symplectic capacities of polytopes
9 Sarah Schönbrodt RWTH Aachen A new model for a centralized matching process in children's daycare planning
10 Lida Kouhalvandi Istanbul Technical University Area Optimization for Efficient Logic Synthesis Used In Combinational Circuits
11 Michael Reißner TU Chemnitz Online Discount Problems based on loyalty Cards with stamps
12 Julia Resch University of Graz Single machine scheduling with bounded job rearrangements
13 Stefan Zillmann University of Duisburg-Essen Stochastic programming in security constrained optimal power flow
14 Eva Schmidt TU Kaiserslautern Robust Multicovers with Varying Uncertainty Sets
15 Sebastian Johann TU Kaiserslautern Simultaneous Dominating Set for Spanning Tree Factorings
16 Manuel Streicher TU Kaiserslautern Decomposition of Partially Colored Graphs
17 Till Heller Fraunhofer ITWM Kaiserslautern A combinatorial exchange model for the future electricity market
18 Christine Dahn TU Dortmund A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs and possible extensions
19 Stephan Beyer Osnabrück University A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
20 Maryam Alipour Hochschule Mittweida A Recursion for Neighborhood Polynomials and Its Applications
21 Robin Schrecklinger Trier University A MINLP approach to linear regression
22 Tobias Kreiter University of Graz A Real-World Vector Packing Variant