CTW2011 - Deadline *extended to March 14th*

Apologies for multiple postings.

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

10th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
Frascati (Rome), Italy, June 14-16, 2011.

http://ctw2011.dia.uniroma3.it/

------------------------------------------------------------------
- Extended deadline for abstract submission: *March 14th, 2011*
- Acceptance notice: April 15th, 2011;
- Conference dates: June 14-16th, 2011.
------------------------------------------------------------------

The 10th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in the wide
sense.

Authors wishing to submit a contribution, should prepare an *extended
abstract of at most 4 pages* by March 14th, 2011 following the
guidelines on the conference website.

A special proceedings volume of Discrete Applied Mathematics, containing
full length papers, refereed according to the high standards of DAM,
is planned.

Further details are available on the conference website:
http://ctw2011.dia.uniroma3.it

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

[DMANET] New Trends in Mechanism Design, Sep 5 - 9, 2011, Copenhagen

NEW TRENDS IN MECHANISM DESIGN, first announcement

September 5-9, 2011
Copenhagen Business School
Denmark

Workshop and Summer School organized by
CFEM, www.cfem.dk
Center for Research in the Foundations of Electronic Markets

New Trends in Mechanism Design will bring together researchers from
economics and computer science working on the design and analysis of
economic mechanisms and on applications of such mechanism to solve
real-life economic problems for companies, organizations and
governments. The workshop will cover both the design of mechanisms using
game theoretical analysis of incentives, and the calibration of
mechanisms using experimental techniques. A main focus of the workshop
will be contributions from computer science to the field of mechanism
design. Over the last decade, such contributions have intensified due to
the challenges raised by new application domains in the age of the
Internet, in some case leading to exciting new theoretical models. The
applications considered at the workshop include (but are not restricted
to) auctions, including procurement auctions, combinatorial auctions,
sale of digital goods, online advertising, virtual sales of production
and storage capacity, pricing and tariff schemes, cost allocation
mechanisms, matching systems, regulatory mechanisms like yardstick
competition, and benchmarking.

The workshop will be organized with only one stream of presentations.
The presentations will include talks from leading invited scholars, a
limited number of contributed long talks, as well as two sessions with
contributed short (5-10 minutes) presentations of key ideas and findings
and panel discussions on key challenges. A tutorial on mechanism design
for students and other newcomers to the field is held in the beginning
of the week. The program will allow for plenty of interaction between
participants.

To submit a talk (long or short) for consideration, please send an
abstract or a full paper by email to cfem@cs.au.dk before May 1st,
2011. The notification date is July 1st, 2011. Registration for the
workshop begins June 1st, 2011, at www.cfem.dk.

Confirmed keynote speakers:

Peter Cramton, University of Maryland
Uriel Feige, the Weizmann Institute
Jason Hartline, Northwestern University
Nicole Immorlica, Northwestern University
Hervé Moulin, Rice University
Tim Roughgarden, Stanford University

Scientific organizers:

Peter Bogetoft, Copenhagen Business School
Peter Bro Miltersen, Aarhus University

**********************************************************
*
* 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] CTW2011 - Deadline extended to March 14th

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

10th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
Frascati (Rome), Italy, June 14-16, 2011.

http://ctw2011.dia.uniroma3.it/

------------------------------------------------------------------
- Extended deadline for abstract submission: *March 14th, 2011*;
- Acceptance notice: April 15th, 2011;
- Conference dates: June 14-16th, 2011.
------------------------------------------------------------------

The 10th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in the wide sense.

Authors wishing to submit a contribution, should prepare an *extended
abstract of at most 4 pages* by March 14th, 2011 following the
guidelines on the conference website.

A special proceedings volume of *Discrete Applied Mathematics*,
containing full length papers, refereed according to the high standards
of DAM, is planned.

Further details are available on the conference website:
http://ctw2011.dia.uniroma3.it

SCIENTIFIC COMMITTEE
U. Faigle (U. Cologne), J.L. Hurink (U. Twente), L. Liberti (Ecole
Polytechnique, Paris), F. Maffioli (Politecnico, Milano), G. Nicosia (U.
Roma Tre), A. Pacifici (U. Roma Tor Vergata), G. Righini (U. Milano), R.
Schrader (U. Cologne), R. Schultz (U. Duisburg-Essen).
**********************************************************
*
* 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] UNSW, Sydney, Australia - Senior Research Officer (Optimization and/or Statistics)

Senior Research Officer (2 Positions)
The University of New South Wales
Faculty of Science School of Mathematics and Statistics
Closing date: 18th March 2011

REF. 7792NET

Salary Level 8: A$81,250 - A$91,545 per year, plus 17% employer
superannuation plus leave loading.

The Australian Centre for Commercial Mathematics (ACCM) is a
newly created centre in the School of Mathematics& Statistics.
Its mission is to conduct projects with industry to solve
complex problems using advanced mathematics and statistics. The
Centre is seeking to appoint two talented individuals with
experience in statistical and optimization consulting to
private industry or government to join its team. This is an
outstanding opportunity to be involved in projects which have
research value in terms of novel applications of mathematics,
as well as commercial value to the client.

To be considered for the position, you should have a minimum
Masters (PhD desirable) in Statistics or Applied Mathematics,
Operations Research or equivalent qualification in a
quantitative field such as mathematics or engineering;
experience in statistical and/or optimization consulting to
private industry or government on medium to large-scale
projects; strong computational skills; demonstrated project
management and strong analytical skills; demonstrated ability
to manage competing priorities and excellent time-management
skills; demonstrated ability to work cooperatively in a
multi-disciplinary team environment and liaise with associates
of diverse background; and excellent oral and written
communication skills suitable to the Australian business
environment.

This is a full time position, fixed term for two years.

Applicants should systematically address the selection criteria
in their application. Women and people from equity groups are
encouraged to apply.

Having read all the documentation you may then direct any
enquiries to Mr David Shteinman, Chief Operating Officer,
Australian Centre for Commercial Mathematics, on telephone (61
2) 9385 9915 or email:d.shteinman@unsw.edu.au

For information on the School:http://www.maths.unsw.edu.au

For more information, application procedures and other
vacancies, visit:
http://www.hr.unsw.edu.au/services/recruitment/jobs/11021106.html

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

call for papers: ALT 2011

The 22nd International Conference on Algorithmic Learning Theory
Aalto University, Espoo, Helsinki
October 5-7, 2011

CALL FOR PAPERS - ALT 2011

