Tuesday, May 24, 2011

[DMANET] Submission deadline extended: Young Researchers Forum at MFCS 2011

***********************************************************************
                SUBMISSION EXTENDED: June 10, 2011
***********************************************************************

Young Researchers Forum at MFCS 2011
http://yrf.mimuw.edu.pl
Warszawa, Poland, 22-24 August, 2011

AIM
The aim of the forum is to provide a platform for young researchers
(excellent master students, PhD students, PostDocs, etc.) to present
and discuss their recently published/submitted results or ongoing work
in the field of theoretical computer science in a broad sense. Senior
researchers are warmly welcome to auditorium and discussions.
YRF 2011 is organised during the MFCS 2011 and every participant of
the latter is invited to the sessions of YRF.

SUBMISSIONS
The selection of presentations will be based on one-page abstracts
submitted via submission page. There will be no formal reviews. Please
note that we impose no restrictions on previous or future publication
of the presented results. Authors submitting previously published
results are kindly asked to include a full reference to the corresponding
publications in their submission.

PROCEEDINGS
The abstracts of accepted presentations will be included in informal
proceedings available on site.

IMPORTANT DATES
Submission deadline: June 10, 2011
Notification: June 24, 2011
Workshop: August 22-24, 2011

PROGRAM COMMITTE
Marcin Bieńkowski, University of Wrocław
Stefan Dziembowski, University of Warsaw and Sapienza University of Rome
Artur Jeż, University of Wrocław
Tomasz Jurdziński, University of Wrocław
Antonín Kučera, Masaryk University
Damian Niwiński, Uniwersity of Warsaw
Krzysztof Pietrzak, CWI
Stefan Schmid, TU Berlin & Deutsche Telekom Labs

CONTACT
yrf@mimuw edu pl
**********************************************************
*
* 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] [MobiWac 2011] Call for Posters and Demos (Deadline: June 30)

==================================================================
  The 9th ACM* International Symposium on Mobility Management
               and Wireless Access (MobiWac 2011)
                        www.mobiwac.org

                   CALL FOR POSTERS AND DEMOS
==================================================================

The 9th ACM* International Symposium on Mobility Management and Wireless
Access (MobiWac 2011) will be held in conjunction with MSWiM 2011 (the
14th ACM International Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems) from October 31 to November 4, 2011 at Miami
Beach, FL, USA.

The poster and demo sessions in 9th ACM International Symposium on Mobility
Management and Wireless Access Protocols (MobiWac 2011) provides a forum for
showcasing ongoing research work and to obtain feedback from international
researchers. Researchers are encouraged to submit the preliminary results to
the poster session. We explicitly encourage submissions from students. Authors
are encouraged to submit posters and demos on all aspects of wireless and
mobile access technologies, with an emphasis on mobility management and
wireless access. Submitted posters must neither have been published elsewhere
nor currently be under review by another conference or journal.

For the demo session, we solicit demonstrations in novel systems, platforms and
applications in mobile and wireless access networking systems. We encourage
submissions from both industry and universities. We also encourage submission
of a demo that has already been described in the published literature in
sufficient details.

Accepted posters and demos will be included in the ACM MobiWac proceedings (up
to 4 pages for each poster and demo).

=========================
IMPORTANT DATES

Poster Submission Deadline: June 30th, 2011.
Demo Submission Deadline: June 30th, 2011.
Notification of Acceptance: July 15th, 2011.
Camera Ready Version Due: Aug 5th, 2011.
Speaker Author Registration deadline: Sep 6, 2011
Regular Early Registration deadline: Sep 20, 2011

=========================
TOPICS OF INTEREST include, but are not limited to:

- Wireless/Mobile Access Protocols
- Wireless/Mobile Web Access
- Wireless Internet and All-IP integration
- Next Generation Wireless systems
- Mobile Broadband Wireless Access
- Pervasive Communication and Computing
- Ubiquitous and mobile access
- Wireless Applications and testbeds
- Multi-Homing and Vertical Handoff
- Multi-Channel Multi-Radio MAC / network layer management
- Channels and resources allocation algorithms
- Energy and power management algorithms
- Multi-technology switching using Software Defined Radios
- Context-aware services and applications
- Context-aware protocols and protocol architectures
- Interactive applications
- Mobile database management
- Wireless Multimedia Protocols
- Mobile and Wireless Entertainment
- Mobile Info-services
- QoS management
- Mobility Control and Management
- Localization and tracking
- Mobile/Vehicular environment access
- Wireless ad hoc and sensor networks
- Security,Trust management and Privacy issues
- Fault Tolerance solutions
- Wireless Systems' Design
- Analysis/Simulation of wireless mobile systems
- Testbeds for experimental and simulation analysis

=========================
PAPER SUBMISSION AND PUBLICATION:

Submitted posters must be unpublished and must not be submitted for publication
elsewhere. All posters will be reviewed, and the accepted posters will be on
display during the conference. At least one of the authors of accepted posters
must attend the conference to present the poster.  Posters should be submitted
as a single PDF of no more than 4 pages (including figures, tables and
references), double-column ACM style.

Demos should be submitted as a single PDF of no more than 4 pages (including
figures, tables and references), double-column ACM style. The paper title
should start with "Demo Abstract". Please describe what attendees will be able
to see or do during your demo (e.g. screenshots), and itemize any equipment or
facilities that you will require for your system demonstration.

