Monday, February 8, 2010

[DMANET] ICE 2010: First call for papers

[- Apologies for multiple copies -]

3rd Interaction and Concurrency Experience
ICE 2010: Guaranteed Interactions

Satellite workshop of DisCoTec 2010
10th of June 2010
Amsterdam, The Netherlands

http://www.artist-embedded.org/artist/-ICE-10-.html

=== Highlights ===

- Innovative selection procedure
- Travel grants for young researchers

=== Important Dates ===

- Abstract submission: 22 March 2010
- Full paper submission: 29 March 2010
- Reviews, rebuttal and PC discussion: 30 March - 28 April 2010
- Notification to authors: 30 April 2010

=== Scope ===

Interaction and Concurrency Experiences (ICEs) is a series of
international scientific meetings oriented to theoretical
computer science researchers with special interest in models,
verification, tools and programming primitives for complex interactions.

The general scope is to include theoretical and applied aspects of
interactions and the synchronization mechanisms used among actors of
concurrent/distributed systems, but every experience will focus on a
different specific topic which affects several areas of computer science.

The theme of ICE'10 is ***Guaranteed Interactions***, like guaranteeing
safety, responsiveness, quality of service levels or satisfaction of
analysis hypotheses. In this context, coordination can be viewed as
imposing constraints on the interaction among the actors. Such constraints
and guarantees of their satisfaction play an important role in the
analysis of distributed systems. In order to provide such guarantees, a
number of directions are being explored to develop appropriate models,
methodologies and tools, like behavioural types, component-based model
checking, assume-guarantee and "by construction" techniques such as glue
synthesis. Considering interaction as a first class entity is crucial for
overcoming complexity issues of distributed systems, such as state space
explosion.

Topics of interest include, but shall not be limited to:

- logic and types for interactions
- concurrent models and semantics
- techniques and tools for specification, analysis, verification of
guaranteed interaction
- programming primitives for interactions
- languages, protocols and mechanisms for sound coordination
- "by construction" guarantees for interaction
- expressiveness results
- formal contract languages
- disciplined interactions inspired by emerging computational models
(systems biology, quantum computing, etc.)

=== Selection Procedure ===

The workshop proposes an innovative paper selection mechanism based on an
interactive discussion amongst authors and PC members. As witnessed by the
past two editions of ICE, this considerably improves the accuracy of the
feedback from reviews, the fairness of the selection, the quality of
accepted papers, and the discussion during the workshop.

During the review phase, each submitted paper is published on a Wiki and
associated with a discussion forum whose access will be restricted to the
authors and to all the PC members not in conflict of interests. The PC
members post comments / questions which the authors shall reply to.

=== The Public Wiki ===

After the notification, the accepted papers will be published on a public
forum, the rationale being to initiate public discussions that will
trigger and stimulate the scientific debate of the workshop. We argue that
this will drive the workshop discussions and let perspective participants
to interact with each other well in advance with respect to the modus
operandi of more traditional events.

=== Submission Guidelines ===

