Saturday, April 30, 2011

[DMANET] [FOMC 2011] Call for Participation

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

FOMC 2011 Call for Participation

The Seventh ACM SIGACT-SIGOPS International Workshop on
Foundations of Mobile Computing will be held at:

San Jose, California, USA
June 9, 2011,

as part of FCRC 2011.


Registration Site: http://www.regonline.com/2011fcrc
(early registration deadline: May 16)

Workshop Site: http://fomc2011.csc.liv.ac.uk/

Travel/Accommodation Details: http://www.acm.org/fcrc/

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

Accepted Papers:


M. Khabbazian, F. Kuhn, N. Lynch, M. Medard, A. Parandeh Gheibi. "MAC
Design for Analog Network Coding"

A. Sistla, O. Wolfson, B. Xu. "Answer-Pairs and Processing of
Continuous Nearest-Neighbor Queries"

L. Levin, M. Segal, H. Shpungin. "Energy Efficient Data Gathering in
Multi-Hop Hierarchical Wireless Ad Hoc Networks"

S. Holzer, Y. Pignolet, J. Smula, R. Wattenhofer. "Time-Optimal
Information Exchange on Multiple Channels"

H. Chung, P. Robinson, J. Welch. "Optimal Regional Consecutive Leader
Election in Mobile Ad-Hoc Networks"

M. Skjegstad, T. Maseng. "Low Complexity Set Reconciliation Using Bloom
Filters"

M. Damian, A. Kumbhar. "Undirected Connectivity of Sparse Yao Graphs"

I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P.
Spirakis. "Passively Mobile Communicating Machines that Use Restricted
Space"


=======================================================================
**********************************************************
*
* 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: 3rd ExtremeCom 2011

*****************************************************************************
Call for Papers and Demos for The 3rd Extreme Conference on
Communication - The Amazon Expedition (ExtremeCom 2011)

*****************************************************************************
Important dates
---------------
Conference dates: September 26-30, 2011
Field experience and network deployment: September 26-28
Technical sessions: September 29-30
Submission deadline: June 6, 2011
Notification of acceptance: July 1, 2011

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

The Extreme Conference on Communication (ExtremeCom) brings
together researchers and practitioners in areas related to delay
tolerant networks and other networking paradigms for rural and remote
areas, in order to gain experience and insight into the challenges
that such environments pose for the network and the users.

Following on from the success of ExtremeCom 2009 - The Midnight Sun
Expedition in Laponia, Sweden, and ExtremeCom 2010 - The Himalayan
Expedition in Dharamsala, India, we now offer ExtremeCom 2011 - The
Amazon Expedition. In this edition, we aim to explore the challenges
of the deep Amazon Rainforest in Brazil. The chosen spot, which is
located 21 miles (34 km) from Manaus, is known as Praia do Tupé (Tupé
beach), a beautiful and remote beach accessed only by boat through the
waters of the Black River. The population is composed by natives
living in little communities spread around the jungle and also on the
river shore. These people experience constant communication
interruptions and most of them do not have any access to the Internet,
which makes this area a great field of experiments to DTN systems.

Hosted by Federal University Of Amazonas (UFAM) the conference will
start with 3 days of immersion into the jungle where the conference
participants will aid in setting up and deploying an extension of a
DTN system in this area in order to provide connectivity to a new
community. During this time the participants will have the chance to
hike around the trails, interact with the locals and also know some
natural phenomenons like the "meeting of the waters", where the black
waters of the Negro River meet the brown waters of the Solimões River,
flowing side by side without mixing for about 9 km.

The immersion will not only give a better idea of both the technical
and user requirements of such a system, but it will also give many
opportunities for informal research discussions between the
participants. Participants that have their own software for scenarios
like this will also, to as great an extent as possible, be encouraged
to test and demonstrate it within this environment.

Upon reaching the end of the "field experience", there will be two
days of paper presentations and demos in a more traditional conference
venue at UFAM's facilities in Manaus. Focus will still be on informal
research discussions, with the hope that the field experience will
give participants the ability to discuss the topics in a new light.

Participants should submit 6 page papers about ideas and visions about
the topics of the conference or demo proposals to be shown during the
conference. Visionary and thought-provoking papers that are likely to
generate much discussion during the conference are especially
solicited. The aim of the conference is to maintain an informal
environment, where new research ideas can be discussed and
developed. We also hope to have a demo session where participants
can show their implementations and systems. If you want to show a demo,
please submit a 2 page demo proposal using the same submission system
as for conference papers.

Topics for the conference include, but are not limited to:
* Testbeds for large-scale sustainable testing of DTN systems
* Real deployments of networks in extreme environments
* Business and service models for networks in rural, remote, and other
challenging environments
* User experience research
* Delay tolerant networking
* Low-power and intermittent-power protocols
* Mechanisms for emergency and urgent communications
* Networked applications and services

Due to logistics and the need to conduct the conference in harmony with
the local population and the environment, the number of participants
will be limited. Priority will be given to authors of papers and those
who register first.


Organizers
----------
General co-chairs:
Anders Lindgren, Swedish Institute of Computer Science, Sweden
Pan Hui, Deutsche Telekom Laboratories and TU Berlin, Germany

Local arrangement committee:
Edjair Mota, UFAM, Brazil
JB Pinto Neto, UFAM, Brazil
Alfredo Goldman, University of Sao Paolo, Brazil
Aline Carneiro Viana, INRIA, France

Publicity chair:
TBC

Sponsorship chair:
TBC

Publication chair:
TBC

Web chair:
Fehmi Ben Abdesslem, University of St. Andrews, UK


Technical Program Committee:
TBC

Steering Committee:
Jon Crowcroft, University of Cambridge, UK
Avri Doria, Luleå University of Technology, Sweden
Tristan Henderson, University of St. Andrews, UK
Pan Hui, Deutsche Telekom Laboratories and TU Berlin, Germany
Anders Lindgren, Swedish Institute of Computer Science, Sweden
*****************************************************************************

**********************************************************
*
* 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: Extended Deadline: May 10, 2011 - ICALP2011GT - Workshop on Algorithms and Data Structures for Selection, Identification and Encoding

-------------------------------------------
EXTENDED PAPER SUBMISSION DEADLINE: May 10, 2011
----------------------------------------------------------
SELECTED PAPERS WILL BE INVITED FOR A SPECIAL ISSUE OF ALGORITHMICA
----------------------------------------------------------

CALL FOR PAPERS
ICALP 2011 Workshop on

ALGORITHMS AND DATA STRUCTURES FOR SELECTION,
IDENTIFICATION AND ENCODING
Group testing, compressed sensing, multi access communication and more.

July, 3, 2011, Zurich (Switzerland)
https://sites.google.com/site/icalp2011gt/


SCOPE:
The workshop aims at bringing together researchers to exchange ideas and results related to the
theoretical and practical aspects of group testing, compressed sensing, and combinatorial
identification in a broad sense.

Papers presenting use of group testing and selection primitives in pattern matching, data
structures for static membership, communication protocols, cryptographic protocols, streaming
computation, bioinformatics and computational biology, compressed sensing, as well as papers
focussing on theoretical aspects of combinatorial structures for identification and coding, like
randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are
welcome.

All the above topics are open to both research and industry contributions. Papers reporting on
original research unpublished elsewhere as well as surveys of important results, especially recent
ones, are invited.

