Wednesday, September 22, 2010

SAT 2011 Preliminary Call for Papers

=============================================
PRELIMINARY CALL FOR PAPERS

SAT 2011
14th International Conference on Theory and
Applications of Satisfiability Testing
June 19-22, Ann Arbor, Michigan, U.S.A.

http://www.lri.fr/SAT2011

Associated Workshops: June 18 and June 23
=============================================

The International Conference on Theory and Applications of
Satisfiability Testing is the primary annual meeting for researchers
studying the propositional satisfiability problem. SAT 2011
(http://www.lri.fr/SAT2011) is the fourteenth SAT conference and
features the SAT competition, the Pseudo-Boolean evaluation, and the
MAX-SAT evaluation.

Many hard combinatorial problems can be encoded as SAT instances,
including problems that arise in hardware and software verification,
AI planning and scheduling, OR resource allocation, etc. The
theoretical and practical advances in SAT research over the past dozen
years have contributed to making SAT technology an indispensable tool
in many of these domains. The SAT conference aims to further advance
the field by soliciting original theoretical and practical
contributions on a wide range of topics including, but are not limited
to proof systems, proof complexity, search algorithms, heuristics,
analysis of algorithms, hard instances, randomized formulae, problem
encodings, industrial applications, solvers, simplifiers, tools, case
studies and empirical results. SAT is interpreted in a rather broad
sense: besides propositional satisfiability, it includes the domain of
quantified boolean formulae (QBF), constraints programming techniques
(CSP) for word-level problems and their propositional encoding and
particularly satisfiability modulo theories (SMT).

Submissions should contain original material up to 14 page, and use
the Springer LNCS style. All appendices, tables, figures and the
bibliography must fit into the page limit. Submissions deviating from
these requirements may be rejected without review. All accepted papers
will be published in the proceedings of the conference. The conference
proceedings will be published within the Springer LNCS series.

The paper submission page is
http://www.easychair.org/conferences/?conf=sat11

LNCS style authors instructions is
http://www.springer.com/comp/lncs/Authors.html


IMPORTANT DATES
---------------
December 17, 2010: Workshop Proposals
February 11, 2011: Abstract Submission
February 18, 2011: Paper Submission
March 18, 2011: Author Notification
April 1, 2011: Final Version


CALL FOR WORKSHOPS PROPOSALS
----------------------------
Researchers and practitioners are invited to submit proposals for
associated workshops on related topics. Workshops will have to be
financially self-supporting. Proposals should consist of two
parts. First, a short scientific justification of the proposed topic,
its significance, and the particular benefits of the workshop to the
community, as well as a list of previous or related workshops (if
relevant). A second, organizational part should include contact
information of the workshop organizers, procedures for selecting
papers and participants, estimate of the audience size and a tentative
list of the program committee. Proposals are due by December 17, 2010
and must be submitted electronically as a PDF files, by email, to both
SAT Conference Chairs: karem@umich.edu and simon@lri.fr.


CONFERENCE CHAIRS
-----------------
Karem A. Sakallah, University of Michigan, USA
Laurent Simon, University of Paris-Sud 11, France


ASSOCIATED COMPETITIVE EVENTS
----------------------------

SAT Competition 2011
web site:
http://www.satcompetition.org/2011
Organizers:
- Daniel Le Berre
- Matti Jarvisalo
- Olivier Roussel

MAX-SAT Evaluation 2011
web site:
http://maxsat.ia.udl.cat
Organizers:
- Josep Argelich
- Chu-Min Li
- Felip Manya
- Jordi Planes

PB Evaluation 2011
web site:
http://www.cril.univ-artois.fr/PB11
Organizers:
- Vasco Manquinho
- Olivier Roussel

[DMANET] MIC 2011, Call for Papers

*** Apologies if you have received this CFP more than once ***

9th Metaheuristics International Conference

MIC 2011

25-28 July, 2011 in Udine, Italy


More details and up-to-date information at

http://mic2011.diegm.uniud.it


Scope of the Conference
=======================

The Metaheuristics International Conference (MIC) series was established
in 1995 and this is its 9th edition. MIC is the main event focusing on the
progress of the area of metaheuristics and their applications. As in
previous editions, MIC 2011 will provide an opportunity to the
international research community in metaheuristics to discuss recent
research results, to develop new ideas and collaborations, and to meet old
and make new friends in a friendly and relaxed atmosphere.
Presentations covering all aspects of metaheuristic research such as new
algorithmic developments, high-impact applications, new research
challenges, theoretical developments, implementation issues, and in-depth
experimental studies are welcome. MIC 2011 strives for a high-quality
program that will be completed by a number of invited talks, tutorials,
and special sessions.

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

MIC 2011 solicits contributions dealing with any aspect of metaheuristics.
Typical, but not exclusive, topics of interest are:

+ Metaheuristic techniques such as tabu search, simulated annealing,
iterated local search, variable neighborhood search, memory-based
optimization, dynamic local search, evolutionary algorithms, memetic
algorithms, ant colony optimization, variable neighborhood search,
particle swarm optimization, scatter search, path relinking, etc.

+ Techniques that enhance the usability and increase the potential of
metaheuristic algorithms such as reactive search mechanisms for
self-tuning, offline metaheuristic algorithm configuration techniques,
algorithm portfolios, parallelization of metaheuristic algorithms, etc.

+ Empirical and theoretical research in metaheuristic including
large-scale experimental analyses, algorithm comparisons, new experimental
methodologies, engineering methodologies for stochastic local search
algorithms, search space analysis, theoretical insights into properties of
metaheuristic algorithms, etc.

+ High-impact applications of metaheuristics in fields such as
bioinformatics, electrical and mechanical engineering, telecommunications,
sustainability, business, scheduling and timetabling. Particularly welcome
are innovative applications of metaheuristic algorithms that have a
potential of pushing research frontiers.

+ Contributions on the combination of metaheuristic techniques with
those from other areas, such as integer programming, constraint
programming, machine learning, etc.

+ Challenging applications areas such as continuos, mixed
discrete-continuous, multi-objective, stochastic, or dynamic problems.


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

Submission deadline March 6, 2010
Notification of acceptance May 13, 2010
Camera ready copy May 27, 2010
Early registration June 6, 2010
Conference July 25-28, 2010


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


We will accept submissions in three different formats.

S1) Original research contributions for publication in the conference
proceedings of a maximum of 10 pages

S2) Extended abstracts of work-in-progress and position papers on a
important research aspect of a maximum of 3 pages

S3) High-quality manuscripts that have recently, within the last six
months, been submitted or accepted for journal publication


Accepted contributions of categories S1 and S2 will be published in the
MIC 2011 conference proceedings. The proceedings will have an ISBN number.
Accepted contributions of category S3 will be orally presented at the
conference, but not be included into the conference proceedings (neither
in the post-conference proceedings). The submission server will be
available in January 2011.


