[DMANET] Second CFP -- APEX 2012

APEX 2012

International Workshop on Approximation, Parameterized and EXact algorithms

February 28, 2012, Paris, France

http://apex.lip6.fr

CALL FOR PAPERS

Scope

The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French National Agency for Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project. It aims to
bring together researchers working on the design and analysis of
algorithms (exact, moderately exponential, approximation and low
memory,...) for combinatorial optimization problems.

APEX is co-located with STACS 2012 in Paris.

Topics

Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:

- exact and parameterized algorithms
- approximation and online algorithms
- massive data computation
- low memory and streaming algorithms
- analysis and experimental evaluation of algorithms

Submission guidelines

Abstracts of 2-3 pages must be submitted using a pdf format.

APEX submissions undergo a selection process based on a light refereeing
by the PC. APEX will not publish proceedings. Hence, presenting your paper
at APEX will not prevent you from submitting it to journals or to other
conferences. Similarly, it is acceptable to submit a paper that was
presented at an earlier conference. Submissions by PC members are allowed.

Talks will have around 20 minutes.

Papers must be submitted electronically at

https://www.easychair.org/conferences/?conf=apex2012

The submission must be received by 23:59 (GMT) on December 7, 2011.

Important dates

Submissions deadline: December 7, 2011
Notification of authors: December 21, 2011
Conference: February 28, 2012

Invited speakers

Henning Fernau, Universitaet Trier, Germany
Martin Skutella, TU Berlin, Germany

Program committee

- Eric Angel, Universite d'Evry, France
- Evripidis Bampis, Universite Pierre et Marie Curie, France (co-chair)
- Hans L. Bodlaender, Universiteit Utrecht, Netherlands
- Marc Demange, ESSEC Business School, France
- Bruno Escoffier, Universite Paris Dauphine, France
- Michael R. Fellows, Charles Darwin University, Australia
- Klaus Jansen, Christian-Albrechts-Universitaet, Germany
- Christian Laforest, Universite Blaise Pascal, France
- Stefano Leonardi, Universita di Roma "La Sapienza", Italy
- Daniel Marx, Humboldt-Universitaet zu Berlin, Germany
- Vangelis Paschos, Universite Paris Dauphine, France (co-chair)
- Hadas Shachnai, Technion, Israel

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP GECCO 2012

*Please excuse multiple postings

Please consider the call for papers below.
====================================================================
GECCO 2012: Call for Papers

2012 Genetic and Evolutionary Computation Conference (GECCO-2012)
July 7-11, Philadelphia, USA

Largest Conference in the Field of Genetic and Evolutionary Computation
A recombination of the 21st International Conference on Genetic
Algorithms (ICGA) and the
17th Annual Genetic Programming Conference (GP)
====================================================================

The Genetic and Evolutionary Computation Conference (GECCO-2012) will
present the latest high-quality results in the growing field of genetic and
evolutionary computation. Topics include: genetic algorithms, genetic
programming, evolution strategies, evolutionary programming, memetic
algorithms, hyper heuristics, real-world applications, learning classifier
systems and other genetics-based machine learning, evolvable hardware,
artificial life, adaptive behavior, ant colony optimization, swarm
intelligence,
biological applications, evolutionary robotics, coevolution, artificial
immune systems, and more.

Planned Program Tracks

*Ant Colony Optimization and Swarm Intelligence - David Pelta ,
Christine Solnon
*Digital Entertainment Technologies and Arts - Mike Preuss , Alan Dorin
*Evolutionary Combinatorial Optimization and Metaheuristics - Yew-Soon
Ong , Christian Blum
*Evolutionary Multiobjective Optimization - Dario Landa Silva - Frank
Neumann
*Genetic Programming - Tina Yu, Aniko Ekart
*Genetics Based Machine Learning - Wil Browne , Tim Kovacs
*Parallel Evolutionary Systems - Man-Leung Wong , Clara Pizzuti
*Theory - Jon Rowe , Tobias Friedrich
*Artificial Life/Robotics/Evolvable Hardware - Giovanni Squillero,
Nicolas Bredèche
*Biological and Biomedical Applications - Stephen Smith , Alison
Motsinger-Rei
*Estimation of Distribution Algorithms - José Lozano , Martin Pelikan
*Evolution Strategies and Evolutionary Programming - Silja Meyer-Nieberg
, Christian Igel
*Generative and Developmental Systems - Greg Hornby , René Doursat-
*Real World Applications - Steve Gustafson , Gustavo Olague
*Search-Based Software Engineering - Shin Yoo , John Clark
*Self-* Search - Gabriela Ochoa , Gisele Pappa
*Genetic Algorithms - Khaled Rasheed , Daniel Tauritz
*Integrative Genetic and Evolutionary Computation - Jurgen Branke ,
Kalyanmoy Deb

More information can be found at

http://www.sigevo.org/gecco-2012/

Important Dates

*Submission deadline: January 13, 2012
*Notification of paper acceptance: March 13, 2012
*Camera-ready submission: April 09, 2012
*GECCO-2012 Conference: July 07 - 11, 2012

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Deadline extension, December 16: PESARO 2012 || April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

INVITATION:

=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish
original scientific results to PESARO 2012.
The submission deadline is extended to December 16, 2011.
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================

============== PESARO 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

PESARO 2012: The Second International Conference on Performance, Safety and Robustness in Complex Systems and Applications
April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

General page: http://www.iaria.org/conferences2012/PESARO12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPPESARO12.html

- regular papers
- short papers (work in progress)
- posters
- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitPESARO12.html

Submission deadline: December 16, 2011

Sponsored by IARIA, www.iaria.org

Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Please note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards,
implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete
unpublished papers, which are not under review in any other conference or journal in the following, but not limited to,
topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

PESARO 2012 Topics (topics and submission details: see CfP on the site)

Fundamentals
Fundamentals on system safety; Robustness technology and evaluation; Metrics for risk assessment; Performance-oriented
design; Safety-oriented system design; Performance metrics and dependable metrics ; Active and passive safety; Performance
warning delay

Methodologies, techniques and algorithms
Systems modeling; Hazard analysis; System measurement and monitoring; Evaluation of safety data, and mitigation and
prevention strategies; Model verification and validation; Fault-tolerant systems; Simulation, statistical analysis, and
experimental design analysis; Language and runtime systems

Performance
Performance basics; Performance-oriented design; Performance methodology techniques and algorithms for analytic modeling;
System measurement and monitoring; Model verification and validation, simulation, statistical analysis; Experimental
design, and reliability analysis; Performance evaluation of various technologies and systems (mobile devices and wireless
networks, distributed and parallel systems, file and storage systems, power management, database systems, computer
networks and architectures, operating systems, fault-tolerant systems, and language and runtime systems). Performance in
dedicated service systems (Web services, Financial services, Healthcare and pharmaceuticals, Telecommunications services,
Industrial Manufacturing, Education services, Transportation services, Energy and utilities)

Safety in industrial systems
Fundamentals on system safety; Safety of software systems and software engineering; Safety requirements; Safety for
critical systems; Engineering for system robustness and reliability; Control of mission critical systems; Safety-oriented
system design; Human tasks and error models; Hazard analysis; Cost and effectiveness of system safety; Verification and
validation of safety; Safety tools; Evaluation of safety data, and mitigation and prevention strategies; Safety control
and management; System Safety Implementation Guidelines and Standards; Transferring safety knowledge; Metrics for Risk
Assessment; Contingency Planning and Occurrence Reporting; Preparedness Activities; Industry specific safety systems
(Medical devices, Aerospace, Chemical industry, Nuclear power plants, Public health, Biological Safety)

Robustness
Basic concepts and applications; Theory and mechanisms for robustness; Uncertainty and robustness; Statistic robustness;
Computation and optimization of robustness; Robustness estimation and approximation; Robustness correction; Robust
systems; Robustness tests and benchmarking

Applications and services
Mobile Web performance; Multiple data center management; Network latency and impact on performance/robustness; Performance
and robustness of cloud-based solutions; Scalable safe and robust solutions; Mobile devices and wireless networks; Mission
critical systems and applications; Industry specific safety systems (medical devices, aerospace, chemical industry,
nuclear power plants, public health, biological systems)

Committee: http://www.iaria.org/conferences2012/ComPESARO12.html
====================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Groups St Andrews 2013

GROUPS ST ANDREWS 2013

