Wednesday, March 31, 2010

[DMANET] Associate Professorship in Algorithms and Computability

The Institute of Informatics of UFRGS (Universidade Federal do Rio Grande do
Sul), Porto Alegre, Brazil, accepts applications for a full-time faculty
position (professor adjunto) in

Algorithms and computability

Deadline: April 8, 2010
More information: http://www.inf.ufrgs.br/en
**********************************************************
*
* 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] Summer School TU Vienna

ANNOUNCEMENT OF A MINI-SUMMERSCHOOL

on Probabilistic, Combinatorial, and Asymptotic
Methods for the Analysis of Algorithms

Vienna University of Technology (AUSTRIA)
June 25-26

www.aofa10.at

Note: In the week after the summer school there the conference AofA'10 will
take place in the same location.

Lectures by -----------

Nicolas Broutin (INRIA Rocquencourt)
Christian Krattenthaler (University of Vienna)
Wojciech Szpankowski (Purdue University)
N.N.


Registration
------------

http://www.regonline.co.uk/aofa10 (same page as for the conference)
Deadline: May 31
No registration fee.


Financial Support
-----------------

We can provide partial financial support for accommodation (3 days
double room).
If you need support, please contact Mrs Klement
(klement@geometrie.tuwien.ac.at) by
May 15.


Accommodation
-------------

There are pre-reserved rooms in a hotel close to the venue of the
summer school.
For reservation of those rooms please contact
Mrs Klement (klement@geometrie.tuwien.ac.at).

We encourage participants to submit a poster to the Conference AofA'10 taking
place right after the summer school at the same location. Submission deadline
is May 31. See www.aofa10.at for further information.


Web site --------

The web site of the mini summer school as well as of the subsequent
conference is
www.aofa10.at

Address
-------

Vienna University of Technology, Dept. of Discrete Mathematics and Geometry,
Wiedner Hauptstr. 8-10/104, A-1040 Wien (Austria)

We are looking forward to welcome you in Vienna,

The Organizers
**********************************************************
*
* 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] 2 new faculty posts in CS/Economics

=============================================================
THE UNIVERSITY OF LIVERPOOL -- DEPARTMENT OF COMPUTER SCIENCE
LECTURESHIPS IN ECONOMICS AND COMPUTATION (2 POSTS)
=============================================================
SALARY IN RANGE GBP 36,715 - GBP 41,323 pa

The Department was ranked in the top 10 UK Computer Science departments
in RAE2008, and building on this success, we seek to significantly
expand current research around existing strengths at the intersection of
economics/game theory and computer science. You will join Professor Paul
Goldberg, Dr Piotr Krysta, Dr Martin Gairing and Dr Rahul Savani in our
research group on Economics and Computation. The group carries out
research in the computational foundations of economics and game theory
and enjoys close collaborative links with other strong research groups
in the Department. You will be expected to contribute to our MSc in
Computation and Game Theory.

You should have a PhD in Computer Science or related discipline and an
excellent track record of research at the intersection of computer
science and economics/e-commerce/game theory.

Relevant topics of interest include (but are not restricted to):

** algorithmic game theory;
** e-commerce;
** mechanism design and auction theory;
** complexity and computation of solution concepts;
** optimisation problems in economics;
** computational social choice.

Job Ref: A-570581 ** Closing Date: 30 April 2010 **

Further details are at:
http://www.csc.liv.ac.uk/department/vacancies/Lectureshipx2EcCo.pdf
online applications/job description:
http://www.liv.ac.uk/working/job_vacancies/academic/A-570581.htm

For informal discussions please contact Prof Paul Goldberg, Head of
Group (mailto:goldberg@liverpool.ac.uk).

For full details, or to request an application pack, visit
http://www.liv.ac.uk/working/job_vacancies/
e-mail
jobs@liv.ac.uk
tel +44 151 794 2210 (24 hr answerphone).

--
| Paul W. Goldberg | Dept. of Computer Science |
| P.W.Goldberg@liverpool.ac.uk | University of Liverpool |
| http://www.csc.liv.ac.uk/~pwg/ | Ashton Building, Ashton St. |
| phone: +44 151 7954259 | Liverpool L69 3BX, 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/
*
**********************************************************

Tuesday, March 30, 2010

[DMANET] CFP: Workshop proposals IEEE MASS 2010

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

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

November 8-12, 2010 - San Francisco, CA, USA

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

-------------------------------------------------------------------------
**** Workshop Proposals Deadline: April 9, 2010 ****
-------------------------------------------------------------------------

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

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

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

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

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

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

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

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

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

Cedric Westphal DoCoMo Labs USA
cwestphal@docomolabs-usa.com

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

[DMANET] WCO CFP

Call for Papers

3nd Workshop on Computational Optimization (WCO 2010)
Wisla, Poland, October 18-20, 2010

in the framework of IMCSIT 2010 - International Multiconference
on Computer Science and Information Technology

http://www.imcsit.org

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

We invite original contributions related with both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multiobjective and multimodal optimization
- dynamic and noisy optimization
- large scale optimization
- parallel and distributed approaches in optimization
- random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
- interval methods
- nature inspired optimization methods (evolutionary algorithms, ant colony
optimization, particle swarm optimization, immune artificial systems etc)
- hybrid optimization algorithms involving natural computing techniques and
other global and local optimization methods
- memetic algorithms
- optimization methods for learning processes and data mining
- computational optimization methods in statistics, econometrics, finance,
physics, medicine, biology, engineering etc.

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

Important dates:

31.05.2010 (May 31, 2010) - Full paper submission

12.07.2010 (July 12, 2010) - Notification of acceptance

23.08.2010 (August 23, 2010) - Camera-ready version of the accepted paper


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

Submission