Post-conference Publication
==========================

It has become a tradition of MIC conferences to publish post-conference
proceedings in an edited book. Authors of accepted papers in categories S1
and S2 (see submission details) are invited to submit improved and
extended versions of their conference papers for publications in the MIC
2011 post-conference volume. The post-conference volume will appear in the
Operations Research / Computer Science Interfaces series of Springer
Verlag (confirmation pending).


Best Paper Award
================

A best paper award will be presented at the conference. Only papers
submitted in category S1 will be eligible for the best paper award.


Special Sessions
================

The conference will integrate a number of special sessions. Currently
confirmed are the following.

- Dynamic Optimization, organized by Amir Nakib and Patrick Siarry
- Matheuristics, organized by Karl Doerner, Vittorio Maniezzo, Celso Ribeiro, and Stefan Voss
- Metaheuristics for real production planning and scheduling, organized by Ruben Ruiz
- Metaheuristics in Health Care Management and Services, organized by Ana Viana and Abdur Rais
- Methodologies for Heuristic Multi-Objective Optimization organized by Walter Gutjahr and Frank Neumann
- Quadratic Binary Programs, organized by Fred Glover, Jin-Kao Hao, and Gary Kochenberger

The submission to the special sessions will be through the same submission
site as for the main conference. For submission details and paper
categories, we refer to the main submission information.


Conference Location
===================

The conference will be held in Udine, Italy. The conference site is
Palazzo Antonini, the main site of the University of Udine. This is a 16th
century palace in the city center of Udine.


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

Up-to-date information will be published on the web site
http://mic2011.diegm.uniud.it. For information about local arrangements,
registration forms, etc., please refer to the above-mentioned web site or
contact the local organizers at the address below.


Conference Address
==================

MIC 2011 Organization
Luca Di Gaspero / Andrea Schaerf
DIEGM, University of Udine
via delle Scienze 208
33100 Udine, Italy
http://mic2011.diegm.uniud.it
mic2011@uniud.it
Fax: +39 0432 55 8251

MIC 2011 Conference Committee
==============================


Technical Program Chairs
Andrea Schaerf
Luca Di Gaspero
Thomas Stuetzle

Local organization
Sara Ceschia
Raffaele Cipriano
Luca Di Gaspero
Mirko Loghi
Andrea Schaerf
**********************************************************
*
* 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, September 21, 2010

[DMANET] Call for papers: ANALCO'11

NEWS:

The submission server is now available at:
http://www.easychair.org/conferences/?conf=analco11

Deadline for submissions: Monday October 4.

Invited Speaker: Robert Sedgewick (Princeton)

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

Call for papers:


ANalytic ALgorithmics and COmbinatorics -- ANALCO'11
San Francisco, California, USA
January 22, 2011
http://www.siam.org/meetings/analco11/


Description
===========