The 22nd International Conference on Algorithmic Learning Theory (ALT
2011, http://www-alg.ist.hokudai.ac.jp/~thomas/ALT11/alt11.jhtml) will
be held at Aalto University in Espoo, Finland, October 5-7, 2011. The
conference is on the theoretical foundations of machine learning. The
conference will be co-located with the 14th International Conference
on Discovery Science (DS 2011, http://ds2011.org/).

Topics of Interest: We invite submissions that make a wide variety of
contributions to the theory of learning, including the following:
* Comparison of the strength of learning models and the design and
evaluation of novel algorithms for learning problems in
established learning-theoretic settings such as
o statistical learning theory,
o on-line learning,
o inductive inference,
o query models,
o unsupervised, semi-supervised and active learning.
* Analysis of the theoretical properties of existing algorithms:
o families of algorithms could include
+ boosting,
+ kernel-based methods, SVM,
+ Bayesian networks,
+ methods for reinforcement learning or learning in
repeated games,
+ graph- and/or manifold-based methods,
+ methods for latent-variable estimation and/or
clustering,
+ MDL,
+ decision tree methods,
+ information-based methods,
o analyses could include generalization, convergence or
computational efficiency.
* Definition and analysis of new learning models. Models might
o identify and formalize classes of learning problems
inadequately addressed by existing theory or
o capture salient properties of important concrete
applications.

Invited Talks. The two distinguished invited speakers for ALT 2011
are professor Peter Auer (University of Leoben) and professor Jorma
Rissanen (Helsinki Institute for Information Technology). In addition
there will be one invited speaker jointly with DS 2011.

Submission. Authors can submit their papers electronically.
Detailed instructions will be available on the conference web page.

Important Dates.
* Submission deadline: May 18, 2011 (you may submit for as long as
it is May 18, 2011 anywhere in the world)
* Notification of acceptance or rejection will be emailed to the
submitting author by June 30, 2011.
* The camera-ready copy of accepted papers will be due July 10,
2011.

Format. The submitted paper should be no longer than 15 pages in the
standard format for Springer-Verlag's Lecture Notes in Artificial
Intelligence series. The 15 page limit includes title, abstract,
acknowledgments, references, illustrations and any other parts of the
paper; appendices bypassing the page limit are not allowed.

Policy. Each submitted paper will be reviewed by the members of the
program committee and be judged on clarity, significance and
originality. Joint submissions to other conferences with published
proceedings are not allowed. Papers that have appeared in journals or
other conferences are not appropriate for ALT 2011.

Proceedings. All accepted papers will be published as a volume in the
Lecture Notes in Artificial Intelligence, Springer-Verlag, and will be
available at the conference. Full versions of selected papers of ALT
2011 will be invited to a special issue of the journal Theoretical
Computer Science.

E.M. Gold Award. One scholarship will be awarded to a student author
of an excellent paper (please mark student submissions on the title
page).

Conference Chair: Esko Ukkonen, University of Helsinki, Finland

Programme Committee:
Jyrki Kivinen (Chair), University of Helsinki, Finland
Csaba Szepesvari (Chair), University of Alberta, Canada
Dana Angluin, Yale University
Jean-Yves Audibert, Universite Paris Est
Shai Ben-David, University of Waterloo
Avrim Blum, Carnegie Mellon University
Nader Bshouty, Technion
John Case, University of Delaware
Ricard Gavalda, Universitat Politecnica de Catalunya
Andras Gyorgy, Hungarian Academy of Sciences
Sanjay Jain, National University of Singapore
Gabor Lugosi, Pompeu Fabra University
Remi Munos, INRIA
Ronald Ortner, University of Leoben
John Shawe-Taylor, University College London
Hans Ulrich Simon, Ruhr-Universitat Bochum
Frank Stephan, National University of Singapore
Eiji Takimoto, Kyushu University
Vladimir Vovk, Royal Holloway, University of London
Akihiro Yamamoto, Kyoto University
Sandra Zilles, University of Regina

Local Arrangement Chair: Olli Simula, Aalto University, Finland

[DMANET] MITACS Workshop: Wireless Networks and Mobile Computing

This coming April 26th-29th, 2011, an international
workshop on Wireless Networks and Mobile Computing
will take place at Carleton University. The event
is under the auspices of the MITACS International
Focus Period on Advances in Network Analysis and
its Applications and further details can be found in
http://www.mitacsfocusperiods.ca/ and
http://people.scs.carleton.ca/~kranakis/conferences/wnet.html

The goal of this research meeting is to bring together
researchers working in wireless networks in order to exchange
problems, ideas, techniques, and state-of-the art results.
There will be lectures of a survey/tutorial nature,
invited talks on specific current research topics and
open problems. The event will include the participation of
senior and junior researchers, graduate students and
post-doctoral fellows as well as discussion of current
important open problems in this growing and exciting
field. A volume of selected papers will be published by
Springer in the series Mathematics in industry.

Plenary speakers:
David Kirkpatrick (UBC, Vancouver)
Allan Borodin (University of Toronto, Toronto)
David Peleg (Weizman Institute, Israel)
Paul Spirakis (CTI, Greece)

Tutorial Speakers:
Jukka Suomela
Anil Vullikanti
Stefan Dobrev, Oscar Morales Ponce, Laco Stacho

Use the registration page
http://people.scs.carleton.ca/~kranakis/conferences/wnet.html
to submit an abstract.

This is a limited participation workshop and
registration is required.
**********************************************************
*
* 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] LOCALGOS 2011 CFP: The 5th International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks

LOCALGOS 2011 Call For Papers
The 5th International Workshop on Localized Algorithms and Protocols
for Wireless Sensor Networks, June 29, 2011.
In conjunction with DCOSS '11, Barcelona, Spain

Important Dates:
Manuscript Submission: Apr. 01, 2011
Acceptance Notification: Apr. 30, 2011
Camera ready: May 30, 2011

LOCALGOS 2011 aims to cover comprehensively the algorithmic issues in the
hot area of ad hoc and sensor networking. It concentrates on such network
layer problems as data communication (routing, QoS-routing, geocasting,
multicasting, broadcasting, etc.) and topology control (neighbor discovery,
power adjustment, neighbor elimination, etc.). The main paradigm shift is
to apply localized (or greedy) schemes as opposed to existing protocols
requiring global information. Localized algorithms are distributed approaches
where simple local node behavior achieves a desired global objective.
Localized protocols provide scalable solutions, that is, solutions for
wireless networks with an arbitrary number of nodes.

The objective of the workshop is to present state of the art research results
on various aspects of localized algorithms and protocols in this rapidly
growing area of ad hoc and sensor networks.

Topics of interest include, but are not limited to:

* Localized unicast and multicast routing protocols
* Localized broadcasting algorithms
* Localized QoS communication protocols
* Localized geocasting protocols
* Localized clustering algorithms
* Localized protocols for duty-cycled sensor networks
* Localized auto-configuration and network formation algorithms
* Topology construction and maintenance based on local information
* Energy-efficient and bandwidth-efficient communication
* Relative positioning algorithms based on local information
* Network graph properties supporting localized protocols
* Localized algorithms for data management and query
* Localized incentive schemes for selfish wireless networks
* Localized algorithms in delay/disruption tolerant networks
* Security based on local information in wireless sensor networks
* Bounds analysis in localized solutions
* Worst and average case analysis in localized algorithms

Papers are solicited in the IEEE proceedings format with up to six (6) pages.
Papers in PDF format must be submitted via Easy Chair by using the following
URL: https://www.easychair.org/account/signin.cgi?timeout=1;conf=localgos10.
All submissions must be original prior unpublished work and not under review
elsewhere. All papers will be reviewed and selected based on their
originality, merit, and relevance to the workshop. Accepted and presented
papers will appear in the DCOSS proceedings and the IEEE Digital Library.
Please email to TPC chairs if you have any questions.

Steering Committee:
Ivan Stojmenovic, University of Ottawa, Canada

Program Co-Chairs
Song Guo, University of Aizu, Japan
Symeon Papavassiliou, National Technical University of Athens, Greece

Publicity Chair
Jiming Chen, Zheijiang University, China
Xu Li, INRIA Lille, France

**********************************************************
*
* 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 Hockey Players: FCRC 2011

I have received a CHALLENGE for a rematch hockey game -- STOC vs ISCA
-- to be held at FCRC 2011 (June 4 - 11, San Jose). (You may recall
that in the last game ("Theory vs Practice") theory lost, but only by
a factor. _

If you plan to attend FCRC and are willing to skate and score for the
glory of ToC, or if you would like to nominate a player, send an email
to the address below to join the team.

For more information visit www.cs.amherst.edu/ccm/hockey/toc.html

Catherine McGeoch
Commissioner of Hockey
for Theoretical Computer Science

ccm@cs.amherst.edu

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

[DMANET] Program of the 12th Congress of the French OR Society

Dear Colleagues,

Now the preliminary program of the 12th Congress of the French Operational
Research Society is ready
http://roadef2011.emse.fr/pdf/ProgrammeROADEF2011_SiteWeb.pdf

with 429 presentations from 120 universities and 35 countries, we expect
more than 600 participants

Keynote speeches will be given by:
George L. Nemhauser, Georgia Tech
David Simchi-Levi, MIT
Roman Slowinski, Poznan University of Technology
Dominique de Werra, Ecole Polytechnique Federale de Lausanne

To register, please go to
http://roadef2011.emse.fr/inscription.en.php

Best regards
Alexandre Dolgui

________________________________________________________________________

Alexandre Dolgui, Dr.Hab., Ph.D.
Professor
Director of the Laboratory for Information Science and Technology
Ecole des Mines de Saint-Etienne
/National Institute of Science and Technology@Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

12th Annual Meeting of the French Operational Research and Decision Aid
Society, ROADEF 2011
http://roadef2011.emse.fr/index.en.php

March 2-4, 2011, in St-Etienne, France
________________________________________________________________________
**********************************************************
*
* 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] ADHOC-NOW 2011 CFP: Submission deadline is extended to Mar. 17, 2011

-----------------------------------------------------------------------
Our apologies if you receive duplicates of this posting.
Please feel free to distribute it to those who might be interested.
-----------------------------------------------------------------------

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

ADHOC-NOW 2011

The 10th International Conference on Ad Hoc Networks and Wireless
http://researchers.lille.inria.fr/~razafind/adhocnow2011

July 18-20, 2011
Paderborn, Germany
***********************************************************************

Since its creation in 2002, ADHOC-NOW has become a well-established and
well-known international conference dedicated to wireless and mobile
computing. It serves as a forum for interesting discussions on ongoing
research and new contributions. The conference addresses both experimental
and theoretical research in the areas of ad hoc networks, sensor networks,
mesh networks and vehicular networks. It focuses on all issues from link
layer up to the application layer. In 2011, ADHOC-NOW will for the first
time be organized in Germany, in the beautiful city of Paderborn.

We seek original contributions as work in progress, experimental and
theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless
Networks. Submissions must not be published or under review for another
conference or journal. We are interested, but not limited to, research
papers in any of the following areas:

Access Control
Ad Hoc Networks of Autonomous Intelligent Systems
Algorithmic Issues
Analytic Methods and Modeling for Performance Evaluation
Ad Hoc Network Applications and Architectures
Delay-Tolerant Networking
Distributed and Localized Algorithms
Energy Efficiency
Geometric Graphs
Location Discovery and Management
Mobility Handling and Utilization
Mobile Ad Hoc Computing Platforms, Systems and Testbeds
Mobile Social Networking
Quality-of-Service
Routing Protocols (Unicast, Multicast, etc.)
Secure Services and Protocols
Sensor and Actuator Networks
Self-Configuration
Service Discovery
Time Synchronization
Vehicular Networks
Wireless Mesh Networks
Wireless Internet

The conference proceedings will be published by Springer-Verlag, as part of
the Lecture Notes in Computer Science (LNCS) series (pending). Each accepted
paper will be included in the conference proceedings, provided at least one
author of the paper registers to present the paper at the conference. High-
quality articles will be invited for a special issue of Ad Hoc & Sensor
Wireless Networks: An International Journal (AHSWN), SCIE-indexed.

Authors can upload either regular papers or short papers. Regular papers
should not exceed 14 pages (including a 150 word abstract, all figures,
tables and references) in Springer Verlag LNCS format. Short papers must be
limited to up to 4 pages in LNCS format. Acceptable formats for papers are
PS and PDF. All papers will be reviewed for technical merit.

Important dates
Paper Submission: Mar. 17, 2011
Author Notification: Apr. 29, 2011
Camera ready: May 13, 2011

Program Co-Chairs
Hannes Frey (Univ. of Paderborn), DE
Xu Li (Univ. of Waterloo), CA

Publicity Co-Chairs
Jiming Chen (Zhejiang Univ.), CN
Nathalie Mitton (INRIA), FR
Yu Wang (UNC at Charlotte), US

Submission Co-Chairs
Cailian Chen (Shanghai Jiao Tong U), CN
Ivan Martinovic (Univ. Kaiserslautern), DE

Proceedings Chair
Stefan Ruehrup (OFFIS, Oldenburg), DE

Local Arrangement Chair
Holger Karl (Univ. of Paderborn), DE

Web Chair
Tahiry Razafindralambo (INRIA), FR

Steering Committee
Evangelos Kranakis (Carleton Univ.), CA
Michel Barbeau (Carleton Univ.), CA
S. S. Ravi (SUNY Albany), US
Ioanis Nikolaidis (Univ. of Alberta), CA
Violet Syrotiuk (Arizona State Univ.), US
Thomas Kunz (Carleton University), CA
Ivan Stojmenovic (Univ. of Ottawa), CA
**********************************************************
*
* 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/
*
**********************************************************

CSL'11 call for papers and workshop proposals

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

CALL FOR PAPERS AND WORKSHOP PROPOSALS

CSL 2011
20th Annual Conference of the
European Association for Computer Science Logic
Bergen, Norway
September 12-15, 2011
http://www.eacsl.org/csl11

IMPORTANT DATES

Submission of title and abstract: March 27, 2011
Submission of full paper: April 3, 2011
Notification: May 30, 2011
Final paper due: June 17, 2011

GENERAL INFORMATION

Computer Science Logic (CSL) is the annual conference of the
European Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose
research activities involve logic, as well as for logicians
working on issues significant for computer science.
The Ackermann Award for 2011 will be presented to the
recipients at CSL 2011.

INVITED SPEAKERS

Thomas Ehrhard (University Paris Diderot)
Martin Otto (Technical University Darmstadt)
Moshe Vardi (Rice University)
Frank Wolter (University of Liverpool)

SCOPE

Topics of interest include (but are not limited to):
- automated deduction and interactive theorem proving
- constructive mathematics and type theory
- equational logic and term rewriting
- automata and games, game semantics
- modal and temporal logic
- model checking
- decision procedures
- logical aspects of computational complexity
- finite model theory
- computational proof theory
- logic programming and constraints
- lambda calculus and combinatory logic
- domain theory,
- categorical logic and topological semantics
- database theory
- specification, extraction and transformation of programs
- logical foundations of programming paradigms
- logical aspects of quantum computing
- verification and program analysis
- linear logic
- higher-order logic
- nonmonotonic reasoning

PROCEEDINGS

The proceedings will be published in the series LIPIcs,
Leibniz International Proceedings in Informatics.
Each paper accepted by the Program Committee (PC) must be
presented at the conference by one of the authors,
and a final copy must be prepared according to LIPIcs guidelines
(http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/).

PAPER SUBMISSION

Authors are invited to submit papers of not more than 15 pages
in LIPIcs style presenting work not previously published.
Papers are to be submitted through EasyChair:
http://www.easychair.org/conferences/?conf=csl2011. Submitted papers
must be in English and provide sufficient detail to allow the PC to
assess the merits of the paper. Full proofs may appear in a technical
appendix which will be read at the reviewers' discretion.
Authors are strongly encouraged to include a well written intro-
duction which is directed at all members of the program committee.
Submission is in two phases with dates as given below.
Papers must not be submitted concurrently to another conference with
refereed proceedings; The PC chair should be informed of closely
related work submitted to a conference or journal by March 19, 2011.
Papers authored or coauthored by members of the PC are not allowed.

WORKSHOPS

Proposals for satellite workshops on more specialized topics are
welcome and can be sent to csl11@eacsl.org

PROGRAM COMMITTEE

Samson Abramsky (Oxford)
Andrea Asperti (Bologna)
Franz Baader (Dresden)
Matthias Baaz (Vienna)
Johan van Benthem (Amsterdam/Stanford)
Marc Bezem (Bergen, chair)
Patrick Blackburn (Nancy)
Andreas Blass (Michigan)
Jan van den Bussche (Hasselt)
Thierry Coquand (Gothenburg)
Nachum Dershowitz (Tel Aviv)
Valentin Goranko (Copenhagen)
Erich Graedel (Aachen)
Wiebe van der Hoek (Liverpool)
Bart Jacobs (Nijmegen)
Reinhard Kahle (Lisbon)
Stephan Kreutzer (Oxford)
Viktor Kuncak (Lausanne)
Daniel Leivant (Indiana)
Benedikt Loewe (Amsterdam)
Jean-Yves Marion (Nancy)
Eugenio Moggi (Genova)
Albert Rubio (Barcelona)
Anton Setzer (Swansea)
Alex Simpson (Edinburgh)
John Tucker (Swansea)
Pawel Urzyczyn (Warsaw)
Helmut Veith (Vienna)
Andrei Voronkov (Manchester)

ORGANIZING COMMITTEE

Isolde Adler
Marc Bezem
Magne Haveraaen
Michal Walicki
Uwe Wolter

CONFERENCE ADDRESS

CSL 2011, Department of Informatics,
University of Bergen,
P.O.Box 7803, N-5020 Bergen, Norway
http://www.eacsl.org/csl11

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

CfP: Theoretical Aspects of Computing (ICTAC 2011) - DEADLINE EXTENDED

Second Call for Papers

ICTAC 2011
International Colloquium on Theoretical Aspects of Computing
URL: http://www.ictac.net/ictac2011/

31 August - 2 September 2011, Johannesburg, South Africa

-------------------------------------------------
The Colloquium will be held in a nature reserve two hours
travel by car from the centre of Johannesburg (transfer
provided), in a malaria-free area in the Waterberg mountains.
All of the big five can be viewed at the reserve and a safari
tour will form part of the social programme for delegates.
-------------------------------------------------
EXTENDED DEADLINES
Paper abstract submission deadline: 31 March 2011
Paper submission deadline: 7 April 2011
-------------------------------------------------

BACKGROUND

ICTAC 2011 is the 8th International Colloquium on Theoretical
Aspects of Computing, the latest in a series founded by the
International Institute for Software Technology of the United
Nations University (UNU-IIST). ICTAC 2011 will bring together
practitioners and researchers from academia, industry and
government to present research and to exchange ideas and
experience addressing challenges in both theoretical aspects of
computing and in the exploitation of theory through methods and
tools for system development. The other main purpose is to
promote cooperation in research and education between participants
and their institutions, from developing and industrial countries,
as in the mandate of the United Nations University.

TOPICS

The topics of the conference include, but are not limited to:

* automata theory and formal languages;
* principles and semantics of programming languages;
* logics and their applications;
* software architectures and their description languages;
* software specification, refinement, verification and testing;
* model checking and theorem proving;
* formal techniques in software testing;
* models of object and component systems;
* coordination and feature interaction;
* integration of theories, formal methods and tools for
engineering computing systems;
* service-oriented development;
* service-oriented architectures: models and development methods;
* document-driven development;
* models of concurrency, security, and mobility;
* theory of parallel, distributed, and grid computing;
* real-time, embedded and hybrid systems;
* type and category theory in computer science;
* models for learning and education;
* cognitive architectures;
* qualitative reasoning;
* case studies, theories, tools and experiments of verified systems;
* domain-specific modeling and technology: examples, frameworks
and experience.

KEYNOTE SPEAKERS

* Jayadev Misra
* David Parnas
* Willem Visser

VENUE, TRANSPORTATION AND ACCOMMODATION

The ICTAC 2011 Colloquium will be held in a nature reserve, away from
the bustle and noise of a large city. The reserve is two hours travel
by car from the centre of Johannesburg, in the Waterberg mountains,
situated on 12000 hectares of malaria-free bushveld. All of the big
five can be viewed at the reserve and a game drive will form part of
the social programme for delegates.

Transfers will be provided for delegates from the ICTAC tutorials to
the reserve, and back again to Johannesburg after the event. The reserve
is also easily accessible by self-drive with normal motor cars.

Delegates can additionally arrange to stay on after the colloquium to
relax and enjoy the quiet of the region, or take part in the numerous
adventure activities - such as horse riding, abseiling, and archery.

Accomodation at the reserve is recommended to simplify access during
the event as other lodges are not easy to reach without a hired vehicle.

Travel to Johannesburg is easy from all parts of the world with many
major carriers having multiple departures each day and the availability
of a modern rail link from O. R. Tambo International Airport to hotels
in and around Johannesburg.

PUBLICATION AND SUBMISSION

The proceedings of ICTAC 2011 will be published by Springer
in the series Lecture Notes in Computer Science (LNCS) and
will be avaialble at the colloquium. A special issue of a
journal with extended version of selected papers from
ICTAC 2011 is under negotiation.

Submissions to the colloquium must not have been published
or be concurrently considered for publication elsewhere.
All submissions will be judged on the basis of originality,
contribution to the field, technical and presentation quality,
and relevance to the conference. Papers should be written in
English and not exceed 15 pages in LNCS format
(see http://www.springer.de/comp/lncs/authors.html for details).

Papers shall be submitted at
http://www.easychair.org/conferences/?conf=ictac2011.

All queries should be sent to: ictac2011@iist.unu.edu

IMPORTANT DATES:

Paper abstract submission deadline: 15 March 2011
Paper submission deadline: 22 March 2011
Paper Accept/Reject Notification: 15 May 2011
Final paper submission 31 May 2011

PROGRAM COMMITTEE

* Bernhard K. Aichernig, Austria
* Junia Anacleto, Brazil
* Jonathan P. Bowen, UK
* Christiano Braga, Brazil
* Vasco Brattka, South Africa
* Andrew Butterfield, Ireland
* Ana Cavalcanti, UK
* Antonio Cerone, Macau SAR China (co-chair)
* Dang Van Hung, Vietnam
* Jim Davies, UK
* David Deharbe, Brazil
* Wan Fokkink, Netherlands
* Pascal Fontaine, France
* Marcelo Frias, Argentina
* Lindsay Groves, New Zealand
* Stefan Gruner, South Africa
* Michael R. Hansen, Denmark
* Rob Hierons, UK
* Lynne Hunt, Australia
* Moonzoo Kim, Korea
* Coenraad Labuschagne, South Africa
* Martin Leucker, Germany
* Liu Zhiming, Macau SAR China
* Patricia Machado, Brazil
* Mieke Massink, Italy
* Ali Mili, USA
* Marius Minea, Romania
* Tobias Nipkow, Germany
* Ogawa Mizuhito, Japan
* Odejobi Odetunji, Nigeria
* Jose Oliveira, Portugal
* Ekow Otoo, South Africa
* Pekka Pihlajasaari, South Africa (co-chair)
* Anders Ravn, Denmark
* Francesca Pozzi, Italy
* Markus Roggenbach, UK
* Augusto Sampaio, Brazil
* Bernhard Schätz, Germany
* Gerardo Schneider, Sweden
* Natarajan Shankar, USA
* Marjan Sirjani, Iceland
* Fausto Spoto, Italy
* Clint van Alten, South Africa
* Franck van Breugel, Canada
* Govert van Drimmelen, South Africa
* Daniel Varro, Hungary
* Herbert Wiklicky, UK

ORGANISING COMMITTEE

* Antonio Cerone, Macau SAR China
* Coenraad Labuschagne, South Africa
* Pekka Pihlajasaari, South Africa
* David Sherwell, South Africa
* Clint van Alten, South Africa

STEERING COMMITTEE

* John Fitzgerald, UK
* Martin Leucker, Germany
* Liu Zhiming, Macau SAR China
* Tobias Nipkow, Germany
* Augusto Sampaio, Brazil
* Natarajan Shankar, USA
* Jim Woodcock, UK

---
Antonio Cerone
Research Fellow
UNU-IIST, Macau SAR China

[DMANET] Call for Workshop Proposals-MSN 2011

Apologies if you receive multiple copies.

Call for Workshop Proposals
International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2011)
Beijing, China, December 16-18, 2011
http://conference.bupt.edu.cn/msn11/

Important Dates
-------------------
Proposal submission deadline: March 10th, 2011
Notification of acceptance: March 30th, 2011

+-------------------------------------------------------------+
MSN is one of the leading international conferences dedicated to
addressing challenges emerging from mobile, wireless and ad hoc
networking and computing. The conference will have many joint
plenary sessions (such as the keynote, panels, and welcoming reception).
MSN 2011 will hold multiple one or half day workshops of the conference
week in Beijing, co-located with the main conference.

We invite you to submit workshop proposals on any topic related
to mobile communications and wireless networking before March 10,
2011 to the Workshop Chairs. The ideal workshop proposal should
focus on a specific area, be of current interest, and be able to
attract a number of high-quality submissions. Proposals on
emerging topics guaranteed to generate significant interest
in the community will be selected. MSN 2011 will have some
returning and some new workshops.

A workshop proposal should be no more than 3 pages, containing at least:
* A draft call for papers (as complete as possible)
* The workshop deadlines (internal and external)
* Names and affiliations of main organizers and tentative
composition of the committees
* Motivation and rationale for the workshop
* Expected number of submissions and participants
* Prior history of this workshop, if any
(including # submissions, # accepted papers and # attendees)
* If the workshop was co-located with another conference, please include
details and a brief description why MSN 2011 is more appropriate.

Email proposals in PDF (ONLY) to workshop co-chairs, including
"MSN 2010 Workshops" in the subject line.

Important workshop dates:
------------------------
Workshop proposals due March 10th, 2011
Notification of Acceptance March 30th, 2011

The final Call for Papers for the accepted workshop should be submitted
by April 10th, 2011 (Workshop Final Call for Papers due).

We look forward to your submissions,

Workshop Co-Chairs:
Jie Li
University of Tsukuba, Japan
lijie@cs.tsukuba.ac.jp

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

Research Fellowship in Combinatorial Optimization at Warwick

Research Fellow
Centre for Discrete Mathematics and its Applications (DIMAP)
Warwick Business School

GBP 27,428 - 32,751 p.a., Fixed Term Contract for 12 months

The Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick is partly funded by an EPSRC Science & Innovation Award of GBP 3.8 million. DIMAP is a multi-discipline joint venture by the Department of Computer Science, the Mathematics Institute and Warwick Business School. More details about DIMAP can be found on http://go.warwick.ac.uk/dimap/.

The closing date/time for applications is midnight (British time) at the end of Friday 25 March 2011.

Details on https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job16611.html

---

Scanned for Warwick Business School by iCritical.

[DMANET] PhD Position at HU Berlin (in German)

Am Institut für Informatik der Humboldt-Universität zu Berlin ist die
Stelle eines/einer

Wissenschaftlichen Mitarbeiters/in

mit Zielrichtung Promotion zu besetzen. Die Stelle ist am Lehrstuhl für
Algorithmen und Komplexität angesiedelt. Zu den Aufgaben gehört neben
der Mitarbeit in der Lehre vor allem die Forschung im Bereich Effiziente
Algorithmen. Besonders erwünscht ist ein Forschungsinteresse
an Approximations- und Online-Algorithmen, energieeffizienten
Algorithmen oder der algorithmischen Spieltheorie.

Die Promotionsstelle ist eingebettet in verschiedene Exzellenzprogramme.
Inbesondere ist sie Teil einer Arbeitsgruppe, die mit Fördermitteln des
Gottfried Wilhelm Leibniz-Preises (angesehenster Wissenschaftspreis
Deutschlands) aufgebaut wird, siehe:
http://www.dfg.de/aktuelles_presse/preise/leibniz_preis/2008/albers.html
Desweiteren bestehen Kooperationsmöglichkeiten mit Projekten innerhalb
des Matheons (http://www.matheon.de/) und des Graduiertenkollegs
"Methods for Discrete Structures" (http://www.math.tu-berlin.de/MDS/).

Kandidatinnen und Kandidaten sollten ein Hochschulstudium in Informatik
oder Mathematik absolviert haben oder kurz vor dem Abschluss stehen.
Der Abschluss des Diploms sollte nicht mehr als 12 Monate zurückliegen.
Erwünscht sind gute bis sehr gute Kenntnisse im Bereich der
Theoretischen Informatik, insbesondere der Algorithmik, und der
Mathematik. Da das Aufgabenprofil der Stelle das Betreuen von
Lehrveranstaltungen umfasst, sollten Bewerber/innen ferner
ausgezeichnete Deutschkenntnisse besitzen. Erwartet wird insgesamt
eine engagierte Mitarbeit an den Projekten des Lehrstuhls (Forschung,
Lehre, akademische Verwaltung).

Bewerbungen mit den üblichen Unterlagen und, wenn möglich, einer Kopie
der Diplomarbeit sind zu richten an:

Prof. Dr. Susanne Albers
Institut für Informatik
Humboldt-Universität zu Berlin
Unter den Linden 6
10099 Berlin
E-Mail: albers@informatik.hu-berlin.de
Tel.: +49-30-2093-3192

**********************************************************
*
* 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] Ph.D. position: Revenue Management in Public Transport

One Ph.D. position in the project Revenue Management in Public Transport

Public transport systems are usually faced with a number of peaks in the
travel demand of the passengers, in particular over the day. This may
lead to an inefficient utilization of the transport capacity. Revenue
Management may be used to increase the utilization of the capacity,
without leading to a lower service level for the passengers.

Revenue Management is based on one hand on combinatorial optimization
models for modifying the public transport system itself, for example
leading to changes in tariffs, frequencies, timetables, capacities, etc.
On the other hand, it requires insight into passenger behavior in
response to these changes in the system. Combining these aspects leads
to a win-win result both for the passengers and for the public transport
system itself. For validating the intended passenger simulation models,
digital data sources such as data from OV chip cards and mobile
telephones are used.

This project is carried out in close cooperation with Netherlands
Railways, the main operator of passenger trains in the Netherlands. The
project builds upon and integrates the research that was carried out by
the Rotterdam School of Management of Erasmus University Rotterdam
together with Netherlands Railways. This earlier research was related to
Revenue Management and Mathematical System Optimization.

Within this project, one Ph.D. position is available at the Rotterdam
School of Management of Erasmus University in Rotterdam. The Ph.D.
position is to be filled as soon as possible.

For further information, please contact prof.dr. Leo Kroon
(lkroon@rsm.nl <mailto:lkroon@rsm.nl> )

More information can also be found at:

http://www.erim.eur.nl/ERIM/Doctoral_Programme/PhD_in_Management/phd_projects/project_details?projectID=740#axzz1ErlIvQZz

**********************************************************
*
* 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] IEEE WoWMoM 2011: Call for Demos

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

CALL FOR DEMOS

WoWMoM 2011
Twelfth International Symposium on a
World of Wireless, Mobile and Multimedia Networks

http://wowmom2011.imtlucca.it/

sponsored by
IEEE Computer Society,
University of Texas at Arlington,
IEEE CS TC on Computer Communications (TCCC)

June 20-24, 2011
Lucca, Tuscany, Italy

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

**** SUBMISSION DEADLINE: MARCH 14th, 2011 *******

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

WoWMoM 2011 invites technical demonstrations and posters showing innovative and original research in the areas of wireless, mobile, and multimedia networking as well as ubiquitous and pervasive systems. Submissions from both industry and academia are strongly encouraged.

A BEST DEMO AWARD will be granted by WoWMoM 2011, based on the demos' innovation and technical contribution.

At least one author of each accepted demo is required to register and present their demo at the conference.

The submissions should include an extended abstract of up to two pages in accordance with the IEEE Computer Society author guidelines. They should explicitly state what will be demonstrated to the WoWMoM audience, and how the attendees will be able to interact, enjoy, and experiment. The abstract should include a full list of authors with complete affiliations. Power and wireless Internet connectivity will be available at the venue. Please clearly state if any additional resources are needed or arrangements have to be made in the email to the demo chairs (not in the abstract).

All submissions will undergo a rigorous review process, the extended abstracts of accepted demonstrations will be included in the proceedings of WoWMoM 2011.

IMPORTANT DATES

* Demo abstract submission deadline: March 14, 2011
* Acceptance notification: April 4, 2011
* Camera-ready submission: April 28, 2011
* WoWMoM 2011: June 20-24, 2011

Submissions should be emailed to BOTH demo chairs:

* Falko Dressler, University of Erlangen, Germany <dressler@informatik.uni-erlangen.de>
* Dario Maggiorini, University of Milan, Italy <dario@dico.unimi.it>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] WG 2011 submission open

The submission server for WG 2011 - The 37th International Workshop on
Graph-Theoretic Concepts in Computer Science is now open. The submission
deadline is March 5, 2011. See more information about the
conference on http://www.wg2011.cz

Jan Kratochvil, Petr Kolman
**********************************************************
*
* 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] CPAIOR2011 Call for Workshop Participation

