April 19-21, 2012
Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012
Athens University of Economics and Business,
Athens, Greece
http://isco12.cs.aueb.gr/
isco12@cs.aueb.gr
ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.
Spring School
ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.
Invited Speakers
Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna
Important Dates
Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012
Submission - Publications
The submission deadline is Thursday December 1, 2011.
Paper submission will be handled only via Easychair:
https://www.easychair.org/conferences/?conf=isco2012
Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms
There will be two types of submissions:
a) Regular papers
They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Simultaneous submission to other conferences with published proceedings or
journals is not allowed.
Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors. The authors will have to prepare their
camera-ready version two weeks after the end of ISCO 2012.
b) Short papers
They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings.
Special issues
Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.
Program Committee
Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens
Organizing Committee
Christos Amanatidis, AUEB,
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens
________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105
Posts