The Workshop on Analytic Algorithmics and Combinatorics
(ANALCO'11) will be held on January 22, 2011, at the
Holiday Inn San Francisco Golden Gateway, San Francisco,
California, USA.

The aim of the ANALCO workshop is to provide a forum for
the presentation of original research in the analysis of
algorithms and associated combinatorial structures. We
invite both papers that study properties of fundamental
combinatorial structures that arise in practical
computational applications (such as permutations, trees,
strings, tries, and graphs) and papers that address the
precise analysis of algorithms for processing such
structures, including: average-case analysis; analysis
of moments, extrema, and distributions; probabilistic
analysis of randomized algorithms, and so on.

Submissions that present significant new information
about classic algorithms are welcome, as are new analyses
of new algorithms that present unique analytic challenges.
We also invite submissions that address tools and techniques
for the analysis of algorithms and combinatorial structures,
both mathematical and computational.

This workshop is co-located with the ACM-SIAM Symposium
on Discrete Algorithms -- SODA'11:
http://www.siam.org/meetings/da11/
and will take place the day preceding that conference.
The workshop is also co-located with the Workshop on
Algorithm Engineering and Experimentation -- ALENEX11:
http://www.siam.org/meetings/alenex11/
and will take place on the same day. Since researchers
in both fields are approaching the problem of learning
detailed information about the performance of particular
algorithms, we expect that interesting synergies will
develop.

Registrants from either workshop will be cross-registered
with the other. Proceedings of ALENEX and ANALCO will
be available online in January 2011.

A paper that has been reviewed and accepted for
presentation at SODA is not eligible for submission to
ANALCO. We recognize, however that some research projects
spawn multiple papers that elaborate on different aspects
of the work and are willing to respond to inquiries about
SODA, ALENEX, and ANALCO papers that may overlap. Papers
of interest to both the ALENEX and the ANALCO communities
are particularly encouraged. Such papers may be submitted
to either workshop and will, as appropriate, be presented
in a joint session. The ANALCO workshop is supported by
SIAM (Society for Industrial and Applied Mathematics).


Important Deadlines
===================

SUBMISSION DEADLINE
October 4, 2010

PRE-REGISTRATION DEADLINE
December 20, 2010

HOTEL RESERVATION DEADLINE
December 20, 2010


Paper Submission
================

Papers should be submitted (in .pdf form) using the page:

http://www.easychair.org/conferences/?conf=analco11


Program Committee
=================

Philippe Flajolet (Co-chair), INRIA Rocquencourt, France
Daniel Panario (Co-chair), Carleton University, Canada

Luc Devroye, McGill University, Canada
Eric Fusy, Ecole Polytechnique, France
Zhicheng (Jason) Gao, Carleton University, Canada
Michael T. Goodrich, University of California - Irvine, USA
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Manuel Lladser, The University of Colorado, USA
Colin McDiarmid, University of Oxford, England
Marni Mishna, Simon Fraser University, Canada
Markus Nebel, University of Kaiserslautern, Germany
Brigitte Vallee, Universite de Caen, France


Invited Speaker
===============

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

Call for Workshop Proposals (RDP 2011, Novi Sad)

Federated Conference on Rewriting, Deduction, and Programming
RDP 2011
29/5/2011 - 3/6/2011, Novi Sad, Serbia

http://www.rdp2011.uns.ac.rs/

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

Call for Workshop Proposals

RDP 2011 is a federated event comprising two major conferences:
- The 22nd International Conference on Rewriting Techniques and
Applications , RTA 2011
- The 10th International Conference on Typed Lambda Calculi and
Applications, TLCA 2011.

Previous RDPs were held in 2003 in Valencia (Spain), 2004 in Aachen
(Germany), 2005 in Nara (Japan), 2007 in Paris (France) and 2009 in
Brasilia (Brasil). RDP has a tradition of federating every two years
RTA and TLCA, and of hosting related workshops.

We solicit proposals for satellite workshops of RDP 2011 that are
related in topics to one or both of the RDP conferences.

Workshops should have a length of 1 or 2 days (possibilities for
longer workshops should be discussed with the organizers). It is
tradition at RDP that attendance to workshops is open to participants
of parallel events, similar to the way FLoC workshops are run. There
will be one day (Sunday, May 29, 2011) reserved for workshops,
however, it will also be possible to run workshops on the other days
in parallel to one of the main conferences.

RDP will provide the possibility to print workshop proceedings,
details of the procedure will be posted later by the local organizing
committee. RDP will not be able to reimburse invited workshop speakers
for travel or living expenses, though it may be possible to waive part
of the registration fees for invited speakers. The priority of RDP
will be to keep registration fees for the conferences and workshops
low.

Please submit your workshop proposal by email to

rdp2011-workshop@uns.ac.rs

Proposals should be written in plain text. The proposal should cover
the following topics:

1. Name of workshop
2. A statement of the topics and goals of the workshop
3. Names and addresses of the organizers
4. Pointers to descriptions of previous editions of the workshop, if
any
5. A description of the submission selection process
6. Plans for the publication of proceedings (informal proceedings
distributed to participants, electronic journal, proceedings with
separate selection process, ...)
7. Plans for invited speakers or special sessions (round-table
discussion, tutorials, ...)
8. Expected length of the workshop
9. Expected number of attendees
10. Any special needs (for system demonstrations ...)

Workshop Selection Committee:

Luke Ong (TLCA 2011 program chair)
Manfred Schmidt-Schauss (RTA 2011 program chair)
Silvia Ghilezan (RDP 2011 general chair).

Important Dates
-------------------------------------------------------
|November 19, 2010 | deadline for proposals |
-------------------------------------------------------
|November 30, 2010 | notification of acceptance |
-------------------------------------------------------

Prospective workshop organizers are welcome to contact the workshop
selection committee in advance before sending in a formal submission
and to discuss any questions.

RDP'09 http://rdp09.cic.unb.br/
RDP'07 http://www.lsv.ens-cachan.fr/rdp07/index.html
RDP'05 http://www.kurims.kyoto-u.ac.jp/rdp05/
RDP'03 http://www.dsic.upv.es/~rdp03/
RTA http://rewriting.loria.fr/rta/
TLCA http://www.mimuw.edu.pl/tlca/

---

Monday, September 20, 2010

[DMANET] 10 PhD student positions in Computational Logic at Vienna University of Technology

The Vienna University of Technology (TU Wien) is offering 10 PhD
student positions within the doctoral program

"Mathematical Logic in Computer Science"

which is launched in Fall 2010; five of the positions are reserved for
female applicants.

The program is jointly organized by the faculties of Informatics,
Mathematics, and Physics, with a strong emphasis on Logic in Computer
Science; computational logic is one of the priority research areas of
the Faculty of Informatics.

TU Wien has a strong international reputation in various fields
targeted in the program, including

* Logic in Databases,
* Computer Aided Verification,
* Constraint Satisfaction and Satisfiability,
* Knowledge Representation and Reasoning,
* Finite Model Theory,
* Quantum Information and Recursion Theory,
* Proof Theory and Automated Deduction,
* Many Valued and Fuzzy Logic,
* Complexity Theory,
* Set Theory.

The program is interdisciplinary and fosters the application of
Mathematical Logic to Computer Science; two envisaged key application
areas are

* Model-Based Design and Verification,
* Advanced Information Systems.

The faculty of the program consists of M. Baaz, A. Ciabattoni,
T. Eiter (coordinator), M. Goldstern, G. Gottlob (associated),
A. Leitsch, R. Pichler, K. Svozil, S. Szeider, H. Veith and
S. Woltran.

Candidates must have an MSc or equivalent degree in
Computer Science, Mathematics or related fields, and an excellent
record of study. They should have solid basic knowledge in logic,
discrete mathematics, and computer science; knowledge in
fields targeted in the program is desired.

Each PhD student position is funded for three years (regular
employment contract with full social benefits). The yearly salary ranges
from a minimum of 12,724 Euro to 25,915 Euro before taxes, depending
on cofunding via associated projects.

Applications are solicited starting immediately, and will be
considered starting from September 10, 2010, until all positions are
filled, but no longer than March 15, 2011.

Further details about the program and the application procedure are
available at http://www.dbai.tuwien.ac.at/drkolleg/.

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

Sunday, September 19, 2010

Ernst Specker Colloquium, ETHZ Zurich

Colloquium in Honour of Ernst Specker in the Year of his 90th Birthday
----------------------------------------------------------------------
October 29-30, 2010
Department of Mathematics
ETHZ, Zurich, Switzerland

Official website and registration:
http://www.fim.math.ethz.ch/activities/colloquium_specker/

More background information about E. Specker:
http://www.cs.technion.ac.il/~janos/specker-90/

Topics will cover recent developments topics of E. Specker's work.
In particular:
* Recursive analysis
* Combinatorics
* Model theory
* Set theory
* Complexity theory
* Quantum theory and quantum computing

Confirmed speakers:
* A. Blass (University of Michigan, USA),
* E. Fischer (Technion-Israel Institute of Technology, Israel),
* J. Flum (University of Freiburg, Germany),
* M. Fuerer (The Pennsylvania State University, USA)
* H. Gaifman (Columbia University, New York, USA)
* E. Graedel (RWTH Aachen, Germany)
* N. Hungerbuehler (University of Fribourg und ETH Zurich, Switzerland)
* R. Kossak (CUNY, New York, USA)
* K. Tent (University of Muenster, Germany)
* S. Wolf (ETH Zurich, Switzerland)
* M. Ziegler (University of Freiburg, Germany)

[DMANET] VOCAL 2010: Call for papers

CALL FOR PARTICIPATION:

The Veszprém Optimization Conference: Advanced Algorithm
(VOCAL-2010)
December 13-15, Veszprém, Hungary
http://www.dcs.vein.hu/vocal/

The Veszprém Optimization Conference: Advanced Algorithms will be held
at the Regional Center of the Hungarian Academy of Sciences in Veszprém
(VEAB <http://www.veab.mta.hu/vrchas.html>), Hungary,
December 13-15, 2010.

The conference will be hosted by the Faculty
of Information Technology, Pannon University.

SCOPE: The VOCAL conference focuses on recent advances on optimization
algorithms: continues and discrete; complexity and convergence
properties, high performance optimization software and novel
applications are reviewed as well. We aim to bring together researchers
from both the theoretical and applied communities in the framework of a
medium-scale event.

INVITED TALKS
Distinguished researchers will give featured invited talks on topics
of wide interest. Confirmed invited speakers include:

Panos M. Pardalos, University of Florida
Georg Pflug, University of Vienna
Stratos Pistikopoulos, Imperial College, London
Michael Ulbrich, Technische Universität München
Henry Wolkowicz, University of Waterloo

CONTRIBUTED TALKS
Each accepted paper will be allotted a 25 minutes talk. Authors wishing
to speak should submit an abstract via the conference WEB page by
September 30, 2010.

Deadline for abstract submission: September 30, 2010.
Notification of acceptance / Program available October 30 2010.
Deadline for early registration: October 30, 2010.
Conference begins on December 13 at 7:30 a.m.
and ends December 15 at 6:00 p.m., 2010.

On behalf of the Organizing Committee
Tamás Terlaky, terlaky@lehigh.edu (PC Chair, Lehigh University)
Ferenc Friedler (OC Chair, U. of Pannonina)
Please send enquiries to: Botond Bertok <bertok@dcs.vein.hu>

**********************************************************
*
* 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] Faculty positions @ ISE-Lehigh

Department of Industrial and Systems Engineering
Lehigh University, Bethlehem, PA

The department invites applications for two faculty positions, one
tenure-track at the Assistant Professor level and one at the level of
Full or Associate Professor. We welcome applications from individuals
with strong backgrounds in any ISE-relevant discipline, including
industrial engineering, operations research, systems engineering, and
computer science. Candidates for the junior position with strength in
Large Scale Computational Optimization that utilizes high-performance
computing and/or expertise in energy, healthcare, bioinformatics, or
similar application areas are especially encouraged to apply. Candidates
for the senior position with strengths in healthcare, bioinformatics,
bioengineering or similar application areas are especially encouraged to
apply. The candidate must demonstrate a strong commitment to
undergraduate and graduate education, conduct an active research program
with strong external support, and be willing to explore
interdisciplinary research opportunities within the college and university.

Established in 1926, the ISE Department currently has 17 full-time
faculty members, about 150 undergraduate and 165 graduate students, 40
of whom are Ph.D. students. We offer comprehensive research and
education programs at the B.S., M.S., and Ph.D. levels. The ISE faculty
maintains an outstanding international reputation in a variety of
research areas. Active research topics include discrete optimization,
non-linear optimization, interior point methods, conic linear
optimization, high performance computing, financial optimization,
telecommunications, and a variety of topics in logistics and supply
chain analysis.

Review of applications for the junior position will begin December 1,
2010 and will continue until the positions are filled. Review of
applications for the senior position will be done on a rolling basis and
will continue until the position is filled. Please visit our department
web site www.Lehigh.edu/ise and follow the appropriate application
submission link. The application should include a cover letter, a
statement of research and teaching interests, a curriculum vita, names
and addresses of at least three references, and representative research
paper(s). Inquiries about the senior position may be addressed to Prof.
Ted Ralphs, Ted@Lehigh.edu and for the junior position to Prof. Robert
Storer RHS2@Lehigh.edu.


--
********************************************************
Tamás Terlaky, George N. and Soteria Kledaras '87 Endowed Chair Professor.
Chair, Department of Industrial and Systems Engineering
P.C. Rossin College of Engineering and Applied Science
Lehigh University, Harold S. Mohler Laboratory
200 West Packer Avenue, Bethlehem, PA 18015-1582
Phone: (610) 758-4050
Email: terlaky@lehigh.edu
Fax: (610) 758-4886
http://www.lehigh.edu/~tat208
http://www.lehigh.edu/~inime
***********************************************************

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

[DMANET] PhD scholarships available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities offers

several SCHOLARSHIPs

for Ph.D. Studies starting Oktober 15th, 2010 or later (subject to
further funding by DFG).

The scholarships are 1350 EUR (tax-free) per month - according to DFG
rules. They are usually granted as 2-year fellowships, extendible by a
third year.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools, regular predoc programs, etc. -
all this in a very lively Berlin discrete mathematics context, which
also includes the DFG Research Center MATHEON (http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for
the "Phase II" part of BERLIN MATHEMATICAL SCHOOL
(http://www.math-berlin.de), the joint international graduate program of
the three major Berlin universities - which has a lot to offer! Students
of the MDS program may apply to be members of the BERLIN MATHEMATICAL
SCHOOL.

Applicants for Ph.D. scholarships are expected to have a
Diploma/Master's degree or equivalent, usually in Mathematics or
Computer Science. Applications for scholarships starting in 2010
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Dr. Martin Skutella, deputy Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 5-2
TU Berlin
D-10623 Berlin, Germany

email: martin.skutella@tu-berlin.de
http://www.math.tu-berlin.de/~skutella/
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Applications by email are welcome. If you have applied to BERLIN
MATHEMATICAL SCHOOL Phase II, then please just inform us about this -
there is no need to submit your materials again.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Saturday, September 18, 2010

WALCOM 2011 (Workshop on Algorithms and Computation) Call for Papers (Submission Deadline Extended till Oct 1)

CALL FOR PAPERS

    Workshop on Algorithms and Computation 2011 (WALCOM 2011)
    http://www.cse.iitd.ac.in/~amitk/walcom/


       The Workshop on Algorithms and Computation (WALCOM) is intended to provide an international forum for researchers working in the areas of algorithms and computation. WALCOM 2011 will be held on February 18-20, 2011 at New Delhi, India.

SCOPE
       The range of topics within the scope of the workshop of algorithms and computation includes (but is not limited to):

             Approximation Algorithms
             Combinatorial Algorithms
             Computational Biology
             Computational Geometry
             Data Structures
             Graph Algorithms
             Graph Drawing
             Parallel and Distributed Algorithms
             Parameterized Complexity
             Network Optimization
             Online Algorithms
             Randomized Algorithms
             String Algorithms

CALL FOR PAPERS
       Authors are invited to submit papers (extended abstracts) describing original research of theoretical or practical significance to algorithms and computation. Papers should not exceed 12 pages for long papers and 6 pages for short papers in  LNCS style.  Papers must be labeled as either long or short and prepared using LaTex / LaTex2e.  If the authors feel that more details are essential to substantiate the main claim of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. Only electronic submission will be allowed.

PROCEEDINGS
       Accepted submissions will be published in the conference proceedings, which will be included in the Springer-Verlag series Lecture Notes in Computer Science.

VENUE

    The workshop will be held in India International Center, New Delhi. The workshop will be organized by Indian Institute of Technology and Faculty of Sciences, Delhi University.

IMPORTANT DATES
  Paper Submission : October 1, 2010
  Notification of Acceptance/Rejection : November 16, 2010
  Cameraready version due : November 30, 2010
  Workshop : February 18-20, 2011

PROGRAM COMMITTEE

Naoki Katoh (Kyoto University,Japan) -- co-chair
Amit Kumar (IIT Delhi, India) -- co-chair
Takehiro Ito (Tohoku University, Japan)
Khaled Elbassioni (Max-Planck Institute, Saarbrucken, Germany)
Anupam Gupta (CMU, USA)
Yogish Sabharwal (IBM India Research Lab, India)
Takeaki Uno (National Institute of Informatics, Japan)
Tetsuo Shibuya (University of Tokyo, Japan)
Ovidiu Daescu (UT Dallas, USA)
Hirotaka Ono (Kyushu University, Japan)
Kasturi Varadarajan (Iowa, USA)
Stefan Langerman (Université libre de Bruxelles, Belgium)
Subhas Nandy (ISI Kolkata, India)
Friedrich Eisenbrand (EPFL, Switzerland)
Kamesh Munagala (Duke, USA)
Hee-Kap Ahn (Pohang University, Korea)
Seokhee Hong (University of Sydney, Australia)
Yoshio Okamoto (Tokyo Institute of Technology, Japan)
Jinhui Xu (SUNY Buffalo, USA)
Rudolf Fleischer (Fudan University, China)
Sohel Rahman (Bangladesh University, Bangladesh)

ORGANIZING COMMITTEE
Neelima Gupta (University of Delhi)
Naveen Garg (IIT Delhi)
Vasudha Bhatnagar (University of Delhi)
Naveen Kumar (University of Delhi)
Manisha Bansal (University of Delhi)

CONTACT DETAILS

Prof. Naoki Katoh
Dept. of Architecture and Architectural Systems
Graduate School of Engineering
Kyoto University, Japan
E-mail: naoki@archi.kyoto-u.ac.jp


Dr. Amit Kumar
Department of Computer Science and Engineering
IIT Delhi
New Delhi, India - 110016
Email: amitk@cse.iitd.ac.in

[DMANET] WALCOM 2011 (submission deadline extended to Oct 1, 2010)

*submission deadline extended to Oct 1, 2010*

Call for Papers
Workshop on Algorithms and Computation 2011 (WALCOM 2011)
http://www.cse.iitd.ac.in/~amitk/walcom/


The Workshop on Algorithms and Computation (WALCOM) is intended
to provide an international forum for researchers working in the areas
of algorithms and computation. WALCOM 2011 will be held on February
18-20, 2011 at New Delhi, India.

SCOPE
The range of topics within the scope of the workshop of
algorithms and computation includes (but is not limited to):

Approximation Algorithms
Combinatorial Algorithms
Computational Biology
Computational Geometry
Data Structures
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms

CALL FOR PAPERS
Authors are invited to submit papers (extended abstracts)
describing original research of theoretical or practical significance to
algorithms and computation. Papers should not exceed 12 pages for long
papers and 6 pages for short papers in LNCS style. Papers must be
labeled as either long or short and prepared using LaTex / LaTex2e. If
the authors feel that more details are essential to substantiate the
main claim of the paper, they may include a clearly marked appendix that
will be read at the discretion of the program committee. Only electronic
submission will be allowed.

PROCEEDINGS
Accepted submissions will be published in the conference
proceedings, which will be included in the Springer-Verlag series
Lecture Notes in Computer Science.

VENUE

The workshop will be held in India International Center, New
Delhi. The workshop will be organized by Indian Institute of Technology
and Faculty of Sciences, Delhi University.

IMPORTANT DATES
Paper Submission : October 1, 2010
Notification of Acceptance/Rejection : November 16, 2010
Cameraready version due : November 30, 2010
Workshop : February 18-20, 2011

PROGRAM COMMITTEE

Naoki Katoh (Kyoto University,Japan) -- co-chair
Amit Kumar (IIT Delhi, India) -- co-chair
Takehiro Ito (Tohoku University, Japan)
Khaled Elbassioni (Max-Planck Institute, Saarbrucken, Germany)
Anupam Gupta (CMU, USA)
Yogish Sabharwal (IBM India Research Lab, India)
Takeaki Uno (National Institute of Informatics, Japan)
Tetsuo Shibuya (University of Tokyo, Japan)
Ovidiu Daescu (UT Dallas, USA)
Hirotaka Ono (Kyushu University, Japan)
Kasturi Varadarajan (Iowa, USA)
Stefan Langerman (Université libre de Bruxelles, Belgium)
Subhas Nandy (ISI Kolkata, India)
Friedrich Eisenbrand (EPFL, Switzerland)
Kamesh Munagala (Duke, USA)
Hee-Kap Ahn (Pohang University, Korea)
Seokhee Hong (University of Sydney, Australia)
Yoshio Okamoto (Tokyo Institute of Technology, Japan)
Jinhui Xu (SUNY Buffalo, USA)
Rudolf Fleischer (Fudan University, China)
Sohel Rahman (Bangladesh University, Bangladesh)

ORGANIZING COMMITTEE
Neelima Gupta (University of Delhi)
Naveen Garg (IIT Delhi)
Vasudha Bhatnagar (University of Delhi)
Naveen Kumar (University of Delhi)
Manisha Bansal (University of Delhi)

CONTACT DETAILS

Prof. Naoki Katoh
Dept. of Architecture and Architectural Systems
Graduate School of Engineering
Kyoto University, Japan
E-mail: naoki@archi.kyoto-u.ac.jp


Dr. Amit Kumar
Department of Computer Science and Engineering
IIT Delhi
New Delhi, India - 110016
Email: amitk@cse.iitd.ac.in

--
Naveen Garg
Computer Sc.& Engg
IIT Delhi

**********************************************************
*
* 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, September 17, 2010

[DMANET] CFP: CISched'2011 - 2011 IEEE Symposium on Computational Intelligence in Scheduling

************* CISched'2011 Call for Papers *************
2011 IEEE Symposium on "Computation Intelligence in Scheduling"
April 11 - 15, 2011 Paris, France
http://www.ieee-ssci.org/2011/cisched-2011

The 2011 IEEE Symposium on Computational Intelligence in Scheduling
(CI-Sched 2011) invites research on all aspects of computational
intelligence applied to scheduling problems. Due to their huge search
spaces that have to be explored, scheduling problems cannot usually be
solved by exact approaches. Therefore, significant research attention
has been attracted on exploring techniques in Computational Intelligence
(including evolutionary computation, neural networks, swarm
intelligence, fuzzy logic, and their hybridizations, etc.). This
symposium aims to explore recent advances in this area.

Topics include, but are not limited to, the following:
* Computational Intelligence in:
o Production Scheduling
o Personnel Scheduling
o Sports Scheduling
o Educational Timetabling
o Commercial Scheduling packages
o Transport Scheduling
o Other scheduling problems
* Complexity Issues in scheduling
* Comparison of Techniques (e.g. compare Neural Networks with Fuzzy
Logic; comparison of a meta-heuristic approach with a CI approach)
* Interactive Scheduling using Computational Intelligence
* Experiences of CI within Scheduling
* Case Studies
* Theoretical or empirical analysis of evolutionary algorithms and
representations for scheduling

/*Symposium Co-Chairs*/

Rong Qu, University of Nottingham, UK
Ender Ozcan, University of Nottingham, UK
Michel Gendreau, cole Polytechnique de Montral, Canada

/*Important Dates*/

Paper Submission Due: October 31, 2010
Notification to Authors: December 15, 2010
Camera-Ready Papers Due: January 15, 2011

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

[DMANET] ORAHS 2010: Post conference pubblications

*** Apologies for multiple/cross postings ***

In the following, some details about ORAHS 2010 post conference
publications. To keep in touch, see the web page:
http://orahs2010.diem.unige.it

Please note that submissions are open not only to ORAHS 2010 participants
but to all researchers interested in the area of healthcare management.

Sincerely, Roberto Aringhieri

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

1) Special Issue "Computers & Operations Research"

All researchers could consider to submit a full paper for publication in th
e COR special issue titled "OR for health care delivery".
The call for paper is downloadable from http://www.elsevier.com/framework_p
roducts/promis_misc/cfp_cor_healthservices.pdf

These papers will be reviewed under a normal reviewing process (see
http://www.elsevier.com/wps/find/journaldescription.cws_home/300/authorinst
ructions for authors guidelines and instructions)

Submission Deadline: 20 December 2010.
Decision of acceptance and approximate pubblication: June 2011.

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

2) "Springer" Volume

The collective book published by Springer will include papers on the best a
dvances on the topics object of the conference, with
a particular attention to real applications.
Contributions to the book are open to all researchers, not only attendants
to the conference, and will be blind reviewed before
pubblication. More information and authors guidelines will follow soon.

Submission Deadline: 28 February 2011.
Approximate decision of acceptance May 2011.
Approximate pubblication: November/December 2011.

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

Dr Roberto Aringhieri, Ph.D. - Assistant Professor
Dipartimento di Informatica, Universite degli Studi di Torino
Corso Svizzera 185, I-10149 Torino, Italy
Office: +39 011 6706755 - Mobile: +39 331 1239026
WWW: http://www.di.unito.it/~aringhie
LinkedIn: http://www.linkedin.com/in/robertoaringhieri
Facebook: http://www.facebook.com/roberto.aringhieri
**********************************************************
*
* 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/
*
**********************************************************

Multidisciplinary University Research Initiative (MURI)

Full Announcement

The MURI program supports basic science and/or engineering research at U.S. institutions of higher education (hereafter referred to as "universities") that is of potential interest to DoD. The program is focused on multidisciplinary research efforts that intersect more than one traditional science and engineering discipline to address scientific issues of interest to the DoD. As defined by the DoD, “basic research is systematic study directed toward greater knowledge or understanding of the fundamental aspects of phenomena and of observable facts without specific applications towards processes or products in mind. It includes all scientific study and experimentation directed toward increasing fundamental knowledge and understanding in those fields of the physical, engineering, environmental, and life sciences related to long-term national security needs. It is farsighted high payoff research that provides the basis for technological progress.” (http://comptroller.defense.gov/fmr/02b/02b_05.pdf).

The DoD’s basic research program invests broadly in many specific fields to ensure that it has early cognizance of new scientific knowledge.

The FY 2011 MURI competition is for the topics listed below. Detailed descriptions of the topics can be found in Section VIII entitled, “Specific MURI Topics”, of the BAA. The detailed descriptions are intended to provide the proposer a frame of reference and are not meant to be restrictive to the possible approaches to achieving the goals of the topic and the program. Innovative ideas addressing these research topics are highly encouraged.

White papers and full proposals addressing the following topics (1) through (10) should be
submitted to The Office of Naval Research:

(1) Soil Blast Modeling and Simulation
(2) Knowledge Representation and Reasoning for Decentralized Autonomy
(3) III-Nitride Terahertz Electronics – Scaling Strategies beyond Silicon
(4) Charge Transport in DNA Molecular Wire
(5) Coupled Human-landscape Interactions in Low-lying Coastal Environments
(6) Integrated Oceanographic, Atmospheric, and Acoustic Physics
(7) Improved Meteorlogical Modeling in Mountainous Terrain
(8) Bacterial or Cellular Controllers for Device Autonomy
(9) Nanoscience – based High-speed Fabrication of Full Function Hybrid Flexible Electronic Systems
(10) Atomic-scale Interphases: Exploring New Material States

White papers and Full proposals addressing the following topics (11) through (17) should be submitted to the Air Force Office of Scientific Research (AFOSR):

(11) Nanofabrication of Tunable 3D Nanotube Architectures (2 proposals)
(12) Quantum Memories and Light-Matter Interfaces (2 proposals)
(13) Biomolecule-Directed Assembly of Nanostructures
(14) Nanostructural Control of Thermal and Electrical Transport Properties
(15) Investigation of 3-D Hybrid Integration of CMOS/Nanoelectronic Circuits
(16) Science of Cyber Security
(17) Large Scale Integrated Hybrid Nanophotonics

White papers and full proposals addressing the following topics (18) through (25) should be submitted to the Army Research Office (ARO):

(18) Controlling the Abiotic/Biotic Interface
(19) Quantum Stochastics and Control
(20) Qubit Enabled Imaging, Sensing & Metrology (QuISM)
(21) Flex-Activated Materials
(22) Game Theory for Adversarial Behavior
(23) Light filamentation
(24) Novel Free-Standing 2D Crystalline Materials (Oxides/Nitrides)
(25) Value of Information for Distributed Data Fusion

Proposals from a team of university investigators may be warranted because the necessary expertise in
addressing the multiple facets of the topics may reside in different universities, or in different departments in the same university. By supporting multidisciplinary teams, the program is complementary to other DoD basic research programs that support university research through single-investigator awards. Proposals shall name one Principal Investigator (PI) as the responsible technical point of contact. Similarly, one institution shall be the primary awardee for the purpose of award execution. The PI shall come from the primary institution. The relationship among participating institutions and their respective roles, as well as the apportionment of funds including sub-awards, if any, shall be described in both the proposal text and the budget.

[DMANET] TAPAS 2011, Call for Papers

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

SCOPE
-----

In the light of continuously increasing interaction between communication
and computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility, routing,
cooperation, capacity planning, scheduling, and power control. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. 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.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

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

* Paper submission due: October 24, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

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

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universität Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universität Köln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

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

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)

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

TAPAS 2011, Call for Papers

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

SCOPE
-----

In the light of continuously increasing interaction between communication
and computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility, routing,
cooperation, capacity planning, scheduling, and power control. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. 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.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

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

* Paper submission due: October 24, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

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

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universität Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universität Köln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

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

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)

