Friday, October 15, 2010

[DMANET] IEEE MASS 2010: Call for Participation

[We apologize in advance if you receive multiple copies of this message]

==========================================================================
CALL FOR PARTICIPATION

IEEE MASS 2010
7th IEEE International Conference on Mobile Ad-hoc
and Sensor Systems
https://mass2010.soe.ucsc.edu/

November 8-12, 2010 - San Francisco, CA, USA

Co-sponsored by the IEEE Computer Society Technical Commitee on
Distributed Processing and IEEE Computer Society Technical Commitee on
Simulation

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

CONFERENCE SITE:
----------------
The 7th IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (IEEE MASS 2010) will be held at the Hilton San Francisco
Airport in San Francisco, California, USA.


SCOPE:
------
Wireless ad-hoc communication has applications in a variety of
environments, such as conferences, hospitals, battlefields and
disaster-recovery/rescue operations, and is also being actively
investigated as an alternative paradigm for Internet connectivity in
both urban and rural areas. Wireless sensor and actuator networks are
also being deployed for enhancing industrial control processes and
supply-chains, and for various forms of environmental monitoring. The
IEEE MASS 2010 aims at addressing advances in research on multi-hop
ad-hoc and sensor networks, covering topics ranging from technology
issues to applications and test-bed development. Please keep checking
the IEEE MASS 2010 web-space for more information and regular updates.


REGISTRATION:
-------------
Registration to IEEE MASS is available at the conference website.


WORKSHOPS:
------------

- The Third Workshop on Mobile Entity Localization and Tracking (MELT)
- The Second Workshop onS CEnarios for Network Evaluation Studies (SCENES)
- The Sixth Workshop on Wireless and Sensor Network Security (WSNS)
- The Fourth Workshop on Enabling Technologies and Standards for
Wireless Mesh Networking (MESHTECH)
- The Second International Workshop on Intelligent Vehicular Networks
(InVeNet)

ORGANIZATION COMMITTEE:
-----------------------

GENERAL CO-CHAIRS
Mario Gerla, University of California, Los Angeles
Katia Obraczka, University of California, Santa Cruz

PROGRAM CO-CHAIRS
Guohong Cao, Pennsylvania State University
Prasant Mohapatra, University of California, Davis


TPC SUB-AREA CHAIRS
- Protocols and Cross-Layer Technologies
Ahmed Helmy, University of Florida

- Systems, and applications
Chenyang Lu, Washington Unviersity in St. Louis

- Algorithms and theory
Dong Xuan, Ohio State University

- Reliability, security and privacy
Radha Poovendran, University of Washington


WORKSHOP CO-CHAIRS
Cedric Westphal, DoCoMo Labs
Christine Pepin, DoCoMo Labs


DEMO CHAIR
Rajeev Koodli, Starent Networks
Marcelo Dias Amorim, LIP 6, Universite' Paris 6


WEB CHAIR
Venkatesh Rajendran, Wionics


FINANCE AND REGISTRATION CHAIR
Zhen Jiang, West Chester University


PUBLICATION CHAIR
Dajin Wang, Montclair State University


PUBLICITY CHAIR
Aline Carneiro Viana, INRIA


LOCAL ARRANGEMENTS CO-CHAIRS
Kumar Viswanath, NTT Labs
Ignacio Solis, PARC

STEERING COMMITTEE CHAIR
Dharma P. Agrawal, University of Cincinnati


CHAIR OF IEEE TC ON DISTRIBUTED PROCESSING
Jie Wu, US National Science Foundation


CHAIR OF IEEE TC ON SIMULATION
Dave Cavalcanti, Phillips Research
**********************************************************
*
* 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/
*
**********************************************************

Thursday, October 14, 2010

[DMANET] EuroCG 2011 Call for Papers

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

27th European Workshop on Computational Geometry

http://eurocg11.inf.ethz.ch/
March 28-30, 2011
Antoniushaus Morschach, Switzerland

Call for Papers

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

The 27th European Workshop on Computational Geometry (EuroCG 11) will
be held on March 28-30, 2011, at Antoniushaus Morschach, Switzerland.

EuroCG is an annual, informal workshop whose goal is to provide a
forum for scientists to meet, present their work, interact, and
establish collaborations, in order to promote research in the field of
Computational Geometry, within Europe and beyond. The workshop is
known for its friendly and informal atmosphere through which both
established and young researchers will have a productive exchange of
ideas.

Submissions:

EuroCG does not have formally reviewed proceedings. A booklet of
abstracts is distributed at the conference. This booklet does not have
an ISBN number, and its content - just like the pdf files of abstracts
available on the EuroCG websites - should be regarded as a collection
of preprints. Therefore, results presented at EuroCG are often also
submitted to peer-reviewed conferences and/or journals.

