I moved to Technical University of Graz.
Please find my new homepage at http://www.ist.tugraz.at/staff/slany/.

My old page follows below.

Tel: +43-1-58801-18424   FAX: +43-1-58801-18492
E-Mail: wsi@dbai.tuwien.ac.at
(I use anti-spam software: if you suspect that your mail
gets incorrectly filtered out, please notify me by some other means)

URL: http://www.dbai.tuwien.ac.at/staff/slany/

Alternate E-Mail:
Alternate URL: http://slany.org/wolfgang/

OpenPGP public key (GnuPG, PGP 5.x and up)

Office hour: by appointment
Room: 3rd floor, HC0309

• research and projects
• Research interests: Practical and Theoretical Aspects of Scheduling; Complexity Theory; Graph Ramsey Games; Web-based Information Systems and Tools; Natural Language Engineering
• Rota: A tool for the generation of workforce schedules.
• StarFLIP++: a reusable iterative optimization library for combinatorial problems with fuzzy constraints
• Hexi: Ramsey theory illustrated through a java based graph Ramsey avoidance game that plays heuristically and can learn in a client-server style, or plays optimally if possible
• pf2html: A LaTeX2HTML extension for Leslie Lamport's pf.sty style allowing hypertext style proofs.
• Special Issue on Approximate Reasoning in Scheduling in the International Journal for Approximate Reasoning
• Journal of Scheduling
• Publications
• Teaching
• 181.142 VU Komplexitätstheorie SS 2003 2,0
• Subjects of past seminars and proseminars
• Tips and tricks for students
• Subjects for Informatikpraktikum I, Informatikpraktikum II, Diplomarbeit, and Dissertations
• Biographical and family aspects

Research and projects

• Research interests: computational complexity, combinatorial optimization, combinatorics, probabilistically checkable proofs, approximation algorithms, SAT/UNSAT/MAXSAT problems, scheduling, computer assisted theorem proving, Ramsey theory, discrete mathematics, Kolmogorov complexity, ...
• Rota: A tool for the generation of workforce schedules.
• Hexi: Ramsey theory illustrated through a java based graph Ramsey game that plays heuristically and can learn in a client-server style or optimally if possible.
• StarFLIP++: a reusable iterative optimization library for combinatorial problems with fuzzy constraints
• pf2html: A LaTeX2HTML extension for Leslie Lamport's pf.sty style allowing hypertext style proofs.
• Special Issue on Approximate Reasoning in Scheduling in the International Journal for Approximate Reasoning
• As a member of the Editorial Board and Associate Editor I want to advertise the Journal of Scheduling.
• Students interested in participation can find available subjects below and are kindly invited to contact me.
• Publications: please take a look at http://www.dbai.tuwien.ac.at/staff/slany/pubs/pubs.pdf.

Teaching

• 181.142 VU Komplexitätstheorie SS 2003 2,0
• Some teaching material for students can be found at http://www.dbai.tuwien.ac.at/staff/slany/teaching-material/.
• Informatikpraktikum I, Informatikpraktikum II, Wahlfachpraktikum, Diplomarbeit, usw.:

  Check research and projects described above to get an idea of projects available. Find below a list of possible subjects. Available subjects cover, among others, Ruby, Perl, PHP, JAVA, issues in theoretical computer science, the WWW, security, fuzzy logic, constraints, computational complexity, OO-design in C++, UI-design, AI (KBS), scheduling, English, linguistics, and scientific organization tools. Please get in contact with me for details.

  • Combinatorial Optimization: Problems in combinatorial optimization, for instance scheduling, planning, but also more theoretical subjects such as combinatorial optimization problems in graph theory.
  • Solutions to Computational Complexity: web-based rigorous proofs (based on the article "How to write a proof" by Leslie Lamport) for the exercises given in the book "Computational Complexity" by Ch. H. Papadimitriou, Addison-Wesley 1994. Work can be focused on Perl/LaTeX/HTML programming or on the writing of visual proofs. For samples see the pf2html project page.
  • Ramsey Theory and Games: Ramsey-Theory, both from the point of view of actual games (see http://www.dbai.tuwien.ac.at/proj/ramsey/, which should be enhanced by some theoretically interesting protocols and properties, and extended for other Ramsey-numbers) and their complexity, as well as the computation of actual small Ramsey-numbers using automated reasoning and theorem proving tools and ideas.
  • Japanese Language Engineering: If you are interested in Japanese language and Java, there are many interesting subjects available. Some of the students who participated later got a scholarship to Japan (including myself).
  • Other subjects: meet or call me to find out what other subjects are available.

  Please get in contact with me for further details.

A short biographical note and some family links

Wolfgang SLANY earned the equivalent of a master's degree (Diplom-Ingenieur) at Technische Universität Wien, Austria, in 1989. He was a guest researcher at Tokyo University in Japan from 1989-1991. In 1994 he defended his PhD (Dr.techn.) and in 2001 his Habilitation (Univ.Doz.) at Technische Universität Wien. He won the 1996 Heinz Zemanek award from the Austrian Computer Society. He has actively participated in industrial projects, has served as senior researcher at the Christian Doppler Laboratory for Expert Systems and has done consulting and teaching. He was co-organizer and program-chairperson of international conferences and workshops, and is member of AAAI, ACM, EATCS (European Association for Theoretical Computer Science), eCE (Austrian Computer Professionals for Social Responsibility), IEEE Computer, OCG (Austrian Computer Society), ÖGAI (Austrian Society for Artificial Intelligence), and NIPPON-ÖJG (Austro-Japanese Society). He holds the position of an associate professor at the Institut für Informationssysteme, Abteilung für Datenbanken und Artificial Intelligence, Technische Universität Wien. He was guest professor of software technology at Graz University of Technology in 2002/2003.