SUBMISSIONS:
Authors should send an extended abstract of at most 15 pages via the online submission system
(easy chair) at
https://www.easychair.org/account/signin.cgi?conf=icalp2011gt

Since there are no official proceedings, simultaneous submission to other conferences are possible.
Accepted papers are expected to be presented at the workshop.

PROCEEDINGS and SPECIAL ISSUE:
A selection of the papers accepted for presentation at the workshop will be invited for a special
issue of Algorithmica. There are no official proceedings. A booklet with the extended abstracts of
the papers presented at the conference will be distributed to the participants.

IMPORTANT DATES:
* Paper submission due (extended): May 10, 2011
* Notification of acceptance: May 31, 2011
* Camera-ready copy: June 15, 2011

ORGANIZING COMMITTEE:
Ferdinando Cicalese, University of Salerno, Italy
Ely Porat, Bar Ilan University, Israel

PROGRAM COMMITTE:
Ferdinando Cicalese - University of Salerno, Italy (co-chair)
Charles J. Colbourn - Arizona State University, USA
Peter Damaschke - Chalmers University, Sweden
Avinatan Hassidim - Google inc.
Sampath Kannan - University of Pennsylvania, USA
Hung Q. Ngo - University at Buffalo, The State University of New York
Ely Porat - Bar Ilan University, Israel (co-chair)
Atri Rudra - University at Buffalo, The State University of New York, USA
Miklós Ruszinkó - MTA SZTAKI, Hungary
Milan Ružić - ITU, Denmark
Noam Shental - Open University of Israel, Israel
Martin J. Strauss - University of Michigan, USA
Ugo Vaccaro - University of Salerno, Italy

CONTACT INFORMATION:
For any further information regarding the workshop, please contact the organizers:
Ferdinando Cicalese, cicalese@dia.unisa.it
Ely Porat, porately@gmail.com

SPONSORS:
Department of Computer Science, University of Salerno, Italy
Department of Computer Science, Bar Ilan University, Israel

[DMANET] Call For Papers: Extended Deadline: May 10, 2011 - ICALP2011GT - Workshop on Algorithms and Data Structures for Selection, Identification and Encoding

--------------------------------------------------------------------------------------------------------------------
EXTENDED PAPER SUBMISSION DEADLINE: May 10, 2011
--------------------------------------------------------------------------------------------------------------------
SELECTED PAPERS WILL BE INVITED FOR A SPECIAL ISSUE OF ALGORITHMICA
--------------------------------------------------------------------------------------------------------------------

CALL FOR PAPERS
ICALP 2011 Workshop on

ALGORITHMS AND DATA STRUCTURES FOR SELECTION,
IDENTIFICATION AND ENCODING
Group testing, compressed sensing, multi access communication and more.

July, 3, 2011, Zurich (Switzerland)
https://sites.google.com/site/icalp2011gt/


SCOPE:
The workshop aims at bringing together researchers to exchange ideas and results related to the theoretical and practical aspects of group testing, compressed sensing, and combinatorial identification in a broad sense.

Papers presenting use of group testing and selection primitives in pattern matching, data structures for static membership, communication protocols, cryptographic protocols, streaming computation, bioinformatics and computational biology, compressed sensing, as well as papers focussing on theoretical aspects of combinatorial structures for identification and coding, like randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are welcome.

All the above topics are open to both research and industry contributions. Papers reporting on original research unpublished elsewhere as well as surveys of important results, especially recent ones, are invited.

SUBMISSIONS:
Authors should send an extended abstract of at most 15 pages via the online submission system (easy chair) at
https://www.easychair.org/account/signin.cgi?conf=icalp2011gt

Since there are no official proceedings, simultaneous submission to other conferences are possible. Accepted papers are expected to be presented at the workshop.

PROCEEDINGS and SPECIAL ISSUE:
A selection of the papers accepted for presentation at the workshop will be invited for a special issue of Algorithmica. There are no official proceedings. A booklet with the extended abstracts of the papers presented at the conference will be distributed to the participants.

IMPORTANT DATES:
* Paper submission due (extended): May 10, 2011
* Notification of acceptance: May 31, 2011
* Camera-ready copy: June 15, 2011

ORGANIZING COMMITTEE:
Ferdinando Cicalese, University of Salerno, Italy
Ely Porat, Bar Ilan University, Israel

PROGRAM COMMITTE:
Ferdinando Cicalese - University of Salerno, Italy (co-chair)
Charles J. Colbourn - Arizona State University, USA
Peter Damaschke - Chalmers University, Sweden
Avinatan Hassidim - Google inc.
Sampath Kannan - University of Pennsylvania, USA
Hung Q. Ngo - University at Buffalo, The State University of New York
Ely Porat - Bar Ilan University, Israel (co-chair)
Atri Rudra - University at Buffalo, The State University of New York, USA
Miklós Ruszinkó - MTA SZTAKI, Hungary
Milan Ružić - ITU, Denmark
Noam Shental - Open University of Israel, Israel
Martin J. Strauss - University of Michigan, USA
Ugo Vaccaro - University of Salerno, Italy

CONTACT INFORMATION:
For any further information regarding the workshop, please contact the organizers:
Ferdinando Cicalese, cicalese@dia.unisa.it
Ely Porat, porately@gmail.com

SPONSORS:
Department of Computer Science, University of Salerno, Italy
Department of Computer Science, Bar Ilan University, Israel
**********************************************************
*
* 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] Late April 2011 ICIAM 2011 news

With less than 90 days until the 7th International Congress on
Industrial and Applied Mathematics - ICIAM 2011 (Vancouver, July 18 -
22, 2011; www.iciam2011.com), if you haven't already registered, we
encourage you to do so now ! Discounted advance online registration is
open until June 15 at this website: http://bit.ly/gPYJTN .

Are you wondering what to expect at ICIAM 2011? Here are a several
highlights:

Over 20 thematic minisymposia, each with a Lead Lecture followed by six
session speakers, cover a wide range of subjects ranging from molecular
simulation to materials science.