Dear colleagues,

We would like to invite you to the next workshop dedicated
to railway optimization at CPAIOR 2011 to be held at the
Zuse Institute Berlin, Germany, May 24, 2011.

Call for Talks&Participation:

Workshop on "Mathematical Optimization of Railway-Systems"
at the conference CPAIOR 2011 (May 23-27, 2011), in Berlin
http://cpaior2011.zib.de/

The focus of this workshop is on solution techniques for
combinatorial optimization problems, which arise in railway
systems. The main motivation for this workshop is the
observation that railway planning problems can be extremely
difficult to solve optimally with existing methods, while
doing so could result in huge gains, e.g., in terms of cost
reductions or service quality improvements. The organization
committee invites submissions of extended abstracts
(maximal 2 pages) describing original work or current
problems in railway practice. A substantial connection
to real world railway systems is expressly desired, e.g.,
project participation of industrial partners.
At the CPAIOR 2011 we organize a one day workshop on
"Mathematical Optimization of Railway-Systems" to present
and discuss recent developments in this area.
Topics of interest include, but are not limited to:

* Network Design,
* Line Planning,
* Timetabling,
* Railway Track Allocation,
* Rolling Stock Planning,
* Shunting,
* Crew Scheduling,
* Re-Scheduling,
* Dispatching,
* and, Real-Time Management.