FOR MORE INFORMATION about the conference, organizing committee,
submission instructions, and venue please see the conference
website (http://www.mobiwac.org/).

=========================
ORGANIZING COMMITTEE:

General Chair

 Jose Rolim, University of Geneva, Switzerland

Program Co-Chairs

 Jun Luo, Nanyang Technological University, Singapore
 Sotiris Nikoletseas, U. of Patras and CTI, Greece

Posters/Demo Chair

 Vinay Kolar, Carnegie Mellon University, Qatar

Web Chair

 Dimitra Patroumpa, U. of Patras and CTI, Greece

Publicity Chairs

 Constantinos Marios Angelopoulos, U. of Patras and CTI, Greece
 Mo Li, Nanyang Technological University, Singapore

Publications Chair

 Liu Xiang, Nanyang Technological University, Singapore

Steering Committee Co-Chairs

 Azzedine Boukerche, U. of Ottawa, Canada
 Albert Zomaya, University of Sydney, Australia

=========================
[*ACM sponsorship: approval pending]
**********************************************************
*
* 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, May 23, 2011

[DMANET] ATMOS 2011 - 2nd Call for Papers

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

11th WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELING, OPTIMIZATION, AND SYSTEMS (ATMOS 2011)

September 8, 2011
Saarbruecken, GERMANY

http://atmos2011.mpi-inf.mpg.de/

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

The ATMOS 2011 workshop will be held in connection with ALGO 2011,
hosted by Max Planck Institut fuer Informatik, which will take place
in Saarbruecken, on September 8, 2011.

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
---------------
Carlo Mannino, Universita di Roma "La Sapienza", ITALY

------------------------------------------------------------------
IMPORTANT DATES
---------------
SUBMISSION DEADLINE: June 24, 2011, 23:59 GMT
NOTIFICATION OF AUTHORS: July 29, 2011
CAMERA READY SUBMISSION: August 26, 2011
WORKSHOP DATE: September 8, 2011

------------------------------------------------------------------
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=atmos2011. The submission
must be received by 23:59 (GMT) on June 24, 2011. Each accepted
paper must be presented at the workshop by one of the authors.

------------------------------------------------------------------
PROCEEDINGS
-----------
The proceedings will be published on the Dagstuhl OpenAccess Series
in Informatics (OASIcs) publication service.

------------------------------------------------------------------
PROGRAM COMMITTEE
-----------------
* Alberto Caprara, Universita di Bologna, ITALY (Co-Chair)
* Cynthia Barnhart, MIT, USA
* Francesco Corman, University of Leuven, BELGIUM
* Friedrich Eisenbrand, EPFL, SWITCHERLAND
* Christoph Helmberg, TU Chemnitz, GERMANY
* Spyros Kontogiannis, University of Ioannina, GREECE (Co-Chair)
* Gabor Maroti, Erasmus University Rotterdam, NETHERLANDS
* Elise Miller-Hooks, University of Maryland, USA
* Dario Pacciarelli, Universita degli Studi "Roma Tre", ITALY
* Martin Skutella, TU Berlin, GERMANY
* Sebastian Stiller, MIT, USA
* Peter Widmayer, ETHZ, SWITCHERLAND

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

* Alberto Marchetti-Spaccamela, Universita di Roma "La Sapienza", ITALY
* Rolf Mohring, TU Berlin, GERMANY
* Dorothea Wagner, Karlsruhe Institute of Technology (KIT), GERMANY
* Christos Zaroliagis, University of Patras, GREECE

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

* Alberto Caprara, Universita di Bologna, ITALY
* Spyros Kontogiannis, University of Ioannina, GREECE

------------------------------------------------------------------
SPONSORSHIPS
------------

ATMOS 2011 will be hosted by the Max Planck Institut fuer Informatik,
and is jointly organized by the University of Ioannina and the
Universita di Bologna.

The co-sponsorship of ATMOS 2011 by the following organizations is
highly appreciated:

* European Association for Theoretical Computer Science (EATCS)
* Research Academic Computer Technology Institute (CTI)

------------------------------------------------------------------
**********************************************************
*
* 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] UMIT (Austria) postdoc position

The Institute for Bioinformatics and Translational Research at UMIT (Austria)
is offering a postdoctoral position for one year.

We are seeking for a highly motivated applicant who possesses the
following essential skills:

- PhD in bioinformatics, systems biology, computer science or biochemistry.

- Strong programming skills in R/python/Java/C and database knowledge
preferably in a Linux environment.

- Experience in statistical data analysis and biomarker analysis.

Knowledge in network biology is desirable but not a must.

Moreover, good communication- and English skills are necessary. Ideally,
the application also possesses German skills.
The ideal candidate would enjoy working in a multidisciplinary environment.

Interested applicants should e-mail a full curriculum vitae, a cover
letter expressing research interests,
and the contact information of two references to Matthias Dehmer
(matthias.dehmer@umit.at).

Contact:
Matthias Dehmer
UMIT
Institute for Bioinformatics and Translational Research
Hall in Tyrol, Austria
Tel.: 0043/(0)50/8648-3851
Fax: 0043/(0)50/8648-673851
Email: matthias.dehmer@umit.at


**********************************************************
*
* 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 AITC 2011

Advances in the Theory of Computing" (AITC'2011) is a special session
of SYNASC 2011, the 13th Annual Symposium on Symbolic and Numeric
Algorithms for Scientific Computing.

Conference location: West University of Timisoara, Romania,
September 26-29, 2011.

AITC Website: http://synasc11.info.uvt.ro/special-sessions/aitc-2011

Program Committee:

+ Cosmin Bonchis, Universitatea de Vest Timisoara, Romania
+ Christopher Homan, Rochester Institute of Technology, USA
+ Gabriel Istrate, Babes-Bolyai University, Romania
+ Temur Kutsia, Research Institute for Symbolic Computation, Austria
+ Mircea Marin, Universitatea de Vest Timisoara, Romania
+ S.S. Ravi, SUNY Albany, USA

We invite submissions presenting significant advances in the Theory of
Computing in the form of:

+ full-length research papers,
+ informal presentations.

Papers of up to 8 pages (IEEE conference style), must be submitted
electronically through EasyChair. Please select the Advances in Theory of
Computing track when prompted by the system. Research papers must
contain original results, not concurrently submitted to other publication
venues and not published elsewhere.

Informal presentations can also be submitted (as a one-page pdf document)
to synasc-tcs@info.uvt.ro. Some of the submissions may be accepted as an
informal presentations only.

All authors of accepted papers are expected to present their contribution(s)
at the conference.

Publication:

Accepted research papers will be published on electronic media (distributed
during the conference) and in the conference post-proceedings published by
the IEEE Computer Society Press. (For previous editions of SYNASC see
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4438060)

Topics:

All areas of Theoretical Computer Science, broadly construed, are of
interest. In particular a non-exhaustive list of topics includes:

+ Data Structures and Algorithms;
+ Combinatorial Optimization;
+ Formal languages and Combinatorics on Words.;
+ Graph-theoretic and Combinatorial methods in Computer Science;
+ Algorithmic paradigms, including distributed, online, approximation,
probabilistic, game-theoretic algorithms.
+ Computational Complexity Theory, including structural complexity,
boolean complexity, communication complexity, average-case complexity,
derandomization and property testing.
+ Logical approaches to complexity, including finite model theory;
+ Algorithmic and computational learning theory;
+ Aspects of computability theory, including computability in analysis and
algorithmic information theory;
+ Proof complexity;
+ Computational social choice and game theory;
+ New computational paradigms: CNN computing, quantum, holographic
and other non-standard approaches to Computability;
+ Randomized methods, random graphs, threshold phenomena and
typical-case complexity;
+ Automata theory and other formal models, particularly in relation to formal
verification methods such as model checking and runtime verification;
+ Applications of theory, including wireless and sensor networks,
computational biology and computational economics;
+ Experimental algorithmics;

IMPORTANT DATES:

22 June 2011 : Paper submission
3 August 2011 : Notification of acceptance
01 September 2011 : Registration
08 September 2011 : Revised papers according to the reviews
26-29 September 2011 : Symposium
30 November 2011 : Final papers for post-proceedings
**********************************************************
*
* 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] PhD or Postdoc Position at TU Berlin

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