[DMANET] WoWMoM 2011: Call for Workshop proposals

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

CALL FOR WORKSHOP PROPOSALS

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

http://wowmom2011.imtlucca.it/

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

June 20-24, 2011
Lucca, Tuscany, Italy

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

The next IEEE International Symposium on a World of Wireless, Mobile
and Multimedia Networks (IEEE WoWMoM 2011) will be the 12-th event in
its series. This symposium intends to provide a definitive forum
for networking, software systems and multimedia research in the
wireless/mobile area involving both computer science and
electrical engineering communities.

The WoWMoM Organizing Committee invites proposals for *one-day*
workshops affiliated with the conference. The purpose of these
workshops is to provide a platform for presenting novel ideas in
a less formal and possibly more focused way than at the
conference itself. Affiliated workshops will be held prior to
the main conference. All papers included in the WoWMoM 2011 Workshops
will appear in the conference proceedings published by IEEE.
We expect all selected workshops to adhere to a common paper
submission and reviewing schedule as outlined in the dates indicated
below.

Workshops Proposals are solicited in all areas and topics pertaining to
wireless mobile and multimedia networking.
Workshops addressing emerging research directions in these areas
are highly welcome.

Each workshop proposal must include:
- The name of the workshop.
- The names, addresses, and a short bio of the organizers.
- 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 at this time.
- The names of potential program committee members.
- The planned format of the workshop, including a strategy to
facilitate lively discussions and attendees involvement.
- If applicable, a description of past versions of the workshop,
including dates, organizers, number of submitted and accepted
papers, number of attendees.
- If the workshop does not have any past editions,
an estimate of the expected number of submitted and accepted
papers, and of the expected number of attendees.
- A tentative call for papers.
- A description of the plans for publicity and workshop web site.