We invite authors to submit extended abstracts (4 pages, two columns)
of original research. Submissions will be handled through
EasyChair. Please refer to the conference website
(http://eurocg11.inf.ethz.ch/) for additional information, in
particular regarding the submission format.

Selected papers from EuroCG'11 will be considered for a special issue
of the journal Computational Geometry: Theory and Applications.

Important Dates:

Submission Deadline: January 9, 2011
Acceptance Notification: January 31, 2011
Camera-ready version: February 18, 2011

Topics of interest:

- discrete and combinatorial geometry and topology
- design and analysis of geometric algorithms and data structures
- implementation and experimental evaluation of geometric algorithms
- numerical and algebraic issues arising from implementations
- analysis of geometric configurations
- geometric modeling, visualization, and simulation
- combinatorial optimization
- computer-aided design and manufacturing
- structural molecular biology
- geographic information systems
- robotics and virtual worlds
- and other fields.

Invited speakers:

Mark de Berg, TU Eindhoven
Fritz Eisenbrand, EPF Lausanne
Jirka Matousek, Charles University Prague

Program Committee:

Bernd Gaertner, ETH Zurich
Michael Hoffmann, ETH Zurich (chair)
Gabriel Nivasch, ETH Zurich
Shakhar Smorodinsky, Ben-Gurion University
Bettina Speckmann, TU Eindhoven
Marc van Kreveld, Utrecht University
Emo Welzl, ETH Zurich

Organization:

Michael Hoffmann, Andrea Salow, Emo Welzl, all ETH Zurich

Contact:

EuroCG 2011
Theoretical Computer Science, ETH Zurich, CAB G33.1
Universitaetsstrasse 6, CH-8092 Zurich, Switzerland
mail: eurocg11@inf.ethz.ch
phone: +41-44-6327390
fax: +41-44-6321172
**********************************************************
*
* 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/
*
**********************************************************

CPM 2011 --- Call for Papers

CALL FOR PAPERS

CPM 2011
22nd Annual Symposium on Combinatorial Pattern Matching
June 27-29, 2011, Palermo, Italy
http://cpm2011.unipa.it/

Submission deadline: January 20, 2011

OVERVIEW: The 22nd Symposium on Combinatorial Pattern Matching (CPM) will be
held in Mondello near Palermo, Italy.

Papers in all areas related to combinatorial pattern matching and its
applications will be considered, including, but not limited to, coding and
data compression, computational biology, data mining, information retrieval,
natural language processing, pattern recognition, string algorithms, string
processing in databases, symbolic computing, text searching.

Both papers reporting on original research unpublished elsewhere and surveys
of important results are welcome. The proceedings will be published in the
Springer-Verlag series Lecture Notes in Computer Science.

PC CHAIRS: Raffaele Giancarlo (Palermo), Giovanni Manzini (Piemonte
Orientale)

INVITED SPEAKERS: Nello Cristianini (Univ. Bristol), Gad Landau (Univ.
Haifa), Martin Vingron (Max Planck Institute for Molecular Genetics)

IMPORTANT DATES:
Submission: January 20, 2011
Notification: March 14, 2011
Camera-ready: March 25, 2011
Symposium: June 27-29, 2011

Full printable pdf version of this call for papers is available at
http://cpm2011.unipa.it/

[DMANET] CTW 2011 - PRELIMINARY CALL FOR PAPERS

PRELIMINARY CALL FOR PAPERS

CTW 2011
10th Cologne-Twente Workshop on Graphs & Combinatorial Optimization

Universita di Roma "Tor Vergata", Villa Mondragone,
Frascati (Rome), Italy, June 14-16, 2011.

The tenth Cologne-Twente Workshop on Graphs and Combinatorial
Optimization 2011 welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in the wide sense.

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

Authors wishing to submit a contribution, should prepare an extended
abstract of 3-4 pages by February 28, 2011.
A special proceedings volume of Discrete Applied Mathematics,
containing full length papers, refereed according to the high standards
of DAM, is planned.

Important dates
* Deadline for abstract submission: February 28th, 2011;
* Acceptance notice: April 15th, 2011;
* Conference dates: June 14-16th, 2011.

Further details will be made available soon on the conference website:
http://ctw2011.dia.uniroma3.it

Contacts: ctw2011@dia.uniroma3.it

SCIENTIFIC COMMITTEE
U. Faigle (U. Cologne), J.L. Hurink (U. Twente), L. Liberti (Ecole
Polytechnique, Paris), F. Maffioli (Politecnico, Milano), G. Nicosia (U.
Roma Tre), A. Pacifici (U. Roma Tor Vergata), G. Righini (U. Milano), R.
Schrader (U. Cologne), R. Schultz (U. Duisburg-Essen).

LOCAL ORGANIZATION
L. Adacher, M. Flamini, G. Leo, G. Nicosia, A. Pacifici, V. Piccialli
**********************************************************
*
* 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 CAI 2011

(We apologize if you receive multiple copies of this CFP.)


Call for Papers
4th International Conference on Algebraic Informatics
(CAI 2011)
RISC / Johannes Kepler University
Hagenberg / Linz, Austria
21-24 June 2011
http://www.risc.jku.at/about/conferences/cai2011
Conference Chair: Franz Winkler


CAI 2011 continues the tradition established by CAI 2005, CAI 2007, and
CAI 2009: to bring together researchers from theoretical computer science
and algebra. This should enhance the understanding of syntactic and
semantic problems by algebraic models; and it should also propagate the
application of modern techniques from informatics in algebraic computation.
We will try to achieve this goal via invited lectures, tutorials, and
contributed research talks.


Topics:
algebraic semantics
formal power series
syntactic objects
algebraic picture processing
finite and infinite computations
acceptors and transducers for discrete structures.
decision problems
algebraic characterization of logical theories
process algebra
algebraic algorithms
algebraic coding theory
algebraic aspects of cryptography
term rewriting
algebraic aspects of number theory


Submissions:
Authors are invited to submit papers (in PDF format) presenting original and
unpublished research. Submissions must be written in LaTeX using the LNCS
article style (http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0)
and must not exceed 12 pages. Papers must be in English. Submission is done
via EasyChair (https://www.easychair.org/account/signin.cgi?conf=cai2011).
Simultaneous submission to other conferences with published proceedings is
not allowed.


Important Dates:
Submission due: 17 January 2011
Notification: 7 March 2011
Proceedings version due: 4 April 2011


Proceedings:
The proceedings of CAI 2011 will be published in the Lecture Notes in
Computer Science (LNCS) by Springer-Verlag.


For submission of papers and further information we refer to the web page of
CAI 2011

http://www.risc.jku.at/about/conferences/cai2011

Wednesday, October 13, 2010

[DMANET] CPM 2011 --- Call for Papers

CALL FOR PAPERS

CPM 2011
22nd Annual Symposium on Combinatorial Pattern Matching
June 27-29, 2011, Palermo, Italy
http://cpm2011.unipa.it/

Submission deadline: January 20, 2011

OVERVIEW: The 22nd Symposium on Combinatorial Pattern Matching (CPM) will be
held in Mondello near Palermo, Italy.

Papers in all areas related to combinatorial pattern matching and its
applications will be considered, including, but not limited to, coding and
data compression, computational biology, data mining, information retrieval,
natural language processing, pattern recognition, string algorithms, string
processing in databases, symbolic computing, text searching.

Both papers reporting on original research unpublished elsewhere and surveys
of important results are welcome. The proceedings will be published in the
Springer-Verlag series Lecture Notes in Computer Science.

PC CHAIRS: Raffaele Giancarlo (Palermo), Giovanni Manzini (Piemonte
Orientale)

INVITED SPEAKERS: Nello Cristianini (Univ. Bristol), Gad Landau (Univ.
Haifa), Martin Vingron (Max Planck Institute for Molecular Genetics)

IMPORTANT DATES:
Submission: January 20, 2011
Notification: March 14, 2011
Camera-ready: March 25, 2011
Symposium: June 27-29, 2011

Full printable pdf version of this call for papers is available at
http://cpm2011.unipa.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/
*
**********************************************************

Tuesday, October 12, 2010

[DMANET] CFP 27th Symposium on Computational Geometry

---------------------------------------------------------------------
CALL FOR PAPERS
---------------------------------------------------------------------
27th Annual Symposium on Computational Geometry (SoCG 2011)
June 13-15, 2011
Paris, France
In cooperation with ACM SIGACT and SIGGRAPH

http://socg2011.inria.fr/


The Twenty-Seventh Annual Symposium on Computational Geometry will be
held in Paris, France. We invite submissions of high-quality papers
describing original research addressing computational problems in a
geometric setting, in particular their algorithmic solutions,
implementation issues, applications, and mathematical foundations.

The topics of the Symposium reflect the rich diversity of research
interests in computational geometry. They are intended to highlight both
the depth and scope of computational geometry, and to invite fruitful
interactions with other disciplines. Topics of interest include, but are
not limited to:
* design, analysis, and implementation of geometric algorithms and
data structures; lower bounds on the computational complexity of
geometric problems;
* mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation of
geometric algorithms and heuristics; discrete and combinatorial
geometry; computational topology;
* novel applications of computational geometry in computer graphics,
geometric modeling, computer-aided design and manufacturing, scientific
computing, geographic information systems, database systems, robotics,
computational biology, machine learning, sensor networks, medical
imaging, combinatorial optimization, statistical analysis, discrete
differential geometry, theoretical computer science, graph drawing, pure
mathematics, and other fields.

----- Important Dates -----

* November 22, 2010: Paper titles and (short) abstracts due
* December 01, 2010: Full submissions due (23:59, Honolulu time)
* February 14, 2011: Notification of acceptance/rejection of papers
* June 13-15, 2011: Symposium in Paris, France

A call for Video and Multimedia Presentations will be announced later.

---------------------------------------------------------------------
CALL FOR PAPERS
---------------------------------------------------------------------

We invite submissions of high-quality papers describing original
research on geometric algorithms and data structures, their mathematical
foundations and correctness, their implementation, and their applications.

The program committee explicitly encourages the submission of video or
multimedia in support of submitted papers. Authors may wish to consider
making a separate submission to the video/multimedia track (of the which
the call for submissions will be distributed separately). Papers and
video/multimedia submissions will be reviewed separately; acceptance or
rejection of one will not influence acceptance or rejection of the other.

Final versions of accepted papers will be published by ACM in the
symposium proceedings. Proceedings will be distributed to symposium
participants and will also be available from ACM for purchase or through
the digital library. An author of each accepted paper will be expected
to attend the Symposium and give a presentation (approximately 20
minutes) of the paper. Authors of a selection of papers from the
conference will be invited to submit extended versions of their papers
to a special issue of one or more journals.

----- Paper Submission -----

All submissions should be made electronically; see the EasyChair
SoCG2011 web pages
http://www.easychair.org/conferences/?conf=socg2011
for detailed submission instructions. If electronic submission is not
feasible, please contact the program committee chairs, Ferran Hurtado
and Marc van Kreveld, well in advance of the submission deadlines.

----- Submission Guidelines ------

Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name, affiliation, and
e-mail address. This should be followed by a precise statement of the
problem considered, a succinct summary of the results obtained
(emphasizing the significance, novelty, and potential impact of the
research), and a clear comparison with related work. The remainder of
the extended abstract should provide sufficient detail to allow the
program committee to evaluate the validity, quality, and relevance of
the contribution. Clarity of presentation is very important; the whole
extended abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and non-experts,
often under tight time constraints.

Submissions should be typeset in single column format, using 11-point or
larger font, with at least 1 inch/2.54 cm margins and single line
spacing. Excluding the title page and bibliography, the extended
abstract must not exceed 10 pages. Submissions deviating from these
guidelines risk rejection without consideration of their merits.

A clearly marked appendix (of reasonable length) containing omitted
proofs may be included directly in the submission, and is mandatory for
crucial proofs. Appendices are not counted in the 10 page limit, so
while they may serve as a reference, they are not necessarily read by
the program committee. Other supporting materials, such as a video or
multimedia presentation, source code, or experimental data, may be
provided by including a URL in the submission, but again, these will be
considered only at the discretion of the program committee.

Anticipating the usual high overall quality of submissions, the program
committee intends to accept more papers than was typical in previous
years. Also, we intend to interpret the scope of the conference broadly,
and will accept all papers of high quality that are of significant
interest to our research community. The conference venue in Paris is
attractive and allows a bigger conference than previous years.

Authors must submit the title and a short abstract of their paper by
November 22, 2010. This pre-submission will be used to help make program
committee reading assignments. Extended abstracts must be received by
December 1, 2010 (23:59, Honolulu time). There will be no extension of
this deadline; late submissions will not be considered. Authors will be
notified of acceptance or rejection by February 14, 2011. The final
proceedings papers must be formatted in accordance with ACM proceedings
guidelines; LaTeX style files will be made available to authors of
accepted papers.

Concurrent submission of the same (or essentially the same) abstract to
SoCG and to another conference with published proceedings is not
allowed. An extended abstract of a paper that is under journal review,
or scheduled for publication in a journal after June 2011, may be
submitted, when it is clear that the extended abstract differs
substantially from the journal version. In such cases, the authors must
include the journal version in an appendix that clearly identifies the
status of the journal submission.


----- Program Committee -----

# Lars Arge (MADALGO, Aarhus University)
# Esther Arkin (State University of New York at Stony Brook)
# Prosenjit Bose (Carleton University)
# Sergio Cabello (University of Ljubljana)
# Eric Colin de Verdiere (Ecole normale superieure and CNRS, Paris)
# Olivier Devillers (INRIA Sophia Antipolis - Mediterranee)
# Adrian Dumitrescu (University of Wisconsin-Milwaukee)
# Herbert Edelsbrunner (IST Austria and Duke University)
# Joachim Giesen (Universitaet Jena)
# Joachim Gudmunsson (National ICT Australia, Sydney)
# Ferran Hurtado, co-chair (Universitat Politecnica de Catalunya)
# Naoki Katoh (Kyoto University)
# Klara Kedem (Ben-Gurion University)
# Marc van Kreveld, co-chair (Utrecht University)
# Anna Lubiw (University of Waterloo)
# David Mount (University of Maryland)
# Stefan Schirra (Otto-von-Guericke Universitaet Magdeburg)
# Micha Sharir (Tel Aviv University)


----- Local Arrangements Committee ------

* Steve Oudot, co-chair (INRIA Saclay - Ile-de-France)
* Frederic Chazal, co-chair (INRIA Saclay - Ile-de-France)
* Marc Glisse (INRIA Saclay - Ile-de-France)
* Gaelle Dorkeld (INRIA Paris - Rocquencourt)
* Christine Biard (INRIA Saclay - Ile-de-France)


The Call for Video and Multimedia Presentations will be distributed
later. The chair is Jonathan Shewchuck.

---------------------------------------------------------------------
---------------------------------------------------------------------
SOCG Steering Committee (2009-2012)

* Jack Snoeyink, chair (University of North Carolina)
* Mark de Berg, secretary (TU Eindhoven)
* Joe Mitchell (SUNY Stony Brook)
* Guenter Rote (FU Berlin)
* Monique Teillaud (INRIA Sophia Antipolis - Mediterranee)


--------------060207070000040207050902
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>

<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
</head>
<body bgcolor="#ffffff" text="#000000">
<div class="moz-text-flowed" style="font-family: -moz-fixed;
font-size: 14px;" lang="x-western">---------------------------------------------------------------------
<br>
CALL FOR PAPERS
<br>
---------------------------------------------------------------------
<br>
&nbsp; 27th Annual Symposium on Computational Geometry (SoCG 2011)
<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; June 13-15, 2011
<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Paris, France
<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; In cooperation with ACM SIGACT and SIGGRAPH
<br>
<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <a class="moz-txt-link-freetext"
href="http://socg2011.inria.fr/">http://socg2011.inria.fr/</a>
<br>
<br>
<br>
The Twenty-Seventh Annual Symposium on Computational Geometry will
be held in Paris, France.&nbsp; We invite submissions of high-quality
papers describing original research addressing computational
problems in a geometric setting, in particular their algorithmic
solutions, implementation issues, applications, and mathematical
foundations.
<br>
<br>
The topics of the Symposium reflect the rich diversity of research
interests in computational geometry. They are intended to
highlight both the depth and scope of computational geometry, and
to invite fruitful interactions with other disciplines. Topics of
interest include, but are not limited to:
<br>
&nbsp; * design, analysis, and implementation of geometric algorithms
and data structures; lower bounds on the computational complexity
of geometric problems;
<br>
&nbsp; * mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation
of geometric algorithms and heuristics; discrete and combinatorial
geometry; computational topology;
<br>
&nbsp; * novel applications of computational geometry in computer
graphics, geometric modeling, computer-aided design and
manufacturing, scientific computing, geographic information
systems, database systems, robotics, computational biology,
machine learning, sensor networks, medical imaging, combinatorial
optimization, statistical analysis, discrete differential
geometry, theoretical computer science, graph drawing, pure
mathematics, and other fields.
<br>
<br>
----- Important Dates -----
<br>
<br>
* November 22, 2010: Paper titles and (short) abstracts due
<br>
* December 01, 2010: Full submissions due (23:59, Honolulu time)
<br>
* February 14, 2011: Notification of acceptance/rejection of
papers
<br>
* June&nbsp; 13-15, 2011: Symposium in Paris, France
<br>
<br>
A call for Video and Multimedia Presentations will be announced
later.
<br>
<br>
---------------------------------------------------------------------
<br>
CALL FOR PAPERS
<br>
---------------------------------------------------------------------
<br>
<br>
We invite submissions of high-quality papers describing original
research on geometric algorithms and data structures, their
mathematical foundations and correctness, their implementation,
and their applications.
<br>
<br>
The program committee explicitly encourages the submission of
video or multimedia in support of submitted papers. Authors may
wish to consider making a separate submission to the
video/multimedia track (of the which the call for submissions will
be distributed separately). Papers and video/multimedia
submissions will be reviewed separately; acceptance or rejection
of one will not influence acceptance or rejection of the other.
<br>
<br>
Final versions of accepted papers will be published by ACM in the
symposium proceedings. Proceedings will be distributed to
symposium participants and will also be available from ACM for
purchase or through the digital library. An author of each
accepted paper will be expected to attend the Symposium and give a
presentation (approximately 20 minutes) of the paper.&nbsp; Authors of
a selection of papers from the conference will be invited to
submit extended versions of their papers to a special issue of one
or more journals.
<br>
<br>
----- Paper Submission -----
<br>
<br>
All submissions should be made electronically; see the EasyChair
SoCG2011 web pages
<br>
<a class="moz-txt-link-freetext"
href="http://www.easychair.org/conferences/?conf=socg2011">http://www.easychair.org/conferences/?conf=socg2011</a>
<br>
for detailed submission instructions. If electronic submission is
not feasible, please contact the program committee chairs, Ferran
Hurtado and Marc van Kreveld, well in advance of the submission
deadlines.
<br>
<br>
----- Submission Guidelines ------
<br>
<br>
Papers should be submitted in the form of an extended abstract,
which begins with the title of the paper, each author's name,
affiliation, and e-mail address. This should be followed by a
precise statement of the problem considered, a succinct summary of
the results obtained (emphasizing the significance, novelty, and
potential impact of the research), and a clear comparison with
related work. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to
evaluate the validity, quality, and relevance of the contribution.
Clarity of presentation is very important; the whole extended
abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and
non-experts, often under tight time constraints.
<br>
<br>
Submissions should be typeset in single column format, using
11-point or larger font, with at least 1 inch/2.54 cm margins and
single line spacing. Excluding the title page and bibliography,
the extended abstract must not exceed 10 pages. Submissions
deviating from these guidelines risk rejection without
consideration of their merits.
<br>
<br>
A clearly marked appendix (of reasonable length) containing
omitted proofs may be included directly in the submission, and is
mandatory for crucial proofs. Appendices are not counted in the 10
page limit, so while they may serve as a reference, they are not
necessarily read by the program committee. Other supporting
materials, such as a video or multimedia presentation, source
code, or experimental data, may be provided by including a URL in
the submission, but again, these will be considered only at the
discretion of the program committee.
<br>
<br>
Anticipating the usual high overall quality of submissions, the
program committee intends to accept more papers than was typical
in previous years. Also, we intend to interpret the scope of the
conference broadly, and will accept all papers of high quality
that are of significant interest to our research community. The
conference venue in Paris is attractive and allows a bigger
conference than previous years.
<br>
<br>
Authors must submit the title and a short abstract of their paper
by November 22, 2010. This pre-submission will be used to help
make program committee reading assignments. Extended abstracts
must be received by December 1, 2010 (23:59, Honolulu time). There
will be no extension of this deadline; late submissions will not
be considered. Authors will be notified of acceptance or rejection
by February 14, 2011. The final proceedings papers must be
formatted in accordance with ACM proceedings guidelines; LaTeX
style files will be made available to authors of accepted papers.
<br>
<br>
Concurrent submission of the same (or essentially the same)
abstract to SoCG and to another conference with published
proceedings is not allowed. An extended abstract of a paper that
is under journal review, or scheduled for publication in a journal
after June 2011, may be submitted, when it is clear that the
extended abstract differs substantially from the journal version.
In such cases, the authors must include the journal version in an
appendix that clearly identifies the status of the journal
submission.
<br>
<br>
<br>
----- Program Committee -----
<br>
<br>
# Lars Arge (MADALGO, Aarhus University)
<br>
# Esther Arkin (State University of New York at Stony Brook)
<br>
# Prosenjit Bose (Carleton University)
<br>
# Sergio Cabello (University of Ljubljana)
<br>
# &Eacute;ric Colin de Verdi&egrave;re (&Eacute;cole normale sup&eacute;rieure and CNRS,
Paris)
<br>
# Olivier Devillers (INRIA Sophia Antipolis - M&eacute;diterran&eacute;e)
<br>
# Adrian Dumitrescu (University of Wisconsin-Milwaukee)
<br>
# Herbert Edelsbrunner (IST Austria and Duke University)
<br>
# Joachim Giesen (Universit&auml;t Jena)
<br>
# Joachim Gudmunsson (National ICT Australia, Sydney)
<br>
# Ferran Hurtado, co-chair (Universitat Polit&egrave;cnica de Catalunya)
<br>
# Naoki Katoh (Kyoto University)
<br>
# Klara Kedem (Ben-Gurion University)
<br>
# Marc van Kreveld, co-chair (Utrecht University)
<br>
# Anna Lubiw (University of Waterloo)
<br>
# David Mount (University of Maryland)
<br>
# Stefan Schirra (Otto-von-Guericke Universit&auml;t Magdeburg)
<br>
# Micha Sharir (Tel Aviv University)
<br>
<br>
<br>
----- Local Arrangements Committee ------
<br>
<br>
* Steve Oudot, co-chair (INRIA Saclay - &Icirc;le-de-France)
<br>
* Fr&eacute;d&eacute;ric Chazal, co-chair (INRIA Saclay - &Icirc;le-de-France)
<br>
* Marc Glisse (INRIA Saclay - &Icirc;le-de-France)
<br>
* Ga&euml;lle Dorkeld (INRIA Paris - Rocquencourt)
<br>
* Christine Biard (INRIA Saclay - &Icirc;le-de-France)
<br>
<br>
<br>
The Call for Video and Multimedia Presentations will be
distributed later. The chair is Jonathan Shewchuck.
<br>
<br>
---------------------------------------------------------------------
<br>
---------------------------------------------------------------------
<br>
SOCG Steering Committee (2009-2012)
<br>
<br>
* Jack Snoeyink, chair&nbsp; (University of North Carolina)
<br>
* Mark de Berg, secretary (TU Eindhoven)
<br>
* Joe Mitchell (SUNY Stony Brook)
<br>
* Guenter Rote (FU Berlin)
<br>
* Monique Teillaud (INRIA Sophia Antipolis - M&eacute;diterran&eacute;e)
<br>
<br>
</div>
</body>
</html>

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

CFP 27th Symposium on Computational Geometry

---------------------------------------------------------------------
CALL FOR PAPERS
---------------------------------------------------------------------
27th Annual Symposium on Computational Geometry (SoCG 2011)
June 13-15, 2011
Paris, France
In cooperation with ACM SIGACT and SIGGRAPH

http://socg2011.inria.fr/


The Twenty-Seventh Annual Symposium on Computational Geometry will be held
in Paris, France. We invite submissions of high-quality papers describing
original research addressing computational problems in a geometric setting,
in particular their algorithmic solutions, implementation issues,
applications, and mathematical foundations.

The topics of the Symposium reflect the rich diversity of research interests
in computational geometry. They are intended to highlight both the depth and
scope of computational geometry, and to invite fruitful interactions with
other disciplines. Topics of interest include, but are not limited to:
* design, analysis, and implementation of geometric algorithms and data
structures; lower bounds on the computational complexity of geometric problems;
* mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation of
geometric algorithms and heuristics; discrete and combinatorial geometry;
computational topology;
* novel applications of computational geometry in computer graphics,
geometric modeling, computer-aided design and manufacturing, scientific
computing, geographic information systems, database systems, robotics,
computational biology, machine learning, sensor networks, medical imaging,
combinatorial optimization, statistical analysis, discrete differential
geometry, theoretical computer science, graph drawing, pure mathematics, and
other fields.

----- Important Dates -----

* November 22, 2010: Paper titles and (short) abstracts due
* December 01, 2010: Full submissions due (23:59, Honolulu time)
* February 14, 2011: Notification of acceptance/rejection of papers
* June 13-15, 2011: Symposium in Paris, France

A call for Video and Multimedia Presentations will be announced later.

---------------------------------------------------------------------
CALL FOR PAPERS
---------------------------------------------------------------------

We invite submissions of high-quality papers describing original research on
geometric algorithms and data structures, their mathematical foundations and
correctness, their implementation, and their applications.

The program committee explicitly encourages the submission of video or
multimedia in support of submitted papers. Authors may wish to consider
making a separate submission to the video/multimedia track (of the which the
call for submissions will be distributed separately). Papers and
video/multimedia submissions will be reviewed separately; acceptance or
rejection of one will not influence acceptance or rejection of the other.

Final versions of accepted papers will be published by ACM in the symposium
proceedings. Proceedings will be distributed to symposium participants and
will also be available from ACM for purchase or through the digital library.
An author of each accepted paper will be expected to attend the Symposium
and give a presentation (approximately 20 minutes) of the paper. Authors of
a selection of papers from the conference will be invited to submit extended
versions of their papers to a special issue of one or more journals.

----- Paper Submission -----

All submissions should be made electronically; see the EasyChair SoCG2011
web pages
http://www.easychair.org/conferences/?conf=socg2011
for detailed submission instructions. If electronic submission is not
feasible, please contact the program committee chairs, Ferran Hurtado and
Marc van Kreveld, well in advance of the submission deadlines.

----- Submission Guidelines ------

Papers should be submitted in the form of an extended abstract, which begins
with the title of the paper, each author's name, affiliation, and e-mail
address. This should be followed by a precise statement of the problem
considered, a succinct summary of the results obtained (emphasizing the
significance, novelty, and potential impact of the research), and a clear
comparison with related work. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution. Clarity of
presentation is very important; the whole extended abstract should be
written carefully, taking into consideration that it will be read and
evaluated by both experts and non-experts, often under tight time constraints.

Submissions should be typeset in single column format, using 11-point or
larger font, with at least 1 inch/2.54 cm margins and single line spacing.
Excluding the title page and bibliography, the extended abstract must not
exceed 10 pages. Submissions deviating from these guidelines risk rejection
without consideration of their merits.

A clearly marked appendix (of reasonable length) containing omitted proofs
may be included directly in the submission, and is mandatory for crucial
proofs. Appendices are not counted in the 10 page limit, so while they may
serve as a reference, they are not necessarily read by the program
committee. Other supporting materials, such as a video or multimedia
presentation, source code, or experimental data, may be provided by
including a URL in the submission, but again, these will be considered only
at the discretion of the program committee.

Anticipating the usual high overall quality of submissions, the program
committee intends to accept more papers than was typical in previous years.
Also, we intend to interpret the scope of the conference broadly, and will
accept all papers of high quality that are of significant interest to our
research community. The conference venue in Paris is attractive and allows a
bigger conference than previous years.

Authors must submit the title and a short abstract of their paper by
November 22, 2010. This pre-submission will be used to help make program
committee reading assignments. Extended abstracts must be received by
December 1, 2010 (23:59, Honolulu time). There will be no extension of this
deadline; late submissions will not be considered. Authors will be notified
of acceptance or rejection by February 14, 2011. The final proceedings
papers must be formatted in accordance with ACM proceedings guidelines;
LaTeX style files will be made available to authors of accepted papers.

Concurrent submission of the same (or essentially the same) abstract to SoCG
and to another conference with published proceedings is not allowed. An
extended abstract of a paper that is under journal review, or scheduled for
publication in a journal after June 2011, may be submitted, when it is clear
that the extended abstract differs substantially from the journal version.
In such cases, the authors must include the journal version in an appendix
that clearly identifies the status of the journal submission.


----- Program Committee -----

# Lars Arge (MADALGO, Aarhus University)
# Esther Arkin (State University of New York at Stony Brook)
# Prosenjit Bose (Carleton University)
# Sergio Cabello (University of Ljubljana)
# Éric Colin de Verdière (École normale supérieure and CNRS, Paris)
# Olivier Devillers (INRIA Sophia Antipolis - Méditerranée)
# Adrian Dumitrescu (University of Wisconsin-Milwaukee)
# Herbert Edelsbrunner (IST Austria and Duke University)
# Joachim Giesen (Universität Jena)
# Joachim Gudmunsson (National ICT Australia, Sydney)
# Ferran Hurtado, co-chair (Universitat Politècnica de Catalunya)
# Naoki Katoh (Kyoto University)
# Klara Kedem (Ben-Gurion University)
# Marc van Kreveld, co-chair (Utrecht University)
# Anna Lubiw (University of Waterloo)
# David Mount (University of Maryland)
# Stefan Schirra (Otto-von-Guericke Universität Magdeburg)
# Micha Sharir (Tel Aviv University)


----- Local Arrangements Committee ------

* Steve Oudot, co-chair (INRIA Saclay - Île-de-France)
* Frédéric Chazal, co-chair (INRIA Saclay - Île-de-France)
* Marc Glisse (INRIA Saclay - Île-de-France)
* Gaëlle Dorkeld (INRIA Paris - Rocquencourt)
* Christine Biard (INRIA Saclay - Île-de-France)


The Call for Video and Multimedia Presentations will be distributed later.
The chair is Jonathan Shewchuck.

---------------------------------------------------------------------
---------------------------------------------------------------------
SOCG Steering Committee (2009-2012)

* Jack Snoeyink, chair (University of North Carolina)
* Mark de Berg, secretary (TU Eindhoven)
* Joe Mitchell (SUNY Stony Brook)
* Guenter Rote (FU Berlin)
* Monique Teillaud (INRIA Sophia Antipolis - Méditerranée)

[DMANET] Two Faculty Positions in Combinatorics & Optimization at the University of Waterloo

The Department of Combinatorics and Optimization
(http://www.math.uwaterloo.ca/CandO_Dept/) at the University of
Waterloo invites applications for two tenure-track faculty positions.

Position #1 is in Operations Research, and
Position #2 is in any one of the of the six main areas covered by the
department: Algebraic Combinatorics, Continuous Optimization, Cryptography,
Discrete Optimization, Graph Theory, and Quantum Computing. Priority areas
for this appointment are Algebraic Combinatorics and Graph Theory.

Both positions require a Ph.D. degree and evidence of excellence in
research and teaching. Successful applicants are expected to maintain
an active program of research, to attract and supervise graduate
students, and to participate in undergraduate and graduate teaching.
In addition, applicants for position #1 are expected to seek out and
participate in industrial collaborations. Salary will depend on the
candidate's qualifications. The effective date of appointment is July
1, 2011.

The intention is to hire at the rank of Assistant Professor for both
positions. We will however consider more senior applications for
position #1.

Interested individuals should apply using the MathJobs site:
http://www.mathjobs.org.

Applications should include a curriculum vitae, research and teaching
statements, and up to three selected reprints/preprints. In addition,
at least three reference letters should be submitted. Inquiries may be
addressed to combopt@math.uwaterloo.ca or to

Jochen Koenemann, Chair,
Department of Combinatorics and Optimization,
University of Waterloo,
Waterloo, Ontario, Canada N2L 3G1.

Closing date for receipt of applications is December 10, 2010.

The University of Waterloo encourages applications from all qualified
individuals, including women, members of visible minorities, native
peoples, and persons with disabilities. All qualified candidates are
encouraged to apply; however, citizens and Permanent Residents of
Canada will be given priority.
**********************************************************
*
* 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] CWI Symposium on Large-Scale and Uncertain Optimization, CWI-Amsterdam, 12 November 2010

(Apologies if you receive multiple copies!)

CALL FOR PARTICIPATION
================================================================

CWI Symposium Day on Large Scale and Uncertain Optimization

CWI, Amsterdam
Turing room (Z011)
Friday 12 November, 2010

Symposium website:
http://homepages.cwi.nl/~monique/Optimization-Symposium-Day/

**** Please register before November 9, 2010 ****
================================================================

Scope

Optimization problems arising from applications such as medical imaging,
radiation therapy, machine learning, shape design of mechanical structures
and more, pose severe challenges due to the large dimensionality of the
design space and the uncertainty affecting the problems' parameters. The
four talks in this symposium present some current methodologies and
computational schemes addressing the above challenges.

Lectures

- Aharon Ben-Tal, Technion, Haifa, and currently CWI Distinguished Scientist
Title: Robust Optimization: The Need, the Challenge, the Success

- Marco Campi, University of Brescia
Title: Risk-Return Trade-Off in Optimization

- Dick den Hertog, Universiteit van Tilburg
Title: Immunizing Convex Quadratic Optimization Problems Against
Implementation Errors

- Arkadi Nemirovski, Georgia Institute of Technology
Title: Accelerating First Order Methods for Large-Scale Well-Structured
Convex Optimization

Details about the programme at
http://homepages.cwi.nl/~monique/Optimization-Symposium-Day/

Participation is free but please register at
http://repos.cwi.nl/library/lectures101112_registratie/

===============================================================
Poster of the symposium available at

http://homepages.cwi.nl/~monique/Optimization-Symposium-Day/Poster_CWI_Optimization_Symposium.pdf
===============================================================
**********************************************************
*
* 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/
*
**********************************************************

LATA 2011: first call for papers

1st Call for Papers

5th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2011)

