Monday, February 22, 2010

[DMANET] European Journal of Operational Research

Call for Papers: Special issue of European Journal of Operational Research
on Operations Research in Health Care

Guest Editors:
Erwin Pesch, University of Siegen
Gerhard Woeginger, University of Eindhoven

Health care is a highly important application area for Operations Research.
It provides us with a wide range of problems and applications that are
suitable for attack through OR machinery. The spectrum of OR problems in
health care is continuously becoming wider.
The special issue of European Journal of Operational Research is dedicated
to the intersection area of Operations Research and Health Care. We
encourage high-level submissions that are firmly grounded on real life
applications, that develop new or apply known OR models and tools, and that
progress the field.
Especially papers presented during the last EURO conference in Bonn in 2009
are welcome.

Please submit your manuscript, which is written in English, as a PDF-file to
erwin.pesch@uni-siegen.de
Submission deadline: April 15, 2010
Decision about acceptance: Oct. 15, 2010

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

[DMANET] Call for papers: Special issue of FSM on LOGISTICS AND SUPPLY CHAIN

Special issue of FSM on LOGISTICS AND SUPPLY CHAIN

Editors:
Martin Grunow, TU Denmark, Lyngby, Denmark (grunow@man.dtu.dk),
Hans-Otto Günther, TU Berlin, Germany, (hans-otto.guenther@tu-berlin.de),
David Pisinger, TU Denmark, Lyngby, Denmark (pisinger@diku.dk)

Submission deadline: March 31, 2010

The logistics function in supply chains is concerned with the efficient
coordination of all entities, activities and resources involved in moving
a product or service from its origin to final customers. Beyond the control
of material flows, logistics management seeks to integrate transportation
and material-handling with the flow of information and financial values in
the supply chain in order to fulfil customer requests. Altogether, inbound
and outbound logistics of a company along with external logistics services
constitute a market value that ranks logistics clearly among the top
business
sectors in any industrialized economy. Based on the tremendous importance of
logistics in supply chains and the considerable research contributions that
have been achieved from disciplines like Production and Operations
Management,
Industrial Engineering and Operations Research, the primary objective of
this
special issue of the Flexible Services and Manufacturing (FSM) Journal is
to examine research issues concerned with logistics management in supply
chains.

Submission Guideline:
We seek papers that present new research contributions in the field of the
special issues preferably illustrated by real world examples. Papers must
make a substantial new contribution and authors must explicitly show the
advances compared to the previously published research literature. Please
submit your paper in pdf format via e-mail to one of the special issue
editors. Please feel free to contact the editors with any questions.

Flexible Services and Manufacturing Journal (FSM):
The mission of the Flexible Services and Manufacturing Journal,
formerly known as the International Journal of Flexible Manufacturing
Systems, is to publish original, high-quality research papers in the
field of services and manufacturing management. All aspects in this field
including the interface between engineering and management, the design
and analysis of service and manufacturing systems as well as operational
planning and decision support are covered.
______________________________________________________

David Pisinger,
Professor PhD, Operations Research
DTU Management, Technical University of Denmark
Produktionstorvet 426 B, DK-2800 Kgs. Lyngby, Denmark
mail: pisinger@man.dtu.dk
phone: +45 45 25 45 55

**********************************************************
*
* 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 Kernelization Utrecht - reminder

A 2-year full-time position for a postdoc or visiting researcher for two years
at Utrecht University on the topic of Kernelization is announced.
More information can also be found at the websites:
http://www.uu.nl/EN/informationfor/jobseekers/Pages/vacancies.aspx
and
http://www.uu.nl/EN/informationfor/jobseekers/Working-for-Utrecht-University/terms-of-employment/Pages/default.aspx

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

Faculty of Science, Utrecht University

The Center for Algorithmic Systems is part of the Department of Information
and Computing Sciences of the Faculty of Science, Utrecht University. The
Center is headed by Professor Jan van Leeuwen. The Center focuses on the
algorithmic challenges in applied computer science viz. the design of highly
effective and efficient algorithmic solutions that exploit information and
structure. The Center is inviting applications for a position of a

Postdoc (Kernelisation) (1 fte)

Salary is in the range between euro 2,861 and euro 3,755 gross per month.

In the project KERNELS: Complexity and Combinatorial Analysis of Data
Reduction, we investigate the algorithmic, combinatorial and
complexity-theoretic aspects of kernelisation: polynomial time preprocessing
of combinatorial problems with a guarantee on the size of resulting reduced
instances, and related notions. The topic has a strong foundation in recent
theories of fixed parameter complexity and algorithms. The project is funded
by the Netherlands Organisation for Scientific Research NWO.

The postdoc will investigate fundamental questions on the topic of
kernelisation and related complexity-theoretic issues and cooperate with other
members of the Center for Algorithmic Systems, especially with the project
leader dr Hans Bodlaender. The detailed research programme will be determined
by the postdoc and project leader in accordance with the project description
and the interests of the postdoc.

Applicants should hold a Ph.D. in computer science of mathematics, or expect
to receive a Ph.D. in 2010. We ask for a candidate with a strong background in
algorithms or complexity, with a proven of research in fixed parameter
complexity and algorithms for kernelisation. Candidates are expected to
disseminate the results through publications in peer-reviewed journals and
presentations at international conferences.

The candidates are offered a full-time position for 2 years. The gross salary
is in the range between euro 2861,- per and maximum euro 3755,- per month. The
salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of
8,3% per year. In addition, we offer a pension scheme, a partially paid
parental leave and flexible employment conditions. Conditions are based on the
Collective Labour Agreement of the Dutch Universities. See our website for
more details.

Information about the vacancy can be obtained from dr Hans Bodlaender, email:
hansb@cs.uu.nl, or professor Jan van Leeuwen, email: jan@cs.uu.nl. Additional
information can also be obtained through one of the following links:

Department of Information and Computing Sciences: http://www.cs.uu.nl/

Center for Algorithmic Systems: http://www.cs.uu.nl/groups/AD/

Please send your application (including a letter explaining your motivation
and suitability for the position, curriculum vitae, and a transcript of
academic results) to Science.Peno@uu.nl . Please mention vacancy number 64001
and submit your application before 1 March 2010.

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

Hans Bodlaender - Department of Information and Computing Sciences
Utrecht University - P.O. Box 80.089 - 3508 TB Utrecht - the Netherlands
hansb@cs.uu.nl http://www.cs.uu.nl/~hansb/index.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, February 21, 2010

Logic, Algebra and Truth Degrees 2010 - deadline is approaching

(apologies for multiple copies)

Logic, Algebra and Truth Degrees 2010
September 7 - 11, Prague, Czech Republic

Call For Papers

SUBMISSION DEADLINE: 30 March 2010

