ISMP 2012 - last call for presentations

21ST INTERNATIONAL SYMPOSIUM ON MATHEMATICAL PROGRAMMING (ISMP 2012)
www.ismp2012.org

ISMP 2012 will take place in Berlin, Germany, August 19 - 24, 2012. ISMP is the world congress of mathematical optimization and is held every three years on behalf of the Mathematical Optimization Society.

Last Call for PRESENTATIONS

Presentations on all theoretical, computational and practical aspects of mathematical programming in one of the program clusters are welcome (see www.ismp2012.org/en/clusters-and-cluster-chairs ). The deadline for submitting titles and abstracts of presentations is April 15, 2012. There is a one talk per speaker policy at ISMP, i.e., no participant will be able to register more than one presentation. Abstract submission and registration can be done online, via the conference webpage at www.ismp2012.org.

Notice that ISMP does not have published proceedings and it is not possible to submit entire papers. But short abstracts of a talks (at most 1200 characters) will appear in the book of abstracts.

IMPORTANT DATES

April 15, 2012: abstract submission deadline
May 15, 2012: notification
June 15, 2012: early registration deadline
August 19, 2012: opening ceremony at Konzerthaus am Gendarmenmarkt

PLENARY and SEMI-PLENARY SPEAKERS

Nikhil Bansal, TU Eindhoven
Richard G. Baraniuk, Rice University
Dimitris Bertsimas, Massachusetts Institute of Technology
Xiaojun Chen, Hong Kong Polytechnic University
Michael P. Friedlander, University of British Columbia
Jorge Nocedal, Northwestern University
Teemu Pennanen, King's College London
Amin Saberi, Stanford University
Claudia Sagastizabal, CEPEL, Rio de Janeiro
Katya Scheinberg, Lehigh University
Christof Schütte, Freie Universität Berlin
Rekha R. Thomas, University of Washington
Robin Thomas, Georgia Institute of Technology
Rakesh V. Vohra, Northwestern University
Robert Weismantel, ETH Zürich

HISTORICAL LECTURES

In addition to the scientific program ISMP 2012 will offer an extensive coverage of the history of optimization. Five special history lectures are scheduled reporting on work of Euler, Leibniz, Weierstrass, Minkowski, and the inventor of the electronic computer Konrad Zuse. Every ISMP participant will receive a free gift, a hard cover book, edited by Martin Groetschel, with about 50 short stories on optimization history. Experts will provide answers to questions such as "Who invented interior point algorithms or the simplex algorithm?", "Was the TSP invented by an archeologist?",
or "What does the cold war have to do with the maximum principle?"

CONFERENCE VENUE

The Symposium will take place at the main building of TU Berlin (Str. des 17. Juni 135, 10623 Berlin) in the heart of the city close to the Tiergarten park.

The opening ceremony will take place on Sunday, August 19, 2012, at the Konzerthaus on the historic Gendarmenmarkt which is considered one of the most beautiful squares in Europe. The opening session will feature the presentation of awards by the Mathematical Optimization Society accompanied by symphonic music. This is followed by the welcome reception with a magnificent view on Gendarmenmarkt.

The conference dinner will take place at the Haus der Kulturen der Welt ("House of the Cultures of the World") located in the Tiergarten park with a beer garden on the shores of the Spree river and a view on the German Chancellery.

SYMPOSIUM ON DISCRETE MATHEMATICS

Prior to ISMP 2012, on August 17-18, the Symposium on Discrete Mathematics 2012 (biannual meeting of "Fachgruppe Diskrete Mathematik" of the German Mathematical Society), will take place at TU Berlin. The main speakers are: Sylvia Boyd (University of Ottawa), Michel X. Goemans (MIT), Michael Krivelevich (Tel Aviv University), Angelika Steger (ETH Zürich), and Günter M. Ziegler (FU Berlin). For more information see www3.math.tu-berlin.de/dm/symposium2012.html

[DMANET] ISMP 2012 - last call for presentations

21ST INTERNATIONAL SYMPOSIUM ON MATHEMATICAL PROGRAMMING (ISMP 2012)
www.ismp2012.org

ISMP 2012 will take place in Berlin, Germany, August 19 - 24, 2012. ISMP is the world congress of mathematical optimization and is held every three years on behalf of the Mathematical Optimization Society.

Last Call for PRESENTATIONS

Presentations on all theoretical, computational and practical aspects of mathematical programming in one of the program clusters are welcome (see www.ismp2012.org/en/clusters-and-cluster-chairs ). The deadline for submitting titles and abstracts of presentations is April 15, 2012. There is a one talk per speaker policy at ISMP, i.e., no participant will be able to register more than one presentation. Abstract submission and registration can be done online, via the conference webpage at www.ismp2012.org.

Notice that ISMP does not have published proceedings and it is not possible to submit entire papers. But short abstracts of a talks (at most 1200 characters) will appear in the book of abstracts.

IMPORTANT DATES

April 15, 2012: abstract submission deadline
May 15, 2012: notification
June 15, 2012: early registration deadline
August 19, 2012: opening ceremony at Konzerthaus am Gendarmenmarkt

PLENARY and SEMI-PLENARY SPEAKERS

Nikhil Bansal, TU Eindhoven
Richard G. Baraniuk, Rice University
Dimitris Bertsimas, Massachusetts Institute of Technology
Xiaojun Chen, Hong Kong Polytechnic University
Michael P. Friedlander, University of British Columbia
Jorge Nocedal, Northwestern University
Teemu Pennanen, King's College London
Amin Saberi, Stanford University
Claudia Sagastizabal, CEPEL, Rio de Janeiro
Katya Scheinberg, Lehigh University
Christof Schütte, Freie Universität Berlin
Rekha R. Thomas, University of Washington
Robin Thomas, Georgia Institute of Technology
Rakesh V. Vohra, Northwestern University
Robert Weismantel, ETH Zürich

HISTORICAL LECTURES

In addition to the scientific program ISMP 2012 will offer an extensive coverage of the history of optimization. Five special history lectures are scheduled reporting on work of Euler, Leibniz, Weierstrass, Minkowski, and the inventor of the electronic computer Konrad Zuse. Every ISMP participant will receive a free gift, a hard cover book, edited by Martin Groetschel, with about 50 short stories on optimization history. Experts will provide answers to questions such as "Who invented interior point algorithms or the simplex algorithm?", "Was the TSP invented by an archeologist?",
or "What does the cold war have to do with the maximum principle?"

CONFERENCE VENUE

The Symposium will take place at the main building of TU Berlin (Str. des 17. Juni 135, 10623 Berlin) in the heart of the city close to the Tiergarten park.

The opening ceremony will take place on Sunday, August 19, 2012, at the Konzerthaus on the historic Gendarmenmarkt which is considered one of the most beautiful squares in Europe. The opening session will feature the presentation of awards by the Mathematical Optimization Society accompanied by symphonic music. This is followed by the welcome reception with a magnificent view on Gendarmenmarkt.

The conference dinner will take place at the Haus der Kulturen der Welt ("House of the Cultures of the World") located in the Tiergarten park with a beer garden on the shores of the Spree river and a view on the German Chancellery.

SYMPOSIUM ON DISCRETE MATHEMATICS

Prior to ISMP 2012, on August 17-18, the Symposium on Discrete Mathematics 2012 (biannual meeting of "Fachgruppe Diskrete Mathematik" of the German Mathematical Society), will take place at TU Berlin. The main speakers are: Sylvia Boyd (University of Ottawa), Michel X. Goemans (MIT), Michael Krivelevich (Tel Aviv University), Angelika Steger (ETH Zürich), and Günter M. Ziegler (FU Berlin). For more information see www3.math.tu-berlin.de/dm/symposium2012.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] JOBS: 2 x 5 year Postdoc Positions - Game theory, Complexity, Logic - Oxford University, UK

