Monday, February 2, 2015

from Stefan Kraft: RANDOM 2015, APPROX 2015

RANDOM 2015 The 19th International Workshop on
Randomization and Computation
APPROX 2015 The 18th International Workshop on
Approximation Algorithms for
Combinatorial Optimization Problems

Aug. 24-26, 2015
Princeton University, New Jersey

CFP - Call for papers
The 19th International Workshop on Randomization and Computation
(RANDOM 2015)
The 18th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX 2015)
will be held on August 24 – 26 , 2015 at Princeton University, New
RANDOM 2015 focuses on applications of randomness to computational
and combinatorial problems while APPROX 2015 focuses on algorithmic
and complexity theoretic issues relevant to the development of
efficient approximate solutions to computationally difficult problems.

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

- 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

- 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
- and other applications

Submissions: April 17, 2015
Notifications: June 8, 2015
Camera ready: June 24, 2015

Abstract Format: Electronic submissions are solicited. Please
consult the following servers:
For submission of APPROX papers:
For submission of RANDOM papers:

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. Simultaneous submission to other conferences with
published proceedings is not allowed.

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. Previous proceedings of APPROX
appeared as LNCS 1444, 1671, 1913, 2129, 2462, 2764, 3122, 3624,
4110 and 4627 while previous proceedings of RANDOM appeared as LNCS
1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627 and as
Proceedings in Informatics 8.

Anup Rao - University of Washington

Naveen Garg - IIT, Delhi

José Rolim - University of Geneva
Klaus Jansen - University of Kiel


Dimitris Achlioptas UC Santa Cruz
Alex Andoni Simons Institute for Theoretical Computer Science
Ken Clarkson IBM
Anindya De Institute for Advanced Study
Hu Fu Microsoft Research, New England
Nick Harvey UBC
Xin Li John Hopkins U
Aleksander Madry EPFL
Raghu Meka UCLA
Eric Price University of Texas
Aaron Roth UPENN
Mohit Singh Microsoft Research, Redmond
Ali Sinop Simons Institute for Theoretical Computer Science
Madhur Tulsiani TTI Chicago
David Woodruff IBM
Mary Wootters CMU

Parinya Chalermsook MPII Saarbruecken
Michael Dinitz Johns Hopkins U.
Naveen Garg IIT Delhi
Fabrizio Grandoni IDSIA, U. of Lugano
Sungjin Im UC Merced
Amit Kumar IIT Delhi
Lap Chi Lau Chinese U. of Hong Kong
Nicole Megow TU Berlin
Harald Raecke TU Munich
Rishi Saket IBM IRL
Piotr Sankowski U. of Warsaw
Roy Schwartz Princeton
Rene Sitters VU Amsterdam
David Steurer Cornell
Chaitanya Swamy U. of Waterloo
Andreas Wiese MPII Saarbruecken