Logic, Algebra and Truth Degrees is the second official meeting
of the EUSFLAT Working Group on Mathematical Fuzzy Logic
(www.mathfuzzlog.org).

Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic
which studies the notion of comparative truth. The assumption that
"truth comes in degrees" has proved to be very useful in many, both
theoretical and applied, areas of Mathematics, Computer Science and
Philosophy.

The main goals of this meeting are to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic and to promote
communication and cooperation with members of neighbouring fields.

The featured topics include, but are not limited to, the following:

* Proof systems for fuzzy logics: Hilbert, Gentzen, natural
deduction, tableaux, resolution, computational complexity, etc.

* Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.

* Game-theory: Giles games, Renyi-Ulam games, evaluation games, etc.

* First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.

* Higher-order fuzzy logical systems: type theories, Fuzzy Class
Theory, and formal fuzzy mathematics.

* Philosophical issues: connections with vagueness and uncertainty.

* Applied fuzzy logical calculi: foundations of fuzzy logical
programming, logic-based reasoning about similarity,
fuzzy description logics, etc.

We also welcome contributions on any relevant aspects of related
logical systems (such as substructural and quantum logics, and
many-valued logics in general).


Invited speakers:
Arnon Avron, Israel
Felix Bou, Spain
Agata Ciabattoni, Austria
Roberto Cignoli, Argentina
Ioana Leustean, Romania
Franco Montagna, Italy
Hiroakira Ono, Japan
James G. Raftery, South Africa


Tutorials:
George Metcalfe, Switzerland - Proof theory for fuzzy logics
Vilem Novak, Czech Republic - Mathematical fuzzy logic in linguistic
semantics


Programme Committee:
Petr Hajek (Chair), Czech Republic
Antonio Di Nola, Italy
Christian Fermuller, Austria
Siegfried Gottwald, Germany
Daniele Mundici, Italy
Carles Noguera, Spain
Ales Pultr, Czech Republic


Contributed papers:
If you are interested in presenting a paper, please submit a 2-4 page
abstract at http://www.easychair.org/conferences/?conf=latd2010. Your
submission will be confirmed automatically on the e-mail address you
provide. The accepted abstracts will be available on-line after the
final decision of the program committee. If you have any problems to
submit an abstract, please contact us at mail to:
latd2010(at)matfuzzlog.org


Deadline:
The deadline for contributions is 20th March 2010. The notification of
acceptance/rejection will be sent until 30th April 2010.


Expression of interest:
It would help us if you could express a tentative interest by filling
the form at http://www.mathfuzzlog.org/latd2010/interest.php


Conference dates:
The scientific program will start Tuesday morning (7th September) and
finish Saturday noon (11th September).


Venue:
The conference will take place in the building of the School of Computer
Science, Faculty of Mathematics and Physics, Charles University, which
is located in a historical part of the city of Prague called Lesser
Town, close to local attractions like Charles Bridge, and Prague Castle.


Accommodation:
Prague offers a variety of accommodation options. There will be
no official conference hotel, so participants are free to make their
own arrangements. However, all participants can use the special offer
(10% discount) of HotelsCombined.com.


For further information please visit the official web page of the
conference: http://www.mathfuzzlog.org/latd2010. All correspondence
should be directed to latd2010(at)mathfuzzlog.org

Please, feel free to distribute this call.

The Organizing Committee
Petr Cintula (Chair), Karel Chvalovsky, Petra Ivanicova,
Milan Petrik, Ales Pultr, Martin Vita

Friday, February 19, 2010

STACS : Last call for participation

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

27th International Symposium on Theoretical Aspects of Computer Science

                   STACS 2010 - CALL FOR PARTICIPATION

                  MARCH 4-6, 2010, NANCY, FRANCE

                      http://stacs.loria.fr/

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

INVITED SPEAKERS
***********************
Mikolaj Bojanczyk, Warsaw University
Rolf Niedermeier, University of Jena
Jacques Stern, Ecole Normale Supérieure

PROGRAM
*************


PROGRAM COMMITTEE
***************************
Markus Bläser, Saarland University
Harry Buhrman, CWI, University of Amsterdam
Thomas Colcombet, CNRS, Paris 7 University
Anuj Dawar, University of Cambridge
Arnaud Durand, Paris 7 University
Sándor Fekete, Braunschweig University of Technology
Ralf Klasing, CNRS, Bordeaux University
Christian Knauer, Freie Universität of Berlin
Piotr Krysta, University of Liverpool
Sylvain Lombardy, Marne la Vallée University
Parthasarathy Madhusudan, University of Illinois
Jean-Yves Marion, Nancy University (co-chair)
Pierre McKenzie, Université de Montréal
Rasmus Pagh, IT University of Copenhagen
Boaz Patt-Shamir, Tel Aviv University
Christophe Paul, CNRS, Montpellier University
Georg Schnitger, Frankfurt University
Thomas Schwentick, TU Dortmund University (co-chair)
Helmut Seidl, TU Munich
Jirí Sgall, Charles University
Sebastiano Vigna, Università degli Studi di Milano
Paul Vitanyi, CWI, Amsterdam


CONTACT : stacs@loria.fr
*************************

[DMANET] Toulouse Global Optimization workshop 2010 (TOGO10): 2nd CfP

Toulouse Global Optimization workshop 2010 (TOGO10)

Celebrating Pierre Hansen's 70th birthday

Global Optimization (GO) is a discipline aimed at finding global
optima for hard nonconvex optimization problems. The workshop aims at
bringing together researchers dealing with this topic. Depending on
the number of submissions, we shall have either a single stream or
two/three parallel streams. Accordingly, only a limited number of
contributions will be accepted. A special issue of the Journal Of
Global Optimization will contain (fully refereed) papers derived from
works presented at the workshop (or on close topics).

Conference venue: ENSEEIHT, 2 rue Camichel, 31071 Toulouse, France
Conference dates: 31 August - 3 September 2010
(participants should arrive on monday 30)
Conference fees will be kept as low as possible. We shall cover costs
but we do not aim to make a profit!

Submission instructions:
------------------------
Submit a 4-page extended abstract formatted using the LaTeX style
http://www.lix.polytechnique.fr/togo10/latex_style.zip
through the EasyChair website
http://www.easychair.org/conferences/?conf=togo10
Note that we do not accept submissions in .doc format.

Important dates:
----------------
Deadline for the submission of abstracts: April 15th, 2010
Notification of acceptance: June 15th, 2010
Deadline for reduced fee: June 30th, 2010
Welcome reception: August 30th, 2010
Start of conference: August 31st, 2010

Invited speakers:
-----------------
Pierre Hansen, GERAD and HEC, Montreal, Canada
Emilio Carrizosa, Universidad de Sevilla, Spain
Charles Audet, Ecole Polytechnique, Montreal, Canada
Pietro Belotti, Lehigh University, USA

