BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2013/newsitem/4465/27-
 February---2-Mar-2013-30th-International-Symposium
 -on-Theoretical-Aspects-of-Computer-Science-STACS-
 2013-Kiel-Germany
DTSTAMP:20120507T000000
SUMMARY:30th International Symposium on Theoretica
 l Aspects of Computer Science (STACS 2013), Kiel, 
 Germany
DTSTART;VALUE=DATE:20130227
DTEND;VALUE=DATE:20130302
LOCATION:Kiel, Germany
DESCRIPTION:The 30th Symposium on Theoretical Aspe
 cts of Computer Science will be held in Kiel, Feb 
 27-Mar 2, 2013 (Wednesday through Saturday). As us
 ual, the program will be composed of approximately
  50-60 contributed and three invited talks, by Kou
 sha Etessami, Kurth Mehlhorn, and Stéphan Thomassé
 . As this year's pre-conference tutorial on 'Itera
 tive Methods in Combinatorial Optimization' by R. 
 Ravi was a great success, STACS 2013 will also inc
 lude a tutorial, by Dániel Marx on algorithmic gra
 ph structure theory.   For more information, see h
 ttp://www.stacs2013.uni-kiel.de or cotnact info at
  stacs2013.uni-kiel.de (for general information) o
 r pc-chairs at stacs2013.uni-kiel.de (for informat
 ion regarding paper submission).   Authors are inv
 ited to submit papers presenting original and unpu
 blished research on theoretical aspects of compute
 r science. Submission Deadline: Sep 21, 2012
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>The 3
 0th Symposium on Theoretical Aspects of Computer S
 cience will be held in Kiel, Feb 27-Mar 2, 2013 (W
 ednesday through Saturday). As usual, the program 
 will be composed of approximately 50-60 contribute
 d and three invited talks, by Kousha Etessami, Kur
 th Mehlhorn, and St&eacute;phan Thomass&eacute;. A
 s this year's pre-conference tutorial on 'Iterativ
 e Methods in Combinatorial Optimization' by R. Rav
 i was a great success, STACS 2013 will also includ
 e a tutorial, by D&aacute;niel Marx on algorithmic
  graph structure theory.\n      </p>\n    \n      
 \n      <p>For more information, see\n        <a t
 arget="_blank" href="http://www.stacs2013.uni-kiel
 .de">http://www.stacs2013.uni-kiel.de</a>\n       
  or cotnact \n        <a class="email">info <span 
 class="at">at</span> stacs2013.uni-kiel.de</a> (fo
 r general information)\n        or <a class="email
 ">pc-chairs <span class="at">at</span> stacs2013.u
 ni-kiel.de</a> (for information regarding paper su
 bmission).\n      </p>\n    </div><div>\n      <p>
 Authors are invited to submit papers presenting or
 iginal and\n        unpublished research on theore
 tical aspects of computer\n        science. Submis
 sion Deadline: Sep 21, 2012\n      </p>\n      </d
 iv>
URL:/NewsandEvents/Archives/2013/newsitem/4465/27-
 February---2-Mar-2013-30th-International-Symposium
 -on-Theoretical-Aspects-of-Computer-Science-STACS-
 2013-Kiel-Germany
END:VEVENT
END:VCALENDAR