Papers must report previously unpublished work and not be
simultaneously submitted to other conferences / workshops with
refereed proceedings. The ICE'10 post-proceedings will be published in
Electronic Proceedings in Theoretical Computer Science
(http://eptcs.org/). Depending on the quality of submissions a special issue in
a journal will be considered.

Submissions must be made electronically in PDF format via EasyChair
(http://www.easychair.org/conferences/?conf=ice2010) and should not
exceed 15 pages with EPTCS style (http://style.eptcs.org/).

Accepted papers must be presented at the workshop by one of the authors.

=== Contact ===

Please write to <ice2010@di.unipi.it> for any additional information you
may need.

=== Previous editions ===

The previous two editions of ICE have been held in:
– Reykjavik, Iceland, on July 6th, 2008, with focus on Synchronous and Asyn-
chronous Interactions in Concurrent/Distributed Systems, co-located with
ICALP'08 (http://ice08.dimi.uniud.it/). The post proceedings were published
in ENTCS (vol.229-3).
– Bologna, Italy, on August 31st, 2009, with focus on Structured Interactions,
co-located with CONCUR'09 (http://ice09.dimi.uniud.it/). The post
proceedings were published in EPTCS (vol.12) and a special issue of MSCS is
now in preparation.


=== Sponsors ===

* CEA LIST (http://www-list.cea.fr)
* ArtistDesign network of excellence (http://www.artist-embedded.org)
* Institute for Programming research and Algorithmics (IPA - http://www2.win.tue.nl/ipa/)


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

[DMANET] Call for Papers: Special Issue on Heuristic Search Methods for Large Scale Optimization Problems in Industry, Evolutionary Computation Journal

Special Issue on
Heuristic Search Methods for Large Scale Optimization Problems in
Industry

Evolutionary Computation Journal, MIT Press
http://ecj.lri.fr/

SUBMISSION DEADLINE: July 31, 2010.

Guest Editors:
Andreas Ernst, CSIRO Mathematical and Information Science,
andreas.ernst@csiro.au
Zbigniew Michalewicz, University of Adelaide,
zbigniew.michalewicz@adelaide.edu.au
Frank Neumann, Max Planck Institute for Informatics, fne@mpi-inf.mpg.de

Description:
This special issue aims to provide a forum for researchers working on
large applied optimization problems arising in industry. Such problems
often defy solution by exact approaches such as integer and constraint
programming. Particular challenges of large applied problems include the
presence of complex objectives containing a mixture of real costs and
soft constraints which can be time consuming to evaluate. In addition
the search space of problems is often so large that traversing it with
neighbourhood-move, crossover or mutation operators can take too long to
allow effective exploration. This special issue solicits novel
high-quality contributions on heuristic methods for large applied
optimization problems that have been used in practice. While papers on
any aspect of solving large scale optimization problems in industry are
welcome, of special interest are submissions on:

-Scheduling/planning problems solved for particular organizations
-Novel methods for exploring very large search spaces
-Decomposition and parallel computing techniques for solving large
optimization problems
-Hybrid heuristics for real world optimization problems
-Methods for dealing with large data sets in formulating and solving
large optimization problems, including issues around data consistency
and completeness.
-Case studies of successful (or unsuccessful) implementations of large
scale heuristic optimization algorithms in a business and lessons
learned from these.

Authors are encouraged to make available (de-identified) versions of
some of their real world data sets to support the development of more
sophisticated methods to deal with some of these challenging problems.
This special issue will not consider the solution of large abstract
problems (eg classical VRP or job shop scheduling problems) nor papers
that only test algorithms on randomly generated data sets. Authors are
invited to submit original work on topics relevant for this special
issue. The publication of the special issue is tentatively scheduled for
Summer 2011.

Submission:
Authors should submit their manuscripts to the Evolutionary Computation
Editorial Manager at http://ecj.lri.fr/.
When submitting a paper, please send at the same time also an
email to Frank Neumann (fne@mpi-inf.mpg.de) with paper title and author
list to inform about the submission.
**********************************************************
*
* 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, February 7, 2010

CSR 2010: Call for Participation

               CALL FOR PARTICIPATION - CSR 2010

   5th International Computer Science Symposium in Russia
                June 16-20, 2010, Kazan, Russia

    Organized by Institute of Informatics of the Tatarstan
       Academy of Sciences, and Kazan State University

                    http://csr2010.antat.ru/


     *** WE STRONGLY ADVICE TO REGISTER BEFORE MARCH 1 ***


CSR 2010 is the fifth conference in the series of regular
events spanning all areas of computer science. This year
it is mainly focused on its theoretical aspects.

The program of CSR 2010 consists of 30 contributed papers,
an opening lecture by
 Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
and 8 invited lectures by
 Susanne Albers (Humboldt-Universität, Germany)
 Fedor Fomin (University of Bergen, Norway)
 Juraj Hromkovic (Federal Institute of Technology, Switzerland)
 Richard Jozsa (University of Bristol and University of Cambridge)
 Prabhakar Raghavan (Yahoo! Labs and Stanford University)
 Miklos Santha (Université Paris Sud and National University of Singapore)
 Uwe Schöning (Universität Ulm, Germany).

The list of accepted papers can be found at the conference web site.
The preliminary program is coming soon.

Two workshops in Kazan and one in Moscow
are organized in conjunction with CSR-2010.
Pre-conference Workshop on Program Semantics, Specification and Verification:
Theory and Applications (PSSV 2010) in Kazan will be held on June 14-15.

Post-conference Workshop on High Productivity Computations (HPC 2010) in Kazan
will be held on June 21-22. It is intended to organize the discussions
about high productivity computing means and models, including but not
limited to high performance and quantum information processing.

Note also that Franco-Russian Workshop "Complexity in algorithms,
dynamics and bioinformatics" is organized in Moscow on June 13-15;
one may find it convenient to attend before CSR-2010:
http://www.mccme.ru/~anromash/workshop/fr-alg-workshop.html
Regarding this one, please contact its organizers directly.

The main accomodation site is the hotel "Korston" which offers conference
discounts to participants (the number of rooms is limited, accomodation
requests will be considered on a first-come-first-served basis).

The early registration fee of 300 euros (150 euros for students) should
be paid before March 1, 2010 via bank transfer. The late registration fee
is 390 euros (240 euros for students). Participants registered after May 13
will be required to pay upon arrival. There are also reduced fees for
participants working in Russia.

To register for participation, please fill in the form at
http://csr2010.antat.ru/CSR2010RegistrationForm.pdf and send it to
info(at)antat.ru. If you plan to participate and need a *Russian visa*,
please contact the organizers before March 1 since it takes more than
a month just to issue the official invitation.

Symposium chair: Farid Ablayev (Kazan State University).

Further information and contacts:
 Web: http://csr2010.antat.ru/
 Email: csr2010.kazan(at)gmail.com



[DMANET] CSR 2010: Call for Participation

CALL FOR PARTICIPATION - CSR 2010

5th International Computer Science Symposium in Russia
June 16-20, 2010, Kazan, Russia

Organized by Institute of Informatics of the Tatarstan
Academy of Sciences, and Kazan State University

http://csr2010.antat.ru/


*** WE STRONGLY ADVICE TO REGISTER BEFORE MARCH 1 ***


CSR 2010 is the fifth conference in the series of regular
events spanning all areas of computer science. This year
it is mainly focused on its theoretical aspects.

The program of CSR 2010 consists of 30 contributed papers,
an opening lecture by
Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
and 8 invited lectures by
Susanne Albers (Humboldt-Universität, Germany)
Fedor Fomin (University of Bergen, Norway)
Juraj Hromkovic (Federal Institute of Technology, Switzerland)
Richard Jozsa (University of Bristol and University of Cambridge)
Prabhakar Raghavan (Yahoo! Labs and Stanford University)
Miklos Santha (Université Paris Sud and National University of Singapore)
Uwe Schöning (Universität Ulm, Germany).

The list of accepted papers can be found at the conference web site.
The preliminary program is coming soon.

Two workshops in Kazan and one in Moscow
are organized in conjunction with CSR-2010.
Pre-conference Workshop on Program Semantics, Specification and Verification:
Theory and Applications (PSSV 2010) in Kazan will be held on June 14-15.

Post-conference Workshop on High Productivity Computations (HPC 2010) in Kazan
will be held on June 21-22. It is intended to organize the discussions
about high productivity computing means and models, including but not
limited to high performance and quantum information processing.

Note also that Franco-Russian Workshop "Complexity in algorithms,
dynamics and bioinformatics" is organized in Moscow on June 13-15;
one may find it convenient to attend before CSR-2010:
http://www.mccme.ru/~anromash/workshop/fr-alg-workshop.html
Regarding this one, please contact its organizers directly.

The main accomodation site is the hotel "Korston" which offers conference
discounts to participants (the number of rooms is limited, accomodation
requests will be considered on a first-come-first-served basis).

The early registration fee of 300 euros (150 euros for students) should
be paid before March 1, 2010 via bank transfer. The late registration fee
is 390 euros (240 euros for students). Participants registered after May 13
will be required to pay upon arrival. There are also reduced fees for
participants working in Russia.

To register for participation, please fill in the form at
http://csr2010.antat.ru/CSR2010RegistrationForm.pdf and send it to
info(at)antat.ru. If you plan to participate and need a *Russian visa*,
please contact the organizers before March 1 since it takes more than
a month just to issue the official invitation.

Symposium chair: Farid Ablayev (Kazan State University).

Further information and contacts:
Web: http://csr2010.antat.ru/
Email: csr2010.kazan(at)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] CP 2010: Call for Workshop Proposals

Call for Workshop Proposals

Sixteenth International Conference on Principles and Practice of
Constraint Programming

6-10 September, 2010

St. Andrews, Scotland


The CP 2010 Workshop Chair invites proposals for the Workshop Program.

CP 2010 workshops will provide an informal setting where workshop
participants will have the opportunity to discuss specific technical
topics in an atmosphere that facilitates the active exchange of
ideas. It is an opportunity to disseminate work in progress or to
promote new and emerging areas within the field of constraints. The
topics of the workshops can cover any area related to constraints and
any related cross-disciplinary areas.

All workshops will take place on 6 September, 2010 at the site of the
main conference. Workshops can be half-day or full-day. The internal
format of the workshop will be determined by the organisers of each
workshop.

Important Dates

March 16, 2010: Proposal submission deadline
March 30, 2010: Acceptance notification
April 20, 2010: Deadline for receipt of CFP and URL for workshop web
page
August 16, 2010: Deadline for workshop working notes
September 6, 2010: CP 2010 workshops

Proposal Submissions

Proposals for workshops should contain the following information:
- The title and a brief technical description of the workshop,
specifying the goals and the technical issues it will focus on.
- A brief discussion of why and to whom the workshop is of interest.
- A list of tentatively confirmed attendees, if available.
- A list of related workshops held within the last three years, if
any, and their relation to the proposed workshop.
- A list of workshops previously arranged by any members of the
proposed organising committee, if any.
- The names of the proposed organising committee. This committee
should consist of two or three people knowledgeable about the
technical issues to be addressed, preferably not coming from the same
institution.
- The name and email address of the main organiser.

Responsibilities of the Workshop Organisers

Each workshop main organiser will be responsible for:
- Producing a "Call for Papers" and a Web page for their workshop by
April 20, 2010. Please provide a web page/URL that can be linked into
the CP 2010 home page. The call must make it clear that the workshop
is open to all members of the CP community. It should also mention
that at least one author of each accepted submission must attend the
workshop, and that all workshop participants must pay the workshop
fee. Finally, it should also clearly describe the process by which
the organising committee will select the participants.
- Providing a brief description of the workshop for the conference
program.
- Selecting submitted papers.
- Scheduling workshop activities in collaboration with the local
organisers and the workshop chairs.
- Providing working notes to be duplicated for the workshop (up to a
maximum of 200 pages) by August 16, 2010.

Responsibilities of the CP 2010 Organising Committee

The CP 2010 organising committee will be responsible for the following:
- Providing publicity for the workshop series as a whole.
- Providing logistics support and a meeting place for the workshop.
- In conjunction with the organisers, determining the start and end
times of the workshop.
- Duplicating working notes as described above and distributing them
to the participants.

Submitting a Proposal

All proposals should be submitted by electronic mail (in ASCII), to
the Workshop Chair.

CP'10 Workshop Chair

Pedro Meseguer
IIIA - CSIC
pedro@iiia.csic.es

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

Friday, February 5, 2010

[DMANET] CFP of The 2010 International Workshop on Intelligent Sensor and Wireless Networks (IntelNet 2010)

[Please accept our apologies if you receive multiple copies of this email]

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

CALL FOR PAPERS


The 2010 International Workshop on Intelligent Sensor and Wireless Networks (IntelNet 2010)


To be held in conjunction with CIT'10 (Supported by IEEE Computer
Society), June 29 - July 1, 2010, Bradford, UK

http://www.inf.brad.ac.uk/~xjin/IntelNet10/index.html
http://www.scim.brad.ac.uk/~ylwu/CIT2010/


SCOPE:

Modern sensor and wireless networks have been becoming more and more
large-scaled and complicated. Due to their rapidly increasing scale
and complexity, the management and maintenance of sensor and wireless
networks have posed many grand challenges to both industrial and
academic communication communities. To overcome these challenges, it
is very necessary to find new levels of autonomy and intelligence in
deploying, managing, and maintaining sensor and wireless networks.

The purpose of the 2010 International Workshop on Intelligent Sensor
and Wireless Networks (IntelNet 2010) is to bring together scientists,
researchers, professionals, and practitioners from both industry and
academia to exchange ideas, discuss solutions, share experiences, and
report state-of-the-art research results on various aspects of
intelligent sensor and wireless networks. The topics of interest
include, but are not limited to:

-- Advanced Technologies for Enabling Intelligent and Autonomic
Communications
-- Autonomy-Oriented Sensor/Wireless Networks
-- Biological, Social, and Economic Models for Intelligent Networks
-- Bio-Inspired Network Protocol Design
-- Bio-Inspired Network Services
-- Bio-Inspired Sensor/Wireless Networks
-- Characterization and Detection of Emergent Properties in Self-
Organizing Networks
-- Complex Dynamics of Autonomous Communication Networks
-- Experimental Case Studies and Testbeds of Intelligent Networks
-- Novel Design and Management Technologies for Autonomic Sensor/
Wireless Networks
-- Scalability and Complexity of Self-Organizing Communication
Networks
-- Self-Organization in Autonomic Communication Networks
-- Self-Organizing, Self-Adaptive and Self-Tuning Sensor/Wireless
Networks
-- Sensing, Monitoring, Evaluation, and Measurements of Intelligent
Networks
-- Stability and Dependability of Intelligent Sensor/Wireless
Networks
-- Tools and Techniques for Designing, Implementing, and Analyzing
Intelligent Sensor/Wireless Networks


STEERING COMMITTEE:

Duncan F. Gillies, Imperial College London, UK
Jiming Liu, Hong Kong Baptist University, Hong Kong
Ruqian Lu, Chinese Academy of Sciences, China
Geyong Min, University of Bradford, UK
Jie Wu, Temple University, USA

GENERAL CHAIR:

Xiaolong Jin
School of Informatics
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: x.jin@brad.ac.uk

PROGRAM CHAIRS:

Lei Liu
Department of Computing
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: l.liu6@brad.ac.uk

Hui Cheng
Department of Computer Science
University of Leicester
Leicester, LE1 7RH
U.K.
E-mail: hc118@le.ac.uk

PAPER SUBMISSION:

Authors are invited to submit manuscripts reporting original unpublished
research and recent developments in the topics related to the workshop.
The length of the papers should not exceed 6 pages + 2 pages for overlength
charges (IEEE Computer Society Proceedings Manuscripts style: two columns,
single-spaced), including figures and references, using 10 fonts, and
number each page. Papers should be submitted electronically in PDF format
by sending it as an e-mail attachment to Xiaolong Jin
(x.jin@bradford.ac.uk).
All papers will be peer reviewed and the comments will be provided to the
authors. The accepted papers will be published together with those of other
workshops by the IEEE Computer Society Press.

Distinguished papers, after further extensions, will be published
in CIT 2010's special issues of the following prestigious SCI-indexed
journals:

-- The Journal of Supercomputing - Springer
-- Journal of Computer and System Sciences - Elsevier
-- Concurrency and Computation: Practice and Experience - John Wiley & Sons


IMPORTANT DATES:

Submission Deadline: February 15, 2010
Author Notification: March 26, 2010
Final Manuscript Due: April 18, 2010
Registration Due: April 18, 2010
Conference Date: June 29 - July 1, 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/
*
**********************************************************

[DMANET] COCOON 2010 - CFP - Feb 15

###################################################################################
COCOON 2010 - Call for Paper
The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010)

http://www.cise.ufl.edu/cocoon2010/

July 19 - July 21, 2010.
Sheraton Hotel, NhaTrang, Vietnam
###################################################################################

IMPORTANT DATES

* Submission Deadline: February 15, 2010
* Notification of acceptance: April 12, 2010
* Camera Ready / Registration: April 29, 2010
* Early Registration: May 17, 2010
* Conference Dates: July 19 - 21, 2010


SCOPE and MISSION

The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010) will be held in Nha Trang, Vietnam during July 19 -- 21.
The conference organizers would like to extend their most cordial
invitation to researchers around the world to come to one of the most
beautiful countries in South East Asia, to explore its 4000-year-old
culture, to enjoy the beach scenery and to exchange their most
significant research works.

Original research works in the areas of algorithms, theory of
computation, computational complexity, and combinatorics related to
computing are solicited. In addition to theoretical studies,
submissions that report on experimental and applied research of
general algorithmic interest are especially encouraged.

Topics of interest (but not limited to)

* Algorithms and data structures;
* Algorithmic game theory and online algorithms;
* Automata, languages, logic, and computability;
* Combinatorics related to algorithms and complexity;
* Complexity theory;
* Computational learning theory and knowledge discovery;
* Cryptography, reliability and security, and database theory;
* Computational biology and bioinformatics ;
* Computational algebra, geometry, and number theory;
* Graph drawing and information visualization;
* Graph theory, communication networks, and optimization;
* Parallel and distributed computing;
* Experimental analysis of algorithms


Submitted manuscripts must be no longer than 10 pages long (including
figures, references, and appendices) and be formatted in standard LNCS
format (for LNCS templates, please refer to
http://www.springer.com/lncs).

The proceedings of the conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science. High quality papers will be
invited to a special issue in Algorithmica and Journal of
Combinatorial Optimization.

Best Regards,

My T. Thai and Sartaj Sahni
TPC co-chairs

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010
**********************************************************
*
* 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/
*
**********************************************************

[STACS] Second Call for Participation

27th International Symposium on Theoretical Aspects of Computer Science

                  STACS 2010 - CALL FOR PARTICIPATION

                 MARCH 4-6, 2010, NANCY, FRANCE

                     http://stacs.loria.fr/

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

INVITED SPEAKERS
***********************
Mikolaj Bojanczyk, Warsaw University
Rolf Niedermeier, University of Jena
Jacques Stern, Ecole Normale Supérieure

PROGRAM
*************
http://stacs.loria.fr/program.html


PROGRAM COMMITTEE
***************************
Markus Bläser, Saarland University
Harry Buhrman, CWI, University of Amsterdam
Thomas Colcombet, CNRS, Paris 7 University
Anuj Dawar, University of Cambridge
Arnaud Durand, Paris 7 University
Sándor Fekete, Braunschweig University of Technology
Ralf Klasing, CNRS, Bordeaux University
Christian Knauer, Freie Universität of Berlin
Piotr Krysta, University of Liverpool
Sylvain Lombardy, Marne la Vallée University
Parthasarathy Madhusudan, University of Illinois
Jean-Yves Marion, Nancy University (co-chair)
Pierre McKenzie, Université de Montréal
Rasmus Pagh, IT University of Copenhagen
Boaz Patt-Shamir, Tel Aviv University
Christophe Paul, CNRS, Montpellier University
Georg Schnitger, Frankfurt University
Thomas Schwentick, TU Dortmund University (co-chair)
Helmut Seidl, TU Munich
Jirí Sgall, Charles University
Sebastiano Vigna, Università degli Studi di Milano
Paul Vitanyi, CWI, Amsterdam


CONTACT : stacs@loria.fr
*************************

[DMANET] CFP-- RP2010 -- REACHABILITY PROBLEMS

----------------------- Call for Papers ---------------------------------

4th WORKSHOP ON REACHABILITY PROBLEMS, RP'2010
(August 27-29, 2010, Masaryk University, Brno, Czech Republic)
co-located with MFCS & CSL 2010
http://www.csc.liv.ac.uk/~rp2010/

-------------------------------------------------------------------------
Deadline for submissions: April 21, 2010
Proceedings will be published in the

Springer LNCS series

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

The Workshop on Reachability Problems will be hosted by the
Faculty of Informatics, Masaryk University, Brno, Czech Republic
and will be co-located with Joint MFCS and CSL 2010. RP'10 is
the fourth in the series of workshops following three successful
meetings at Ecole Polytechnique, France in 2009 at University of
Liverpool, UK in 2008 and at Turku University, Finland in 2007.
Scope: The Reachability Workshop is specifically aimed at
gathering together scholars from diverse disciplines and backgrounds
interested in reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic and Verification

Invited Speakers:

- Markus Holzer (Giessen University, Germany)
- Kim Guldstrand Larsen (Aalborg University, Denmark)
- Alexander Rabinovich (Tel Aviv University, Israel)
- Philippe Schnoebelen (ENS Cachan, France)

Important dates:

Submission: April 21, 2010
Notification: June 3, 2010
Final version: June 10, 2010
Conference dates: Aug. 27-29, 2010

Topics of interest:

Papers presenting original contributions related to reachability
problems in different computational models and systems are
being sought. Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting systems;
Reachability analysis in counter/ timed/ cellular/ communicating
automata; Petri-Nets; computational aspects of semigroups,
groups and rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable reachability
problems; complexity and decidability aspects; predictability
in iterative maps and new computational paradigms

The reachability problems are in the core of many questions
of computer science and mathematics. This topic covers
many aspects about the analysis of computational traces/paths
in classical and unconventional computational models, logic,
algebraic structures as well as in mathematical systems and
control theory. The classical reachability can be formulated as
follows: Given a computational system or model with a set of
allowed transformations (functions). Decide whether a certain
state of a system is reachable from a given initial state by a set
of allowed transformations. The same questions can be asked
not only about reachability of exact states of the system but
also about a set of states expressed in term of some property
as a parameterized reachability problem. Another set of
predictability questions can be seen in terms of reachability of
eligible traces of computations, their equivalence; unavoidability
of some dynamics and a possibility to avoid undesirable dynamic
using a limited control.

Proceedings

The Conference Proceedings will be published as the volume
of the Springer Verlag Lecture Notes in Computer Science
(LNCS) series www.springer.com/lncs<http://www.springer.com/lncs> and distributed at the
Conference. We plan also to publish selected papers in a special
issue of a high quality journal following the regular referee procedure.

Submissions:

Authors are invited to submit a draft of a full paper
with at most 12 pages (in LaTeX, formatted according
to LNCS guidelines) via the conference web page.
Proofs omitted due to space constraints must be put
into an appendix to be read by the program committee
members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted in postscript
or pdf. Simultaneous submission to other conferences or
workshops with published proceedings is not allowed.

Organizing Committee:

- Antonin Kucera (Masaryk University)
- Igor Potapov (University of Liverpool)

Contact details: RP'2010
Faculty of Informatics, Masaryk University,
Emails: Antonin Kucera tony@fi.muni.cz<mailto:tony@fi.muni.cz>
Igor Potapov potapov@liverpool.ac.uk<mailto:potapov@liverpool.ac.uk>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, February 4, 2010

[DMANET] EuroCG 2010 - Call for Participation

*** The registration server is open. Early registration until February
16 ***
*** The list of accepted papers is available online at http://2010.eurocg.org
***

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

26th European Workshop on Computational Geometry

http://2010.eurocg.org
March 22-24, 2010
Technische Universitaet Dortmund, Germany

Final Call for Papers

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

The 26th European Workshop on Computational Geometry (EuroCG'10) will
be held March 22-24, 2010, at the Technische Universitaet Dortmund
(Dortmund, Germany). EuroCG is renown as a friendly workshop, where
researchers across Europe and the world can meet and exchange ideas in
a delightful atmosphere.


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 modelling, 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

Timothy M. Chan, U Waterloo
Markus Gross, ETH Zurich and Disney Research Zurich
Janos Pach, EPFL Lausanne and Renyi Insitute Budapest


CONTACT

Jan Vahrenhold, Faculty of Computer Science, Computer Science XI,
Technische Universitaet Dortmund, 44221 Dortmund, Germany.

E-mail: jan (dot) vahrenhold (insert an @ here) cs.tu-dortmund.de
Phone: +49 (0) 231 755-7711
Fax: +49 (0) 231 755-7740

**********************************************************
*
* 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: PASCO 2010 || July 21-23, 2010 - Grenoble, France

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

Parallel Symbolic Computation 2010 (PASCO 2010)

July 21-23, 2010 -- Grenoble, France

http://pasco2010.imag.fr/

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

Initial Announcement

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 (multicore
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.
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.

Important Dates

Paper submission deadline: April 2 (Fri), 2010
Notification of acceptance: May 10 (Mon), 2010
Camera-ready version of paper due: 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] CfP: Special issue on New Combinatorial Optimisation Models for Decision Making

CALL FOR PAPERS
(apologies for multiply received copies)

** Special Issue of International Journal of Applied Management Science
(IJAMS) **

Published by Inderscience Enterprises Ltd.
Cfp home page: http://www.inderscience.com/browse/callpaper.php?callID=1298

** Subject: New Combinatorial Optimisation Models for Decision Making **

Combinatorial optimisation problems are known for their high level of
complexity. Problems such as, but not limited to, the travelling
salesman problem, the multiple knapsack problem, or the generalised
assignment problem, have attracted the interest of many researchers for
many years. A plethora of different solution approaches have been used
in order to find the solution to such hard optimisation problems. Some
of these approaches include exact methods and algorithms from Operations
Research (OR), while other approaches include techniques like
meta-heuristics from other scientific fields such as Artificial
Intelligence (AI). Therefore, combinatorial optimisation models for
decision making in real life applications constitute a challenging
research area. The domain of applicability of combinatorial optimisation
problems is extraordinarily broad. Examples of applications area include
routing and scheduling, financial and industrial fields, and
telecommunications, to name but a few. The objective of this special
issue is to present modern applications of combinatorial optimisation
models to the decision making in management.

Suitable topics include, but are not limited to:

* Real life applications of combinatorial optimisation models
* Modelling of large scale combinatorial optimisation problems
* New modelling approaches for combinatorial optimisation problems
* Network flow models for decision making
* Evaluation of currently-used combinatorial optimisation models for
decision making
* Decision support systems featuring embedded combinatorial
optimisation techniques
* Combinatorial optimisation case studies in the fields of
management, finance, military and industry

We are particularly interested in new, real life combinatorial
optimisation models, large scale network flow models or improvements in
modelling techniques, regarding the decision making in management.

** Important Dates **

Submission deadline: 30 September 2010
Author notification - review comments: 20 December 2010
Second review cycle: 31 March 2011
Final manuscript due: 20 May 2011

** Guest Editors **

1) Dr. Angelo Sifaleras, Lecturer, University of Macedonia, Economic and
Social Sciences, Greece
2) Dr. Jason Papathanasiou, Lecturer, University of Macedonia, Economic
and Social Sciences, Greece
3) Professor Marc Demange, ESSEC Business School, Romania

** Notes for Prospective Authors **

Submitted papers should not have been previously published nor be
currently under consideration for publication elsewhere. (N.B.
Conference papers may only be submitted if the paper was not originally
copyrighted and if it has been completely re-written). All papers are
refereed through a peer review process. A guide for authors, sample
copies and other relevant information for submitting papers are
available on the Author Guidelines page
(http://www.inderscience.com/mapper.php?id=31), You may send one copy in
the form of an MS Word file attached to an e-mail (details in Author
Guidelines page) to the following:

Dr. Angelo Sifaleras
Department of Technology Management
University of Macedonia, Economic and Social Sciences
Loggou-Tourpali
Naousa 59200
Greece
Tel: +30 2310 891881
Fax: +30 2310 891825
Email: sifalera@uom.gr
Web: http://macedonia.uom.gr/~sifalera

Please include in your submission the title of the Special Issue, the
title of the Journal and the name of the Guest Editor.

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

Wednesday, February 3, 2010

ICALP 2010: Submission Deadline: Feb 10, 2010

REMINDER: submission deadline Feb 10, 2010
______________________________________________________________________


                 CALL FOR PAPERS

                  ICALP 2010


 37th International Colloquium on Automata, Languages and Programming


                 July 5-12, 2010
                 Bordeaux, France


             http://icalp10.inria.fr/


Supported by the European Association for Theoretical Computer Science (EATCS)


______________________________________________________________________

Important Dates:
* Submission Deadline: Feb 10, 2010
* Author Notification: Apr 6, 2010
* Final Manuscript Due: Apr 27, 2010
______________________________________________________________________


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 the 5th to the 12th of July 2010 in Bordeaux, France. The main
conference will be preceded and followed by a series of
Workshops. Papers presenting original research on all aspects of
theoretical computer science are sought. Typical but not exclusive
topics of interest are:

______________________________________________________________________

Track A - Algorithms, Complexity and Games

Topics: Algorithmic Game Theory * Approximation Algorithms *
Combinatorics in Computer Science * Computational Biology *
Computational Complexity * Computational Geometry * Cryptography *
Data Structures * Design and Analysis of Algorithms * Internet
Algorithmics * Machine Learning * Parallel, Distributed and External
Memory Computing * Randomness in Computation * Quantum Computing


Track B - Logic, Semantics, Automata and Theory of Programming

Topics: Algebraic and Categorical Models * Automata Theory, Formal
Languages * Non-standard Approaches to Computability * Databases,
Semi-Structured Data and Finite Model Theory * Principles of
Programming Languages * Logics, Formal Methods and Model Checking *
Models of Concurrent, Distributed, and Mobile Systems * Models of
Reactive, Hybrid and Stochastic Systems * Program Analysis and
Transformation * Specification, Refinement and Verification * Type
Systems and Theory, Typed Calculi


Track C - Foundations of Networked Computation: Models, Algorithms and Information Management

Topics: Algorithmic Aspects of Networks * Auctions * Computing with
Incentives * E-commerce, Privacy, Spam * Formal Methods for Network
Information Management * Foundations of Trust and Reputation in
Networks * Internet Algorithmics * Mobile and Wireless Networks *
Models of Complex Networks * Models and Algorithms for Global
Computing * Models of Mobile Computation * Networks Economics *
Networks of Low Capability Devices * Overlay Networks and P2P Systems
* Social Networks * Specification, Semantics, Synchronization of
Networked Systems * Theory of Security in networks and Distributed
Computing * Web Searching, Ranking * Web Mining and Analysis

______________________________________________________________________

Invited Speakers:
* Pierre Fraigniaud (CNRS and Univ. Paris Diderot)
* Jean Goubault-Larrecq (ENS Cachan and LSV)
* Burkhard Monien (Univ. Paderborn)
* Joel Ouaknine, (Oxford Univ. Computing Lab.)
* Roger Wattenhofer (ETH Zurich)
* Emo Welzl (ETH Zurich)



______________________________________________________________________

Submission Guidelines:
Submissions should be made through the on-line submission site:
https://wiki.bordeaux.inria.fr/icalp10/index.php?n=Main.Submission

Authors are invited to submit an extended abstract of no more than 12
pages in LNCS style presenting original research on the theory of
Computer Science. Submissions should indicate to which track (A, B, or
C) the paper is submitted. No simultaneous submission to other
publication outlets (either a conference or a journal) is allowed. The
proceedings will be published in the Lecture Notes in Computer Science
Series by Springer-Verlag.

It is recommended that submissions adhere to the specified format and
length. Submissions that are clearly too long may be rejected
immediately. Additional material intended for the referee but not for
publication in the final version - for example details of proofs - may
be placed in a clearly marked appendix that is not included in the
page limit.



______________________________________________________________________

Conference Chairs:
* Cyril Gavoille, Univ. of Bordeaux (LaBRI) & INRIA, Bordeaux.
* Claude Kirchner, INRIA, Bordeaux.


Program Committees:

Track A. - Algorithms, Complexity and Games
* Dimitris Achlioptas, Univ. Santa Cruz
* Kwstis Daskalakis, MIT
* Anuj Dawar, Cambridge Univ.
* Xiaotie Deng, City Univ. Hong Kong
* Philippe Flajolet, INRIA
* Micelle Flammini, Univ. L\'Acquilla
* Oscar Ibarra, UCSB (Santa Barbara)
* Giuseppe Italiano, Univ. Roma 2
* Kazuo Iwama, Univ. Kyoto
* Klaus Jansen, Univ. Kiel
* Elias Koutsoupias, Univ. Athens
* Ludek Kucera, Charles Univ.
* Daniel Marx, Budapest Univ.
* Burkhard Monien, U Paderborn
* Amin Coja Oghlan, Univ. Edinburgh
* Tonyann Pitassi, Univ. Toronto
* John Reif, Duke Univ.
* Jose Rolim, Univ. Geneva
* Paul Spirakis, Univ. Patras and RACTI (PC Chair)
* Leslie Valiant, Harvard Univ.
* Emo Welzl, ETH
* Gerhard Woeginger, Univ. Eindhoven

Track B - Logic, Semantics, Automata and Theory of Programming

* Samson Abramsky, Oxford Univ. (PC Chair)
* Luca Aceto, Univ. Rejkjavik
* Lars Birkedal, Univ. Copenhagen
* Mikolaj Bojanczyk, Univ. Warsaw
* Patricia Bouyer, CNRS, LSV Cachan
* Josée Desharnais, Univ. Laval
* Gilles Dowek, Ecole Polytechnique & INRIA
* Manfred Droste, Univ. Leipzig
* Peter Dybjer, Univ. Chalmers
* Jose Felix Costa, Univ. Lisbon
* Phokion Kolaitis, IBM Almaden
* Ugo Dal Lago, Univ. Bologna
* Daniel Leivant, Univ. Indiana
* Andrzej Murawski, Oxford Univ.
* Filip Murlak, Univ. Warsaw
* Flemming Nielsen, Univ. Copenhagen
* Dominique Perrin, Univ. Paris Est
* Alex Rabinovich, Univ. Tel Aviv
* Lutz Schroder, DFKI Bremen
* Ian Stark, Univ. Edinburgh

Track C- Foundations of Networked Computation: Models, Algorithms and
Information Management

* Debora Donato, Yahoo! Research Barcelona
* Faith Ellen, Univ. Toronto
* Phil Gibbons, Intel Research Pittsburgh
* Rob van Glabbeek, Stanford Univ. and National ICT Australia
* Monika Henzinger, EPFL Lausanne
* Christos Kaklamanis, Univ. of Patras
* Fabian Kuhn, MIT
* Miroslaw Kutylowski, Wroclaw University of Technology
* Christian Lengauer, Univ. Passau
* Stefano Leonardi, Sapienza Univ. of Rome
* Friedhelm Meyer auf der Heide, Univ. Paderborn (PC chair)
* Dusko Pavlovic, Oxford Univ. and Kestrel Institute
* Andrzej Pelc, Univ. du Québec en Outaouais
* Giuseppe Persiano, Univ. Salerno
* Frank Pfenning, CMU
* Geppino Pucci, Univ. Padova
* Christian Scheideler, Univ. Paderborn
* Nir Shavit, Tel Aviv Univ.
* Berthold Vöcking, RWTH Aachen
* Gerhard Weikum, MPI-Saarbrücken



Workshops Chair:
* Ralf Klasing, CNRS & Univ. Bordeaux (LaBRI) & INRIA

Publicity Chairs:
* Nicolas Bonichon, Univ. Bordeaux (LaBRI) & INRIA
* Lionel Eyraud-Dubois, INRIA & Univ. Bordeaux (LaBRI)
* Frédéric Mazoit, Univ. Bordeaux (LaBRI)

Conference Secretariat:
* Laetitia Grimaldi, INRIA, Bordeaux


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.



[DMANET] Job Opportunities at the interface of Operational Research and Computer Science

Members of this list may be interested in the following positions at the
University of Nottingham:


Professor of Operational Research and Computer Science:
http://jobs.nottingham.ac.uk/vacancies.aspx?cat=107#j6625


Lecturer in Operational Research and Computer Science:
http://jobs.nottingham.ac.uk/vacancies.aspx?cat=160#j6669


The closing dates are 26th and 23rd February respectively.

All the best,
Edmund Burke.
--
------------------------------------------------------------------------------
Prof Edmund K.Burke Dean of the Faculty of Science
e-mail: ekb@cs.nott.ac.uk School of Computer Science
Tel: +44 (0)115 951 4206 University of Nottingham
Fax: +44 (0)115 951 4249 NOTTINGHAM NG8 1BB, UK.

http://www.cs.nott.ac.uk/~ekb/
------------------------------------------------------------------------------

**********************************************************
*
* 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] 2nd AIMMS/MOPTA Optimization Modeling Competition

Dear Colleagues,

It is with great pleasure and anticipation that we announce the second
AIMMS/MOPTA Optimization Modeling Competition for students. The
competition is organized jointly by the conference organizers of MOPTA
and Paragon Decision Technology (http://www.aimms.com).

The problem involves optimizing a financial portfolio in the presence
of different tax rules.

For more details and registration visit the conference website:
http://mopta.ie.lehigh.edu and follow the link to the competition.

Contact: Imre Polik (mopta@lehigh.edu)

Teams of at most three students can participate. Students with a
background in operations research, regardless of their actual field of
study are eligible.

The teams have to model and solve the optimization problem using AIMMS
(provided to the participants free of charge). The best teams will
compete in the final, taking place at the 2010 MOPTA conference,
August 18-20 at Lehigh University, Bethlehem, PA, USA.

Please encourage your students to patricipate or feel free to use the
competition as a case study in your operations research or financial
optimization class.

Best,
Imre Polik
**********************************************************
*
* 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] International Doctoral Program in Energy Efficient Production and Logistics

CALL FOR APPLICATIONS

-----------------------------------------------------------------------
INTERNATIONAL DOCTORAL PROGRAM IN ENERGY EFFICIENT
PRODUCTION AND LOGISTICS 2010
-----------------------------------------------------------------------

The NRW Graduate School of Energy Efficient Production and Logistics is
calling for applications to its international doctoral program starting
in fall of 2010. Outstanding academic records, strong theoretical
foundations and a commitment to empirical research are expected.

Applicants may apply for a maximum of three of the announced
dissertations topics, which can be found on the online platform
www.forschungsschule.de. Core topic is the mathematic-physical
description, analysis and optimization of industrial manufacturing
processes under energy efficiency and CO2 reduction aspects. The
research proposals are related to the following fields:

o Logistics
o Production
o Materials Engineering
o Modeling and Holistic Analysis
o Energetical Process Engineering

Deadline of application is *15 March 2010*. The selection process will
be carried out in April and May the same year. Successful candidates
will be informed by the beginning of June 2010. Doctoral researchers are
awarded a scholarship of 1.400€/month for 36 months.

The Graduate School of Energy Efficient Production and Logistics is a
collaborative initiative of the TU Dortmund University and the
Ruhr-University Bochum, funded by the Ministry of Education, Science and
Research of the German State of North Rhine-Westphalia (NRW).

For further information please do not hesitate to contact our
coordination offices in Dortmund or Bochum:

TU Dortmund University
Lina Schmitz, M.A.
Leonhard-Euler Str. 5
44227 Dortmund
Germany
Telephone +49(0)231/755-5785
Telefax +49(0)231/755-2649
lina.schmitz@tu-dortmund.de

Ruhr-University Bochum
Dipl.-Ing. Sabine Wischermann
Universitätsstr. 150, IB 4
44780 Bochum
Germany
Telephone +49(0)234/32-25985
Telefax +49(0)234/32-14158
wischermann@lee.rub.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] IWONT 2010. First Announcement and Call for Papers

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

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