Open PhD or Postdoc Position at TU Berlin

A PhD or Postdoc position is available in the Discrete Mathematics group
at Technische Universitaet Berlin, within a research
project with a focus on orientations of embedded graphs funded by the
Deutsche Forschungsgemeinschaft (DFG). Candidates will be expected to
undertake research in related topics. The position is for
three years, with a 3/4 Berlin TVL-13 salary.
Review of applications will commence end of May and continue
until the position is filled.

We are seeking an excellent student or Postdoc with a Masters degree or Diploma in
mathematics or a related field. Solid background in combinatorics and graph
theory is required. Prospective candidates with an interest in planar graphs
or posets are particularly encouraged to apply.
Applications, including CV, list of publications and the names of
references, should be sent to

Stefan Felsner
Institut fuer Mathematik, Sekr. MA 6-1
Technische Universitaet Berlin
Strasse des 17. Juni 136
10623 Berlin, Germany
Email: felsner at math.tu-berlin.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] LIP (ENS Lyon) postdoc position offer

Dear all,

LIP computer science research department at École Normale Supérieure de
Lyon is offering a postdoctoral position for the academic year 2011-2012.
LIP is a joint department with CNRS, INRIA, ENS and UCBL (U. Lyon). LIP
main strength is the creative interaction between long-term 
fundamental research, innovative software and hardware design, and
transfer through industrial  collaborations. This interaction provides a
unique research context and fosters new trends, both  theoretical and
practical, with two main transverse areas: 

   * Mathematical computer science models, methods, and algorithms;
   * Addressing the challenges of future computational and communication
architectures. 

Applications will be taken into consideration until June 17th in all areas
covered by the 8 LIP research teams:

   * ARENAIRE (Computer Arithmetic), project leader Florent de Dinechin
   * AVALON (Algorithms and Software Architectures for Service Oriented
Platforms), project leader Frédéric Desprez
   * COMPSYS (Compilation and Embedded Computing Systems), project leader
Alain Darte
   * D-NET (Dynamic Network), project leader Éric Fleury
   * MC2 (Models of Computation and Complexity), project leaders Pascal
Koiran and Éric Thierry
   * PLUME (programs and proofs), project leader Olivier Laurent
   * RESO (Optimized protocols and software for high performance networks),
project leader Paulo Gonçalves
   * ROMA (Resource Optimization : Models, Algorithms and Scheduling),
project leader Frédéric Vivien

See http://www.ens-lyon.fr/LIP/web for further informations.

The procedure to apply, *until June 17th*, is the following:

   * The position will last one year, starting on *september the first,
2011*.
The candidate should hold a PhD at that date.

   * The candidate should contact the scientific leader of one of the 8
teams, in order to check that her/his application is sensible.

   * After receiving an acknowledgment from the scientific leader, the
candidate should send an application file consisting in: 

   - a letter describing the scientific project, the LIP research team the
candidate is applying to should clearly appear; 

   - a scientific CV (3-4 pages long, a link to a web page where
publications and software are made available is welcome). 

Applications should be sent to Severine.Morin@ens-lyon.fr, cc
Daniel.Hirschkoff@ens-lyon.fr, Gilles.Villard@ens-lyon.fr

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

Nicolas Brisebarre
Arénaire, LIP, ENS Lyon
**********************************************************
*
* 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, May 22, 2011

[DMANET] ALGOSENSORS 2011 - 2nd CFP

SECOND CALL FOR PAPERS

ALGOSENSORS 2011

7th International Symposium on Algorithms for Sensor Systems,
Wireless Ad Hoc Networks and Autonomous Mobile Entities

September 8-9, 2011, Saarbruecken, Germany;
to be held in conjunction with ALGO/ESA 2011

http://www.algosensors.org/algosensors11/

BROADENED SCOPE. Starting from 2011, ALGOSENSORS broadens its thematic
scope, keeping its focus on sensor networks, but also including other
related types of ad hoc wireless networks, such as mobile networks, radio
networks and distributed systems of robots.

KEY FEATURES:

- 2 Tracks (NEW from 2011):

Track A: Sensor Networks

Track B: Ad hoc Wireless and Mobile Systems

- 2 days event duration

- Proceedings by Springer, Lecture Notes in Computer Science (LNCS)

- Special Issue on best papers by the Theoretical Computer Science (TCS)
Journal

PROGRAM COMMITTEE

Chair: Sotiris Nikoletseas, U. of Patras and CTI, Greece
Track A Chair: Pekka Orponen, Aalto U., Finland
Track B Chair: Thomas Erlebach, U. of Leicester, UK

TRACK A (Sensor Networks)

Mihaela Cardei, Florida Atlantic U., USA
Tassos Dimitriou, Athens Information Technology, Greece
Shlomi Dolev, Ben Gurion U., Israel
Alon Efrat, U. Arizona, USA
Jie Gao, SUNY Stony Brook, USA
Aubin Jarry, U. of Geneva, Switzerland
Evangelos Kranakis, Carleton U., Canada
Alexander Kroeller, TU Braunschweig, Germany
Fabian Kuhn, U. Lugano, Switzerland
Mingyan Liu, U. Michigan, USA
Sotiris Nikoletseas, U. of Patras and CTI, Greece
Pekka Orponen (Chair), Aalto U., Finland
Michael Rabbat, McGill U., Canada
Elad Schiller, Chalmers, Sweden
Christian Schindelhauer, U. Freiburg, Germany
Stefan Schmid, T-Labs/TU Berlin, Germany
Jukka Suomela, U. Helsinki, Finland
Subhash Suri, UCSB, USA
Sebastien Tixeuil, U. Paris 6, France
Dorothea Wagner, Karlsruhe Inst. Tech., Germany

TRACK B (Ad hoc Wireless and Mobile Systems)

Matthew Andrews, Alcatel-Lucent Bell Labs, USA
Costas Busch, Louisiana State U., USA
Xiaowen Chu, Hong Kong Baptist U., Hong Kong
Thomas Erlebach (Chair), U. of Leicester, UK
Stefan Funke, U. of Stuttgart, Germany
Magnus Halldorsson, Reykjavik U., Iceland
David Ilcinkas, CNRS and Bordeaux U., France
Danny Krizanc, Wesleyan U., USA
Erik Jan van Leeuwen, U. of Bergen, Norway
Xiang-Yang Li, Illinois Inst. Tech., USA
Sotiris Nikoletseas, U. of Patras and CTI, Greece
Sriram Pemmaraju, U. of Iowa, USA
Cristina M. Pinotti, U. di Perugia, Italy
Rajmohan Rajaraman, Northeastern U., USA
Dror Rawitz, Tel-Aviv U., Israel
Nicola Santoro, Carleton U., Canada
My T Thai, U. of Florida, USA
Anil Vullikanti, Virginia Tech, USA
Peter Widmayer, ETH Zurich, Switzerland
Prudence Wong, U. of Liverpool, UK

