Thursday, November 19, 2009

phds and postdocs in computational genomics, tel aviv university

The Computational Genomics group at the School of Computer Science, Tel
Aviv University, headed by Prof. Ron Shamir, is recruiting graduate
students and postdocs. The group specializes in design, analysis
and implementation of algorithms for biology and medicine using graph
algorithms, statistical and systems biology techniques.

Inventive, independent, and highly motivated researchers with strong
computational background are sought. For PhD candidates, knowledge of
Hebrew is a prerequisite.

For more details see http://acgt.cs.tau.ac.il

Please email a CV and a one-page summary of current and past research to

Mrs. Gilit Zohar-Oren
School of Computer Science,
Tel Aviv University,
Tel Aviv, 69978 Israel.
Telephone +972 3 6405370
Email: gilit@post.tau.ac.il

Wednesday, November 18, 2009

4th International Symposium on Intelligent Distributed Computing IDC-2010

Dear Colleague,

We have the pleasure to announce the International Symposium on
Intelligent Distributed Computing 2010.

******************************* IDC-2010 **********************************

4th International Symposium on Intelligent Distributed Computing IDC-2010
=========================================================================
September 16-18, 2010, Tangier, Morocco

http://www.ieee.ma/~idc2010/


Organized by
IEEE Morocco Section
Software Engineering Department, University of Craiova, Romania


Topics
======
Intelligent computing covers a hybrid palette of methods and
techniques derived from classical artificial intelligence,
computational intelligence, and intelligent agents. Distributed
systems contain loosely-coupled components running on different
networked computers that communicate and coordinate their actions by
message transfer. The emergent field of intelligent distributed
computing is expected to pose special challenges of adaptation and
fruitful combination of results of both areas with a great impact on
the development of new generation intelligent distributed information
systems. The aim of this symposium is to bring together researchers
involved in intelligent distributed computing to allow
cross-fertilization and synergy of ideas and to enable advancement of
researches in the field.

The symposium welcomes submissions of original papers concerning all
aspects of intelligent distributed computing ranging from concepts and
theoretical developments to advanced technologies and innovative
applications. Papers acceptance and publication will be judged based
on their relevance to the symposium theme, clarity of presentation,
originality and accuracy of results and proposed solutions. Topics
include, but are not limited to:
- Intelligent service composition and orchestration
- E-service and Web intelligence
- Multi-agent systems
- Information extraction and retrieval in distributed environments
- Data mining and knowledge discovery in distributed environments
- Semantic and knowledge grids
- Intelligent integration of data and processes
- Distributed problem solving and decision making
- Ontologies and meta-data for describing heterogeneous resources and services
- Autonomic, adaptive and self-organising distributed computing and systems
- Intelligence in mobile, ubiquitous and pervasive computing
- Intelligence in cooperative information systems, groupware and
workflows, virtual enterprises, social networks
- Intelligent distributed applications: e-business/e-commerce,
e-learning, e-health, e-science, e-government,
crisis/disaster/emergency management, social networks
- Peer-to-Peer systems
- Emerging behaviours in complex distributed systems
- Distributed nature-inspired and bio-inspired computing
- Modelling and simulation of intelligent distributed systems
- Knowledge integration and fusion from distributed sources
- Trust, reputation, security and privacy


Paper Submission and Publication
================================
All accepted papers will be included in the Symposium Proceedings,
which will be published by Springer as part of their series Studies in
Computational Intelligence: http://www.springer.com/series/7092.
Papers should have at most 10 pages length and must be formatted
according to Springer format.

Submissions and reviews are automatically handled by a system provided
by the organizers. Please submit your paper here:
http://www.easychair.org/conferences/?conf=idc2010

Extended versions of the best papers accepted and presented at this
symposium may be considered for publication in a Special Issue of an
internationally recognized journal.


Important dates
===============
Full paper submission: April 2, 2010
Notification of acceptance: May 7, 2010
Final (camera ready) paper due: June 4, 2010
Symposium: September 16-18, 2010


Committees
==========
http://www.ieee.ma/~idc2010/committees.html


On behalf of the IDC-2010 PC,
* Mohammad Essaaidi, Abdelmalek Essaadi University, Morocco
* Michele Malgeri, University of Catania, Italy
* Costin Badica, University of Craiova, Romania

[DMANET] Junior Professorship for Discrete Optimization

The Research Institute for Discrete Mathematics of the University of
Bonn invites applications for a

Junior Professorship for Discrete Optimization (W1)
(tenure track).

The Research Institute for Discrete Mathematics is a central scientific
institution of the University of Bonn. In research and teaching it is
engaged in methods and algorithms in Discrete Optimization, and in
particular with their application to designing highly complex chips and
microprocessors. In this context, the institute has established very
successful, long-term and extensive industrial cooperations.

We are looking for a young academic who has solid experience in the
application of Discrete Optimization to chip design. Experience with
large research projects and industrial cooperations would be beneficial.

Equally qualified women will be preferred according to the
"Landesgleichstellungsgesetz". Severely disabled applicants will be
preferred if equally qualified.

Applications (including CV and publication list) are requested by
January 5, 2010 and should be sent to the "Rektorat der Rheinischen
Friedrich-Wilhelms-Universität, Regina-Pacis-Weg, 53113 Bonn, 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/
*
**********************************************************