3rd INTERNATIONAL WORKSHOP ON OPTIMAL NETWORK TOPOLOGIES (IWONT 2010)

Barcelona, 9-11 June 2010
http://www-ma4.upc.edu/iwont2010

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

The International Workshop on Optimal Network Topologies is focussed
on problems related to the design and analysis for large networks. The
topics of the workshop include:

* Degree/Diameter Problem
* Connectivity
* Cycles and Factors in Graphs
* Large Graphs and Digraphs
* Graph Labeling
* Spectral Techniques in Graph Theory
* Communication Networks

Previous editions of IWONT were held in Plzen, Czech Republic ( IWONT
2007 http://iti.zcu.cz/iwont2007 ) and in Ballarat, Australia
(IWONT2005).

This edition celebrates the 60th anniversary of Prof. Miquel Angel Fiol.

IMPORTANT DATES:

Deadline for submissions of extended abstracts: April 5, 2010
Notification of acceptance: April 23, 2010
Early registration: May 13, 2010
Workshop dates: June 9-11, 2010

Further information and registration at
http://www-ma4.upc.edu/iwont2010
**********************************************************
*
* 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] CTW 2010: Registration Details

Dear colleagues,

Registration (and other) details for the Cologne/Twente Workshop on
Graphs and Combinatorial Optimization CTW 2010 are now available via the
workshop homepage:

