Erik Demaine's List of Events

Disclaimer Turn on help bubbles

Calendar for    
Search for keywords in sorted by    
           Note: Searching for nothing will return all events, sorted as you like.
Filter for events with dates no earlier than days, months, and years in the past.
Filter for events with dates no later than days, months, and years in the future.
Subfilter: include entries that match filters, not whole events.
Generate iCalendar

APPROX 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998

APPROX 2010: 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 18, 2010
When: September 1–3, 2010
Where: UPC, Barcelona, Spain
Accept: June 12, 2010
Final: June 23, 2010
URL: http://cui.unige.ch/tcs/random-approx/ [Wayback]
Topic: algorithms
Sibling: RANDOM 2010
PC: Chandra Chekuri (University of Illinois, Urbana-Champaign), Uriel Feige (The Weizmann Institute), Pierre Fraigniaud (CNRS and University Paris Diderot), Magnus M. Halldorsson (Reykjavik University), Christos Kaklamanis (Patras University), Anna Karlin (University of Washington), Samir Khuller (University of Maryland), Guy Kortsarz (Rutgers at Camden), Monaldo Mastrolilli (IDSIA Lugano), Claire Mathieu (Brown University), Zeev Nutov (The Open University of Israel), Giuseppe Persiano (University of Salerno), Maria Serna (chair; UPC Barcelona), Martin Skutella (TU Berlin), Maxim Sviridenko (IBM T.J. Watson Research Center), David P. Williamson (Cornell University)

APPROX 2009: 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 12, 2009 (5:00pm PDT)
When: August 21–23, 2009
Where: HP Auditorium, UC Berkeley, Berkeley, California, USA
Accept: June 1, 2009
Final: June 15, 2009
URL: http://cui.unige.ch/tcs/random-approx/2009/ [Wayback]
Topic: algorithms
Sibling: RANDOM 2009

APPROX 2008: 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 7, 2008
When: August 25–27, 2008
Where: MIT, Cambridge, Massachusetts, USA
Accept: May 23, 2008
Final: June 15, 2008
Register: July 31, 2008 (early)
URL: http://cui.unige.ch/tcs/random-approx/2008/index.php [Wayback]
Topic: algorithms
Sibling: RANDOM 2008
PC: Matthew Andrews, Timothy Chan, Julia Chuzhoy, Uriel Feige, Ashish Goel (chair), Elad Hazan, Stefano Leonardi, Aranyak Mehta, Vahab Mirrokni, Kamesh Munagala, Adi Rosen, David Shmoys, Adrian Vetta, Jan Vondrak, David Williamson

APPROX 2007: 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 7, 2007 (17:00 PDT)
When: August 20–22, 2007
Where: Princeton University, Princeton, New Jersey, USA
Accept: May 27, 2007
Final: June 10, 2007
URL: http://cui.unige.ch/tcs/random-approx/ [Wayback]; http://www.easychair.org/APPROX2007/ [Wayback]
Topic: algorithms
Sibling: RANDOM 2007
PC: Nikhil Bansal, Moses Charikar (chair), Chandra Chekuri, Julia Chuzhoy, Venkatesan Guruswami, Howard Karloff, Guy Kortsarz, Robert Krauthgamer, Claire Mathieu, Seffi Naor, Chaitanya Swamy, Lisa Zhang
Plenary: Sanjeev Khanna, Rocco Servedio, Charles Fefferman

APPROX 2006: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 18, 2006 (5pm PDT)
When: August 28–31, 2006
Where: Universitat Politècnica de Catalunya, Barcelona, Spain
Accept: May 31, 2006
Final: June 15, 2006
URL: http://cui.unige.ch/tcs/random-approx/2006/ [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4110 [Wayback]
Topic: algorithms
Sibling: RANDOM 2006
PC: Jittat Fakcharoenphol, Uriel Feige, Anupam Gupta, Magnús M. Halldórsson, Johan Håstad, Amit Kumar, James R. Lee, Mohammad Mahdian, Jiří Sgall, Vijay Vazirani, Gerhard Woeginger, Uri Zwick (chair)
Plenary: Nick Wormald, Johan Håstad
Paper
count:
56 submitted (100.0%)
22 accepted (39.3%)

APPROX 2005: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 14, 2005 (5pm PDT)
When: August 22–24, 2005
Where: Soda Hall, University of California, Berkeley, USA
Accept: May 26, 2005
Final: June 15, 2005
URL: http://cui.unige.ch/tcs/random-approx/2005/ [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3624 [Wayback]
Topic: algorithms
Sibling: RANDOM 2005
PC: Matthew Andrews, Avrim Blum, Moses Charikar, Chandra Chekuri (chair), Julia Chuzhoy, Uriel Feige, Naveen Garg, Howard Karloff, Stavros Kolliopoulos, Adam Meyerson, Seffi Naor, Santosh Vempala
Paper
count:
50 submitted (100.0%)
20 accepted (40.0%)

APPROX 2004: 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 12, 2004 (5:00pm PDT)
When: August 22–24, 2004
Where: Harvard University, Cambridge, Massachusetts, USA
Accept: May 26, 2004
Final: June 15, 2004
URL: http://cui.unige.ch/tcs/random-approx/ [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=3122 [Wayback]
Topic: algorithms
Sibling: RANDOM 2004
PC: Chandra Chekuri, Lisa Fleischer, Sudipto Guha, Sanjeev Khanna (chair), Rajmohan Rajaraman, Tim Roughgarden, Baruch Schieber, Martin Skutella, Dan Spielman, Luca Trevisan, Mihalis Yannakakis, Neal Young
Plenary: Madhu Sudan, Vijay Vazirani
Paper
count:
54 submitted (100.0%)
19 accepted (35.2%)