* Authors should submit draft papers (as Postscript, PDF of MSWord file) no
longer than 8 pages (IEEE style - available at http://www.submit.imcsit.org/).

* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.

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

Publication

* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore(R) database.

* Authors of selected papers presented during the WCO Workshop will be
invited to submit extended versions of their contributions to Control and
Cybernetics (http://www.ibspan.waw.pl/kategorie/control_and_cybernetics_en),
Carpathian
Journal of Mathematics (http://carpathian.ubm.ro/), or Mathematica
Balkanica.

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

Organizing Committee

Stefka Fidanova, Bulgaria
Josef Tvrdik, Czech Republic
Daniela Zaharie, Romania


-------------------------------------------------------------------
Assoc. Prof. Stefka Fidanova
IPP-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/
*
**********************************************************

[DMANET] SPAA 2010 Student Travel Grants

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

SPAA 2010 --- Announcement of Student Travel Grants

22nd ACM Symp. on Parallelism in Algorithms and Architectures

Santorini, Greece
June 13-15, 2010
http://www.spaa-conference.org

-------------------------------------------------------------------
Thanks to generous support from SIGARCH and IBM Research, SPAA 2010
can offer a limited number of travel grants to PhD students.

Application deadline: May 3
Notification: May 10

Please send an email to the SPAA Treasurer David Bunde (dbunde@knox.edu)
and include

- your name, advisor and affiliation
- expected graduation (if this year)
- role (e.g., author and/or presenter of a specific paper)
- prospective travel expenses
- any other sources of funding you may have or you applied for

Successful applicants must submit receipts and a summary of expenses
in order to receive reimbursement.


--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng. |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha.

**********************************************************
*
* 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, March 29, 2010

[DMANET] Canadian Conference on Computational Geometry: CCCG 2010

conference announcement: second call for papers

CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY (CCCG 2010)
August 9-11, 2010, Winnipeg, Canada

The 22nd Canadian Conference on Computational Geometry (CCCG 2010)
will be held in Winnipeg, Manitoba, Canada on August 9-11, 2010, at
the University of Manitoba.

CCCG focuses on the design of efficient algorithms, the development of
software, and the study of the mathematical foundations of
computational problems whose formulations involve geometric
constraints. The field of computational geometry is motivated by
problems from a broad range of application areas, as diverse as
computer graphics and animation, computer vision, computer-aided
design and manufacturing, geographic information systems, pattern
recognition, wireless communications, robotics, urban planning, graph
drawing, or statistical analysis to name just a few.

CCCG is a forum, accessible to a broad community of researchers, to
disseminate and discuss new theoretical and applied results in
discrete and computational geometry. The intended audience for this
conference includes graduate and undergraduate students, researchers
in the area, and members of industry whose work involves geometric
computation. Selected papers from the conference will be invited for
submission to a special issue of the journal Computational Geometry:
Theory and Applications.

SUBMISSION DETAILS

Authors are invited to submit papers describing original research of
theoretical or practical significance in computational geometry.
Submissions will be refereed by the Program Committee. Submissions
should not exceed four pages using 11 point or larger font. Documents
must be prepared using LaTeX; the appropriate template is available
from the conference website. Authors who feel that additional details
are necessary should include a clearly marked appendix, which will be
read at the discretion of the Program Committee. Only electronic
submissions will be accepted. Details on the submission procedure are
outlined on the conference website. Four page abstracts accepted to
CCCG will appear in the printed proceedings of the
conference. Electronic proceedings without page limits will be hosted
on the CCCG website at http://cccg.ca

INVITED SPEAKERS

David Avis - McGill University (Paul Erdos Memorial Lecturer)
David Eppstein - University of California, Irvine
David Kirkpatrick - University of British Columbia

IMPORTANT DATES

Submissions Due: May 10, 2010
Notification of Acceptance: June 14, 2010
Final Versions Due: June 30, 2010
Conference: August 9-11, 2010

CONFERENCE WEB PAGE

For additional details, including submission instructions and local
information, please visit the conference webpage:
http://www.cs.umanitoba.ca/~cccg2010


ORGANIZING COMMITTEE

Helen Cameron University of Manitoba
Stephane Durocher (co-chair) University of Manitoba
Mark Keil University of Saskatchewan
Andrea Mantler University of Manitoba
Jason Morrison (co-chair) University of Manitoba

SPONSORS

We thank the following organizations for generously supporting CCCG 2010.

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

[DMANET] PASCO 2010: Extended submission deadline

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

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

Parallel Symbolic Computation 2010 (PASCO 2010)

July 21-23, 2010 -- Grenoble, France

http://pasco2010.imag.fr/

Third Announcement and

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

*** Submission date extended to April 18 ***

Overview:

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

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

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

Call for Papers:

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

The PASCO 2010 Conference proceedings will be published by the
Association for Computing Machinery (ACM) http://www.acm.org/ and
will be made available in the ACM Digital Library. The proceedings
will also be distributed on CDs to the participants of the workshop.

Programming Contest:

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

Important Dates: (extended w.r.t. previous calls for papers)

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

Conference Chairs:

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


Local Arrangements Chairs:

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

Publicity Chair:

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

Administration:

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

Links:

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

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

[DMANET] The Fifth International Conference on Wireless Algorithms, Systems and Applications (WASA) 2010 --- Call for papers

The Fifth International Conference on Wireless Algorithms,
Systems and Applications (WASA 2010)
August 15-17, 2010, Beijing, China

Website: http://staff.vbi.vt.edu/maleq/wasa2010/


The WASA 2010 conference addresses the research and development
efforts in the area of
algorithms, systems and applications for the current and next
generation wireless networks.
It provides a forum for researchers and practitioners around the world
to exchange
ideas, share new findings, and discuss challenges in wireless networks.
This call solicits technical papers that describe original research
work, visionary
approaches, and future research directions dealing with effective and efficient
algorithm design and analysis, reliable and secure system development
and implementations,
experimental study and test bed validation, and new application
explorations in wireless
networks.

Topics of interest include, but are not limited to, the following:


- Cyber-physical systems (transportation, health care, civil
infrastructure, etc)
- Theoretical frameworks and analysis of fundamental cross-layer
protocol and network
design and performance issues
- Distributed and localized algorithm design and analysis
- Information and Coding theory for Wireless Networks
- Localization
- Mobility models and mobile social networking
- Topology control and coverage
- Security and privacy
- PHY/MAC/Routing protocols
- Information processing and data management
- Programmable service interfaces
- Energy-efficient systems and protocol design
- Operating system and middleware support
- Software-defined radio, reconfigurable radio networks
- Pervasive and ubiquitous computing
- Local area and personal wireless networks
- Applications, design, and performance of wireless ad hoc and sensor networks
- Delay/disruption tolerant networks
- Experimental test-beds, models and case studies


Authors are required to submit their papers in the Springer LNCS
Format with at least
10 point font and no more than 10 pages. All submissions should be in
the PDF format.
Accepted papers will be published in the Springer-LNCS series. There
will be a best
paper award, which will be selected by the program committee. For more
information please
visit the conference website at http://staff.vbi.vt.edu/maleq/wasa2010/


IMPORTANT DATES
Paper Submission Deadline: April 15, 2010
Acceptance Notification: May 15, 2010
Camera-Ready Deadline: June 1, 2010
Conference Dates: August 15-17, 2010
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] 8th French Combinatorial Conference/2nd announcement

Second announcement of 8FCC

Dear colleagues,
Please let us remind you that the 8th French Combinatorial Conference
(8FCC, 2010) will be held in the University of Paris-Sud 11 in
Orsay (France) from June 28 to July 2, 2010 (see
http://8fcc.lri.fr/).

You are welcome to participate to the 8FCC, 2010.

We would like to give you the following information:

1. We are very glad to have the following Invited speakers
Bela Bollobas, Cambridge University, UK
Adrian Bondy, University Paris VI, France,
Fan Chung, University of California, San Diego, USA
Vasek Chvatal, Concordia University, Canada
Neil Robertson, Ohio State University, USA
Akira Saito, Nihon University, Japan
Lex Schrijver, CWI, Netherlands
Endre Szemeredi , Hungarian Academy of Sciences, Hungary

2. It is the time for everyone who wishes to give a talk to submit an
abstract of the talks via easychair by April 30, 2010. The programme
committee will schedule talks according to these abstracts. (Note that
there will be a special issue of Discrete Mathematics devoted to papers
presented at the conference, guest edited by Hao Li & Yannis Manoussakis.
We will call for papers just after the conference).

3. Registration by internet is opened now. Please fill in the on-line
form. All participants are requested to pre-register by filling in the
registration form latest by Mai 30, 2010.
For more information, please visit our website (http://8fcc.lri.fr/ ).
We are looking forward to your participation to the 8FCC in Orsay.

Hao LI and Yannis Manoussakis (Co-chairs of the Scientific Committee)
LRI. UMR8623 CNRS-University of Paris-sud 11
Batiment 490, University of Paris-sud 11
91405 Orsay, France
li@lri.fr, yannis@lri.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/
*
**********************************************************

Sunday, March 28, 2010

[DMANET] Uni Trier, W3 Optimization, deadline 19.04.2010

In der Abteilung Mathematik des Fachbereichs IV - Wirtschafts- und
Sozialwissenschaften / Mathematik / Informatik - der Universitaet Trier ist
zum 01.10.2011 eine

W3-Professur fuer Optimierung

(Nachfolge Professor R. Tichatschke) mit Schwerpunkt Nichtlineare
Optimierung wieder zu besetzen.

In der Abteilung Mathematik werden Bachelor/Master-Studiengaenge fuer
Wirtschaftsmathematik, Angewandte Mathematik und Lehramt Mathematik
angeboten. Dieses praxisorientierte Studienangebot erfordert eine
Integration der Schwerpunkte Angewandte Analysis, Numerik, Optimierung/OR
und Stochastik mit den Wirtschaftswissenschaften und der Informatik.
Der/Die kuenftige Stelleninhaber/in soll aktuelle Methoden insbesondere der
endlichdimensionalen Nichtlinearen Optimierung (wie beispielsweise Mixed
Integer Nonlinear Programming oder Semidefinite Optimierung mit
Anwendungen bevorzugt in den Wirtschaftswissenschaften) in Forschung und
Lehre im Schwerpunkt Optimierung/OR vertreten. Von den
Bewerbern/Bewerberinnen wird Aufgeschlossenheit fuer das Trierer
Studienkonzept erwartet sowie die Bereitschaft, sich in angemessenem
Umfang an den Grundvorlesungen und im Service-Bereich zu engagieren.
Ueberdies wird auf Erfahrungen bei der Einwerbung von Drittmittelprojekten
Wert gelegt.

Die Einstellungsvoraussetzungen ergeben sich aus � 49 Hochschulgesetz
Rheinland-Pfalz. Insbesondere sind paedagogische Eignung und hervorragende
wissenschaftliche Leistungen nachzuweisen. Das Land Rheinland-Pfalz und
die Universitaet Trier vertreten ein Betreuungskonzept, bei dem eine hohe
Praesenz der Lehrenden am Hochschulort erwartet wird.

Die Universitaet Trier ist bestrebt, die Zahl ihrer Wissenschaftlerinnen zu
erhoehen und fordert Frauen nachdruecklich zu einer Bewerbung auf.

Schwerbehinderte werden bei entsprechender Eignung bevorzugt eingestellt.

Wir bitten, Bewerbungsunterlagen nicht in Mappen oder Huellen und auch nur
als unbeglaubigte Kopien vorzulegen, da die Unterlagen nicht zurueckgesandt
werden; sie werden nach Abschluss des Auswahlverfahrens vernichtet.

Bewerbungen mit den ueblichen Unterlagen sind in schriftlicher Form bis zum
19.04.2010 zu richten an

Universitaet Trier

Dekan des Fachbereichs IV
54286 Trier

Friday, March 26, 2010

[DMANET] Algorithmic Models of Wireless Communication

=========================================================================
Call for Participation

Workshop on Algorithmic Models of Wireless Communication (WRAWN)

http://wrawn.ru.is

Bergen, Norway
June 19-20, 2010


A satellite event of SWAT - http://org.uib.no/swat2010/
=========================================================================

The Workshop on Algorithmic Models of Wireless Communication has been
initiated to create a concerted effort to better understand the
fundamental algorithmic properties of wireless communication.

The workshop will be structured as a problem-solving event, with several
selected talks and short recent contributions interspersed with ample
time for discussions. There will be no formal proceedings, but a booklet
of abstracts will be distributed on site. An invited talk will be given
by Roger Wattenhofer, ETH.

Presentations are solicited. Please submit talk abstracts directly to
the organizers before May 1.

Magnus M. Halldorsson Berthold Voecking
Reykjavik University RWTH Aachen University
mmh<at>ru.is voecking<at>cs.rwth-aachen.de

Workshop rationale:

Surprisingly little is known about the algorithmic complexity and
efficiency of wireless networks, despite their near omnipresence.
Fundamental questions such as how much wireless communication is possible
simultaneously are still yet to be resolved. Many of the answers depend
on the wireless transmission model. Past algorithmic research has largely
focused on graph-based models, which have been shown to be inefficient
and/or unrealistic, both theoretically and experimentally. In contrast,
research in communication, or network theory has centered on more realistic
model, such as the signal-to-interference-plus-noise (SINR) model, but
primarly using experimental and heuristic approaches that give limited
insights into the complexity of the communication problems.

The aim of the workshop is to bring together researchers from different
areas and disciplines to approach these questions in a new way, as well
as to introduce these emerging topics to young researchers.
**********************************************************
*
* 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 DYNAS 2010: Submission site is open (2nd International Workshop on DYnamic Networks - Algorithms and Security)

*** Apologies for multiple copies ***

IMPORTANT: Submission site is open!
______________________________________________________________________

Call for papers

DYNAS 2010

2nd International Workshop on
DYnamic Networks - Algorithms and Security

July 5, 2010
Bordeaux, France

Colocated with ICALP 2010

http://dynas2010.labri.fr/
______________________________________________________________________

Workshop:
---------
DYNAS is about dynamic networks such as Peer-to-Peer, Sensor and
Ad-Hoc Networks. We gladly welcome descriptions of original, well
defined (possibly not yet completely solved) problems in the following
typical but not exclusive areas:
* Algorithms for construction and maintenance of Peer-to-Peer, Sensor
and Ad-Hoc Networks.
* Algorithms working on top of networks.
* Security and anonymity issues in systems of computationally weak
devices (like RFID-tags).

Submissions:
------------
Submissions should be made through the on-line submission site:
http://www.easychair.org/conferences/?conf=dynas10
Submitted papers must be written in English, use at least 11 point
font, have reasonable margins, and not exceed 6 pages. Papers
containing interesting problems without (with partial) analysis are
also welcome.

Proceedings:
------------
There will be no published proceedings for DYNAS.

Important Dates:
----------------
Submission deadline: 10th of April 2010
Author notification: 10th of May 2010
Manuscript for the workshop due: 22nd of May 2010

Invited speakers:
-----------------
* Serge Chaumette, University of Bordeaux, France
* Miroslaw Kutylowski, Wroclaw University of Technology, Poland
* Christian Scheideler, University of Paderborn, Germany

Program Committee:
------------------
* Asmaa Adnane, Polytech-Nantes, France
* Marcin Bienkowski, Wroclaw University, Poland
* Stefan Dziembowski, University of Rome "La Sapienza", Italy
* David Ilcinkas, CNRS & University of Bordeaux, France (chair)
* Marek Klonowski, Wroclaw Univ. of Technology, Poland
* Miroslaw Korzeniowski, Wrolaw Univ. of Technology, Poland (chair)
* Adrian Kosowski, Gdansk University of Technology, Poland
* Francois Lesueur, University Paris-Sud, France
* Stefan Schmid, TU Berlin / Deutsche Telekom Lab, Germany
* Filip Zagorski, Wroclaw University of Technology, Poland
**********************************************************
*
* 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] RP2010 - REACHABILITY PROBLEMS (Submission is open)

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

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

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

Invited Speakers:

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

Important dates:

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

Topics of interest:

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

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

Proceedings

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

Submissions:

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

Organizing Committee:

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

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

[DMANET] MIPLIB2010 – Call for contribution

Dear colleagues.

Since its first release in 1992, the MIPLIB has become a standard test set
used to compare the performance of mixed integer linear optimization software
and to evaluate the computational performance of newly developed algorithms
and solution techniques.
Seven years have passed since the last update in 2003. Again, the progress in
state-of-the-art optimizers, and improvements in computing machinery have made
several instances too easy to be of further interest. New challenges need to
be considered!
Last year a group of interested parties including participants from ASU, COIN,
FICO, Gurobi, IBM, and MOSEK met at ZIB to discuss the guidelines for the 2010
release of the MIPLIB. It will be the fifth edition of the Mixed-Integer
Programming LIBrary.

Therefore, we are looking for interesting and challenging (mixed-)integer
linear problems from all fields of Operations Research and Combinatorial
Optimization, ideally ones which have been built to model real life problems.
We would be very happy if you contributed to this library by sending us hard
and/or real life instances.
We have recently opened our submission web page and are looking forward to
your contributions:
http://miplib.zib.de/miplib2010

Thanks and best regards,
Timo Berthold in behalf of the IP group at ZIB.
**********************************************************
*
* 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] 38-month postdoctoral research fellowship

====================================================
38-month postdoctoral research fellowship on
Synthesis and Verification in Markov Game Structures
====================================================

The University of Liverpool is looking to recruit a Postdoctoral Research
Assistant to work on the EPSRC-funded project "Synthesis and Verification
in Markov Game Structures", under the direction of Sven Schewe, Leslie
Ann Goldberg, and Tom Shenton.

Applicants should have (or shortly expect to receive) a PhD in Computer
Science or a closely related field. Preference will be given to
candidates with a research interest and technical background in Markov
processes, formal games, and/or the design of tools for such systems.

The post is for a fixed term appointments of 38 months. It will have a
salary on the university grade 7 scale with a starting salary on step 32
(currently 31,671 UK pounds per annum + superannuation + NI) and
projected end salary on step 35 (currently 34,607 UK pounds per annum +
SA/NI).

The intended starting date is 1. July 2010, though a later starting date
is negotiable. The expected closing date for applications is 11. May
2010.

Applicants are very welcome to send informal inquiries to any of the
investigators:

Sven Schewe
(sven.schewe@liverpool.ac.uk<mailto:sven.schewe@liverpool.ac.uk>) Leslie
Ann Goldberg
(L.A.Goldberg@liverpool.ac.uk<mailto:L.A.Goldberg@liverpool.ac.uk>)
Tom Shenton (shenton@liverpool.ac.uk<mailto:shenton@liverpool.ac.uk>)

Please note: this is a PRELIMINARY announcement; the formal application
procedure will be announced soon, and potential candidates MUST follow
this procedure to apply for the position. Contact the grant holders (see
above) for details.
**********************************************************
*
* 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, March 25, 2010

[DMANET] WABI 2010 Call for Papers

Dear Colleague:

We are pleased to announce the call for papers for WABI'10, the 10th
Workshop for Algorithms in Bioinformatics. WABI will be part of ALGO 2010,
and will be hosted by the University of Liverpool, UK. The conference will
run from Sept 6 to 8, 2010, and the submission deadline is May 7, 2010.
We welcome papers on algorithmic work in bioinformatics, computational
biology and systems biology. Please see our website for details.

http://algo2010.csc.liv.ac.uk/wabi

Thank you,

Vincent Moulton
Mona Singh
WABI Program Chairs
**********************************************************
*
* 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/
*
**********************************************************

Ad Auctions 2010

CALL FOR PAPERS

Sixth Workshop on Ad Auctions
June 8, 2010
Cambridge, Massachusetts, USA
http://sites.google.com/site/adauctions2010/

In conjunction with the
Eleventh ACM Conference on Electronic Commerce (EC'10)

We solicit submissions for the Sixth Workshop on Ad Auctions, to be
held June 8, 2010 at Harvard University  in conjunction with the ACM
Conference on Electronic Commerce. The workshop will bring together
researchers and practitioners from academia and industry to discuss
the latest developments in online advertisement auctions and
exchanges.

In the past decade, we've seen a rapid trend toward automation in
advertising, not only in how ads are delivered and measured, but also
in how ads are sold. Web search advertising has led the way, selling
space on search results pages for particular queries in continuous,
dynamic "next price" auctions worth billions of dollars annually.

Now auctions and exchanges for all types of online advertising --
including banner and video ads -- are commonplace, run by startups and
Internet giants alike. An ecosystem of third party agencies has grown
to help marketers manage their increasingly complex campaigns.

The rapid emergence of new modes for selling and delivering ads is
fertile ground for research from both economic and computational
perspectives. What auction or exchange mechanisms increase advertiser
value or publisher revenue? What constraints on supply and budget make
sense? How should advertisers and publishers bid? How can both
publishers and advertisers incorporate learning and optimization,
including balancing exploration and exploitation? How do practical
constraints like real-time delivery impact design? How is automation
changing the advertising industry? How will ad auctions and exchanges
evolve in the next decade? How should they evolve?

Papers from a rich set of empirical, experimental, and theoretical
perspectives are invited. Topics of interest for the workshop include
but are not limited to:

 * Web search advertising (sponsored search)

 * Banner advertising

 * Ad networks, ad exchanges

 * Comparison shopping

 * Mechanism and market design for advertising

 * Ad targeting and personalization

 * Learning, optimization, and explore/exploit tradeoffs in ad placement

 * Marketing and advertisement over social networks

 * Ranking and placement of ads

 * Computational and cognitive constraints

 * Game-theoretic analysis of mechanisms, behaviors, and dynamics

 * Matching algorithms: exact and inexact match

 * Equilibrium characterizations

 * Laboratory experiments and simulations

 * Advertiser signaling, collusion

 * Pay for impression, click, and conversion; conversion tracking

 * Campaign optimization; bidding agents; search engine marketing (SEM)

 * Local (geographic) advertising

 * Contextual advertising (e.g., Google AdSense)

 * User satisfaction/defection

 * User incentives and rewards

 * Affiliate model

 * Incentive analysis

 * Click fraud detection and prevention

 * Price time series analysis

 * Multiattribute and expressive auctions

 * Bidding languages for advertising


We solicit contributions of two types: (1) research contributions, and
(2) position statements. Research contributions should report new
(unpublished) research results or ongoing research. The workshop
proceedings can be considered non-archival, meaning contributors are
free to publish their results later in archival journals or
conferences. Research contributions can be up to ten pages long, in
double-column ACM SIG proceedings format. Position statements are
short descriptions of the authors' view of how ad auction research or
practice will or should evolve. Position statements should be no more
than five pages long. Panel discussion proposals and invited speaker
suggestions are also welcome.

The workshop will include a significant portion of invited
presentations along with presentations on accepted research
contributions. There will be time for both organized and open
discussion. Registration will be open to all EC'10 attendees.

The first five workshops on advertising auctions successfully
attracted a wide audience from academia and industry working on
various aspects of web search advertising. Following the footsteps of
the previous workshops, the Sixth Workshop on Ad Auctions strives to
be a venue that helps address challenges in the broader field of
online advertising, by providing opportunities for researchers and
practitioners to interact with each other, stake out positions, and
present their latest research findings.


Submission Instructions
Research contributions should report new (unpublished) research
results or ongoing research. The workshop's proceedings can be
considered non-archival, meaning contributors are free to publish
their results later in archival journals or conferences. Research
contributions can be up to ten pages long, in double-column ACM SIG
proceedings format:
http://www.acm.org/sigs/publications/proceedings-templates
Positions papers and panel discussion proposals are also welcome.
Papers should be submitted electronically using the conference
management system (
http://www.easychair.org/conferences/?conf=adauctions2010 ) no later
than midnight Hawaii time, April 14, 2010. Authors should also email
the organizing committee ( adauctions2010@googlegroups.com ) to
indicate that they have submitted a paper to the system.
At least one author of each accepted paper will be expected to attend
and present their findings at the workshop.


Important Dates

   * April 14, 2010: Submissions due midnight Hawaii time

         a. Submit to
            http://www.easychair.org/conferences/?conf=adauctions2010

         b. Notify adauctions2010@googlegroups.com
   * May 5, 2010: Notification of accepted papers
   * May 19, 2010: Camera-ready copy due


Organizing Committee

Moshe Babaioff, Microsoft Research
Benjamin Edelman, HBS
Jon Feldman, Google
S├ębastien Lahaie, Yahoo! Research
Kamesh Munagala, Duke


Contact and Further Information

Email the organizing committee: adauctions2010@googlegroups.com

[DMANET] [Book announcement] STACS'10 Proceedings published (LIPIcs, Vol.5)

= Book Announcement =

Title: Proceedings of STACS'10 (27th International Symposium on
Theoretical Aspects of Computer Science)
Editors: Jean-Yves Marion, Thomas Schwentick
Series: LIPIcs (Leibniz International Proceedings in Informatics)
Volume: 5
Publisher: Schloss Dagstuhl
ISBN: 978-3-939897-16-3

Access: Open Access (online) at

http://drops.dagstuhl.de/opus/portals/extern/index.php?conf=STACS10


== About the STACS Symposium ==

The "Symposium on Theoretical Aspects of Computer Science" (STACS) takes
place each year since 1984, alternately in Germany and France. Typical
topics of the conference include:
* Algorithms and data structures, including: parallel and distributed
algorithms, computational geometry, cryptography, algorithmic learning
theory;
* Automata and formal languages;
* Computational and structural complexity;
* Logic in computer science, including: semantics, specification, and
verification of programs, rewriting and deduction;
* Current challenges, for example: biological computing, quantum
computing, mobile and net computing.

See also:
* http://www.stacs-conf.org/

== About the proceedings ==

The STACS conference of March 4-6, 2010, held in Nancy, is the 27th in
this series. The STACS 2010 call for papers led to over 238 submissions
from 40 countries. Each paper was assigned to three program committee
members. The committee selected 54 papers during a two-week electronic
meeting held in November.

See also:
* Foreword: http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2439
* Table of Contents: http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2505

== About the LIPIcs series ==

"LIPIcs: Leibniz International Proceedings in Informatics" is a series
of high-quality conference proceedings across all fields in informatics
established in cooperation with "Schloss Dagstuhl--Leibniz Center of
Informatics". LIPIcs volumes are published according to the principle
of OpenAccess, i.e., they are available online and free-of-charge.

See also:
* http://www.dagstuhl.de/en/publications/lipics/


----
Dr. Marc Herbstritt
Publishing Department | LIPIcs Editorial Office
Schloss Dagstuhl - Leibniz Center for Informatics
Email: publishing@dagstuhl.de
http://www.dagstuhl.de/herbstritt
http://www.dagstuhl.de/lipics/

**********************************************************
*
* 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] Mathematics Lectureship at Royal Holloway, University of London

The Maths Department at Royal Holloway, University of London is advertising for a Lectureship in Mathematics

Salary in the range GBP 38,849 - GBP 45,974 pa inclusive of London Allowance

Applications are invited from mathematicians with research interests
that are related to, or complement, current strengths of the department.
We are most interested in applicants who will be able to interact with
our pure mathematics or discrete mathematics groups (whose interests
include combinatorics, algebra and number theory). However, applications
from strong candidates working in other fields will also be given
serious consideration.

The Department currently offers undergraduate and postgraduate degrees
in Mathematics and postgraduate qualifications in Information Security.
You should have a Ph.D. in a relevant subject, be a self-motivated
researcher, and have a strong publication record. You should be prepared
to teach a range of undergraduate courses according to departmental
needs.

The post is available from 1st September 2010 or as soon as possible
thereafter. Informal enquiries may be made to Prof. Ruediger Schack,
email: r.schack@rhul.ac.uk

Further details and an application form are available at

http://www.rhul.ac.uk/personnel/Ads/X0310-0597.html

or from the HR Department, Royal Holloway, University of London, Egham,
Surrey TW20 0EX; fax: 01784 274900; telephone or email:
recruitment@rhul.ac.uk

Closing date for receipt of applications is midday, Friday 16th April
2010. It is expected that interviews will be held in mid-May.

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

Simon R. Blackburn
Professor of Pure Mathematics
Department of Mathematics
Royal Holloway, University of London
Egham, Surrey TW20 0EX, United Kingdom
Tel: (+44) (0)1784 443422
Fax: (+44) (0)1784 430766
E-mail: S.Blackburn@rhul.ac.uk
Web: http://www.ma.rhul.ac.uk/sblackburn


**********************************************************
*
* 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: Workshop proposals IEEE MASS 2010

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

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

November 8-12, 2010 - San Francisco, CA, USA

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

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

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

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

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

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

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

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

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

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

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

Cedric Westphal DoCoMo Labs USA
cwestphal@docomolabs-usa.com

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

[DMANET] CFP: IEEE MASS 2010

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

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

CALL FOR PAPERS

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

November 8-12, 2010 - San Francisco, CA, USA

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


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

IMPORTANT DATES:

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

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


SCOPE:

The 7th IEEE International Conference on Mobile Ad-hoc and Sensor
Systems (IEEE MASS 2010) is to be held in San Francisco, CA between
November 8-12, 2010. Wireless ad-hoc communication has applications in a
variety of environments, such as conferences, hospitals, battlefields
and disaster-recovery/rescue operations, and is also being actively
investigated as an alternative paradigm for Internet connectivity in
both urban and rural areas. Wireless sensor and actuator networks are
also being deployed for enhancing industrial control processes and
supply-chains, and for various forms of environmental monitoring. The
IEEE MASS 2010 aims at addressing advances in research on multi-hop
ad-hoc and sensor networks, covering topics ranging from technology
issues to applications and test-bed development. Please keep checking
the IEEE MASS 2010 web-space for more information and regular updates.


TOPICS OF INTEREST:

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

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


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

GENERAL CO-CHAIRS

Mario Gerla, University of California, Los Angeles
Katia Obraczka, University of California, Santa Cruz

PROGRAM CO-CHAIRS

Guohong Cao, Pennsylvania State University
Prasant Mohapatra, University of California, Davis


TPC SUB-AREA CHAIRS

- Protocols and Cross-Layer Technologies
Ahmed Helmy, University of Florida

- Systems, and applications
Chenyang Lu, Washington Unviersity in St. Louis

- Algorithms and theory
Dong Xuan, Ohio State University

- Reliability, security and privacy
Radha Poovendran, University of Washington


WORKSHOP CO-CHAIRS

Cedric Westphal, DoCoMo Labs
Christine Pepin, DoCoMo Labs


DEMO CHAIR

Rajeev Koodli, Starent Networks
Marcelo Dias Amorim, LIP 6, Universite' Paris 6


WEB CHAIR

Venkatesh Rajendran, Wionics


FINANCE AND REGISTRATION CHAIR

Zhen Jiang, West Chester University


PUBLICATION CHAIR

Dajin Wang, Montclair State University


PUBLICITY CHAIR

Aline Carneiro Viana, INRIA


LOCAL ARRANGEMENTS CO-CHAIRS

Kumar Viswanath, NTT Labs
Ignacio Solis, PARC

STEERING COMMITTEE CHAIR

Dharma P. Agrawal, University of Cincinnati


CHAIR OF IEEE TC ON DISTRIBUTED PROCESSING

Jie Wu, US National Science Foundation


CHAIR OF IEEE TC ON SIMULATION

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

Wednesday, March 24, 2010

[DMANET] CFP AlgoGT 2010. ICALP 2010 Satellite Workshop on Algorithmic Game Theory: Dynamics and Convergence in Distributed Systems

Please accept our apologies in case you receive this information from
multiple sources.

______________________________________________________________________

Call for papers

AlgoGT 2010

Workshop on Algorithmic Game Theory:
Dynamics and Convergence in Distributed Systems

July 5, 2010
Bordeaux, France

Colocated with ICALP 2010

http://algo-gt.imag.fr/
______________________________________________________________________

Workshop:
---------
This workshop is devoted in problems related to sharing ressources in
network or in distributed systems.


More and more distributed systems include agents that interact in
various and varying degrees of collaboration and competition. For
example, in telecommunication protocols, inter-domain routing often
involves routes that belong to commercial companies whose benefits are
function of the involved traffic, and hence function of a global
competition. As another example, in the computational grid tasks must
often be scheduled on machines, that may belong to several
organizations that have their own objectives. This may lead to
globally sub-optimal load balancing situations resulting of the
competition between organizations that have to optimize their own
objectives.


Topics of Interests:
------------
Original contributions in resource allocation and cooperation for in network or in
distributed systems are solicited in, but not limited to, the following directions:

* Algorithmic Game Theory
* Evaluations of quality of solutions
* Algorithms for repeated or dynamic games
* Notion of stability in distributed System
* Algorithmic Aspects of Networks
* Convergence results for distributed system
* Self-stabilization
* Comparison of centralized versus distributed algorithms


Submissions:
------------
Submitted papers must be written in English, use at least 11 point
font, have reasonable margins, and not exceed 8 pages.

Proceedings:
------------
Speakers will be invited to contribute to a special issue of a journal if the level of the contributions allows.

Important Dates:
----------------
Submission deadline: April 20, 2010
Author notification: May 21, 2010
Manuscript for the workshop due: June 4, 2010

Invited speakers:
-----------------
* Bruno Gaujal, INRIA Rhone Alpes, France
* Berthold Voecking, RWTH Aachen University, Germany

Program Committee:
------------------

* Johanne Cohen, CNRS University of Versailles, France (chair)
* Roberto Cominetti, Universidad de Chile, Chile
* Pierre Coucheney, INRIA, France
* Eyal Even-Dar, Google Inc, United States
* Yezekael Hayel, University of Avignon, France
* Yishay Mansour, Tel Aviv University, Israel
* Vangelis Markakis, Athens University of Economics and Business, Greece
* Fanny Pascual, University Paris 6, France
* Peter Reichl, Telecommunications Research Center, Austria
* Corinne Touati, INRIA Rhone Alpes - LIG, France (chair)
**********************************************************
*
* 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: Random/Approx 2010

APPROX 2010 and RANDOM 2010

13th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2010
14th Intl. Workshop on Randomization and Computation - RANDOM 2010

http://cui.unige.ch/tcs/random-approx/

1-3 September 2010

UPC Barcelona, Spain

Call for papers

SCOPE

13th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2010
14th Intl. Workshop on Randomization and Computation - RANDOM 2010
1-3 September 2010 UPC Barcelona, Spain
The 13th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2010), and the 14th.
International Workshop on Randomized Techniques in Computation
(RANDOM'2010) will be held in UPC Barcelona, Spain, on 1-3 September, 2010.
APPROX'2010 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2010 focuses on
applications of randomness to computational and combinatorial problems.
RANDOM'2010 is the fourteenth workshop in the series; APPROX'2010 is the
thirteenth in the series.

TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
- design and analysis of approximation algorithms
- hardness of approximation
- small space, sub-linear time, and streaming algorithms
- embeddings and metric space methods
- mathematical programming methods
- combinatorial problems in graphs and networks
- game theory, markets, and economic applications
- geometric problems
- packing, covering, and scheduling
- approximate learning
- other applications
RANDOM
- design and analysis of randomized algorithms
- randomized complexity theory
- pseudorandomness and derandomi-zation
- random combinatorial structures
- random walks/Markov chains
- expander graphs and randomness extractors
- probabilistic proof systems
- random projections and embeddings
- error-correcting codes
- average-case analysis
- property testing
- computational learning theory

SUBMISSIONS

Abstract Format: Electronic submissions are solicited. Please consult the
following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx10
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random10
Note: You will be asked to login using an EasyChair account. Directions on
how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The postscript must be received by 17:00pm (PDT) of April 18 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper, each
author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition of the main ideas
and techniques used to achieve these results including motivation and a
clear comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not including
the references). If the authors believe that more details are essential to
substantiate the main claims of the paper, they may include a clearly
marked appendix that will be read at the discretion of the program
committee.

Simultaneous submission

Simultaneous submission to other conferences with published proceedings is
not allowed.

PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture Notes
in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of RANDOM
appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110,
4627 and as Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 18
Notifications: June 12

Camera ready: June 23
Conference: September 1-3

PROGRAM COMMITTEES

Approx

Chandra Chekuri, University of Illinois, Urbana-Champaign.
Uriel Feige, The Weizmann Institute.
Pierre Fraigniaud, CNRS and University Paris Diderot.
Magnus M. Halldorsson, Reykjavik University.
Christos Kaklamanis, Patras University.
Anna Karlin, University of Washington.
Samir Khuller, University of Maryland.
Guy Kortsarz, Rutgers at Camden.
Monaldo Mastrolilli, IDSIA Lugano.
Claire Mathieu, Brown University.
Zeev Nutov, The Open University of Israel.
Giuseppe Persiano, University of Salerno.
Maria Serna, UPC Barcelona (chair).
Martin Skutella, TU Berlin.
Maxim Sviridenko, IBM T.J. Watson Research Center.
David P. Williamson, Cornell University.


Random

Dimitris Achlioptas, UC Santa Cruz and University of Athens.
Alexandr Andoni, Princeton University.
Anna Gal, University of Texas at Austin.
Valentine Kabanets, Institute for Advanced Study and Simon Fraser
University.
Swastik Kopparty, MIT.
Michael Krivelevich, Tel-Aviv University.
Sofya Raskhodnikova, Pennsylvania State University.
Ran Raz, Weizmann Institute.
Atri Rudra, University at Buffalo, State University of New York.
Rocco Servedio, Columbia University.
Ronen Shaltiel, University of Haifa (chair).
Angelika Steger, ETH Zurich.
Christopher Umans, California Institute of Technology.
Eric Vigoda, Georgia Tech.
Sergey Yekhanin, Microsoft Research Silicon Valley.


PROGRAM CHAIRS

APPROX

Maria Serna,
Universitat Politecnica de Catalunya
email: mjserna@lsi.upc.edu

RANDOM

Ronen Shaltiel,
University of Haifa
email: ronen@cs.haifa.ac.il

Workshop Chairs

Klaus Jansen,
U. of Kiel
e-mail: kj@informatik.uni-kiel.de
Jose Rolim,
U. of Geneva
e-mail: Jose.Rolim@unige.ch

Local Chairs

Maria Blesa,
Universitat Politecnica de Catalunya
mjblesa@lsi.upc.edu
Maria Serna,
Universitat Politecnica de Catalunya
mjserna@lsi.upc.edu

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

[DMANET] IEEE Communications Magazine - Green Communications CFP extension

Dear all Green Communications colleagues,


Due to a large number of requests, the paper submission deadline of the IEEE
Communications Magazine Feature Topic Issue on "Green Communications" is
extended from April 1 to April 15, 2010. Your contributions are welcome.

Best regards,


Guest Editors team

Honggang Zhang, Andreas Gladisch, Mario Pickavet, Zhifeng Tao, and Werner
Mohr


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

CALL FOR PAPERS (CFP)

IEEE Communications Magazine Feature Topic Issue on "Green Communications"

Manuscript Submission Due: April 1, 2010 extended to April 15, 2010

The unprecedented expansion of wireline and wireless networks has resulted
in increase in energy consumption and left a significant environmental
footprint. Recently, it has been reported that energy costs can account for
as much as half of a mobile service provider's annual operating expenses.
If the aggregate energy consumption of networking devices would follow the
growth trajectories of Internet traffic (i.e., about 60% per year), the
environmental and financial consequences will be dire. Thus, making ICT
equipment and applications "greener" can not only have a tangible positive
impact on environment, but also help operators attain long-term
profitability. Moreover, green communications can help the world reduce
dependence on fossil fuel, enable demand response and distributed energy
resources, and ultimately achieve sustainable prosperity. Accordingly, a
myriad of communications and information technologies have already been
exploited by the global smart grid initiatives to empower conventional power
grid to support two-way energy and information flow.

To meet the green communications challenges, we have to resort to a plethora
of paradigm-shifting technologies, including but not limiting to
energy-efficient network architecture & protocols, energy-efficient wireless
transmission techniques, energy-efficient home networking, energy-aware
backbone networks, Smart Grid, and opportunistic spectrum sharing without
causing harmful interference pollution (e.g., Green Spectrum).

This IEEE Communications Magazine special issue (feature topic issue) aims
to provide a comprehensive overview of the state-of-the-art in technology,
regulation and standardization for "Green Communications", and present a
holistic view of research challenges and opportunities in the coming green
era. Suggested topics include but not limit to the following:

. Energy-efficient circuit and device

. Energy-efficient transmission switching and routing technologies

. Energy-efficient base station architectures and networking

. Energy-efficiency in wired and wireless access networks

. Energy-efficiency in home and enterprise networking

. Energy efficiency of data centers and intelligent cloud computing

. Protocols and protocol extensions to enable energy efficient
networks

. Network-wide cross-layer optimizations to minimize energy
consumption

. Network load balance and smart information storage in distributed
networks

. Instrumentation for energy consumption measurement

. Remote power management for wireless terminals and access networks


. Hierarchical and distributed techniques for energy management

. Harvesting distributed energy generation

. Smart Grid

. Information theory on energy efficiency

. Cognitive, cooperative and reconfigurable networks

. Energy evaluation and comparison of different network technologies

. Novel network concepts and architectures lowering the overall
footprint of ICT (e.g., Compressed Sensing for network monitoring)

. Realistic estimation of the worldwide footprint of communications
and future evolution

. Assessment of the footprint of individual communication devices,
including life cycle assessment

. Regulation and standardization

. Deployment, trial experience, business models and applications
(e.g., green multimedia broadcasting, femtocells)

Articles should be tutorial in nature and should be written in a style
comprehensible to readers outside the specialty of the field. Authors must
follow the IEEE Communications Magazine's guidelines for preparation of the
manuscript. Complete guidelines for prospective authors can be found at
www.comsoc.org/pubs/commag/sub_guidelines.html
<http://www.comsoc.org/livepubs/ci1/info/sub_guidelines.html> . Please send
PDF (preferred) or MS WORD formatted paper to Manuscript Central
(http://commag-ieee.manuscriptcentral.com), resister or log in, go to the
Author Center and follow the instructions there.

Manuscript Submission Due: April 1, 2010 extended to April 15, 2010

Acceptance Notification: July 1, 2010

Final Manuscript Due: August 15, 2010

Publication: November 2010

Guest Editors:

Honggang Zhang ( <mailto:honggangzhang@zju.edu.cn> honggangzhang@zju.edu.cn)

Zhejiang University, China

Andreas Gladisch (andreas.gladisch@telekom.de)

Deutsche Telekom Laboratories, Germany

Mario Pickavet (mario.pickavet@intec.ugent.be)

University of Ghent - IBBT, Belgium

Zhifeng Tao (tao@merl.com)

Mitsubishi Electric Research Lab (MERL), USA

Werner Mohr (werner.mohr@nsn.com)

Nokia Siemens Networks, Germany

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