Program Committee


Andreas Wiese
Fabrizio Grandoni
Parinya Chalermsook
Harald Raecke
Chaitanya Swamy
Nicole Megow
Amit Kumar
Lap Chi Lau
Roy Schwarz
Rene Sitters
David Steurer
Sungjin Im
Michael Dinitz
Rishi Saket
Piotr Sankowski
Naveen Garg


Alex Andoni
Aleksander Madry
Anindya De
David Woodruff
Dimitris Achlioptas
Madur Tulsiani
Mohit Singh
Nick Harvey
Raghu Meka
Xin Li
Eric Price
Mary Wootters
Aaron Roth
Hu Fu
Ken Clarkson
Ali Sinop

Program Chairs

Naveen Garg,
IIT Delhi

Anup Rao,
University of Washington

Workshop Chairs

José Rolim,
U. of Geneva
Klaus Jansen,
U. of Kiel
Important dates
Submission deadline
April 17, 2015

Notification to authors
June 8, 2015

Camera ready
June 24, 2015

August 24-26, 2015
Call for papers


Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers:
Click here

For submission of RANDOM papers:
Click here

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).
The submission must be received by 17:00pm (PDT) of April 17 for your submission to be considered.

Submission Format: Submissions should start with the title of the paper, each author`s name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee.


Accepted papers will be published in the online proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work. Further detail will be available early January at the conference website.


Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:

  • design and analysis of approximation algorithms
  • hardness of approximation
  • small space, sub-linear time and streaming algorithms
  • embeddings and metric space methods
  • mathematical programming methods
  • combinatorial problems in graphs and networks
  • algorithmic game theory and economics
  • computational geometric problems
  • approximate learning
  • online algorithms
  • approaches that go beyond worst case analysis
  • other applications
  • design and analysis of randomized algorithms
  • randomized complexity theory
  • pseudorandomness and derandomization
  • random combinatorial structures
  • random walks/Markov chains
  • expander graphs and randomness extractors
  • probabilistic proof systems
  • random projections and embeddings
  • error-correcting codes
  • average-case analysis
  • property testing
  • computational learning theory

Valid XHTML 1.0 Transitional Valid CSS!

Created by Marios Karagiannis - Maintained by Orestis Evangelatos