[DMANET] Reminder: TRISTAN VII deadline

Dear Colleague,

I apologize in advance for cross-posting.
This is a reminder about the deadline for extended abstracts for TRISTAN VII
which is November 30, 2009.
There will be no more extensions.
For more information, see http://www.tristan7.org<http://www.tristan7.org/>.

Our partner VIA Travel Group & Meeting offers pre and post conference trips
(Coastal Express, Spitsbergen/Svalbard). You may also book your flights to
and from Tromsø with VIA.
Please see the TRISTAN VII web pages http://www.tristan7.org<http://www.tristan7.org/>.

Conference registration is expected to open mid December.


On behalf of the TRISTAN VII Organizing Committee,

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

[DMANET] Postdoc position in Combinatorics at the Freie Universität Berlin

The Department of Mathematics and Computer Science at the Freie
Universität Berlin invites applications for a three-year postdoctoral
position in Combinatorics (IIa BAT). The position is part of the research
group of Tibor Szabó (http://page.mi.fu-berlin.de/szabo/). The successful
candidate is expected to hold a PhD in mathematics or related field by the
start of the appointment and have an interest in extremal and
probabilistic combinatorics. The starting date of the position is
flexible, the teaching load is 4 hours per week each semester.

Applicants are asked to submit a cover letter, CV, list of publications,
research statement, and three letters of recommendation (to be sent by the
reference writers). The preferred mean of submission is via email to Ms.
Margrit Barrett (barrett@math.fu-berlin.de); please write "postdoc
position" in the Subject. Alternatively, hard copy applications can be
mailed to

Margrit Barrett
Institut für Mathematik
Freie Universität Berlin
Arnimallee 3
14195 Berlin
Germany

Applications received by December 14th will receive full consideration.


The Freie Universität Berlin (with the motto "International Network
University") has been selected as one of nine "elite universities" of
Germany. An English language graduate program, the Berlin Mathematical
School (http://www.math-berlin.de/), has recently been established in
cooperation with the other two research universities of Berlin. Discrete
Mathematics has a great tradition in the city and enjoys a unique status
with the Research Training Group "Methods for Discrete Structures"
(http://www.math.tu-berlin.de/MDS/) in place.

**********************************************************
*
* 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, November 16, 2009

[DMANET] Open PhD position in Discrete Optimization (in German)

An der Technischen Universität Dortmund ist an der Fakultät für
Mathematik zum nächstmöglichen Zeitpunkt die Stelle

einer/eines wissenschaftlich Beschäftigten

zu besetzen.

Die Entgeltzahlung erfolgt entsprechend den tarifrechtlichen Regelungen
nach Entgeltgruppe 13 TV-L bzw. ggf. nach dem Übergangsrecht (TVÜ-L). Es
handelt sich hierbei um eine Vollzeitstelle. Die Stelle ist
grundsätzlich auch für Teilzeitkräfte geeignet. Die Beschäftigung
erfolgt zunächst befristet für die Dauer von drei Jahren. Die
Gelegenheit zur Promotion ist gegeben.


Anforderungsprofil:

- überdurchschnittlich abgeschlossenes Studium der Fachrichtung
Mathematik oder Informatik

- gute Kenntnisse im Bereich der mathematischen Optimierung

- Interesse an praktischen Anwendungen

- Grundkenntnisse in einer höheren Programmiersprache

- Fähigkeit zur selbstständigen wissenschaftlichen Arbeit


Aufgabenbereich:

- Mitarbeit in der Forschung im Bereich der diskreten Optimierung

- Entwicklung und Implementierung von Optimierungsalgorithmen

- Mitarbeit in der Lehre im Umfang von vier SWS

- Mitwirkung beim Aufbau eines neu besetzten Lehrstuhls


Die Technische Universität Dortmund will den Anteil von Frauen in der
Wissenschaft erhöhen und bittet daher insbesondere Frauen um ihre
Bewerbung. Es wird darauf hingewiesen, dass die Bewerbung geeigneter
Schwerbehinderter erwünscht ist.

Bewerbungen mit den üblichen Unterlagen senden Sie bitte innerhalb von
vier Wochen nach Veröffentlichung an:

Technische Universität Dortmund
Fakultät für Mathematik
Lehrstuhl für Diskrete Optimierung
Univ.-Prof. Dr. Christoph Buchheim
Vogelpothsweg 87
44227 Dortmund

Für Rückfragen steht zur Verfügung:

Univ.-Prof. Dr. Christoph Buchheim
Tel. 0231/755 7214
Email: christoph.buchheim@tu-dortmund.de

Dortmund, 13.11.2009

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

[qest-announce] Funded D.Phil Computer Science Places at Oxford

[Please send enquiries to julie.sheppard@comlab.ox.ac.uk. Apologies for
multiple postings.]

Hi,

We are currently advertising funded places to study for a D.Phil in
Computer Science at Oxford University Computing Laboratory.

Details of the advertisement can be found here:

http://www.comlab.ox.ac.uk/news/140-full.html

Please do not hesitate to contact me if you have any questions.

Julie

--
Professor Marta Kwiatkowska
Fellow of Trinity College
Director of Graduate Studies

Oxford University Computing Laboratory
Wolfson Building, Parks Road
Oxford, OX1 3QD

Tel: +44 (0)1865 283509 (office)
Email: Marta.Kwiatkowska@comlab.ox.ac.uk
URL: http://web.comlab.ox.ac.uk/people/Marta.Kwiatkowska/
_______________________________________________
qest-announce mailing list
qest-announce@iti.uiuc.edu
http://mailman.crhc.uiuc.edu/mailman/listinfo/qest-announce

[DMANET] WINE 2009 - Early registration deadline extension

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

*** Extended Early Registration Deadline: 20/11/2009 ***

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

CALL FOR PARTICIPATION:

WINE2009, the fifth Workshop on Internet & Network Economics

December 14-18, 2009, Sapienza University of Rome, Italy.

http://www.dis.uniroma1.it/~wine09/

NEW!: Early registration deadline has been extended to November 20th due
to technical difficulties encountered by several participants.

NEW!: Program of the workshop available on workshop website


Keynote speakers:
Muthu Muthukrishnan, Google Inc.
H. Peyton-Young, U. of Oxford and Johns Hopkins U.
Eva Tardos, Cornell U.

Tutorial speakers:
Andrei Broder, Yahoo! Research
Kamal Jain/Nikhil Devanur, Microsoft Research
Tim Roughgarden, Stanford U.

The conference is sponsored by Google Inc., Microsoft Research, Yahoo!
Research, Sapienza University of Rome and Fondazione Ugo Bordoni.

**********************************************************
*
* 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] CWI seminar day: Applications of semidefinite programming

CALL FOR PARTICIPATION

CWI seminar day: Applications of semidefinite programming
CWI Amsterdam
Thursday, December 3, 2009

Organizers:
Dion Gijswijt (CWI Amsterdam, University of Leiden), Monique Laurent
(CWI Amsterdam, University of Tilburg), Frank Vallentin (TU Delft, CWI
Amsterdam)

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

There will be five talks by Christine Bachoc (University of Bordeaux),
Jop Briet (CWI Amsterdam), Dion Gijswijt (CWI Amsterdam, University of
Leiden) Achill Schuermann (TU Delft), Renata Sotirov (University of
Tilburg).

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

For further information see
http://www.cwi.nl/~vallenti/CWI_Seminar_Day

Dion Gijswijt, Monique Laurent, Frank Vallentin
**********************************************************
*
* 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, November 15, 2009

SoCG 2010 - Final Call for Papers, Videos and Multimedia

-----------------------------------------------------------------------
CALL FOR PAPERS, VIDEOS, AND MULTIMEDIA
-----------------------------------------------------------------------
26th Annual Symposium on Computational Geometry (SoCG 2010)
June 13-16, 2010
Snowbird, Utah, USA
In cooperation with ACM SIGACT and SIGGRAPH

http://www.sci.utah.edu/socg2010/


The Twenty-sixth Annual Symposium on Computational Geometry will be held
at Snowbird, Utah. We invite submissions of high-quality papers,
videos, and multimedia presentations describing original research
addressing computational problems in a geometric setting, in particular
their algorithmic solutions, implementation issues, applications, and
mathematical foundations.

The topics of the Symposium reflect the rich diversity of research
interests in computational geometry. They are intended to highlight both
the depth and scope of computational geometry, and to invite fruitful
interactions with other disciplines. Topics of interest include, but are
not limited to:
* design, analysis, and implementation of geometric algorithms and
data structures; lower bounds on the computational complexity of
geometric problems;
* mathematical, numerical, and algebraic issues arising in the
formulation, analysis, implementation, and experimental evaluation of
geometric algorithms and heuristics; discrete and combinatorial
geometry; computational topology;
* novel algorithmic applications of geometry in computer graphics,
geometric modeling, computer-aided design and manufacturing, scientific
computing, geographic information systems, database systems, robotics,
computational biology, machine learning, sensor networks, medical
imaging, combinatorial optimization, statistical analysis, discrete
differential geometry, theoretical computer science, graph drawing, pure
mathematics, and other fields.

----- Important Dates -----

* November 23, 2009: Paper titles and (short) abstracts due
* December 02, 2009: Full submissions due (23:59, Honolulu time)
* February 15, 2010: Notification of acceptance/rejection of papers
* February, 19, 2010: Video and multimedia submissions due
* March 01, 2010: Notification of acceptance or rejection of
video/multimedia submissions
* March 15, 2010: Camera-ready papers and video/multimedia abstracts due
* April 20, 2010: Final versions of video/multimedia presentations due
* June 13-16, 2010: Symposium at Snowbird, Utah

----- Local Arrangements Co-Chairs ------

* Valerio Pascucci (University of Utah)
* Suresh Venkatasubramanian (University of Utah)

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

We invite submissions of high-quality papers describing original
research on geometric algorithms and data structures, their mathematical
foundations and correctness, their implementation, and their applications.

The program committee explicitly encourages the submission of video or
multimedia in support of submitted papers. Authors may wish to consider
making a separate submission to the video/multimedia track (see the
guidelines below). Papers and video/multimedia submissions will be
reviewed separately; acceptance or rejection of one will not influence
acceptance or rejection of the other.

Final versions of accepted papers will be published by ACM in the
symposium proceedings. Proceedings will be distributed to symposium
participants and will also be available from ACM for purchase or through
the digital library. An author of each accepted paper will be expected
to attend the Symposium and give a presentation (approximately 20
minutes) of the paper. Authors of a selection of papers from the
conference will be invited to submit extended versions of their papers
to a special issue of one or more journals.

----- Paper Submission -----

All submissions should be made electronically; see the EasyChair
SoCG2010 web pages
http://www.easychair.org/conferences/?conf=socg2010
for detailed submission instructions. If electronic submission is not
feasible, please contact the program committee chair, David Kirkpatrick
<socg-chair@cs.ubc.ca>, well in advance of the submission deadlines.

----- Submission Guidelines ------

Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name, affiliation, and
e-mail address. This should be followed by a precise statement of the
problem considered, a succinct summary of the results obtained
(emphasizing the significance, novelty, and potential impact of the
research), and a clear comparison with related work. The remainder of
the extended abstract should provide sufficient detail to allow the
program committee to evaluate the validity, quality, and relevance of
the contribution. Clarity of presentation is very important; the whole
extended abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and non-experts,
often under tight time constraints.

Submissions should be typeset in single column format, using 11-point or
larger font, with at least 1 inch/2.54 cm margins and single line
spacing. Excluding the title page and bibliography, the extended
abstract must not exceed 10 pages. Submissions deviating from these
guidelines risk rejection without consideration of their merits.

A clearly marked appendix (of reasonable length) containing additional
technical details may be included directly in the submission. Other
supporting materials, such as an expanded version of the paper, a video
or multimedia presentation, source code, or experimental data, may be
provided by including a URL in the submission. Appendices and other
supporting materials will not be regarded as part of the actual
submission and will be considered only at the discretion of the program
committee.

Authors must submit the title and a short abstract of their paper by
November 23, 2009. This pre-submission will be used to help make program
committee reading assignments. Extended abstracts must be received by
December 2, 2009 (23:59, Honolulu time). There will be no extension of
this deadline; late submissions will not be considered.
Authors will be notified of acceptance or rejection by February 15,
2010. Final versions of accepted submissions will be due by March 15,
2010 for inclusion in the proceedings. The final proceedings papers must
be formatted in accordance with ACM proceedings guidelines; LaTeX style
files will be made available to authors of accepted papers.

Concurrent submission of the same (or essentially the same) abstract to
SoCG and to another conference with published proceedings is not
allowed. An extended abstract of a paper that is under journal review,
or scheduled for publication in a journal after June 2010, may be
submitted, when it is clear that the extended abstract differs
substantially from the journal version. In such cases, the authors must
include the journal version in an appendix that clearly identifies the
status of the journal submission.


----- Program Committee -----

* Hee-Kap Ahn (POSTECH, Korea)
* Nina Amenta (University of California, Davis, USA)
* Tetsuo Asano (JAIST, Japan)
* Sergey Bereg (University of Texas at Dallas, USA)
* Therese Biedl (University of Waterloo, Canada)
* Robert Bridson (University of British Columbia, Canada)
* Erin Chambers (Saint Louis University, USA)
* Hazel Everett (University Nancy 2, France)
* Sandor Fekete (Braunschweig University of Technology, Germany)
* Efi Fogel (Tel Aviv University, Israel)
* David Kirkpatrick, Chair (University of British Columbia, Canada)
* Valentin Polishchuk (Helsinki Institute for Information Technology,
Finland)
* Raimund Seidel (Saarland University, Germany)
* Bettina Speckmann (TU Eindhoven, The Netherlands)
* Csaba Toth (University of Calgary, Canada)
* Chee Yap (Courant Institute, NYU, USA)

---------------------------------------------------------------------
CALL FOR VIDEO AND MULTIMEDIA PRESENTATIONS
19th Annual Video/Multimedia Review of Computational Geometry
---------------------------------------------------------------------

Video and multimedia presentations are sought for the 19th Annual Video
and Multimedia Review of Computational Geometry. This review showcases
the use of visualization in computational geometry for exposition and
education, for the visual exploration of geometry in research, and as an
interface and a debugging tool in software development. Algorithm
animations, visual explanations of structural theorems, descriptions of
applications of computational geometry, and demonstrations of software
systems are all appropriate.

Three to five minutes is ideal for most animations and presentations of
applications; eight minutes is the upper limit. Submissions of movie
clips in QuickTime or MPEG-4 compressed formats (e.g., XviD or DivX
version 6) are encouraged. For ease of sharing and viewing, we
encourage (but it is not required) that each submission be uploaded to
YouTube, and that the corresponding url be supplied along with the
submission. Consider adding a subtitle track to movie clips. We also
encourage submissions of Macromedia Flash, Java applets, and limited
forms of other multimedia or software. These formats must come with a
script that will allow them to be distributed in both interactive and
canned QT or MPEG movie formats. In case of doubt, please email the
Video and Multimedia Program chair. Some suggestions on making movie
clips can be found at
http://www.ams.sunysb.edu/~jsbm/SoCG10/video_suggestions.html.

Accepted video and multimedia presentations will have an abstract in the
published conference proceedings; video/multimedia authors will have an
opportunity to present their work at the conference during a dedicated
video session. Accepted presentations will be available online in
various formats in a web proceedings. (The 2009 video proceedings are
available at
http://www.computational-geometry.org/SoCG-videos/socg09video/.)

----- Video/Multimedia Submission -----

Video/multimedia submissions should be sent by e-mail to the
Video/Multimedia committee chair, Joe Mitchell (mitchell@compgeom.com),
to arrive by 23:59, New York time, Friday, February 19, 2010.

The author(s) should submit a one or two-page description of the
material shown in the presentation, and where applicable, the techniques
used in the implementation. An email address of the corresponding author
and a URL or ftp address where the supporting materials can be retrieved
must be included. The final two-page descriptions must be formatted
according to the guidelines for ACM proceedings; LaTeX style files will
be provided to authors of accepted presentations.

We explicitly encourage video/multimedia submissions that support papers
submitted to the symposium. Submitted papers and associated
video/multimedia submissions will be treated entirely separately by the
respective committees: acceptance or rejection of one will not influence
acceptance or rejection of the other.

Authors will be notified of acceptance or rejection, and given
reviewers' comments by March 1, 2010. For each accepted submission, the
final version of the 2-page textual description will be due by March 15,
2010 (electronically) for inclusion in the proceedings. Final versions
of accepted video/multimedia presentations will be due April 20, 2010 in
the best format available.


----- Video and Multimedia Presentation Program Committee -----

* Tamal Dey (Ohio State University)
* David Eppstein (UC Irvine)
* Jie Gao (Stony Brook)
* David Gu (Stony Brook)
* George Hart (Stony Brook)
* Joe Mitchell, Chair (Stony Brook)
* Jonathan Shewchuk (UC Berkeley)
* Monique Teillaud (INRIA Sophia Antipolis - MÄditerranÄe)

---------------------------------------------------------------------
---------------------------------------------------------------------
SOCG Steering Committee (2009-2012)

* Jack Snoeyink, Chair (University of North Carolina)
* Mark de Berg, Secretary (TU Eindhoven)
* Joe Mitchell (SUNY Stony Brook)
* Guenter Rote (FU Berlin)
* Monique Teillaud (INRIA Sophia Antipolis - MÄditerranÄe)

Deadline Extension: International Journal of Network Protocols and Algorithms, Vol 1 Issue 2

********************* Call for Papers for Vol 1, Issue 2 *********************

International Journal of Network Protocols and Algorithms

ISSN 1943-3581

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

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

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

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

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

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

Important Dates for the second Issue:

- Manuscript Due: November 22, 2009 (extended deadline)
- Notification: December 13, 2009
- Final Manuscripts Due: December 23, 2009
- Tentative Publication: End of December 2009

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

Editorial Board of the International Journal of Network Protocols and Algorithms

Saturday, November 14, 2009

[DMANET] Junior Professorship (W1) Bioinformatics for High Throughput Technologies

The Institute of Computer Science at the Friedrich-Schiller University
Jena offers the following position, funded by the Carl-Zeiss-Stiftung:

Junior Professorship (W1) „Bioinformatics for High Throughput Technologies"

The successful candidate's scientific expertise should complement the
Bioinformatics activities at the Friedrich-Schiller University Jena. The
candidate is expected to develop methods and computational tools for the
efficient analysis and visualization of high throughput data in life
sciences. Scientific links to algorithmic Bioinformatics, systems
biology, and other research activities at Jena are desired. Applicants
should demonstrate the ability to raise research funding and are
expected to collaborate in existing scientific cooperations of the
University.

The candidate is expected to offer courses for advanced students in the
scientific area of the Junior Professorship, and possibly a programming
course. The language of instruction is mainly German, but advanced
courses may be conducted in English.

An appointment as junior professor is time-limited to four years.
Appropriate performance in research, in teaching, and in raising
research funding allows for a prolongation up to six years. In the event
that the university subsequently decides to award tenure on the W2 or W3
professorial grades, the usual requirement to advertise all such
positions need not apply. The Junior Professorship comes with an
additional staff position.

An outstanding doctoral degree and scientific publication activities at
the international level, as well as educational skills are prerequisites
for this position.

As the University intends to increase its female academic staff, it
follows the principle of affirmative action and encourages applications
by qualified women scientists.

Physically challenged applicants with equal qualifications and
experience will be given priority over other applicants.

Applications including the usual documents (CV, list of publications,
record of teaching and fund raising, copies of testimonials, up to five
publications, outline of planed research activities in Jena) must be
sent by 2010-01-08 to:

Dekan der Fakultät für Mathematik und Informatik, Friedrich-Schiller
Universität Jena, 07737 Jena, Germany

http://bio.informatik.uni-jena.de/jobs/junior-professorship/

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

Am Institut für Informatik der Friedrich-Schiller Universität Jena ist,
gefördert durch die Carl-Zeiss-Stiftung, zum nächstmöglichen Zeitpunkt eine

Juniorprofessur (W1) „Bioinformatik für Hochdurchsatzverfahren"

zu besetzen. Gesucht wird eine Persönlichkeit, deren fachliche
Ausrichtung den Aufbau des Forschungsschwerpunktes Bioinformatik an der
Universität Jena sinnvoll ergänzt, und informatische Methoden und
Werkzeuge zur effizienten Auswertung und Visualisierung von Daten aus
Hochdurchsatzverfahren in den Lebenswissenschaften entwickelt.
Wünschenswert sind Bezüge zur Algorithmischen Bioinformatik und
Systembiologie sowie Anknüpfungspunkte zu bestehenden Jenaer
Forschungsaktivitäten. Darüber hinaus wird erwartet, dass die zu
berufende Persönlichkeit sich sowohl bei universitätsweiten
Kooperationen als auch bei der kompetitiven Drittmitteleinwerbung
erfolgreich engagiert.

In der Lehre sollen Vorlesungen für fortgeschrittene Studierende zum
Themenbereich der Juniorprofessur angeboten werden; auch der Aufbau
eines entsprechenden Computer-Praktikums ist erwünscht.

Das Dienstverhältnis ist zunächst auf vier Jahre befristet. Bei einer
erfolgreichen Evaluation der Leistungen in Forschung, Lehre,
akademischer Selbstverwaltung und Drittmitteleinwerbung kann es um
weitere zwei Jahre verlängert werden. Im Fall einer nachfolgenden
Berufung auf eine W2/W3-Professur kann von einer Ausschreibung abgesehen
werden („Tenure"- Option). Die Juniorprofessur ist mit einer
zusätzlichen Mitarbeiterstelle und eigenen laufenden Mitteln ausgestattet.

Einstellungsvoraussetzungen sind eine überdurchschnittlich
abgeschlossene Promotion und eine Publikationstätigkeit auf
internationalem Niveau sowie die pädagogische Eignung.
Auslandserfahrungen sind wünschenswert.

Die Friedrich-Schiller-Universität strebt eine Erhöhung des Anteils von
Frauen in Forschung und Lehre an; qualifizierte Wissenschaftlerinnen
werden nachdrücklich aufgefordert, sich zu bewerben.

Schwerbehinderte werden bei gleicher Eignung bevorzugt berücksichtigt.

Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Publikationsliste,
Erfahrungen in Lehre und Drittmitteleinwerbung, Zeugniskopien, bis zu
fünf ausgewählte Publikationen, Kurzdarstellung zukünftiger
Forschungsaktivitäten mit Anknüpfungspunkten in Jena) sind bis zum
08.01.2010 einzureichen bei

Dekan der Fakultät für Mathematik und Informatik, Friedrich-Schiller
Universität Jena, 07737 Jena, Germany

http://bio.informatik.uni-jena.de/jobs/junior-professorship/

--
Prof. Dr. Sebastian Boecker, Lehrstuhl fuer Bioinformatik
Institut fuer Informatik, Friedrich-Schiller-Universitaet Jena
Ernst-Abbe-Platz 2, 07743 Jena, Germany
Office 3405, Phone +49 (0)3641 9-46451, Fax +49 (0)3641 9-46452
http://bio.informatik.uni-jena.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/
*
**********************************************************

Friday, November 13, 2009

Postdoctoral position in distributed algorithms and networks

A postdoctoral position is available immediately in the general area of
distributed algorithms and networks in the Division of Mathematical
Sciences, Nanyang Technological University, Singapore. Under the supervision
of Dr. Gopal Pandurangan (http://www.ntu.edu.sg/home/gopal), the
postdoctoral researcher will have an opportunity to work in the area of
designing and analyzing cutting-edge distributed/decentralized algorithms
for emerging distributed and dynamic networks. The position requires a PhD
in computer science or a related area. Experience in prior work in
algorithms area as evidenced by publications in top algorithms and theory
conferences is desired. In particular, a track record in distributed
algorithms and computing will be a plus. Initial appointment will be for one
year with the possibility of renewal for an additional year based on
performance and availability of funds. Salaries are competitive and are
determined according to the successful applicants' accomplishments,
experience and qualifications. Travel funding is available. The candidates
should send their CV, a brief research statement, and two letters of
recommendation to Prof. Gopal Pandurangan (gopalpandurangan@gmail.com).
Review of applicants will begin immediately and continue until the position
is filled.

[DMANET] POSTDOCTORAL POSITION in DISTRIBUTED ALGORITHMS

A postdoctoral position is available immediately in the general area of
distributed algorithms and networks in the Division of Mathematical
Sciences, Nanyang Technological University, Singapore. Under the supervision
of Dr. Gopal Pandurangan (http://www.ntu.edu.sg/home/gopal/), the
postdoctoral researcher will have an opportunity to work in the area of
designing and analyzing cutting-edge distributed/decentralized algorithms
for emerging distributed and dynamic networks. The position requires a PhD
in computer science or a related area. Experience in prior work in
algorithms area as evidenced by publications in top algorithms and theory
conferences is desired. In particular, a track record in distributed
algorithms and computing will be a plus. Initial appointment will be for one
year with the possibility of renewal for an additional year based on
performance and availability of funds. Salaries are competitive and are
determined according to the successful applicants' accomplishments,
experience and qualifications. Travel funding is available. The candidates
should send their CV, a brief research statement, and two letters of
recommendation to Prof. Gopal Pandurangan (gopalpandurangan@gmail.com).
Review of applicants will begin immediately and continue until the position
is filled.
**********************************************************
*
* 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/
*
**********************************************************

SWAT 2010

******************************************************************
12th Scandinavian Symposium and Workshops on Algorithms and Data Structures

SWAT 2010 - CALL FOR PAPERS

21-23 June 2010, Bergen, Norway

http://org.uib.no/swat2010/
******************************************************************
SWAT alternates with the Workshop on Algorithms and Data Structures (WADS)
and is intended as a forum for researchers in the area of design and
analysis of
algorithms and data structures. We invite submissions of papers
presenting original
research on algorithms and data structures in all areas, including but
not limited to
approximation algorithms, parameterized algorithms, computational biology,
computational geometry, distributed algorithms, external-memory algorithms,
graph algorithms, online algorithms, optimization algorithms, parallel
algorithms,
randomized algorithms, string algorithms and algorithmic game theory.

Contributors must submit their papers using the Easychair system.
Submissions must be of
at most 12 pages using 11 point or larger font and with reasonable line
spacing and margins.
Additionally a clearly marked appendix may be included; this appendix
will not be regarded as
part of the submission and will be considered only at the discretion of
the program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.
Deadline for submissions : February 1, 2010. Notification to authors :
March 24, 2010.
For further information please see the SWAT homepage
http://org.uib.no/swat2010/

Program committee:
Ittai Abraham, Microsoft Research, Silicon Valley
Pankaj Agarwal, Duke University
Hans Bodlaender, University of Utrecht
Gerth Brodal, Aarhus University
Guy Even, Tel Aviv University
Fabrizio Grandoni, University of Rome
Roberto Grossi, University of Pisa
Haim Kaplan, Tel Aviv University (chair)
Juha Karkkainen, University of Helsinki
Matya Katz, Ben-Gurion University
Valerie King, University of Victoria
Christos Levcopoulos, Lund University
Stefano Leonardi, University of Rome
Moshe Lewenstein, Bar-Ilan University
Ulrich Meyer, Goethe University Frankfurt
Rob van Stee, Max Planck Institut Informatik
Martin Strauss, University of Michigan
Maxim Sviridenko, IBM Watson Research
Chaitanya Swamy, University of Waterloo
Robert E. Tarjan, Princeton University
Yngve Villanger, University of Bergen
Neal Young, University of California Riverside

[DMANET] Two year postdoctoral research position at the Universite Libre de Bruxelles

*** Sorry for cross-postings ***

A two-year research position is available in the group "Graphs and
Mathematical Optimization" of the Computer Science Department of
Université Libre de Bruxelles, in Belgium.

The project, due to start in December, is an industrial collaboration
with Advanced Information Systems (www.aisystems.eu) aiming at
developing parallel algorithms for solving large planning and
scheduling problems.

The objectives of the project are to:

* Improve the speed and quality of the optimization algorithms in the
field of advanced planning and scheduling.

* Develop the parallelization of heuristic methods such as simulated
annealing, tabu search, and genetic algorithms in the field of
resource allocation, scheduling and cutting plan optimization.

* Define the best programming paradigm to design, develop and maintain
optimization techniques with a high but controllable level of
concurrency.

* Develop insight and methods for the tuning of concurrent search
algorithms.

* Develop methods to detect parallelization opportunities in existing
search algorithms.

We are looking for a researcher holding a PhD in mathematics, computer
science or operations research, or with a significant research
experience related to the project. A good knowledge in one or more of
the fields of parallelization techniques, local search heuristics and
constraints programming is required.

The position is subject to the acceptance of the candidate by Advanced
Information Systems.

For more information about our group, please visit
http://www.ulb.ac.be/di/gom/

To apply or for more information about the position, please contact
Bernard Fortz (bernard.fortz@ulb.ac.be).
**********************************************************
*
* 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, November 12, 2009

[DMANET] PhD Program in Operations Research at MIT

The Operations Research Center at the Massachusetts Institute of
Technology (MIT) encourages applications for the doctoral program in
Operations Research for the fall term 2010.

For information on the OR doctoral program and the application
process, visit: http://web.mit.edu/orc/www

Applications for admission for fall term 2010 are due December 15th.

MIT/OR Center
URL: web.mit.edu/orc/www
T: 617-253-3601
F: 617-258-9214
**********************************************************
*
* 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] Associate Professor in Discrete Mathematics and Its Applications

The Department of Mathematics and Computer Science (IMADA) at the
University of Southern Denmark, Odense, invites applicants for a position
as Associate Professor of Discrete Mathematics. The appointment is
expected to take effect on April 1, 2010.

The successful applicant is expected to have a well documented record of
research in theoretical mathematics and computer science (algorithm
theory). Applications from researchers within the research areas of the
department are particularly welcome.

The research areas of the department's discrete mathematics group is
characterized by graph colouring, extremal graph theory, oriented graphs,
flow network, scheduling, algorithms and complexity theory, practical
applications of combinatorial optimization and efficient algorithms (the
last mentioned also in collaboration with industrial partners).

The position is placed in the department's mathematics group, but the
successful applicant is also expected to have the ability to and interest
in collaboration with the other research groups at the department,
particularly applied mathematics and computer science.

Emphasis will be placed on a strong research and education collaboration
within the mathematics group as well as with other groups and interest in
applications of discrete mathematics.

For further information see
http://www.sdu.dk/Om_SDU/Institutter_centre/Imada_matematik_og_datalogi.aspx
or contact Head of Department Claus Michelsen, cmich@imada.sdu.dk.

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

AAIM 2010: Call for Papers

****************************************************************************************************************
The 6th Intl Conference on Algorithmic Aspects in Information and Management
AAIM 2010
19-21 July 2010
Weihai, China
http://aaim2010.sdu.edu.cn/
****************************************************************************************************************
 
While the areas of information management and management science are full of algorithmic challenges, the proliferation of data has called for the design of efficient and effective algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in computer science, operations research, applied mathematics, economics, and related disciplines.
 
Main Topics
 
Typical, but not exclusive, topics are:
 
Basic Algorithms
 
    Approximation Algorithms
    Computational Geometry
    Data Structures
    Experimental Algorithms
    Online Algorithms
    Randomized Algorithms
 
Operations Research and Management Science
 
    Bin Packing
    Facility Location
    Mathematical Programming
    Network Optimization
    Routing
    Scheduling
 
Biology, Economics and Finance
 
    Algorithmic Game Theory
    Combinatorial Auction
    Computational Biology
    Computational Finance
    E-Commerce
 

Important Dates
 
Submission deadline: February 1, 2010
Notification deadline:  March 29, 2010
Final version deadline:  April 19, 2010
 

Publications
 
The proceedings will be published by Springer-Verlag in Lecture Notes in Computer Science.
 
For more details of AAIMS 2010 and submissions, please visit the conferene website: http://aaim2010.sdu.edu.cn/.

[DMANET] PhD/PostDoc position in Parameterized Algorithmics, FSU Jena

The Chair for Bioinformatics, Institute of Computer Science at the
Friedrich-Schiller University Jena offers the following position:

PostDoc/PhD student as a research associate (Wissenschaftliche/r
Mitarbeiter/in)

This position is part of the project "Parameterized Algorithmics for
Bioinformatics", funded by the Deutsche Forschungsgemeinschaft. Scope of
this project is to develop efficient algorithms for NP-hard
bioinformatics problems, in particular using parameterized algorithmics.
Focus of research is, besides developing such algorithms, also their
implementation, evaluation, algorithm engineering, and biological case
studies.

Applicants for this project must have or be about to obtain a Master's
degree or a qualification equivalent to the German Diploma in
bioinformatics, computer science, or mathematics. The applicant should
have an excellent background in algorithmics. Introductory course level
knowledge or better in biology and molecular biology is required. Good
programming skills are required, and experience in software design would
be helpful.

Salary is according to Entgeltgruppe 13 TV-L, either a full position
(for PostDocs) or 3/4 position (for PhD students).

Handicapped applicants will be given preference in case of equal
qualifications.

Please send your application with the usual documents (CV, list of
publications, copies of certificates, in paper or via email) until
December 12th 2009 to:

Prof. Dr. Sebastian Böcker

Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany

http://bio.informatik.uni-jena.de/jobs/mitarbeiter-pabi/


Am Lehrstuhl für Bioinformatik, Institut für Informatik der
Friedrich-Schiller Universität Jena ist zum nächstmöglichen Zeitpunkt
die Stelle eines/r

Wissenschaftlichen Mitarbeiters/in (Post-Doktorand oder Doktorand)

zu besetzen. Die Stelle ist Teil des von der DFG geförderten Projekts
Parametrisierte Algorithmik bioinformatischer Probleme. Im Rahmen dieses
Projektes sollen effiziente Algorithmen, insbesondere aus dem Bereich
der parametrischen Algorithmik, für NP-schwere Probleme der
Bioinformatik entwickelt werden. Fokus der Forschung sind, neben der
Entwicklung solcher Algorithmen, auch ihre Implementierung, Evaluierung,
Algorithm Engineering und biologische Fallstudien.

Bewerber müssen über ein abgeschlossenes Diplom- oder Master-Studium in
den Bereichen Bioinformatik, Informatik oder Mathematik verfügen, oder
ein solches Studium in nächster Zukunft abschließen. Notwendig sind
exzellente Kenntnisse in Bereich Algorithmik sowie Grundkenntnisse in
den Bereichen Biologie und Molekularbiologie. Die Projektarbeit
erfordert gute Programmierkenntnisse, Erfahrung im Bereich Software
Design ist wünschenswert.

Die Vergütung erfolgt gemäß Entgeltgruppe 13 TV-L, es handelt sich um
eine volle Stelle (für Post-Doktoranden) bzw. eine 3/4 Stelle (für
Doktoranden). Die Möglichkeit zur wissenschaftlichen Qualifikation wird
geboten.

Beiträge zur Lehre der Studiengänge Bioinformatik (Diplom, B.Sc., M.Sc.)
werden in geringen Umfang erwartet.

Schwerbehinderte werden bei gleicher Eignung, Befähigung und fachlicher
Qualifikation bevorzugt berücksichtigt.

Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Publikationsliste,
Zeugniskopien) sind bis zum 14.12.2009 (in Papierform oder elektronisch)
einzureichen bei:

Prof. Dr. Sebastian Böcker

Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany


--
Prof. Dr. Sebastian Boecker, Lehrstuhl fuer Bioinformatik
Institut fuer Informatik, Friedrich-Schiller-Universitaet Jena
Ernst-Abbe-Platz 2, 07743 Jena, Germany
Office 3405, Phone +49 (0)3641 9-46451, Fax +49 (0)3641 9-46452
http://bio.informatik.uni-jena.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/
*
**********************************************************