Scientific Committee:
---------------------
Robert Baker Kearfott, Lafayette, Lousiana
Sonia Cafieri, Toulouse, France
Tibor Csendes, Szeged, Hungary
Chris Floudas, Princeton, New Jersey
Inmaculada Garcia, Almeria, Spain
Eligius Hendrix, Malaga, Spain
Jean-Baptiste Hiriart-Urruty, Toulouse, France
Jean-Bernard Lasserre, Toulouse, France
Sven Leyffer, Chicago, Illinois
Leo Liberti, Paris, France
Jeff Linderoth, Madison, Wisconsin
Marco Locatelli, Turin, Italy
Nelson Maculan, Rio de Janeiro, Brazil
Frederic Messine, Toulouse, France
Panos Pardalos, Gainesville, Florida (chair)
Fabio Schoen, Florence, Italy
Hanif Sherali, Blacksburg, Virginia
Fabio Tardella, Rome, Italy
Tapio Westerlund, Abo, Finland

Local Organising Committee:
---------------------------
Sonia Cafieri, Toulouse, France
Nicolas Durand, Toulouse, France
Sylvie Eichen, Toulouse, France
David Gianazza, Toulouse, France
Eligius Hendrix, Malaga, Spain
Didier Henrion, Toulouse, France
Leo Liberti, Paris, France (co-chair)
Kader Merakeb, Toulouse, France
Frederic Messine, Toulouse, France (co-chair)
Marcel Mongeau, Toulouse, France
Antonio Mucherino, Lille, France
Giacomo Nannicini, Pittsburgh, Pennsylvania
Jordan Ninin, Toulouse, France
Evelyne Rayssac, Paris, France
Boglarka Toth, Budapest, Hungary

Contact:
--------
For more details, see the conference website at
http://www.lix.polytechnique.fr/togo10
For more information, please write an email to
gow.togo10@gmail.com
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Director, Helsinki Institute for Information Technology

Director of Helsinki Institute for Information Technology HIIT
(deadline 19 March)

Aalto University and the University of Helsinki are looking for a
proven leader to be the next Director of Helsinki Institute for
Information Technology HIIT after the former Director was promoted to
vice-rector of Aalto University.

The institute conducts world-level basic and applied research for
information and communication technology. Its research ranges from
fundamental methods and technologies to novel applications and their
impact on people and society.

As the joint research institute of Aalto University and the University
of Helsinki, HIIT has a multinational and multidisciplinary staff of
approximately 200 researchers and administrative personnel and an
annual budget of around EUR 10 million. HIIT partners with several
leading international and Finnish companies as well as with
universities and research institutes in Europe, North America and
Asia.

HIIT Director Qualifications

* A world-recognized leader in the field of computer science who
has demonstrated a deep and broad understanding of computer
science and information technology, of their applications and of
their impact on users and society
* A visionary and strategist, highly technical, articulate and
sophisticated communicator
* Ability to
o Lead and manage a team of highly skilled research
professionals
o Create and articulate management processes and show
leadership
o Attract, lead and inspire a diverse group of talented
researchers in a multicultural environment, both on-site and
from afar
o Influence stakeholders, including leaders and
technologists in industry as well as in academic or
university settings
* Promote co-operation with companies, research institutes and the
parent universities
* Doctoral degree

HIIT Director Responsibilities

The responsibilities of the HIIT director include the following:

* Developing and delivering the institute strategy
* Taking responsibility for HIIT's budget and economy as well as
preparing and proposing issues for HIIT's Board of Directors
* Heading the staff of HIIT and leading the recruitment of new staff
* Interacting with funding agencies, institutions and corporations
* Strengthening the institute's relationships with partners and
other stakeholders globally as well as in Finland
* Taking responsibility for HIIT's research contracts

The director works in close co-operation with HIIT's Board of
Directors, the strategic decision-making body of the institute.

The director may carry out scientific research in a core area of HIIT
and teach at the doctoral level.

Duration

Both Aalto University and the University of Helsinki shall employ the
director for a period of up to 5 years at a time beginning 1 August
2010. The appointment is renewable.

Applications

Applications (including CV, a list of publications, a future vision
for research in information technology and HIIT in general, and salary
expectation) should be addressed to HIIT's Board of Directors. The
deadline for submission of applications is 19 March 2010 at 3:45 pm
Finnish time.

Application addresses: The postal address of the Registrar's Office of
Aalto University is Aalto University, Registrar's Office, PO Box
11000, FI-00076 Aalto, Finland. The e-mail address is
kirjaamo@aalto.fi. The street address of the Registrar's Office is
Otakaari 1 B, Espoo. The applications can be sent by e-mail or as
paper documents. Please note that application documents will not be
returned.

Additional information is available from Professor Outi Krause, Vice
Dean of Aalto University School of Science and Technology,
Outi.Krause@tkk.fi, Professor Olli Simula, Dean of Faculty of
Information and Natural Sciences in Aalto University School of Science
and Technology, Olli.Simula@tkk.fi, Professor Johanna Björkroth, Vice
Rector of the University of Helsinki, Johanna.Bjorkroth@helsinki.fi
and Professor Esko Ukkonen, Chair of the Department of Computer
Science at the University of Helsinki, Esko.Ukkonen@cs.helsinki.fi.

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

[DMANET] CFP: Hybrid Metaheuristics 2010 - HM 2010

We apologize if you receive this CFP more than once.
Please circulate this CFP among your colleagues and students.

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

Call for Papers

HYBRID METAHEURISTICS - HM 2010
7th International Workshop
Vienna, Austria

October 1-2, 2010

http://www.ads.tuwien.ac.at/HM2010

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

Metaheuristics have received considerable interest in the fields of
applied artificial intelligence and optimization. Many hard
problems in a huge variety of areas, including bioinformatics,
logistics, engineering, business, etc., have been tackled
successfully with metaheuristic approaches. For many problems the
resulting algorithms are considered to be the state-of-the-art
methods.

In recent years it has become evident that a skilled combination of
metaheuristics with other techniques for optimization or among
themselves, a so-called hybrid metaheuristic, can provide a more
efficient behavior and a higher flexibility especially when dealing
with real-world and large-scale problems.


SCOPE AND TOPICS OF INTEREST

The HM 2010 workshop aims at papers describing good examples of
carefully designed and well-analyzed hybrid metaheuristics.

Topics of interest include, but is not limited to:

- novel combinations of components from different metaheuristics,
- hybridization of metaheuristics and AI/OR techniques,
- matheuristics,
- low-level hybridization,
- high-level hybridization, portfolio techniques, expert systems,
- cooperative search,
- automated parameter tuning,
- empirical and statistical comparison,
- theoretical aspects of hybridization,
- parallelization,
- software libraries.


PAPER SUBMISSION

Researchers are invited to submit papers of not more than 15 pages.
Authors are strongly encouraged to typeset their papers with LaTeX
and to submit them in PDF format (see Information for LNCS Authors
at www.springeronline.com).