Tarragona, Spain, May 30 – June 3, 2011

http://grammars.grlmc.com/LATA2011/

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


AIMS:

LATA is a yearly conference in theoretical computer science and its applications. Inheriting the tradition of the International PhD School in Formal Languages and Applications that was developed at Rovira i Virgili University in the period 2002-2006, LATA 2011 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

SCOPE:

Topics of either theoretical or applied interest include, but are not limited to:

- algebraic language theory
- algorithms for semi-structured data mining
- algorithms on automata and words
- automata and logic
- automata for system analysis and programme verification
- automata, concurrency and Petri nets
- cellular automata
- combinatorics on words
- computability
- computational complexity
- computational linguistics
- data and image compression
- decidability questions on words and languages
- descriptional complexity
- DNA and other models of bio-inspired computing
- document engineering
- foundations of finite state technology
- fuzzy and rough languages
- grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
- grammars and automata architectures
- grammatical inference and algorithmic learning
- graphs and graph transformation
- language varieties and semigroups
- language-based cryptography
- language-theoretic foundations of artificial intelligence and artificial life
- neural networks
- parallel and regulated rewriting
- parsing
- pattern recognition
- patterns and codes
- power series
- quantum, chemical and optical computing
- semantics
- string and combinatorial issues in computational biology and bioinformatics
- string processing algorithms
- symbolic dynamics
- term rewriting
- transducers
- trees, tree languages and tree machines
- weighted machines