Workshop proposals should be submitted, no later than October 20, 2010,
by e-mail (in PDF format) with "WoWMoM 2011 Workshop Proposal" in the
subject, to *both* WoWMoM 2011 Workshop Co-Chairs (WSCC) at the address
wowmom2011WSCC@cs.unibo.it.

For any additional information please refer to us at the address above.

Luciano Bononi
Department of Computer Science, University of Bologna
Bologna, Italy

and

Albert Banchs
Department of telematics Engineering, University Carlos III of Madrid
Madrid, Spain

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

Workshop proposals submission deadline: October 20, 2010
Notification: November 5, 2010

suggested dates for the workshops schedule:
Papers due by: February 4, 2011
Paper selections due by: April 4, 2011

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

Thursday, September 16, 2010

[DMANET] Associate Professorship in Theory of Computation and Computational Complexity

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

Theory of Computation and Computational Complexity

Deadline: September 23, 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] Travel Grants for IEEE MASS 2010

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

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

TRAVEL GRANTS FOR 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

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


We are pleased to announce that IEEE MASS 2010 will provide a limited
number of travel grants thanks to the generosity of the National Science
Foundation and the IEEE Technical Committee on Distributed Processing and
Technical Committee on Simulation. Applications are to be submitted by
September 30, 2010. Application submissions must be done by e-mail and
supporting documents must be included as a single pdf attachment. Award
notifications will be sent out by Oct. 15, 2010. Travel by award
recipients will be supported on a reimbursement basis; awardees must
submit all reimbursement requests by Nov 22, 2010 including original
receipts. Submission of reimbursement requests must be done electronically
and supporting documents must be included as a single pdf document.


