Wolfgang Slany

Available identifiers

Publication	Date of Publication	Type
On network design problems: fixed cost flows and the covering steiner problem	2015-09-02	Paper
Algorithms - ESA 2003	2010-03-03	Paper
On the Computational Complexity of the Forcing Chromatic Number	2008-03-28	Paper
The minimum shift design problem	2008-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q5436691	2008-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q3433898	2007-04-23	Paper
STACS 2005	2005-12-02	Paper
On the lengths of symmetry breaking-preserving games on graphs	2004-10-27	Paper
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem	2004-08-12	Paper
Local search for shift design.	2004-01-05	Paper
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.	2003-01-21	Paper
Graph Ramsey games	2002-12-12	Paper
A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning	2002-07-29	Paper
Efficient generation of rotating workforce schedules	2002-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4407715	2002-01-01	Paper
Rota: A research project on algorithms for workforce scheduling and shift design optimization	2001-11-08	Paper
Comparison of iterative improvement techniques for schedule optimization	1999-04-22	Paper
Approximate reasoning in scheduling	1998-01-01	Paper

This page was built for person: Wolfgang Slany