STRUCTURE:

LATA 2011 will consist of:

- 3 invited talks
- 2 invited tutorials
- refereed contributions
- open sessions for discussion in specific subfields, on open problems, or on professional issues (if requested by the participants)

INVITED SPEAKERS:

To be announced

PROGRAMME COMMITTEE:

Andrew Adamatzky (Bristol)
Cyril Allauzen (Mountain View)
Amihood Amir (Ramat-Gan)
Franz Baader (Dresden)
Marie-Pierre Béal (Marne-la-Vallée)
Philip Bille (Lyngby)
Miklós Bóna (Gainesville)
Symeon Bozapalidis (Thessaloniki)
Vasco Brattka (Cape Town)
Maxime Crochemore (London)
James Currie (Winnipeg)
Jürgen Dassow (Magdeburg)
Cunsheng Ding (Hong Kong)
Rodney Downey (Wellington)
Manfred Droste (Leipzig)
Enrico Formenti (Nice)
Amy Glen (Perth)
Serge Haddad (Cachan)
Shunsuke Inenaga (Fukuoka, co-chair)
Jesper Jansson (Tokyo)
Jarkko Kari (Turku)
Marek Karpinski (Bonn)
Maciej Koutny (Newcastle)
Gregory Kucherov (Lille)
Markus Lohrey (Leipzig)
Benedikt Löwe (Amsterdam)
Salvador Lucas (Valencia)
Sebastian Maneth (Sydney)
Carlos Martín-Vide (Brussels, co-chair)
Giancarlo Mauri (Milano)
Alexander Meduna (Brno)
Kenichi Morita (Hiroshima)
Sven Naumann (Trier)
Gonzalo Navarro (Santiago, CL)
Mark-Jan Nederhof (St Andrews)
Joachim Niehren (Lille)
Joakim Nivre (Uppsala)
Kemal Oflazer (Doha)
Alexander Okhotin (Turku)
Witold Pedrycz (Edmonton)
Dominique Perrin (Marne-la-Vallée)
Giovanni Pighizzini (Milano)
Alberto Policriti (Udine)
Lech Polkowski (Warsaw)
Helmut Prodinger (Stellenbosch)
Mathieu Raffinot (Paris)
Philippe Schnoebelen (Cachan)
Ayumi Shinohara (Sendai)
Jamie Simpson (Perth)
Magnus Steinby (Turku)
James Storer (Boston)
Jens Stoye (Bielefeld)
Andrzej Tarlecki (Warsaw)
Richard Thomas (Leicester)
György Vaszil (Budapest)
Heiko Vogler (Dresden)
Pascal Weil (Bordeaux)
Damien Woods (Pasadena)
Thomas Zeugmann (Sapporo)