Groups St Andrews 2013 is organised by the University of St Andrews and will take place in St Andrews (Scotland). It will run from Saturday 3rd August (arrival day) to Sunday 11th August 2013 (departure day). The talks will take place from 4th August until 10th August 2013 (inclusive).

Principal Speakers:
Emmanuel Breuillard (Université Paris-Sud 11)
Martin Liebeck (Imperial College, University of London)
Alan Reid (University of Texas)
Karen Vogtmann (Cornell University)

(They will each deliver a short lecture course on a topic of their choice.)

One Hour Speakers:
Inna Capdeboscq (University of Warwick)
Radha Kessar (University of Aberdeen)
Markus Lohrey (Universität Leipzig)
Derek Robinson (University of Illinois at Urbana-Champaign)
Christopher Voll (University of Southampton)

Further details will be posted when available on the conference website: http://www.groupsstandrews.org/2013/index.shtml

In particular, those interested in attending the conference are encouraged to sign up for conference updates on the following page: http://www.groupsstandrews.org/2013/form.shtml

Colin Campbell, Max Neunhoeffer, Martyn Quick, Edmund Robertson & Colva Roney-Dougal
(Organising Committee)

Conference e-mail: gps2013@mcs.st-andrews.ac.uk

The University of St Andrews is a charity registered in Scotland : No SC013532

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

ITCS Registration

ITCS (2012) NEWS!

Dear Theorists:

As you know the third Innovation in Theoretical Computer Science Conference will be held in Cambridge this January:  http://research.microsoft.com/en-us/um/newengland/events/itcs2012/.

 

REGISTRATION IS NOW OPEN and THE PROGRAM IS ONLINE.

 

In addition to the program, there are going to be a few novelties that we would like to point out to you. 

 

1. GRADUATING BITS

In one session of the conference, students graduating this academic year (as well as researchers completing their postdoc this academic year) will be given few minutes to present themselves and their work.

The presentations will be grouped by University, in alphabetic order.

We hope this will give all of us an opportunity to have a synopsis of the great work being done by the "graduating" members of our community.

In order to speak in this special session, please send an email at  silvio.itcs12@gmail.com by DECEMBER 15.

Registration fees will be waived for presenters at Graduating Bits 2012.

 

If you/your students are graduating this year, or you plan to hire this year, we are encourage to attend ITCS 2012!

 

2. COMMUNITY BUILDING

To strengthen our (legendary!) friendship and collaboration, we will treat you to a PLAY BACK show: an improvisational theater where OUR actors will bring to life YOUR stories. 

 

3. CHAIR RANTS

In addition to the chair of each session introducing the speakers and coauthors of the session (who will then introduce themselves and their coauthors), our chairs will provide us with their insights on the papers in their sessions.

 

We look forward to seeing all of you in Cambridge very soon!

 

All the Best

 

Shafi, Silvio, and Yael

[DMANET] 2nd CFP - CEC2012: Special Session on Evolutionary Based Hyper-heuristics and Their Applications

[Apologies if you received multiple copies due to cross-posting]