http://ctw.uni-koeln.de/


With best regards,

Ulrich Faigle
(for the organization committee)
**********************************************************
*
* 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, February 2, 2010

[DMANET] ATMOS 2010: 1st Call for Papers

10TH WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELING, OPTIMIZATION, AND SYSTEMS (ATMOS)


University of Liverpool, United Kingdom, September 9, 2010
http://algo2010.csc.liv.ac.uk/atmos.php

** CALL FOR PAPERS

The ATMOS 2010 workshop will be held in connection with ALGO 2010 in
University of Liverpool, United Kingdom, on September 9, 2010.

Since 2000, the series of ATMOS workshops brings together researchers
and practitioners who are interested in all aspects of algorithmic
methods and models for transportation optimization and provides a
forum for the exchange and dissemination of new ideas and techniques.

Transportation networks give rise to very complex and large-scale
network optimization problems requiring innovative solution techniques
and ideas from mathematical optimization, theoretical computer
science, and operations research. Applicable tools and concepts
include those from graph and network algorithms, combinatorial
optimization, approximation and online algorithms, stochastic and
robust optimization.

The scope of the workshop comprises all modes of transportation.


** INVITED SPEAKER

Alberto Caprara, University of Bologna


** IMPORTANT DATES

Submission Deadline: June 8, 2010
Notification to Authors: July 8, 2010
Final Version due: August 22, 2010
Workshop: September 9, 2010