Further information on the submission procedure are available on
the workshop website http://www.ads.tuwien.ac.at/HM2010

Every paper will be reviewed by at least two members of the program
committee. Researchers are explicitly encouraged to address
statistical validity of their results, if they compare different
approaches. Source code and problem instances, if relevant, should
be made available on the internet.

The submitted papers must be original works. Simultaneous submission
to other conferences with published proceedings is not permitted.


PROCEEDINGS

As in the previous editions of the workshop, accepted papers will be
published as a volume of the LECTURE NOTES IN COMPUTER SCIENCE series
of Springer.


IMPORTANT DATES

Submission of papers: May 9, 2010
Notification of acceptance: June 20, 2010
Camera-ready papers: July 2, 2010
Workshop: October 1-2, 2010


FURTHER REMARKS

HM 2010 shall be a non-profit workshop. The workshop fee will be kept
as low as possible.


GENERAL CHAIR

Guenther Raidl, Vienna University of Technology, Austria


PROGRAM CO-CHAIRS

Maria J. Blesa, Universitat Politecnica de Catalunya, Spain
Christian Blum, Universitat Politecnica de Catalunya, Spain
Andrea Roli, Universita di Bologna, Italy
Michael Sampels, Universite Libre de Bruxelles, Belgium


TENTATIVE PROGRAM COMMITTEE

Mauro Birattari (Universite Libre de Bruxelles, Belgium)
Juergen Branke (Warwick Business School, United Kingdom)
Marco Chiarandini (University of Southern Denmark, Denmark)
Carlo Cotta (University of Malaga, Spain)
Luca Di Gaspero (Universita di Udine, Italia)
Karl Doerner (University of Vienna, Austria)
Andreas Ernst (CSIRO, Australia)
Antonio J. Fernandez (Universidad de Malaga, Spain)
Paola Festa (Universita di Napoli Federico II, Italy)
Jose Gallardo (Universidad de Malaga, Spain)
Thomas Jansen (University College Cork, Ireland)
Joshua Knowles (University of Manchester, United Kingdom)
Andrea Lodi (Universita di Bologna, Italy)
Manuel Lopez-Ibanez (Universite Libre de Bruxelles, Belgium)
Rafael Martì (Universitat de Valencia, Spain)
Daniel Merkle (University of Southern Denmark, Denmark)
Bernd Meyer (Monash University, Australia)
Martin Middendorf (Universitaet Leipzig, Germany)
Jose A. Moreno (Universidad de La Laguna, Spain)
Jose Marcos Moreno-Vega (Universidad de La Laguna, Spain)
Nysret Musliu (Vienna University of Technology, Austria)
Boris Naujoks (Technische Universitaet Dortmund, Germany)
David Pelta (Universidad de Granada, Spain)
Steven Prestwich (4C, Cork, Ireland)
Christian Prins (TU Troyes, France)
Caroline Prodhon (TU Troyes, France)
Guenter Rudolph (Technische Universitaet Dortmund, Germany)
Andrea Schaerf (Universita di Udine, Italia)
Thomas Stuetzle (Universite Libre de Bruxelles, Belgium)
Greet Vanden Berghe (KaHo Sint Lieven, Belgium)


LOCAL ORGANIZATION

Doris Dicklberger
Bin Hu
Markus Leitner
Mario Ruthmair

Algorithms and Data Structures Group
Institute of Computer Graphics and Algorithms
Vienna University of Technology


CONTACT INFORMATION

hm2010@ads.tuwien.ac.at
http://www.ads.tuwien.ac.at/HM2010
Fax: +43/1-58801-18699

--
+- Guenther Raidl -+
+- Institute of Computer Graphics and Algorithms -+
+- Vienna University of Technology -+
+- Favoritenstrasse 9-11/1861, 1040 Vienna, Austria, Europe -+
+- email: raidl@ads.tuwien.ac.at | phone: +43(1)58801/18616 -+
+- http://www.ads.tuwien.ac.at/ | fax: +43(1)58801/18699 -+
(DVR: 0005886)
**********************************************************
*
* 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] HEUREKA 2011 Call (in German)

Sehr geehrte Dame, sehr geehrter Herr,

mit dieser Mail möchte ich Sie auf die folgende Konferenz und
den zugehörigen Call for Papers hinweisen:

HEUREKA 2011
Am 16. und 17. März 2011 findet die nächste HEUREKA Konferenz
in Stuttgart statt. Die HEUREKA sucht forschungs- und
anwendungsorientierte Beiträge zu Entscheidungs- und
Optimierungsverfahren aus allen Bereichen des Verkehrs
(Intermodaler Verkehr, Individualverkehr, öffentlicher
Verkehr, Güterverkehr). Deadline für die Einreichung von
Beiträgen ist der

12. Juli 2010,

weitere Informationen finden Sie unter

http://www.fgsv.eu/fileadmin/Veranstaltungen/2010/HEUREKA__11/Call_HEUREKA_2011-neu.pdf

Abschließend habe ich noch zwei kleine Bitten: Machen Sie
bitte auch Kollegen und/oder Mitarbeiter, von denen Ihnen aktuelle
Aktivitäten aus den genannten Bereichen bekannt sind, auf die
HEUREKA 2011 aufmerksam - und bitte sehen Sie mir sogleich
etwaiges "cross-posting" nach!

Mit freundlichen Grüßen

Dr. Christian Liebchen
DB Schenker
Netzdimensionierung und DV-Verfahren (L.RCE 111(N))

z.Zt. reACT'09 Projekt ProRail
(Teilprojekte Netzwerkbahn/Effiziente Systeme)

DB Schenker Rail Deutschland AG
Rheinstraße 2, 55116 Mainz
Tel. +49 6131-15-62333, Fax -(email bevorzugte Kontaktart),
intern 959-

Mobil: 0160 97439834
Caroline-Michaelis-Straße 5-11, D-10115 Berlin
Tel. +49 30 297-57926, intern 999-; Frankfurt +49 69 265 6993,
intern 955-
___________________________________________________________________

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

Thursday, February 18, 2010

Five PhD Scholarships in Algorithmics

Five PhD Scholarships in Algorithmics
-------------------------------------

The Department of Mathematics and Computer Science at the University of
Southern Denmark has funding for five PhD students for projects in
Algorithmics. Each project will be in one of the areas of On-Line
Algorithms, Graph Algorithms, and Bioinformatics. Further information
about these areas and projects can be found at:
http://www1.imada.sdu.dk/areas.html

The qualifications necessary for applicants are:

1. A course in Algorithms and Complexity. This is a course beyond a low
level course on Data Structures.

2. A Master's degree in Computer Science, or a Bachelor's degree in
Computer Science with one year of courses beyond a 3-year Bachelor's
degree. (Note that the PhD programme lasts three years in the first case
and four in the second.) The degree cannot be from the University of
Southern Denmark. For the area graph algorithms, degrees in Mathematics
are also acceptable.