################################################################
Two x 5 Year Research Positions - Logic, Game Theory, Complexity

Department of Computer Science, University of Oxford, UK

DEADLINE FOR APPLICATIONS: 12 noon on 27th APRIL 2012
################################################################

Two Research Assistant positions are available, based in the
Department of Computer Science at the University of Oxford, to work on
investigating the formal/automated analysis of computer programs in
the presence of self-interested behaviour.

The posts are attached to the ERC Advanced Grant "Reasoning about
Computational Economies" (RACE), recently obtained by Professor
Michael Wooldridge, who will join the University of Oxford on 1 June
2012.  The overall aim of the project is to develop the theory and
tools required to understand how computer programs behave in the
presence of self-interested behaviour.  It is anticipated that
techniques from game theory, logic, and computational complexity will
be used for this purpose.  The main duties of both posts will be to
carry out research on this topic and to produce high-quality research
publications.

Applicants for both posts should hold a relevant doctoral degree as
well as relevant research publications.

The posts are available for up 5 years from 1 June 2012, and have a
salary on the University grade 07 salary scale (currently £29,249 to
£35,938 p.a.).

################################################################
INFORMAL ENQUIRIES
################################################################

Informal enquiries are welcome and should be directed to
Prof Wooldridge (mailto:mjw@cs.ox.ac.uk).

################################################################
HOW TO APPLY
################################################################

Further details of the post, including the selection criteria and
method of application are available from:

       http://tinyurl.com/6qvzubg

The closing date for applications is:

        *12 noon on 27th April 2012**

Interviews are expected to take place in early/mid May 2012.

################################################################
AN EQUAL OPPORTUNITY EMPLOYER
################################################################

The policy and practice of the University of Oxford require that all
staff are offered equal opportunities within employment. Entry into
employment with the University and progression within employment will
be determined only by personal merit and the application of criteria
which are related to the duties of each particular post and the
relevant salary structure. In all cases, ability to perform the job
will be the primary consideration. Subject to statutory provisions, no
applicant or member of staff will be treated less favourably than
another because of his or her age, sex, marital or civil partnership
status, sexual orientation, religion or belief, racial group, or
disability.

--
******  NOTE NEW AFFILIATION, EFFECTIVE 1 JUNE 2012  ******

Michael Wooldridge
Department of Computer Science
University of Oxford                 tel (+44 7540) 845 345
Oxford OX1 3QD, UK                   mailto:mjw@cs.ox.ac.uk
**********************************************************
*
* 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] MFCS 2012 Call for papers

CALL FOR PAPERS - MFCS 2012
August 27 - 31, 2012, Bratislava, Slovakia
www.mfcs.sk

The series of MFCS symposia, organized in rotation by Poland, Slovakia,
and the Czech Republic since 1972, has a long and well-established
tradition. The MFCS symposia encourage high-quality research in all
branches of theoretical computer science. Their broad scope provides an
opportunity to bring together researchers who do not usually meet at
specialized conferences.

======================================
IMPORTANT DATES
Submission deadline: April 20, 2012
Acceptance notification: June 5, 2012
Final version: June 17, 2012
Conference: August 27 - 31, 2012
======================================

INVITED SPEAKERS
Georg Gottlob (U. Oxford)
Rolf Niedermeier (TU Berlin)
Antonino Salibra (U. Venice)
Nicole Schweikardt (Goethe U. Frankfurt)
Esko Ukkonen (U. Helsinki)
Igor Walukiewicz (U. Bordeaux)
Gerhard J. Woeginger (TU Eindhoven)
Mihalis Yannakakis (Columbia U.)
========================================

MORE INFO at www.mfcs.sk
========================================
**********************************************************
*
* 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/
*
**********************************************************

Graph Drawing 2012, Call for Papers

===========================================================================

Call for Papers

GD 2012
20th International Symposium on Graph Drawing

September 19-21, 2012 - Redmond, Washington, USA

http://www.gd2012.org/
===========================================================================

Graph Drawing is concerned with the visualization of graphs and networks.
It is motivated by those application domains where it is crucial to visually
analyze and interact with relational datasets. Examples of such application
domains include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
software engineering. Bridging the gap between theoretical advances and
system implementations is therefore a key factor of Graph Drawing.

The International Symposium on Graph Drawing is the main annual event in
this area. This year the conference celebrates its 20th anniversary. It
will take place on September 19-21, 2012, and will be hosted by Microsoft
Research in Redmond, Washington, USA. Researchers and practitioners working
on any aspect of graph drawing are invited to contribute papers and posters,
and participate in the graph drawing contest.

PAPERS
------

Submitted papers must describe original research of theoretical or practical
significance to graph drawing. This year, for the first time, the call for
papers is split into two distinct tracks. Each paper must be submitted in one
of the two tracks. Papers submitted to one track will not compete with papers
submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs

Track 2: Visualization systems and interfaces
---------------------------------------------

This track is mainly devoted to practical aspects of graph drawing, such as the
development of graph visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to) the following:
* Visualization of graphs and networks in application areas
(e.g., social sciences, biology, geography, software engineering, circuit
design, business intelligence)
* Software systems for graph visualization
* Interfaces for interacting with graphs
* Benchmarks and experimental analysis for graph visualization systems and
user interfaces
* Cognitive studies on graph drawing readability and user interaction

All papers must be submitted in the single-spaced LNCS style. Each submission
may be either long (up to 12 pages) or short (up to 6 pages). The claims of the
paper should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page limits,
the authors should include it in a clearly marked appendix, whose length is not
constrained.

POSTERS
-------

Submissions of posters on graph drawing and related areas are also solicited.
The poster session will provide a forum for the communication of late-breaking
research results (which may also appear elsewhere) to the graph drawing community.
Posters should be accompanied by an abstract (up to 2 pages in the single-spaced
LNCS style).

CONTEST
-------

Entertainment during the conference will be provided by the graph drawing game
contest. We call for submissions in this contest: Develop a game that is playable,
relevant to graph drawing, and fun. A team of experts will judge the relevance of
the game to graph drawing, while conference attendees, whom we invite to test and
play all games, will judge the fun factor. We will provide further details on the
conference Web site.

PUBLICATION AND AWARDS
----------------------

Accepted papers and abstracts of accepted posters will appear in the conference
proceedings, published by Springer in the series Lecture Notes in Computer Science.
Selected papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications. Best paper awards for each of the two tracks
will be given. Details will be provided on the conference Web site.

IMPORTANT DATES
---------------

Paper submission deadline: June 8
Notification of paper acceptance: July 17
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 18
Symposium on Graph Drawing: September 19-21

All deadlines are 23:59 PDT and fixed. There will be no extensions.

INVITED SPEAKERS
----------------

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

Daniel Archambault, UCD, Dublin
Markus Chimani, Friedrich-Schiller-Univ., Jena
Sabine Cornelsen, University of Konstanz
Walter Didimo (co-chair), University of Perugia
David Eppstein, University of California, Irvine
Jean-Daniel Fekete, INRIA
Emden Gansner, AT&T
Seok-Hee Hong, University of Sydney
Michael Kaufmann, University of Tübingen
Stephen Kobourov, University of Arizona
Jan Kratochvil, Charles University of Prague
Marc van Kreveld, Utrecht University
Anna Lubiw, University of Waterloo
Guy Melançon, Université Bordeaux I
Yoshio Okamoto, JAIST
Maurizio Patrignani (co-chair), Roma Tre University
Nathalie Henry Riche, Microsoft Research
Ioannis G. Tollis, FORTH-ICS and Univ. of Crete
Christian Tominski, University of Rostock
Géza Tóth, Hungarian Academy of Sciences
Jarke J. van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg
Xiaoru Yuan, Peking University