STEERING COMMITTEE

Josep Diaz, U.P. Catalunya, Spain
Bhaskar Krishnamachari, U. of Southern California, USA
P.R. Kumar, U. of Illinois, Urbana-Champaign, USA
Jan van Leeuwen, U. of Utrecht, The Netherlands
Sotiris Nikoletseas, U. of Patras and CTI, Greece (Chair)
Jose Rolim, U. of Geneva, Switzerland
Paul Spirakis, U. of Patras and CTI, Greece

IMPORTANT DATES:

Paper submission: June 21, 2011
Notification: July 29, 2011
Camera-ready for pre-proceedings: August 15, 2011
Symposium: September 8-9, 2011
Camera-ready copy for post-proceedings: October 10, 2011

PROCEEDINGS: Accepted papers will be published in full text in hardcopy
post-proceedings, in the Lecture Notes in Computer Science (LNCS) Series
of Springer Verlag. Submissions may be considered for a two-page brief
announcement in case not accepted as a full text; authors who wish their
paper to be considered for both full paper and brief announcement tracks
should indicate this fact on the front page.

TCS JOURNAL SPECIAL ISSUE: As in previous years, selected high-quality
papers will be considered for publication in a Special Issue of the
Theoretical Computer Science (TCS) Journal.

SCOPE AND TOPICS: Wireless ad-hoc sensor networks have recently become a
very active research subject due to their high potential of providing
diverse services to numerous important applications, including remote
monitoring and tracking in environmental applications and low maintenance
ambient intelligence in everyday life. The effective and efficient
realization of such large scale, complex ad-hoc networking environments
requires intensive, coordinated technical research and development
efforts, especially in power aware, scalable, robust wireless distributed
protocols, due to the unusual application requirements and the severe
resource constraints of the sensor devices. On the other hand, a solid
foundational background seems necessary for sensor networks to achieve
their full potential. It is a challenge for abstract modeling, algorithmic
design and analysis to achieve provably efficient, scalable and
fault-tolerant realizations of such huge, highly-dynamic, complex,
non-conventional networks. Features including the extremely large number
of sensor devices in the network, the severe power, computing and memory
limitations, their dense, random deployment and frequent failures, pose
new interesting abstract modeling, algorithmic design, analysis and
implementation challenges of great practical impact. ALGOSENSORS aims to
bring together research contributions related to diverse algorithmic and
complexity theoretic aspects of wireless sensor networks.

Starting from 2011, ALGOSENSORS broadens its thematic scope, keeping its
focus on sensor networks, but also including other related types of ad hoc
wireless networks, such as mobile networks, radio networks and distributed
systems of robots.

Contributions solicited cover the algorithmic issues in a variety of
topics including, but not limited to:

- Wireless Network Models
- Virtual Infrastructures
- Data Propagation and Routing
- Multicast and Broadcast
- Obstacle Avoidance
- Infrastructure Discovery
- Ad-hoc Deployment/Topology Control
- Fault Tolerance and Dependability
- Multi-hop Throughput Optimization
- Scheduling and Load Balancing
- Energy Management and Power Saving Schemes
- Dynamic Networks
- Adaptiveness and Self-organization
- Resource-efficient Distributed Computing
- Communication Protocols
- Medium Access Control
- Localization and Location Tracking
- Mobile Robotic Systems and Autonomous Agents
- Game Theoretic Aspects
- Cryptography, Security and Trust

HOW TO SUBMIT: Authors are invited to submit manuscripts reporting
original research in the topics related to the Symposium. The Track the
paper is submitted to should be clearly identified at the front page.
Authors should select a Track based on the type of network that is
studied in the paper or for which the results in the paper are most
relevant. The Program Committee reserves the right to move papers
between Tracks in order to ensure a fair evaluation. Simultaneous
submission to other conferences is not allowed. Papers should
not exceed twelve (12) pages of text using at least 11 point size type,
including references, figures, tables, etc., preferably formatted in the
LNCS style. Additional material may be added in a clearly marked Appendix
to be read at the discretion of the Program Committee Members. Authors
must submit their papers electronically via the website:
http://www.algosensors.org/algosensors11/submission.php. All papers
will be peer reviewed, and comments will be provided to the authors.
Authors need to ensure that for each accepted paper at least one
author will attend the symposium.

--
Thomas Erlebach (t.erlebach@mcs.le.ac.uk)
Department of Computer Science, University of Leicester
**********************************************************
*
* 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] Postdoc position in the Discrete Optimization group at EPFL

The "Discrete Optimization Group" at EPFL, Switzerland
http://disopt.epfl.ch/ invites applications for a Postdoc position.

The appointment is for 12 months.

The research interests of the group are in integer programming,
approximation algorithms, network design, computational and discrete
geometry and applied optimization. We are looking for a candidate
whose research interests lie in at least one of the fields above.

The Postdoc position comes with teaching obligations. This either
means that the prospective holder of the position serves as a teaching
assistant or teaches one course per semester at the doctoral level.

Applications (including curriculum vitae, list of publications,
research plan, names of three references with their e-mail addresses,
and intended period of stay) should be sent to Friedrich Eisenbrand
( friedrich.eisenbrand@epfl.ch ). Electronic applications are welcome
and should consist of one single PDF-file.

The deadline for applications is June 30, 2011. The starting date is
September 1, 2011.

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

Saturday, May 21, 2011

[DMANET] Special Issue CFP

A Special Issue of the Journal of Mathematics and Art
Mathematical Models used in Aesthetic Evaluation

Guest Editors: Gary Greenfield and Penousal Machado

By sampling across the broad spectrum of mathematical models currently being
used by researchers in visual arts and music, this special issue will chronicle
the state of the art when algorithmically evaluating works of art on the basis
of their aesthetic content.

Despite its long history, the problem of automating aesthetic evaluation remains
a difficult and challenging one. In the 1930s, G..D. Birkhoff first proposed
using M = O/C, where O is order and C is complexity, to evaluate "pleasing
polygons" and "elegant vases". In the 1960s, Max Bense led a movement to use
information theory to "obtain a vector or scalar measurement of the aesthetics
of a work of art." In the 1970s, Stiny and Gips introduced shape grammars as a
means for algorithmically specifying aesthetics in painting and sculpture. In
the 1990s, in response to the growing popularity of evolutionary computation,
researchers began to investigate mathematical models for aesthetic evaluation
within the context of generative art systems. That is, they began to study how
to identify visual and audio material that might be of aesthetic interest to
humans when a prohibitively large number of compositions needed to be evaluated.

This special issue will focus on current efforts to investigate a wide variety
of mathematical models under the umbrella of algorithmic aesthetics for
automating aesthetic evaluation within different problem domains. Submissions
should be in accord with the general guidelines for submissions to the Journal
of Mathematics and Art (see Instructions for Authors).