ORGANIZING COMMITTEE:

Adrian Horia Dediu (Tarragona)
Shunsuke Inenaga (Fukuoka, co-chair)
Carlos Martín-Vide (Brussels, co-chair)
Bianca Truthe (Magdeburg)

SUBMISSIONS:

Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single-spaced pages and should be formatted according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0). Submissions have to be uploaded at:

http://www.easychair.org/conferences/?conf=lata2011

PUBLICATIONS:

A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.

A special issue of a major journal will be later published containing refereed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.

REGISTRATION:

The period for registration will be open since October 13, 2010 until May 30, 2011. The registration form can be found at the website of the conference: http://grammars.grlmc.com/LATA2011/

Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On-site registration fees: 580 Euro
On-site registration fees (PhD students): 480 Euro

At least one author per paper should register. Papers that do not have a registered author who paid the fees by February 28, 2011 will be excluded from the proceedings.

Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches.

PhD students will need to prove their status on site.

PAYMENT:

Early (resp. late) registration fees must be paid by bank transfer before February 28, 2011 (resp. May 16, 2011) to the conference series account at Uno-e Bank (Julián Camarillo 4 C, 28037 Madrid, Spain):

IBAN: ES3902270001820201823142 - Swift code: UNOEESM1 (account holder: Carlos Martin-Vide – LATA 2011).