Submissions:

The workshop offers only a limited number of slots for speakers,
which will be selected by the workshop organizers on the basis of
submitted abstracts. Participation is open to everyone.
Registration to the workshop is required via the CPAIOR conference
registration page. Please send a title and an abstract of your talk
(up to 2 pages) to the workshop organizers: cpaior2011-railways@zib.de.
Accepted contributions (abstracts and presentations) will be published
on the workshop's homepage, given the consent of the authors.

Important dates:

* March 31, 2011, Abstract submission
* April 30, 2011, Notification

Workshop organizers:

Ralf Borndörfer, Zuse Institute Berlin, TU Darmstadt, Germany
Holger Flier, ETH Zürich, Switzerland
Martin Fuchsberger, ETH Zürich, Switzerland
Thomas Schlechte, Zuse Institute Berlin, Germany

Contact:

If you have any questions about the workshop in general, the
local organization, etc., please contact us on the
e-mail cpaior2011-railways@zib.de.

Kind regards,

Thomas Schlechte

--
----------------\
Thomas Schlechte \ Konrad Zuse Zentrum fuer Informationstechnik Berlin
------------------\ Takustrasse 7, D-14195 Berlin-Dahlem, GERMANY
\ *Phone: +49-30 841 85-317 *Fax: -269
\ http://www.zib.de/schlechte
\ schlechte@zib.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] IPEC 2011 - Call for Papers

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