Deadline for Submissions: August 1, 2011; early submissions appreciated.
Send submissions to: ggreenfi@richmond.edu as an email attachment.
For more information, contact Penousal Machado at machado@dei.uc.pt.

**********************************************************
*
* 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] 3rd SDP day: Application of semidefinite programming, July 1, CWI Amsterdam

+++ Invitation +++ Call for Participation +++

3rd SDP day: Applications of semidefinite programming
at CWI in Amsterdam
on Friday, July 1, 2011

This a one-day meeting for those who are interested in semidefinite programming and its application to combinatorial optimization, complexity theory, mathematical physics, geometry, and graph theory.

There will be five talks by Christine Bachoc (University of Bordeaux), Nikhil Bansal (IBM Research, Yorktown Heights, NY), Frauke Liers (University of Cologne), David Steurer (Microsoft Research, New England), Levent Tuncel (University of Waterloo). On Thursday, June 30, 2011 we will also organize some additional lectures by young researchers.

Participation is free. Please send an email to f.vallentin@tudelft.nl before June 24 to register (so that we can plan the coffee breaks and the (free) lunch).

For further information see

http://www.cwi.nl/~vallenti/3rdSDPday

Organizers: Monique Laurent (CWI Amsterdam, Tilburg University), Frank Vallentin (TU Delft, CWI Amsterdam)

**********************************************************
*
* 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 for the 4th IEEE International Workshop on Wireless Sensor, Actuator and Robot Networks (WiSARN-FALL 2011)

We apologize if you receive multiple copies of this message.
------------------------------------------------------------------------
Call for Papers for the 4th IEEE International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN-FALL 2011)
http://researchers.lille.inria.fr/~mitton/WiSARN-fall2011/

To be held in conjunction with the 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems
(IEEE MASS 2011)
October 17-22, 2011, Valencia, Spain.

Wireless sensor and actor networks (WSAN) are the confluence point where the traditional
fields of wireless sensor networks (WSN), robot networks and control theory meet. In WSAN,
nodes collaborate to accomplish distributed sensing and actuation tasks. Leveraged by the
control and mobility of actors, the networking process and applications embrace a whole new
set of possibilities. Actors may deploy, repair and relocate sensors to improve coverage, build
routes and fix network partition to ensure data communication, change network topology to
shape routing patterns and balance energy consumption, and respond to reported events in a
timely and effective manner. The benefits are limited only by imagination. As an emerging
field, WSAN are in need of new networking techniques, by which they can fully exploit their
particularities and potentials. WiSARN aims to bring together state-of-the-art contributions on
the design, specification and implementation of architectures, algorithms and protocols for
current and future applications of WSAN. Original, unpublished contributions are solicited in
ALL aspects of WSAN, WSN, robot networks, and robotics and automation. Possible topics
include, but are not limited to:

・ Autonomous sensor networks
・ Emergent behavior in WSAN
・ Modeling and simulation of WSAN
・ WSAN architectural and operational models
・ Autonomic and self-organizing coordination and communication
・ Sensor-/actor (robot)- actor coordination and actor task assignment
・ Biologically inspired communication
・ Energy-efficient and real-time communication protocols
・ Bandwidth-efficient and delay-tolerant communication protocols
・ Communication protocols for swarms of mobile actors (robots)
・ Data management, gathering, aggregation and query processing
・ Distributed control and management in WSAN
・ Neighborhood discovery and mobility management
・ Map exploration and pattern formation of mobile robots
・ Localization and time synchronization and in WSAN
・ Quality of Service, security and robustness issues
・ Architectures and topology control
・ Probabilistic integration in WSAN
・ Hybrid networks and wireless Internet
・ Ecological systems
・ Applications and prototypes

Accepted papers with a FULL registration to the main conference will be included in the
conference proceedings. No-shows of accepted papers at the workshop will result in those
papers NOT being included in the IEEE CPS and included in MASS proceedings. Thus, all
papers will be EI-indexed, and be found by IEEE Explore. Selected best papers will be invited
to a special issue of Ad Hoc & Sensor Wireless Networks (SCIE-indexed).


IMPORTANT DATES:
Paper submission: June 26th, 2011
Author notification: July 22th, 2011
Final manuscript due: August 12th, 2011


General Chair:
Ivan Stojmenovic, University of Ottawa, Canada

Program Co-Chairs:
Jiming Chen, Zhejiang University, China
Hannes Frey, Univerity of Paderburn, Germany
Nathalie Mitton, INRIA, France

Submission Chair:
Rafael Falcon, University of Ottawa, Canada

Publicity Co-Chairs:
Mianxiong Dong, University of Aizu, Japan
Antoine Gallais, University of Strasbourg, France
Hangguan Shan, Zhejiang University, China


For further information, please refer to the above WiSARN-Fall 2011 website,
or contact the program co-chairs:
Dr. Jiming Chen at jmchen.zju@gmail.com
Dr. Hannes Frey at hannes.frey@uni-paderborn.de
Dr. Xu Li at easylix@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/
*
**********************************************************

Friday, May 20, 2011

[DMANET] IEEE TPDS Special Issue on Cyber-Physical Systems

                                          Call for Papers
                                      for a Special Issue of
                 IEEE Transactions on Parallel and Distributed Systems (TPDS)
                                  on Cyber-Physical Systems (CPS)

IEEE Transactions on Parallel and Distributed Systems (TPDS) is seeking original
manuscripts for special Issue on Cyber-Physical Systems (CPS), scheduled to be
published in the September issue of 2012. Although significant advances have been
achieved over the last decades in several fields of science and engineering, and especially
in the areas of distributed computing, sensing, data collection and internet-connection of
large scale object networks, it is mainly the coordination and tight link between
computational, virtual and physical resources that will drive the potential of having a
pervasive effect in the citizens everyday life, satisfying various needs and also creating new
opportunities for the introduction of services that will enhance the Quality of Life of the
society as a whole. Research advances in cyber-physical systems promise to transform
our world with systems that will far exceed those of today in terms of: effectiveness,
adaptability, autonomicity, energy efficiency, precision, reliability, safety, usability,
scalability, stability and user-centric applicability. Moreover, recently the Sensor Web
concept came into foreground, aiming at combining distributed sensing with the ubiquitous
connectivity and accessibility of the web, therefore facilitating the close interaction of digital
world with physical world.