==========================================================
Special Session on
Evolutionary Based Hyper-heuristics and Their Applications
2012 IEEE Congress on Evolutionary Computation (CEC'2012) at WCCI'2012
June 10-15, 2012, Brisbane, Australia

Paper submission deadline: Dec 19, 2011
http://www.ieee-wcci2012.org/
http://www.cs.nott.ac.uk/~rxq/CEC2012EHyperheurstics.html
==========================================================

Hyper-heuristics have recently attracted an increasing research
attention in a wide range of disciplines including artificial
intelligence, operations research, engineering and computer science.
Researchers in hyper-heuristics aim to design and develop general
solvers for a range of problems rather than concerning dedicated
algorithms for specific problems or problem instances. Due to its
efficiency and generality in providing good enough, fast enough
solutions in solving various problems with less amount of tuning effort,
hyper-heuristics have been applied to a range of domains including
optimization functions, combinatorial optimization, as well as
scheduling, timetabling and planning.

This special session is being organized as an activity of the
Intelligent Systems Applications Technical Committee of the
Computational Intelligence Society at IEEE, and aims to bring together
advanced developments in both research and practice of hyper-heuristics
and widen the existing applications on various problems in education,
industry, engineering, management and business, etc. Topics of interest
include, but are not limited to:

Applications:
- Bin packing
- Combinatorial optimization
- Engineering design
- Resource management
- Hybrid methods for scheduling problems
- Routing
- Scheduling, timetabling, planning
- Other real world problems

Theory:
- Theoretical or empirical analysis of hyper-heuristics
- Cooperative hyper-heuristics
- Multi-objective hyper-heuristics
- Hyper-heuristics in dynamic environments
- Parallel hyper-heuristics
- Benchmark problems and performance metrics in evaluation of -
hyper-heuristic
- Hybrid methods between hyper-heuristics and other computational
intelligence techniques
- Comparative studies of hyper-heuristics and other computational
intelligence techniques

Important dates and details of how to make submissions are available a
the CEC'2012 web site at WCCI'2012 http://www.ieee-wcci2012.org/

Special Session Chairs:
Dr Rong Qu, School of Computer Science, University of Nottingham,
Nottingham, UK; e-mail: rxq@cs.nott.ac.uk
Dr A. Sima Uyar, Istanbul Technical University, Computer Engineering
Department, Istanbul, TURKEY; e-mail: etaner@itu.edu.tr

--
===================================
Dr Rong Qu
School of Computer Science
University of Nottingham
Nottingham, NG8 1BB
tel: ++44 115 8466503
fax: ++44 115 8467877
URL: http://www.cs.nott.ac.uk/~rxq/

Call For Papers:

* Special Issue of Evolutionary Computation in Scheduling, &
* Special Session on Evolutionary Computation in Scheduling
2012 IEEE Congress on Evolutionary Computation (IEEE CEC 2012)
June 10-15, 2012, Brisbane, Australia

* 2013 IEEE Symposium on Computational Intelligence in Scheduling
(CISched'13)
Singapore, 15-19 April, 2013
===================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

ITCS News

ITCS (2012) NEWS!
Dear Theorists:
As you know the third Innovation in Theoretical Computer Science Conference
will be held in Cambridge this January: http://research.microsoft.com/en-
us/um/newengland/events/itcs2012/.

REGISTRATION IS NOW OPEN and THE PROGRAM IS ONLINE.

In addition to the program, there are going to be a few novelties that we
would like to point out to you.

1. GRADUATING BITS
In one session of the conference, students graduating this academic year (as
well as researchers completing their postdoc this academic year) will be
given few minutes to present themselves and their work.
The presentations will be grouped by University, in alphabetic order.
We hope this will give all of us an opportunity to have a synopsis of the
great work being done by the "graduating" members of our community.
In order to speak in this special session, please send an email at
silvio.itcs12@gmail.com by DECEMBER 15.
Registration fees will be waived for presenters at Graduating Bits 2012.

If you/your students are graduating this year, or you plan to hire this
year, we are encourage to attend ITCS 2012!

2. COMMUNITY BUILDING
To strengthen our (legendary!) friendship and collaboration, we will treat
you to a PLAY BACK show: an improvisational theater where OUR actors will
bring to life YOUR stories.

3. CHAIR RANTS
In addition to the chair of each session introducing the speakers and
coauthors of the session (who will then introduce themselves and their
coauthors), our chairs will provide us with their insights on the papers in
their sessions.

We look forward to seeing all of you in Cambridge very soon!

All the Best

Shafi, Silvio, and Yael

[DMANET] CFP CTW 2012

FIRST CALL FOR PAPERS
(Please accept our apologies if you received multiple copies of this
announcement)
************************************************************************
CTW 2012
11th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
UBw Muenchen, Munich, May 29-31, 2012
************************************************************************

The eleventh Cologne-Twente Workshop on Graphs and Combinatorial
Optimization 2012 welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in the wide
sense, discrete and continuous optimization, and Operations Research.

The previous editions were held in
Rome, I (2011), Cologne, D (2010, 2005, 2001), Paris, F (2009),
Gargnano, I (2008), Enschede NL (2007,2003), Lambrecht, D (2006),
Menaggio, I (2004).

Following a well established tradition, the 11th edition of the workhop
aims to disseminate scientific results, especially by young researchers,
in a friendly and interactive atmosphere.

**************************************************************************
Abstract submission:
Authors wishing to submit a contribution, should prepare an extended
abstract of at most 4 pages* by February 29, 2012 following the
guidelines on the conference website.
*************************************************************************

*************************************************************************
Important dates:
*Deadline for abstract submission: February 29, 2012;
*Acceptance notice: April 2, 2012;
*Deadline for early registration: April 23, 2012;
*Conference: May 29-31, 2012.
*************************************************************************

Participants of the workshop will have the opportunity to submit full-length
papers to a special issue of Discrete Applied Mathematics and Central
European
Journal of Operations Research.

Further details will be available soon.

Conference website:
http://www.ctw2012.de

Email:
contact@ctw2012.de

Scientific Comittee:
Ulrich Faigle (U. Cologne), Johann L. Hurink (U. Twente), Renato de
Leone (U. di Came(U. di Camerino, Italy),
Leo Liberti (École Polytechnique, Paris), Bodo Manthey (U. Twente), Gaia
Nicosia (U. Roma Tre),
Andrea Pacifici (U. Roma Tor Vergata), Stefan Pickl (UBw München),
Giovanni Righini (U. Milano),
Rainer Schrader (U. Cologne), Rüdiger Schultz (U. Duisburg-Essen)

***********************************************************************
* *
* See you in Munich, best regards Stefan Pickl *
* *
***********************************************************************

Prof. Dr. Stefan Pickl
Chair for Operations Research
COMTESSA
UBw Munich, GERMANY

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] FPSAC 2012 - Extended submission deadline Dec. 7

===============================================
24th Annual International Conference on
Formal Power Series and Algebraic Combinatorics
===============================================

FPSAC'12

===============================================
July 30 - August 3, 2012
Nagoya University
(Nagoya, Japan)
===============================================

Third announcement -- Call for papers

************************************************************
***** Submission deadline extended to December 7, 2011 *****
************************************************************

Topics
-----
All aspects of combinatorics and their relations with other
parts of mathematics, physics, computer science and biology.

Conference program
-----
The conference will feature invited lectures, contributed
presentations, poster session, problem session, and software
demonstrations. As usual there will be n parallel sessions.

Official languages
-----
The official languages of the conference are English and French.

Invited Speakers
-----
Alexei Borodin (Massachusetts Institute of Technology, U.S.A.)
Gil Kalai (Hebrew University, Israel)
Manuel Kauers (Johannes Kepler Universitat, Austria)
Rinat Kedem (University of Illinois at Urbana-Champaign, U.S.A.)
Thomas Lam (University of Michigan, U.S.A.)
Jennifer Morse (Drexel University, U.S.A.)
Hjalmar Rosengren (Chalmers University of Technology and
University of Gothenburg, Sweden)
Catharina Stroppel (Universitat Bonn, Germany)
Hiroaki Terao (Hokkaido University, Japan)

Call for papers and posters
-----
Authors are invited to submit extended abstracts of at most
twelve pages by December 7, 2011. To submit papers please
visit the conference website
http://www.math.nagoya-u.ac.jp/fpsac12
Author instructions can also be found at the conference website.

The submitted papers should begin with a short abstract written
both in English and in French (translation provided if necessary).
Authors should indicate the mode of presentation which they
consider appropriate for their paper, i.e. lecture or poster.
The notifications of acceptance are scheduled for March 1, 2012.

The accepted extended abstracts will be published in a volume
dedicated to FPSAC'12 of Discrete Mathematics and Theoretical
Computer Science Proceedings
http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings
If authors desire to publish full versions of papers elsewhere,
this is no problem, as long as the extended abstract is indeed
a short version of the full paper.

Important Nte: Each submitted abstract must be prepared in
accordance with LaTeX (see http://www.ams.org/tex ). Authors
are required to use the LaTeX template which is provided on
the 'Author Instructions' section of the conference website.

Open problem session
-----
Contributions to the problem session are invited in advance
of the conference dates. People interested in submitting a problem
in advance should submit it by e-mail to fpsac12@math.nagoya-u.ac.jp
before June 15, 2012.

Software demonstrations
-----
Demonstrations of software relevant to the topics of the conference
are encouraged. People interested in giving a software demonstration
should submit to fpsac12@math.nagoya-u.ac.jp before March 1, 2012
a paper briefly explaining the software, and including the hardware
requirements.

Best Student Paper Award
-----
In an ongoing FPSAC tradition, an award will be made for the best
paper submitted by a graduate student. Students submitting extended
abstracts are invited to indicate their eligibility for this award.

Participant support
-----
Limited funds are available for partial support of participants;
in particular for students, junior scientists, and mathematicians
from under-represented groups. Requests should contain a letter
of recommendation and include the estimated transportation and
living expenses for the duration of the conference as well as
the amount of any support available from other sources. All
requests should be sent by March 15, 2012. Please see the conference
website for details.

Location
-----
The conference will take place at Nagoya University, Nagoya,
Japan.

Further information
-----
All important information concerning FPSAC'12 can be found on
the conference web site at
http://www.math.nagoya-u.ac.jp/fpsac12

More details will be given in future announcements. Please direct
further questions to fpsac12@math.nagoya-u.ac.jp

Summary of important dates
-----
Extended deadline of submission : December 7, 2011.
Notification of acceptance : March 1, 2012.
Requests for support : March 15, 2012.
Conference : July 30 -- August 3, 2012.

Program Committee
---------------------------
Chair
Hiro-Fumi Yamada (Okayama University, Japan)
CoChair
Nantel Bergeron (York University, Canada)
Member
Susumu Ariki (Osaka University, Japan)
Jean-Christophe Aval (Universite Bordeaux 1, France)
Christine Bessenrodt (Leibniz Universitat Hannover, Germany)
Francesco Brenti (Universita' di Roma "Tor Vergata", Italy)
Sylvie Corteel (Universite Paris Diderot 7, France)
Michael Drmota (Technische Universitat Wien, Austria)
Mariko Hagita (Ochanomizu University, Japan)
Florent Hivert (Universite de Rouen, France)
Jim Hugland (University of Pennsylvania, U.S.A.)
Dongsu Kim (Korea Advanced Institute of Science and Technology,
Korea)
Jeremy Martin (University of Kansas, U.S.A.)
Satoshi Murai (Yamaguchi University, Japan)
Arun Ram (University of Melbourne, Australia)
Andrew Rechnitzer (University of British Columbia, Canada)
Gilles Schaeffer (Ecole Polytechnique, France)
Piotr Sniady (University of Wroclaw, Poland)
Dennis Stanton (University of Minnesota, U.S.A.)
Kai Meng Tan (National University of Singapore, Singapore)
David Wagner (University of Waterloo, Canada)

Organizing Committee
------------------------------
Chair
Soichi Okada (Nagoya University, Japan)
Member
Susanna Fishel (Arizona State University, U.S.A.)
Masao Ishikawa (University of the Ryukyus, Japan)
Christian Krattenthaler (Universitat Wien, Austria)
Hiroshi Mizukawa (National Defense Academy, Japan)
Sho Matsumoto (Nagoya University, Japan)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Software development engineer (10-month position) - G-SCOP, lab, Grenoble, France

Job offer as a software-development engineer (10-month contract, to
start early 2012).

This position is funded by the Institut Carnot on Software and
Intelligent Systems. The candidate will be part of the team Operational
Research for Production Systems, of the G-SCOP Laboratory in Grenoble,
France. He shall participate to the on-going works on location and
transportation problems.

On the base of the academic works of researchers and of wish-list of
industrial partners, the successful candidate is to design and develop a
software that consists of two main libraries (API). The first library
shall enable depicting solutions of optimization problems (e.g., through
geographical maps, road maps, etc.). The second library shall provide
the basic components (classes and algorithms) for the design of solution
methods. It is possible, and even desirable, to use existing libraries
for some parts. A fundamental aspect in the design of these libraries
will be their extensibility and their modularity: it should be possible
to add new components easily, and to choose the only components one
wants to use for a given application.

Applicants must have a Master degree in computer software engineering,
applied mathematics (or equivalent). A good knowledge of C/C++ or Java
is essential.

The gross pay is around 2600€ per month.

Applications (letter + resume) should be sent to Pierre Lemaire
(pierre.lemaire@grenoble-inp.fr).

--
Pierre Lemaire
INP Grenoble - Génie Industriel
Laboratoire G-SCOP (bureau H317)
46, avenue Félix Viallet F-38031 Grenoble cedex 01
tel: (+33) 4.76.57.45.67
url: http://www.kamick.org/lemaire
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CfP: ECCO 2012 in Antalya, Turkey --- cordially welcome

CALL FOR PAPERS
The 25th Conference of the ECCO (European Chapter on Combinatorial
Optimization)
April 26 - 28, 2012

www.eccoxxv.org

Submission Deadline: February 1, 2012

Venue: IC Green Palace Hotel, Antalya, Turkey.
----------------------------------------------------------
IMPORTANT DATES
Submission for abstracts starts:
August 30, 2011
Deadline for abstract submission:
February 1, 2012
Notification of acceptance:
February 10, 2012
Deadline for early registration:
March 10, 2012
Deadline for author registration (for inclusion in the program):
March 20, 2012
Conference:
April 26 – 28, 2012
-----------------------------------------------------------
TOPICS OF INTEREST include but are not limited to

- applications of combinatorial optimization in logistics and supply
chain management, manufacturing, energy
production and distribution, telecommunications, game theory,
bioinformatics, health informatics, healthcare,
finance, discrete and hybrid dynamical systems, data mining, machine
learning, and other fields,

- exact solution algorithms, approximation algorithms, heuristics, and
meta-heuristics for combinatorial
optimization problems,

- graph theory and network flows,

- integer programming, global optimization, stochastic integer
programming, multi-objective programming.

-----------------------------------------------------------
Authors are invited to submit an abstract of their paper in English by
February 1, 2012 online. (www.eccoxxv.org)
Participants of ECCO 2012 are cordially invited for submitting papers
for the special issue on Advances in Combinatorial Optimization and
Related Topics of the journal Optimization.
(http://www.tandf.co.uk/journals/titles/02331934.asp)
Submission deadline of full papers is March 31, 2013.
-----------------------------------------------------------

PLENARY SPEAKERS

Bernard RIES, LAMSADE - Université Paris-Dauphine

Miguel F. ANJOS, École Polytechnique de Montréal

PASCAL2 INVITED SPEAKER

John SHAWE-TAYLOR, University College, London

-----------------------------------------------------------

INVITED STREAMS AND ORGANIZERS

Combinatorial and Hybrid Regulatory Systems – Game Theory (G.-W.
Weber, S.Z Alparslan Gök, E. Kropat)

Combinatorial Optimization in Computational Biology,
Bioinformatics and Medicine (J. Blazewicz, M. Szachniuk)

Combinatorial Optimization in Data Mining (C. Iyigün)

Combinatorial Optimization in Supply Chain Management (M. Turkay)

Combinatorial Optimization in the Financial Sector (G.-W. Weber,
K. Yildirak)

Constraint Programming and Combinatorial Optimization (A. Ornek,
B. Hnich, C. Ozturk)

Emerging Applications of Combinatorial Optimization (C. Oguz, D.T. Eliiyi)

Integer and Combinatorial Optimization (X. Sun)

Material Flows in Production Networks (S. Göttlich)

Multiple Criteria Decision Making and Combinatorial Optimization
(K. Miettinen)

PASCAL 2 Stream - Machine Learning and Combinatorial Optimization
(J. Zerovnik)

Recent Advances in Scheduling (E. Pesch)

Spectral Graph Theory Techniques and Applications in
Combinatorial Optimization (D. Cardoso)

-----------------------------------------------------------
PROGRAM COMMITTEE

Jacek BLAZEWICZ, Poznan University of Technology, Poland

Domingos Moreira CARDOSO, University of Aveiro, Portugal

Van-Dat CUNG, Grenoble INP, France

Alain HERTZ, École Polytechnique Montréal, QC, Canada

Refail KASIMBEYLI (Co-Chair), Izmir University of Economics, Turkey

Silvano MARTELLO, University of Bologna, Italy

Xiaoling SUN, Fudan University, China

Paolo TOTH, University of Bologna, Italy

Gerhard-Wilhelm WEBER (Co-Chair), Middle East Technical
University, Turkey
-----------------------------------------------------------
ORGANIZING COMMITTEE

from Izmir University of Economics, Turkey:

Deniz Tursel Eliiyi
Ugur Eliiyi
Refail Kasimbeyli (Co-chair)
Erdinc Oner
Arslan Ornek (Co-chair)
Ozgur Ozpeynirci
Selin Ozpeynirci
Zeynep Sargut

from Middle East Technical University, Turkey:

Basak Akteke-Ozturk
Sinan Gurel
Yesim Aydin Son
Gurkan Ustunkar
Gerhard-Wilhelm Weber (Co-Chair)
Kasirga Yildirak

from Suleyman Demirel University, Turkey:

Zeynep Alparslan Gok
Ahmet Tokgozlu
-----------------------------------------------------------
For additional information, please contact Zeynep Sargut, at
zeynep.sargut@ieu.edu.tr or
Gerhard-Wilhelm Weber, at gweber@metu.edu.tr

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Deadline extension, December 16: ICDT 2012 || April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

INVITATION:

=================
Please, consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish
original scientific results to ICDT 2012.
The submission deadline is set to December 16, 2011.
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================

============== ICDT 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICDT 2012: The Seventh International Conference on Digital Telecommunications
April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

General page: http://www.iaria.org/conferences2012/ICDT12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPICDT12.html

- regular papers
- short papers (work in progress)
- posters

- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitICDT12.html

Submission deadline: December 16, 2011

Sponsored by IARIA, www.iaria.org

Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Please note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards,
implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete
unpublished papers, which are not under review in any other conference or journal in the following, but not limited to,
topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

ICDT 2012 Topics (topics and submission details: see CfP on the site)

SIGNAL: Signal processing in telecommunications

Signal processing theory and practice; Image and multidimensional signal processing; Signal filter design and structures;
Multirate filtering, filter banks, and adaptive filters; Fast signal processing algorithms; Nonlinear signals and systems;
Nonuniform transformation; 2D nonuniform DFT; Fast algorithm of NDFT; Advanced image/video coding; Advanced prediction
techniques; Signal detection and reconstruction; Spectral estimation and time-frequency analysis; Higher order spectrum
analysis; Parameter estimation; Array signal processing; Statistical signal analysis; Signal and system modeling;
Cyclostationary signal analysis; Active noise control, active noise reduction and echo cancellation; Psychoacoustics and
room acoustics; Signal processing for music; Binaural systems and multidimensional signal systems; Geophysical and seismic
signal processing; Nonlinear interpolation/resampling; Extensions to wavelet based coding (x-lets); Low complexity
image/video compression; Multiple resolution signal processing; New approach to digital signal processing; Compression of
random data; Recompression of compressed data; 2D projection of 3D data; Stereo data matching; Emerging applications
requiring new compression tools; Unified compression and recognition; H.264 and latest video coding standards; Latest
audio coding standards

DATA: Data processing

Data transmission and reception mechanisms and techniques; Enhanced tools for video data integrity; Data mining,
filtering, and reporting; Secure data transmission; Transmission media and data encoding; Text reading devices (super-pen,
pen-elite, reading-pen); Scanned and generated lossy (progressive) multi-page text; (Visually) lossless mechanisms;
Pricing data transmission; Differential data transmission systems; Data transmission equipments and transmission rates;
Delay-constrained data transmission; Undersea and satellite data transmission techniques; Performance evaluation of data
transmission; Multicast data transmission; High speed data transmission; Data transmission control; Integrity and privacy
in data transmission; Data transmission standards

AUDIO: Audio transmission and reception systems

Audio transmission and reception systems and devices; Digital audio transmission signal processing; Audio transmission
over Internet; Audio Multiplexing Transmission Systems; Stereo audio transmission signal; Digital infrared audio
transmission; Multi-stream and multi-path audio transmission; Wireless-compressed digital audio transmission; Perceptual
coding for audio transmission and storage; Laser audio transmission; Synchronizing video and audio transmission; Wide-band
audio transmission; Index-frame audio transmission; Digital audio transmission rights; Noise in wireless audio
transmission; Audio tools and products; Standards

VOICE: Voice over packet networks

Planning and implementing voice networks and systems; Voice transmission systems; Voice transmission performance; Quality
real-time voice transmission; Metrics for quality of voice transmission; Stereophonic voice transmission systems; Header
Compression for VoIP over WLAN; Voice over IP solution for mobile radio interoperability; VoIP over cable TV networks;
VoIP over Wi-Max

VIDEO: Video, conferencing, telephony

Digital video; Video coding formats (ITU-T, SMPTE 421M, AVS-China); Video coders and decoders; Profiles, latency,
intermediate formats; Video surveillance and privacy; Video feature requirements; Network video recorders; Graceful
degradation of archive video; Video data integrity (error detection, tamper resistance); Alarm events for voice content
(motion detection, object tracking, face recognitions); Coding efficiency and distributed video coding; Compression and
scrambling; Enhanced tools for video data integrity; Multiple reference pictures; Intra-layer and inter-layer prediction;
Fading prediction and loop filter; Video with compression errors; Viewing distance and perceptual quality; Video quality
models; Omnidirectional video; 3D video; Video standardization encoding; Texture synthesizer

IMAGE: Image producing, sending, and mining

Model-based progressive image transmission; Wireless image transmission; Computer generated images; Image security,
scrambling, and regions of interest; Timing requirements for image transmission; Transmission of still and moving images;
Protocols for low bit rate; Error-prone image transmission; Energy efficient image transmission; Multi-technology image
formation; Devices for image capturing and processing (cams, web-cams, etc.); Scanning and sampling, quantization and
halftoning, color reproduction; Image representation and rendering, display and printing systems; Image quality
assessment; Image search and sorting, video indexing and editing; Integration of images and video with other media; Image
authentication and watermarking; Image storage, retrieval and multimedia; Image and video databases; Generic coding of
moving pictures; Media stream packetization; Modes for archival playback; Image-based applications; Standard for image
processing; Image analysis and segmentation; Image filtering, restoration and enhancement; Image representation and
modeling; Pattern recognition

SPEECH: Speech producing and processing

Tooling, Architectures, Components and Standards; Voice modulation, frequencies; Linguistics, Phonology and Phonetics;
Discourse and Dialogue; Speech analysis, synthesis, coding, and recognition; Speech enhancement and noise reduction;
Speech features, production, and perception; Speech Coding and Transmission; Speech Signal Processing; Spoken Language
Generation and Synthesis; Speech QoS Enhancement; Speaker Characterization and Recognition; Spoken Language; Resources and
Annotation; Spoken/Multi-modal Dialogue Technology and Systems; Spoken Language Information Extraction/Retrieval; Speech
Transmission Technology for the Aged and Disabled; Audio-Visual Speech Processing; Biomedical Applications of Speech
Analysis; Spoken document retrieval; Speech Processing in a Packet; Network Environment; Automatic Speech Recognition in
the Context of Mobile Communications; Human Factors in Speech and Communication Systems; Automatic speech recognition and
understanding technology; Speech to text systems; Spoken dialog systems; Multilingual language processing; New
Applications of Spoken Language Technology and Systems

IPTV: IP/Mobile TV

IPTV applications and middleware; On-demand television; Interactive TV; Broadcast TV data; Broadcast content formats;
Stereo and 3D TV; TVoDSL; Television archiving; IPTV broadcasting; IPTV-aware devices; IPTV regulatory issues and
copyrights; IPTV network infrastructure; IPTV monitoring and management; I[P]TV usage fees; IPTV Personalization and QoS
Implications

MULTI: Multicast/Broadcast Triple-Quadruple-play

Scalable video/audio coding; Multiplexing video/audio/data; Multimedia terminals; Multimedia systems and protocols; PSTN
modems and interfaces; Facsimile terminals; Direct broadcast satellite; Terrestrial broadcast television; Cable modems;
Universal media access; Format compatibility; Media support platforms; VoIP Quality for Triple Play; Testing triple-play
services; Triple-play data encryption; Triple-play services

CONTENT: Production, distribution

Content injection, cashing, storage, and distribution; Producing and transmitting streaming content; Content localization
services; Content and customers profiles; Documenting and content authoring; Authorizing topic-based content; Content
customization and metadata; On-demand content; Content retrieval from archives (alarm-based, time stamp-based); Content
management solutions and systems; Unstructured content environment; Multi-channel content delivery/publishing strategies;
Content reuse

HXSIP: H-series towards SIP

SIP and H-xxx architectures and logical components; Instant messages and presence; Management of QoS in SIP and H-xxx
environments; Basic SIP building blocks; Security and firewalls with SIP and H-xxx series; Service creation and telephony
services with SIP and H-xxx; Multimedia conferencing with SIP and H-xxx; SIP application scenarios; SIP
(auto)configuration; SIP and H-xxx beyond VoIP; Leveraging SIP for Global Enterprise Roaming; SIP, H-xxx and 3GPP;
Emergency Calling in SIP and H-xxx; Advanced SIP and H-xxx applications and services; SIP and H-xxx on Cable Networks; SIP
and H-xxx devices; SIP and h-xxx deployment experience; End-to-end SIP and H-xxx communications; SIP/H.323 Interworking
Function for real time communications

MULTE: Multimedia Telecommunications

Frameworks, architectures, systems for delivering voices, audio, and data; Methodologies, technologies, procedures and
mechanisms; IMT-2000 concepts; IMS concepts (IP Multimedia Systems); Bluetooth and WLAN coexistence on handsets;
Packet-based multimedia communication systems; Converging technology for voice and data networks; Accessibility features
for unpaired users; Confidentiality for audiovisual services; Multimedia transmission performance; Multiplexing and
synchronization; Directory services for multimedia; Computation complexity and costs (multiple simultaneous decoders);
Coding efficiency (embedded, bit-plane, arithmetic); Compatibility between Analog/DVD and networks; IP4/IP6 transition and
NAT; QoS/SLA, perceptual QoS, and formal visual tests; Temporal and spatial scalability; Pre-processing and predictive
coding; Coding with regions-of-interest; Secure transcoding; Computation power and resolution; Transform and quantization;
Entropy coding; Lossless and lossy compression; Transmission in noisy environments; Voice/video/data in 4G; Specialized
medical applications; Medical imaging and communications networks; MPEG for endoscopy, microscopy, radiology, surgery;
Medical archiving systems; Digital devices for image capturing (microscope, stethoscope); Digital equipments and digital
cinema; Digital signature protection

MOBILE: Mobile technologies

3G+: UMTS, HSPA, HSUPA, HSDPA, HSOPA, WiMAX, UWB. LTE, All-IP LTE 4G and beyond; Seamless handover engineering; Cognitive
radio; Mobile video surveillance; Pervasive/ubiquitous/mobile systems; Security and privacy issues for mobile and wireless
systems; Mobile ad hoc networks

MEDMAN: Control and management of multimedia telecommunication

Video codec-aware of packets; Monitoring via guard on patrol, central station, forensic analysis; Managing single domestic
licensing and granted patent pool for compressions; End-to-end quality monitoring/management; Perceived/offered quality:
video-only, audio-only, audio-video; In-service monitoring of voice/video/data services; Real-time distributed imagery
management systems; Performance in voice/video/data systems; Distributed multimedia service management; Mobile multimedia
network management; Multi-point, multicast services management; Deployment of multimedia services; Network management
models and architectures; Billing and security for multimedia services; Network measurement/monitoring for multimedia
services

SARP: Software architecture research and practice

Distributed software architecture; Architectural styles and patterns; Architecture refinement and transformation; Software
architecture and pervasive systems; Software architecture analysis & testing; Architectural description languages (ADLs);
Component-based software architecture; Dynamic software architecture; Self-repairing software architecture; Adaptive
software architecture; Aspect-oriented software architecture; Service-oriented architecture [SOA]; Domain specific
software architecture [DSSA]; Tools/Environments for software architects; Product-line software architecture; Industrial
case studies and reports

STREAM: Data stream processing

Fundamentals on data stream processing; Data stream processing and event stream processing; Continuous query languages;
Time management in data stream systems; Aggregated queries support; Query processing with multiple, continuous, rapid,
time-varying data streams; Processing frequent itemset discovery queries; Real-time stream data processing; Network-aware
operator placement for stream-processing systems; Integrating database queries and Web searches; Scalable Distributed
Stream Processing; Optimization of data stream processing; Performance and overhead in data stream processing; QoS
adaptation in data stream systems; Adaptive query processing in data stream; Interactive distributed data stream
processing and mining; Data stream management systems; Control theory on stream processing; Processing high-speed data
streams; Stream processing in production-to-business software; Multi-site cooperative data stream analysis; Grid-based
data stream processing; Hyperdatabases for P2P data stream processing; Sensor data stream processing in health monitoring;
Processing and sharing data streams in Grid-based P2P infrastructures

TRACK: Tracking computing technologies

Airport security communications technologies; Hazards detection- automatic real-time material/object recognition;
Intelligent IP-based sensor networking for homeland security; Real-time intelligence data validation and verification
mechanisms; Efficient data integration and mining techniques for NATO countries; Secure distributed storage and data
pinning; SATCOM for HLS; Critical aerospace communications systems; HLS for air, land and sea operational environments;
Airborne real-time spatial tracking techniques; Bio-authentication sensors and tools; Cyber and physical security of key
infrastructure and operations; Protection of Real-time resilient communications network infrastructures; International
standards for data schema and data sharing between USA and other countries; Emergency response tools; Prediction of
Intent; Standards for Passenger Data Integration; Sharing Addressing and Service Discovery in Auto-configuring MANETs;
Exploiting localization and network information (GPS, INS, GIS, terrain features, ToA, AoA, SNR, QoS) for improved ad-hoc
networking in complex terrain; Advanced indoor and outdoor location-based applications: real-time tracking, multimedia,
bidirectional, proactive applications; Location based services based on integrated cellular, ad hoc, RFID, and sensor
networks; New positioning techniques in support of location based servcies (indoor, cellular, satellite, hybrid);
Geographic Information Systems for supporting location based services; Quality of location data Integration of
Hierarchical Location-Based Routing (HLBR) with Delay- and Disruption-Tolerant Neworks (DTNs); Narrow-band control
channels for HLBR; Location-aware (GPS-aware) Internet Browsers for Location-based services

Committee: http://www.iaria.org/conferences2012/ComICDT12.html
====================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

POPL 2012: Call for participation

**************************************************************

* ACM SIGPLAN-SIGACT Symposium
* on
* Principles of Programming Languages
*
* January 25-27, 2012
* Philadelphia, PA, USA
*
* Call for Participation
*
*http://www.cse.psu.edu/popl/12/
***************************************************************

Important dates
------------------------

* Hotel reservation deadline: December 24, 2011
* Early registration deadline: December 24, 2011
* Conference: January 25-27, 2012
* Colocated events: January 22-29, 2012

Registration
--------------------------

To register online, please go to

https://regmaster3.com/2012conf/POPL12/register.php

The early registration deadline is December 24, 2011.

Hotel
-------------------------

All the conference events will take place at the Sheraton Society Hill
Hotel in Philadelphia's historic district. We encourage attendees to
stay at the conference hotel. Information about the hotel can be found
on the POPL web page:

http://www.cse.psu.edu/popl/12/

To be eligible for the special conference rate, bookings must be made
by December 24, 2011. However, as the conference rate applies only to
a limited number of rooms, attendees are encouraged to make their
hotel reservations at the earliest opportunity.

Scope
-------------------------

The annual Symposium on Principles of Programming Languages is a forum
for the discussion of fundamental principles and important innovations
in the design, definition, analysis, transformation, implementation
and verification of programming languages, programming systems, and
programming abstractions. Both experimental and theoretical papers are
welcome.

Preliminary program
--------------------------

A preliminary program can be found at the end of this email in text
format, or it can be found here:

http://www.cse.psu.edu/popl/12/program.html

Program Highlights
-------------------------

Invited talks:

* Sir Charles Antony Richard Hoare, FRS, FREng, FBCS, Microsoft
Research
ACM SIGPLAN Programming Languages Achievement Award Interview

* J Strother Moore, University of Texas at Austin
Meta-Level Features in an Industrial-Strength Theorem Prover

* Jennifer Rexford, Princeton University
Programming Languages for Programmable Networks

Other attractions
-------------------------

POPL TutorialFest!:

POPL 2012 will have a TutorialFest! event with seven "distilled" 90
minute tutorials. This event is on January 28, immediately following
the main POPL conference. The TutorialFest! requires separate
registration and registrants of TutorialFest! may attend any of the
tutorials offered throughout the day.

More information on the TutorialFest! is available at:

http://www.cse.psu.edu/popl/12/tutorial.html

Affiliated Events
--------------------------

* POPL TutorialFest: January 28, 2012

* VMCAI:Verification Model Checking and Abstract Interpretation
* January 22-24, 2012
http://lara.epfl.ch/vmcai2012/

* LADA: Languages for Distributed Algorithms
* January 23-24, 2012
http://sites.google.com/site/ladameeting/

* PADL: Practical Applications of Declarative Languages
* January 23-24, 2012
http://research.microsoft.com/en-us/um/people/crusso/padl12/

* PEPM: Partial Evaluation and Semantics-Based Program Manipulation
* January 23-24, 2012
http://www.program-transformation.org/PEPM12

* PLMW: The CRA-W/CDC and SIGPLAN Programming Languages Mentoring
Workshop
* January 24, 2012
http://www.cis.upenn.edu/~sweirich/plmw12/

* PLPV: Programming Languages meets Program Verification
* January 24, 2012
http://research.microsoft.com/en-us/um/people/nswamy/plpv12/

* DAMP: Declarative Aspects of Multicore Programming
* January 28, 2012
http://www.mpi-sws.org/~umut/damp2012/

* OBT: Off the Beaten Track: Underrepresented Problems for Programming
Language Researchers
* January 28, 2012
http://www.cs.princeton.edu/~dpw/obt/

* TLDI:Types in Language Design and Implementation
* January 28, 2012
http://www.cis.upenn.edu/~bcpierce/tldi12/

* VSTTE: Verified Software: Theories, Tools and Experiments
* January 28-29, 2012
https://sites.google.com/site/vstte2012/

Travel awards and visa support letters
--------------------------------

A limited number of grants are available through the SIGPLAN
Professional Activities Committee (PAC) to support students going to
POPL. You must be an ACM member to apply.

Students that are interested in attending both POPL and the PLMW
Workshop should first seek funds via PLMW and then contact PAC if the
PLMW grant is not awarded. PLMW grants are explained on the PLMW
website.

Requests for visa support letters for purposes of attending or
presenting at POPL 2012 are handled by ACM. More information is
available on the POPL 2012 website.

Program
---------------------------
Wednesday, January 25
===========================

* 8:30-9:20: Breakfast

* 9:20-9:30: Welcome

* 9:30-10:30: Invited Talk (Session chairs: Andrew P. Black, Peter
O'Hearn)
- SIGPLAN Distinguished Achievement Award Presentation and Interview
Tony Hoare, Microsoft Research.

* 10:30-11:00: Break

* 11:00-12:30: Session on Verification (Chair: Ranjit Jhala):
-Freefinement (Stephan van Staden, Cristiano Calcagno, and Bertrand
Meyer)
- Underspecified harnesses and interleaved bugs (Saurabh Joshi,
Shuvendu Lahiri, and Akash Lal)
- A Program Logic for JavaScript (Philippa Gardner, Sergio Maffeis,
and Gareth Smith)

* 11:00-12:30: Session on Semantics (Chair: Patricia Johann):

- Higher-Order Functional Reactive Programming in Bounded Space
(Neelakantan R Krishnaswami and Nick Benton and Jan Hoffmann)

- The Marriage of Bisimulations and Kripke Logical Relations
(Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis)

- Information Effects (Roshan James and Amr Sabry)

* 12:30-2:00: Lunch

* 2:00-3:30: Session on Privacy and Access Control (Chair: Nikhil
Swamy):

- A Language for Automatically Enforcing Privacy Policies (Jean Yang,
Kuat Yessenov, and Armando Solar-Lezama)
- Probabilistic Relational Reasoning for Differential Privacy (Gilles
Barthe, Boris Köpf, Federico Olmedo, and Santiago Zanella Beguelin)
- Access Permission Contracts for Scripting Languages (Phillip
Heidegger, Annette Bieniusa, and Peter Thiemann)

* 2:00-3:30: Session on Decision Procedures (Chair: Swarat Chaudhuri):

- Recursive Proofs for Inductive Tree Data-Structures (P Madhusudan,
Xiaokang Qiu, and Andrei Stefanescu)
- Symbolic Finite State Transducers, Algorithms and Applications
(Nikolaj Bjorner, Pieter Hooimeijer, and Benjamin Livshits, David
Molnar, and Margus Veanes)
- Constraints as Control (Ali Sinan Köksal, Viktor Kuncak, and
Philippe Suter)

* 3:30-4:15: Break

* 4:15-5:15: Session on Security (Chair: Neelakantan Krishnaswami):
- Multiple Facets for Dynamic Information Flow (Thomas Austin and
Cormac Flanagan)
- Defining Code-injection Attacks (Donald Ray and Jay Ligatti)

* 4:15-5:15: Session on Complexity for Concurrency (Chair: P.
Madhusudan):
- Deciding Choreography Realizability (Samik Basu, Tevfik Bultan, and
Meriem Ouederni)
- Analysis of Recursively Parallel Programs (Ahmed Bouajjani and
Michael Emmi)

* 5:15-6:00: Break

* 6:00-8:00: Student Session (Chair: Tobias Wrigstad)

Thursday, January 26
===========================

* 8:30-9:20: Breakfast

* 9:20-9:30: Announcements

* 9:30-10:30: Invited Talk (Session chair: Michael Hicks)
- Programming Languages for Programmable Networks
Jennifer Rexford, Princeton University

* 10:30-11:00: Break

* 11:00-12:30: Session on Medley (Chair: Suresh Jagannathan):
- A Compiler and Run-time System for Network Programming Languages
(Christopher Monsanto, Nate Foster, Rob Harrison, and David Walker)
- Nested Refinements: A Logic For Duck Typing (Ravi Chugh, Patrick M
Rondon, and Ranjit Jhala)
- An Abstract Interpretation Framework for Termination. (Patrick
Cousot and Radhia Cousot)

* 11:00-12:30: Session on Mechanized Proofs (Chair: Adam Chlipala):
- Playing in the Grey Area of Proofs (Krystof Hoder, Laura Kovacs, and
Andrei Voronkov)
- Static and User-Extensible Proof Checking (Antonis Stampoulis and
Zhong Shao)
- Run Your Research: On the Effectiveness of Lightweight Mechanization
(Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, and
Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam
Tobin-Hochstadt, and Robert Bruce Findler)

* 12:30-2:00: Lunch

* 2:00-3:30: Session on Concurrency (Chair: Matt Parkinson):
- Verification of Parameterized Concurrent Programs By Modular
Reasoning about Data and Control (Azadeh Farzan and Zachary Kincaid)
-Resource-Sensitive Synchronization Inference by Abduction (Matko
Botincan and Mike Dodds and Suresh Jagannathan)
- Syntactic Control of Interference for Separation Logic (Uday S Reddy
and John C Reynolds)

* 2:00-3:30: Session on Type Theory (Chair: Stephanie Weirich):
- Canonicity for 2-Dimensional Type Theory (Daniel R Licata and Robert
Harper)
- Algebraic Foundations for Effect-Dependent Optimisations (Ohad
Kammar and Gordon Plotkin)
- On the Power of Coercion Abstraction (Didier Remy and Julien Cretin)

* 3:30-4:15: Break

* 4:15-5:15: Session on Dynamic Analysis (Chair: Aarti Gupta):
- Abstractions From Tests (Mayur Naik, Hongseok Yang, and Ghila
Castelnuovo and Mooly Sagiv)
- Sound Predictive Race Detection in Polynomial Time (Yannis
Smaragdakis, Jacob M Evans, and Caitlin Sadowski, Jaeheon Yi, and
Cormac Flanagan)

* 4:15-5:15: Session on Names and Binders (Chair: Zhong Shao):
- Towards Nominal Computation (Mikolaj Bojanczyk, Laurent Braud,
Bartek Klin, and Slawomir Lasota)
- Programming with Binders and Indexed Data-Types (Andrew Cave and
Brigitte Pientka)

* 5:15-5:45: Business meeting

* 7:00-: Banquet

Friday, January 27
===========================

* 8:30-9:20: Breakfast

* 9:20-9:30: POPL 2013 preview

* 9:30-10:30: Invited Talk (Session chair: John Field)
- Meta-level Features in an Industrial-Strength Theorem Prover
J Strother Moore, University of Texas

* 10:30-11:00: Break

* 11:00-12:30: Session on Verified Transformations (Chair: Chris
Hawblitzel):

- Formalizing the LLVM Intermediate Representation for Verified
Program Transformation (Jianzhou Zhao, Steve Zdancewic, Santosh
Nagarakatte, and Milo M K Martin)
- Optimal Randomized Transformation of Approximate Computations
(Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and Martin
Rinard)
- A Rely-Guarantee-Based Simulation for Verifying Concurrent Program
Transformations (Hongjin Liang, Xinyu Feng, and Ming Fu)

* 11:00-12:30: Session on Functional Programming (Chair: Dimitrios
Vytiniotis):

- A Unified Approach to Fully Lazy Sharing (Thibaut Balabonski)
- The Ins and Outs of Gradual Type Inference (Aseem Rastogi and Avik
Chaudhuri and Basil Hosmer)
- Edit Lenses (Martin Hofmann and Benjamin C Pierce and Daniel Wagner)

* 12:30-2:00: Lunch

* 2:00-3:30: Session on C/C++ Semantics (Chair: Andreas Podelski):

- Clarifying and compiling C/C++ concurrency: from C++0x to POWER
(Mark Batty, Kayvan Memarian, and Scott Owens, Susmit Sarkar, and
Peter Sewell)
- A mechanized semantics for C++ object construction and destruction,
with applications to resource management (Tahina Ramananandro, Gabriel
Dos Reis, and Xavier Leroy)
- An Executable Formal Semantics of C with Applications (Chucky
Ellison and Grigore Rosu)

* 2:00-3:30: Session on Type Systems (Chair: Norman Ramsey):

- A Type Theory for Probability Density Functions (Sooraj Bhat, Ashish
Agarwal, and Richard Vuduc and Alexander Gray)
- A Type System for Borrowing Permissions (Karl Naden, Robert L
Bocchino Jr, Kevin Bierhoff, and Jonathan Aldrich)
- Self-Certification: Bootstrapping Certified Typecheckers in F* with
Coq (Pierre-Yves Strub and Nikhil Swamy, Cedric Fournet, and Juan
Chen)

* 3:30-4:00: Closing and Raffle

General Chair:
--------------------------

John Field
Google
76 Ninth Avenue,
New York, NY 10011, USA.
jfield@google.com

Program Chair:
---------------------------

Michael Hicks
Department of Computer Science
University of Maryland,
College Park, MD 20866, USA
mwh@cs.umd.edu

Program Committee:
---------------------------

Swarat Chaudhuri, Rice University, USA
Adam Chlipala, MIT, USA
Dan R. Ghica, University of Birmingham, UK
Aarti Gupta, NEC Labs America, USA
Chris Hawblitzel, Microsoft Research, Redmond, USA
Suresh Jagannathan, Purdue University, USA
Ranjit Jhala, University of California, San Diego, USA
Sorin Lerner, University of California, San Diego, USA
Ondrej Lhotak, University of Waterloo, Canada
P. Madhusudan, University of Illinois, Urbana-Champaign, USA
Rupak Majumdar, MPI-SWS, Germany
Matthew Might, University of Utah, USA
Todd Millstein, University of California, Los Angeles, USA
Greg Morrisett, Harvard University, USA
Andrew Myers, Cornell University, USA
Matthew Parkinson, Microsoft Research, Cambridge, UK
Frank Piessens, K.U. Leuven, Belgium
Andrew Pitts, University of Cambridge, UK
Andreas Podelski, University of Freiburg, Germany
François Pottier, INRIA, France
Norman Ramsey, Tufts University, USA
Tachio Terauchi, Nagoya University, Japan
Mandana Vaziri, IBM Research, USA
Dimitrios Vytiniotis, Microsoft Research, Cambridge, UK
Nobuko Yoshida, Imperial College, London, UK
Francesco Zappa Nardelli, INRIA, France

3 PhDs and 1 PostDoc position, University of Luxembourg

Apologies if you receive this message multiple times.
We hope your mailing list helps us advertise the following positions.

******************************************************************
Vacancies: 3 PhDs and 1 Post-Doc - Univ. of Luxembourg
******************************************************************

The Interdisciplinary Centre for Security, Reliability and Trust
University of Luxembourg - Luxembourg is looking for

==================================================================
* 2 Ph.D. Students in Computer Security
* 1 Ph.D. Student in Socio-Technical Aspects of Security

Duration: 3 years (extension up to 4 years in total is possible).
==================================================================
For more information see URLs:

http://wwwen.uni.lu/university/jobs/snt/doctorants_chercheurs_en_formation_doctorale/phd_candidates_in_computer_security_m_f

http://wwwen.uni.lu/university/jobs/snt/doctorants_chercheurs_en_formation_doctorale/phd_candidate_in_socio_technical_aspects_of_security_m_f

==================================================================
* 1 Post-Doc in Socio-Technical Aspects of Security

Duration 2 years (extension up to 5 years is possible).
==================================================================
For more information and for application see URL:

http://wwwen.uni.lu/university/jobs/snt/post_doctorants_assistants_chercheurs/research_associate_postdoc_in_socio_technical_aspects_of_security_m_f

==================================================================
All the positions are related to the CORE-FNR project "Socio-Technical
Analysis of Security and Trust" (STAST).

STAST will be highly interdisciplinary. It teams up the
Interdisciplinary Centre for Reliability, Security and Trust (SnT),
the Applied Security and Information Assurance (APSIA), led by
Prof. P. Y. A. Ryan who is also the principal investigator of the
project, and Security and Trust of Software Systems (SaToSS), led by
Prof. S. Mauw, and the Educational Measurement and Applied Cognitive
Science (EMACS), ref. Dr. V. Koenig.
------------------------------------------------------------------
Application deadlines: 15 February 2012.

For questions, please contact:

Prof. Peter Ryan (Peter.Ryan@uni.lu) or
Prof. Sjouke Mauw (Sjouke.Mauw@uni.lu) or
Dr. Gabriele Lenzini (Gabriele.Lenzini@Uni.lu).
------------------------------------------------------------------

[DMANET] Remind CFP DAM Special Issue CTW 2011

CALL FOR PAPERS:

Special Issue DAM: CTW 2011
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
---
Deadline: *November 30, 2011. Extensions may be obtained upon request*.
---

Following the tradition of previous workshops, a special issue of
Discrete Applied Mathematics will be devoted to the 10th Cologne-Twente
Workshop on Graphs and Combinatorial Optimization
(http://ctw2011.dia.uniroma3.it).

All interested researchers are invited to contribute to this special
volume. The topics should relate to the themes of the workshop (graphs,
combinatorial optimization and the design and analysis of algorithms).
Submissions of contributions not presented at the workshop are also welcome.

All articles will be thoroughly refereed according to the high standards
of Discrete Applied Mathematics.

The full papers must be submitted through the Elsevier Editorial
System (http://ees.elsevier.com/dam). When submitting your paper, be
sure to specify that the paper is a contribution for the Special Issue
of CTW 2011, so that your paper is assigned to the guest editors.

Looking forward to your contribution,

The guest editors

Ulrich Faigle (Mathematisches Institut, Universität zu Köln)
faigle@zpr.uni-koeln.de

Gaia Nicosia (Dip. Informatica e Automazione, Università di Roma Tre)
nicosia@dia.uniroma3.it

Andrea Pacifici (Dip. Informatica, Sistemi e Produzione, Università di
Roma "Tor Vergata")
pacifici@disp.uniroma2.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] FAW-AAIM'2012 Call for Papers

Dear colleges,

We apologize for duplicated messages.

[FAW-AAIM'2012 Call for Papers]

The 2012 Joint FAW-AAIM Conference
May 14-16, 2012
Peking University, Beijing, China
http://faw-aaim2012.pku.edu.cn

In cooperation with SIAM and NSFC, the Sixth International Frontiers of Algorithmics Workshop (FAW 2012) and The Eighth International Conference on Algorithmic Aspects of Information and Management (AAIM 2012) will be jointly held on May 14-16, 2012 at Peking University, Beijing, China.

The Joint Conference will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications. There will be a joint proceeding for the conference, and the accepted papers will be put in the FAW or AAIM track according to their contents (with the common understanding that FAW focuses on algorithmics while AAIM
focuses on combinatorial optimization, operation research and management sciences).

Interesting new results in all areas of algorithmics, operation research and combinatorial optimization and their applications are welcome. In addition to theoretical work, we are also interested in results that report on experimental and applied research of general algorithmic interest. Special considerations will be given to algorithmic research that is motivated by realworld applications. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the target algorithms in practical settings.

Important Dates:

Submission Deadline: Jan. 8, 2012
Author Notificatione: Feb. 17, 2012
Final Manuscript Due: Mar. 4, 2012
Conference: May 14-16, 2012

Invited Speakers:

Tao Jiang (University of California - Riverside, USA)
Joseph S.B. Mitchell (State University of New York at Stony Brook, USA)

Conference Committees:

General Chairs:

John Hopcroft (Cornell University, USA)
Hong Mei (Peking University, China)

Program Committee Chair:

Jack Snoeyink (University of North Carolina, USA)

Program Committee Co-Chairs:

Pinyan Lu (Microsoft Research Asia , China)
Kaile Su (Peking University, China)
Lusheng Wang (City University of Hong Kong, Hong Kong)

PC Members for FAW Track:

Andrej Bogdanov, Chinese University of Hong Kong, China
Leizhen Cai, Chinese University of Hong Kong, China
Xin Chen, Nanyang Technological University, Singapore
Yijia Chen, Shanghai Jiao Tong University, China
Zhi-zhong Chen, Tokyo Denki University, Japan
Miklós Csűrös, Université de Montréal, Canada
Bin Fu, University of Texas-Pan American, USA
Ming-Yang Kao, Northwestern University, USA
Zhoujun Li, Beihang University, China
Guohui Lin, University of Alberta, Canada
Tian Liu, Peking University, China
Xiaoming Sun, Institute of Computing Technology, CAS, China
Haitao Wang, University of Notre Dame, USA
Hanpin Wang, Peking University, China
Jianxin Wang, Central South University, China
David Woodruff, IBM Almaden Research Center, USA
Yi Wu, IBM Almaden Research Center, USA
Mingji Xia, Software Institute, CAS, China
Jinhui Xu, University at Buffalo, the State University of New York, USA
Yitong Yin, Nanjing University, China
Shengyu Zhang, Chinese University of Hong Kong, China

PC Members for AAIM Track:

Ning Chen, Nanyang Technological University, Singapore
Xi Chen, Columbia University, USA
Yongxi Cheng, Xi'an Jiao Tong University, China
Giorgos Christodoulou, University of Liverpool, UK
Hao Yuan, City University of Hong Kong, China
Martin Hoefer, RWTH Aachen University, Germany
Hon Wai Leong, National University of Singapore, Singapore
Guojun Li, Shandong University, China
Julian Mestre, University of Sydney, Australia
Karthik Natarajan, City University of Hong Kong, China
Anthony Man-Cho So, Chinese University of Hong Kong, China
Periklis Papakonstantinou, Tsinghua Univerisity, China
Zhiyi Tan, Zhejiang University, China
Shang-Hua Teng, University of Southern California, USA
Chung-Piaw Teo, National University of Singapore, Singapore
Yajun Wang, Microsoft Research Asia, China
Ke Xu, Beihang University, China
Ke Yi, Hong Kong University of Science and Technology, China
Guochuan Zhang, Zhejiang University, China
Jian Zhang, Software Institute, CAS, China
Louxin Zhang, National University of Singapore, Singapore
Lu Zhang, Peking University, China

Organizing Committee:

Hanpin Wang (Peking University, China)
Tian Liu (Peking University, China)

Further Information:
The web site http://faw-aaim2012.pku.edu.cn provides more information about the joint conference. For any questions, please e-mail to faw-aaim2012@pku.edu.cn

[The End of FAW-AAIM'2012 Call for Papers]

Sincerely

Tian Liu
--
Tian Liu
Associate Professor
School of EECS, Peking University
Beijing 100871, China
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

ISCO 2012: Deadline extended to December 8, 2011

******************************************************
* *
* Submission deadline extended to December 8, 2011 *
* *
******************************************************

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
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 8, 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 - Proceedings
------------------------
The submission deadline is Thursday December 8, 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
--------------
A special issue of Mathematical Programming Series B, on combinatorial
optimization, will be associated with the conference
(see http://isco12.cs.aueb.gr/CfP-MPB.pdf for the CFP).

Another special of a journal in the area of combinatorial optimization
algorithms is also planned.

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