Student Travel Awards:
----------------------

A limited number of student travel grants to students from the United
States for up to $800 will be granted thanks to the generosity of the
National Science Foundation. Applications must be submitted by e-mail to
the General Chair, Dr. Katia Obraczka, E-mail:katia@cse.ucsc.edu, by
September 30, 2010. Applicants should provide a one page statement
explaining expected benefits of attending the conference (e.g., to their
current research, career, etc), a one page CV, the title of papers to be
presented including the list of authors, and a short letter of support
from the academic adviser. Award is limited to one per paper and each
awardee is required to register for the conference.

Travel Subsidiary for Researchers:
----------------------------------

A limited number of travel support of up to $500 is available to
researchers thanks to the generosity of the IEEE Technical Committee on
Distributed Processing and Technical Committee on Simulation. Applications
must be submitted by e-mail to the MASS Steering Committee Chair, Dr.
Dharma Agrawal, E-mail:dharmaagrawal@gmail.com by September 30, 2010.
Applicants should provide a one page statement concerning the expected
benefits of attending the conference, the title of papers to be presented
along with the list of authors, and reasons why support is needed. The
award is limited to one author per paper and priority will be given to
junior researchers. Each awardee is required to register for the
conference.
**********************************************************
*
* 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] Metaheuristics for Large Scale Problems

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE
PROBLEMS" at the 7th International Conference on Large Scale Scientific
Computation - LSSC'11, June 6 - 10, 2009, Sozopol, Bulgaria, with arrival:
June 5 and departure: noon June 10.