John Bell (Lawrence Berkeley National Laboratory, USA) will highlight
the Scientific Computing panel with his talk, Low Mach Number Models in
Computational Astrophysics (details here: http://bit.ly/iX6J89), which
will demonstrate the role of low Mach number flows in various
astrophysical problems ranging from X-ray bursts to convection in
massive stars.

The Mathematical Biology theme will showcase intriguing topics that run
the gamut from the neuromechanics of insect movement to the synchronized
reproduction of trees in forests. Mark Lewis (University of Alberta,
Canada) will describe the role of parabolic PDEs and integral
formulations in tracking wave fronts of expanding populations in his
talk, New Challenges in Modelling Biological Invasions (details here:
http://bit.ly/mNhe6l) .

In the invited lecture, Our "Second Brain": Modelling Its Development
and Disease (details here: http://bit.ly/mNqZa4), Kerry Landman
(University of Melbourne, Australia) will elucidate on insights provided
by continuum and discrete modeling to the embryonic development of our
enteric nervous system and conditions that result in the failure of this
normal process.

The thematic minisymposium on Mathematics of Cancer (details here:
http://bit.ly/iiTcY5), organized by Mark Chaplain (University of Dundee,
United Kingdom), will detail multiscale mathematical models describing
important processes in the growth and spread of cancer, in addition to
implications for treatments and therapies.

The two panels on Mathematical Programming and Industrial Applications
will describe modelling approaches for mathematical programs. Michael
Ferris (University of Wisconsin, USA) will analyze existing
relationships that make up mathematical models in order to create an
extended mathematical program in Extended Mathematical Programming:
Competition and Stochasticity (details here: http://bit.ly/kd43ad).
Complexity-based techniques developed for convex optimization in the
context of very large scale problems will be discussed in the invited
lecture, Complexity Based Methods for Convex Optimization (details here:
http://bit.ly/luuDRb) by Clovis Gonzaga (Universidade Federal de Santa
Catarina, Brazil).

In the panel on Risk, Alexander McNeil (Heriot-Watt University, United
Kingdom) will tackle the very timely subject of financial regulation
through his talk, Modelling Capital Adequacy and Solvency (details here:
http://bit.ly/iPg7cT). McNeill will discuss risk models for interest
rates, equities, credit and other risk factors.

For those interested in the subject, the industrial thematic
minisyposium on Risk and Finance (details here: http://bit.ly/e4Opbe)
organized by Rama Cont (Centre National de la Recherche Scientifique,
France) should also be of value.

Look up the full program (click here: http://bit.ly/gWWrGk) to browse a
complete list of topics for thematic minisymposia
(http://bit.ly/cBHdGk). We will be sampling the program over the next
few issues to illustrate some of the other areas that will be covered.

You can also search for speakers via the speaker index
(http://bit.ly/kK91d5), and browse sessions by topic area
(http://bit.ly/gWWrGk).

Official ICIAM hotels (http://bit.ly/dVzb32) are booking quickly. To
avoid disappointment, we suggest you secure your reservation soon.

We look forward to seeing you at ICIAM 2011!

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

Friday, April 29, 2011

[Mycolleagues] Open PhD position at Technology University of Troyes

Description:

The wireless sensor networks are becoming a key technology for civilian, industrial, military and medical applications. While sensor devices are not a novelty (already exist in various control processes), their new wireless transmission capability makes them easier to deploy. Today, the main challenge in wireless sensor network is still the control of energy consumption. In this context, we are proposing this PhD subject entitled “wireless sensor network lifetime optimization”.

Most of the existing researches assume full covered monitored area and full connectivity between wireless sensor nodes. In this project, these constraints will be released in order to find a tradeoff between maximizing the network lifetime and a minimum coverage specific to the target application. This approach is mainly motivated by the lack of uniformity in real detection model. Moreover, wireless sensor nodes can be mobile (in vehicular networks for example) which makes it harder to provide full coverage.

 

Location: UMR 6279 STMR, ICD/ERA team, Technology University of Troyes.

 

Requirements for application: Master degree or engineering in computer sciences.

 

Send detailed CV, BS and MS results and motivation letter to moez.esseghir@utt.fr and leila.merghem_boulahia@utt.fr.

 

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

Moez Esseghir

Maître de Conférences/ Associate Professor

https://sites.google.com/site/esseghirmoez/

Technology University of Troyes

12 Marie Curie Street, Troyes 10010 Cedex, France

Tel : +33 (0)3 25759714

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

 

Thursday, April 28, 2011

Final call for contributions: CALCO-Jnr 2011: CALCO Young Researchers Workshop (Winchester, UK)

!!! Please forward to PhD students and young researchers !!!

===============================================================
FINAL CALL FOR CONTRIBUTIONS: CALCO-Jnr 2011

CALCO Young Researchers Workshop

August 29, 2011, Winchester, UK

part of
4th Conference on Algebra and Coalgebra in Computer Science
August 29-September 2, 2011, Winchester, UK
===============================================================
Abstract submission: May 8, 2011
Author notification: May 30, 2011
Final abstract due: June 30, 2011
Full paper submission: September 30, 2011
===============================================================
http://calco2011.ecs.soton.ac.uk/
===============================================================

CALCO 2011 will be preceded by the CALCO Young Researchers Workshop,
CALCO-Jnr, dedicated to presentations by PhD students and by those who
completed their doctoral studies within the past few years.

CALCO aims to bring together researchers and practitioners with
interests
in foundational aspects, and both traditional and emerging uses of
algebras
and coalgebras in computer science. The study of algebra and coalgebra
relates to the data, process and structural aspects of software systems.
This is a high-level, bi-annual conference formed by joining the forces
and reputations of CMCS (the International Workshop on Coalgebraic
Methods
in Computer Science), and WADT (the Workshop on Algebraic Development
Techniques). Previous CALCO editions took place in Swansea (Wales,
2005),
Bergen (Norway, 2007) and Udine (Italy, 2009). The fourth edition will
be
held in the city of Winchester (England), a historic cathedral city
and the
ancient capital of Wessex and the Kingdom of England.

The CALCO Young Researchers Workshop, CALCO-Jnr, is a CALCO satellite
workshop dedicated to presentations by PhD students and young
researchers.
Attendance at the workshop is open to all - it is anticipated that many
CALCO conference participants will want to attend the CALCO-Jnr workshop
(and vice versa).


Topics of Interest
-----------------------
The CALCO Young Researchers Workshop invites submissions on the same
topics as the CALCO conference: reporting results of theoretical work on
the mathematics of algebras and coalgebras, the way these results can
support methods and techniques for software development, as well as
experience with the transfer of the resulting technologies into
industrial
practice. In particular, the workshop encourages submissions related
to the topics listed below.

* 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
----------------
CALCO-Jnr presentations will be selected according to originality,
significance, and general interest, on the basis of submitted 2-page
abstracts. A booklet with the abstracts of the accepted presentations
will be available at the workshop.

Submissions are handled via the following link:
https://www.easychair.org/conferences/?conf=calcojnr2011.
The use of LNCS style (see http://www.springer.de/compo/lncs/authors.html)
is strongly encouraged.

After the workshop, the author(s) of each presentation will be invited
to
submit a full 10-15 page paper on the same topic. They will also be
asked
to write (anonymous) reviews of papers submitted by other authors on
related topics. Additional reviewing and the final selection of papers
will be carried out by the CALCO-Jnr PC.

The volume of selected papers from the workshop will be published as a
technical report of the University of Southampton. Authors will retain
copyright, and are also encouraged to disseminate the results reported
at
CALCO-Jnr by subsequent publication elsewhere.


Important Dates
----------------------
May 8, 2011 Deadline for 2-page abstract submission
May 30, 2011 Notification of abstract selection decision
June 30, 2011 Final version of abstract due
August 29, 2011 CALCO-Jnr, CALCO Young Researchers Workshop
August 30
-September 2, 2011 CALCO technical programme

September 30, 2011 Deadline for 10-15 page paper submission
November 15, 2011 Notification of paper selection decision
November 30, 2011 Final version of paper due


Programme Committee
--------------------------------
* Corina Cirstea, University of Southampton, UK
http://www.ecs.soton.ac.uk/people/cc2
* Magne Haveraaen, University of Bergen, NO
http://www.ii.uib.no/~magne/
* John Power, University of Bath, UK
http://www.bath.ac.uk/comp-sci/people/contact/index.php?contact=Dr_John_Power
* Monika Seisenberger (chair), Swansea University, UK
http://www.cs.swan.ac.uk/~csmona/
* Toby Wilkinson, University of Southampton, UK
http://www.ecs.soton.ac.uk/people/stw08r


Posters
------------
* Low quality (for online viewing)
http://calco2011.ecs.soton.ac.uk/workshops/calcojnr.jpg
* High quality (for printing)
http://calco2011.ecs.soton.ac.uk/workshops/calcojnr.pdf


---
CALCO-Jnr 2011: http://calco2011.ecs.soton.ac.uk/workshops/calco-jnr.html
CALCO 2011: http://calco2011.ecs.soton.ac.uk/

[Mycolleagues] Call for Papers: ICDCN 2012

      **** Call for Papers: ICDCN 2012 ****
(13th International Conference on Distributed Computing and Networking)
   Hong Kong, January 3-6, 2012
   http://icdcn2012.comp.polyu.edu.hk/
 
*************Important Dates *******************
    Submission Deadline : July 8, 2011
    Notification : September 15, 2011
    Camera-Ready : October 13, 2011
****************************************************
 
ICDCN (the International Conference on Distributed Computing and Networking) is a  premier international conference dedicated to addressing advances in Distributed Computing and Communication Networks. As in the past, ICDCN 2012 will be organized in two tracks: Distributed Computing and Networking, and will comprise a highly selective technical program consisting of refereed submitted papers, panel discussions as well as focused workshops on emerging topics. 
 
Papers describing original research work and practical experiences/experimental results are
solicited on topics including, but not limited to: 
  DISTRIBUTED COMPUTING
* Distributed algorithms & concurrent data structures: design, analysis, and complexity
* Distributed operating systems
* Distributed database systems
* Embedded distributed systems
* Experiments and performance evaluation of distributed systems
* Fault-tolerance, reliability, and availability
* Multiprocessor & multi-core architectures & algorithms
* Self-organization, self-stabilization, & autonomic computing
* High performance computing, grid computing, & cloud computing
* Security, cryptography, & game theory in distributed systems
 
  NETWORKING
* Integration of heterogeneous wireless & wired networks
* Internetworking protocols & Internet applications
* Mobile and pervasive computing, context-aware distributed systems
* Next generation & converged network architectures
* Overlay & peer-to-peer networks and services
* Home Networking & Services
* Resource management & quality of service
* Network security & privacy
* Energy-Efficient Networking & Smart Grids
* Sensor, PAN & ad-hoc networks
* Traffic engineering, pricing, network management
 
ICDCN 2012 is soliciting submissions as either regular or short (concise contribution) papers. Regular papers will be allowed a maximum of 15 pages, while short papers will be permitted a maximum of 5 pages. All papers must use at least 10-point Times Roman font and be formatted as per the "LNCS style"-links to templates for Latex and MS-Word will be available from the Submissions Webpage http://icdcn2012.comp.polyu.edu.hk/submissions.html. Accepted submissions will be published by Springer in the LNCS series.
At least one author of each accepted paper must register for the conference and present the paper.  Papers should be submitted via the EasyChair submission management system (http://www.easychair.org/conferences/?conf=icdcn2012).

For any questions about the suitability of your paper submission, please contact the TPC Chairs.Details of the Organizing & Technical Program Committees are available at: http://icdcn2012.comp.polyu.edu.hk/

TPC Chairs:
Distributed Computing: Ajoy K. Datta , University of Nevada Las Vegas, USA (ajoykdatta@gmail.com)
Networking:  Archan Misra, Singapore Management University, Singapore (archanm@smu.edu.sg)

General Co-Chairs
Roger Wattenhofer, ETH Zurich, Switzerland
Jiannong Cao, Hong Kong Polytechnic University
----------------------------------------------------------------------------

[DMANET] SLS 2011, Call for Papers

Engineering Stochastic Local Search Algorithms
---
Designing, Implementing and Analyzing Effective Heuristics

SLS 2011

15-17 September 2011, Brussels, Belgium

More details and up-to-date information at
iridia.ulb.ac.be/sls2011


The Workshop
===========


This is the third edition of the SLS Algorithms Engineering
workshop. As in previous editions, the main goal of SLS 2011 is to
provide a forum for the discussion of methodological issues that arise
in the design, implementation, tuning and experimental
evaluation of effective heuristic algorithms. SLS 2011 welcomes high
quality contributions that focus on such issues and that cover any
type of stochastic local search methods.

The 2011 edition of SLS will include 6 to 8 invited talks
by leading experts in the field on topics of special relevance to
engineering SLS algorithms. In addition to these invited talks, high
quality
contributions will be presented orally and in poster sessions;
a doctoral symposium will also be organized in conjunction with the
main workshop.
Pending final confirmation from Springer, the workshop post-
proceedings will be
published in the Lecture Notes in Computer Science (LNCS) series.

Relevant Research Areas
========================

In recent years, it has become evident that the development of
effective SLS algorithms is a highly complex engineering process that
typically combines aspects of algorithm design and implementation with
empirical analysis and problem-specific background knowledge. This
development process needs to be assisted by a sound methodology that
adresses the issues arising in the phases of algorithm design,
implementation, tuning and experimental evaluation. In addition, more
research is required to understand which SLS techniques are best
suited for particular problem types and to better understand the
relationship between algorithm components, parameter settings, problem
characteristics and performance.

Hence, the aim of this workshop is to stress the importance of an
integration of relevant aspects of SLS research into a more coherent
engineering methodology and to bring together researchers that work in
various fields, including computing science, operations research,
metaheuristics, algorithmics, statistics and application areas.

SLS 2011 solicits contributions dealing with any aspect of engineering
stochastic local search algorithms. Typical, but not exclusive, topics
of interest are:

+ Methodological developments for the implementation of SLS
algorithms (engineering procedures, integration of tools in the
SLS engineering process, ...)

+ Tools for the assistance in the development process of SLS
algorithms (software libraries, automatic and semi-automatic
tuning procedures, learning techniques, ...).

+ Case studies in the principled development of well designed
SLS algorithms for practically relevant problems.

+ New algorithmic developments (usage of AI/OR techniques, large
scale neighbourhood searches, new SLS methods, data structures,
distributed algorithms, ...)

+ Aspects that become relevant when moving from "classical"
NP-hard problems to those including multiple objectives,
stochastic information or dynamically changing data.

+ In-depth experimental studies of SLS algorithms (behavior of SLS
algorithms, comparison of SLS algorithms, ...), problem
characteristics (search space analysis, ...) and their
impact on algorithm performance.

+ Theoretical analysis of SLS behaviour and their impact
on algorithm design (analysis of operators, dynamic behaviour
of SLS algorithms, ...)

Submission Details
====================

Contributions are requested in two main forms.

C1) Original research contributions for publication in the
post-conference proceedings of at most 15 pages in LNCS format.

C2) High-quality manuscripts on topics directly relevant to the
workshop that have been published or accepted for journal
publication within the last two years. High-quality conference
publications
can also be considered, in consultation with the program chairs.
Contributions in this category are for oral or poster presentation
only.

All submissions will appear in informal proceedings, to be distributed
at the conference.

Accepted papers of category C1 will be published in the post-workshop
proceedings. Some papers may be accepted for the post-proceedings
conditional to appropriate improvements of the originally submitted
manuscript.

The post-workshop proceedings will be published in Springer's Lecture
Notes in Computer Science (LNCS) series (confirmation pending).

Submissions to the doctoral symposium will be handled separately and
will be published
in the IRIDIA technical report series.

Further Information
====================

Up-to-date information will be published on the web site
iridia.ulb.ac.be/sls2011. For information about local arrangements,
registration etc., please refer to this web site or contact the local
organizers at the address below.

Workshop Address
================

SLS 2011
IRIDIA, CP 194/6 Tel +32-2-6502729
Université Libre de Bruxelles Fax +32-2-6502715
Av. F. D. Roosevelt 50 iridia.ulb.ac.be/sls2011
1050 Bruxelles, Belgium email: sls@iridia.ulb.ac.be

Workshop Location
=================

Université Libre de Bruxelles, Brussels, Belgium.

Important Dates
===============

Submission deadline 1 June 2011
Notification of acceptance 15 July 2011
Workshop 15-17 September 2011
Post-workshop proceedings 31 October 2011

SLS 2011 Workshop Committee
============================

General Chairs

Thomas Stuetzle, IRIDIA, CoDE, ULB, Brussels, Belgium
Mauro Birattari, IRIDIA, CoDE, ULB, Brussels, Belgium
Holger H. Hoos, CS Department, UBC, Vancouver, Canada

Organization Chair

Franco Mascia
**********************************************************
*
* 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. position in Personnel Rostering (Zdenek Hanzalek)

A PhD. position (4 years) is available at the Department of Control
Engineering, CTU Prague, Czech Republic.

Expected to start in September 2011

Topic: Personnel Rostering with on-line varying workforce demand function

Co-supervisors: Zdenek Hanzalek and Premysl Sucha

The goal of the personnel scheduling problem is to assign a set of the
required shifts to a set of employees while respecting given constraints.
The objective is to maximize the employee satisfaction and to minimize labor
costs. Even the problems with few constraints and very simple objective
function are NP-hard. However, with the use of combinatorial optimization
algorithms we are able to solve very complex problems to replace
time-consuming manual design of the schedule.

We deal with a problem motivated by the transport services (e.g. airport
companies), where the set of shifts can be quite large. This is caused by
the demand function, determining the minimal number of employees required
each hour. The function reflects the fluctuation of the workforce demand
during the day, caused by the traffic peaks and differs per day of the week
and per seasons of the year. Moreover, in some cases, the workforce demand
is on-line varying depending e.g. on whether or on the volume of required
services. The goal of the thesis is to find appropriate methods for shift
planning and personnel scheduling in this area, to develop efficient
algorithms, to evaluate them on benchmarks and to publish original results
in peer-reviewed conferences and journals.

The candidate should have a master degree in computer science or related
field, good mathematical skills, background in optimization algorithms and
experience in programming.

A cover letter and CV should be sent to hanzalek@fel.cvut.cz before 30th May
2011.

--

Zdenek Hanzalek

Department of Control Engineering, Faculty of Electrical Engineering,

Czech Technical University in Prague, Karlovo namesti 13, 121 35 Prague 2,

Czech Republic

tel: +420 224355708 hanzalek@fel.cvut.cz

fax: +420 224355703 http://dce.fel.cvut.cz/hanzalek
**********************************************************
*
* 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 Foa Papers - IEEE ICPADS 2011 (Tainan, Taiwan, December 07-09, 2011)

================ ============================================
Call for Papers
The 17th IEEE International Conference on Parallel and Distributed Systems
(ICPADS 2011)
http://conf.ncku.edu.tw/icpads/index.htm
Tainan, Taiwan, December 07-09, 2011
============================================================

IMPORTANT DATES
======================================
Workshop Proposal Due: June 10, 2011
Paper Submission Deadline: June 24, 2011:
Paper Acceptance Notification: September 5, 2011
Camera-ready Version Due: October 7, 2011
Author Registration: October 14, 2011

Established in 1992, ICPADS has been a major international forum in the parallel and distributed systems area. ICPADS 2011 will be held in
Tainan, Taiwan in December 2011. Tainan is a wonderful historic city in Taiwan that has many places to visit. The conference provides an
international forum for scientists, engineers and users to exchange and share their experiences, new ideas, and latest research results on all
aspects of parallel and distributed systems. All accepted papers will be included in the Proceedings of ICPADS 2011 that will be published
by the IEEE Computer Society Press.

Topics of interest include, but are not limited to:

 Parallel and Distributed Applications and Algorithms
 Cloud OS, Middleware, Toolkits, and Applications
 Data Intensive Computing and Data Centre Architecture
 Web-Based Computing and Service-Oriented Architecture
 Multi-core and Multithreaded Architectures
 Virtualization Techniques
 Resource Provision, Monitoring, and Scheduling
 Security and Privacy
 Cluster and Grid Computing
 Power-Aware and Green Computing
 Internet of Things
 Peer-to-Peer Computing
 Wireless and Mobile Computing
 Ad Hoc and Sensor Networks
 Performance Modeling and Evaluation
 Communication and Networking Systems
 Dependable and Trustworthy Computing and Systems
 Real-Time and Multimedia Systems
 High Performance Computational Biology and Bioinformatics
 Cyber-Physical Systems

=====================
Submission Information
=====================
Submissions should include abstract, 5-10 keywords, and the e-mail address of the corresponding author and be in PDF format. Each submission must not
exceed 8 pages in the IEEE 8.5'' x 11'' two-column format with 10-12 point font, including tables and figures.

ICPADS 2011 submission web site is in following URL:
http://conference.iis.sinica.edu.tw/Conference-Submission/servlet/Member/PersonManipulation?FunctionName=SubmissionStatus&PageAction=submitPaper&actionConference=78

==============================
Information for Workshop Organizer
==============================

ICPADS 2011 will accommodate full-day workshops. These workshops will enable timely important issues to be explored in depth. A workshop proposal should include
organizer's contact information, the workshop title, rationale, coverage, how workshop papers will be evaluated, and experience of past workshops on the same or closely
related subjects. Plans for journal publication of selected papers are encouraged.



To unsubscribe, please click the following link
http://grid.chu.edu.tw/unsubscribe.php?mail=theorynt@listserv.nodak.edu

For other questions, please send email to cfp-admin@grid.chu.edu.tw

call for abstracts: Doctoral Symposium at FCT 2011

I am sorry if you receive this announcement through several means.
Please forward this call for abstracts and presentations to interested
students in your group or department.
---------------------------------------------------------------------
Call for Abstracts

Doctoral Symposium

affiliated with
the 18th International Symposium on Fundamentals of Computation Theory

Oslo, NORWAY
August 26, 2011
web:
http://fct11.ifi.uio.no/index.php?n=Workshops.DoctoralSymposium

-----
Description of the Event
-----
The aim of the Doctoral Symposium @ FCT'11 is to provide a platform
for PhD students and young researchers who recently completed their
doctoral studies, to present new results related to the foundations of
computing theory and receive feedback on their research. Excellent
master students working in theoretical fields of CS are also
encouraged to contribute. Moreover, the DS wants to offer students the
opportunity to attend talks in the main conference and to interact
with established researchers in their fields. It is warmly encouraged
that FCT participants attend the DS also.

A non-exhaustive list of topics of interest is available at the FCT
home.
http://fct11.ifi.uio.no

The acceptance of the presentations is based on a two page abstract
(incl. references). The accepted abstracts will be available at the
workshop and published together in a technical report by the
University of Oslo. It is allowed (and encouraged) to send results
that have been published at other conferences or journals or that are
work in progress. Acceptance is conditioned on one of the student
authors holding a 15-25 min (exact time slot to be decided later)
presentation in the doctoral symposium.

Student reductions of participation fees and scholarships are planned;
see the registration page for updates.


-----
Important Dates
-----
Submission Deadline: Sunday, 12. June 2011
Author Notification: Sunday, 26. June 2011
Camera ready abstract: Friday 1. July 2011
DS day: Friday 26. August 2011
FCT days: 22 - 25. August 2011


-----
Submissions
-----
Authors are encouraged to submit a 2 page extended abstract prepared
according to Springer's guidelines for the LNCS series, preferably
using LaTeX with the llncs document class. Please do not modify font
size, spacing, margins, etc of the llncs document class. The abstracts
should be authored by young researchers (i.e., PhD students, excellent
master students, or researchers that defended their PhD in 2010). If a
senior researcher (like supervisor) must be listed as author, her/his
contribution to the present abstract should be minimal and should be
backed by a letter sent by her/him via e-mail to the organizers of the
doctoral symposium stating this fact.

Please submit your paper as a PDF file using the EasyChair system at
the link below (the page will be opened for submissions on 1st June):

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


-----
Submission Guidelines
-----
Do NOT use runningheaders (i.e., your documentclass declaration could
look like this: \documentclass[10pt]{llncs}).

The submitted abstracts are encouraged to follow an outline like:

1. Problem Description and Motivation: Describe the research
problem you are addressing and motivate why this is relevant for FCT
community.
2. Brief Overview of Related Work: Briefly argument that this
problem and your work has not been done by others before. Possibly
discuss the gaps in the current related research literature.
3. Proposed Solution: Give a high-level overview of your proposed
solution to the problem identified in part 1. Describe any hypotheses
that you have formulated. Describe the research method you are using
or plan to use.


-----
Program Committee
-----
Sergiu Bursuc (U. of Birmingham, UK)
Andrea Corradini (U. of Pisa, Italy)
Clemens Grabmayer (Utrecht University, Netherlands)
Magne Haveraaen (U. of Bergen, Norway)
Martin Leucker (T.U. Munchen, Germany)
Andrzej Lingas (Lund University, Sweden)
Daniel Lokshtanov (U. of California, USA)
Cristian Prisacariu (U. of Oslo, Norway)
Gerardo Schneider (U. of Gothenburg, Sweden)
Alexandra Silva (CWI, The Netherlands)
Tomoyuki Suzuki (U. of Leicester, UK)
Edsko de Vries (Trinity College, Ireland)


-----
For further advertising one may use this .txt CFP, downloadable at
http://fct11.ifi.uio.no/documents/cfp_DS_FCT11.txt
or the .pdf posters
http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A4.pdf (A4 format)
http://fct11.ifi.uio.no/documents/poster_DS_FCT11_A3.pdf (A3 format)
-----

Wednesday, April 27, 2011

[DMANET] ISAAC 2011 2nd CFP

2nd Call for papers


The 22nd International Symposium on Algorithms and Computation

ISAAC 2011

Yokohama, Japan
December 5-8, 2011.
http://www.is.titech.ac.jp/isaac11/


The 22nd International Symposium on Algorithms and Computation (ISAAC
2011) will be held in Yokohama, Japan, December 5-8, 2011. The
symposium is intended to provide a forum for researchers working in
algorithms and theory of computation. Papers presenting original
research in the areas of algorithms and theory of computation are
sought. Papers in relevant applied areas are also welcome.

Topics
The topics include, but are not limited to:
* Algorithmic game theory
* Algorithms and data structures
* Approximation algorithms
* Combinatorial optimization
* Computational biology
* Computational complexity
* Computational geometry
* Cryptography
* Experimental algorithms
* Graph drawing and graph algorithms
* Internet algorithms
* Online algorithms
* Parallel and distributed algorithms
* Quantum computing
* Randomized algorithms

Important Dates
* Submission deadline: June 24, 2011
* Notification of acceptance: August 22, 2011
* Final version due: September 16, 2011

Invited Speakers
Sanjeev Arora (Princeton University, USA)
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)

Invited Speakers for the CompView GCOE Symposium:
(held at the same site on December 5, 2011)
Kazuo Iwano (Vice President, IBM Japan, Japan)
Ravi Kannan (Microsoft Research Labs., India)

Publication
The symposium proceedings will be published by Springer-Verlag in the
Lecture Notes in Computer Science (LNCS) series. Selected papers will
be invited to special issues of Algorithmica and International
Journal of Computational Geometry and Applications.

Paper Submission
Submissions should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison
with related work. Sub-missions including title, abstract, and
references, must be typeset using LNCS style; they must not exceed 10
pages. An optional appendix should be used to provide proof details
that do not fit in the main text. Submitted papers must describe work
not previously published. They must not be submitted simultaneously
to another conference with refereed proceedings or to a journal.
Drafts which contain essentially the same results as papers under
review in other conferences or journals at the moment of submission
cannot be submitted to ISAAC 2011. Only electronic submission (pdf)
will be allowed via the easychair submission server
(http://www.easychair.org/conferences/?conf=isaac2011).

Awards
A Best Paper and a Best Student Paper will be awarded. A paper is
eligible for the Best Student Paper Award if all authors are
full-time students at the time of submission. To indicate that a
submission is eligible, please add the phrase "Eligible for the Best
Student Paper Award" as the last sentence in the "Abstract" field in
the Web form of the submission server as well as in the paper.

Contact
isaac11@is.titech.ac.jp


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

ISAAC 2011 2nd CFP

2nd Call for papers


The 22nd International Symposium on Algorithms and Computation

ISAAC 2011

Yokohama, Japan
December 5-8, 2011.
http://www.is.titech.ac.jp/isaac11/


The 22nd International Symposium on Algorithms and Computation (ISAAC
2011) will be held in Yokohama, Japan, December 5-8, 2011. The
symposium is intended to provide a forum for researchers working in
algorithms and theory of computation. Papers presenting original
research in the areas of algorithms and theory of computation are
sought. Papers in relevant applied areas are also welcome.

Topics
The topics include, but are not limited to:
* Algorithmic game theory
* Algorithms and data structures
* Approximation algorithms
* Combinatorial optimization
* Computational biology
* Computational complexity
* Computational geometry
* Cryptography
* Experimental algorithms
* Graph drawing and graph algorithms
* Internet algorithms
* Online algorithms
* Parallel and distributed algorithms
* Quantum computing
* Randomized algorithms

Important Dates
* Submission deadline: June 24, 2011
* Notification of acceptance: August 22, 2011
* Final version due: September 16, 2011

Invited Speakers
Sanjeev Arora (Princeton University, USA)
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)

Invited Speakers for the CompView GCOE Symposium:
(held at the same site on December 5, 2011)
Kazuo Iwano (Vice President, IBM Japan, Japan)
Ravi Kannan (Microsoft Research Labs., India)

Publication
The symposium proceedings will be published by Springer-Verlag in the
Lecture Notes in Computer Science (LNCS) series. Selected papers will
be invited to special issues of Algorithmica and International
Journal of Computational Geometry and Applications.

Paper Submission
Submissions should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison
with related work. Sub-missions including title, abstract, and
references, must be typeset using LNCS style; they must not exceed 10
pages. An optional appendix should be used to provide proof details
that do not fit in the main text. Submitted papers must describe work
not previously published. They must not be submitted simultaneously
to another conference with refereed proceedings or to a journal.
Drafts which contain essentially the same results as papers under
review in other conferences or journals at the moment of submission
cannot be submitted to ISAAC 2011. Only electronic submission (pdf)
will be allowed via the easychair submission server
(http://www.easychair.org/conferences/?conf=isaac2011).

Awards
A Best Paper and a Best Student Paper will be awarded. A paper is
eligible for the Best Student Paper Award if all authors are
full-time students at the time of submission. To indicate that a
submission is eligible, please add the phrase "Eligible for the Best
Student Paper Award" as the last sentence in the "Abstract" field in
the Web form of the submission server as well as in the paper.

Contact
isaac11@is.titech.ac.jp

[DMANET] ADFOCS 2011 Announcement

[please forward to potentially interested students and postdocs]
*****************************************************************
12th Max-Planck Summer School
Advanced Course on the Foundations of Computer Science

ADFOCS 2011

August 29 - September 2, 2011
Saarbruecken, Germany

http://www.mpi-inf.mpg.de/conference/adfocs
*****************************************************************


ABOUT ADFOCS
------------
ADFOCS is an international summer school held annually at the Max Planck
Institute of Informatics (MPII). It is organized as part of the
activities of the MPII, in particular the International Max-Planck
Research School (IMPRS), MPII's graduate program. The purpose of this
summer school is to introduce young researchers to topics which are the
focus of current research in theoretical computer science. We bring
together three leading researchers in the field and international
participants at the graduate level and above.

PROGRAM
-------
Our invited speakers give three 90-minute lectures with subsequent
exercise and discussion sessions. The topics and lecturers are:

* Designing Approximation Algorithms using Semidefinite Programming
Sanjeev Arora, Princeton University

* Additive Integrality Gaps and Discrepancy Theory
Friedrich Eisenbrand, EPFL

* Algorithmic Mechanism Design: Fundamental Techniques and Future Challenges
Robert Kleinberg, Cornell University


LOCATION and TRAVEL INFORMATION
-----------------------------
ADFOCS will be held at the Max Planck Institute for Informatics in
Saarbruecken, Germany. Saarbruecken is the capital of one of Germany's
16 federal states, the Saarland. It is conveniently located in the
center of Europe, on the border of Germany with France, between
Luxembourg, the Saar-Mosel valley, Frankfurt, and Strasbourg. Being
located on several main train and road routes, Saarbruecken is easily
reachable from Frankfurt, Stuttgart, Paris, or Luxembourg. Saarbruecken
also has its own international airport.

REGISTRATION
------------
The registration fee is EUR 120 for *early registration before July 15*
and EUR 170 after that date. The fee covers lunches and social events.
It does not include accommodation, but we can help you with your
reservations. Per-night prices, including taxes and breakfast, typically
range from EUR 20 (youth hostel, double room) to about EUR 60 (hotel,
single room). A limited number of grants for graduate students or young
researchers are available, for application please send a CV and a letter
of recommendation before *June 30*.
Please note that grants roughly cover your registration and
accommodation fees, but will not be sufficient to cover your travel costs.

CONTACT
-------
The homepage of ADFOCS, providing forms for registration and hotel
reservation can be found at

http://www.mpi-inf.mpg.de/conference/adfocs

If you have further questions, please do not hesitate to contact the
ADFOCS team by sending an email to adfocs at mpi-inf.mpg.de

Organizers: Anke van Zuylen and Christine Rizkallah, MPII Saarbruecken

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

Tuesday, April 26, 2011

WAOA 2011 First 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/

[DMANET] WAOA 2011 First 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/
*
**********************************************************

PhD positions at University of Leicester

PhD positions
Department of Computer Science
University of Leicester
Ref: SEN00181
Package: up to £13,590 and Home/EU fee waiver
Closing date for applications: 15th May 2011
Available for September/October 2011 start

The Department of Computer Science is offering the opportunity for
seven exceptional students to pursue research leading to a PhD.
We are inviting applications for four Graduate Teaching Assistant
positions, two University-sponsored studentships, and a studentship
sponsored by Microsoft Research.

Instructions on how to apply and specific information on each of
the PhD positions can be found at:

http://www.le.ac.uk/joinus
(search vor vacancy ref SEN00181)

http://www.cs.le.ac.uk/news/GTA11.pdf

Please note that nationals of non-EU countries will be
responsible for paying the (significant) monetary difference
between International fees and Home/EU fees.

[DMANET] PhD positions at University of Leicester

PhD positions
Department of Computer Science
University of Leicester
Ref: SEN00181
Package: up to £13,590 and Home/EU fee waiver
Closing date for applications: 15th May 2011
Available for September/October 2011 start

The Department of Computer Science is offering the opportunity for
seven exceptional students to pursue research leading to a PhD.
We are inviting applications for four Graduate Teaching Assistant
positions, two University-sponsored studentships, and a studentship
sponsored by Microsoft Research.

Instructions on how to apply and specific information on each of
the PhD positions can be found at:

http://www.le.ac.uk/joinus
(search vor vacancy ref SEN00181)

http://www.cs.le.ac.uk/news/GTA11.pdf

Please note that nationals of non-EU countries will be
responsible for paying the (significant) monetary difference
between International fees and Home/EU fees.

**********************************************************
*
* 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 Abstracts: Metaheuristics Stream at OR53

--------------------------------------------------------------------------
The 53rd Conference of the UK Operational Research Society (OR53)
http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_main.htm

Nottingham, September 6-8, 2011

Call for Abstracts for the METAHEURISTICS stream
http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_Metaheuristics.htm
--------------------------------------------------------------------------


We invite abstracts and presentations on metaheuristics, either theory or
practice-oriented (preferably on real world applications).

We are open to all contributions on metaheuristics, but we are particularly
interested in those that lead to some general insight or are potentially
relevant to more than one application area.

We take a very broad definition of metaheuristics, for example simulated
annealing, tabu search, but also evolutionary algorithms, multi-meme
algorithms, adaptive operator selection, dynamic algorithm portfolios,
reactive search, particle swarm and others.

Topics of interest include (but are not limited to):
* metaheuristics for combinatorial optimisation problems
* metaheuristics for multi-objective, discrete and continuous optimisation
* metaheuristics to generate (create) heuristics
* metaheuristics to choose heuristics
* self adaptive metaheuristics
* metaheuristics based on machine learning
* hybrids of metaheuristics with exact methods such as mathematical or
constraint programming
* (automated) parameter tuning in metaheuristics
* applications of metaheuristics to new challenging domains
* analytical or semi-empirical studies of metaheuristics
* performance prediction
* performance robustness
* scalability issues
* classifications of metaheuristics
* barriers to uptake of metaheuristics in industry

The stream will provide an opportunity for the constructive exchange of
ideas and will include a keynote presentation.

If you would like to give a talk in this stream, please submit a title and
abstract of no more than 300 words via

http://www.orsoc.org.uk/orshop/orcontent.aspx?inc=or53_main.htm

by selecting 'Metaheuristics' as the stream.

(For those who are not familiar with the OR conferences, the usual procedure
is to submit a title and an abstract, and then if accepted, to give a talk
of 20-25 minutes. A full paper or extended abstract is not required.)

If you have any questions, please do not hesitate to contact us.

Best wishes,
Stream Organisers
Ender Ozcan and Andrew J. Parkes
{exo, ajp}@cs.nott.ac.uk

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

[DMANET] IMACS'2011 extended deadline

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
8th IMACS Conference on Monte Carlo Methods, August 29 – September 2, 2011,
Borovets, Bulgaria.

The topics of the conference cover both, theoretical developments and
application fields.
Stochastic metaheuristics are kind of Monte Carlo Methods for combinatorial
and continues optimization. The Stochastic metaheusristic trend of the
conference focuses on new theoretical and applied advances in the field of
search and optimization. It aims to provide a forum for researchers and
developers to exchange the latest experiences and ideas on stochastic
metaheuristic methods to cross-fertilize domains like numerical methods,
algorithms, software
implementations, computational science, and complex applications.

The abstracts of all accepted talks will be published in a booklet of
abstracts. All participants will obtain their copies of this booklet at
registration. The abstract (up to 1 page stating clearly the originality of
the results) are to be written in standard LaTeX. It is assumed that one
participant will present not more than one talk.

The papers of all talks will be published after a standard referring
procedure in the journal
Monte Carlo Methods and Applications or Springer Lecture Notes in Computer
Sciences.

Deadlines:
Submission of abstracts - April 30, 2011
Notification of acceptance of talks - May 01, 2011
Submission of registration form - May 15 2011
Submission of full papers - June 01, 2011
Notification of acceptance of papers - July 20, 2011
Submission of accommodation forms - July 25, 2011

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find at
the conference web page http://parallel.bas.bg/dpa/IMACS_MCM_2011/index.html

Metaheuristic session organizer
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg), Institute of
Information and Communication Technologies (former Institute for Parallel
Processing), Bulgarian Academy of Sciences


--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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, April 25, 2011

[DMANET] SGTHP

I would like to inform all users of DMANET about the address
of the Spectral Graph Theory Home Page: http://www.sgt.pep.ufrj.br/
This page is updated regularly and contains over two thousand references of
papers, and it includes the main references and researches on the field,
links to events, etc. Please feel encouraged to contact us in
the case you feel something or someone is missing on our lists, mainly if
the member himself is a researcher in Spectral Graph Theory and does not
find his name and/or articles in indexed scientific magazines.
Best regards,

Nair Maria Maia de Abreu

Programa de Engenharia de Produção,
Bloco F, Ilha do Fundão, RJ
http://www.producao.ufrj.br/nair.html
Tel: (21) 2562-8291

Nair Maria Maia de Abreu
COPPE/UFRJ - Engenharia de Produção
**********************************************************
*
* 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] Workshop on Algorithms and Data Structures for Selection, Identification and Encoding

CALL FOR PAPERS
ICALP 2011 Workshop on

ALGORITHMS AND DATA STRUCTURES FOR SELECTION,
IDENTIFICATION AND ENCODING
Group testing, compressed sensing, multi access communication and more.

July, 3, 2011, Zurich (Switzerland)
https://sites.google.com/site/icalp2011gt/


SCOPE

The workshop aims at bringing together researchers to exchange ideas and results related to the theoretical and practical aspects of group testing, compressed sensing, and combinatorial identification in a broad sense.

Papers presenting use of group testing and selection primitives in pattern matching, data structures for static membership, communication protocols, cryptographic protocols, streaming computation, bioinformatics and computational biology, compressed sensing, as well as papers focussing on theoretical aspects of combinatorial structures for identification and coding, like randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are welcome.

All the above topics are open to both research and industry contributions. Papers reporting on original research unpublished elsewhere as well as surveys of important results, especially recent ones, are invited.


SUBMISSIONS:

Authors should send an extended abstract of at most 15 pages via the online submission system (easy chair) at https://www.easychair.org/account/signin.cgi?conf=icalp2011gt

Accepted papers are expected to be presented at the workshop.

IMPORTANT DATES

* Paper submission due: April 30, 2011
* Notification of acceptance: May 31, 2011
* Camera-ready copy: June 15, 2011

PROCEEDINGS and SPECIAL ISSUE
The conference proceedings will be distributed to the participants at the workshop.
A selection of the papers accepted for presentation at the workshop will be invited for a special issue of Algorithmica.

ORGANIZING COMMITTEE
Ferdinando Cicalese, University of Salerno, Italy
Ely Porat, Bar Ilan University, Israel

PROGRAM COMMITTE

Ferdinando Cicalese - University of Salerno, Italy (co-chair)
Charles J. Colbourn - Arizona State University, USA
Peter Damaschke - Chalmers University, Sweden
Avinatan Hassidim - Google inc.
Sampath Kannan - University of Pennsylvania, USA
Hung Q. Ngo - University at Buffalo, The State University of New York
Ely Porat - Bar Ilan University, Israel (co-chair)
Atri Rudra - University at Buffalo, The State University of New York, USA
Miklós Ruszinkó - MTA SZTAKI, Hungary
Milan Ružić - ITU, Denmark
Noam Shental - Open University of Israel, Israel
Martin J. Strauss - University of Michigan, USA
Ugo Vaccaro - University of Salerno, Italy

CONTACT INFORMATION:

For any further information regarding the workshop, please contact the organizers:
Ferdinando Cicalese, cicalese@dia.unisa.it
Ely Porat, porately@gmail.com

SPONSORS

Department of Computer Science, University of Salerno, Italy
Department of Computer Science, Bar Ilan University, Israel
**********************************************************
*
* 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, April 24, 2011

[DMANET] [MobiWac 2011] Call for Paper (June 10, 2011)

* We apologize if you receive multiple copies of this message **

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

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 MOBIWAC series of events are intended to provide an international
forum for the discussion and presentation of original ideas, recent
results and achievements by researchers, students, and systems developers
on issues and challenges related to mobility management and wireless
access protocols.

Authors are encouraged to submit both theoretical and practical results of
significance on all aspects of wireless and mobile access technologies,
with an emphasis on mobility management and wireless access. Authors are
invited to submit full papers describing original research. Submitted
papers must neither have been published elsewhere nor currently be under
review by another conference or journal.

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

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

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

Paper Submission, Publication and Important Dates:

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active
in the field to ensure high quality and relevance to the Symposium. The
symposium will Have a single track for regular papers and in addition, a
separate interwoven track with short papers / posters. A paper should be
no more than 10 pages, double column, ACM style including tables and
figures. Only PDF format is accepted. All accepted papers will appear in
the Symposium proceedings published by ACM press.

- Paper registration due: June 10, 2011 (11:59PM EST)

- Submission Deadline: June 17, 2011 (11:59PM EST)

- Notification of Acceptance: July 25, 2011

- Camera Ready version due: August 10, 2011

- Speaker Author Registration deadline: September 6, 2011

- Regular Early Registration deadline: September 20, 2011


CONFIDENTIALITY: This email is intended solely for the person(s) named and
may be confidential and/or privileged. If you are not the intended
recipient, please delete it, notify us and do not copy, use, or disclose
its content. Thank you.

Towards A Sustainable Earth: Print Only When Necessary

--
Constantinos Marios Angelopoulos

Phd student
Department of Computer Engineering & Informatics
University of Patras & 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/
*
**********************************************************