** TOPICS

We invite papers for presentation at the workshop on optimization
problems for passenger and freight transport, including---but not
limited to

* Infrastructure Planning
* Vehicle Scheduling
* Crew and Duty Scheduling
* Rostering
* Routing in Road Networks
* Novel Applications of Route Planning Techniques
* Demand Forecasting
* Design of Tariff Systems
* Delay Management
* Mobile Applications
* Humanitarian Logistics
* Simulation Tools
* Line Planning
* Timetable Generation
* Routing and Platform Assignment

Of particular interest are: the successful integration of several
(sub)problems or planning stages, algorithms operating in an
online/realtime or stochastic setting, and heuristic approaches
(including approximation algorithms) for real-world instances.


** SUBMISSIONS

Authors are invited to submit an extended abstract or full paper of at
most 12 pages. The paper should contain a succinct statement of the
issues and of their motivation, a summary of the main results, and a
brief explanation of their significance, accessible to non-specialist
readers. Proofs omitted due to space constraints can be put into an
appendix to be read by the program committee members at their
discretion. Papers must be submitted electronically at
http://www.easychair.org/conferences/?conf=atmos2010. The submission
must be received by 23:59 (GMT) on June 8, 2010. Each accepted paper
must be presented at the workshop by one of the authors.


** PROCEEDINGS