The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies (former
Institute for Parallel Processing), Bulgarian Academy of Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in Computer
Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2011
Notification of acceptance of the talks on the basis of the submitted
abstract
January 31, 2011
Deadline for submission of full papers
March 15, 2011
Notification of acceptance of full papers
April 30, 2011


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the results)
are to be written in standard LaTeX. The length of the contributed papers is
limited up to 8 pages. It is assumed that one participant will present not
more than one talk.

Send the abstracts and papers to special session organizers and conference
organizers, indicating the name of the special session. After sending the
abstract go to the conference web page and fill in the registration form
(personal data of the participants, minimum one per paper, and the name of
the special session).

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

Special session organizers
Assoc. Prof. Stefka Fidanova
Assist. Prof. Gabriel Luque

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

Tuesday, September 14, 2010

CFP: Network Protocols and Algorithms

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

Network Protocols and Algorithms

ISSN 1943-3581

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

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

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

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

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

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

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

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

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

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


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

[DMANET] Poste of Full Professor at LIPN

*** Apologies for multiple copies ***
========================================================================================================================================
Looking for candidates to a Full Professor position in Computer Science
specialized in Operation Research and/or Mathematical Programming
========================================================================================================================================

A Full Professor position is available at the University Paris 13
attached to the LIPN (Laboratory of Computer Science of Paris Nord) as
for research and attached to the Computer Science Departement of the
Galileo Institute as for teaching.

Knowledge of French is requested.

The application process is open, it closes on October 4, 2010.

Post 27 PR 0167
================
Profile : Computer Science
LIPN, Institut Galilée, Université Paris 13

Teaching Profile
================
The recruited professor will teach courses at the Computer Science
Department of the Galileo Institute of the University Paris 13.

Recherche Profile
=================