IPEC 2011
6th International Symposium on Parameterized and Exact Computation

Saarbruecken, Germany
September 7-9, 2011

http://tcs.rwth-aachen.de/IPEC2011/

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

The 6th International Symposium on Parameterized and Exact Computation
(IPEC 2011, formerly IWPEC) covers research in all aspects of
parameterized and exact algorithms and complexity. Papers presenting
original research in the area are sought, including but not limited
to: new techniques for the design and analysis of parameterized and
exact algorithms, fixed-parameter tractability results, parameterized
complexity theory, relationship between parameterized complexity and
traditional complexity classifications, applications of parameterized
and exact computation, and implementation issues of parameterized and
exact algorithms. In particular, studies on parameterized and exact
computations for real-world applications and algorithmic engineering
are especially encouraged.

IPEC 2011 will be part of ALGO 2011, which also hosts ESA, WABI,
WAOA, ATMOS, and ALGOSENSORS. ALGO 2011 will take place September 5-9,
2011 in Saarbrücken, Germany.

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

Authors are invited to submit an extended abstract in English no
longer than 12 pages using at least 11-point font, preferably in
LNCS-style, describing original unpublished research. Simultaneous
submission to other conferences with published proceedings is not
permitted. Additional details as necessary may be included in a
clearly marked appendix that will be read at the discretion of the
program committee. Authors must submit their papers electronically.
A detailed description of the electronic submission process is
available at the symposium website. Program committee members (except
the co-chairs) are allowed to submit papers.