3. Excellent grades and letters of recommendation.

4. Interest and motivation to work in one of these areas.

5. Fluency in English.

The start date for these scholarships is August 16, 2010. The amount of the
scholarship, which is paid as salary (including pension contribuations and
vacation money), is about 380,000.00 DKK (equivalent to approx. 51,000.00
Euros or $71,000.00 US) per year for students who already have a Master's
degree. The salary starts lower for students who do not have a Master's
degree making the total salary over four years approximately the same as
the salary over three years for the students with a Master's degree.

The algorithmics group at the Department of Mathematics and Computer
Science provides a very strong scientific environment combined with a
friendly atmosphere. The University of Southern Denmark was founded in
1966 and currently has several campuses, with a total of almost 20,000
students. The Department of Mathematics and Computer Science resides at the
main campus which is located in Odense, the third largest city in Denmark,
a country known for its high standard of living, high tech industry, and
cultural scene.

The application deadline is April 1, 2010. For application details see:
http://www.jobs.sdu.dk/vis_stilling.php?id=5693&lang=eng For further
information, please contact Joan Boyar, joan@imada.sdu.dk.

[DMANET] CFP Extended Deadline of IEEE CIT-2010, ICESS-2010, ScalCom-2010 and Journal Special Issues

[Please accept our apologies if you receive multiple copies of this email]

=== Extended Paper Submission Deadline: Friday, 05 March 2010 ===

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

CALL FOR PAPERS