The LIPN (http://www-lipn.univ-paris13.fr/) wishes to reinforce
one of its 5 teams by recruiting a full professor. The teams are:
* Machine Learning & Applications (A3)
* Algorithms and Combinatorial Optimization (AOC)
* Combinatorial, Algorithmic and Interactions (CALIN)
* Logic, Calculation and Reasoning (LCR)
* Knowledge Management and Natural Language (RCLN)


OC group of LIPN
==========================
Contact : Roberto Wolfler Calvo, wolfler@lipn.univ-paris13.fr

The Combinatorial Optimization group (OC) of the AOC team (Algorithms
and Combinatorial Optimization) undertakes both fundamental theoretical
researches and industrial applications in Integer Programming and
Combinatorial Optimization. It consists today of a professor emeritus,
two full professors and six associate professors. The group handles the
traditional and strongly complementary approaches of Combinatorial
Optimization which are: mathematical programming, complexity, modeling,
graph theory, exact methods and metaheuristics. Research is articulated
around three axes:
- the definition of innovative solution methods in mathematical
programming (re-optimization, reformulation);
- the study of structural properties of the problems (decompositions and
relaxations, polyedral structure, approximation algorithms);
- the developement of exact and approximate methods for solving
real-life problems (as for example: planning and scheduling of
resources, logistics and vehicles routing, multimodal transport, design
of networks).

The group has a particular expertise in the development of mathematical
programming methods for the solution of very large scale problems. More
recently, it has developed original research axes within the framework
of collaborations with other fields such as data mining and mathematics.


Key words: combinatorial optimization, discrete applied mathematics,
integer programming, graph theory, polyhedral approaches, approximation,
robustness.


More information / further contacts
===================================

Information :
Laboratory : http://www-lipn.univ-paris13.fr
Institut : http://www-galilee.univ-paris13.fr/
Computer Science departement : http://www-lipn.univ-paris13.fr/~bennani/cdi

Contacts :
Chef of the laboratory : Christophe Fouqueré :
christophe.fouquere@lipn.univ-paris13.fr
Chef of the departement : Younès Bennani :
younes.bannani@lipn.univ-paris13.fr


For futher details on the postion (in french) :
http://www-lipn.univ-paris13.fr/~fouquere/Postes/

**********************************************************
*
* 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] Invitation to a special issue of Algorithmica on Exact and Parmeterized Computation

Dear Colleagues,


We are happy to inform you (as some of you already know) that Algorithmica
has accepted our request for a special issue on Parameterized and
Exponential Computation edited by both of us. This is going to contain
selected papers from IPEC 2010 apart from others.

In this context, we would like to invite you all to submit your papers
in the area of Parameterized and Exponential Computation to this issue.
The submission will go through the normal refereeing process of
Algorithmica.

The deadline for submissions is October 31, 2010. You can submit your
paper to the special issue of Algorithmica at

http://algo.edmgr.com/

If you do not have a username and password, please register
by clicking the REGISTER link at the top. Otherwise use your
regular username and password to login.

After selecting "author role" at the top, click on the link
"submit new manuscript" and choose the article type
"IPEC 2010 -- Saurabh & Raman" and click "Next".

Follow the instructions after that.

Best Regards,
Venkatesh Raman and Saket Saurabh
Guest Editors


----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

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

Second International Conference on Order, Algebra and Logics honoring Ralph McKenzie, Hiroakira Ono and Andrzej Wronski

====================================================================
FIRST ANNOUNCEMENT
====================================================================

SECOND INTERNATIONAL CONFERENCE ON ORDER ALGEBRA AND LOGICS

(Honoring Ralph McKenzie, Hiroakira Ono and Andrzej Wronski
on the occasion of their 70th Birthdays)

June 6-10, 2011

Jagiellonian University, Krakow, Poland
====================================================================

This meeting shares the goals of the conference with the same title,
held Nashville in June 2007, and continues the tradition of related
conferences in Prague, Novi Sad and Szeged.

Recent years have witnessed increased research activity on the
interface between logic and universal algebra. In particular, the use
of algebraic methods has proved to be fruitful in the study of
non-classical logics as well as in investigations related to the
constraint satisfaction problem. The purpose of the conference is to
bring together researchers from these fields to foster collaboration
and further research.

FEATURED AREAS
The featured areas include, but are not limited to, the following (in
alphabetical order):

- Algebraic logic
- Algorithmic problems in algebra
- Applications of universal algebra to logics
- Applications of universal algebra to the constraint satisfaction problem
- Complexity and other algorithmic problems
- Duality theory for algebraic structures
- Lattice theory
- Modal logics
- Non-classical logics
- Ordered algebraic structures
- Ordered sets
- Proof theory
- Residuated structures and substructural logics
- Tame congruence theory and applications
- Topological methods in algebra and logic


The scientific program consists of 50-minute plenary lectures, and
20-minute contributed talks.

INVITED SPEAKERS
- Libor Barto (Prague)
- Nikolaos Galatos (Denver)
- Mai Gehrke (Nijmegen)
- Keith Kearnes (Boulder)
- Tomasz Kowalski (Lisbon)
- Tadeusz Litak (Leicester)
- Petar Markovic (Novi Sad)
- Miklos Maroti (Szeged)
- Vicenzo Marra (Milan)
- George McNulty (South Carolina)
- George Metcalfe (Bern)
- Daniele Mundici (Florence)
- Kazushige Terui (Kyoto)
- Matthew Valeriote (Ontario)
- Ross Willard (Waterloo)

ADDITIONAL INFORMATION
Details regarding conference registration, submission of abstracts of
contributing talks, and local accommodations will be included in the
forthcoming second announcement.

ORGANIZERS
- Wieslaw Dziobiak, University of Puerto Rico, Mayaguez
- Pawel Idziak, Jagiellonian University
- Marcin Kozik, Jagiellonian University
- Constantine Tsinakis, Vanderbilt University

Monday, September 13, 2010

[DMANET] Postdoctoral Position in Algorithms (Berlin)

Postdoctoral Position in Algorithms
Humboldt University Berlin

A postdoctoral position in the area of efficient algorithms is available
in the Department of Computer Science at Humboldt University Berlin
under the direction of Prof. Susanne Albers.

The postdoc may pursue his/her own line of research but a research
interest in approximation and online algorithms, algorithmic game theory
or algorithm engineering is very welcome. Information about the
algorithms group at Humboldt University can be found at:
http://www2.informatik.hu-berlin.de/alkox/group/
There exist close collaborations with various other research groups in
Berlin, hosted at the Free University and the Berlin Institute of
Technology.

The position is supported by a grant of the German Research Foundation
and provides a competitive 12 month salary with standard benefits. The
appointment is initially for one year and can be renewed for a second
year subject to satisfactory progress and mutual agreement. The expected
start date of the position is January 2011.

The successful candidate should have a PhD degree in computer science or
mathematics. The application material should include (1) a cover letter
describing the interest in the position, (2) a CV and list of
publications, (3) a short research summary, and (4) the names and
contact information of at least two references. The material should be
sent electronically to <albers@informatik.hu-berlin.de>.

Applications will be reviewed starting from October 4, 2010 until the
position is filled.

Susanne Albers
Department of Computer Science
Humboldt University Berlin
Unter den Linden 6
10099 Berlin, Germany
E-mail: albers@informatik.hu-berlin.de
http://www2.informatik.hu-berlin.de/~albers/


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