Accepted papers will be published in the symposium proceedings in the
Springer series Lecture Notes in Computer Science. Authors of accepted
papers are expected to present their work at the symposium, and to
incorporate the comments from the program committee and from the
symposium discussions in the final version of their submissions.
Accepted papers in final form will be due approximately 6 weeks after
the symposium.

The Program Committee may award an Excellent Student Paper Award to
one or more papers accepted to the symposium. A paper is elegible for
the award if all authors are students at the time of submission,
where a student is someone who has not been awarded a PhD.

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

Abstract registration: June 20, 2011, 17:00 GMT
Paper submission: June 23, 2011, 17:00 GMT
Notification of acceptance: July 15, 2011
Symposium: September 7-9, 2011
Final manuscript due: October 20, 2011

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

[DMANET] Call for Speakers and Call for Participation: CPAIOR2011 Workshop on MATHEMATICAL OPTIMIZATION FOR ENERGY NETWORKS

Call for Speakers and Call for Participation
--------------------------------------------

CPAIOR2011 Workshop on MATHEMATICAL OPTIMIZATION FOR ENERGY NETWORKS

Tuesday, May 24, 2011, Zuse Institute (ZIB), Berlin, Germany

Scope
-----

Energy networks are the backbone of a reliable supply of gas, oil, and power
for industrial and private customers. It is required to safely and
efficiently distribute the various sources of energy. Companies involved in
this business are interested in methods to set up, manage, maintain, and
extend such networks in an economic way. New technology advances (such as
smart grids) and new (de-) regulation rules for network operators yield new
challenges that have not addressed before. Recently, contributions from
mathematical optimization techniques are in use to solve such tasks.

