|
A workshop dedicated to maximum-clique and
closely related graph problems.
Max-Clique '01 Schedule
Thursday,
May 31
| 18:00 - 20:00 |
Registration and Welcome Reception at the University |
|
Friday, June
1st
| 09:50 - 10:00 |
Opening Session |
Franz Rendl |
Morning Session. Chair: Christoph Helmberg
| 10:00 - 10:40 |
Sergey Butenko |
|
|
Title:
|
Approximate and exact algorithms for the maximum independent set problem |
|
|
abstract
available |
| 10:45 - 11:25 |
Jean-marie Bourjolly |
|
|
Title:
|
An Exact Algorithm for the Maximum k-Club problem |
|
|
abstract
available |
| 11:30 - 12:10 |
Domingos Cardoso |
|
|
Title:
|
Extensions of the Motzkin-Straus Result on the Stability Number of
Graphs |
|
|
abstract
available |
Lunch break
Early afternoon session. Chair: Gerhard Reinelt
| 14:00 - 14:40 |
Alexander Strekalovsky |
|
|
Title:
|
One Approach to the Maximum Clique Problem |
|
|
abstract
available |
| 14:45 - 15:25 |
Massimiliano Pavan |
|
|
Title:
|
Standard Quadratic Programming and Edge-Weighted Maximal Cliques |
|
|
abstract
available |
Coffee break
Late afternoon session. Chair: Caterina De Simone
| 16:00 - 16:40 |
Gerald Gruber |
|
|
Title:
|
Solving the stable set problem using bundle methods |
|
|
abstract not available |
| 16:45 - 17:25 |
Marcello Pelillo |
|
|
Title:
|
Matching Free Trees, Maximal Cliques, and Game Dynamics |
|
|
abstract
available |
| 17:30 - 18:10 |
Philippe Meurdesoif |
|
|
Title:
|
The Lovasz bound and some quadratizations in Graph Coloring |
|
|
abstract
available |
Saturday,
June 2nd
Morning session, Chair: Etienne De Klerk
| 10:00 - 10:40 |
Caterina De Simone |
|
|
Title:
|
On the chromatic polynomial of a graph |
|
|
abstract
available |
| 10:45 - 11:25 |
Marcello Pelillo |
|
|
Title:
|
Annealed Imitation: A New Class of Heuristics for Maximum Clique |
|
|
abstract
available |
| 11:30 - 12:10 |
Christoph Helmberg |
|
|
Title:
|
Computing Semidefinite Bounds for Max-Clique |
|
|
abstract
available |
Lunch break
Early afternoon session. Chair: Marcello Pelillo
| 14:00 - 14:40 |
Etienne de Klerk |
|
|
Title:
|
Approximating the stability number of a graph via semidefinite and
copositive programming |
|
|
abstract
available |
| 14:45 - 15:25 |
Volker Stix |
|
|
Title:
|
Approximation of the MCP with target oriented branch & bound |
|
|
abstract
available |
| 15:30 - 16:10 |
Immanuel Bomze |
|
|
Title:
|
Fine-tuning stochastic models for acceleration of algorithms and towards
generating hard test instances |
|
|
abstract
available |
|
|
