Brno, Czech Republic, 21-22 August 2010,
a satellite workshop to MFCS & CSL 2010.
The purpose of this workshop is to bring together researchers interested in the algorithmic aspects of graph crossing number problems. During the last ten years or so, we have witnessed a growing interest in complexity and algorithmic issues around crossing numbers. On the complexity front, we have Grohe’s surprising result that CrossingNumber is fixed parameter tractable, followed up by the recent refinement by Kawarabayashi and Reed. On the more applied side, we have the algorithms implemented by Petra Mutzel and her research team that compute the exact crossing number of relatively large graphs. Then there is a recent series of specialized constant-factor approximation algorithms for the crossing number by Hlineny, Salazar, and Chimani. Yet another really surprising, exciting result is Cabello and Mohar’s proof that CrossingNumber is still NP-hard for nearly-planar graphs (that is, graphs with an edge whose removal leaves a planar graph).
We see this workshop as an opportunity to reflect on these developments, with an emphasis on the interplay between the theoretical and the algorithmical aspects of graph crossing numbers.
Invited speakersSergio Cabello, University of Ljubljana
Daniel Štefankovič, University of Rochester
If you intend to contribute a talk, we strongly encourage you to help us with the organization and email a tentative title to Gelasio Salazar at his address gsalazar AT ifisica DOT uaslp DOT mx . The abstracts of workshop talks will be published as part of the MFCS - CSL conference proceedings. Due dates will be aligned with the conference due dates, so by emailing your intentions you will make sure to be notified about them.
Important datesImportant dates follow the MFCS 2010 deadlines. In addition, camera ready 1-page abstracts of your talks have to be submitted by August 8th.
AccomodationWe refer you to the page http://mfcsl2010.fi.muni.cz/accommodation Please note that the deadline for the discounted accomodation rate is June 15.
All talks will be in the building of the Faculty of Informatics, University of Brno, Botanická 68a. See map.
Workshop dinnerSo that the workshop dinner runs smoother, we are requested to select menus beforehand. All the participants joining us for dinner are kindly requested to register their wishes on a web form. If you do not manage to respond on the form by August 17, 2010, you are still very welcome to the dinner, but your food selection may be limited to the default choice of "Pizza, great variety (and good)."
Registration to TAAGCN 2010 is through the MFCS & CSL site. Participants are encouraged to register both for our workshop and for the conference.
TAAGCN 2010 Organizing Committee
Created by: b:0; last modification: Friday 30 of July, 2010 [07:04:06 UTC] by b:0;