ORGANIZING COMMITTEE
--------------------

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia

SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

yWorks

[DMANET] Graph Drawing 2012, Call for Papers

===========================================================================

Call for Papers

GD 2012
20th International Symposium on Graph Drawing

September 19-21, 2012 - Redmond, Washington, USA

http://www.gd2012.org/
===========================================================================

Graph Drawing is concerned with the visualization of graphs and networks.
It is motivated by those application domains where it is crucial to visually
analyze and interact with relational datasets. Examples of such application
domains include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
software engineering. Bridging the gap between theoretical advances and
system implementations is therefore a key factor of Graph Drawing.

The International Symposium on Graph Drawing is the main annual event in
this area. This year the conference celebrates its 20th anniversary. It
will take place on September 19-21, 2012, and will be hosted by Microsoft
Research in Redmond, Washington, USA. Researchers and practitioners working
on any aspect of graph drawing are invited to contribute papers and posters,
and participate in the graph drawing contest.

PAPERS
------

Submitted papers must describe original research of theoretical or practical
significance to graph drawing. This year, for the first time, the call for
papers is split into two distinct tracks. Each paper must be submitted in one
of the two tracks. Papers submitted to one track will not compete with papers
submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs

Track 2: Visualization systems and interfaces
---------------------------------------------

This track is mainly devoted to practical aspects of graph drawing, such as the
development of graph visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to) the following:
* Visualization of graphs and networks in application areas
(e.g., social sciences, biology, geography, software engineering, circuit
design, business intelligence)
* Software systems for graph visualization
* Interfaces for interacting with graphs
* Benchmarks and experimental analysis for graph visualization systems and
user interfaces
* Cognitive studies on graph drawing readability and user interaction

All papers must be submitted in the single-spaced LNCS style. Each submission
may be either long (up to 12 pages) or short (up to 6 pages). The claims of the
paper should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page limits,
the authors should include it in a clearly marked appendix, whose length is not
constrained.

POSTERS
-------

Submissions of posters on graph drawing and related areas are also solicited.
The poster session will provide a forum for the communication of late-breaking
research results (which may also appear elsewhere) to the graph drawing community.
Posters should be accompanied by an abstract (up to 2 pages in the single-spaced
LNCS style).

CONTEST
-------

Entertainment during the conference will be provided by the graph drawing game
contest. We call for submissions in this contest: Develop a game that is playable,
relevant to graph drawing, and fun. A team of experts will judge the relevance of
the game to graph drawing, while conference attendees, whom we invite to test and
play all games, will judge the fun factor. We will provide further details on the
conference Web site.

PUBLICATION AND AWARDS
----------------------

Accepted papers and abstracts of accepted posters will appear in the conference
proceedings, published by Springer in the series Lecture Notes in Computer Science.
Selected papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications. Best paper awards for each of the two tracks
will be given. Details will be provided on the conference Web site.

IMPORTANT DATES
---------------

Paper submission deadline: June 8
Notification of paper acceptance: July 17
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 18
Symposium on Graph Drawing: September 19-21

All deadlines are 23:59 PDT and fixed. There will be no extensions.

INVITED SPEAKERS
----------------

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

Daniel Archambault, UCD, Dublin
Markus Chimani, Friedrich-Schiller-Univ., Jena
Sabine Cornelsen, University of Konstanz
Walter Didimo (co-chair), University of Perugia
David Eppstein, University of California, Irvine
Jean-Daniel Fekete, INRIA
Emden Gansner, AT&T
Seok-Hee Hong, University of Sydney
Michael Kaufmann, University of Tübingen
Stephen Kobourov, University of Arizona
Jan Kratochvil, Charles University of Prague
Marc van Kreveld, Utrecht University
Anna Lubiw, University of Waterloo
Guy Melançon, Université Bordeaux I
Yoshio Okamoto, JAIST
Maurizio Patrignani (co-chair), Roma Tre University
Nathalie Henry Riche, Microsoft Research
Ioannis G. Tollis, FORTH-ICS and Univ. of Crete
Christian Tominski, University of Rostock
Géza Tóth, Hungarian Academy of Sciences
Jarke J. van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg
Xiaoru Yuan, Peking University

ORGANIZING COMMITTEE
--------------------

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia

SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

yWorks
**********************************************************
*
* 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/
*
**********************************************************

The Turing Centenary Conference in Manchester: 2nd Call for Papers and Call For Participation

THE TURING CENTENARY CONFERENCE
Manchester, UK, June 22-25, 2012
http://www.turing100.manchester.ac.uk/

Second announcement, call for submissions and call for participation.

Features:

(1) Ten Turing Award winners, a Templeton Award winner and
Garry Kasparov as invited speakers
(2) GBP 20,000 worth best paper award program, including
GBP 5,000 best paper award
(3) Two panels and two public lectures
(4) Turing Fellowship award ceremony
(5) Computer chess programme
(6) Competition of programs proving theorems
(7) and many more ...

For more details please check
http://www.turing100.manchester.ac.uk/.

Note that the registration is now open.

SPEAKERS

Confirmed invited speakers:

- Fred Brooks (University of North Carolina)
- Rodney Brooks (MIT)
- Vint Cerf (Google)
- Ed Clarke (Carnegie Mellon University)
- Jack Copeland (University of Canterbury, New Zealand)
- George Francis Rayner Ellis (University of Cape Town)
- David Ferrucci (IBM)
- Tony Hoare (Microsoft Research)
- Garry Kasparov (Kasparov Chess Foundation)
- Samuel Klein (Wikipedia)
- Don Knuth (Stanford University)
- Yuri Matiyasevich (Institute of Mathematics, St. Petersburg)
- Hans Meinhardt (Max-Planck Institute for Developmental Biology)
- Roger Penrose (University of Oxford)
- Adi Shamir (Weizmann Institute of Science)
- Michael Rabin (Harvard University)
- Leslie Valiant (Harvard University)
- Manuela M. Veloso (Carnegie Mellon University)
- Andrew Yao (Tsinghua University)

Confirmed panel speakers:

- Ron Brachman (Yahoo Labs)
- Steve Furber (The University of Manchester)
- Carole Goble (The University of Manchester)
- Pat Hayes (Institute for Human and Machine Cognition, Pensacola)
- Bertrand Meyer (Swiss Federal Institute of Technology)
- Moshe Vardi (Rice University)

SUBMISSIONS:

The Turing Centenary Conference will include invited talks and a
poster session. Submissions are sought in several areas of computer
science, mathematics and biology.

Submissions of two kinds are welcome:

- Regular papers
- Research reports

All submitted papers must be in the PDF format and between 3 and 15
pages long. All submissions will be evaluated by the programme
committee. Submission is through the EasyChair system,
https://www.easychair.org/conferences/?conf=turing100.

Regular papers must include original work not submitted before or
during the Turing-100 reviewing period to any other event with
published proceedings or a journal. All submitted regular papers will
be considered eligible for the best paper awards.

Research reports can contain work in progress and/or be based on
previously submitted work. They will not be eligible for the best
paper awards.

*** Areas ***

Submissions are welcome in all areas of computer science, mathematics
and biology listed below:

- computation theory
- logic in computation
- artificial intelligence
- social aspects of computation
- models of computation
- program analysis
- mathematics of evolution and emergence
- knowledge processing
- natural language processing
- cryptography
- machine learning
- cognitive science
- mathematical biology

*** Schedule and conference proceedings ***