The proceedings will be published online on the Dagstuhl Research
Online Publication Server (DROPS) (http://drops.dagstuhl.de/)


** PROGRAM COMMITTEE

* Gabriele Di Stefano, U L'Aquila
* Thomas Erlebach (co-chair), U Leicester
* Andrea Lodi, U Bologna
* Marco Luebbecke (co-chair), TU Darmstadt
* Matus Mihalak, ETH Zurich
* Petra Mutzel, TU Dortmund
* Louis-Martin Rousseau, Polytechnique Montreal
* Heiko Schilling, TomTom NV
* Peter Sanders, Karlsruher Institut fuer Technologie
* Maria Grazia Speranza, U Brescia
* Frits Spieksma, KU Leuven

**********************************************************
*
* 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] Prize for Innovation In Distributed Computing: Call for Nominations

--- Call for nominations - Deadline February 21st, 2010 ---

Prize for Innovation In Distributed Computing

Awarded by the
Colloquium on Structural Information and Communication Complexity
(SIROCCO)


The Prize for Innovation In Distributed Computing is established to
recognize individuals whose research contributions on the
relationships between information and efficiency in decentralized
computing have expanded the collective investigative horizon by
formulating new problems, or identifying new research areas, that were
at the time of their introduction unorthodox and outside the
mainstream. The prize recognizes originality, innovation, and
creativity -- the qualities that reflect the spirit of the SIROCCO
conference.