APPROX 2003: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 14, 2003 (11:59pm PDT)
When: August 24–26, 2003
Where: Princeton University, Princeton, New Jersey, USA
Accept: May 28, 2003
Final: June 17, 2003
URL: http://www.cs.princeton.edu/random-approx/ [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2764 [Wayback]
Topic: algorithms
Sibling: RANDOM 2003
PC: Sanjeev Arora (chair), Yossi Azar, Gruia Calinescu, Chandra Chekuri, Anupam Gupta, George Karakostas, Philip Klein, Robert Krauthgamer, Kamal Jain, Stefano Leonardi, Yuri Rabinovich, David Williamson
Paper
count:
40 submitted (100.0%)
16 accepted (40.0%)

APPROX 2002: 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: May 20, 2002 (11:59pm PDT)
When: September 17–21, 2002
Where: Universitá di Roma "La Sapienza", Rome, Italy
Accept: June 20, 2002
Final: July 8, 2002
URL: http://www.dis.uniroma1.it/~algo02/approx02/ [Wayback]; http://sigact.acm.org/~approx02/APPROX2002.html [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2462 [Wayback]
Topic: algorithms
Parent: ALGO 2002
Siblings: ARACNE 2002, ESA 2002, WABI 2002
PC: Giorgio Ausiello, Josep Diaz, Ashish Goel, Ravi Kannan, Sanjeev Khanna, Elias Koutsoupias, Ion Mandoiu, Kurt Mehlhorn, Yuval Rabani, Eva Tardos, Vijay Vazirani (chair), Gerhard Woeginger, Alexander Zelikovsky
Plenary: Yuval Rabani, R. Ravi
Paper
count:
54 submitted (100.0%)
20 accepted (37.0%)

APPROX 2001: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 2, 2001
When: August 18–20, 2001
Where: Berkeley, California, USA
Accept: May 23, 2001
Final: June 11, 2001
URL: http://cui.unige.ch/tcs/random-approx [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2129 [Wayback]
Topic: algorithms
Sibling: RANDOM 2001
PC: Michel Goemans (chair), Moses Charikar, Uriel Feige, Naveen Garg, Dorit Hochbaum, Howard Karloff, Claire Kenyon, Seffi Naor, Ramamoorthi Ravi, Baruch Schieber, Santosh Vempala
Plenary: Michel Goemans, Russell Impagliazzo, Anna Karlin, Luca Trevisan, Salil Vadhan
Paper
count:
34 submitted (100.0%)
14 accepted (41.2%)

APPROX 2000: 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 3, 2000
When: September 6–8, 2000
Where: Saarbruecken, Germany
Accept: May 29, 2000
Final: June 29, 2000
URL: http://www.mpi-sb.mpg.de/~conf2000/approx2000/ [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1913 [Wayback]
Topic: algorithms
Tag: attended
Parent: ALGO 2000
Siblings: ESA 2000, WAE 2000
PC: Klaus Jansen, Tao Jiang, Sanjeev Khanna, Samir Khuller, Jon Kleinberg, Stefano Leonardi, Rajeev Motwani, Baruch Schieber, Martin Skutella, Eva Tardos, Gerhard Woeginger, Neal Young
Plenary: Sanjeev Arora, Dorit S. Hochbaum, Rolf H. Möhring, David B. Shmoys
Paper
count:
68 submitted (100.0%)
23 accepted (33.8%)

APPROX 1999: 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

Due: April 2, 1999
When: August 8–11, 1999
Where: Berkeley, California, USA
URL: http://cuiwww.unige.ch/~approx-random [Wayback]; http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1671 [Wayback]
Topic: algorithms
Sibling: RANDOM 1999
PC: Dorit Hochbaum, Sanjeev Arora, Leslie Hall, Samir Khuller, Phil Klein, Kurt Mehlhorn, Joe Mitchell, Seffi Naor, David Peleg, Vijay Vazirani, David Williamson, Gerhard Woeginger
Plenary: Uri Feige, Christos Papadimitriou, Madhu Sudan, Avi Wigderson
Paper
count:
44 RANDOM+APPROX submitted (100.0%) (100.0% relative)
24 RANDOM+APPROX accepted (54.5%) (54.5% relative)

APPROX 1998: International Workshop on Approximation Algorithms for Combinatorial Optimization

When: July 18–19, 1998
Where: Aalborg, Denmark
URL: http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1444 [Wayback]
Topic: algorithms
PC: Ed Coffman, Pierluigi Crescenzi, Ulrich Faigle, Michel X. Goemans, Peter Gritzmann, Magnús M. Halldórsson, Johan Håstad, Klaus Jansen (cochair), Claire Kenyon, Andrzej Lingas, George Lueker, Ernst W. Mayr, Jose D. P. Rolim (cochair), Andreas Schulz, David B. Shmoys, Jan van Leeuwen
Plenary: Magnús M. Halldórsson, David B. Shmoys, Vijay V. Vazirani
Paper
count:
37 submitted (100.0%)
14 accepted (37.8%)