Please write the participant's name in the subject of the bank form. Transfers should not involve any expense for the conference. Please notice that the date that counts is the day when the transfer reached the conference's account.

On-site registration fees can be paid only in cash. A receipt for payments will be provided on site.

Besides paying the registration fees, it is required to fill in the registration form at the website of the conference.

IMPORTANT DATES:

Paper submission: January 3, 2011
Notification of paper acceptance or rejection: February 14, 2011
Early registration: February 28, 2011
Final version of the paper for the LNCS proceedings: February 28, 2011
Late registration: May 16, 2011
Starting of the conference: May 30, 2011
Submission to the post-conference special issue: August 30, 2011

FURTHER INFORMATION:

florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

LATA 2011
Research Group on Mathematical Linguistics
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34-977-559543
Fax: +34-977-558386

[DMANET] Sad news

Dear colleagues and dear friends,

it is with a deep sorrow in our hearts that we send you very sad news. Due to a heart attack, last Sunday Bruno Simeone suddenly passed away.

We both had the honor to work with Bruno since our master degree in OR and then for many many years on.

With Bruno, the OR Community loses a prominent scholar and a rigorous teacher, a master and a guide for all of us.
It is a huge emptiness that he leaves in our hearts.

Isabella and Federica

><<+>><<->><<+>><<->><<+>><<->><<+>><
Dr. Federica Ricca
Dipartimento di Scienze Statistiche
Sapienza, Universita' di Roma
P.le Aldo Moro, 5 - 00185 Roma
tel: +39 06 49910474
fax: +39 06 4959241
e-mail: federica.ricca@uniroma1.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/
*
**********************************************************

Monday, October 11, 2010

[DMANET] CPAIOR 2011 - Call for Workshops

Call for Workshops
CPAIOR 2011

Eighth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming

ZUSE INSTITUTE BERLIN - GERMANY

MAY 23 - 27, 2011


Dear colleagues,
the CPAIOR 2011 conference chair invites proposals for the workshop program.

CPAIOR workshops aim to provide an opportunity to present and discuss
ongoing research in small groups. The workshop program will take place on
May 24, as a pre-conference event. All workshops will be full-day and held
in parallel. Workshop participants must register for CPAIOR, there will
be no additional fee for attending a workshop.

Workshop proposals should contain:
- title and a brief description of the workshop, that will be published on
the CPAIOR 2011 homepage
- names and contact information of the proposed organizing committee,
including one person in charge
- discussion of why the workshop is of interest for CPAIOR

Workshop organizers are responsible for:
- creating a website
- organization of technical program, e.g., call for papers and selecting
submissions, inviting attendants for a podium discussion, ...
- formulating the technical program

CPAIOR 2011 conference chair is responsible for:
- local organization
- scheduling workshops in cooperation with the workshop organizers

Important dates:
- proposal due : January 19, 2011
- notification: January 26, 2011
- website URL and Call for Paper/Participation due: February 9, 2011

All proposals should be submitted via e-mail to the organizing committee:
cpaior@zib.de

Best regards,
Timo Berthold on behalf of
the CPAIOR 2011 conference chair

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

