[DMANET] 1st CfP --- International Conference on OPERATIONS RESEARCH, September 1-3, Munich 2010

International Conference on OPERATIONS RESEARCH
"Mastering Complexity"
MUNICH 2010

September 1-3, 2010
Munich, Germany

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

http://www.or2010.de

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

CALL FOR PAPERS

This conference is the 2010 edition of the annual International
OR conference organised by the German OR society. In 2010, the
overall theme is "Mastering Complexity". Complexity is a natural
component of the globalization process. Financial markets, traffic
systems, network topologies and, last but not least, energy
resource management, all contain complex behaviour and economic
interdependencies which necessitate a scientific solution.
Operations Research is one of the key instruments to model,
simulate and analyze such systems. In the process of developing
optimal solutions, suitable heuristics and efficient procedures
are some of the challenges which will be discussed at this
conference.

The conference is organised by the German OR society
(https://www.gor-online.org) together with this year's partner,
the Italian OR society (http://www.airo.org).
We are very grateful for this special endorsement!

TOPICS

I.1 Forecasting, Data Mining and Machine Learning -
Renato de Leone
I.2 Game Theory and Experimental Economics - Karl Morasch
I.3 Managerial Accounting - Matthias Amen
I.4 Financial Modelling and Numerical Methods - Daniel Roesch
I.5 Pricing and Revenue Management - Alf Kimms
I.6 Quantitative Models for Performance and Dependability -
Markus Siegle
I.7 Business Informatics and Artificial Intelligence -
Andreas Fink

II.1 Traffic, Transportation and Logistics - M. Grazia Speranza
II.2 Discrete Optimization, Graphs & Networks -
Sven Oliver Krumke
II.3 Stochastic Programming - Ruediger Schultz
II.4 Continuous Optimization - Oliver Stein
II.5 Production and Service Management - Marion Steven
II.6 Supply Chain Management & Inventory - Herbert Meyr
II.7 Scheduling and Project Management - Rainer Kolisch

III.1 Environmental Management - Paola Zuddas
III.2 Energy Markets - Hans-Georg Zimmermann
III.3 Health Care - Teresa Melo
III.4 Multiple Criteria Decision Making - Jutta Geldermann
III.5 Systems Modeling and Simulation - Grit Walther
III.6 OR in Life Sciences and Education - Trends, History and Ethics -
Gerhard-Wilhelm Weber
III.7 Young Scientist's Session: First results of on-going PhD-projects -
Stefan Pickl

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

INVITED SPEAKERS

Roland Bulirsch (TU Munich, Bay. Akademie der Wissenschaften)
Thomas Reiter (Dt. Zentrum fuer Luft- und Raumfahrt)
Dirk Taubner (msg systems)

Wolfgang Achtziger (TU Dortmund)
Wolfgang Bein (Univ. of Nevada)
Simon Benninga (Tel Aviv Univ. and Wharton)
Marielle Christiansen (Norwegian Univ. of Science and Technology)
Robert Fourer (Northwestern Univ.)
Erwin Hans (Univ. of Twente)
Boudewijn Haverkort (Univ. of Twente and ESI Eindhoven)
Ulrike Leopold-Wildburger (Univ. Graz)
Winfried Matthes (Univ. Wuppertal)
Mike Pidd (Lancaster Univ.)
Georg Pflug (Univ. Vienna)
Karim Sadrieh (Univ. Magdeburg)
Ahti Salo (Helsinki Univ. of Technology)
Carlo Vercellis (Politecnico Di Milano)

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

There will be an on-site book of abstracts. Post-conference
proceedings of selected papers will be published by Springer.

The conference will take place on the campus of the University of
the German Armed Forces in Munich. This University was founded in
1973 with the aim of providing officers and officer candidates
with a university education that would also prepare them for
civilian careers. Since its founding, the number of students has
been rising steadily: today there are around 3,700 registered
students, including 360 women, 50 civilians, and 150
international students and officers.

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

IMPORTANT DATES

Abstract submission (max 1800 characters) *April 30, 2010*

Extended Abstract submission (6 pages) *July 15, 2010*

Final Extended Abstracts
for post-conference proceedings (6 pages) *Oct 15, 2010*

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

PROGRAM COMMITTEE

CHAIR
Stefan Pickl (Universitt der Bundeswehr Muenchen)
Markus Siegle (Universitt der Bundeswehr Muenchen)

CO-CHAIR

Bernhard Fleischmann (U Augsburg)
Renato de Leone (U Camerino / Italy)
Hans-Jakob Luethi (ETH Zuerich / Switzerland)
Stefan Nickel (U Karlsruhe TH)
Erwin Pesch (U Siegen)
Gerhard-Wilhelm Weber (METU Ankara / Turkey)
Brigitte Werners (U Bochum)

ORGANISING COMMITTEE

CHAIR
Bo Hu (Universitaet der Bundeswehr Muenchen)
Karl Morasch (Universitaet der Bundeswehr Muenchen)

CO-CHAIR
Stefan Pickl (Universitaet der Bundeswehr Muenchen)
Markus Siegle (Universitaet der Bundeswehr Muenchen)
Gerhard-Wilhelm Weber (METU Ankara / Turkey)

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

CONTACT

CONFERENCE SECRETARIAT
Annemarie Fischaleck
Gabriela Karasz
Phone +49-89-6004-4766
Fax +49-89-6004-3561

ADMINISTRATION
Tino Krug
Phone +49-89-6004-2252

ADDRESS
Werner-Heisenberg-Weg 39
85577 Neubiberg
contact@OR2010.de
www.OR2010.de
**********************************************************
*
* 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] PASCO 2010: News and 2nd Call for Papers

(Please accept our apologies if you receive this message multiple times)

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

Parallel Symbolic Computation 2010 (PASCO 2010)

July 21-23, 2010 -- Grenoble, France

http://pasco2010.imag.fr/

Second Announcement and

C A L L f o r P A P E R S

News:
- PASCO 2010 Programming contest
- PASCO 2010 in cooperation with ACM

Overview:

The International Workshop on Parallel and Symbolic Computation (PASCO)
is a series of workshops dedicated to the promotion and advancement of
parallel algorithms and software in all areas of symbolic mathematical
computation. The pervasive ubiquity of parallel architectures and
memory hierarchy has led to the emergence of a new quest for parallel
mathematical algorithms and software capable of exploiting the various
levels of parallelism: from hardware acceleration technologies (multi-
core and multi-processor system on chip, GPGPU, FPGA) to cluster and
global computing platforms. To push up the limits of symbolic and
algebraic computations, beyond the optimization of the application
itself, the effective use of a large number of resources --memory
and general or specialized computing units-- is expected to enhance
the performance multi-criteria objectives: time, energy consumption,
resource usage, reliability. In this context, the design and the
implementation of mathematical algorithms with provable and adaptive
performances is a major challenge.

Earlier meetings in the PASCO series include PASCO'94 (Linz, Austria),
PASCO'97 (Maui, U.S.A.), PASCO'07 (London, Canada).
PASCO 2010 is affiliated with the 2010 International Symposium on
Symbolic and Algebraic Computation (ISSAC) in Munich, Germany.
Immediately prior to the ISSAC 2010 meeting, PASCO will be held in
Grenoble, France.

The workshop PASCO 2010 will be a three-day event including invited
presentations and tutorials, contributed research papers and posters,
and a programming contest.
Specific topics include, but are not limited to:
* Design and analysis of parallel algorithms for computer algebra
* Practical parallel implementation of symbolic or symbolic-numeric
algorithms
* High-performance software tools and libraries for computer algebra
* Applications of high-performance computer algebra
* Distributed data-structures for computer algebra
* Hardware acceleration technologies (multi-cores, GPUs, FPGAs) applied
to computer algebra
* Cache complexity and cache-oblivious algorithms for computer algebra
* Compile-time and run-time techniques for automating optimization and
platform adaptation of computer algebra algorithms

Call for Papers:

The conference invites submission of papers presenting original
research, either in the form of extended abstracts (2 pages) or
full papers (up to 10 pages) in ACM format. As in previous years,
PASCO 2010 will publish formal proceedings of the accepted papers.

The PASCO 2010 Conference proceedings will be published by the
Association for Computing Machinery (ACM) http://www.acm.org/ and
will be made available in the ACM Digital Library.

Programming Contest:

A programming contest will be organized during the PASCO 2010 meeting.
Each participating team will be competing on one or more programming
challenges proposed by the organizing committee and by the participants.
Details can be found at the PASCO 2010 web site.

Important Dates

Paper submission deadline: April 2 (Fri), 2010
Programming Challenge proposal April 2 (Fri), 2010
Notification of acceptance: May 10 (Mon), 2010
(for papers and challenge proposals)
Camera-ready version of paper due: May 28 (Fri), 2010
Intent of participation to the contest: May 28 (Fri), 2010
Tutorials and Workshop in Grenoble: July 21-23 (Wed-Fri), 2010

Conference Chairs:

Marc Moreno Maza (University of Western Ontario, Canada)
<moreno@csd.uwo.ca>
Jean-Louis Roch (Grenoble University, France)
<jlroch@imag.fr

Local Arrangements Chairs:

Jean-Guillaume Dumas (Grenoble University, France)
<jean-guillaume.dumas@imag.fr
Thierry Gautier (INRIA Grenoble, France)
<thierry.gautier@imag.fr>
Clement Pernet (Grenoble University, France)
<clement.pernet@imag.fr>

Publicity Chair:

Daniel Cordeiro (Grenoble University, France)
<daniel.cordeiro@imag.fr>

Administration:

Daniele Herzog (INRIA Grenoble, France)
<daniele.herzog@inrialpes.fr>
Christian Seguy (CNRS, France)
<christian.seguy@imag.fr>
Ahlem Zammit-Boubaker (INRIA Grenoble, France)
<ahlem.zammit-boubaker@inrialpes.fr>

Links:

PASCO 2010 http://pasco2010.imag.fr/
ISSAC 2010 http://www.issac-conference.org/2010/

Submission http://www.easychair.org/conferences/?conf=pasco2010

**********************************************************
*
* 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] Associate professor position in Discrete Optimization