At the CPAIOR2011 (http://cpaior2011.zib.de) we organize a one day workshop
on "Mathematical Optimization for Energy Networks" to present and discuss
recent developments in this area. Topics of interest include, but are not
limited to:

* Gas and Oil Networks,
* Smart Grids,
* Networks for Wind, Solar, and Other Renewable Energy Sources,
* Power Networks.,
* Management & Control of Energy Networks,
* Integration of Stochastic Effects (Volatile Sources and Demands, Outages)
in Energy Networks,
* Topology Planning for Energy Networks,
* Dynamic Effects in Energy Networks.

Invited Speakers
----------------

* Daniel De Wolf, Universite du Littoral Cote d'Opale:
"Optimal Design and Dimensioning of Hydrogen Transmission Pipeline Network"
* Asgeir Tomasgard, Norges teknisk-naturvitenskapelige universitet: "A
Stochastic Mixed Integer Model for Natural Gas Infrastructure Investments"

Organization
------------

The workshop offers 9 slots for speakers, which will be selected by the
workshop organizers on the basis of submitted abstracts. Participation is
open to everyone. Registration to the CPAIOR2011 conference is required.
Important Dates:
* March 31, 2011 Abstract submission
* April 16, 2011 Notification

Submissions
-----------

Please send a title and an abstract of your talk (up to 2 pages) to the
workshop organizers:
cpaior2011-energy@zib.de
The workshop material (abstract and presentations) will be published
online.

Workshop organizers
-------------------

Armin Fuegenschuh, Benjamin Hiller, Jesco Humpola, Thorsten Koch
Zuse Institute Berlin, Germany (http://www.zib.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 SPECTS 2011 -- Hague, Netherlands

Our apologies for cross posting
==================================================================
SPECTS 2011
2011 International Symposium on Performance
Evaluation of Computer and Telecommunication Systems
http://atc.udg.edu/SPECTS2011/
June 27-30, 2011,
The Hague, Netherlands

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

This annual international conference is a forum for professionals
involved in performance evaluation of computer and telecommunication
systems. Performance evaluation of computer systems and networks has
progressed rapidly in the past decade and has begun to approach maturity.
Significant progress has been made in analytic modeling, simulation, and
measurement approaches for performance evaluation of computer and
telecommunication systems.

Deadlines
Special sessions proposals: January 31, 2011
Submission of papers (and tutorials proposals): February 28, 2011
Notification of Acceptance: April 29, 2011
Final Camera-Ready Submission Due: May 27, 2011

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

PhD / Postdoc positions in algorithm engineering

Karlsruhe Institute of Technology
Computer Science Department
Algorithms Theory and Algorithm Engineering
(Prof. Peter Sanders)

P h D S t u d e n t s
and
P o s t d o c s

Our group is internationally renowned in the area of algorithm
engineering, i.e., an approach to algorithmics that takes theoretical
and practical relevance equally serious. We are hiring researchers
interested/competent in one or several of the following areas:
- parallel algorithms, in particular
* multicore, GPU, or MPI programming
* performance portability issues
* load balancing and scheduling
* parallel external memory algorithms
- graph algorithms, in particular
* route planning
* graph partitioning and clustering
- handling large data sets, in particular
* algorithms for data bases
* text indexing and string algorithms
- vehicle routing
- green computing

Exceptional candidates working in other areas of algorithmics
are also welcome.

Prerequisites:
- good to excellent diploma or Masters degree from a good university
- solid education in algorithmics
- excellent programming skills preferably in C++
(or excellent abilities in algorithm theory)
- interest in both basic research and practical
exploitation of algorithmic ideas
- Postdocs should have several publications on an algorithmic subject
in good conferences, (e.g. Alenex, ESA, SODA, ...).

More Information: http://algo2.iti.kit.edu/index.php

The CS department at KIT is consistently ranked among the top CS
programs in Germany and situated ideally in the town centre at the rim
of a big park. Karlsruhe is near the Black Forest and the Alsace and
within one train hour from Frankfurt Airport.

Please send (preferably by email using pdf):
- CV with list of publications
- a short research plan (1 page for PhD students, 2 pages for Postdocs)
- addresses of people willing to write a letter of reference
- copies of transcripts
- copies of your two or three most relevant
papers/theses (if available)
to

Peter Sanders
KIT
Fakultät für Informatik
Postfach 6980
76128 Karlsruhe

sanders@kit.edu
Tel:+49 721 608-47580
Fax:+49 721 608-43088

Corresponding to their qualification, disabled persons
will be preferred. In order to increase the number of
women in CS, we particularly welcome applications of women.

[DMANET] Workshop "Combinatorial Optimization, Statistics, and Applications"

========================================================
WORKSHOP: "Combinatorial Optimization, Statistics, and Applications"

March 14-15, 2011
Technische Universitaet Munich
Munich, Germany
========================================================
http://www.cosa-workshop.de
========================================================
Organization: Raymond Hemmecke (TU Munich)
========================================================

This workshop is in the spirit of the former Model Selection Days that
were held at a variety of places with the intention to bring together
researchers from different fields such as algebra, (algorithmic)
discrete mathematics/optimization, computer science, mathematical
statistics with applications for example in the life sciences or in
machine learning.

There will be 3 talks in the afternoon of March 14 (Monday) and 3
talks starting early on March 15 (Tuesday). In addition to this
"official part", we encourage discussions on Monday morning and
Tuesday afternoon among those participants planning to stay for the
full two days.

No registration is required for the workshop. However, a short email
to hemmecke@ma.tum.de is appreciated if you intend to come.

========================================================
Confirmed speakers and talks
========================================================
Ruriko Yoshida (University of Kentucky, Lexington, USA)
Optimality of the neighbor joining algorithm and faces of the balanced
minimum evolution polytope
---
Sonja Petrovic´ (University of Illinois, Chicago, USA)
Existence of MLE for a directed random graph model
---
Stefanie Jegelka (MPI for Biological Cybernetics, Tuebingen, Germany)
Cooperative Cuts
---
Fabian Theis (TU Munich & Helmholtz Center for Environmental Health,
Munich, Germany)
tba
---
Milan Studeny´ (Institute of Information Theory and Automation, UTIA
Prag, Czech Republic)
Learning Bayesian networks viewed as an optimization problem
---
Silvia Lindner (TU Munich, Germany)
Learning restricted Bayesian network structures
========================================================
**********************************************************
*
* 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/
*
**********************************************************

Two Lectureships in Mathematics - London School of Economics and Political Science

*** Apologies for multiple postings ***

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE

Department of Mathematics

Two Lectureships in Mathematics

Salary: £40,484 to £46,897 pa. incl.

Applications are invited from candidates with proven research ability in
Mathematics, especially those with research interests in an area where
the department has current strengths, such as algorithms and discrete
mathematics, financial mathematics, mathematical game theory,
probability theory, and stochastic analysis. Interest in applications of
Mathematics or Computer Science to the Social Sciences is an asset.

You will maintain an active programme of research and will contribute to
the general work of the department, including the teaching of a range of
mathematics courses.

You should have an established track-record of research at a level of
international excellence as well as a completed, or nearly completed,
PhD in a mathematical subject.

Ideally, the posts will commence on 1 September 2011.

Information about the department can be found at
http://www2.lse.ac.uk/maths.

For a full application pack visit www.lse.ac.uk/jobsatLSE. If you cannot
download the pack, email hr.recruit.lec@lse.ac.uk or call 020 7955 6183
quoting reference LEC/10/16.

The closing date for the receipt of applications is 23:59 (UK time) on
24 March 2011. Regrettably, we are unable to accept any applications
that are received after this date.

We value diversity and wish to promote equality at all levels

Any candidate wishing to discuss the appointments informally is invited
to contact Professor Bernhard von Stengel (preferably by email:
stengel@maths.lse.ac.uk).

Please also see: http://www2.lse.ac.uk/maths/News/Lectureships.aspx.

--
Tugkan Batu -- Lecturer
Department of Mathematics
London School of Economics
T.Batu @ lse.ac.uk
http://www.maths.lse.ac.uk/Personal/batu

Two Lectureships in Mathematics at the London School of Economics

*** Apologies for multiple postings. ***

(http://www2.lse.ac.uk/maths/News/Lectureships.aspx)

Two Lectureships in Mathematics

Salary: £40,484 to £46,897 pa. incl.

Applications are invited from candidates with proven research ability in
Mathematics, especially those with research interests in an area where
the department has current strengths, such as algorithms and discrete
mathematics, financial mathematics, mathematical game theory,
probability theory, and stochastic analysis. Interest in applications of
Mathematics or Computer Science to the Social Sciences is an asset.

You will maintain an active programme of research and will contribute to
the general work of the department, including the teaching of a range of
mathematics courses.

You should have an established track-record of research at a level of
international excellence as well as a completed, or nearly completed,
PhD in a mathematical subject.

Ideally, the post will commence on 1 September 2011.

Information about the department can be found at
http://www2.lse.ac.uk/maths

For a full application pack visit www.lse.ac.uk/jobsatLSE. If you cannot
download the pack email hr.recruit.lec@lse.ac.uk or call 020 7955 6183
quoting reference LEC/10/16.

The closing date for the receipt of applications is 23:59 (UK time) on
24 March 2011. Regrettably, we are unable to accept any applications
that are received after this date.

We value diversity and wish to promote equality at all levels

Any candidate wishing to discuss the appointment informally is invited
to contact Professor Bernhard von Stengel (preferably by email:
stengel@maths.lse.ac.uk).

--
Tugkan Batu -- Lecturer
Department of Mathematics
London School of Economics
T.Batu @ lse.ac.uk
http://www.maths.lse.ac.uk/Personal/batu

[DMANET] Two Lectureships in Mathematics - London School of Economics and Political Science

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE

Department of Mathematics

Two Lectureships in Mathematics

Salary: GBP40,484 to GBP46,897 pa. incl.

Applications are invited from candidates with proven research ability in
Mathematics, especially those with research interests in an area where
the department has current strengths, such as algorithms and discrete
mathematics, financial mathematics, mathematical game theory,
probability theory, and stochastic analysis. Interest in applications of
Mathematics or Computer Science to the Social Sciences is an asset.

You will maintain an active programme of research and will contribute to
the general work of the department, including the teaching of a range of
mathematics courses.

You should have an established track-record of research at a level of
international excellence as well as a completed, or nearly completed,
PhD in a mathematical subject.

Ideally, the posts will commence on 1 September 2011.

Information about the department can be found at
http://www2.lse.ac.uk/maths.

For a full application pack visit www.lse.ac.uk/jobsatLSE. If you cannot
download the pack, email hr.recruit.lec@lse.ac.uk or call 020 7955 6183
quoting reference LEC/10/16.

The closing date for the receipt of applications is 23:59 (UK time) on
24 March 2011. Regrettably, we are unable to accept any applications
that are received after this date.

We value diversity and wish to promote equality at all levels

Any candidate wishing to discuss the appointments informally is invited
to contact Professor Bernhard von Stengel (preferably by email:
stengel@maths.lse.ac.uk).

Please also see: http://www2.lse.ac.uk/maths/News/Lectureships.aspx.
**********************************************************
*
* 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/
*
**********************************************************

PhD Position in Analysis of Algorithms, University of Twente

PhD Position at the University of Twente
========================================

A full-time PhD position is available within the project

Smoothed Analysis of Belief Propagation

in the group Discrete Mathematics and Mathematical Programming (DMMP) at the
Department of Applied Mathematics. The project is funded by Netherlands
Organization for Scientific Research (NWO) and is embedded in the University
of Twente's Centre for Telematics and Information Technology (CTIT), the
largest academic ICT research institute in the Netherlands.

REQUIREMENTS

The successful candidate should have a Master's degree in Mathematics,
Computer Science, Econometrics, or a related field. A solid background in
Discrete Optimization, Theoretical Computer Science, or the Analysis of
Algorithms is highly appreciated but not a must as the candidate will be
given the opportunity to follow courses in the LNMB PhD program during
her/his first year (see www.lnmb.nl).

WHAT WE OFFER

We offer a 4-year research position in a dynamic and international
environment. The DMMP group consists currently consists of 10 faculty
members and 13 PhD students and is headed by Prof. Marc Uetz. Please see
www.utwente.nl/ewi/dmmp/ for more details. The University of Twente provides
excellent campus facilities, and actively supports professional and personal
development.

PROJECT DESCRIPTION

Belief propagation is a heuristic approach for solving large-scale
statistical inference problems. It is an easy-to-implement heuristic has
become very popular in a wide range of applications.
Its success in practice, however, is at sharp contrast to the lack of
theoretical understanding of its performance. To provide a more realistic
analysis of algorithms, the concept of smoothed analysis has been developed.
In smoothed analysis, performance is not measured in terms of worst-case
instances. Instead, an adversary specifies an instance, and then the
expected performance is measured when this instance is slightly randomly
perturbed. Smoothed analysis takes into account that practical data is often
noisy, e.g., due to measurement errors.
The aim of this project is smoothed analysis of belief propagation. The goal
is to get a deeper understanding of its performance and to bridge the gap
between theoretical and practical performance of belief propagation.

INFORMATION AND APPLICATION

You are invited to send your application (including curriculum vitae, copies
of certificates, and a letter of motivation) to as well as two letters of
recommendation to the address below. Electronic submissions are highly
encouraged (please attach relevant documents as PDF).

Deadline for applications is March 31, 2011. The letters of recommendation
can be sent after the application, but not later than April 15, 2011. The
intended starting date is late summer 2011.

Please do not hesitate to send any questions to the email given above.

Bodo Manthey
University of Twente
Department of Applied Mathematics
P.O. Box 217
7500 AE Enschede
The Netherlands
Email: b.manthey@utwente.nl
Phone: +31 53 4893385
http://www.math.utwente.nl/~mantheyb/

[DMANET] PhD Position in Analysis of Algorithms, University of Twente

PhD Position at the University of Twente
========================================

A full-time PhD position is available within the project

Smoothed Analysis of Belief Propagation

in the group Discrete Mathematics and Mathematical Programming (DMMP) at
the Department of Applied Mathematics. The project is funded by
Netherlands Organization for Scientific Research (NWO) and is embedded
in the University of Twente's Centre for Telematics and Information
Technology (CTIT), the largest academic ICT research institute in the
Netherlands.

REQUIREMENTS

The successful candidate should have a Master's degree in Mathematics,
Computer Science, Econometrics, or a related field. A solid background
in Discrete Optimization, Theoretical Computer Science, or the Analysis
of Algorithms is highly appreciated but not a must as the candidate will
be given the opportunity to follow courses in the LNMB PhD program
during her/his first year (see www.lnmb.nl).

WHAT WE OFFER

We offer a 4-year research position in a dynamic and international
environment. The DMMP group consists currently consists of 10 faculty
members and 13 PhD students and is headed by Prof. Marc Uetz. Please see
www.utwente.nl/ewi/dmmp/ for more details. The University of Twente
provides excellent campus facilities, and actively supports professional
and personal development.

PROJECT DESCRIPTION

Belief propagation is a heuristic approach for solving large-scale
statistical inference problems. It is an easy-to-implement heuristic has
become very popular in a wide range of applications.
Its success in practice, however, is at sharp contrast to the lack of
theoretical understanding of its performance. To provide a more
realistic analysis of algorithms, the concept of smoothed analysis has
been developed. In smoothed analysis, performance is not measured in
terms of worst-case instances. Instead, an adversary specifies an
instance, and then the expected performance is measured when this
instance is slightly randomly perturbed. Smoothed analysis takes into
account that practical data is often noisy, e.g., due to measurement errors.
The aim of this project is smoothed analysis of belief propagation. The
goal is to get a deeper understanding of its performance and to bridge
the gap between theoretical and practical performance of belief propagation.

INFORMATION AND APPLICATION

You are invited to send your application (including curriculum vitae,
copies of certificates, and a letter of motivation) to as well as two
letters of recommendation to the address below. Electronic submissions
are highly encouraged (please attach relevant documents as PDF).

Deadline for applications is March 31, 2011. The letters of
recommendation can be sent after the application, but not later than
April 15, 2011. The intended starting date is late summer 2011.

Please do not hesitate to send any questions to the email given above.

Bodo Manthey
University of Twente
Department of Applied Mathematics
P.O. Box 217
7500 AE Enschede
The Netherlands
Email: b.manthey@utwente.nl
Phone: +31 53 4893385
http://www.math.utwente.nl/~mantheyb/
**********************************************************
*
* 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/
*
**********************************************************

[NPA] CFP: Network Protocols and Algorithms

********************* Call for Papers *********************

Network Protocols and Algorithms

ISSN 1943-3581

http://www.macrothink.org/journal/index.php/npa/

Network Protocols and Algorithms is a free-access online international journal, peer-reviewed and published by Macrothink
Institute. It publishes papers focused on the design, development, manage, optimize or monitoring any type of network
protocol, communication system, algorithm for communication and any protocol and algorithm to communicate network devices.

The scope of the journal include, but are not limited to, the following topic areas:

- Synchronization Protocols and Algorithms
- Security Protocols and Algorithms
- QoS Protocols and Algorithms
- Ad-Hoc and Sensor Network Protocols and Algorithms
- Content Delivery Networks Protocols and Algorithms
- P2P Protocols and Algorithms
- Cluster-Based Protocols and Algorithms
- Real-Time Protocols and Algorithms
- Wireless Protocols and Algorithms
- MAC Protocols and Algorithms for Wired Networks
- Mobile wireless internet protocols and algorithms
- Delay Tolerant protocols and algorithms
- Mesh network protocols and algorithms
- Protocols and algorithms for Voice over IP delivery
- Cognitive Radio Network Protocols and Algorithms
- Monitoring and management protocols and algorithms
- optical networking protocols and algorithms
- Scalable Network Protocols and Algorithms
- Protocols and algorithms for Green Computing and Resource Allocation
- Routing Protocols and Algorithms
- Tree-based Protocols and Algorithms
- Distributed/Decentralized Algorithms for Networks
- Fault tolerant Protocols and Algorithms
- Protocols and algorithms for Mobile and Dynamic Networks
- Cross-Layer Collaborative Protocols and Algorithms
- Formal methods and cryptographic algorithms for communication
- Power Efficient and Energy Saving Network Protocols and Algorithms
- Multimedia Network Protocols and Algorithms
- Network Protocols and Algorithms for Context-Aware and Semantic Networks
- Localized Network Protocols and Algorithms
- Transport Layer Protocols
- Smart Grids protocols and algorithms

Network Protocols and Algorithms has linked its papers to references by DOI (Digital Object Identifier) numbers.

Network Protocols and Algorithms appears in the next search engines: Google Scholar, Bing, Yahoo and Ask.

Network Protocols and Algorithms is added and indexed in Index Copernicus, ProQuest, EBSCO, Ulrichsweb.com, Directory of
Open Access Journals (DOAJ), Open J-Gate, Gale, Socolar, io-port Database, NewJour - Electronic Journals and Newsletters,
Public Knowledge Project metadata harvester, Ovid LinkSolver, Genamics JournalSeek and PublicationsList.org. It is also
requested to be included in other major Indexing Databases.

You are welcome to submit a paper or forward this call for papers to any people working in Network Protocols and
Algorithms that may be interested in submitting a paper.

The topics suggested by the journal can be discussed in term of concepts, state of the art, standards, implementations,
running experiments and applications. Proposals and deployments are also welcome.

Submission Information:
Only original and unpublished research papers will be considered in this journal. Manuscripts must be writen in English.
All submissions will be reviewed based on technical merit and relevance. Instructions for authors and submissions can be
found in http://www.macrothink.org/journal/index.php/npa/about/submissions

Jaime Lloret Mauri
Editor in Chief of the International Journal of Network Protocols and Algorithms
Associate Professor
Department of Communications
Polytechnic University of Valencia

CALCO-Tools: Call for Papers

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

CALL FOR PAPERS: CALCO-Tools 2011

CALCO-Tools

part of CALCO 2011

August 30 - September 2, 2011

Winchester, UK

http://calco2011.ecs.soton.ac.uk/workshops/calco-tools.html

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

Paper submission: March 23, 2011
Author notification: April 20, 2011
Final version due: May 18, 2011

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

-- SCOPE --

CALCO-Tools 2011 Workshop is dedicated to tools based on algebraic and/or
coalgebraic principles or that are emerging from the intersection of
the two approaches. These include systems/prototypes/tools developed
specifically for design, checking, execution, and verification of (co)
algebraic specifications, but also tools targeting different application
domains while making core or interesting use of (co)algebraic techniques.

The previus CALCO-Tools editions, Bergen (Norway, 2007) and Udine (Italy,
2009), took place in the day preceding the main CALCO conference.
This year, CALCO-Tools 2011 will take place on the same dates as the main
CALCO conference, with no overlap between the technical programmes of the
two events. In this way we achieve the goal of bringing together
researchers and practitioners.

-- TOPICS OF INTEREST --

We invite submissions of papers that are presenting systems/prototypes/tools
on topics included or related to those listed for the main CALCO conference:

* Abstract models and logics
- Automata and languages
- Categorical semantics
- Modal logics
- Relational systems
- Graph transformation
- Term rewriting
- Adhesive categories

* Specialised models and calculi
- Hybrid, probabilistic, and timed systems
- Calculi and models of concurrent, distributed, mobile, and
context-aware computing
- General systems theory and computational models (chemical,
biological, etc)

* Algebraic and coalgebraic semantics
- Abstract data types
- Inductive and coinductive methods
- Re-engineering techniques (program transformation)
- Semantics of conceptual modelling methods and techniques
- Semantics of programming languages

* System specification and verification
- Algebraic and coalgebraic specification
- Formal testing and quality assurance
- Validation and verification
- Generative programming and model-driven development
- Models, correctness and (re)configuration of
hardware/middleware/architectures,
- Process algebra

-- SUBMISSION GUIDELINES --

Tool submissions should not exceed 5 pages in LNCS format specified by
Springer (see http://www.springer.de/comp/lncs/authors.html). It is
recommended that submissions adhere to that format and
length. As with previous editions, the accepted tool papers will be
included in the final proceedings of the conference published in the
Springer Lecture Notes in Computer Science (LNCS) series.
The tools should be made available on the web at the time of submission.

-- IMPORTANT DATES --

Paper submission: March 23, 2011
Author notification: April 20, 2011
Final version due: May 18, 2011

-- PROGRAMME COMMITTEE --

Paolo Baldan, University of Padova, IT
Luis Barbosa, Universidade do Minho, PT
Dorel Lucanu (chair), Al. I. Cuza University of Iasi, RO
Milad Niqui, CWI, Amsterdam, NL
Peter Olveczky, University of Oslo, NO
Dirk Pattinson, Imperial College London, UK

-- ORGANISING COMMITTEE --

Corina Cirstea (University of Southampton, UK)
Dirk Pattinson (Imperial College London, UK)
Toby Wilkinson (University of Southampton, UK)

-- LOCATION --

Winchester is a beautiful historic city in southern England, known for
its 11th-century cathedral and 12th-century castle. It is located just
under an hour by rail from London Waterloo, and 15 minutes by road or
rail from Southampton Airport. London Heathrow is 50 miles away and
London Gatwick 72 miles away.

-- FURTHER INFORMATION --

Queries related to submission, reviewing, and programme should be sent
to the PC chair.

Queries related to the organisation should be emailed to
calco2011@ecs.soton.ac.uk

The poster can be downloaded from
http://calco2011.ecs.soton.ac.uk/workshops/calcotools.jpg
http://calco2011.ecs.soton.ac.uk/workshops/calcotools.pdf

.