The prize is presented at the annual meeting of the SIROCCO
conference, but may not necessarily be awarded every year.


Eligibility
===========

The following conditions must be met by the nominees to be eligible
for the prize.

(1) The original innovative contribution was introduced by the
nominee(s) for the first time in a publication at least five years
before the nomination deadline, and the publication must have appeared
in a conference proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the
original paper, or a paper directly related to the innovative
contribution, must have appeared in SIROCCO proceedings.

The list of all SIROCCO papers and authors is available at

http://www.sigmod.org/dblp/db/conf/sirocco/


Selection process
=================

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference, the
PC chairs of the three SIROCCO conferences immediately preceding the
nomination deadline, plus one additional member of the Steering
Committee, selected by the Steering Committee for the current year.

In 2010, the Award Committee consists of:

- Pierre Fraigniaud (CNRS and University Paris Diderot)
- Shay Kutten (Technion)
- Nicola Santoro (Carleton University)
- Alexander A. Shvartsman (University of Connecticut)
- Shmuel Zaks (Technion)


Nominations
===========

A call for nomination is disseminated every year in the main mailing
lists of the Distributed Computing community, at least four months
prior to the date of that year's SIROCCO meeting.

Nominations can be made by any member of the scientific community.
Each nomination must identify the person(s) being nominated, and
justify the nomination by a short text including:

(a) a brief description of the innovative contribution in Distributed
Computing to be recognized by the award, and an explanation of its
originality and significance,

(b) the paper(s) of the nominee(s) that establish their eligibility as
described in the Eligibility section above items (1) and (2).

Nominations for 2010 should be sent to the Steering Committee chair of
SIROCCO at Pierre.Fraigniaud@liafa.jussieu.fr before February 21st,
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/
*
**********************************************************

[DMANET] CP 2010: Call for Application Papers

Call for Application Papers

CP 2010

Sixteenth International Conference on Principles and Practice of
Constraint Programming

http://cp2010.cs.st-andrews.ac.uk/

6-10th September 2010

St-Andrews, Scotland

Paper submission 13th April 2010, 12 Noon BST = GMT + 1

Paper notification 3rd June 2010


CP 2010 wishes to promote the presentation of CP applications.

Reports on successful applications of constraint technology are
therefore particularly encouraged. Significant practical value, or the
demonstrated utility of constraints technology, will be decisive for
Applications Track submissions.

* Application papers will be reviewed by program committee
members with significant experience in the use of CP in applications.

* The writing of the paper itself is made simple by framing it
around the answers to four main questions (outlined below).

Application papers will appear in the same proceedings as research
papers. The same page limits as well as the same dates apply. Further author
instructions are provided on the submission page and the call for papers.

Suggested Outline
-----------------

Title; Authors/Company

Section 1 - The problem

* context, description, definition...

* size of the application (constraint part/others)?

* how important is the problem? (impact...) in which terms?
(monetary, safety, etc.)

* what is a solution to this problem? (decision, exemplification,
enumeration, counting, optimisation, approximation, etc.)

Section 2 - Why CP?

* what was used before? (hand made, LP...)

* why change? (didn't it work well? difficult to maintain? ...)

* why/how did you come to CP?

Section 3 - How CP?

* model, implementation

* pure CP or hybrid? (is CP used in conjunction with other
problem solving techniques such as LP/MIP, SAT, custom heuristic?)
which decomposition method?

Section 4 - Added Value to CP?

* cost of development? / time spent developing the application?

* how long has it been in production mode (if development completed)?

* what is the feedback from user experience (if applicable)?

* was it difficult/necessary for the end-user to understand
constraint technology?

* what is the return on investment (if applicable)?

* do you plan any new CP based development?

* what are the lessons learned from the use of CP?
**********************************************************
*
* 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] CP 2010: Call for Papers

Call for Papers

CP 2010

Sixteenth International Conference on Principles and Practice of
Constraint Programming

http://cp2010.cs.st-andrews.ac.uk/

6-10th September 2010

St-Andrews, Scotland

Paper submission 13th April 2010, 12 Noon BST = GMT + 1

Paper notification 3rd June 2010


The CP conference is the annual international conference on constraint
programming. It is concerned with all aspects of computing with
constraints, including theory, algorithms, applications, environments, languages,
models, and systems.

CP 2010 includes a Technical Program, where presentations of research
and application papers and invited talks will describe the best results and
techniques in the state-of-the-art of constraint programming. One day of
Workshops precedes the conference. Tutorials and the Doctoral Program
will form part of the main program.

Papers are solicited from any area involved with constraints. The
conference proceedings will be published by Springer in the Lecture Notes in
Computer Science series. Full-length papers are limited to 15 LNCS pages.
Short papers are also encouraged, limited to 8 pages. These will be reviewed to
the same standards of quality as full papers, but will naturally contain less
quantity of new material. Short papers will have the same status as long papers
and be eligible for the best paper prize.