The submission deadline is April 16. All submissions will be evaluated
by the programme committee. Authors will be notified by acceptance or
rejection on or before May 1st. At least one author of every accepted
paper must register for the conference, attend it and present the
paper at the poster session. All accepted papers will be published in
the conference proceedings and available at the conference. The
instructions on preparing final versions for the proceedings will
appear on the Turing-100 Web site.

*** Submissions and Best paper awards ***

A subset of accepted regular papers will be selected by the programme
committee for the second round of reviewing. The authors of the
selected papers will be invited to submit revised versions of their
papers by May 16. The programme committee will make decisions on best
paper awards by June 14. All papers receiving the award will be
published in a book dedicated to the conference and published after
the conference. This book will also contain some papers by invited and
panel speakers.

In the case of doubts about the relevance of your paper to the
conference and for all other queries please contact programme chair
Andrei Voronkov at andrei@voronkov.com.

See http://www.turing100.manchester.ac.uk/index.php/submission
for more details.

BEST PAPER AWARDS:

A subset of poster session submissions will be selected as
candidates for best paper awards:

- The best paper award of GBP 5,000
- The best young researcher best paper award of GBP 3,000
- The second best paper award of GBP 2,500
- The second best young researcher best paper award of GBP 1,500
- Sixteen (16) awards of GBP 500 each

See http://www.turing100.manchester.ac.uk/index.php/submission/bestpaper
for more details.

REGISTRATION:

The number of participants is limited. Register early to avoid
disappointment! To register, access
https://www.easychair.org/conferences/?conf=turing100 and click on
"Registration".

*** Registration fees ***

All fees are in Pound Sterling.

early (on or before May 3) late (May 4 or later)
Student 280 330
Regular 380 450

To qualify for a student registration you must be a full-time student
on June 23, 2012.

The registration fees include

- Attendance of sessions
- Conference reception
- Conference dinner
- Coffee breaks and lunches
- Poster session proceedings

There will be a travel support programme for students and attendees
from countries where getting funding for travel is hardly possible.

For more details about registration check
http://www.turing100.manchester.ac.uk/index.php/registration.

DATES:

April 16: Poster session submission deadline
May 1: Poster session notification and selection of
candidates for awards
May 15: Final versions of poster session papers
May 16: Submission of full versions of papers selected for awards
June 14: Best paper award decisions
June 22-25: Conference
July 15: Final versions of papers selected for awards

CHAIRS:

Honorary Chairs:
Rodney Brooks (MIT)
Roger Penrose (Oxford)
Conference Chairs:
Matthias Baaz (Vienna University of Technology)
Andrei Voronkov (The University of Manchester)
Turing Fellowships Chair:
Barry Cooper (University of Leeds)
Theorem Proving Competition Chair:
Geoff Sutcliffe (University of Miami)
Programme Chair
Andrei Voronkov (The University of Manchester)

[DMANET] Post-Doc Position (1 Year) on Robust Mixed Integer Programming

The Discrete Optimization Group of the Department of Mathematics at
RWTH Aachen University (Germany) welcomes applications for a
fully-funded one-year Post-Doc position in mathematical optimization,
covered by a google research grant.

Models of real-life problems are often confronted with noisy,
incomplete, or erroneous data. In this project, the robust
optimization approach will be studied to deal with such
uncertainties. For linear programming, this approach is extensively
studied, but for robust mixed integer programming (RoMIP) additional
efforts are required to reach useful solutions. The project aims to
study fundamental structures (knapsacks, packings, coverings) of
RoMIPs will be studied to solve these problems to optimality. In
addition this research will provide a base to study recoverable robust
mixed integer programming, a robust adaption of two-stage stochastic
programming. Further details can be provided upon request.

The ideal candidate should combine previous expertise in mathematical
programming in theory (polyhedral combinatorics) and practice
(experience with software libraries like cplex, gurobi, and scip). A
qualified Ph.D. degree in mathematics, computer science or a related
discipline is required.

The position is full-time and for one year. The position is open
immediately; the starting date is negotiable. Salary is according to
the German TV-L E13 tariff (starts at about 3100 Euros/month
gross). Depending on the project's success, a grant application for a
second year is possible.

The Discrete Optimization Group at RWTH Aachen University currently
consists of one professor and 4 PhD students working on (closely)
related topics like integer programming, telecommunication network
design under demand uncertainties, and the optimal design of power
grids.

Please send your application in a single PDF file containing an
academic CV, list of publications, letter of motivation, the names of
two references, and any other supporting material no later than

April 20, 2012

to

Prof. Dr. Arie Koster
koster@math2.rwth-aachen.de

Questions can be directed to the same address anytime.

--
Prof. Dr. Arie M.C.A. Koster
RWTH Aachen University
Lehrstuhl II für Mathematik
Wüllnerstr. 5b
D-52056 Aachen
E: koster@math2.rwth-aachen.de
W: http://www.math2.rwth-aachen.de/~koster/
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct)
F: +49 (0)241 80-92136

**********************************************************
*
* 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/
*
**********************************************************

Postdoc position in algorithmic bioinformatics

Postdoctoral Researcher position
--------------------------------------------

Department of Computer Science at the University of Helsinki is inviting applications for a postdoctoral researcher position. The field of the study is algorithmic bioinformatics in the context of the research group Genome-scale algorithmics that is part of Finnish Centre of Excellence in Cancer Genetics Research starting 2012.  The research group conducts research e.g. in space-efficient index structures for genomes, high-throughput sequencing data analysis, and fragment assembly, see http://www.cs.helsinki.fi/gsa/.

An appointee to the position of post-doctoral researcher shall hold a doctoral degree.  Also candidates expecting to obtain the doctoral degree in near future are encouraged to apply. An ideal candidate would have earlier studies and research in algorithmic problems relevant to bioinformatics and high motivation to contribute to the fields of molecular biology and biomedicine through novel computational approaches.

The salary will be based on rules of the salary system applied in Finnish universities, and can currently range between 2 780 and 4 070 euros. The start date and length of the contract (between 1-2 years) are negotiable.

The applicants are requested to enclose with their application a CV (containing list of publications), a transcript of studies / copy of diploma, contact information of 2 people willing to give references, and a letter of motivation. Applications should be addressed to the Head of Department at rekry.genome[at]cs.helsinki.fi. The closing date for applications is Friday, 20th April 2012.

More details of the position can be found at http://www.helsinki.fi/recruitment/index.html?id=55013 and by contacting Professor Veli Mäkinen, +358 9 191 51281, veli.makinen[at]cs.helsinki.fi.

[DMANET] MIP 2012: POSTER SUBMISSION DEADLINE EXTENSION

*** MIP 2012: POSTER SUBMISSION DEADLINE EXTENSION ***

Date: July 16–19 , 2012
Location: UC Davis, Davis, CA
Web site: http://www.math.ucdavis.edu/mip2012
Poster submission deadline: April 15, 2012
Registration Opens: March 29, 2012

You are cordially invited to submit abstracts for poster presentations
in the upcoming workshop in Mixed Integer Programming (MIP 2012).
The 2012 Mixed Integer Programming workshop will be the ninth in a
series of annual workshops held in North America designed to bring
the integer programming community together to discuss very recent
developments in the field. The workshop is especially focused on
providing opportunities for junior researchers to present their most recent
work. The workshop series consists of a single track of invited talks.

Confirmed speakers:

