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/2025/newsitem/15159/4-
 --7-March-2025-42nd-International-Symposium-on-The
 oretical-Aspects-of-Computer-Science-STACS-25-Jena
 -Germany
DTSTAMP:20240924T234522
SUMMARY:42nd International Symposium on Theoretica
 l Aspects of Computer Science (STACS'25), Jena, Ge
 rmany
DTSTART;VALUE=DATE:20250304
DTEND;VALUE=DATE:20250307
LOCATION:Jena, Germany
DESCRIPTION:STACS 2025 will consist of two tracks,
  A and B. Track A focuses on algorithms, data stru
 ctures and complexity, while track B focuses on au
 tomata, logic, semantics, and theory of programmin
 g.  The conference includes talks by invited speak
 ers Daniel Dadush (CWI Amsterdam), Anupam Das (Uni
 versity of Birmingham) and Susanna F. de Rezende (
 Lund University), and a tutorial by Albert Atseria
 s (UPC Barcelona) on "Proof complexity and its rel
 ations to SAT solving".  Authors are invited to su
 bmit papers presenting original and unpublished re
 search on theoretical aspects of computer science.
   Submissions should be made through EasyChair. Au
 thors are invited to submit an extended abstract o
 r a full paper with at most 15 pages; this page li
 mit excludes the title page, the references sect i
 on, and a possible appendix. In preparation of sub
 missions, the usage of the LIPIcs style file is ma
 ndatory; no changes to font size, page geometry, e
 tc. are permitted. Submissions should be made to a
 ppropriate tracks. Simultaneous submission to othe
 r conferences with published proceedings or to jou
 rnals is not allowed.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>STACS 202
 5 will consist of two tracks, A and B. Track A foc
 uses on algorithms, data structures and complexity
 , while track B focuses on automata, logic, semant
 ics, and theory of programming.</p>\n  <p>The conf
 erence includes talks by invited speakers Daniel D
 adush (CWI Amsterdam), Anupam Das (University of B
 irmingham) and Susanna F. de Rezende (Lund Univers
 ity), and a tutorial by Albert Atserias (UPC Barce
 lona) on &quot;Proof complexity and its relations 
 to SAT solving&quot;.</p>\n</div><div>\n  <p>Autho
 rs are invited to submit papers presenting origina
 l and unpublished research on theoretical aspects 
 of computer science.</p>\n  <p>Submissions should 
 be made through EasyChair. Authors are invited to 
 submit an extended abstract or a full paper with a
 t most 15 pages; this page limit excludes the titl
 e page, the references sect ion, and a possible ap
 pendix. In preparation of submissions, the usage o
 f the LIPIcs style file is mandatory; no changes t
 o font size, page geometry, etc. are permitted. Su
 bmissions should be made to appropriate tracks. Si
 multaneous submission to other conferences with pu
 blished proceedings or to journals is not allowed.
 </p>\n</div>
URL:https://www.stacs2025.de/
END:VEVENT
END:VCALENDAR