The best papers at CP 2010 will be invited to a special track at
IJCAI-11 featuring papers from specialized area conferences. They will also be
eligible for an expedited reviewing and decision process for publication of an
extended version in JAIR.

Contributions of research papers may be theoretical, empirical, or some
combination of the two. The program committee is instructed to judge
each type of contribution equally, and contains theoretical and empirical
experts suited to assess papers of all types.

Reports on successful applications of constraint technology are
particularly encouraged. Applications Track papers will be reviewed to the same
quality as other papers. However, significant practical value, or the
demonstrated utility of constraints technology, will be decisive for
Applications Track submissions.

Further information is provided on the conference website. Author
instructions will be available on the submission page.
**********************************************************
*
* 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] Teaching Fellowship Bielefeld

================================================================
Teaching Fellowship, Department of Mathematics, Univ. Bielefeld
http://www.uni-bielefeld.de/Universitaet/Aktuelles/Stellenausschreibungen/wiss1368.html
================================================================

The Department of Mathematics at the Univ. Bielefeld has a teaching fellow
position in Mathematics. The position is for two years, the salary is
TVL 13. Candidates should have a finished PhD in Mathematics and
positively evaluated teaching experience. The deadline for application is
Monday, 1 March 2010.

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

Dr Dirk Frettloeh
Fakultaet fuer Mathematik
Universitaet Bielefeld
Postfach 100131
33501 Bielefeld, Germany

Telephone: +49 521 106 4778
Fax: +49 521 106 6481
Email: dirk.frettloeh@math.uni-bielefeld.de
Homepage: www.math.uni-bielefeld.de/baake/frettloe
**********************************************************
*
* 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, February 1, 2010

Grants for Grad Students to Attend STOC 2010

SIGACT supports student travel to STOC. For STOC 2010, SIGACT
anticipates making up to $25,000 of Student Travel Awards, depending in
part on available external funding. These awards are for needy students to
help cover expenses related to attending STOC 2010. Preference will be given
to students who are STOC authors, though all students needing support are
encouraged to apply.

To apply email the information listed below to William Gasarch by
March 26, 2010. The email address is gasarch@cs.umd.edu. Please use the
following subject line: “STOC10 travel award” The email has to be a pdf
file.
Include the following in your email in this order:
1. Title of paper, if you are an author.
2. Will you be presenting the paper?
3. University name and country.
4. A detailed expense list, in US dollars.
5. Other travel funds that are available to you.
6. A statement from your advisor on availability of travel funds (note:
vague statements such as “funds are tight” are not informative).
7. SIGACT encourages applications from members of underrepresented
groups for these awards. (Optional) Please indicate if you are part of
such a group.
8. (For non-authors only.) A short statement describing you academic
standing and interests, your expected graduation date and degree, ad-
visor’s name, and, if available, a URL for a working Web page. Also
indicate whether and when you have attended previous major theory
conferences (e.g. STOC and FOCS).

This information will be used to prioritize the awards. The awards will be
announced shortly after the deadline. Late applications will not be accepted.

You should receive an email acknowledging your application within 3
week days. If not, please resubmit or contact William Gasarch by some
other means. Student travel to STOC 2010 is supported by ACM SIGACT and the
National Science Foundation, Grant No. CCF-0923716.

[DMANET] Postdoctoral Research Fellowships in DIMAP, University of Warwick

====================================================================
Postdoctoral Research Fellowship in DIMAP, University of Warwick
http://go.warwick.ac.uk/dimap/post-doc-2010
====================================================================

The Centre for Discrete Mathematics and its Applications (DIMAP)
[http://go.warwick.ac.uk/dimap/] at the University of Warwick, UK, has a
postdoctoral fellow position in the broadly understood areas of Theoretical
Computer Science, Algorithms and Complexity, Game Theory, or Discrete
Mathematics. The postdoc will be affiliated with the Centre for Discrete
Mathematics and its Applications and with the Computer Science Department at
the University of Warwick. The position is for one year. Candidates should
have finished a PhD in Computer Science, Mathematics, or a related field,
or be on track to finish one by September 2010.


The deadline for the applications is on Wednesday 17 February 2010.

To apply, please follow the instructions on the official advert web page
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job17980.html.

For any further questions related to Postdoctoral Research Fellowships in
DIMAP, DIMAP staff members research interest, and how to apply,
see the web pages at http://go.warwick.ac.uk/dimap/ and
http://go.warwick.ac.uk/dimap/post-doc-2010.

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

Centre for Discrete Mathematics and its Applications (DIMAP)
Computer Science Building
University of Warwick
Coventry CV4 7AL
United Kingdom

URL: http://go.warwick.ac.uk/dimap/
E-Mail
: dimap@dcs.warwick.ac.uk or contact DIMAP coordinator
Anna Guszcza (Anna.Guszcza@dcs.warwick.ac.uk)

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

2010 SIGACT Distinguished Service Prize Call for Nominations

2010 SIGACT Distinguished Service Prize

Call for Nominations

The SIGACT Distinguished Service Prize is given biennially to an individual who has made substantial
service contributions to the Theoretical Computer Science community. It is presented at the ACM
Symposium on Theory of Computing, and comes with a $1,000 prize, a travel grant of up to $700 to
attend the conference, and complimentary conference registration.

Eligibility

The prize can be awarded to an individual for a single contribution or for a series of contributions over a
career. All living individuals are eligible with the exception of previous awardees, the sitting SIGACT
Chair (Lance Fortnow), an individual who nominated a majority of the current selection committee
members, or a member of the current selection committee. Previous awardees are:

1997 David Johnson
1998 Ian Parberry
1999 Fred Roberts
2000 S. Rao Kosaraju
2001 Mike Langston
2002 Alan Selman
2004 Rocky Ross
2006 Tom Leighton
2008 Dick Karp

Selection Committee

The winner is selected by a three‐member committee. The SIGACT chair appoints the selection
committee to serve staggered terms over three award cycles. The 2010 selection committee members
are:
• Dick Karp
• Tom Leighton
• Rocky Ross (chair)

Nominations

Nominations can be made by any member of the Theory of Computing community and should contain a
statement of no more than 500 words explaining why the candidate deserves the award. The
nomination can also include an additional separate listing of service activities. The nomination must
include the name, postal address, phone number, and e‐mail address of the nominator. Additional
support letters may be submitted, although this is not a requirement.

Nominations are to be submitted electronically in PDF format by March 1, 2010, to the chair of the
selection committee, Rocky Ross, at ross@cs.montana.edu.

[DMANET] Full Professor (W3) in Computer Science at the University of Freiburg

The Faculty of Engineering of the University of Freiburg, with its
Departments of Computer Science and Microsystems Engineering, invites
applications for the position of a

*Full Professor (W3) of Computer Science*

The successful candidate will be expected to establish a comprehensive
research and teaching program in the area of algorithms and complexity
with specialisation either in cryptography, optimization or parallel
computing.

The University of Freiburg aims to increase the representation of women
in research and teaching, and therefore expressly encourages women with
suitable qualifications to apply for the post.
Information about the Department of Computer Science can be obtained
from www.informatik.uni-freiburg.de.

Applications, including a curriculum vitae, publications list and
statement of research interests should be sent by March 8, 2010 to the
Dean of the Faculty of Engineering, University of Freiburg,
Georges-Koehler-Allee 101, 79110 Freiburg, Germany
(www.tf.uni-freiburg.de). Please send an electronic version of your
application to the Dean's office and ask for our application form
(dekanat@tf.uni-freiburg.de).

--
Eva Gruenwald
Technische Fakultaet
Dekanat
Georges-Koehler-Allee 101
D-79110 Freiburg
Telefon: +49 (0)761 203 8080
Telefax: +49 (0)761 203 8082
e-mail: gruenwal@tf.uni-freiburg.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] 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
==========================================================================

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