Shabbir Ahmed, Georgia Tech
Gennadiy Averkov, Otto-von-Guericke-Universität Magdeburg
Sam Burer, The University of Iowa
Philipp Christophel, SAS
Jesús A. De Loera, University of California, Davis
Alberto Del Pia, ETH Zurich
Friedrich Eisenbrand, EPFL
Ricardo Fukasawa, University of Waterloo
Vineet Goyal, Columbia University
Marcos Goycoolea, Universidad Adolfo Ibañez
Yongpei Guan, University of Florida
Volker Kaibel, Otto-von-Guericke-Universität Magdeburg
Kiavash Kianfar, Texas A&M University
Mustafa Kilinc, University of Pittsburgh
Fatma Kilinc-Karzan, Carnegie Mellon University
David Morton, The University of Texas at Austin
Ted Ralphs, Lehigh University
Edward Rothberg, Gurobi Optimization
Siqian Shen, University of Michigan
Renata Sotirov, Tilburg University
Dan Steffy, ZIB and Oakland University
Alejandro Toriello, University of Southern California
Christian Wagner, ETH Zurich

In addition to the invited talks, there will be a poster session for
which we invite all participants to submit an abstract. To submit an
abstract, please email a 2 page PDF containing your abstract to
mip2012@math.ucdavis.edu by April 15. Space for posters may be limited,
and we may not be able to accommodate all posters; we expect to send
out notifications by April 30 or earlier.

The workshop is designed to provide ample time for discussion and
interaction between the participants, as one of its aims is to
facilitate research collaboration. Thanks to the generous support by
our sponsors, registration is free, and travel support is available for
students and postdocs presenting posters. If you would like to apply
for travel support please note this in your abstract submission.
We expect to make funding decisions by April 30.

Finally, we note that this year we will have a best poster award given
at the workshop. Barring conflicts of interest, all presented posters
will be automatically eligible for the award.

See you in Davis!

Sincerely,

Claudia D'Ambrosio, CNRS École Polytechnique
Matthias Köppe, UC Davis
Jim Luedtke, University of Wisconsin-Madison
François Margot, Carnegie Mellon University
Juan Pablo Vielma , University of Pittsburgh

(MIP 2012 Organizing Committee, mip2012@math.ucdavis.edu)

**********************************************************
*
* 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/
*
**********************************************************

Call for participation: FLOPS 2012

CALL FOR PARTICIPATION: FLOPS 2012
==================================

Eleventh International Symposium on Functional and Logic Programming
May 23-25, 2012
Takikawa Memorial Hall, Kobe University,
Kobe, Japan
http://www.org.kobe-u.ac.jp/flops2012/
*Early Registration: April 25 (Wed)*

FLOPS is a forum for research on all issues concerning declarative
programming, including functional programming and logic programming,
and aims to promote cross-fertilization and integration between the
two paradigms.

The 23rd International Conference on Rewriting Techniques and
Applications (RTA 2012) and satellite workshops including WFLP 2012
will be held in the week after FLOPS at Nagoya, Japan.

Invited Speakers @ FLOPS
================
- Tachio Terauchi (Graduate School of Information Science, Nagoya
University).
Automated Verification of Higher-order Functional Programs
- Michael Codish (Department of Computer Science, Ben-Gurion
University of the Negev).
Programming with Boolean Satisfaction
- Stephanie Weirich (School of Engineering and Applied Science,
University of Pennsylvania).
Dependently-typed programming in GHC

See the full program at http://www.org.kobe-u.ac.jp/flops2012/program.html

Register now at
http://www.org.kobe-u.ac.jp/flops2012/index.html#REGISTRATION

CONFERENCE ORGANIZERS

GENERAL CHAIR
=============
- Naoyuki Tamura (Kobe University, Japan)

PROGRAM CO-CHAIRS
=================
- Tom Schrijvers (Ghent University, Belgium)
- Peter Thiemann (University of Freiburg, Germany)

CONFERENCE SPONSORS
===================
- Japan Society for Software Science and Technology (JSSST) SIGPPL
- Information Science and Technology Center, Kobe University

IN COOPERATION WITH
===================
- ACM SIGPLAN
- Asian Association for Foundation of Software (AAFS)
- Association for Logic Programming (ALP)

[DMANET] PostDoc position available at ULB, Brussels, Belgium

---
PostDoc position available at Universite Libre de Bruxelles (ULB),
Brussels, Belgium

The position is for a period of 12 months and can start as soon as
September 2012. Research will be conducted within the Algorithms Group
(http://www.ulb.ac.be/di/algo/), in the framework of the euroGIGA
ComPoSe project (http://eurogiga-compose.eu/about.php).

Candidates are expected to have expertise in discrete and
computational geometry, although applications from specialists in
combinatorics, discrete applied mathematics, or algorithms and data
structures are welcome too.

Applications (cover letter and CV) should be sent to Jean Cardinal
<jcardin@ulb.ac.be> or Stefan Langerman <slanger@ulb.ac.be>.
---
**********************************************************
*
* 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/
*
**********************************************************

WADT 2012: Final Call for Papers

(We apologize for multiples copies)

======================================================================
FINAL CALL FOR PAPERS

WADT 2012
21st International Workshop on Algebraic Development Techniques
http://maude.sip.ucm.es/wadt2012
June 7-10, 2012, Salamanca, Spain
======================================================================

AIMS AND SCOPE
The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems).
The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends.

TOPICS OF INTEREST
Typical, but not exclusive topics of interest are:
- Foundations of algebraic specification
- Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing
- Specification languages, methods, and environments
- Semantics of conceptual modelling methods and techniques
- Model-driven development
- Graph transformations, term rewriting and proof systems
- Integration of formal specification techniques
- Formal testing and quality assurance, validation, and verification

WORKSHOP FORMAT AND LOCATION
The workshop will take place over four days, Thursday to Sunday, at Colegio Mayor Arzobispo Fonseca in the center of Salamanca. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers.

INVITED SPEAKERS
Roberto Bruni. Universita di Pisa, Italy
Francisco Duran. Universidad de Malaga, Spain
Kim G. Larsen. Aalborg University, Denmark

IMPORTANT DATES
Submission deadline for abstracts: April 2, 2012
Notification of acceptance: April 20, 2012
Final abstract due: May 18, 2012
Workshop in Salamanca: June 7-10, 2012

SUBMISSIONS
The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected on the basis of the submitted abstracts according to originality, significance, and general interest.
The abstracts have to be submitted electronically according to the instructions published on the workshop homepage.

PROCEEDINGS
The final versions of the selected abstracts will be included in a flash drive for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which will be published as a volume of Lecture Notes in Computer Science (Springer).

SPONSORSHIP
The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, Universidad Complutense de Madrid, Universidad de Salamanca, Ministerio de Economia y Competitividad, and IMDEA Software.

WADT STEERING COMMITTEE
Michel Bidoit (France)
Andrea Corradini (Italy)
Jose Fiadeiro (UK)
Rolf Hennicker (Germany)
Hans-Jorg Kreowski (Germany)
Till Mossakowski (Germany) [chair]
Fernando Orejas (Spain)
Francesco Parisi-Presicce (Italy)
Grigore Rosu (United States)
Andrzej Tarlecki (Poland)

ORGANIZING COMMITTEE
Narciso Marti Oliet (Spain)
Miguel Palomino Tarjuelo (Spain)
Gustavo Santos Garcia (Spain)

CONTACT INFORMATION
Email: wadt2012 at fdi.ucm.es
Homepage: http://maude.sip.ucm.es/wadt2012

[DMANET] IEEE PST 2012, Deadline Approaching (March 31), 10th Annual Conference on Privacy, Security and Trust

[Apologies if you receive multiple copies of this message]

***Deadline March 31, 2012***

Call For Papers PST 2012

10th Annual Conference on Privacy, Security and Trust
(technically co-sponsored by IEEE Computer Society)
PST 2012
Paris, France, July 16-18, 2012

http://www.unb.ca/pstnet/pst2012

The PST2012 International Conference on Privacy, Security and Trust
(PST) is being held in Paris, France, July 16-18, 2012. PST2012 is the
tenth such annual conference focusing on PST technologies. PST2012
provides a forum for researchers world-wide to unveil their latest
work in privacy, security and trust and to show how this research can
be used to enable innovation.

PST2012 will include one day of tutorials followed by two days of
high-quality research papers whose topics include, but are NOT limited
to, the following:

- Privacy Preserving / Enhancing Technologies
- Critical Infrastructure Protection
- Network and Wireless Security
- Operating Systems Security
- Intrusion Detection Technologies
- Secure Software Development and Architecture
- PST Challenges in e-Services
- Network Enabled Operations
- Digital forensics
- Information Filtering, Data Mining and Knowledge from Data
- National Security and Public Safety
- Security Metrics
- Recommendation, Reputation and Delivery Technologies
- Continuous Authentication
- Trust Technologies for Building Trust in e-Business Strategy
- Observations of PST in Practice, Society, Policy and Legislation
- Digital Rights Management
- Identity and Trust management
- PST and Cloud Computing
- Human Computer Interaction and PST
- Implications of, and Technologies for, Lawful Surveillance
- Biometrics, National ID Cards, Identity Theft
- PST and Web Services / SOA
- Privacy, Traceability, and Anonymity
- Trust and Reputation in Self-Organizing Environments
- Anonymity and Privacy vs. Accountability
- Access Control and Capability Delegation
- Representations and Formalizations of Trust

* Submissions Guidelines:

High-quality papers in all PST related areas that, at the time of
submission, are not under review and have not already been published
or accepted for publications elsewhere are solicited. Accepted papers
will be accepted as 'regular' papers up to 8 pages and with oral
presentations, or 'short' papers of up to 2 pages with poster
presentations. Up to 2 additional pages will be allowed in each
category with over-length charges. The standard IEEE two-column
conference format should be used for all submissions. A copy of the
IEEE Manuscript Templates for Microsoft Word or LaTeX and additional
information about paper submission and conference topics and events
can be found at the conference web site. All accepted papers will be
published in the conference proceedings and by IEEE and will be
accessible via IEEE Xplore Digital Library.

Best Paper and Best Student Paper awards will be presented. Some
travel grants to students who are presenting their work in the
conference will also be made available.

Important Dates:
- Submission Deadline: March 31, 2012
- Notification of Acceptance: May 7, 2012
- Final Manuscript Due: May 21, 2012

Visit http://www.unb.ca/pstnet/pst2012/ for further information.

**********************************************************
*
* 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] Computational Optimization