Position in Discrete Optimization

The laboratory LAMSADE (CNRS FRE 3234,
http://www.lamsade.dauphine.fr/) of the University Paris Dauphine,
Paris, France, invites applications for an associate professor
position. The position will start September 1st, 2010.

The candidate will join "Combinatorial optimization, algorithmic and
data" team of LAMSADE. The research activities of this team are
around approximation algorithms, integer programming, polyhedral
combinatorics and algorithms for massive data. We are seeking
candidates developing research activities in approximation algorithms
and in particular complexity and approximation aspects of
combinatorial optimization problems, robustness, multicriteria
optimization, security,...Nevertheless, any person with interest
research activities close to the research areas developed in our team
are also invited to apply.

The candidate will be expected to also contribute to the Department's
graduate and undergraduate teaching activities in theoretical
computer science. Applicants must speak French.

For more information, please contact Cristina Bazgan
(bazgan@lamsade.dauphine.fr)
and Vangelis Paschos (paschos@lamsade.dauphine.fr) and Ridha Mahjoub
(mahjoub@lamsade.dauphine.fr)

The official deadline for the applications is March 25, 2010, but
please contact us as soon as possible.

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

[DMANET] CFP: Hybrid Methods for Nonlinear Combinatorial Problems

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

Call for Papers

for the workshop on

Hybrid Methods for Nonlinear Combinatorial Problems

to be held in conjunction with the
international conference CPAIOR 2010

Bologna, Italy
June 15, 2010

http://sites.google.com/site/hybridnl2010/

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

The focus of this workshop is on solution techniques for nonlinear
combinatorial problems, which arise in many practical industrial and
financial applications. Two main approaches to optimally solving such
problems are Mixed-Integer Nonlinear Programming (MINLP) and
Constraint Programming (CP). In addition, Local Search (LS) techniques
are usually applied to obtain heuristic solutions. The workshop will
aim at theoretical and algorithmic work as well as practical
applications.

The main motivation for this workshop is the observation that
nonlinear combinatorial problems can be extremely difficult to solve
optimally with existing methods, while doing so could result in huge
gains (e.g., in terms of profit or cost reduction). The nonlinear
optimization aspect may for example be handled efficiently by MINLP,
while this is more difficult for CP. On the other hand, a highly
combinatorial substructure, such as a scheduling problem, can be
handled by CP very effectively, while this is not the case for MINLP
due to linearizations. Therefore, a hybrid method has the potential to
effectively combine the strengths of both approaches (or even more),
as witnessed by several successful applications of such hybrid methods
to date.

The organizing committee invites submissions of extended abstracts
(max 5 pages) or research papers (max 15 pages) describing original
work. Topics of interest include (but are not limited to):

o CP-based domain filtering/bounds reduction techniques for MINLP
o MINLP-based domain filtering/bounds reduction techniques for CP
o Interval analysis for bounds reduction
o Improving nonlinear constraints in CP through MINLP techniques
o Decomposition techniques (e.g., Benders, Column Generation) that
combine NLP, MINLP, CP, or LS
o Successful applications of hybrid CP/MINLP/LS methods
o Applications of Nonlinear Combinatorial Problems that are very
challenging and might benefit from a hybrid approach

After a reviewing process, a selection of papers will be invited
to be presented during the workshop. The selected papers will be
published during the workshop and on the workshop website. It is
expected that workshop participants will also attend CPAIOR.

Abstracts/papers can be submitted by email to:
belotti@lehigh.edu (Pietro Belotti)

Important Dates:

March 20, 2010: Abstract/paper submission due
April 10, 2010: Notification of acceptance
April 24, 2010: Abstract/paper final version due
June 15, 2010: Workshop date

Organizing Committee:

Pietro Belotti, Lehigh University (co-chair)
Laurent Granvilliers, University of Nantes
Stefano Gualandi, Politecnico di Milano
Willem-Jan van Hoeve, Carnegie Mellon University (co-chair)
Leo Liberti, LIX, Ecole Polytechnique
Andrea Lodi, University of Bologna

**********************************************************
*
* 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] Stellenausschreibung wissenschaftliche/r MitarbeiterIn 13 TVL in Mathematik/OR an der Uni Trier

Im Fachbereich IV der Universität Trier, Abteilung Mathematik, Professur für
Operations Research, ist zum nächstmöglichen Zeitpunkt die befristete
Stelle (für bis zu 3 Jahre) einer/s

Wissenschaftlichen Mitarbeiterin/Mitarbeiters

mit Lehrverpflichtung von voraussichtlich 2 Wochenstunden zu besetzen. Die
Vergütung erfolgt nach 3/4 Entgeltgruppe 13 TVL.

Voraussetzung für die Einstellung ist ein überdurchschnittlich abgeschlossenes
Hochschulstudium der Mathematik (oder Informatik), möglichst mit Schwerpunkt in
Operations Research (z.B. kombinatorische Optimierung, ganzzahlige Optimierung
oder Auktionen). Programmierkenntnisse sind wünschenswert.

Geboten wird die Chance, in einem hochmotivierten, interdiziplinären, jungen
Team einer neu besetzten Professur mit vielfältigen internationalen
Kooperationen mitzuarbeiten. Dadurch sind exzellente Möglichkeiten zur
Promotion oder weiteren wissenschaftlichen Qualifikation in Mathematik gegeben.

Das Aufgabengebiet umfasst ferner die üblichen Tätigkeiten von
wissenschaftlichen Mitarbeiterinnen und Mitarbeitern, also insbesondere die
Betreuung von Studierenden etwa im Rahmen von Lehrveranstaltungen.

Schwerbehinderte werden bei entsprechender Eignung bevorzugt eingestellt.

Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Zeugnisse) werden erbeten
bis zum 29. März 2010 an

Universität Trier
FB IV - Mathematik
Professur für OR
Prof. Dr. S. de Vries
54286 Trier

(oder per e-Mail).

Wir bitten, Bewerbungsunterlagen nicht in Mappen oder Hüllen und auch nur als
unbeglaubigte Kopien vorzulegen, da die Unterlagen nicht zurückgesandt werden;
sie werden nach Abschluss des Auswahlverfahrens vernichtet.
**********************************************************
*
* 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/
*
**********************************************************

ICS 2011

The Second Symposium on Innovations in Computer Science (ICS 2011) will be held in Beijing, China, January 7-9, 2011, with a welcome reception on January 7.

http://conference.itcs.tsinghua.edu.cn/ICS2011/