Cyber-physical systems find direct applicability in a wide range of areas and disciplines,
including for instance (but not limited to):
a) Smart Grid technologies:
that aim at facilitating a reliable and efficient delivery of electricity to consumers using
two-way digital communications and security technologies, which allows utility providers
and consumers to constantly monitor and control the delivery network as well as electricity
consumption for the purpose of energy saving, cost reduction, and reliability enhancement;
b) Wireless sensing, monitoring and networking:
to enable distributed monitoring systems of numerous smart sensors and actuators,
mobile devices, RFIDs, robots etc., which revolutionize a variety of application areas with
unprecedented density, fidelity, and scalability of environment instrumentation;
c) Vehicular cyber-physical systems and intelligent transportation systems:
that integrate computing, communication, and storage capabilities with monitoring and
control of vehicles in the physical world to deal with the grand challenges of safe, green,
and efficient transportation.

The technical challenges are significant, and of high research and practical importance,
mainly stemming from the fact that traditionally different groups of scientists deal with this
setting without much interaction, using disjoint sets of techniques. Towards merging the
two main and different features of those systems, that of information-centric character and
node-centric physical world connectivity, well-defined analytical models, methodologies and
experimental validations are required of how to build such systems capable of coping with
the entire chain of operations and orchestrating the various parts together in a flexible,
efficient and economic way.

Topics of interest include, but are not limited to the following:
* Architectural framework for distributed CPS
* Resource Management in large scale CPS
* Smart Grid Technologies
* Security, privacy, scalability, and reliability issues
* Design and cross-layer optimizations
* Vehicular CPS and intelligent transportation systems
* Novel monitoring applications with sensors, actuators,
  smart phones, robots, and other wireless mobile devices
* Distributed and scalable monitoring systems
* Evaluations and filed trials of CPS and solutions

Submitted articles must not have been previously published or currently submitted for
journal publication elsewhere. As an author, you are responsible for understanding and
adhering to our submission guidelines. You can access them by clicking on the following
web link: http://www.computer.org/mc/tpds/author.htm. Please thoroughly read these
before submitting your manuscript. Please submit your paper to Manuscript Central at
https://mc.manuscriptcentral.com/tpds-cs.

Please note the following important dates:
Manuscript Submission Deadline:   September 16, 2011
Notification of Initial Decision: November 18,  2011
Minor Revisions due (if needed):  December 15,  2011
Notification of Final Decision:   January 26,   2012
Final Manuscripts Due:            February 03,  2012
Publication Date:                 September     2012

Co-guest Editors:
Symeon Papavassiliou, National Technical University of Athens
Nei Kato, Tohoku University
Yunhao Liu, Hong Kong University of Science and Technology
Cheng-Zhong Xu, Wayne State University

Publicity Co-Chairs:
Paolo Bellavista, University of Bologna
Jiming Chen, Zhejiang University
Xu Li, University of Waterloo
**********************************************************
*
* 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] May 2011 ICIAM 2011 News

If you haven't registered for ICIAM 2011 - the International Congress on Industrial & Applied Mathematics from July 18 - 22, 2011 in Vancouver, Canada - do so now! Advance online registration closes June 15, 2011. Here is the link: http://bit.ly/gPYJTN

For the first time, the Congress will be using social media to enhance conference experience both for attendees and those following proceedings remotely. Twitter will be used to deliver updates and announcements and to enable scientific discussion and interaction among delegates. Follow us <http://twitter.com/#!/iciam2011> on Twitter (http://twitter.com/#!/iciam2011) to keep up to date with conference announcements. If you're tweeting about ICIAM 2011, before, during or after the meeting, please use the hashtag #ICIAM2011. Also, watch for a mobile phone app to be available soon.

Students looking to network with and meet mathematicians and professionals from around the world should consider volunteering. Opportunities range from preparing delegate kits and shooting photographs to assisting at outreach events. There is also the possibility of volunteers receiving travel funding and/or registration reimbursement. For complete details on the openings available, please visit the volunteers page at http://bit.ly/ltP1Hn.

Students can also enjoy a casual, social interaction with peers at the Student Networking Social on Monday, July 18. Organized by the Mitacs Student Advisory Committee, the event will involve a workshop on networking plus a chance to network with professionals and students from all over the world. The social includes lunch and door prizes.