[Please post - apologies for multiple copies.]

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

Call for Papers

5th Workshop on Computational Optimization (WCO 2012)
Wroclaw, Poland, September 9 - 12, 2012

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2012

http://www.fedcsis.org/

====================

We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:

* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc

====================

Important dates:

22.04.2012 (April 22, 2012) – Full paper submission

17.06.2011 (June 17, 2012) – Notification of acceptance

8.07.2012 (July 8, 2012) – Camera-ready version of the accepted paper
and registration

====================

Submission and Publication

* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Studies of Computational
Intelligence of Springer.
====================

If you have any question do not hesitate to send a mail to wco2012@fedcsis.org .

Organizing Committee

Stefka Fidanova, Bulgaria
Josef Tvrdik, Czech Republicc
Daniela Zaharie, Romania
Antonio Mucherino, France

--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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/
*
**********************************************************

Call for Papers: SSS 2012 in Toronto

- Call for Papers: SSS 2012 -

 

14th International Symposium on Stabilization, Safety, and Security

of Distributed Systems

 

October 1-4, 2012

Toronto, Canada

 

http://www.cs.uwaterloo.ca/sss2012/

 

The SSS symposium is a prestigious international forum for researchers and

practitioners in the design and development of fault-tolerant distributed

systems with self-* properties, such as self-stabilizing, self-configuring,

self-organizing, self-managing, self-repairing, self-healing, self-optimizing,

self-adaptive, and self-protecting systems. Research in distributed systems is now

at a crucial point in its evolution, marked by the importance of dynamic

systems such as cloud networks, social networks, peer-to-peer networks, large-scale

wireless sensor networks, mobile ad hoc networks, etc., and many new applications such

as grid and web services, banking and e-commerce, e-health and robotics,

aerospace and avionics, automotive, industrial process control, etc. have

joined the traditional applications of distributed systems.

 

The conference provides a wide spectrum of topics, covered in the following

tracks:

* Self-Stabilization

* Ad-Hoc and Sensor Networks

* Fault-Tolerance and Dependable Systems

* Safety and Security

* Cloud Computing

* Formal Methods

* Social Networks

* Peer-to-Peer, Self-Organizing and Autonomic Systems

 

===============

IMPORTANT DATES

===============

 

* Abstract Submission: April 16, 2012

* Paper Submission: April 23, 2012

* Notification: June 6, 2012

 

================

PAPER SUBMISSION

================

 

Papers must be submitted in PDF format and be prepared using the LNCS style.

Detailed instructions for submitting papers will be available later.

Two types of papers can be submitted: Regular Papers and Brief Announcements.

Submissions for regular papers should be no longer than 15 pages

(including the title, authors, abstract, figures, and references) in LNCS

style; a submission may have an appendix of at most two pages beyond the

15 page limit. Brief announcements are restricted to two pages using the

LNCS style, with no appendix. Submissions deviating from these guidelines

will be rejected without consideration of their merits.

If requested by the authors on the submission system, a regular submission

that is not selected for a regular presentation will also be considered for

a brief announcement. Such a request will not affect consideration of the

paper for a regular paper.

A paper submitted at this forum is expected to be original research not

previously published. A contribution can be submitted to one track only and

may not be concurrently submitted to another conference, workshop, or journal.

 

===========

PUBLICATION

===========

 

The proceedings of the conference will be published in the

Springer Verlag Lecture Notes in Computer Science (LNCS) series.

A special journal issue for selected SSS 2012 papers is under negotiation;

please see the website for more information.

 

==================================

BEST PAPER AND BEST STUDENT AWARDS

==================================

 

The program committee will select two papers for best paper and best

student paper awards. A paper is eligible for the best student paper

award if at least one of its authors is a full-time student at the time of

submission, and if the student made a major contribution to the paper.

This must be indicated by marking an appropriate box in

the submission system.

 

============

ORGANIZATION

============

 

General Chair:

 

Sukumar Ghosh, The University of Iowa, USA

 

Program Co-Chairs:

 

Andrea Richa, Arizona State University, USA

Christian Scheideler, University of Paderborn, Germany

 

Program Vice Chairs:

 

Self-Stabilization

Sylvie Delaet, LRI, University of Paris-Sud 11, France

Maria Gradinariu Potop-Butucaru, University of Paris 6, France

 

Ad-Hoc and Sensor Networks

Murat Demirbas, SUNY Buffalo, USA

 

Fault-Tolerant and Dependable Systems

Rida Bazzi, Arizona State University, USA

 

Safety and Security

Felix Freiling, Friedrich-Alexander-University, Germany

 

Cloud Computing

Mohamed Gouda, University of Texas at Austin, USA

 

Formal Methods

Borzoo Bonakdarpour, University of Waterloo, USA

 

Social Networks

Sonja Buchegger, KTH, Sweden

Thorsten Strufe, TU Darmstadt, Germany

 

Peer-to-Peer, Self-Organizing and Autonomic Systems

Fabian Kuhn, University of Lugano, Switzerland / University of Freiburg, Germany

Christian Schindelhauer, University of Freiburg, Germany

 

Local Arrangements:

 

Borzoo Bonakdarpour, University of Waterloo, Canada

Bernard Wong, University of Waterloo, Canada

 

Publicity Chair:

 