Innovations in Computer Science (ICS)  is a new conference in theoretical computer science (TCS), broadly construed. ICS seeks to promote research that carries a strong conceptual message (e.g., introducing a new concept or model, opening a new line of inquiry within traditional or cross-disciplinary areas, or introducing her aligned with current TCS research directions or deviating from them. 

ICS is a public conference designed to run in a workshop-like environment. The event will take place over two-and-a-half days. The total number of papers will be around 30, so as to allow for ample time for open and one-on-one discussions and exchanges of ideas.

Steering Committee: Sanjeev Arora, Manuel Blum, Bernard Chazelle, Oded Goldreich, Shafi Goldwasser, Richard Karp, Silvio Micali, Christos Papadimitriou, Michael Rabin, Madhu Sudan, Leslie Valiant, Umesh Vazirani, Avi Wigderson, Andrew Yao

Camera-ready Version: The authors of accepted papers must ensure that their Latex file uses the class ics.cls (Please download it from the ICS2011 webpage). Papers not following this format may NOT appear in the proceedings. An example of a LaTex file written with this class can be downloaded from the ICS2011 webpage. When compiling the previous example, you should get this PDF file.

In order to compile your file successfully, please make sure that your Latex distribution is updated to its latest version (in particular, the package natlib).

Important Dates: 

• Submission: Monday, August 2, 2010, 23:59, US PDT
• Notification: Tuesday, October 4, 2010, 23:59, US PDT
• Final version: Monday, October 25, 2010 23:59, US PDT
• Conference Date: January 7-9, 2011

Simultaneous Submissions: Material that has been previously published (in a journal or at a conference) or is currently under submission to another conference with proceedings will not be considered for acceptance at ICS 2011.

Poster Sessions: In addition to the above regular papers, ICS welcomes posters on work that authors wish to bring to the attention of the attendees, including work that has been, or will be, published elsewhere. The posters will not appear in the published proceedings of the conference, but will be on display throughout the conference. There will be dedicated sessions during which authors will be invited to present and discuss their posters. Instructions for poster submission may be found at ICS2011 webpage.

Proceedings: The conference proceedings containing all the accepted papers will be published by Tsinghua University Press, Beijing.

Discussion Panels: To enhance interaction among participants, ICS will feature public discussions about the papers. The events will be moderated by panelists who will also offer their own perspectives and reflections regarding the main conceptual messages of the papers. There will also be a plenary address.

Financial Support for ICS 2011: ITCS will provide full support for one author of each accepted paper, including air ticket (economy airfare at a reasonable price), hotel lodging (up to 4 nights), and registration fee. In addition, ITCS will also award some travel grants for graduate students (the number and amount of stipends will be determined based on availability of funds).

Program Committee:

• Bernard Chazelle (Chair), Princeton University
• Scott Aaronson, MIT
• Benny Applebaum, Weizmann Institute of Science
• Maria Florina Balcan, Georgia Institute of Technology
• Moses Charikar, Princeton University
• Shuchi Chawla, University of Wisconsin-Madison
• Ken Clarkson, IBM Almaden Research
• Erik Demaine, MIT
• Russell Impagliazzo, University of California, San Diego, and IAS
• Sanjeev Khanna, University of Pennsylvania
• Nati Linial, Hebrew University
• Moni Naor, Weizmann Institute of Science
• Noam Nisan, Hebrew University
• Rocco Servedio, Columbia University

Organization Committee:

• Amy Yuexuan Wang (Chair), Tsinghua University
• Christophe Tartary, Tsinghua University
• Xiang Li, Tsinghua University

60th Midwest Theory Day

With spring weather already making a brief appearance, we know that theory will soon be blooming in Bloomington.  The 60th Midwest Theory Day will take place on Saturday, April 17th, 2010, at Indiana University in Bloomington, Indiana.  A local arrangements web site (http://mypage.iu.edu/~jj56/mwtd/) is now available.

Speakers are needed!  If you would like to present, please send email to mwtd_iu@cs.indiana.edu.  Also, please use the same address to register with your name and affiliation so that the organizers know how many people are coming. 

Questions about the day should be sent to the above address or to jrogers@cs.depaul.edu.  You may also refer to the permanent MTD site at http://facweb.cs.depaul.edu/jrogers/MTD/. 

See you at IU!

[DMANET] postes LIPN - Un. Paris 13 (France)

Two positions of "maitres de conferences" (Associate Professor or
Lecturer level) in Computer Science (27 MCF 0235 et 27 MCF 9004) are
open at the University of Paris 13, in the research team
"Combinatorics, Algorithmics & Interplay" of the Laboratory of Computer
Science LIPN (UMR CNRS 7030). The selected applicants will join a
group of approximately ten permanent researchers and faculty members
in Algorithms and Combinatorics. They will teach in the department of
Computer Science of the Institut Galilee, the Faculty of Sciences of
the University of Paris 13. The position starting date is September
1st, 2010. These positions require strong speaking capacities in
French.

Applicants for the position 0235 are expected to exhibit a good
research record and a clear potential for leading, initiating and
developing research activity, mainly in: algorithmics (design of
algorithms, random generation), analysis of algorithms and
combinatorial structures (analytic combinatorics, probabilistic
methods, asymptotic analysis), graph theory (coloring, Erdoes-Renyi
model).

Contacts :
Frederique Bassino (Frederique.Bassino@lipn.univ-paris13.fr)
Christian Lavault (Christian.Lavault@lipn.univ-paris13.fr).

Applicants for the position 9004 are expected to exhibit a good
research record in algebraic combinatorics and/or in combinatorial
physics, and a clear interest in interdisciplinary research with
collaborators coming from related fields (computer algebra, functional
analysis, quantum physics).

Contacts :
Gerard H.E. Duchamp (Gerard.Duchamp@lipn.univ-paris13.fr)
Christophe Tollu (Christophe.Tollu@lipn.univ-paris13.fr)

Other permanent positions (at the associate and full professor levels)
in Computer Science are open in the Laboratory of Computer Science
(LIPN). Details can be found at the following URL:
http://www-lipn.univ-paris13.fr/~cf/Postes/index.html

____________________________________________________________

____________________________________________________________

Christian LAVAULT | Email : lavault@lipn.univ-paris13.fr
LIPN, UMR 7030 CNRS | Tel. : (33) 01 49 40 35 95
Institut Galilee, A.110 | fax : (33) 01 48 26 07 12
Universite Paris 13
99, av. J.B. Clement 93430 Villetaneuse, France.
http://www-lipn.univ-paris13.fr/~lavault/
____________________________________________________________
**********************************************************
*
* 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 1st ACM International Conference on Health Informatics (IHI)

CALL FOR PAPERS, Association for Computing Machinery (ACM)
1st ACM International Conference on Health Informatics (IHI)

IHI 2010
November 11-12, 2010
Washington, DC
http://ihi2010.sighi.org

SCOPE OF THE CONFERENCE

We cordially invite you to submit your contribution to the 2010 ACM International Conference on Health Informatics (IHI 2010).

IHI 2010 is ACM's premier community forum concerned with the application of computer and information science principles and information and communication technology to problems in healthcare, public health, the delivery of healthcare services and consumer health as well as the related social and ethical issues.

For technical contributions, IHI 2010 is primarily interested in end-to-end applications, systems, and technologies, even if available only in prototype form. Therefore, we strongly encourage authors to submit their original contributions describing their algorithmic and methodological contributions providing an application-oriented context. For social/behavioral scientific contributions, we are interested in empirical studies of health-related information needs, seeking, sharing and use, as well as socio-technical studies of heath information technology implementation and use. Topics of interest for this conference cover various aspects of health informatics, including but not limited to the following:
- Accessibility and Web-enabled technologies
- Analytics applied to direct and remote clinical care
- Assistive and adaptive ubiquitous computing technologies
- Biosurveillance
- Brain computer interface
- Cleaning, preprocessing, and ensuring quality and integrity of medical records
- Computational support for patient-centered and evidence-based care
- Consumer health and wellness informatics applications
- Consumer and clinician health information needs, seeking, sharing and use
- Continuous monitoring and streaming technologies
- Data management, privacy, security, and confidentiality
- Display and visualization of medical data
- E-communities and networks for patients and consumers 
- E-healthcare infrastructure design
- E-learning for spreading health informatics awareness 
- Engineering of medical data
- Health information system framework and enterprise architecture in the developing world
- Human-centered design of health informatics systems
- Information retrieval for health applications
- Information technologies for the management of patient safety and clinical outcomes
- Innovative applications in electronic health records (e.g., ontology or semantic technology, using continuous biomedical signals to trigger alerts)
- Intelligent medical devices and sensors
- Issues involving interoperability and data representation in healthcare delivery
- Keyword and multifaceted search over structured electronic health records
- Knowledge discovery for improving patient-provider communication
- Large-scale longitudinal mining of medical records
- Medical compliance automation for patients and institutions
- Medical recommender system (e.g., medical products, fitness programs)
- Multimodal medical signal analysis
- Natural language processing for biomedical literature, clinical notes, and health consumer texts
- Novel health information systems for chronic disease management
- Optimization models for planning and recommending therapies
- Personalized predictive modeling for clinical management (e.g., trauma, diabetes mellitus, sleep disorders, substance abuse)
- Physiological modeling
- Semantic Web, linked data, ontology, and healthcare
- Sensor networks and systems for pervasive healthcare
- Social studies of health information technologies
- Survival analysis and related methods for estimating hazard functions
- System software for complex clinical studies that involve combinations of clinical, genetic, genomic, imaging, and pathology data
- Systems for cognitive and decision support
- Technologies for capturing and documenting clinical encounter information in electronic systems
- User-interface design issues applied to medical devices and systems

Each contribution will be carefully evaluated by a set of reviewers, including experts with multidisciplinary experience spanning computing, information science, social and behavioral sciences, public health, medicine, and nursing as appropriate, to ensure that proper and comprehensive peer-review analysis and feedback can be provided to authors. Submissions will be judged on validity, originality, technical strength, practical and clinical significance, quality of presentation, and relevance to the conference topics.

Because of IHI's multidisciplinary nature, the review process will include at least a computing expert and a health expert as well as a review editor to reconcile the evaluation, making a single recommendation to the Program Committee Co-Chairs. This process is designed to ensure that experts from multiple areas can assess the importance and validity of the work. Therefore, we encourage coherent, application-driven submissions where in-depth ideas from a variety of fields are presented about important problems in health informatics. 

The conference will accept both regular and short papers. Regular papers (6-10 pages in length) will describe more mature ideas, where a substantial amount of implementation, experimentation, or data collection and analysis will be described. Short papers (1-5 pages) can be less formal and will describe innovative ideas where minimal validation and implementation have occurred and can be described. All papers will appear in the ACM Digital Library. The best papers of IHI 2010 will be considered for a special issue of  Springer's Journal of Medical Systems.

Submitted papers must not have appeared in, or be under consideration for, another conference, workshop, journal, or other target of publication.

All aspects of the submission and notification process will be handled electronically. Submissions must adhere to the following formatting instructions:

" Papers must adhere to the ACM Proceedings Format available for LaTex, WordPerfect, WordPerfect 9, and Word. Changing the template's font size, margins, inter-column spacing, or line spacing is prohibited. Each paper must be submitted as a single PDF file, formatted for 8.5" x 11" paper.

" The length of submission depends on the type of submission:
- Regular papers must be 6-10 pages long.
- Short papers may be at most 5 pages long.

" Each paper must provide an appendix (which is excluded from the page limit) indicating the preferred review approach, including:
- The preferred allocation of reviewing expertise. This can be done by electing the primary and secondary focus of the paper (e.g., Computing, Information Science, Medicine, Nursing, and Social/Behavioral Science).
- A bulleted list with up to 3 topics covered in the paper (from the list of conference topics presented above)

IMPORTANT DATES

Abstract submission deadline: June 2, 2010 11:30pm EST
Paper submission deadline: June 4, 2010 11:30pm EST
Notification of acceptance: August 6, 2010 11:30pm EST
Camera-ready copy due: August 16, 2010 11:30pm EST

General Chair
Ümit Çatalyürek, Ohio State University (catalyurek.1 at osu dot edu)

Honorary General Chair
Gang Luo, IBM Research (luog at us dot ibm dot com)

Program Committee Co-Chairs
Henrique Andrade, IBM Research (hcma at us dot ibm dot com)
Neil R. Smalheiser, University of Illinois - Chicago (neils at uic dot edu)

Steering Committee Members 
Dorin Comaniciu, Siemens Corporate Research 
Michael D. Larsen, George Washington University 
Ching-Yung Lin, IBM Research 
Chunqiang Tang, IBM Research 
YingLi Tian, City College of New York 
Olivier Verscheure, IBM Research 
Michael Weiner, Indiana University 

Honorary Steering Committee members
Marion J. Ball, Johns Hopkins University & IBM Research
Joseph A. Konstan, University of Minnesota
Blackford Middleton, Partners Healthcare System & Harvard Medical School 
Joel H. Saltz, Emory University

PROGRAM COMMITTEE MEMBERS
To be finalized

_________________________________________________________

CALL FOR DEMOS
1st ACM International Conference on Health Informatics (IHI 2010)

IHI 2010
November 11-12, 2010
Washington, DC
http://ihi2010.sighi.org

SCOPE OF THE DEMO TRACK

We cordially invite you to submit your contribution to the demo track of the 2010 ACM International Conference on Health Informatics (IHI 2010).

The IHI demo track is an exciting and highly interactive way to demonstrate your health informatics system or application. Because of IHI's focus on end-to-end systems, whereby applied informatics is used to address the needs of health and healthcare applications, demos of innovative systems are solicited, which illustrate practical research or engineering contributions in an interesting and interactive manner.

The demo program will be featured prominently in the conference program and should be seen as a vehicle for researchers, practitioners, and commercial/industrial/non-profit institutions to showcase innovative new technologies or applications in health informatics.

The demo review process will look for practical uses of technology and also for a "wow" factor in all submissions. We encourage the description of early prototypes as long as they clearly present a coherent, end-to-end view of what the application might become once it gets deployed in production.

A submission proposal includes a demo paper and can optionally include a demo video, whose URL should be referred to in the textual demo description for reviewers to take into consideration when analyzing the submission. Note that the demo paper should differ from regular papers in several important aspects. First, it should clearly describe the overall architecture of the system or technology demonstrated. Second, the paper should put great emphasis on the motivation of the work, on the applications of the presented system or technology, and on the novelty of the work. Third, the proposal should clearly describe the demo scenario. In particular, it should describe how the demo audience can interact with the demo system, in order to obtain understanding of the underlying technology. For demos running over the web, a back-up scenario should be described, in case of low connectivity at the demo venue.

All topics described in the Call for Papers are eligible for demo track submissions.

WHAT SHOULD BE SUBMITTED

All aspects of the submission and notification process will be handled electronically. Submissions must adhere to the following guidelines:

" The author(s) name and affiliation(s) must be present in the submitted document. Any submitted demo proposal violating the length, file type, or formatting requirements will be rejected without review.
" Papers must adhere to the ACM Proceedings Format available for LaTex, WordPerfect, WordPerfect 9, and Word. Changing the template's font size, margins, inter-column spacing, or line spacing is prohibited. Each paper must be submitted as a single PDF file, formatted for 8.5" x 11" paper.
" The length of submission is 4 pages. This page limit includes all parts of the proposal: title, abstract, body, and bibliography.
" Each paper must provide an appendix (which is excluded from the page limit) indicating the preferred review approach, including:
- The preferred allocation of reviewing expertise. This can be done by electing the primary and secondary focus of the paper (e.g., Computing, Information Science, Medicine, Nursing, and Social/Behavioral Science).
- A bulleted list with up to 3 topics covered in the paper (from the list of conference topics)

The optional demo video should focus on illustrating the demo scenario and the interactive nature of the demo system. The video must be no more than three minutes in length and should start by clearly identifying the authors and title of the proposal. The video should be in common video format (e.g., MPEG, AVI), and should be playable on a wide variety of media players. We strongly encourage authors to produce and submit a demo video and such video will be linked off of the final program on the conference website.

The notification for acceptance of demo papers is the same as that for regular papers. Accepted demo proposals will appear in the final proceedings and in ACM digital library. Note that all deadlines are the same as for regular paper submissions.

IMPORTANT DATES

Demo paper submission deadline: June 4, 2010 11:30pm EST
Notification of acceptance: August 6, 2010 11:30pm EST
Camera-ready copy due: August 16, 2010 11:30pm EST

[DMANET] CFP: IEEE MASS 2010

7th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
IEEE MASS 2010
https://mass2010.soe.ucsc.edu/
San Francisco, California, November 2010

-------------------------------------------------------------------------------------------------------
**** Workshop Proposals Deadline: March 31, 2010 ****

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

-------------------------------------------------------------------------------------------------------
IEEE MASS 2010 will be the seventh annual conference on the rapidly
expanding area of multi-hop wireless computing and sensor networking,
and will provide an exciting platform for discussing research vision
of a digitally networked wireless environment.

The MASS Organizing Committee invites proposals for one-day workshops
affiliated with the conference. The workshops will be held prior to, or
after,
the main conference.

The purpose of these workshops is to provide a platform for presenting
novel ideas and more specific research areas in a less formal and possibly
more focused way than at the conference itself. Please visit
http://www.cs.cityu.edu.hk/mass09/workshops.shtml to view information
on workshops held last year at MASS 2009.

Workshops Proposals are solicited in all areas and topics pertaining
to ad-hoc wireless and sensor networking research and applications.

All papers included in the MASS 2010 workshops will appear in the MASS
2010 Proceedings published by IEEE. We expect all selected workshops
to adhere to a common paper submission and reviewing schedule outlined
below:

Workshop proposals deadline: March 31, 2010
Proposals notification: April 9, 2010
Manuscripts due: June 18, 2010
Acceptance notification: August 13, 2010
Camera-ready submission: September 3, 2010

------------------------------------------------
Proposal Submission Guidelines:
------------------------------------------------
Each workshop proposal must include:

1. The name of the workshop
2. The names, addresses, and a short bio (up to 200 words) of the organizers
(maximum up to three)
3. A brief description (up to 1 page) of the technical issues that the
workshop
will address, and the reasons why the workshop is of interest this time
4. The names of potential participants, such as program committee members
5. Planned format of the workshop, such as number of refereed papers,
keynotes, panels etc.
6. If appropriate, a description of past versions of the workshop,
including:
number of submitted and accepted papers, number of attendees
7. A description of the publicity plan
8. A call for papers
9. The workshop website address

Workshop proposals should be submitted, no later than March 31, 2010
by e-mail (in PDF format) with "MASS 2010 Workshop Proposal" in the
subject, to BOTH MASS 2010 Workshop Co-chairs:

Cédric Westphal
DoCoMo Labs USA
cwestphal@docomolabs-usa.com

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

[DMANET] CFP: IEEE MASS 2010

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

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

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

November 2010 - San Francisco, CA, USA

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

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

IMPORTANT DATES:

Abstract Due: March 26, 2010
Manuscript Due: April 2, 2010
Acceptance Notification: July 12, 2010
Camera-ready Submission: August 20, 2010

SCOPE:

The 7th IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (IEEE MASS 2010) is to be held in San Francisco, CA between
October TBD, 2010. 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
this web-space for more information and regular updates about MASS 2010.

TOPICS OF INTEREST:

Original, unpublished contributions are solicited in all aspects of
(mobile) ad-hoc networks and wireless sensor networks (WSN), systems and
applications. Topics include, but are not limited to:

* Vehicular networks and protocols
* Wireless mesh networks and cognitive networks
* MAC layer design for ad-hoc networks and WSNs
* MAC protocols (802.11, 802.15.4, UWB)
* Multi-channel, multi-radio and MIMO technologies
* Cross layer design and optimization
* P2P, overlay, and content distribution architectures for ad-hoc and
sensor networks
* Delay tolerant networks and opportunistic networking
* Power-aware architectures, algorithms and protocols design
* Clustering, topology control, coverage and connectivity
* Routing protocols (unicast, multicast, broadcast, geocast)
* Data transport and management in WSNs
* Data gathering, fusion, and dissemination in WSNs
* Localization and synchronization in WSNs
* Cooperative sensing in WSNs
* Capacity planning and admission control in ad-hoc and sensor networks
* Handoff / mobility management and seamless internetworking
* Resource management and wireless QoS Provisioning
* Key management, trust establishment in wireless networks
* Security and privacy issues in ad hoc and sensor networks
* Reliability, resiliency and fault tolerance techniques
* Security, privacy issues in vehicular, DTNs, and mesh networks
* Operating systems and middleware support
* Novel applications and architectures for WSNs
* Modeling, analysis and performance evaluation
* Measurements and experience from experimental systems and
test-beds

WORKSHOPS:

Proposals for full day workshops are solicited. Selections will be made
considering the expertise and experience of the workshop organizers and
the relevance of the topic to the central theme of the conference.
Proposals of at most 4 pages, including a 1-page biographical sketch,
should be submitted to the Workshops Chair by March 31, 2009.

=================================================================================
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

---
INRIA Saclay - Ile de France
91893 Orsay Cedex France
and
Telecommunication Networks (TKN) group
Technische Universität Berlin,
10587 Berlin, Germany

Phone: (+49 30) 314-24576 (TU Berlin)
Fax: (+49 30) 314-23818 (TU Berlin)
http://www.irisa.fr/asap
**********************************************************
*
* 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/
*
**********************************************************

Special Issue of ToC in honor of Rajeev Motwani

Special Issue of the journal Theory of Computing

in honor of Rajeev Motwani (1962 - 2009)

Submit contributions by July 30, 2010.

Submissions in all areas of theoretical computer science will be considered, with preference for topics related to Rajeev's work. All papers undergo strict peer review and must meet the standards of Theory of Computing.

See details at http://www.cs.umd.edu/~samir/ToCMotwani.htm. 

[DMANET] International Workshop on Graph Labelings IWOGL 2010

IWOGL 2010

6th International Workshop on Graph Labelings

May 19-22, 2010, University of Minnesota Duluth
http://www.d.umn.edu/math/iwogl/
iwogl@d.umn.edu

The workshop will cover all aspects of graph labelings.
There will be four invited lectures, contributed talks
by participants, and hopefully enough time for discussions
and collaborative research.

Invited speakers:

S. Arumugam, Kalasalingam University, India
Joseph Gallian, University of Minnesota Duluth, U.S.A.
Uwe Leck, University of Wisconsin-Superior, U.S.A.
Alexander Rosa, McMaster University, Canada

Deadlines:

Abstract submission May 10
Early registration April 10

Conference fee: $100/$120 (early/regular)

A block of rooms has been reserved in Radisson Hotel
in downtown Duluth for $74 per room. To make reservation,
call 218-727-8981 or email to rhi_dulu@radisson.com
and mention IWOGL 2010. Special rate valid until April 15.

Organizing Committee

Dalibor Froncek, UMD (chair) dalibor@d.umn.edu
Sergei Bezrukov, UWS
Steve Rosenberg, UWS

iwogl@d.umn.edu
http://www.d.umn.edu/math/iwogl/

**********************************************************
*
* 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] DCFS 2010 - Call for papers

(We apologize for multiple posting)

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

12th International Workshop on
Descriptional Complexity of Formal Systems (DCFS 2010)
Saskatoon, Canada, August 8-10, 2010
http://www.cs.usask.ca/dcfs2010

C A L L F O R P A P E R S

Researchers are invited to submit papers concerning the descriptional
complexity of formal systems and structures (and its applications)
for DCFS 2010.

Topics include, but are not limited to:

-- various measures of descriptional complexity of automata,
grammars, languages, and of related systems,
-- trade-offs between different formal systems and/or different
modes of operation (e.g., determinism and nondeterminism)
with respect to descriptional complexity,
-- circuit complexity of Boolean functions and related measures,
-- succinctness of description of (finite) objects,
-- descriptional complexity in resource-bounded or
structure-bounded environments,
-- structural complexity,
-- descriptional complexity of formal systems for
applications (e.g. software reliability, software and
hardware testing, modelling of natural languages),
-- descriptional complexity aspects of nature-motivated
(bio-inspired) architectures and unconventional
models of computing,
-- Kolmogorov complexity and its relation to
descriptional complexity.

In accordance with the spirit of a workshop, the program
committee will try to accept as many papers as possible,
provided that their scientific quality is high and merits
acceptance. If the number of such papers exceeds the number of
time slots for "regular" presentation, the program committee
will try to accept some papers as "short" papers.

Deadline for submissions: April 25, 2010
Notification of acceptance or rejection: June 15, 2010
Final copy for the proceedings: July 8, 2010
Workshop: August 8-10, 2010

Proceedings
------------------------------------
All invited and accepted papers will appear in the conference
proceedings, which will be available during the conference. They
will also be published in electronic form through the
Electronic Proceedings in Theoretical Computer Science (EPTCS).

As in previous years, selected papers will be published in a
special journal issue. This year, the journal will be International
Journal of Foundations of Computer Science. In order to be able
to publish the special issue in 2011, a strict schedule for the
preparation and for the revision process of the papers submitted
to the issue will be fixed. The notification about
acceptance/rejection of the papers will be in the first months
of 2011.

Instructions for Submissions
------------------------------------
Detailed instructions for submissions will be available on the
conference website. Simultaneous submissions to any other
conferences with published proceedings are not allowed.

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

* Janusz A. (John) Brzozowski (Waterloo, ON, Canada)
* Juergen Dassow (Magdeburg, Germany)
* Michael Domaratzki (Winnipeg, MB, Canada)
* Markus Holzer (Giessen, Germany)
* Oscar H. Ibarra (Santa Barbara, CA, USA)
* Galina Jiraskova (Kosice, Slovakia)
* Chandra Kintala (Newark, USA)
* Ian McQuillan (Saskatoon, SK, Canada, co-chair)
* Andrei Paun (Madrid, Spain; Bucharest, Romania)
* Giovanni Pighizzini (Milano, Italy, co-chair)
* Jacques Sakarovitch (Paris, France)
* Kai Salomaa (Kingston, ON, Canada)
* Gyoergy Vaszil (Hungarian Academy of Sciences, Budapest, Hungary)
* Sheng Yu (London, ON, Canada)

Invited Speakers
------------------------------------
* Stavros Konstantinidis (Halifax, Canada)
* Ming Li (Waterloo, ON, Canada)
* Przemyslaw Prusinkiewicz (Calgary, AB, Canada)
* Detlef Wotschke (Frankfurt, Germany)

Conference Location
------------------------------------
DCFS 2010 will be held on the campus of the University of
Saskatchewan in the province of Saskatchewan, Canada.

DCFS and its predecessors DCAGRS (Descriptional Complexity of
Automata, Grammars and Related Structures) and FDSR (Formal
Descriptions and Software Reliability) were previously held in
Paderborn (1998); Magdeburg (1999); Boca Raton (1999);
London, Ontario (2000); San Jose (2000); Vienna (2001);
London, Ontario (2002); Budapest (2003); London, Ontario (2004);
Como (2005); Las Cruces, New Mexico (2006);
Novy Smokovek, High Tatras (2007), Charlottetown, Prince
Edward Island (2008) and Magdeburg (2009).

DFCS 2010 will take place immediately before
CIAA 2010, the 15th International Conference on Implementation
and Application of Automata, August 12 - 15, 2010
in Winnipeg, Manitoba, Canada
and DLT 2010, the 14th International Conference on
Developments in Language Theory, August 17 - 20, 2010,
in London, Ontario, Canada.
Thus it will be easy to attend all of DCFS, CIAA and DLT
within a two week period.

Steering Committee
------------------------------------
* Erzsebet Csuhaj-Varju (Budapest, Hungary)
* Juergen Dassow (Magdeburg, Germany)
* Helmut Juergensen (Potsdam, Germany, and London/Ontario, Canada)
* Hing Leung (Las Cruces, New Mexico)
* Chandra Kintala (Newark, USA)
* Giovanni Pighizzini (Milano, Italy, Chair)
* Detlef Wotschke (Frankfurt, Germany)

Organizing Committee
------------------------------------
* Ian McQuillan (Chair)
* Wayne Clarke
* Andrew Couperthwaite
* Shakiba Jalal
* Jillian Slind
* Brett Trost

Website and Contacts
------------------------------------
More detailed on-line information will be displayed at

http://www.cs.usask.ca/dcfs2010

Personal inquires should be sent to

dcfs2010@cs.usask.ca

or to

DCFS 2010 Organizing Committee,
c/o Ian McQuillan
Dept. of Computer Science
176 Thorvaldson Bldg.
University of Saskatchewan
110 Science Place
Saskatoon, SK S7N 5C9
Canada
**********************************************************
*
* 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/
*
**********************************************************

David Johnson Awarded Knuth Prize

ACM Press Release

The winner of the 10th Knuth Prize is David S. Johnson for seminal contributions to the theoretical and experimental analysis of combinatorial algorithms. David Johnson will receive the award and present the Knuth Prize Lecture at the 42th ACM Symposium on Theory of Computing held in Cambridge, Massachusetts, June 6-8, 2010.

David Johnson has made lasting contributions in the design of algorithms for hard combinatorial problems and in their analysis, both by theoretical and experimental methods, thereby laying out rigorous foundations for two important areas: approximation algorithms and experimental algorithms. His 1973 paper on the Approximation of combinatorial optimization problems set up the basic theoretical framework and approach for this area, and studied the approximation of some of the central optimization problems (clique, graph coloring, set cover, maximum satisfiability) that occupied the community for a long time subsequently, until their status was resolved almost 20 years later by the PCP theory, showing that Johnson's results were essentially optimal.

Johnson's work over the years has addressed the approximation of many other problems (scheduling, bin packing, TSP and many others). The area of approximation algorithms has grown and thrived over the years, and it has become one of the central areas of theoretical computer science. Besides the theoretical analysis, Johnson has written a set of highly influential papers on the experimental analysis of approximation algorithms that established equally rigorous and thorough standards for experimental work. His experimental papers on algorithms for the Traveling Salesman problem and on Simulated Annealing are paradigmatic and set an example for this kind of work.

David Johnson is well-known also for his many contributions to the early development of NP-completeness theory, including the concepts of strong NP-completeness and pseudopolynomial algorithms, for his book with Michael Garey that is the standard reference on NP-completeness, and for his ongoing columns that survey a variety of topics in theoretical computer science.

In addition to the great impact of his research, David Johnson has played an active leadership role in the theoretical computer science community, founding the annual ACM-SIAM Symposium on Discrete Algorithms (SODA) and the DIMACS Implementation Challenges, organizing and chairing many conferences, and by serving in multiple capacities in SIGACT and ACM.

The Knuth Prize for outstanding contributions to the foundations of computer science is awarded every 1½ years by the ACM Special Interest Group on Algorithms and Computation Theory (ACM-SIGACT) and the IEEE Technical Committee on the Mathematical Foundations of Computing. The Prize includes a $5000 award and a $1000 travel stipend (for travel to the award ceremony) paid by ACM SIGACT and IEEE TCMFC.
The Prize is awarded for major research accomplishments and contributions to the foundations of computer science over an extended period of time. The first Knuth Prize was presented at the 1996 ACM Symposium on Theory of Computing (STOC). Prizes are now awarded alternately at the ACM STOC and the IEEE Conference on Foundations of Computer Science (FOCS).


The Prize is named in honor and recognition of the extraordinary accomplishments of Prof. Donald Knuth, Emeritus at Stanford University. Prof. Knuth is best known for his ongoing multivolume series, The Art of Computer Programming, which played a critical role in establishing and defining Computer Science as a rigorous, intellectual discipline. Prof. Knuth has also made fundamental contributions to the subfields of analysis of algorithms, compilers, string matching, term rewriting systems, literate programming, and typography. His TeX and MF systems are widely accepted as standards for electronic typesetting. Prof. Knuth's work is distinguished by its integration of theoretical analyses and practical real-world concerns. In his work, theory and practice are not separate components of Computer Science, but rather he shows them to be inexorably linked branches of the same whole.

Past Winners

• 2008: Volker Strassen
• 2007: Nancy Lynch
• 2005: Mihalis Yannakakis
• 2003: Miklos Ajtai
• 2002: Christos Papadimitriou
• 2000: Jeffrey D. Ullman
• 1999: László Lovász
• 1997: Leslie G. Valiant
• 1996: Andrew C.-C. Yao

ICALP 2010 Call for Workshop Proposals

=============================================
ICALP 2010 Second Call for Workshop Proposals
=============================================

ICALP 2010 37th International Colloquium on Automata, Languages and Programming

5-11 July 2010, Bordeaux, France
Supported by the European Association for Theoretical Computer Science (EATCS)

http://icalp10.inria.fr/

The 37th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from 5-11 July 2010 in Bordeaux, France. The main conference will be preceded and followed by a series of Workshops. The workshops will take place on Monday 5 July 2010, and on Sunday 11 July 2010 (i.e., one day before and one day after ICALP).

Workshop proposals are invited for workshops

***** !!! TO BE HELD ON SUNDAY 11 JULY 2010 ONLY !!! ******

on topics related to all aspects of theoretical computer science. (A workshop may relate to any of the three tracks of ICALP, but also workshop proposals related to other aspects of theoretical computer science will be considered.) Typically, ICALP workshops feature a number of invited speakers and a number of contributed presentations. ICALP workshops do not necessarily produce formal proceedings. However, in the past there have been e.g. LNCS proceedings or special issues of journals based in part on some ICALP workshops. Workshop proposals should include:

   * Title of the workshop
   * Person responsible for the workshop (name + email address)
   * A short scientific summary and justification of the proposed topic. This should
     include a discussion of the particular benefits of the topic to the ICALP community.
   * A discussion of the proposed format and agenda.
   * The proposed duration (e.g. half a day or one day). This is important!
     (Please, note again that this 2nd call for workshops only concerns workshops to be
     held on Sunday 11 July 2010.)
   * Procedures for selecting participants and papers.
   * Expected number of participants. This is important!
   * If the workshop has taken place before, please provide the following information:
     - How often has the workshop taken place so far?
     - Which conference(s) has the workshop been collocated with so far?
     - Please provide the web address of the last workshop, if available.
     - How many participants took part in the last workshop?
   * Potential invited speakers.
   * Plans for dissemination (for example, special issues of journals).

Proposals are due on 15 March 2010, and should be submitted electronically to the Workshops
Chair:

Ralf Klasing
Ralf.Klasing@labri.fr

Workshops Chair, ICALP 2010

Notifications will be sent by 31 March 2010. The Workshops selection committee consists of the ICALP Conference Chairs and the ICALP Workshops Chair.


Further information:
-------------------
In accordance with EATCS policies, any workshop collocated with ICALP is expected to be financially independent. However, the registration fee should be as low as possible.

We provide the following aspects of the workshop organisation:
- registration
- coffee breaks, wireless access, conference rooms, lunches, booklet, ... (as for ICALP)
- a link to the web page of the workshop

We do NOT provide:
- hotel reservation (as for ICALP)
- All scientific aspects of the program of the workshop
 (e.g. call for papers, notification, program, workshop webpage, ...)
 are managed by the responsible of the workshop.
- Call for Papers, neither Call for Participation
- publicity for the workshop

ICALP 2010 is organised by the INRIA Bordeaux - Sud-Ouest research center in collaboration with the LaBRI, computer science laboratory of CNRS and the University of Bordeaux.

call for paper GandALF 2010

[We apologize if you have received multiple copies of this message]

*********************************************************
--------------------- GandALF 2010 ----------------------
*********************************************************

1st International Symposium on Games, Automata, Logics, and Formal
Verification
Minori, Amalfi Coast, Italy, June 17-18, 2010

http://gandalf.dia.unisa.it/

****************************************
| CALL FOR PAPERS |
****************************************

OBJECTIVES

The aim of the symposium is to bring together researchers from academia and
industry which are actively working in the fields of Games, Automata,
Logics,
and Formal Verification. The idea is to cover an ample spectrum of themes,
ranging from theory to concrete applications, and to stimulate
cross-fertilization. Papers focused on formal methods are especially
welcome.
Authors are invited to submit original research or tool papers on any
relevant
topic in these areas. Papers discussing new ideas that are at an early
stage of
development are also welcome.

INDICATIVE LIST OF TOPICS

The topics covered by the conference include, but are not limited to, the
following:

Automata Theory
Automated Deduction
Logical aspects of Computational Complexity
Concurrency and Distributed computation
Decision Procedures
Deductive, Compositional, and Abstraction Techniques for Verification
Finite Model Theory
First-order and Higher-order Logics
Formal Languages
Formal Methods for Complex Systems (e.g., Interactive Systems, Systems
Biology)
Games and Automata for Verification
Game Semantics
Game Theory
Hybrid, Embedded, and Mobile Systems Verification
Logics of Programs
Modal and Temporal Logics
Model Checking
Models of Reactive and Real-Time Systems
Program Analysis and Software Verification
Specification and Verification of Finite and Infinite-state Systems
Synthesis and Execution

PAPER SUBMISSION

Submissions, not exceeding fifteen (15) pages using EPTCS format, should be
unpublished and contain original research. For papers reporting experimental
results, authors are encouraged to make their data available with their
submission.
Papers must be submitted in PDF or PS format by using EasyChair
(https://www.easychair.org/login.cgi?conf=gandalf2010).

IMPORTANT DATES

Abstract submission March 21, 2010
Paper submission March 28, 2010
Acceptance notification May 1, 2010
Final version May 20, 2010
Conference June 17-18, 2010

INVITED SPEAKERS

Mikolaj Bojanczyk (Poland)
Javier Esparza (Germany)
Wolfgang Thomas (Germany)

PROCEEDINGS

The proceedings will be published by Electronic Proceedings in Theoretical
Computer Science. A special issue of a major international journal to
publish
an extended and revised version of the best symposium papers is also under
consideration.

INFO

Please visit the conference website (http://gandalf.dia.unisa.it) for more
information.

GENERAL CHAIR

Margherita Napoli (Italy)

PROGRAM CO-CHAIRS

Angelo Montanari (Italy)
Mimmo Parente (Italy)

PROGRAM COMMITTEE

Parosh Aziz Abdulla (Sweden)
Dietmar Berwanger (France)
Mikolaj Bojanczyk (Poland)
Ahmed Bouajjani (France)
Krishnendu Chatterjee (Austria)
Thomas Colcombet (France)
Ugo Dal Lago (Italy)
Giorgio Delzanno (Italy)
Rocco De Nicola (Italy)
Luca de Alfaro (USA)
Emanuela Fachini (Italy)
Marco Faella (Italy)
Alessandro Ferrante (Italy)
Stefania Gnesi (Italy)
Valentin Goranko (Denmark)
Antonin Kucera (Czech Republik)
Salvatore La Torre (Italy)
Kamal Lodaya (India)
Christof Loding (Germany)
P. Madhusudan (USA)
Rupak Majumdar (USA)
Luke Ong (UK)
Gennaro Parlato (USA)
Ian Pratt-Hartmann (UK)
Gabriele Puppis (UK)
Alexander Rabinovich (Israel)
Jean-Francois Raskin (Belgium)
Mark Reynolds (Australia)
Guido Sciavicco (Spain)
Colin Stirling (UK)
Tomas Vojnar (Czech Republic)

ADVISORY CHAIRS

Stefano Crespi Reghizzi (Italy)
Jozef Gruska (Czech Republik)
Oscar H. Ibarra (USA)
Andrea Maggiolo-Schettini (Italy)

ORGANIZING COMMITTEE

Dario Della Monica (Italy)
Fabio Mogavero (Italy)
Aniello Murano (Italy)
Francesco Sorrentino (USA)
Nicola Vitacolonna (Italy)

--
Dario Della Monica, PhD Student
University of Udine - Department of Mathematics and Computer Science
via delle Scienze, 206 - 33100 - Udine (UD)
phone: (+39) 0432 558469
cell: (+39) 328 2477327
fax: (+39) 0432 558499
email: dario.dellamonica [at] dimi.uniud.it
web site: http://users.dimi.uniud.it/~dario.dellamonica

[DMANET] [GD 2010] 1st Call for Papers

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

18th International Symposium
G R A P H D R A W I N G
(GD 2010)

21-24 September, 2010 - Konstanz, Germany

http://www.graphdrawing.org/gd2010/

=======================================================================
submission deadline: June 7, 2010 - notification: July 23, 2010
=======================================================================

Graph Drawing is concerned with the geometric representation of graphs
and networks and is motivated by those applications where it is crucial
to visualize structural information as graphs.

Since graph drawing methods form the algorithmic core of network
visualization, bridging the gap between theoretical advances and
implemented solutions is an important aspect of the conference.

Indeed, advances in graph drawing are important in several technological
areas such as Web computing, e-commerce, VLSI circuit design,
information systems, software engineering, computational cartography,
visual interfaces, bioinformatics, and networking.

Researchers and practitioners working on any aspect of graph drawing
are invited to contribute and participate.

The range of topics includes, but is not limited to:

• visualization of networks from application areas such as the
life sciences, social sciences, geography, engineering,
business intelligence, or communications
• software systems for graph visualization
• interfaces for interacting with graphs
• graph drawing algorithms
• geometric graphs
• planarity and topological graph theory
• graph theory and optimization on graphs

Invited Speakers:
-----------------
Peter Eades, University of Sydney, Australia
Carsten Thomassen, Technical University of Denmark, Lyngby, Denmark

Call for Papers:
----------------
Authors are invited to submit papers describing original research of
theoretical or practical significance to graph drawing, including
demonstrations of software systems. Papers may be either long (up to
12 pages) or short (up to 6 pages), using single-spaced LNCS style. The
claims made in submissions should be fully substantiated, including full
proofs, appropriate experimental data, or system descriptions. If this
information will not fit within the page limits, authors may include
a clearly marked appendix that will be read at the discretion of the
reviewers.

Accepted submissions will be published in the conference proceedings,
which will be included in the Lecture Notes in Computer Science series
of Springer.

Selected papers will be invited for submission to a special issue of
the Journal of Graph Algorithms and Applications.

Call for 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); abstracts of accepted posters will be included in the
conference proceedings.

Graph Drawing Contest:
----------------------
Following the tradition of previous conferences, a graph drawing contest
will be held. Details about the contest will be provided on the conference
Web site.

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

Paper submission: June 7
Notification of acceptance: July 23
Poster submission: August 16
Final versions due: September 10
Contest submission: September 17
Symposium: September 21-24, 2010

Committees:
-----------

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

Organization Melanie Badent
Ulrik Brandes (co-chair)
Sabine Cornelsen (co-chair)
Martin Mader
Barbara Pampel

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

Gold Sponsors: Tom Sawyer Software, yWorks
Silver Sponsor: Microsoft Research
Contributors: EADS, Siemens

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

**********************************************************
*
* 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] SAGT 2010 CFP

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

CALL FOR PAPERS

3rd International Symposium on Algorithmic Game Theory

October 18--20, 2010
Athens, GREECE

http://sagt2010.cti.gr/

------------------------------------------------------------------
IMPORTANT DATES
---------------
SUBMISSION DEADLINE May 3, 2010, 24:00 GMT / 12:00pm GMT
NOTIFICATION OF AUTHORS June 28, 2010
CAMERA READY SUBMISSION July 27, 2010
SYMPOSIUM DATES October 18-20, 2010

------------------------------------------------------------------
PURPOSE
-------

The purpose of SAGT is to bring together researchers from Computer
Science, Economics and Mathematics to present and discuss original
research at the intersection of Algorithms and Game Theory.

------------------------------------------------------------------
SCOPE
-----

Authors are invited to submit previously unpublished work for
possible presentation at the conference. New foundational work is
solicited on topics including but not limited to:

- Solution Concepts in Game Theory
- Game Classes (e.g., Bimatrix, Potential, Bayesian)
- Exact and Approximate Computation of Equilibria
- Convergence and Learning in Games
- Complexity Classes in Game Theory
- Algorithmic Aspects of Fixed-Point Theorems
- Mechanisms, Incentives and Coalitions
- Cost-Sharing Algorithms and Analysis
- Computational Aspects of Market Equilibria
- Computational Problems in Economics, Finance, Decision
Theory and Pricing
- Auction Algorithms and Analysis
- Price of Anarchy and its Relatives
- Representations of Games and their Complexity
- Economic Aspects of Distributed Computing and the Internet
- Network Formation on the Internet
- Congestion, Routing and Network Design Games
- Game-Theoretic Approaches to Networking Problems

------------------------------------------------------------------
PROGRAM
-------

The program will include both invited lectures and regular
presentations. Each regular presentation will be accompanied by a
paper in the symposium proceedings.

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

TBA

------------------------------------------------------------------
SUBMISSIONS
-----------

A submission must report on original research, which has not
previously appeared, and which is not concurrently being submitted
to a journal or another conference with published proceedings. Any
partial overlap with a published or concurrently submitted paper
must be clearly indicated.

Authors are invited to submit an extended abstract of no more than
12 pages. Additional details may be included in a clearly marked
appendix, which will be read at the discretion of the Program
Committee. It is strongly encouraged that submissions follow the
format of LNCS (Lecture Notes in Computer Science) of Springer.
Submissions deviating significantly from these guidelines may be
rejected without consideration of their merits. Submissions outside
the scope of the symposium will be rejected without review.

Submissions are to be made electronically, following the
guidelines on the symposium web page. Authors unable to submit
electronically should contact the Program Chair to receive
instructions.

All submissions will be rigorously peer-reviewed and evaluated on
the basis of the quality of their contribution, originality,
soundness and significance.

------------------------------------------------------------------
PUBLICATION
-----------

The symposium proceedings will be published by Springer in its
LNCS series (Lecture Notes in Computer Science); they will be
available for distribution at the conference. Each paper in the
proceedings will be restricted to a maximum of 12 pages (in LNCS
format). Extended and revised versions of selected papers will be
considered for a Special Issue of the "Theory of Computing Systems"
journal.

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

CHAIRS

Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Paul Spirakis, R.A. Computer Technology Institute, GREECE

PC MEMBERS

Itai Ashlagi, Harvard Business School, USA
Xi Chen, University of Southern California, USA
Xiaotie Deng, City University of Hong Kong, HONG KONG
Kousha Etessami, University of Edinburgh, UK
Michal Feldman, Hebrew University of Jerusalem, ISRAEL
Dimitris Fotakis, National Technical University of Athens, GREECE
Paul W. Goldberg, University of Liverpool, UK
Rica Gonen, Yahoo! Research, USA
Haim Kaplan, Tel Aviv University, ISRAEL
David Kempe, University of Southern California, USA
Spyros Kontogiannis, University of Ioannina, GREECE
Annamaria Kovacs, Goethe University Frankfurt/Main, GERMANY
Vangelis Markakis, Athens University of Economics and Business, GREECE
Marios Mavronicolas, University of Cyprus, CYPRUS
Aranyak Mehta, Google Research, USA
Seffi Naor, Technion - Israel Institute of Technology, ISRAEL
Michael Schapira, Yale University and UC Berkeley, USA
Bernard von Stengel, London School of Economics and Political Science, UK
Berthold Voecking, RWTH Aachen University, GERMANY

------------------------------------------------------------------
STEERING COMMITTEE
------------------

Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Marios Mavronicolas, University of Cyprus, CYPRUS
Dov Monderer, Technion-Israel Institute of Technology, ISRAEL
Burkhard Monien, University of Paderborn, GERMANY
Christos Papadimitriou, University of California at Berkeley, USA
Giuseppe Persiano, Universita di Salerno, ITALY
Paul Spirakis, R.A. Computer Technology Institute, GREECE (CHAIR)
Berthold Voecking, RWTH Aachen University, GERMANY

------------------------------------------------------------------
ORGANIZATION COMMITTEE
----------------------

Spyros Kontogiannis, University of Ioannina, GREECE (Co-Chair)
Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Paul Spirakis, R.A. Computer Technology Institute, GREECE (Co-Chair)
Rozina Efstathiadou, R.A. Computer Technology Institute, GREECE
Aggeliki Stamatopoulou, R.A. Computer Technology Institute, GREECE

------------------------------------------------------------------
LAST MODIFIED: 25/02/2010
**********************************************************
*
* 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/
*
**********************************************************

SAGT 2010 CFP: 3rd 3rd International Symposium on Algorithmic Game Theory

*********************************************
* Our apologies for multiple cross-postings *
*********************************************

[DMANET] Call for Abstracts: Workshop on Theoretical Aspects of Evolutionary Multiobjective Optimization

Workshop on Theoretical Aspects of Evolutionary Multiobjective
Optimization---Current Status and Future Trends

http://taemo.gforge.inria.fr

organizers:
Nicola Beume, TU Dortmund, Germany
Dimo Brockhoff, INRIA Saclay, France

to be held as part of the

2010 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2010)
Sponsored by ACM SIGEVO