Here are a few highlights about the scientific program (http://bit.ly/mpgsJm):

In a panel on Statistical Sciences, Dr. Bin Yu (University of California Berkeley, USA) will focus on the massive amounts of data collection in science, engineering, social science, finance and other fields, enabled by great advances in information technology. Dr. Zhi Geng (Peking University, China) will talk about statistical approaches for evaluating and discovering causal effects and networks.

The Fluid Mechanics theme will be highlighted by an invited talk by Pierre Sagaut (Pierre et Marie Curie, France) who will explain the significance of turbulent flow simulation in both fundamental research and engineering applications. The talk will cover recent advances in uncertainty quantification in addition to turbulence models. Description of turbulent flows and investigation of their properties as well as control problems connected with fluid flows will be among the topics presented in the Mathematical Fluid dynamics minisymposium organized by Andrei Fursikov (Moscow State University, Russia).

Ron Kimmel (Technion Israel Institute of Technology, Israel) will talk about geometric objects as metric spaces, which allow a better understanding of facial similarities and body posturing. As part of the Image and Signal Processing theme, his invited lecture will elucidate on image and shape analysis in the area of image processing and computer graphics. As part of the same theme, Vicent Caselles (Universitat Pompeu-Fabra, Spain) will address image recovery in the case of missing and corrupted images. The talk will focus on the applications of image inpainting and recovery in video and cinema post-production.

The panel on Computational and Modeling Challenges in Industry will address just that. An invited talk by Peter Fritzson (Linköping University, Sweden) will give an overview of emergent computer languages that support modeling in addition to programming. The lecture will specifically focus on Modelica, a language used for mathematical modeling and simulation of complex systems.

Look up the full program (click here: http://bit.ly/gWWrGk) to browse a complete list (http://bit.ly/cBHdGk) of topics for the thematic minisymposia, each of which includes a Lead Lecture followed by six session speakers.

We look forward to seeing you in Vancouver!

Best wishes,

Arvind Gupta

President, ICIAM 2011

CEO & Scientific Director, Mitacs


**********************************************************
*
* 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-- 4th SETOP 2011, Co-located with ESORICS 2011

CALL FOR PAPERS -- SETOP 2011

4th International Workshop on Autonomous
and Spontaneous Security
<http://setop2011.dyndns.org>

**Submission deadline: June 5, 2011**

15 -- 16 September, 2011, Leuven, Belgium,
Co-located with ESORICS 2011,
Springer LNCS Proceedings

Scope:

Security and reliability have become a major concern for service
oriented applications as well as for communications systems and
networks. With the need for evolution, if not revolution, of current
network architectures and the Internet, autonomous and spontaneous
management will be a key feature of future networks and information
systems. In this context, security is an essential property. It must
be thought at the early stage of conception of these systems and
designed to be also autonomous and spontaneous.

Future networks and systems must be able to automatically configure
themselves with respect to their security policies. The security
policy specification must be dynamic and adapt itself to the changing
environment. Those networks and systems should interoperate securely
when their respective security policies are heterogeneous and possibly
conflicting. They must be able to autonomously evaluate the impact of
an intrusion in order to spontaneously select the appropriate and
relevant response when a given intrusion is detected. Autonomous and
spontaneous security is a major requirement of future networks and
systems. Of course, it is crucial to address this issue in different
wireless and mobile technologies available today such as RFID, Wifi,
Wimax, 3G, etc. Other technologies such as ad hoc and sensor networks,
which introduce new type of services, also share similar requirements
for an autonomous and spontaneous management of security.

Topics:

The SETOP Workshop seeks submissions that present research results on
all aspects related to spontaneous and autonomous security.
Submissions by PhD students are encouraged. Topics of interest
include, but are not limited to the following:

* Security policy deployment
* Self evaluation of risk and impact
* Distributed intrusion detection
* Autonomous and spontaneous response
* Trust establishment
* Lightweight cryptography
* Selfish behavior and collaboration enforcement
* Security in autonomous networks
* Security in ad hoc networks
* Security in sensor/RFID networks
* Security of Next Generation Networks
* Security in Cloud Computing
* Security of Service Oriented Architecture
* Security of opportunistic networks
* Privacy in self-organized networks
* Secure localization
* Context aware and ubiquitous computing
* Secure interoperability and negotiation
* Self-organization in secure routing
* Identity management
* Modeling and validation of security

Submission Guidelines:

Papers should be at most 15 pages (using 11-point font), excluding the
bibliography and well-marked appendices. Committee members are not
required to read the appendices, so the paper should be intelligible
without them. All submissions must be written in English.

Authors must submit their papers by the deadline indicated below,
using the EasyChair web site (use the link
http://www.easychair.org/conferences/?conf=setop2011) and following the
requirements stated there.

All papers will be refereed. Accepted papers should be presented at the
Workshop. At least one author of each accepted paper must register to
the workshop, by the early date indicated by the organizers, and
present the paper.

Submissions by PhD students as well as controversial ideas are
encouraged. Case studies (successful or not) are also encouraged.

Important dates:

* Intention of Submission: ASAP (send an abstract to
setop2011@easychair.org)
* Paper Submission Deadline: June 5, 2011
* Paper Acceptance Notification: July 28, 2011
* Camera Ready: August 15, 2011
* Workshop Dates: 15 - 16 September, 2011

Committees:

General Chair:

* Frederic Cuppens (TELECOM Bretagne, FR)

Program Committee Chairs:

* Sabrina De Capitani di Vimercati (UNIMI, IT)
* Joaquin Garcia-Alfaro (TELECOM Bretagne, FR)
**********************************************************
*
* 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 participation: Workshop on Games, algorithms and optimization

Dear colleagues,

A workshop entitled "games, algorithms and optimization" will be held on
Friday June 24th in Paris. You can find the preliminary program at
http://coca.lip6.fr/Main/Workshop.

You are welcome to attend the workshop: just send an email with your name
and affiliation to workshopgamesparis6@gmail.com.

Looking forward to seeing you in Paris,

The organizing committee
(B. Escoffier, L. Gourves, T. Nguyen Kim, J. Monnot, S. Moretti, F.
Pascual, O. Spanjaard)


**********************************************************
*
* 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] MITACS WORKSHOP: Network and Internet Economics

This coming May 30 to June 01, 2011, an international
workshop on Internet and Network Economics will take
place at SFU Harbor Center in Vancouver. 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/ninet.html

The goal of this research meeting is to bring together
researchers working on the subject 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 topicsi, panel 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.

Plenary speakers:
Andrew Odlyzko (University of Minnesota)
Amin Saberi (Stanford University)
Frank Kelly (University of Cambridge)
Adrian Vetta (McGill University)

Tutorial Speakers:
Terry Friesz (Penn State University)
Stefano Leonardi (Sapienza University of Rome)

Panel Discussion: How Smart can a Grid Be?
Janice Cheam (Energy Aware)
Mike Wrinch (Pulse Energy)
Dave Kaufman (Tantalus)

Participation is free. For registration details please visit:
http://people.scs.carleton.ca/~kranakis/conferences/ninet.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Massive 2011 - Call for Participation

The 3rd Workshop on Massive Data Algorithmics will be held on June 16,
2011 in Paris, France in connection with the ACM Symposium on
Computational Geometry.

>From the papers submitted to the workshop in response to the call for
papers (see below), the programme committee has selected 14 papers for
presentation at the workshop.  Please see the programme on the
workshop website at http://madalgo.au.dk/massive2011 .

Registration is possible through the workshop website at any time
before the workshop, but participants are encouraged to register on or
before *** May 30, 2011 *** (extended early registration deadline) for
a reduced fee.

See you in Paris.


-----------------------------------------------------------------
For reference: Call for Papers, Submission deadline April 27, 2011.
-------------------------------------------------------------------

Third Workshop on Massive Data Algorithmics
(MASSIVE 2011)

June 16, 2011
Paris, France

In connection with SoCG'11 and organized by
Center for Massive Data Algorithmics (MADALGO)

Webpage: http://www.madalgo.au.dk/massive2011


Aim and Scope

Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in
a spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly
data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means
that in general focus on algorithm efficiency is increasing. However,
the large size of the data, and/or the small size of many modern
computing devices, also means that issues such as memory hierarchy
architecture often play a crucial role in algorithm efficiency. Thus
the availability of massive data also means many new challenges for
algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a
forum for researchers from both academia and industry interested in
algorithms for massive dataset problems. The scope of the workshop
includes both fundamental algorithmic problems involving massive data,
as well as algorithms for more specialized problems in, e.g.,
graphics, databases, statistics and bioinformatics. Topics of interest
include, but are not limited to:

                     - I/O-efficient algorithms
                     - Cache-oblivious algorithms
                     - Memory hierarchy efficient algorithms
                     - Streaming algorithms
                     - Sublinear algorithms
                     - Parallel algorithms for massive data problem
                     - Engineering massive data algorithms

Paper submission

We invite submissions of extended abstracts (at most 10 pages not
counting references) of original research. Extended abstract should be
submitted through the EasyChair website by Wednesday April 27. Authors
will be notified about acceptance by Monday May 9, and final versions
will be due on May 30. Accepted extended abstracts will be collected
in a booklet, which will be distributed at the workshop. There will be
no formal proceedings, so work presented at the workshop can also be
(or have been) presented at other conferences. An author of each
accepted abstract is expected to give a presentation of the abstract
at the workshop.

Program committee

Pankaj Agarwal (Duke)
Lars Arge (Aarhus and MADALGO)
Mark de Berg (Eindhoven)
Guy E. Blelloch (CMU)
Gerth Stølting Brodal (Aarhus and MADALGO)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Research)
Erik Demaine (MIT and MADALGO)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT and MADALGO)
Riko Jacob (TU Munich)
Christian S. Jensen (Aarhus and MADALGO)
Ravi Kumar (Yahoo! Research)
Ian Munro (Waterloo)
S. Muthu Muthukrishnan (Google)
Mihai Patrascu (AT&T Research)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (KIT)
Suresh Venkatasubramanian (Utah)
Jeffrey Scott Vitter (Kansas)
Norbert Zeh (Dalhousie)