12th ACM Conference on Electronic Commerce (EC'11), San Jose, June 5-9 2011

CALL FOR PAPERS, WORKSHOPS, AND TUTORIALS

 Twelfth ACM Conference on Electronic Commerce (EC'11)
 June 5-9, 2011, San Jose, California, USA
            http://www.sigecom.org/ec11/

Part of the Federated Computing Research Conference (FCRC),
http://www.acm.org/fcrc/.

Since 1999 the ACM Special Interest Group on Electronic Commerce
(SIGECOM) has sponsored the leading scientific conference on advances
in theory, systems, and applications for electronic commerce. The
Twelfth ACM Conference on Electronic Commerce (EC'11) will feature
invited speakers, paper presentations, workshops, and tutorials
covering all areas of electronic commerce.

The natural focus of the conference is on computer science issues, but
the conference is interdisciplinary in nature, addressing research
related to (but not limited to) the following topics:

Applications, Empirical and Experimental Studies, including

o       Consumer search and online behavior
o       Crowdsourcing and collective intelligence
o       Prediction/information markets
o       Social and economic networks
o       Experience with e-commerce systems and markets
o       Pricing for quality of service
o       Web analysis and characterization for e-commerce
o       Open access publishing
o       User contributed content
o       Economics of online textual content
o       Behavioral and experimental economics related to e-commerce

Theory and Foundations, including

o       Computational aspects of economics, game theory, finance, and social choice
o       Algorithmic mechanism design
o       Auction and negotiation technology
o       Formation of supply chains, coalitions, and virtual enterprises
o       Agency and contract theory in e-commerce
o       Game-theoretic aspects of e-commerce and the Internet
o       Preferences and decision theory
o       Economics of information
o       Economics of networks

Architectures and Languages, including

o       Peer-to-peer, grid, and other open distributed systems
o       Mobile commerce
o       Software and systems requirements, architectures, and performance
o       Languages for describing agents, goods, services, and contracts

Automation, Personalization, and Targeting, including

o       AI and autonomous agent systems in e-commerce
o       Automated shopping, trading, and contract management
o       Recommendation, reputation, and trust systems
o       Advertising and marketing technology
o       Sponsored web search, viral marketing
o       Databases and data mining
o       Machine learning for e-commerce applications
o       Mobile and location-based services
o       Search and information retrieval for e-commerce

Security, Privacy, Encryption, and Digital Rights, including

o       Intellectual property and digital rights management
o       Digital payment systems
o       Authentication
o       Privacy-enhancing technologies
o       Economics of information security and privacy
o       Economics of intellectual property and digital rights

Social factors, including

o       Usability of e-commerce systems
o       Human factors in security and privacy
o       Human factors in agents and mechanism design for e-commerce
o       Legal, policy, and social issues
o       Impact of social networks

The conference will be held from Sunday, June 5 through Thursday June 9
in San Jose, California, as part of the FCRC conference.  Tutorials and
Workshops will be held on Sunday June 5 and Monday June 6. Accepted
technical papers and invited talks will be presented from Tuesday
June 7 through Thursday June 9, 2011.

PAPER SUBMISSION

The conference is soliciting full papers (as well as workshop and
tutorial proposals; see below) on all aspects of electronic commerce.
Submitted papers will be evaluated on significance, originality,
technical quality, and exposition. They should clearly establish the
research contribution, its relevance to electronic commerce, and its
relation to prior research. Submissions to be considered for
publication in the archival ACM proceedings may be up to 10 pages
(including the bibliography), in 10-point font, double-column format,
with reasonable margins and interline spacing. Additional details may
be included in appendices beyond the 10 page limit but will only be
read at the discretion of the reviewers.

Results previously published in another conference proceedings or journal
(or scheduled for publication prior to EC) will not be accepted at EC.
Simultaneous submissions of the results to another conference with a
published proceedings is not allowed.

All accepted submissions will need to be migrated to the publisher's
format/macros for the proceedings. Instructions will be given by the
publisher after the paper is accepted. Accepted papers will be
presented at the conference in one of two formats: (1) a long oral
presentation or (2) a short oral presentation. Presentation format
will be chosen by the program committee with the goal of encouraging
breadth and diversity among presentations. Presentation format will
have no bearing on how papers appear in the archival conference
proceedings: all accepted papers will be allotted 10 pages in the
proceedings.

IMPORTANT NOTICE: To accommodate the publishing traditions of
different fields, authors may instead submit working papers that are
under review or nearly ready for journal review. These submissions
will be subject to review and considered for presentation at the
conference but only a one page abstract will appear in the proceedings
with a URL that points to the full paper and that will be reliable for
at least two years. Open access is preferred although the paper can be
hosted by a publisher who takes copyright and limits access, as long
as there is a link to the location. Electronic submission is required,
and the title page should state clearly that the submission is a working
paper.  Details on the submission procedure will be made available on the
main conference web page.

WORKSHOP AND TUTORIAL PROPOSALS

The conference is soliciting proposals for tutorials and workshops to
be held in conjunction with the conference. Tutorial proposals should
contain the title of the tutorial, a two-page description of the topic
matter, the names and short biographies of the tutor(s), and
dates/venues where earlier versions of the tutorial were given (if
any). Workshop proposals should contain the title of the workshop, the
names and short biographies of the organizers, and the names of
confirmed or candidate participants. Workshop proposals should also
include a two-page description describing the theme, the reviewing
process for participants, the organization of the workshop, and
required facilities for the workshop. Informal suggestions for
workshop or tutorial ideas can also be sent without a full proposal to
the workshop and tutorial chairs at any time. Submission information
can be found on the conference website.

KEY DATES

o       February 4, 2011: Full electronic paper submissions due
      Instructions will be posted at http://www.sigecom.org/ec11/
o       February 8, 2011: Workshop and Tutorial proposals due
      Send to: ec11-workshops-chair@acm.org and ec11-tutorial-chair@acm.org.
o       March 1, 2011: Tutorial & workshop proposal accept/reject
                      notifications
o       March 15, 2011: Paper Accept/Reject Notifications
o       March 31, 2011: Camera-ready copies arrive at the publisher
o       June 5-6, 2011: Conference Workshops and Tutorials, San Jose, CA, USA
o       June 7-9, 2011: Conference Technical Program, San Jose, CA, USA

ORGANIZING COMMITTEE

General Chair:  Yoav Shoham, Stanford University

Program Chairs: Yan Chen, University of Michigan and
Tim Roughgarden, Stanford University

Workshop Chair: Sanmay Das, Rensselaer Polytechnic Institute

Tutorial Chair: Vahab Mirrokni, Google

Senior Program Committee:

Craig Boutilier         University of Toronto
Felix Brandt            Technische Universität München
Shuchi Chawla           University of Wisconsin
David Easley            Cornell University
Joan Feigenbaum         Yale University
Anindya Ghose           NYU
Jason Hartline          Northwestern University
Ramesh Johari           Stanford University
Robert Kleinberg        Cornell University
Kevin Leyton-Brown      University of British Columbia
John Morgan             UC Berkeley
Rudolf Mueller          Maastricht University
Michael Ostrovsky       Stanford University
Christos Papadimitriou  UC Berkeley
David Reiley            Yahoo! Research
Rahul Sami              University of Michigan
Michael Wellman         University of Michigan
Berthold Voecking       Aachen University

FURTHER INFORMATION

More information and details are available at the conference web site:
http://www.sigecom.org/ec11/

General inquiries and requests pertaining to the conference should be
sent to: ec11-general-chair@acm.org

Inquiries and requests pertaining specifically to the program, and in
particular to paper submission and decision status, should be sent to:
ec11-pc-chairs@acm.org

Inquiries and requests pertaining specifically to workshop and tutorials
should be sent to: ec11-workshops-chair@acm.org and
ec11-tutorial-chair@acm.org.

[DMANET] Invitation to VRP track at IFORS 2011

19th Triennial Conference of the International Federation of Operational Research Societies (IFORS)
10th - 15th July, 2011
Melbourne, Australia

Invited Stream on Vehicle Routing

The IFORS Conference in Melbourne promises to be an exciting meeting with a
strong programme covering many areas of Operational Research.
We are organising an invited stream on Vehicle Routing. This includes all aspects of the topic including:
- arc routing
- location-routing
- routing with environmental objectives

- inventory routing

- VRP for humanitarian needs (or organizations)

- "Rich" VRP's (i.e. Real-world routing, with real-world constraints)

- combined problems, e.g. VRP with supply chain

- time-dependent travel times

- VRPs with stochastic aspects

- dynamic (and/or on-line) aspects of VRP

- and other related themes.

If you would like to organise an invited session of four papers or would
like to submit a paper to our stream, please contact one of us as soon as possible.


The deadline is 31st of January 2011.

We hope to see you in Melbourne.

Richard Eglese R.Eglese@Lancaster.ac.uk<mailto:R.Eglese@Lancaster.ac.uk>
Arne Lokketangen Arne.Lokketangen@HiMolde.no<mailto:Arne.Lokketangen@HiMolde.no>
**********************************************************
*
* 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] 2 Research positions - Algorithms and Complexity

Please pass this on if you know any suitable candidates.
Thanks! Leslie and Mark.
==========================================================================
2 Research positions - Algorithms and Complexity

University of Liverpool (Department of Computer Science), and
Queen Mary, University of London (School of Mathematical Sciences)

This is a preliminary announcement of two 3-year postdoctoral
research fellowships in connection with an EPSRC-funded project
"Computational Counting"
held by professors Martin Dyer (Leeds), Leslie Ann Goldberg (Liverpool)
and Mark Jerrum (Queen Mary, London).
See http://www.csc.liv.ac.uk/~leslie/counting.html

One position will be held at the University of Liverpool, and the other at
Queen Mary, University of London. Both positions are for three years.
Starting salary: 31,671 GBP (plus a London allowance of 1,988 GBP).
The start date is 01 March 2011, though a later start date may be
negotiable. Suitable candidates will have a PhD in algorithms and
computational complexity or a closely related area of discrete
mathematics.

The project will involve close collaboration between the three sites,
and the research fellows will join active research groups in algorithms
and complexity and combinatorics at Liverpool and Queen Mary.

Further information may be obtained by writing to the grant holders.
Please indicate interest by contacting BOTH

Leslie Ann Goldberg L.A.Goldberg@liverpool.ac.uk and
Mark Jerrum M.Jerrum@qmul.ac.uk

Please note: this is a PRELIMINARY announcement; the formal application
procedure will be announced soon on the above web page, and potential
candidates must follow this procedure to apply for the position. Contact
the grant holders (see above) for details.

--
| Paul W. Goldberg | Dept. of Computer Science |
| P.W.Goldberg@liverpool.ac.uk | University of Liverpool |
| http://www.csc.liv.ac.uk/~pwg/ | Ashton Building, Ashton St. |
| phone: +44 151 7954259 | Liverpool L69 3BX, 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/
*
**********************************************************

Sunday, October 10, 2010

Two postdocs available in complexity

2  Research positions - Algorithms and Complexity

University of Liverpool (Department of Computer Science), and
Queen Mary, University of London (School of Mathematical Sciences)

This is a preliminary announcement of two 3-year postdoctoral
research fellowships in connection with an EPSRC-funded project
"Computational Counting"
held by professors Martin Dyer (Leeds), Leslie Ann Goldberg (Liverpool)
and Mark Jerrum (Queen Mary, London).
See http://www.csc.liv.ac.uk/~leslie/counting.html

One position will be held at the University of Liverpool, and the other at
Queen Mary, University of London. Both positions are for three years.
Starting salary: 31,671 GBP (plus a London allowance of 1,988 GBP ).
The start date is 01 March 2011, though a later start date may be negotiable.

Suitable candidates will have a PhD in algorithms and computational complexity
or a closely related area of discrete mathematics.

The project will involve close collaboration between the three sites,
and the research fellows will join active research groups in algorithms
and complexity and combinatorics at  Liverpool and Queen Mary.

Further information may be obtained by writing to the grant holders.
Please indicate interest by contacting BOTH

Leslie Ann Goldberg  L.A.Goldberg@liverpool.ac.uk and
Mark Jerrum M.Jerrum@qmul.ac.uk

Please note: this is a PRELIMINARY announcement; the formal
application procedure will be announced soon on the above web page, and potential candidates
must follow this procedure to apply for the position. Contact the
grant holders (see above) for details.


[DMANET] Ph.D. Position Information Theory, Chalmers University of Technology, Gothenburg, Sweden

A Ph.D. position is available at the Department of Signals and Systems,
Chalmers University of Technology, Gothenburg, Sweden.

***Job description***
The main research objective for the Ph.D. student position is to assess
the impact of channel uncertainty, imperfect synchronization, and
transceiver impairments on the capacity of wireless networks. The
analysis, which should be conducted by means of information theoretic
tools, is expected to yield novel low-complexity protocols and coding
schemes for real-world wireless networks. The position is for a period
of maximum five years. Up to 20% of this time will be used for
undergraduate teaching and other departmental work, and the remaining
part is spent on completing the research and courses required for a
Ph.D. degree. A monthly salary is paid. The position can commence in
January 2011.

***Required qualifications***
You should have a Master of Science degree in Electrical Engineering,
Engineering Physics, Applied Math, or similar, and high grades in the
core courses. You should have an interest in digital communications and
wireless systems. A strong background in mathematics is required;
knowledge of information theory is an advantage but not a prerequisite.
You should be fluent in English, have good collaboration skills, and be
able to communicate your results in writing and in presentations.

***How to apply***
Please, visit

http://www.chalmers.se/s2/EN/news/vacancies-at-signals/positions/phd-student-position-in8488


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

Saturday, October 9, 2010

ESA 2010

--------------------------------------------------------------------
FIRST CALL FOR PAPERS

ESA 2011
19th European Symposium on Algorithms

Saarbruecken, Germany
September 5-7, 2011


--------------------------------------------------------------------
GENERAL INFORMATION

The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2011 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2011 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2011.


--------------------------------------------------------------------
TOPICS

Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:

Algorithmic aspects of networks - Algorithmic game theory -
Approximation algorithms - Combinatorial optimization -
Computational biology - Computational finance - Distributed
algorithms - Computational geometry - Data compression - Data
structures - Databases and information retrieval - Graph algorithms
- Hierarchical memories - Machine learning - Mathematical
programming - Mobile computing - On-line algorithms - Parallel
algorithms - Parametrized complexity - Pattern matching - Quantum
computing - Randomized algorithms - Streaming algorithms.


--------------------------------------------------------------------
SUBMISSION GUIDELINES

Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.

* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: simply use the LNCS style file
as given.

* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.

These guidelines are *strict*: papers failing to adhere to the
guidelines (by not being in LNCS format, being more than 12 pages,
or not providing the omitted proofs in an appendix) will be
rejected without consideration of their merits. (Last year 12
papers were rejected for not following the guidelines strictly.)

Papers should be submitted electronically via the EasyChair
submission system, accessible via the conference website.
Simultaneous submission to other conferences with published
proceedings, or to both tracks of ESA 2011, is not permitted. There
will be a Best Student Paper Award, as well as a Best Paper Award.
The ESA proceedings will be published in the Lecture Notes in
Computer Science series by Springer-Verlag.


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

* Submission deadline: Tuesday, April 19, 2011
* Notification: Friday, June 17, 2011
* Final version due: Friday, July 9, 2011
* Symposium: September 5-7, 2011 (Saarbruecken, Germany)


--------------------------------------------------------------------
MORE INFORMATION

ESA 2011 will be co-located with IPEC (6th International Symposium
on Exact and Parameterized Computing, September 5-7), WABI (11th
Workshop on Algorithms in Bioinformatics, September 5-7), ATMOS
(11th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 7), WAOA (9th
Workshop on Approximation and Online Algorithms, September 8-9), and
ALGOSENSORS (7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 8-9).


--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK

o Magnus M. Halldorsson (chair), Reykjavik University
o Therese Biedl, University of Waterloo
o Philip Bille, Technical University of Denmark
o Allan Borodin, University of Toronto
o Amr Elmasry, University of Copenhagen
o Sandor Fekete, TU Braunschweig
o Martin Furer, Penn State University
o Cyril Gavoille, University of Bordeaux
o Fabrizio Grandoni, University of Rome Tor Vergata
o Tao Jiang, UC Riverside
o Dieter Kratsch, University Paul Verlaine - Metz
o James R. Lee, University of Washington
o Daniel Lokshtanov, UC San Diego
o Pradipta Mitra, Reykjavik University
o Yoshio Okamoto, JAIST
o Guido Schaefer, CWI & VU University Amsterdam
o Danny Segev, University of Haifa
o Hadas Shachnai, Technion
o Cliff Stein, Columbia University
o Ileana Streinu, Smith College
o Takeshi Tokuyama, Tohoku University


--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK

o Camil Demetrescu (chair), Sapienza University of Rome
o Umut Acar, Max Planck Institute for Software Systems
o Michael Bender, SUNY Stony Brook
o Alberto Caprara, University of Bologna
o Carlos Castillo, Yahoo! Research Barcelona
o Graham Cormode, AT&T Labs--Research
o Daniel Delling, Microsoft Research--Silicon Valley
o Thomas Erlebach, University of Leicester
o Rudolf Fleischer, Fudan University
o Monika Henzinger, University of Vienna
o Michael Juenger, University of Cologne
o Ian Munro, University of Waterloo
o Sotiris Nikoletseas, University of Patras and CTI
o Rasmus Pagh, IT University of Copenhagen
o Bettina Speckmann, TU Eindhoven


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

o Kurt Mehlhorn (chair), Max Planck Institute for Computer Science
o Christina Fries, Max Planck Institute for Computer Science
--------------------------------------------------------------------

--
________________________________________________________oo_____
Camil Demetrescu, Ph.D. - http://www.dis.uniroma1.it/~demetres
Dept. of Computer and System Sciences, Sapienza Univ. of Rome
Via Ariosto, 25 - 00185 Roma, Italy, ph. +39-06-77274-115

[DMANET] ESA 2011 - First Call for Papers

--------------------------------------------------------------------
FIRST CALL FOR PAPERS

ESA 2011
19th European Symposium on Algorithms

Saarbruecken, Germany
September 5-7, 2011


--------------------------------------------------------------------
GENERAL INFORMATION

The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2011 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2011 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2011.


--------------------------------------------------------------------
TOPICS

Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:

Algorithmic aspects of networks - Algorithmic game theory -
Approximation algorithms - Combinatorial optimization -
Computational biology - Computational finance - Distributed
algorithms - Computational geometry - Data compression - Data
structures - Databases and information retrieval - Graph algorithms
- Hierarchical memories - Machine learning - Mathematical
programming - Mobile computing - On-line algorithms - Parallel
algorithms - Parametrized complexity - Pattern matching - Quantum
computing - Randomized algorithms - Streaming algorithms.


--------------------------------------------------------------------
SUBMISSION GUIDELINES

Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.

* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: simply use the LNCS style file
as given.

* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.

These guidelines are *strict*: papers failing to adhere to the
guidelines (by not being in LNCS format, being more than 12 pages,
or not providing the omitted proofs in an appendix) will be
rejected without consideration of their merits. (Last year 12
papers were rejected for not following the guidelines strictly.)

Papers should be submitted electronically via the EasyChair
submission system, accessible via the conference website.
Simultaneous submission to other conferences with published
proceedings, or to both tracks of ESA 2011, is not permitted. There
will be a Best Student Paper Award, as well as a Best Paper Award.
The ESA proceedings will be published in the Lecture Notes in
Computer Science series by Springer-Verlag.


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

* Submission deadline: Tuesday, April 19, 2011
* Notification: Friday, June 17, 2011
* Final version due: Friday, July 9, 2011
* Symposium: September 5-7, 2011 (Saarbruecken, Germany)


--------------------------------------------------------------------
MORE INFORMATION

ESA 2011 will be co-located with IPEC (6th International Symposium
on Exact and Parameterized Computing, September 5-7), WABI (11th
Workshop on Algorithms in Bioinformatics, September 5-7), ATMOS
(11th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 7), WAOA (9th
Workshop on Approximation and Online Algorithms, September 8-9), and
ALGOSENSORS (7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 8-9).

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

o Kurt Mehlhorn (chair), Max Planck Institute for Computer Science
o Christina Fries, Max Planck Institute for Computer Science
--------------------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************