http://www.sigevo.org/GECCO-2010

July 7-11, 2010 (Wednesday-Sunday)
Portland Marriott Downtown Waterfront Hotel
Portland, Oregon, USA

PAPER SUBMISSION DEADLINE FOR WORKSHOP: March 25, 2010

Evolutionary Multiobjective Optimization (EMO), i.e., the simultaneous
optimization of 2 or more objective functions by means of bio-inspired
search heuristics, has become one of the main research fields in
evolutionary computation in recent years and as such also gained interest
from the classical field of multicriteria decision making (MCDM). Together
with its fast development in practice, also theoretical analyses of EMO
gained more and more interest.

To foster this growing interest of theory in EMO, the workshop
"Theoretical Aspects of Evolutionary Multiobjective Optimization" aims at
bringing together theoreticians both working in the field of EMO and from
single-objective optimization as well as EMO practitioners. Besides
presenting the newest theoretical results about EMO, the workshop aims at
identifying a broad list of challenging questions to be tackled in the
near future for which we explicitly invite both theoreticians and
practitioners. The workshop covers all theoretical topics of EMO,
including but not limited to
- convergence analysis
- decision making
- diversity mechanisms
- experimental studies based on theoretical considerations
- hybridized EMO approaches
- indicator-based search
- many-objective optimization
- multiobjectivization
- performance assessment
- preference handling
- runtime analyses (incl. approximation results)
- set-based EMO
- variation operators specific to the multiobjective case

We invite submissions as proposals for a talk in form of a short abstract
of maximally 4 pages in ACM format. The talks should present recent
research ideas and identify open theoretical questions to foster
discussions rather than showing finalized results. Accepted abstracts will
be published in a separate workshop proceedings associated to the GECCO
conference which also appears in the ACM Digital Library.

Important Dates

- 03/25/2010 abstract submission deadline
- 04/01/2010 decision notification
- 04/13/2010 camera-ready files submission deadline
- 04/19/2010 registration deadline for presenting authors
- 07/07/2010 or 08/07/2010 workshop

GECCO is sponsored by the Association for Computing Machinery Special
Interest Group on Genetic and Evolutionary Computation (SIGEVO). SIG
Services: 2 Penn Plaza, Suite 701, New York, NY, 10121, USA,
1-800-342-6626 (USA and Canada) or +212-626-0500 (Global).

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