Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, February 13, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Miloš Stojaković (Univ. u Novom Sadu)
For an Avoider-Enforcer positional game H played on the set of edges on the
complete graph, let t(H) be the smallest integer such that Enforcer can win the
game within t(H) moves (if the game is Avoider's win, we set t(H) to be
infinity). We will study this parameter for the non-planarity game, and perhaps
some other games as well...
The talk will be some sort of continuation of the talk of Dan Hefetz (February
8th), but it will be self contained.
Joint work with Dan Hefetz, Michael Krivelevich and Tibor Szabó.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login