Chair: Ulrich Meyer (Frankfurt and MADALGO)

Organizing committee

Else Magård (Aarhus and MADALGO)
Gerth Stølting Brodal (Aarhus and MADALGO)
Lars Arge (Aarhus and MADALGO)
Ulrich Meyer (Frankfurt and MADALGO)

Important dates

Call for Papers: February 2011
Paper submission deadline: Wednesday April 27, 2011
Notification of acceptance: Monday May 9, 2011
Early registration deadline: May 16, 2011
Final version due: May 30, 2011
Symposium: June 16, 2011

Participation

The workshop will take place on June 16, 2011 in Paris, France,
immediately following the 27th Annual Symposium on Computational
Geometry (SoCG'11). The symposium is located at the venue of SoCG'11
at UICP in the Espace named Espace George Stephenson. Participants
should register through On-line registration site. Accomodation
information is available at the SoCG'11 venue website. All researchers
and industry people interested in massive data algorithmics are
encouraged to attend the workshop.
**********************************************************
*
* 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, May 19, 2011

[DMANET] Postdoctoral Position in Algorithmic Engineering at University of Warsaw

Postdoctoral Position in Algorithmic Engineering at University of Warsaw

A postdoctoral position in the area of algorithmic engineering is
available in the Department of Mathematics, Informatics and Mechanics
at University of Warsaw under the guidance of Prof. Piotr Sankowski.
Although algorithmic engineering is the main area of interest, all
candidates with strong qualifications in algorithmic research are
encouraged to apply and will be carefully considered.

Applicants should have a PhD degree or being close to completing it.
Knowledge of Polish language is not necessary, but a good knowledge of
English is required. Salary is competitive at the European level. The
position is supported by the PAAl project (ERC Starting Grant 259515 :
Practical Approximation Algorithms).

The goal of PAAl project is the development and study of practical
approximation algorithms. We will base our study on theoretical models
that can describe requirements for algorithms that make them
practically efficient. We plan to develop an efficient and useful
programming library of approximation algorithms. The project is
executed in cooperation with Prof. Stefano Leonardi from Sapienza
University of Rome. A more detailed information about the project can
be found at http://paal.mimuw.edu.pl.

Successful candidates can start after July 2011 (negotiable). Funding
is available for up to 4 years and different durations are possible.
Travel support is available for all research members and no teaching
duty is required.

Applications (including curriculum vitae, list of publications,
research plan, names of references with their e-mail addresses, and
intended period of stay) should be sent, by email if possible, by June
30, 2011 to:

Prof. Piotr Sankowski
Institute of Informatics
University of Warsaw
ul. Banacha 2
02-097 Warsaw
Poland

Email: sank@mimuw.edu.pl
**********************************************************
*
* 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] WAOA 2011 Second call for papers

9th Workshop on Approximation and Online Algorithms (WAOA 2011)
Saarbruecken, Germany
8-9 September 2011

CALL FOR PAPERS

SCOPE
-----

Approximation and online algorithms are fundamental tools to deal with
computationally hard problems and problems in which the input is gradually
disclosed over time. Both kinds of problems have a large number of
applications, arising from a variety of fields.

The workshop focuses on the design and analysis of approximation and
online algorithms. It also covers experimental methods used to design and
analyze efficient approximation and online algorithms. WAOA 2011 will be
part of ALGO 2011, which also hosts ESA, ATMOS, WABI, IPEC, and ALGOSENSORS.
ALGO 2011 will take place 5-9 September 2011 in Saarbruecken, Germany.

This year's WAOA invited speaker is Klaus Jansen from the University of
Kiel.

TOPICS
------

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

* algorithmic game theory
* approximation classes
* coloring and partitioning
* competitive analysis
* computational finance
* cuts and connectivity
* geometric problems
* graph algorithms
* inapproximability results
* mechanism design
* network design
* packing and covering
* paradigms for the design and analysis of approximation and online
algorithms
* parameterized complexity
* randomization techniques
* real-world applications
* scheduling problems

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

Proceedings will be published after the workshop takes place in the Springer
series Lecture Notes in Computer Science. Instructions for authors can be
found at http://www.springer.de/comp/lncs/authors.html.

Selected papers from the workshop will be published in a special issue of
Theory of Computing Systems.

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

Authors are invited to submit an extended abstract or full paper of at most
12 pages describing original unpublished research. Simultaneous submission
to other conferences with published proceedings is not permitted. The title
page of the submission should include the authors' full names, addresses,
e-mail addresses, and an abstract summarizing the results in roughly 100-200
words; the remainder of the submission should contain a description of the
main results and an explanation of their importance. The submission must
include a full proof of the results, part of which can be placed in the
appendix, whose length is not constrained.

Papers must be submitted electronically at

https://www.easychair.org/conferences/?conf=waoa2011

The submission must be received by 23:59 (GMT) on June 22, 2011. Each accepted
paper must be presented at the workshop by one of the authors.

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

Submissions: June 22, 2011.
Notifications: July 26, 2011.
Workshop: September 8-9, 2011.
Camera Ready: October 3, 2011.

PROGRAM CHAIRS
------- ------

* Pino Persiano, University of Salerno
* Roberto Solis-Oba, University of Western Ontario

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

* Vincenzo Auletta, University of Salerno
* Evripidis Bampis, University Pierre et Marie Curie
* Ioannis Caragiannis, University of Patras
* Jose Correa, University of Chile
* Khaled Elbassioni, Max Planck Institute for Informatics
* Rudolf Fleischer, Fudan University
* Thomas Erlebach, University of Leicester
* Klaus Jansen, University of Kiel
* Christos Kaklamanis, University of Patras
* Jochen Koenemann, University of Waterloo
* Alejandro Lopez-Ortiz, University of Waterloo
* Monaldo Mastrolilli, IDSIA
* Julian Mestre, University of Sydney
* Pino Persiano, University of Salerno
* Hadas Shachnai, Technion
* Roberto Solis-Oba, University of Western Ontario
* Clifford Stein, Columbia University
* Denis Trystram, Grenoble Institute of Technology
* Carmine Ventre, University of Liverpool

For more information please contact Pino Persiano (giuper@dia.unisa.it)
or Roberto Solis-Oba (solis@csd.uwo.ca), or check WAOA's web-site:

http://www.csd.uwo.ca/waoa/

For information about ALGO 2011, please check ALGO's website

https://algo2011.mpi-inf.mpg.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/
*
**********************************************************