Stefan Schmid, TU Berlin / Telekom Innovation Laboratories, Germany

Call for papers APPROX RANDOM 2012

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

APPROX 2012 and RANDOM 2012

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012
16th Intl. Workshop on Randomization and Computation - RANDOM 2012

http://cui.unige.ch/tcs/random-approx/

Aug. 15-17, 2012

M.I.T.

Call for papers

SCOPE

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012

16th Intl. Workshop on Randomization and Computation - RANDOM 2012

The 15th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2012) and the 16th.
International Workshop on Randomization and Computation (RANDOM'2012)
will be held on 15-17 August 2012 at M.I.T.
APPROX'2012 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2012 focus on
applications of randomness to computational and combinatorial problems.
RANDOM'2012 is the sixteenth workshop in the series; APPROX'2012 is the
fifteenth in the series.

TOPICS

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

APPROX

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
game theory, markets, and economic
applications
geometric problems
packing, covering, and scheduling
approximate learning
other applications

RANDOM

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

SUBMISSIONS

Submissions must be received by 17:00pm (EDT) of April 20 at:
http://cui.unige.ch/tcs/random-approx/
in order to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract 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 of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.

PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
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.

IMPORTANT DATES

Submissions: April 20, 2012
Notifications: June 8, 2012
Camera ready: June 18, 2012

PROGRAM COMMITTEES

Approx

Alexandr Andoni (Microsoft Research SVC)
Yossi Azar (Tel-Aviv University)
Shuchi Chawla (University of Wisconsin - Madison)
Anupam Gupta (Carnegie Mellon University, chair)
Sariel Har-Peled (University of Illinois at Urbana-Champaign)
Jochen Koenemann (University of Waterloo)
Amit Kumar (Indian Institute of Technology, Delhi)
Lap Chi Lau (The Chinese University of Hong Kong)
Konstantin Makarychev (IBM Watson)
Monaldo Mastrolilli (IDSIA)
Dana Moshkovitz (MIT)
Rene Sitters (Vrije Universiteit Amsterdam)
David Steurer (Microsoft Research and Cornell)
Kunal Talwar (Microsoft Research SVC)
Jan Vondrak (IBM Almaden)
Lisa Zhang (Alcatel-Lucent Bell Labs)

Random

Eli Ben-Sasson (Technion)
Andrej Bogdanov (Chinese University of Hong Kong)
Mark Braverman (Princeton)
Colin Cooper (King's College, London)
Tobias Friedrich (Saarland University / Max-Planck-Institut)
Tali Kaufman (Bar-Ilan University / Weizmann Institute of Science)
Raghu Meka (Institute for Advanced Study)
Jelani Nelson (Princeton)
Ilan Newman (University of Haifa)
Ryan O'Donnell (Carnegie Mellon University)
Konstantinos Panagiotou (Max-Planck-Institut)
Prasad Raghavendra (Georgia Tech)
Atri Rudra (University at Buffalo, SUNY)
Rocco Servedio (Columbia, chair)
Alistair Sinclair (UC Berkeley)
Emanuele Viola (Northeastern)

PROGRAM CHAIRS

APPROX
Anupam Gupta, Carnegie Mellon University

RANDOM
Rocco Servedio, Columbia University

WORKSHOP CHAIRS

Jose Rolim, U. of Geneva
Klaus Jansen, U. of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

[DMANET] CFP - APPROX RANDOM 2012

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

APPROX 2012 and RANDOM 2012

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012
16th Intl. Workshop on Randomization and Computation - RANDOM 2012

http://cui.unige.ch/tcs/random-approx/

Aug. 15-17, 2012

M.I.T.

Call for papers

SCOPE

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012

16th Intl. Workshop on Randomization and Computation - RANDOM 2012

The 15th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2012) and the 16th.
International Workshop on Randomization and Computation (RANDOM'2012)
will be held on 15-17 August 2012 at M.I.T.
APPROX'2012 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2012 focus on
applications of randomness to computational and combinatorial problems.
RANDOM'2012 is the sixteenth workshop in the series; APPROX'2012 is the
fifteenth in the series.

TOPICS

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

APPROX

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
game theory, markets, and economic
applications
geometric problems
packing, covering, and scheduling
approximate learning
other applications

RANDOM

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

SUBMISSIONS

Submissions must be received by 17:00pm (EDT) of April 20 at:
http://cui.unige.ch/tcs/random-approx/
in order to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract 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 of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.

PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
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.

IMPORTANT DATES

Submissions: April 20, 2012
Notifications: June 8, 2012
Camera ready: June 18, 2012

PROGRAM COMMITTEES

Approx

Alexandr Andoni (Microsoft Research SVC)
Yossi Azar (Tel-Aviv University)
Shuchi Chawla (University of Wisconsin - Madison)
Anupam Gupta (Carnegie Mellon University, chair)
Sariel Har-Peled (University of Illinois at Urbana-Champaign)
Jochen Koenemann (University of Waterloo)
Amit Kumar (Indian Institute of Technology, Delhi)
Lap Chi Lau (The Chinese University of Hong Kong)
Konstantin Makarychev (IBM Watson)
Monaldo Mastrolilli (IDSIA)
Dana Moshkovitz (MIT)
Rene Sitters (Vrije Universiteit Amsterdam)
David Steurer (Microsoft Research and Cornell)
Kunal Talwar (Microsoft Research SVC)
Jan Vondrak (IBM Almaden)
Lisa Zhang (Alcatel-Lucent Bell Labs)

Random

Eli Ben-Sasson (Technion)
Andrej Bogdanov (Chinese University of Hong Kong)
Mark Braverman (Princeton)
Colin Cooper (King's College, London)
Tobias Friedrich (Saarland University / Max-Planck-Institut)
Tali Kaufman (Bar-Ilan University / Weizmann Institute of Science)
Raghu Meka (Institute for Advanced Study)
Jelani Nelson (Princeton)
Ilan Newman (University of Haifa)
Ryan O'Donnell (Carnegie Mellon University)
Konstantinos Panagiotou (Max-Planck-Institut)
Prasad Raghavendra (Georgia Tech)
Atri Rudra (University at Buffalo, SUNY)
Rocco Servedio (Columbia, chair)
Alistair Sinclair (UC Berkeley)
Emanuele Viola (Northeastern)

PROGRAM CHAIRS

APPROX
Anupam Gupta, Carnegie Mellon University

RANDOM
Rocco Servedio, Columbia University

WORKSHOP CHAIRS

Jose Rolim, U. of Geneva
Klaus Jansen, U. of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

**********************************************************
*
* 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] Call for INFORMS OS Prize Nominations, due June 30, 2012

The INFORMS Optimization Society awards four prizes annually at the
INFORMS annual meeting. We seek nominations for each of them, due by
June 30, 2012. Each of the four awards includes a cash amount of US$
1,000 and a citation certificate. The four awards are listed below
with links to more information about them, including detailed
eligibility requirements. For each award, nominations and inquiries
should be sent directly via email to the chair of the corresponding
prize committee.

Khachiyan Prize
* Awarded for outstanding lifetime contributions to the field of
optimization by an individual or team.
* 2012 Committee Chair: Kurt Anstreicher (kurt-anstreicher@uiowa.edu)
* http://www.informs.org/Community/Optimization-Society/Optimization-Society-Prizes/Khachiyan-Prize

Farkas Prize
* Awarded for outstanding contributions by a mid-career researcher to
the fi eld of optimization, over the course of their career.
* 2012 Committee Chair: David Shmoys (shmoys@cs.cornell.edu)
* http://www.informs.org/Community/Optimization-Society/Optimization-Society-Prizes/Farkas-Prize

Prize for Young Researchers
* Awarded to one or more young researcher(s) for an outstanding paper
in optimization that is submitted to and accepted, or published in a
refereed professional journal.
* 2012 Committee Chair: Endre Boros (Endre.Boros@rutcor.rutgers.edu)
* http://www.informs.org/Community/Optimization-Society/Optimization-Society-Prizes/Young-Researchers

Student Paper Prize
* Awarded to one or more student(s) for an outstanding paper in
optimization that is submitted to and received or published in a
refereed professional journal within three calendar years preceding
the year of the award.
* 2012 Committee Chair: Katya Scheinberg (katyas@lehigh.edu)
* http://www.informs.org/Community/Optimization-Society/Optimization-Society-Prizes/Student-Paper-Prize

--
Jim Luedtke, Assistant Professor
Secretary/Treasurer, INFORMS Optimization Society
Dept. of Industrial and Systems Engineering
University of Wisconsin-Madison
3236 Mechanical Engineering Building
1513 University Avenue, Madison, WI 53706
**********************************************************
*
* 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/
*
**********************************************************

Professor position in Algorithms and Complexity

Dear all,

The Ruhr-University Bochum, Department of Mathematics
(http://www.rub.de/ffm), Germany, is seeking to appoint one Assistant
Professor (W1, Juniorprofessor) in Computer Science (Algorithms and
Complexity).

The position is non-tenured with an initial appointment for 3 years,
and renewable for another 3 years after a positive mid-term review. In
the case of outstanding performance the position might be converted to
tenure-track after the mid-term review.

For the full announcement including instructions how to apply, see
 * http://www.ruhr-uni-bochum.de/ffm/fakultaet/index.html.en
 * http://www.ruhr-uni-bochum.de/ffm/pdf/Computer_Science.pdf

The application deadline ist April 20, 2012.

--
Prof. Dr. Eike Kiltz
Faculty of Mathematics
Ruhr-Universität Bochum
+49 234 32-25513
eike.kiltz@rub.de

[DMANET] Deadline EXTENSION + Workshops UNCONVENTIONAL COMPUTATION and NATURAL COMPUTATION (UCNC '12)

Final call for Papers Workshops announcement

11th International Conference on

UNCONVENTIONAL COMPUTATION and NATURAL COMPUTATION, UCNC 2012

University of Orleans, France, September 3-7, 2012
http://www.univ-orleans.fr/lifo/events/UCNC2012/

++++++++++++++++++++++++++++++++++++++++++++++++

Important dates

- Paper submission deadline: **April 9, 2012**
- Notification to authors: May 28, 2012
- Final versions due: June 25, 2012
- UCNC 2012: September 3-7, 2012

++++++++++++++++++++++++++++++++++++++++++++++++

SATELLITE WORKSHOPS:

- BioChemIT 2012: The Second COBRA Workshop on Biological and
Chemical Information Technologies
http://cobra-project.eu/
- CoSMoS 2012: 5th International Workshop on Complex
Systems Modelling and Simulation
http://www.cosmos-research.org/workshops/cosmos-workshop-2012/
- Foun. QI 2: Foundations of Quantum Information 2nd ed.
(funky too.)
- IPCN: Information Physics and Computing in Nano-scale
Photonics and Materials

++++++++++++++++++++++++++++++++++++++++++++++++

UCNC 2012 is organized by the LIFO, the Computer Science Research
Laboratory of the University of Orleans.

Original papers are solicited in all areas of unconventional
computation and natural computation. Papers dealing with theory as
well as with experiments and applications are welcome. Typical, but
not exclusive, topics are: natural computing including quantum,
cellular, molecular, neural, DNA and membrane computing, as well as
evolutionary paradigms; chaos and dynamical systems based computing;
massive parallel computation, collective intelligence, relativistic,
optical, spatial computing, amorphous computing, physarum computing,
collision-based computing, proposals for computations going beyond the
Turing model.

Submissions: Authors are invited to submit papers (at most 12 pages)
through EasyChair.org, please follow the links from the conference
website.

Papers must be submitted in PDF format. The use of
LaTeX is strongly encouraged as it will be required for the revised
manuscript included in the LNCS proceedings of accepted papers.
They should be prepared according to the Springer's LNCS format.

Simultaneous submissions to other conferences with published
proceedings are not permitted. Each accepted paper must be presented
at the conference. The proceedings will be published by
Springer LNCS series and will be available at the conference.

++++++++++++++++++++++++++++++++++++++++++++++++

Invited Speakers:
- Paola BONIZZONI (University of Milano-Bicocca, Italy)
- Cristian CALUDE (University of Auckland, New Zealand)
- Marco DORIGO (IRIDIA, Université Libre de Bruxelles, Belgium)
- Rene DOURSAT (Complex Systems Institute Paris Ile-de-France, France)
- Jack LUTZ (Iowa State University, USA)
- Maurice MARGENSTERN (Universite de Metz, France)

Alan Turing centenary talk
- Gilles DOWEK (INRIA, France)

Tutorials:
- Spatial Computing & MGS
Jean-Louis GIAVITTO (IRCAM, Paris, France)
Antoine SPICHER (Universite de Paris Est - Creteil)
Olivier MICHEL (Universite de Paris Est - Creteil)
- Self-Assembling Systems
Matthew PATITZ (University of Texas-Pan American, USA)

++++++++++++++++++++++++++++++++++++++++++++++++

Program Committee:
- Andrew ADAMATSKY (University of Bristol, UK)
- Cristian S. CALUDE (University of Auckland, New Zealand)
- Jose Felix COSTA (Technical University of Lisbon, Portugal)
- David DOTY (Caltech, California, USA)
- Jerome DURAND-LOSE (University of Orleans, France) - co-chair
- Christine EISENBEIS (INRIA Saclay-Ile de France & Universite
Paris-Sud 11, France)
- Rudolf FREUND (University of Vienna, Austria)
- Pierre GUILLON (CNRS & Universite de Aix-Marseille, France)
- Masami HAGIYA (University of Tokyo, Japan)
- Tero HARJU (University of Turku, Finland)
- Mika HIRVENSALO (University of Turku, Finland)
- Oscar H. IBARRA (University of California - Santa Barbara, USA)
- Natasha JONOSKA (University of South Florida, USA) - co-chair
- Jarkko KARI (University of Turku, Finland)
- Satoshi KOBAYASHI (University of Electro-Communications, Japan)
- Giancarlo MAURI (University of Milano-Bicocca, Italy)
- Jacques MAZOYER (LIP-ENS Lyon, France)
- Kenichi MORITA (University of Hiroshima, Japan)
- Kae NEMOTO (National Institute of Informatics, Japan)
- Gheorghe PAUN (Institute of Mathematics of the Romanian Academy,
Romania)
- Igor POTAPOV (University of Liverpool, UK)
- Susan STEPNEY (University of York, UK)

++++++++++++++++++++++++++++++++++++++++++++++++

Conference FEES: 210 € (early reduced) to 400 € (normal on site)

Including: lunches, social events, workshops, proceedings...

++++++++++++++++++++++++++++++++++++++++++++++++

Conference location: The conference and the satellite workshops will
take place in the computer science building of the Universite d'Orleans.

Conference History: The first venue of the Unconventional Computation
Conference (formerly called Unconventional Models of Computation) was
Auckland, New Zealand, in 1998; subsequent sites of the conference
were Brussels, Belgium, in 2000; Kobe, Japan, in 2002; Seville, Spain,
in 2005; York, UK, in 2006; Kingston, Canada, in 2007; Vienna,
Austria, in 2008; Ponta Delgada, Portugal, in 2009; Tokyo, Japan,
in 2010; and Turku, Finland in 2011.

**********************************************************
*
* 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/
*
**********************************************************