The 10th IEEE International Conference on Computer and Information Technology (CIT-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/CIT2010/

The 10th IEEE International Conference on Scalable Computing and Communications (ScalCom-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ScalCom2010/

The 7th IEEE International Conference on Embedded Software and Systems (ICESS-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ICESS2010/

Sponsored by
IEEE, IEEE Computer Society and IEEE Technical Committee of Scalable Computing (TCSC)

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

Distinguished selected papers from the conferences, after further extensions, will be published in special issues of the following prestigious Journals indexed by SCI:

. Journal of Supercomputing - Springer
. Journal of Computer and System Sciences - Elsevier
. Concurrency and Computation: Practice and Experience - John Wiley &
Sons
. Telecommunication Systems - Springer
. Simulation Modelling Practice and Theory - Elsevier
. Future Generation Computer Systems - Elsevier
. The Computer Journal - The British Computer Society

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

**********************************************************
*
* 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 mathematical modeling of biological processes, University of Heidelberg

The ViroQuant research group "Modeling" at the University of Heidelberg
in Germany is a young, interdisciplinary research team focusing on
theoretical systems biology, bioinformatics and mathematical modeling.
We are located in the BioQuant center, one of the leading systems
biology centers in Europe.

We are presently looking for a Postdoctoral fellow to strengthen our
research efforts in bioinformatics and computational systems biology.
The position is intended to allow the successful candidate to establish
their own independent research program within the broad research area of
the group. Additional information on ongoing research in the group is
available from our webpage at
http://hades1.bioquant.uni-heidelberg.de/research.html.

Applicants should have a background in systems biology,
(bio)inforamtics, mathematics, physics, or related disciplines, ideally
already with experience in biological applications. Good background
knowledge in one or more of machine learning, mathematical modeling of
biological processes, dynamical systems and / or statistics is
advantageous. We expect the applicant to be willing to collaborate
closely with experimental partners in house, and offer an
interdisciplinary environment in an exciting research area.

The successful candidate will be member of the Cellular Networks Postdoc
Program, see http://www.cellnetworks.uni-hd.de.

Candidates will have to undergo a selection procedure by a committe of
the University. The successful applicant will be member of the
cellnetworks excellence cluster postdoctoral program, and will receive a
stipend from cellnetworks. The position is limited to 2 years.
Application deadline with Cellnetworks is April 8, 2010. Applicants
should contact us well in advance!

Candidates interested in applying, please contact Lars Kaderali
(lars.kaderali{at}bioquant.uni-heidelberg.de) for additional
information. Full applications should include a

* CV
* Publication List
* Transcripts of Relevant Certificates, showing grades
* Names and contact of two qualified referees
* Statement of Research Interests

and should preferentially be sent by email as one large pdf file.

--
Dr. L. Kaderali
University of Heidelberg
Viroquant Research Group Modeling
Bioquant BQ0026
Im Neuenheimer Feld 267
69120 Heidelberg
Germany

Tel. +49-6221-54-51357
Fax +49-6221-54-51486
e-mail lars.kaderali@bioquant.uni-heidelberg.de
http://hades1.bioquant.uni-heidelberg.de

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

[DMANET] PhD positions in computer science on the foundations of electronic markets at Aarhus University

PhD positions in computer science on the foundations of electronic
markets at Aarhus University

At the computer science department of Aarhus University, Denmark, 3 PhD
positions will be available starting August or September 2010.
The background is the establishment of a new research center:
Foundations of Electronic Markets (FEM). The center
will initiate a major new research effort, combining the fields of
cryptography, algorithms and computational complexity with subjects in
economics,
such as game theory and mechanism design. It involves several
international partners in industry and academic research. We are therefore
looking for students with a strong background in computer science and/or
mathematics and an interest in any of the relevant computer science fields.
For more information on the center, see http://www.cfem.dk.

Students will be given the opportunity to work with basic or applied
research in FEM as well another closely related project: Confidential
Benchmarking
(COBE), which aims at developing new cryptographic protocols for secure
analysis of confidential data from multiple sources.

Entering our PhD program requires at least 4 years of full-time study.
However, based only on a bachelor degree, one can be admitted to an
honors program
directed against a PhD study.

The Computer Science department of Aarhus University
(http://www.cs.au.dk) is one of the strongest CS departments in Europe.
We are particularly known for our work in algorithms, complexity theory
and cryptography.

Interested students are encouraged to get in touch with either Ivan
Damgard (ivan@cs.au.dk) or Peter Bro Miltersen (bromille@cs.au.dk)
See also the CS department's pages for potential PhD students
(http://cs.au.dk/studies/phd-school).

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

PhD positions in computer science on the foundations of electronic markets at Aarhus University

PhD positions in computer science on the foundations of electronic markets
at Aarhus University

At the computer science department of Aarhus University, Denmark, 3 PhD
positions will be available starting August or September 2010.
The background is the establishment of a new research center: Foundations of
Electronic Markets (FEM). The center will initiate a major new research
effort, combining the fields of cryptography, algorithms and computational
complexity with subjects in economics, such as game theory and mechanism
design. It involves several international partners in industry and academic
research. We are therefore looking for students with a strong background in
computer science and/or mathematics and an interest in any of the relevant
computer science fields. For more information on the center, see
http://www.cfem.dk.

Students will be given the opportunity to work with basic or applied
research in FEM as well another closely related project: Confidential
Benchmarking (COBE), which aims at developing new cryptographic protocols
for secure analysis of confidential data from multiple sources.

Entering our PhD program requires at least 4 years of full-time study.
However, based only on a bachelor degree, one can be admitted to an honors
program directed against a PhD study.

The Computer Science department of Aarhus University (http://www.cs.au.dk)
is one of the strongest CS departments in Europe. We are particularly known
for our work in algorithms, complexity theory and cryptography.

Interested students are encouraged to get in touch with either Ivan Damgard
(ivan@cs.au.dk) or Peter Bro Miltersen (bromille@cs.au.dk)
See also the CS department's pages for potential PhD students
(http://cs.au.dk/studies/phd-school).

[DMANET] WCO first CFP

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

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

http://www.imcsit.org

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

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

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

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

Important dates:

31.05.2010 (May 31, 2010) – Full paper submission

12.07.2010 (July 12, 2010) – Notification of acceptance

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


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

Submission

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

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

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

Publication

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

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

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

Organizing Committee

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

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

Wednesday, February 17, 2010

2nd Call-for-Papers of FAW'2010

FAW 2010 Call for Papers

The Fourth International Frontiers of Algorithmics Workshop (FAW 2010)
August 11-13, 2010
Wuhan University, Wuhan, China
http://www.faw2010.org

The Fourth International Frontiers of Algorithmics Workshop (FAW 2010) will be
held on August 11-13, 2010 at Wuhan University, Wuhan, China.

The Workshop will provide a focused forum on current trends of research on
algorithms, discrete structures, and their applications, and will bring
together international experts at the research frontiers in these areas to
exchange ideas and to present significant new results.

The mission of the Workshop is to stimulate the various fields for which
algorithmics can become a crucial enabler, and to strengthen the ties between
the Eastern and Western research communities of algorithmics and applications.

Interesting new results in all areas of algorithmics and their applications are
welcome. In addition to theoretical work, we are also interested in results
that report on experimental
and applied research of general algorithmic interest. Special considerations
will be given to algorithmic research that is motivated by real-world
applications. Experimental and applied papers are expected to show convincingly
the usefulness and efficiency of the target algorithms in practical settings.

Typical, but not exclusive, topics of interest include:

Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical
applications;
Biomedical imaging algorithms;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.


Submissions:

The submission deadline is March 1, 2010. FAW'2010 will only accept
electronic (PS or PDF) submissions. For on-line submission, please go to
http://www.faw2010.org/ for detailed instructions on submissions.

E-mails will be sent to the authors to confirm the receipt of their submissions
within 24 hours. For any problem or question on submissions, please send
e-mails to faw2010@sklse.org.

Only previously unpublished new results will be considered for publication.
Papers that have already been published at another journal or conference with
proceedings, or simultaneously submitted or accepted to another conference with
proceedings will not be considered.

A submission should start with the title of the paper, each author's name,
affiliation, and e-mail address, and a one-paragraph summary of the results.
This should be followed by a scholarly exposition of the ideas, techniques,
and a full description of the results achieved. A clear indication of the
motivation and comparison with prior or related work should be presented.
The paper should not exceed 10 pages, excluding bibliography and appendices,
formatted for letter-size paper using 11 point or larger font, with at least
one inch margins around.

Submissions that deviate significantly from these guidelines or are
unprintable risk rejection without consideration of their merit.

The proceedings of the Workshop will be published by Springer-Verlag in the
Lecture Notes in Computer Science series, and will be available for
distribution at the Workshop.


Invited Speakers:

To be announced at the Workshop web page.


Special Issues:

Selected high quality papers will be invited to a special issue in the journal
of Theoretical Computer Science and in the Journal of Combinatorial
Optimization, respectively. The invited papers
will go through the normal reviewing process.


Awards

The Best Paper and the Best Student Paper will be selected for award.
A paper is eligible for the Best Student Paper Award only if all authors are
full-time students at the time of submission. To indicate the eligibility of a
submission for the Best Student Paper Award, please add the phrase "Eligible
for Best Student Paper Award" in a separate line at the end of the "Abstract"
field in the web form on the submission server as well as in the submitted
paper. The Committee reserves the right to decide whether to make an award or
not.


Advanced Research Experience for Students and Young Researchers

To provide a unique opportunity for students and young researchers to
learn and develop advanced research perspective and skills, several world
leading algorithmic researchers and experts will offer training sessions (1 or
2 hours per session) on how to conduct research and solve problems. The
discussions include how to choose research topics, how to formulate models, how
to identify specific research problems, how to approach solutions for the
target problems, etc. Open problems will be posted, and preliminary possible
directions for solving the posted problems will be suggested and discussed.
Since the main
purpose of these training sessions is to help students and young researchers to
develop research experience, the style of the sessions will be highly flexible.
Professor John Hopcroft, a world famous researcher in the algorithmics field
and a Turing Award recipient, will offer a special interactive session called
"Round Table with John Hopcroft". Interested researchers will be able to
interact closely and work on selected research problems with world class
research leaders during the Workshop or even after.


After-workshop Tour

A four-day tour will be organized after the Workshop to visit the beautiful
Three Gorges scenic region along the Yangtze River,
which is historically and culturally very famous in China and in
the world.


Important Dates:

Paper Submission Deadline: March 1, 2010
Notification of Acceptance/Rejection: April 30, 2010
Final Camera-ready Version Due: May 21, 2010
Conference: August 11-13, 2010


Conference Committees:


General Conference Co-chairs:
John E. Hopcroft, Cornell University, USA
Deyi Li, Wuhan University, China


Program Committee:

PC Chair: D.T. Lee, Academia Sinica and National Taiwan University, Taiwan

PC Co-chairs:
Danny Z. Chen, University of Notre Dame, USA
Shi Ying, Wuhan University, China

Program Committee Members:

Nancy Amato, Texas A&M University, USA
Tetsuo Asano, Japan Advanced Institute of Science and Technology, Japan
Franz Aurenhammer, Technische Universitaet Graz, Austria
Gill Barequet, Technion---Israel Institute of Technology, Israel
Amitabh Chaudhary, University of Notre Dame, USA
Ning Chen, Nanyang Technological University, Singapore
Siu-Wing Cheng, Hong Kong University of Science and Technology, Hong Kong
Francis Chin, University of Hong Kong, Hong Kong
Kyung-Yong Chwa, Korea Advanced Institute of Science and Technology, Korea
Ovidiu Daescu, University of Texas at Dallas, USA
Peter Eades, University of Sydney, Australia
Qizhi Fang, Ocean University of China, China Rudolf Fleischer, Fudan
University, China
Subir Ghosh, Tata Institute of Fundamental Research, India
Sun-Yuan Hsieh, National Cheng Kung University, Taiwan
Ming-Yang Kao, Northwestern University, USA
Naoki Katoh, Kyoto University, Japan
Angsheng Li, Chinese Academy of Sciences, China
Xuemin Lin, University of New South Wales, Australia
Zhiyong Liu, Chinese Academy of Sciences, China
Chi-Jen Lu, Academia Sinica, Taiwan
Pinyan Lu, Microsoft Research Asia, China
Shuang Luan, University of New Mexico, USA
Martin Noellenburg, University of Karlsruhe, Germany
Rong Peng, Wuhan University, China
Peter Rossmanith, Aachen University, Germany
Michiel Smid, Carleton University, Canada
Takeshi Tokuyama, Tohoku University, Japan
Feng Wang, Wuhan University, China
Haitao Wang, University of Notre Dame, USA
Lusheng Wang, City University of Hong Kong, Hong Kong
Sue Whitesides, University of Victoria, Canada
Xiaodong Wu, University of Iowa, USA
Jinhui Xu, State University of New York at Buffalo, USA
Jinyun Xue, Jiangxi Normal University, China
Jianping Yin, National University of Defense Technology, China
Guochuan Zhang, Zhejiang University, China
Jian Zhang, Chinese Academy of Science, China
Luoxin Zhang, National University of Singapore, Singapore
Xiao Zhou, Tohoku University, Japan.
Binhai Zhu, Montana State University, USA
Hong Zhu, East China Normal University, China


Steering Committee:

Steering Committee Co-chairs:
Xiaotie Deng, City University of Hong Kong, Hong Kong
Franco P. Preparata, Brown University, USA

Steering Committee Members:

Danny Z. Chen, University of Notre Dame, USA
Qizhi Fang, Ocean University of China, China
John E. Hopcroft, Cornell University, USA
D.T. Lee, Academia Sinica and National Taiwan University, Taiwan
Hao Li, Paris-Sud 11 University and CNRS, France
Detlef Seese, University Karlsruhe, Germany
Jianping Yin, National University of Defense Technology, China


Organizing Committee:

Organizing Committee Chair: Rong Peng, Wuhan University, China

Organizing Committee Members:

Feng Wang, Wuhan University, China
Ying Zheng, Wuhan University, China
Mao Ye, Wuhan University, China


Further Information:

The Workshop web site http://www.faw2010.org provides more
information about the Workshop. For any questions, please e-mail to
faw2010@sklse.org. For more information and pictures of Wuhan and the Three
Gorges region, please go to Local Information and Scenery.

[DMANET] 10th Haifa Graph Workshop (23-25 May) and Memorial for Uri N. Peled

CALL-FOR-PAPERS

--------------------------------------------------------------------
10th Haifa Workshop on Interdisciplinary Applications of Graph Theory,
Combinatorics and Algorithms, 23-25 May 2010, Haifa (Israel)

Dedicated in Memory of Uri N. Peled, z"l

http://www.cri.haifa.ac.il

Professors -- please mark the date and forward to your appropriate
research students.

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

The Caesarea Rothschild Institute at the University of Haifa announces its:

10th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics, and Algorithms

Dedicated in Memory of Uri N. Peled, z"l

Sunday-Tuesday, May 23-25, 2010

*** CALL FOR PAPERS *** contributed talks
http://www.cri.haifa.ac.il

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

INVITED SPEAKERS:

Bill Cunningham (University of Waterloo, Canada)
Michael Elkin (Ben-Gurion University, Israel)
Fedor Fomin (University of Bergen, Norway)
Seffi Naor (Technion, Israel)
Zeev Nutov (Open University, Israel)
Ronitt Rubinfeld (Tel-Aviv University, Israel)
Bruno Simeone (University of Rome, Italy)
Gyorgy Turan (University of Illinois / Chicago, USA)
Alek Vainshtein (University of Haifa, Israel)

Additional invited speakers are expected.

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

CALL FOR PAPERS:

Submissions for contributed talks are invited for this year's
workshop. The workshop emphasizes the diversity of the use of combinatorial
algorithms and graph theory in application areas. Examples of such areas of
interest include:

- Randomized Algorithms - Networking
- Graph Algorithms - Internet Congestion and Patterns
- Computational Biology - Applied Combinatorics
- Web Applications - Geometric Graphs and Computation
- Optimization - Graph Theoretic Models

A special Memorial Session of Uri N. Peled will be held on May 23.
Submissions related to Uri's work on threshold graphs, Boolean functions,
and many other topics in graph theory and combinatorics would be
especially welcome.

Please send abstracts (1-2 pages) by e-mail to <GraphWorkshop2010@gmail.com>
by *April 14, 2010*. Papers that have been accepted to recent international
conferences are particularly welcome, and should be so indicated in the
submission.

IMPORTANT DATES:
submission: April 14
notification: April 23
workshop: May 23-25

REGISTRATION:
The registration site will open shortly after Pesach.
Please visit: <http://www.cri.haifa.ac.il>

WORKSHOP COMMITTEE:

Martin Charles Golumbic (chair) <golumbic@cs.haifa.ac.il>
Yonatan Aumann <aumann@cs.biu.ac.il>
Shlomi Dolev <dolev@cs.bgu.ac.il>
Guy Even <guy@eng.tau.ac.il>
Ron Holzman <holzman@techunix.technion.ac.il>
Gil Kalai <kalai@math.huji.ac.il>
Haim Kaplan <haimk@math.tau.ac.il>
Ephraim Korach <korach@bgumail.bgu.ac.il>
Nissan Lev-Tov <nissanlevtov@gmail.com>
Avivit Levy (program co-chair) <avivitlevy@shenkar.ac.il>
Nati Linial <nati@cs.huji.ac.il>
Udi Rotics (program co-chair) <rotics@netanya.ac.il>
Oren Weimann <oren.weimann@weizmann.ac.il>
Raphy Yuster <raphy@research.haifa.ac.il>
Shmuel Zaks <ZAKS@cs.technion.ac.il>


OTHER CONFERENCES:

On May 24-26, 2010, the IBM Haifa Research Lab will organize SYSTOR 2010
- The 3rd Annual Haifa Experimental Systems Conference
<http://www.haifa.ibm.com/conferences/systor2010/> cosponsored by the
Caesarea Rothschild Institute at the University of Haifa.


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

2nd CFP - Workshop on Invariant Generation (WING 2010), Edinburgh, July 21, 2010

[Please post - apologies for multiple copies.]


Second Call for Papers

--------------------------
W I N G 2010

3nd International Workshop on INvariant Generation
--------------------------

July 21, 2010
University of Edinburgh, UK
Satellite Workshop of FLoC 2010

http://research.microsoft.com/en-us/events/wing2010/


General
-------

The ability to extract and synthesize auxiliary properties
of programs has had a profound effect on program analysis,
testing and verification over the last several decades.
The field of invariant generation draws on a multitude of
techniques ranging from computer algebra, theorem proving,
constraint solving, abstract interpretation techniques
and model-checking.
Likewise, the application areas are diversified from
bootstrapping static program analysis tools,
to test-case generation and into aiding the quest
for verified software. So invariants are a key ingredient
in program analysis and understanding.
Yet, invariant generation poses as many challenges as promises:
A key impediment for program verification
is the overhead associated with providing, debugging,
and verifying auxiliary invariant annotations.

As the design and implementation of reliable software remains
an important issue, any progress in this area will be of utmost
importance for future developments in verified software. In the
context of static analysis and test-case generation, suitable
invariants have the potential of enabling sophisticated
automatic program analysis and high-coverage test-case
generation.

Several modern techniques for program termination and
expected program execution time also rely heavily on
suitable invariants (as relations) for the termination analysis.

Automated discovery of inductive assertions is therefore
one of the ultimate challenges for verification of safety and
security properties of programs.

The increasing power of automated theorem proving and
computer algebra has opened new perspectives for computer
aided program verification; in particular for the automatic
generation of inductive assertions in order to reason about
loops and recursion. Especially promising breakthroughs are
invariant generation techniques by Groebner bases,
quantifier elimination, and algorithmic combinatorics,
which can be used in conjunction with model checking,
theorem proving, static analysis and abstract interpretation.

Scope
-----

This workshop aims to bring together researchers from
several fields of abstract interpretation, computational
logic and computer algebra to support reasoning about loops,
in particular, by using algorithmic combinatorics,
narrowing/widening techniques, static analysis,
polynomial algebra, quantifier elimination and model checking.

We encourage submissions presenting work in progress,
tools under development, as well as research of PhD students,
such that the workshop can become a forum for active dialog
between the groups involved in this new research area.

Relevant topics include (but are not limited to) the following:

- Program analysis and verification
- Inductive Assertion Generation
- Inductive Proofs for Reasoning about Loops
- Applications to Assertion Generation using the following tools:
- Abstract Interpretation,
- Static Analysis,
- Model Checking,
- Theorem Proving,
- Algebraic Techniques
- Tools for inductive assertion generation and verification
- Alternative techniques for reasoning about loops

Keynote Speakers
----------------

Sumit Gulwani (Microsoft Research, US)
Helmut Seidl (Technical University of Munich, Germany)

Committee
-----------------

Program Chairs:

Nikolaj Bjorner (Microsoft Research, US)
Laura Kovacs (Vienna University of Technology, Austria)


Program Committee:
Enric Rodríguez Carbonell (Technical University of Catalonia, Spain)
Martin Giese (University of Oslo, Norway)
Jens Knoop (Vienna University of Technology, Austria)
Francesco Logozzo (Microsoft Research, USA)
Wolfgang Schreiner (RISC-Linz, Austria)
Andrey Rybalchenko (Technical University of Munich, Germany)
Helmut Veith (Vienna University of Technology, Austria)
Thomas Wies (IST, Austria)

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

March 8, 2010: Submission deadline
April 11, 2010: Notification of acceptance
April 23, 2010: Camera-ready copy deadline
July 21, 2010: WING 2010 in Edinburgh, UK


Submission
----------

Submission is via EasyChair:

https://www.easychair.org/?conf=wing2010


Please submit research reports up to 15 pages in PDF,
conforming to the format produced by LaTeX using the
easychair.cls class file of EasyChair.
The class style may be downloaded at:

http://www.easychair.org/easychair.zip

Publication
-----------

All submissions will be peer-reviewed by the program committee.
Accepted contributions will be published in archived electronic notes,
as an EasyChair collection volume.

A special issue of the Journal of Symbolic Computation with full versions
of selected papers will be published after the workshop.

[DMANET] Call for Papers - Special session on Multiobjective Optimization at META-2010

Special session on Multiobjective Optimization
http://www.lifl.fr/META10/index.php?n=Main.InfoMMO

as a part of

META 2010
International Conference on Metaheuristics and Nature Inspired Computing
October 28-30, 2010 - Djerba, Tunisia
http://www.lifl.fr/META10/


Important dates
- Submission (2-page abstract): May 15, 2010
- Notification of acceptance: July 15, 2010
- Camera-ready version: September 15, 2010
- Conference: October 28-30, 2010


Topics
The scope of the special session includes (but is not limited to):
- Adaptation of metaheuristics to multiobjective optimization:
local search, simulated annealing, tabu search, iterated local search,
evolutionary algorithms, swarm optimization, scatter search.
- Algorithmic aspects of metaheuristics for multiobjective optimization:
search strategies, fitness assignment, diversity preservation, elitism,
constraint handling, implementation issues, analysis.
- Hybridization with other techniques:
hybrid metaheuristics for multiobjective optimization, cooperation with
exact approaches, interaction with multicriteria decision making.
- Performance assessment of metaheuristics for multiobjective
optimization:
new performance indicators, theoretical properties and relation between
indicators.
- Theoretical aspectsof metaheuristics for multiobjective optimization:
landscape analysis, problem properties.
- Application of metaheuristics for multiobjective optimization to
academic and real-world multiobjective optimization problems:
transportation, scheduling, timetabling, bioinformatics.


Submission
Submission of papers should be in shape of a 2-page abstract (including
figures, tables, and references). Templates are available on the website:
http://www.lifl.fr/META10/
Extended versions of selected papers will be considered for publication in
the following journals: COR (Computers and Operations Research), ITOR
(International Transactions in Operational Research), JMMA (Journal of
Mathematical Modelling and Algorithms).


Program Committee (to be completed)
- Matthieu Basseur, University of Angers (FR)
- Clarisse Dhaenens, University of Lille (FR)
- Jose R. Figueira, Technical University of Lisbon (PT)
- Carlos Fonseca, University of Algarve (PT)
- Laetitia Jourdan, INRIA Lille, Nord Europe (FR)
- Nicolas Jozefowiez, University of Toulouse (FR)
- Francisco Luna, University of Malaga (ES)
- Thibaut Lust, University of Mons (BE)
- Julian Molina, University of Malaga (ES)
- Ricardo Takahashi, Federal University of Minas Gerais (BR)


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

Kurt Mehlhorn to Receive EATCS Award


The EATCS Award is awarded annually in recognition of a distinguished career in theoretical computer science.

The Committee, consisting of Emo Welzl (Chair), Eugenio Moggi and Paul Spirakis, of the European Association for Theoretical Computer Science in charge of evaluating the nominations to the 2010 EATCS Award has come to the decision to honor Professor Kurt Mehlhorn with the EATCS Award 2010 for his decisive influence on the developments of algorithms, and, more generally, of computer science as a whole in many ways.

The decision has been unanimously approved by the EATCS Council.

The Award will be assigned during a ceremony that will take place in Bordeaux (France) during ICALP 2010 (July 5-12, 2010).