[DMANET] Special issue of the Journal of Scheduling - deadline extension

In response to some requests from authors, we are extending the paper
submission deadline to Sunday, January 31.

Special Issue of the Journal of Scheduling

"Scheduling: new branches, old roots"

dedicated to the memory of Vyacheslav Sergeevich Tanaev (28.03.1940 -
19.07.2002) on the occasion of his 70th birthday. Vyacheslav Tanaev was
the initiator and a great supporter of studies in scheduling and related
areas in the USSR and the post-Soviet countries. His monographs, published
in Russian and English, remain a permanent source of some of the most
important results in scheduling theory and its applications. The topics
outlined in this special issue are inspired by his contributions to the
scheduling research literature and include, but are not limited to:
- New concepts in scheduling with soft and hard time constraints
- Interactions of scheduling theory with other disciplines such as graph
theory, mathematical programming, combinatorics
- The coordination and integration of scheduling decisions in supply and
production chains
- Scheduling in uncertain environments
- Closing gaps in the complexity of scheduling problems.

We also intend to prepare a survey of the scientific activities of
Vyacheslav Tanaev and his contributions to scheduling theory and research
in general.

Submissions should be uploaded directly at the JoS web page
http://www.editorialmanager.com/josh/
in the Section devoted to this issue.

Guest editors:

Jacek Blazewicz, Edmund Burke, Valery Gordon, Mikhail Y. Kovalyov, and
Vitaly Strusevich,

Important dates:

January 31, 2010 - new submission deadline
June 15, 2010 - decision about acceptance

**********************************************************
*
* 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] CMCS 2010: Final call for papers

------------------------------------------------------------------------------
CMCS 2010 Final call for papers
------------------------------------------------------------------------------

The Tenth International Workshop on Coalgebraic Methods in Computer Science
26-28 March 2010, Paphos, Cyprus
(co-located with ETAPS 2010)
http://event.cwi.nl/cmcs10/

Aims and scope
------------------

The aim of the workshop is to bring together researchers with a common
interest in the theory of coalgebras and its applications. Over the
last two decades, coalgebra has developed into a field of its own,
presenting a mathematical foundation for various kinds of dynamical
systems, infinite data structures, and logics. Coalgebra has an ever
growing range of applications in and interactions with other fields
such as reactive and interactive system theory, object oriented and
concurrent programming, formal system specification, modal logic,
dynamical systems, control systems, category theory, algebra,
analysis, etc.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantical models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).

An anniversary: the 10th CMCS
----------------------------------------

CMCS took place for the first time when ETAPS started, in 1998. Since
then, it has always been collocated with ETAPS, becoming bi-annual
since the start of CALCO (Conference on Algebra and Coalgebra) in
2005.

In 2010, we will celebrate the 10th edition of CMCS,
by inviting a number of specialists in the field to present overviews
of both obtained results and future challenges.

Invited Speakers
---------------------

At this tenth meeting the following invited speakers will present
overviews of important subareas.

* Venanzio Capretta: Coalgebra in functional programming and type theory
* Bartek Klin: Operational semantics coalgebraically
* Dirk Pattinson: Logic and coalgebra
* Ana Sokolova: Probabilistic systems coalgebraically

Submissions
--------------

There are two types of submissions possible:

(a) Papers to be evaluated by the PC for publication in the proceedings:

They must have a length no greater than 20 pages. They must contain
original contributions, be clearly written, and include appropriate
reference to and comparison with related work. Accepted papers will
appear in ENTCS (style files can be found in http://www.entcs.org/).
The web-based system EasyChair will be used for submission
(http://www.easychair.org/conferences/?conf=cmcs10).

After the event, a special journal issue of selected papers will be
considered.

(b) Short contributions:

These will not be published in the proceedings but will be bundled in
a CWI technical report.

They should be no more than two pages and may describe work in
progress, summarise work submitted to a conference or workshop
elsewhere, or in some other way appeal to the CMCS audience. For
short submissions, the style file easychair.cls should be used
(http://www.easychair.org/coolnews.cgi). The submission (pdf file)
is via email: cmcs10@cwi.nl.

Important dates
-------------------
* 8 January 2010: strict submission deadline regular papers
* 13 February 2010: notification regular papers
* 15 February 2010: deadline early registration
* 20 February 2010: final version
* 27 February 2010: strict submission deadline short contributions
* 6 March 2010: notification short contributions
* 26-28 March 2010: the workshop

Organising Committee
--------------------------

Bart Jacobs,
Milad Niqui (co-chair, CWI),
Jan Rutten,
Alexandra Silva (co-chair, CWI).

Contact
----------
cmcs10@cwi.nl
.
**********************************************************
*
* 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/
*
**********************************************************

IBM Research 2010 Raviv Postdoctoral Fellowship

2010 Josef Raviv Memorial Postdoctoral Fellowship in Computer Science and
Computer Engineering

IBM Research is proud to announce the 2010 Josef Raviv Memorial
Postdoctoral Fellowship in Computer Science and Computer Engineering in
memory of Dr. Josef Raviv, the founder and director of the IBM Research -
Haifa laboratory. Dr. Raviv had a distinguished research career in
Information Theory and was a pioneer in the Israeli high-tech industry.

IBM will offer one postdoctoral fellowship to a recent Ph.D. who shows
exceptional promise for a research career in computer science or computer
engineering. The fellowship will be for one year, with an opportunity for
IBM to renew for an additional year conditional on funding availability.
The stipend will be at least $100,000 (may be prorated if an IBM Research
lab outside the U.S. is selected) plus reasonable moving and travel
expenses. A candidate must have received a Ph.D. degree between January
2006 and August 2010.

Depending on proposed collaborations, the Fellow will spend most of
his/her time at a laboratory of his/her choice from one of IBM's Research
laboratories that include: Almaden  (San Jose, California, USA), Austin
(Texas, USA), China  (Beijing), Haifa  (Israel), India  (Delhi or
Bangalore), Tokyo  (Japan), Thomas J. Watson  (Westchester County, New
York, or Cambridge, MA, USA), Zurich  (Switzerland). The Fellow will be
free to follow his/her own research interests, but is expected to work
closely with other IBM researchers. Applicants are encouraged to identify
IBM Research groups working in their area of interest.

Application requirements
To apply, please submit these documents by January 31, 2010:
Resume (include contact e-mail, postal address and phone number).
Thesis summary (one-page maximum).
Research proposal (no more than two pages, if possible).
Indicate the proposed lab. If you know of a specific group(s) which you
would like to join and/or researcher(s) you would like to work with,
indicate that as well. If there are multiple groups, list at most three.
Reprint of applicant's most significant research publications.
Three (3) reference letters, including one from the Ph.D. thesis advisor.
Letters should be sent directly by recommenders to: ravivdoc@us.ibm.com

The applicant is responsible for ensuring that all required materials
arrive by January 31, 2010. All documents must contain the applicant's
name and email address (we prefer information as PDF or Word documents)
and be sent to: ravivdoc@us.ibm.com

A committee of IBM researchers co-chaired by Jose Moreira (T.J. Watson)
and Phokion Kolaitis (Almaden) will select the Fellow.

Applicants will be notified by March 31, 2010. The fellowship begins
September 7, 2010, unless another date is agreed upon.

For more information about the breadth of our activities, visit IBM
Research.

[DMANET] Call for submission MOPTA 2010

CALL FOR PARTICIPATION
MOPTA 2010: Abstract Submission deadline: June 16, 2010

Modeling and Optimization: Theory and Applications (MOPTA 2010)
August 18-20, 2010, Lehigh University, Bethlehem, PA
http://coral.ie.lehigh.edu/~mopta/

SCOPE
The conference is an annual event aiming to bring together a diverse
group of people from both discrete and continuous optimization, working
on both theoretical and applied aspects.
Our target is to present a diverse set of exciting new developments from
different optimization areas while at the same time providing a setting
which will allow increased interaction among the participants.
We aim to bring together researchers from both the theoretical and applied
communities who do not usually have the chance to interact in the framework
of a medium-scale event.

CONFIRMED PLENARY SPEAKERS INCLUDE
Egon Balas, Tepper School of Business, Carnegie Mellon University;
http://public.tepper.cmu.edu/facultydirectory/FacultyDirectoryProfile.aspx?id=39
Mung Chiang, Dept. of Electrical Engineering, Princeton University;
http://www.princeton.edu/~chiangm
Donald Goldfarb, Dept. of IE and OR, Columbia University;
http://www.columbia.edu/~goldfarb
Arkadi Nemirovski, School of ISyE, Georgia Institute of Technology;
http://www.isye.gatech.edu/faculty-staff/profile.php?entry=an63
Anthony T. Patera, Dept. of Mechanical Engineering, MIT;
http://meche.mit.edu/people/faculty/index.html?id=66
H. Edwin Romeijn, Dept. of IOE, University of Michigan;
http://www.ise.ufl.edu/romeijn
Andrzej Ruszczynski, RUTCOR and Dept. of MSIS, Rutgers University;
http://www.rusz.rutgers.edu/

AIMMS-MOPTA MODELING COMPETITION:
An optimization modeling competition, sponsored by AIMMS is organized.
Finalist will present their results at a special session of MOPTA 2010.
Problem released January 2010.

CONTRIBUTED TALKS
Each accepted paper will be allotted a 25 minute talk. Authors wishing
to speak and/or organize a session should submit an abstract via the
conference WEB page by June 16, 2010.

IMPORTANT DATES
Abstract Submission deadline: June 16, 2010
Early registration deadline: July 15, 2010
Conference date: *18-20 August 2010*.

IMPORTANT NOTE:
Bethlehem, PA is just one hour drive west of the NewArk (EWR)
International Airport, less than an hour drive north of Philadelphia.
Participants may fly to the Allentown-Bethlehem (ABE) airport, 10 minutes
drive from Lehigh University.

On behalf of the Organizing Committee
Tamas Terlaky, terlaky@lehigh.edu (Chair, Lehigh University)
Please direct questions to: Pietro Belotti, belotti@Lehigh.EDU
Contact for modeling competition: Imre Polik, imp208@lehigh.edu
Further information is available at: http://coral.ie.lehigh.edu/~mopta/

We are looking forward to welcoming you at MOPTA 2010 in Bethlehem at
Lehigh University in August 2010.

--
********************************************************
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/PostDoc position in Bioinformatics, FSU Jena

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

PostDoc/PhD student as a research associate (Wissenschaftlicher Mitarbeiter)

This position is part of the project Algorithms for the Analysis of
Approximate Gene Clusters, funded by the Deutsche
Forschungsgemeinschaft. The key objective of this project is to develop
models and algorithms for the computation of approximate gene clusters,
that combine a formal strictness with applicability to biological data.
We will combine methods from combinatorial optimization and algorithmic
graph theory with a statistically sound evaluation. Focus of research
is, besides developing such algorithms, also their implementation,
evaluation, algorithm engineering, and biological case studies.

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

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

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

This project is realized in cooperation with the AG Genome Informatics
of Prof. Dr. Jens Stoye at Bielefeld University, Germany.

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

Prof. Dr. Sebastian B�cker

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

If you apply for a position in both projects IDUN and 3AGC, please
clearly say so in your cover letter.

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

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

Wissenschaftlichen Mitarbeiters (Post-Doktorand oder Doktorand)

zu besetzen. Die Stelle ist Teil des von der DFG gef�rderten Projekts
Algorithmen zur Analyse Approximativer Gen-Cluster. Im Rahmen dieses
Projektes sollen Modelle und Algorithmen f�r die Berechnung
approximativer Gencluster entwickelt werden, die eine formale Strenge
mit der Anwendbarkeit auf biologische Daten verbinden. Wir wollen f�r
diese Aufgabe Methoden der kombinatorischen Optimierung und der
Graphentheorie mit einer soliden statistischen Evaluation
verbinden.Fokus der Forschung sind, neben der Entwicklung solcher
Algorithmen, auch ihre Implementierung, Evaluierung, Algorithm
Engineering sowie biologische Fallstudien.

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

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

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

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

Dieses Projekt wird in Kooperation mit der AG Genominformatik von Prof.
Dr. Jens Stoye an der Universit�t Bielefeld durchgef�hrt.

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

Prof. Dr. Sebastian B�cker

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

Bei einer Bewerbung auf eine Stelle in beiden Projekten IDUN und 3AGC
sollte dieser Umstand im Anschreiben klar erw�hnt werden.

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

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

[DMANET] Two PhD/PostDoc positions in Bioinformatics, FSU Jena

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

Two positions PostDoc/PhD students as research associates
(Wissenschaftliche Mitarbeiter)

This position is part of the project Identifying the Unknowns: Towards
structural elucidation of small molecules using mass spectrometry,
funded by the Deutsche Forschungsgemeinschaft. The key objective of this
project is to develop computational methods to "identify the unknowns"
using mass spectrometry, that is, compounds that cannot be found in any
database. For this, we will develop new computational techniques,
models, and algorithms for the interpretation of MS fragmentation data
from small molecules. Focus of research is, besides developing such
algorithms, also their implementation, evaluation, algorithm
engineering, and case studies.

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

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

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

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

Prof. Dr. Sebastian B�cker

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

If you apply for a position in both projects IDUN and 3AGC, please
clearly say so in your cover letter.

Am Lehrstuhl f�r Bioinformatik, Institut f�r Informatik der
Friedrich-Schiller Universit�t Jena ist zum n�chstm�glichen Zeitpunkt
die Stellen

zweier Wissenschaftlicher Mitarbeiter (Post-Doktoranden oder Doktoranden)

zu besetzen. Die Stelle ist Teil des von der DFG gef�rderten Projekts
Identifying the Unknowns: Massenspektrometrische Identifikation kleiner
Molek�le. Im Rahmen dieses Projektes sollen informatische Methoden
entwickelt werden, um unbekannte Substanzen durch Massenspektrometrie zu
identifizieren, die in keiner Datenbank gefunden werden k�nnen. Wir
wollen f�r diese Aufgabe neue Modelle und Algorithmen entwickeln, um MS
Fragmentierungsdaten kleiner Molek�le interpretieren zu k�nnen. Fokus
der Forschung sind, neben der Entwicklung solcher Algorithmen, auch ihre
Implementierung, Evaluierung, Algorithm Engineering sowie Fallstudien.

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

Die Verg�tung erfolgt gem�� Entgeltgruppe 13 TV-L, es handelt sich um
volle Stellen (f�r Post-Doktoranden) bzw. 3/4 Stellen (f�r Doktoranden).
Die M�glichkeit zur wissenschaftlichen Qualifikation wird geboten. Die
Stelle ist befristet.

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

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

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

Prof. Dr. Sebastian B�cker

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

Bei einer Bewerbung auf eine Stelle in beiden Projekten IDUN und 3AGC
sollte dieser Umstand im Anschreiben klar erw�hnt werden.

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

[DMANET] SAT 2010 Second Call for Papers (Theory and Applications of Satisfiability Testing)

--------------------------------------
| SAT 2010 - Second Call for Papers |
------------------------------------
| 13th International Conference on |
| Theory and Applications of |
| Satisfiability Testing |
------------------------------------
| July 11 - July 14, 2010 |
| Edinburgh, Scotland, UK |
| Part of FLoC 2010 |
------------------------------------
| http://ie.technion.ac.il/SAT10 |
--------------------------------------

CONFERENCE CHAIRS

Ofer Strichman, Technion, Israel
Stefan Szeider, TU Vienna, Austria

INVITED SPEAKERS

Yehuda Naveh, IBM Haifa Research Lab, Israel
Ramamohan Paturi, University of California, USA

IMPORTANT DATES

Abstract Submission: February 1, 2010
Paper Submission: February 8, 2010
Author Notification: March 15, 2010
Final Version: April 5, 2010

SCOPE AND MISSION

The International Conference on Theory and Applications of
Satisfiability Testing SAT is the primary annual meeting for
researchers studying the propositional satisfiability problem. SAT
2010 is the thirteenth SAT conference. SAT 2010 features the SAT
Race, the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.

Many hard combinatorial problems can be encoded into SAT. Therefore
improvements on heuristics on the practical side, as well as
theoretical insights into SAT, apply to a large range of real-world
problems. More specifically, many important practical verification
problems can be rephrased as SAT problems. This applies to
verification problems in hardware and software. Thus SAT is becoming
one of the most important core technologies to verify secure and
dependable systems. The topics of the conference span practical and
theoretical research on SAT and its applications, and include, but
are not limited to:

* Proof Systems and Proof Complexity
* Search Algorithms and Heuristics
* Analysis of Algorithms
* Combinatorial Theory of Satisfiability
* Random Instances vs Structured Instances
* Problem Encodings
* Industrial Applications
* Applications to Combinatorics
* Solvers, Simplifiers and Tools
* Case Studies and Empirical Results
* Exact and Parameterized Algorithms

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

Paper submissions should contain original material and can either be
regular research papers up to 14 pages or short papers up to 6
pages. Submitted papers may include a technical appendix in addition
to the page restriction; however, the paper must be intelligible
without the appendix and PC members are not required to read the
appendix. Regular papers may be accepted as short papers, by
decision of the program committee. Double submissions including
submissions as short and long papers will be rejected. Submissions
should use the Springer LNCS style (see
www.springer.com/comp/lncs/Authors.html). All tables, figures and
the bibliography must fit into the page limit. Appendices that the
author considers as part of the final submission should fit in the
page limit as well. Submissions deviating from these requirements
may be rejected without review. All accepted papers including short
papers will be published in the proceedings of the conference, which
are expected to be published in Springer's LNCS series. The
submission page is www.easychair.org/conferences/?conf=sat10.
Papers have to be submitted electronically as PDF files.

AFFILIATED EVENTS

Information about SAT affiliated events, including workshops and
competitions can be found through the conference's web site
http://ie.technion.ac.il/SAT10. SAT 2010 is one of eight
conferences in the Federated Logic Conference FLoC 2010, see
http://floc-conference.org/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/
*
**********************************************************

[DMANET] PhD position in Barcelona

----------------------------------------------------------------------
PhD Position at UPC in Discrete/Combinatorial/Computational Geometry

At the Department of Applied Mathematics II of Universitat Politecnica
de Catalunya (UPC), Barcelona, Spain, there will very soon be an
opening for a PhD student in the aforementioned topics as part of a
project entitled "Discrete geometry: problems on combinatorics and
computation", funded by the Spanish "Ministerio de Ciencia e
Innovacion" (MICINN) in the program for young researchers FPI2010.

The MICINN call has not been launched yet, but it should happen by the
end of December, with an application deadline about 20 days later. The
outcome is expected to be known in about 6 months, and the position be
started by September 2010 (with some flexibility), for a period of
4 years.

Candidates should have finished their degree when the grant starts and
have a good background in mathematics and/or computer science, ideally
being strong in discrete mathematics.

The research subject can range among a variety of topics:

(a) Dr. Julian Pfeifle offers several PhD projects in discrete
geometry, ranging from specific questions in (lattice) polytope theory
to connections with neighboring areas in geometry, graph theory and
combinatorics. More details are available on request.
julian<DOT>pfeifle<AT>upc<dot>edu
http://www-ma2.upc.edu/~julian/

(b) Dr. Carlos Seara offers to supervise a research focusing on
algorithmic issues on the study of classifiers/discriminators with low
complexities for clases of colored objects in two and three
dimensions, as well as related discrepancy problems.
carlos<DOT>seara<AT>upc<dot>edu
http://www-ma2.upc.edu/seara/

Interested candidates are strongly advised to contact their potential
advisors now.

(c) Other members of the group might consider a PhD supervision but
should be contacted before submitting any applications.
Some information on the group can be found at
http://www-ma2.upc.es/~geomc/gcwww.html

More details about the similar call last year can be found at the web
of the Ministry (the information is in Spanish):
FPI 2009
(http://web.micinn.es/contenido.asp?menu1=1&menu2=&menu3=&dir=03_Pla
n_IDI/00-LIAs/00@LIARRHH/00-Formacion/00-FPI/001Con09)
BOE 2009-01-05 (http://www.boe.es/boe/dias/2009/01/05/pdfs/BOE-A-2009-172.pdf)
------------------------------------------------------------------------

Julian Pfeifle
DMA II, Universitat Politècnica de Catalunya
Edifici Omega, Campus Nord, Jordi Girona 1-3
E-08034 Barcelona, Spain
Tel ++34 93 4137714 www-ma2.upc.edu/~julian
Fax ++34 93 4137701 julian.pfeifle@upc.edu
**********************************************************
*
* 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] Permanent Position in Paris

*** Apologies for multiple copies ***

---------------------------------------------------------------------------
A permanent position as Associate Professor in Computer Science, profiled
Operations Research
---------------------------------------------------------------------------

A permanent position as Associate Professor is open at the Laboratoire
d'Informatique de Paris Nord (LIPN --- Computer Science Department of Paris
Nord University). The position is attached to LIPN UMR 7030 CNRS for the
research activities and to the IUT of Villetaneuse (10km in the north of
Paris, France) as for the teaching activities.

The interested candidates should contact Roberto Wolfler Calvo at:
roberto.wolfler@lipn.univ-paris13.fr.

-----------------------
Research Group
------------------------

The LIPN Combinatorial Optimization group develops both applied and theore
tical research activities in Integer Programming. The group is composed of two
Professors and four Associate Professors who specialize in various optimization
techniques, such as: mathematical programming, complexity; modelization; exact
methods and heuristics. The research activity mainly follows three directions:

- the definition of new approaches for solving mathematical programmming
problems (e.g. re-optimization, reformulation);
- the study of structural properties of discrete optimization problems
(e.g. decompositions and relaxations, polyhedral approach, approximation);
- the research of exact and heuristic solutions of problems coming from
different application (e.g. planification, multimodal transportation,
network design)

The group has a specific know-how on mathematical programming techniques
aimed at solving large-scale real life problems. It has recently developed some
collaborations with other research fields such as Image and Data mining.

Stimulated by several industrial collaborations, the group is seeking to expand
its knowledge base by acquiring competences in robustness, both at the analysis,
modelling and solution level.

-----------------------
Research competences
------------------------

The successful candidate will have a strong theoretical profile in
Combinatorial Optimization. Knowledge of mathematical programming in the
presence of uncertainty will be deemed a plus.

Keywords:
-----------------------
Teaching competences
------------------------

As for teaching in the computer science department of IUT an experience and a
natural predisposition for technical as well pratical aspects of computer
science are needed. The candidate will teach for the pole dealing with
Architecture, Systems and Networks, Software design and Web technologies.
Teaching occurs in French.

-------------------
Informqtion / further contacts
-------------------

Information :
Laboratoire : http://www-lipn.univ-paris13.fr
Composante : http://www.iutv.univ-paris13.fr/iutv/informatique.php

Contacts :
Directeur du laboratoire : Christophe Fouquere :
christophe.fouquere@lipn.univ-paris13.fr
Presidente du departement : Francoise Gayral :
gayral@iutv.univ-paris13.fr
-----------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] ORBEL 24

We would like to remind you that the next congress of the Belgian
Operations
Research Society, ORBEL 24,
will take place at HEC Management School of the University of Liege on
January 28 and 29, 2010.

The deadline for submitting papers has been extended until January 4, 2010.
If you have not yet submitted
your abstract, please do so as soon as possible.

Abstracts should be submitted using the template available on the conference
web page <http://www.orbel24.ulg.ac.be/> http://www.orbel24.be/
where all details regarding the organization of the conference can also be
found.
****************************************************************************
***************************
ORBEL 24
24th Annual Conference of the Belgian Operations Research Society
28 - 29 January 2010
Liege, Belgium
http://www.orbel24.be/
****************************************************************************
***************************

ORBEL is the annual conference of the SOGESCI-B.V.W.B.
<http://www.orbel.be/> , the Belgian Operations Research (OR) Society,
member of EURO <http://www.euro-online.org/> , the association of
European
OR Societies, and Belgian representative of IFORS
<http://www.ifors.org/>
(International Federation of OR Societies).

The conference is intended as a meeting place for researchers, users and
potential users of operations research, statistics, computer science and
related fields. It provides managers, practitioners and researchers with a
unique opportunity to exchange information on quantitative techniques for
decision making.

Conference dates and location:

ORBEL24 will take place on Thursday 28 and Friday 29 January 2010 in
Liege.

The meeting will be hosted at HEC-Management School of the
<http://www.hec.ulg.ac.be/> University of Liège and will be organised by
the HEC-ULg Centre for Quantitative Methods and Operations Management
(QuantOM) <http://www.quantom.hec.ulg.ac.be/>.

Plenary speakers:

Philippe Baptiste (CNRS – Ecole Polytechnique, France)

Michel Goemans (MIT, USA)

Contributed papers:

We invite all researchers, practitioners, and students interested in
quantitative methods for decision making to participate in the conference
and to present their work in all fields of methodology and application:

* continuous, discrete or stochastic optimization, graphs and
networks, multicriteria decision making, decision theory, game theory,
simulation, queueing theory, complexity theory, data mining, ...;

* supply chain management, production planning, scheduling,
project
management, transportation and traffic management, energy management,
DEA
and performance management, financial modelling, ...;

* applications in industry, in the energy sector, in life
sciences
and in bioinformatics, in public services, in engineering, in sports, in
health care institutions, in banking, in telecommunications, ...;

Abstract submission :

Authors are invited to submit an extended abstract in LaTeX format (up
to
two A4 pages) using the template available on the conference web page
www.orbel24.be <http://www.orbel24.be/> .

Submission of the abstract through the conference web page is
encouraged.

Important Dates:

Deadline for abstract submissions: December 15, 2009

Acceptance of notification: January 14, 2010
Deadline for early registration: January 20, 2010

Scientific committee:

Yasemin Arda (HEC-ULg)

Raymond Bisdorff (U.Luxembourg)

Yves Crama (HEC-ULg)

Patrick De Causmaecker (K.U.Leuven)

Bernard Fortz (ULB)

Francois Glineur (UCL)

Gerrit Janssens (UHasselt)

Pierre Kunsch (VUB)

Sabine Limbourg (ULg)

Etienne Loute (UCL)

Quentin Louveaux (ULg)

Marc Pirlot (U.Mons)

Frank Plastria (VUB)

Michaël Schyns (HEC-ULg)

Johan Springael (U.Antwerpen)

Filip Van Utterbeeck (RMA)

Sabine Wittevrongel (U.Gent)
**********************************************************
*
* 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] ISCO 2010 Extended deadline

International Symposium on Combinatorial Optimization (ISCO)

24-26 March, 2010, Hammamet, Tunisia,

http://www.lamsade.dauphine.fr/~isco/
------------------------------------------------------------

Following the request of several authors, the submission deadline
of ISCO 2010 is now extended to December 27, 2009.

The ISCO Organizing Committee

**********************************************************
*
* 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 in Algorithms and Security, University of Edinburgh

The School of Informatics, University of Edinburgh invites
applications for TWO posts (one Chaired Professorship and one
Readership (appx. Associate Professorship)), from candidates
with research of international standing in either of the
following TWO areas:

Algorithms and Computational Complexity

The appointee will have an excellent research record in any active
area of algorithms and computational complexity including: randomized
algorithms, approximation algorithms, combinatorial optimization,
algorithmic game theory, complexity theory, and distributed
algorithms. The successful candidate is anticipated to join the
Laboratory for Foundations of Computer Science within the School
of Informatics. The laboratory's current research in algorithms and
complexity covers randomized algorithms, algorithmic game theory,
computational complexity, approximation algorithms, combinatorial
and stochastic optimization, algebraic complexity, quantum computing,
and descriptive complexity.

Computer Security

The appointee will have an outstanding research record in one or more
areas of computer security. Areas that match our current strengths
include: theoretical foundations of security, database security,
programming language based security, security properties of mobile
and concurrent systems, automated logical analysis of protocol
correctness, and security analysis of APIs. Applications are also
highly encouraged from areas that complement our current strengths:
cryptography and network security. The post will be associated with
the Scottish Informatics and Computer Science Alliance (SICSA) and it
is anticipated that the appointee will join the Laboratory for
Foundations of Computer Science (LFCS).

There are two posts. Candidates for either post (Professor or Reader)
may be from either area of interest.

Salary details:

Chair Professorship:
Grade 10 - salary from 53,650 British Pounds (GBP) pa.
Reader:
Grade 9 - salary 47,278 to 52,086 GBP pa.

Appointment at lecturer level (approximately Assistant Professor)
(grade 8: 36,532 - 43,622 GBP pa)
may be considered for a less experienced, but exceptional candidate.

Informal enquiries about the positions can be made to Professor Philip
Wadler, Director of LFCS (telephone+44 131 650 5174, email:
wadler@inf.ed.ac.uk), to Dr Mary Cryan (telephone: +44 131 650 5153,
email: mcryan@inf.ed.ac.uk), Dr. Rahul Santhanam (telephone: ++44 131
651 5606, email: rsanthan@inf.ed.ac.uk), and Dr. Kousha Etessami (+44
131 650 5197, email: kousha@inf.ed.ac.uk).

Closing date for applications for both posts: 26 February 2010.

Further details and electronic application form here:
https://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3012132
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

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

Faculty Positions at The School of Informatics, University of Edinburgh

The School of Informatics, University of Edinburgh invites
applications for TWO posts (one Chaired Professorship and one
Readership (appx. Associate Professorship)), from candidates
with research of international standing in either of the
following TWO areas:

Algorithms and Computational Complexity

The appointee will have an excellent research record in any active
area of algorithms and computational complexity including: randomized
algorithms, approximation algorithms, combinatorial optimization,
algorithmic game theory, complexity theory, and distributed
algorithms.  The successful candidate is anticipated to join the
Laboratory for Foundations of Computer Science within the School
of Informatics. The laboratory's current research in algorithms and
complexity covers randomized algorithms, algorithmic game theory,
computational complexity, approximation algorithms, combinatorial
and stochastic optimization, algebraic complexity, quantum computing,
and descriptive complexity.

Computer Security

The appointee will have an outstanding research record in one or more
areas of computer security. Areas that match our current strengths
include: theoretical foundations of security, database security,
programming language based security, security properties of mobile
and concurrent systems, automated logical analysis of protocol
correctness, and security analysis of APIs. Applications are also
highly encouraged from areas that complement our current strengths:
cryptography and network security.  The post will be associated with
the Scottish Informatics and Computer Science Alliance (SICSA) and it
is anticipated that the appointee will join the Laboratory for
Foundations of Computer Science (LFCS).


There are two posts.  Candidates for either post (Professor or Reader)
may be from either area of interest.

Salary details:

Chair Professorship:
Grade 10 - salary from 53,650 British Pounds (GBP) pa.
Reader:
Grade 9 - salary 47,278 to 52,086 GBP pa.

Appointment at lecturer level (approximately Assistant Professor)
(grade 8: 36,532 - 43,622 GBP pa)
may be considered for a less experienced, but exceptional candidate.

Informal enquiries about the positions can be made to Professor Philip
Wadler, Director of LFCS (telephone+44 131 650 5174, email:
wadler@inf.ed.ac.uk), to Dr Mary Cryan (telephone: +44 131 650 5153,
email: mcryan@inf.ed.ac.uk), Dr. Rahul Santhanam (telephone: ++44 131
651 5606, email: rsanthan@inf.ed.ac.uk), and Dr. Kousha Etessami (+44
131 650 5197, email: kousha@inf.ed.ac.uk).

Closing date for applications for both posts:  26 February 2010.

Further details and electronic application form here:
https://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3012132






--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

Ph D position in Barcelona

------------------------------------------------------------------------
Ph D Position at UPC in Discrete/Combinatorial/Computational Geometry

At the Department of Applied Mathematics II of Universitat Politecnica
de Catalunya (UPC), Barcelona, Spain, there will very soon be an opening
for a PhD student in the aforementioned topics as part of a project
entitled "Discrete geometry: problems on combinatorics and computation",
funded by the Spanish "Ministerio de Ciencia e Innovacion" (MICINN)
inside the program for young researchers FPI2010.

The MICINN call has not been launched yet, but it should happen by the
end of December, with an application deadline about 20 days later. The
outcome is expected to be known in about 6 months, and the position be
started by September
2010 (with some flexibility), for a period of 4 years.

Candidates should have finished their degree when the grant starts and
have a good background in mathematics and/or computer science, ideally
being strong in discrete mathematics.

The research subject can range among a variety of topics:

(a) Dr. Julian Pfeifle offers several PhD projects in discrete geometry,
ranging from specific questions in (lattice) polytope theory to
connections with neighboring areas in geometry, graph theory and
combinatorics. More details are available on request.
julian<DOT>pfeifle<AT>upc<dot>edu
http://www-ma2.upc.edu/~julian/
http://bibliotecnica.upc.es/fenixdoc/Invest.asp?Id=0028035&UE=726&tipus=recerca&Idm=cat

(b) Dr. Carlos Seara offers to supervise ...
carlos<DOT>seara<AT>upc<dot>edu
http://www-ma2.upc.edu/seara/

Interested candidates are strongly advised to contact their potential
supervisors now.

(c) Other members of the group might consider a Ph D supervision but
should be contacted before submitting any applications. Some information
on the group can be found at
http://www-ma2.upc.es/~geomc/gcwww.html

More details about the similar call last year can be found in the web of
the Ministry (the information is in Spanish):
FPI 2009
(http://web.micinn.es/contenido.asp?menu1=1&menu2=&menu3=&dir=03_Plan_IDI/00-LIAs/00@LIARRHH/00-Formacion/00-FPI/001Con09)
BOE 2009-01-05
(http://www.boe.es/boe/dias/2009/01/05/pdfs/BOE-A-2009-172.pdf)
------------------------------------------------------------------------

[DMANET] Full Professor in Probability and Statistics

University of Twente, The Netherlands, Department of Applied
Mathematics, searches candidates for a

******* Full Professor in Probability and Statistics ***********

The Department of Applied Mathematics of the Faculty of Electrical
Engineering, Mathematics and Computer Science offers a Bachelors and
Masters program in Applied Mathematics and mathematics teaching within
many other academic programs at the University of Twente. The
Department has an extensive research program supported by contacts
with government institutions, industry and participation in national
and European projects. The research of the Department is part of the
programs of the UT research institutes CTIT, IMPACT, MIRA and MESA+
and organized into three programs: Stochastics and Operations
Research; Deterministic and Stochastic Systems Theory; and Applied
Analysis and Computational Science.

Probability and Statistics are essential in many application areas in
science and technology. Any technological endeavor is confronted with
limitations imposed by uncertainty or noise. In order to cover this
important research area the Department is looking for a full Professor
in Probability and Statistics. The current research group focuses
primarily on statistics but, with the (impending) retirement of the
full professor and two of his associate professors we have come at a
crossroad which enables the successful candidate to build a new group
with strong links both inside the department, in the university but
clearly also internationally. The research in Probability and
Statistics should attain a balance between fundamental research in
Probability and Statistics and applications relevant for the
University of Twente.

The department is primarily looking for an excellent mathematician
with a strong background in one or more of the research areas in the
broad field of probability and statistics. However, the successful
candidate should also have affinity with, and interest in, the
application of his expertise in the application areas studied at the
University of Twente.
In building a new group, the successful candidate is expected to
obtain a broad scope within the group with high level expertise in
both Probability and Statistics. The specific expertise of the new
professor within the field of Probability and Statistics is quite open
and can range from stochastic processes to risk modeling and extreme
events; from stochastic analysis to statistical process control; from
random graphs and matrices to statistics for complex systems.

Depending on the background of the candidate's favorable application
areas will be in: Health care, Mathematical Physics, Financial
Engineering, Psychometrics, or Probability and Computing.

The chair Probability and Statistics has an important role in the
teaching programs within the Department of Applied Mathematics and in
Service Teaching. Nearly all teaching programs at the University of
Twente require (advanced) classes in statistics and probability.
Teaching at the Masters and PhD level, which will be part of the
recently established UT Graduate School, requires a close link with
the research in Probability and Statistics.

The successful candidate will head the PRS group. He/she is expected
to develop the above research agenda further, extend and maintain
(interdisciplinary) collaboration at local, national and international
level, and be engaged in the group's teaching activities. Candidates
must have an outstanding publication record, excellent leadership,
communicational and management qualities, a strong vision on future
development of the field and very good teaching skills. Applicants
must have a PhD in a relevant area and the ability to acquire external
research funds. For young talented researchers a special tenure track
is possible. We explicity invite them to apply.

The University offers a full time tenured position as Professor, with
a competitive salary (maximum Euro 8.622,- gross per month) and
benefits commensurate with your position, experience and qualifications.

Interested candidates, particularly women, are invited to send a
resume, publication list and a statement of their research and
teaching interests by January 15th 2010 to the University of Twente,
attn. Prof.dr.ir. A. J. Mouthaan, Dean of the Faculty of Electrical
Engineering, Mathematics and Computer Science, P.O Box 217, 7500 AE
Enschede, The Netherlands. Or by email: A.J.Mouthaan@ewi.utwente.nl
**********************************************************
*
* 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] Obituary Ray Solomonoff

Obituary: Ray Solomonoff, Founding Father of Algorithmic Information Theory

Ray J. Solomonoff, founding father of Algorithmic Information
Theory, died on December 7, 2009, of complications
of a stroke caused by an aneurism in his head. Ray was the
first inventor of Algorithmic Information Theory which
deals with the shortest effective description length of objects
and is commonly designated by the term ``Kolmogorov complexity.''

The latter notion was a side product of his approach to induction.
His crucial results concerning prediction, in 1960 and later,
partially resolve the old philosophical problem concerning how to
obtain a valid prior distribution in Bayes's rule by showing that
a single ``universal'' distribution can be used instead of any computable
prior with almost the same resulting predictions. This may be viewed
as a central problem of Artificial Intelligence, Machine
Learning and Statistical Inference--with the caveat that the universal
distribution is incomputable. Solomonoff's theory has led to feasible
induction and prediction procedures.

Ray Solomonoff is survived by his wife, Grace Morton, 72 Winter Street,
Arlington, MA 02474, and by his nephew, Alex Solomonoff, of Somerville.

An obituary outlining Solomonoff's contributions to science
together with biographical remarks is at

http://homepages.cwi.nl/~paulv/obituary.html

--
Paul Vitanyi, CWI, Science Park 123, 1098 XG Amsterdam, The Netherlands,
Tel. (+)31 20 5924124; Fax (+)31 20 5924199; paulv@cwi.nl;
http://www.cwi.nl/~paulv/
**********************************************************
*
* 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/
*
**********************************************************

obituary Ray Solomonoff

Obituary: Ray Solomonoff, Founding Father of Algorithmic Information Theory

Ray J. Solomonoff, founding father of Algorithmic Information
Theory, died on December 7, 2009, of complications
of a stroke caused by an aneurism in his head. Ray was the
first inventor of Algorithmic Information Theory which
deals with the shortest effective description length of objects
and is commonly designated by the term ``Kolmogorov complexity.''

The latter notion was a side product of his approach to induction.
His crucial results concerning prediction, in 1960 and later,
partially resolve the old philosophical problem concerning how to
obtain a valid prior distribution in Bayes's rule by showing that
a single ``universal'' distribution can be used instead of any computable
prior with almost the same resulting predictions. This may be viewed
as a central problem of Artificial Intelligence, Machine
Learning and Statistical Inference--with the caveat that the universal
distribution is incomputable. Solomonoff's theory has led to feasible
induction and prediction procedures.

Ray Solomonoff is survived by his wife, Grace Morton, 72 Winter Street,
Arlington, MA 02474, and by his nephew, Alex Solomonoff, of Somerville.

An obituary outlining Solomonoff's contributions to science
together with biographical remarks is at

http://homepages.cwi.nl/~paulv/obituary.html

--
Paul Vitanyi, CWI, Science Park 123, 1098 XG Amsterdam, The Netherlands,
Tel. (+)31 20 5924124; Fax (+)31 20 5924199; paulv@cwi.nl;
http://www.cwi.nl/~paulv/

CfP SIROCCO 2010: Submission site is open

*** Apologies for multiple copies ***

IMPORTANT: Submission site is open!
______________________________________________________________________

Call for papers

SIROCCO 2010

17th International Colloquium on
Structural Information and Communication Complexity

June 7-11, 2010
Sirince, Turkey

http://www.sirocco2010.boun.edu.tr/
______________________________________________________________________

Important dates
===============

Submission deadline: January 31, 2010 (5pm CET)
Author notification: March 21, 2010
Camera-ready submission: April 4, 2010
______________________________________________________________________

Theme
=====

SIROCCO is devoted to the study of communication and knowledge in
multi-processor systems from both the qualitative and quantitative
viewpoints. Special emphasis is given to innovative approaches and
fundamental understanding, in addition to efforts to optimize current
designs.

Conference
==========

SIROCCO has a tradition of interesting and productive scientific
meetings in a relaxed and pleasant atmosphere, attracting leading
researchers in a variety of fields in which communication and
knowledge play a significant role. This year, SIROCCO is held in
Turkey, in the Nesin Mathematics Village, located in the midst of a
beautiful scenery, close to the sea and to the ancient city of
Ephesus.

Scope
=====

Original papers are solicited from all areas of study of local
structural knowledge and global communication and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, and communication complexity. Keeping with the tradition of
SIROCCO, new areas are always welcome.

SIROCCO Award
=============

The Prize for Innovation In Distributed Computing is awarded annually
in the SIROCCO conference to recognize individuals whose research
contributions had a major impact on the understanding of the
relationships between information and efficiency in decentralized
computing. Only authors of papers that were published in SIROCCO are
eligible to receive the award. More details are available in the
SIROCCO 2010 web site.
______________________________________________________________________

Submission
==========

Submissions should be made through the on-line submission site:
http://www.easychair.org/conferences/?conf=sirocco2010
Submitted papers must be written in English and must not exceed 12
pages, including the title page, figures, tables and references. The
submission must be made using 11-point font and reasonable margins.
Submissions deviating from these guidelines risk rejection without
consideration of their contents. The deadline for submitting a
paper is *January 31, 5pm CET*. Notification of acceptance will be
sent out by March 21, and the camera-ready papers are due on April 4.

Publication
===========

The proceedings of SIROCCO 2010 will be published by Springer-Verlag
as a part of the LNCS series. Selected papers will be invited to a
special issue of the journal /Theoretical Computer Science/.
______________________________________________________________________

Conference oragnization
=======================

Program Committee Chair
-----------------------
Boaz Patt-Shamir (Tel Aviv U.)

Program Committee
-----------------
Amotz Bar-Noy (CUNY)
Joffroy Beauquier (U. Paris-Sud, LRI)
Andrea Clementi (U. Roma)
Tinaz Ekim (Bogazici U.)
Robert Elsasser (U. Paderborn)
Pinar Heggernes (U. Bergen)
Elias Koutsoupias (U. Athens)
Alex Kesselman (Google)
Thomas Moscibroda (Microsoft)
Dariusz Kowalski (U. Liverpool)
Thomas Sauerwald (SFU & PIMS)
Maria Serna (U. Pol. Catalunya)
Peter Widmayer (ETH)

Steering Committee Chair
------------------------
Pierre Fraigniaud (CNRS & U. Paris Diderot)

Steering Committee
------------------
Pascal Felber (U. Neuchatel)
Paola Flocchini (U. Ottawa)
Lefteris Kirousis (U. Patras)
Rastislav Kralovic (Comenius U.)
Evangelos Kranakis (Carleton U.)
Danny Krizanc (Wesleyan U.)
Bernard Mans (Macquarie U.)
David Peleg (Weizmann)
Giuseppe Prencipe (Pisa U.)
Nicola Santoro (Carleton U.)
Alex Shvartsman (U. Connecticut)
Pavlos Spirakis (CTI & U. Patras)
Shmuel Zaks (Technion)
Janez Zerovnik (U. Ljubljana)

Local Arrangements
------------------
Tinaz Ekim (Bogazici U.)
Arman Boyaci (Bogazici U.)

Publicity Chair
---------------
David Ilcinkas (CNRS & U. Bordeaux)

[DMANET] CfP SIROCCO 2010: Submission site is open

*** Apologies for multiple copies ***

IMPORTANT: Submission site is open!
______________________________________________________________________

Call for papers

SIROCCO 2010

17th International Colloquium on
Structural Information and Communication Complexity

June 7-11, 2010
Sirince, Turkey

http://www.sirocco2010.boun.edu.tr/
______________________________________________________________________

Important dates
===============

Submission deadline: January 31, 2010 (5pm CET)
Author notification: March 21, 2010
Camera-ready submission: April 4, 2010
______________________________________________________________________

Theme
=====

SIROCCO is devoted to the study of communication and knowledge in
multi-processor systems from both the qualitative and quantitative
viewpoints. Special emphasis is given to innovative approaches and
fundamental understanding, in addition to efforts to optimize current
designs.

Conference
==========

SIROCCO has a tradition of interesting and productive scientific
meetings in a relaxed and pleasant atmosphere, attracting leading
researchers in a variety of fields in which communication and
knowledge play a significant role. This year, SIROCCO is held in
Turkey, in the Nesin Mathematics Village, located in the midst of a
beautiful scenery, close to the sea and to the ancient city of
Ephesus.

Scope
=====

Original papers are solicited from all areas of study of local
structural knowledge and global communication and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, and communication complexity. Keeping with the tradition of
SIROCCO, new areas are always welcome.

SIROCCO Award
=============

The Prize for Innovation In Distributed Computing is awarded annually
in the SIROCCO conference to recognize individuals whose research
contributions had a major impact on the understanding of the
relationships between information and efficiency in decentralized
computing. Only authors of papers that were published in SIROCCO are
eligible to receive the award. More details are available in the
SIROCCO 2010 web site.
______________________________________________________________________

Submission
==========

Submissions should be made through the on-line submission site:
http://www.easychair.org/conferences/?conf=sirocco2010
Submitted papers must be written in English and must not exceed 12
pages, including the title page, figures, tables and references. The
submission must be made using 11-point font and reasonable margins.
Submissions deviating from these guidelines risk rejection without
consideration of their contents. The deadline for submitting a
paper is *January 31, 5pm CET*. Notification of acceptance will be
sent out by March 21, and the camera-ready papers are due on April 4.

Publication
===========

The proceedings of SIROCCO 2010 will be published by Springer-Verlag
as a part of the LNCS series. Selected papers will be invited to a
special issue of the journal /Theoretical Computer Science/.
______________________________________________________________________

Conference oragnization
=======================

Program Committee Chair
-----------------------
Boaz Patt-Shamir (Tel Aviv U.)

Program Committee
-----------------
Amotz Bar-Noy (CUNY)
Joffroy Beauquier (U. Paris-Sud, LRI)
Andrea Clementi (U. Roma)
Tinaz Ekim (Bogazici U.)
Robert Elsasser (U. Paderborn)
Pinar Heggernes (U. Bergen)
Elias Koutsoupias (U. Athens)
Alex Kesselman (Google)
Thomas Moscibroda (Microsoft)
Dariusz Kowalski (U. Liverpool)
Thomas Sauerwald (SFU & PIMS)
Maria Serna (U. Pol. Catalunya)
Peter Widmayer (ETH)

Steering Committee Chair
------------------------
Pierre Fraigniaud (CNRS & U. Paris Diderot)

Steering Committee
------------------
Pascal Felber (U. Neuchatel)
Paola Flocchini (U. Ottawa)
Lefteris Kirousis (U. Patras)
Rastislav Kralovic (Comenius U.)
Evangelos Kranakis (Carleton U.)
Danny Krizanc (Wesleyan U.)
Bernard Mans (Macquarie U.)
David Peleg (Weizmann)
Giuseppe Prencipe (Pisa U.)
Nicola Santoro (Carleton U.)
Alex Shvartsman (U. Connecticut)
Pavlos Spirakis (CTI & U. Patras)
Shmuel Zaks (Technion)
Janez Zerovnik (U. Ljubljana)

Local Arrangements
------------------
Tinaz Ekim (Bogazici U.)
Arman Boyaci (Bogazici U.)

Publicity Chair
---------------
David Ilcinkas (CNRS & U. Bordeaux)
**********************************************************
*
* 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/
*
**********************************************************

Faculty Position, Sapienza University of Rome

Faculty (tenured assistant professor) position in Computer Science and
Engineering at Sapienza University of Rome, Department of Computer and
System Sciences

The Computer Science and Engineering group at the Department of Computer and
System Sciences <a href="http://www.dis.uniroma1.it">Department of Computer
and System Sciences</a> of Sapienza University of Rome invites young
researchers holding a PhD in Computer Science and/or Engineering interested
in applying for a faculty (tenured assistant professor) position at our
School to contact the recruiting committee of our Department.

We especially invite highly qualified candidates with a strong record on:

1. Publications in first class journals and conferences
2. Post-doc positions held at prestigious academic and research institutions
3. Leadership and independence
4. System and technology development
5. Visibility in the scientific community (e.g., program committees,
participation to research projects, organization of scientific
5. Visibility in the scientific community (e.g., program committees,

to send a CV, a Research statement and a list of references from renown
researchers and academics in the field to

RecruitingCSE@dis.uniroma1.it

In order to compete for the position a formal application must also be
submitted by January 3rd, 2010. Further information are available <a
href="http://www.dis.uniroma1.it/index.php?option=com_content&task=view&id=9124&Itemid=1">here</a>
or can be requested at RecruitingCSE@dis.uniroma1.it

Candidates actively working in all areas of Computer Science and Engineering
are sought. Our department also offers two graduate degree courses taught in
English, one in Computer Science and Engineering and one in Artificial
Intelligence and Robotics. A limited number of candidates will be invited to
visit and give a talk at our school.

Useful link:

<a
href="http://www.dis.uniroma1.it/index.php?option=com_content&task=view&id=9124&Itemid=1&lang=it">Research
at DIS</a>

[DMANET] Polymatroids etcetera: Algorithms and Pretty Theorems, by Jack Edmonds, Barcelona January 11-21 2010

Course announcement
-------------------------------------------------------------------------------------
Polymatroids etcetera: Algorithms and Pretty Theorems
by Jack Edmonds

January 11 to 21, 2010

Facultat de Matematiques i Estadistica
Universitat Politecnica de Catalunya
Barcelona, Spain
--------------------------------------------------------------------------------------
Course Description

A variety of combinatorial existence theorems will be proved by
algorithms which
tell how to find an instance of what is asserted to exist.
Another main purpose will be to introduce polyhedral combinatorics,
which uses systems of linear equations to obtain algorithms and theorems.
Emphasis will be on matroids and polymatroids with a variety of
applications,
especially to tree systems and branching systems in networks.
Books and graph theory and combinatorial optimization will be resources.
Drafts of notes will be incrementally available.
-------------------------------------------------------------------------------------
Some quotes from the book 'Combinatorial Optimization', by Lex Schrijver
(Springer, 2000)

"Pionereed by the work of Jack Edmonds, polyhedral combinatorics has
proved to be a most powerful, coherent and unifying tool throughout
combinatorial optimization. Not only has it led to efficient (that is,
polynomial-time) algorithms, but also, conversely, efficient algorithms
often
imply polyhedral characterizations and related min-max relations. It
makes the two sides closely intertwined."

" In the 1960's Edmonds advocated calling an algorithm efficient [or
"good"] if its running time is bounded by a polynomial in the size of its
representation. Since then, this criterion has won broad acceptance,
also because Edmonds found polynomial-time algorithms for several
important optimization problems"

"Edmonds conjectured that there is no polynomial-time algorithm for the
traveling salesman problem. In language that was
developed later, this is equivalent to NP?P."
------------------------------------------------------------------------------------
Registration

Please send an email tagged 'Edmonds2010Course', as soon as possible,
to info.osrm@upc.edu, indicating your situation and email address.

There is no registration fee.

Further information at

https://www-ma4.upc.edu/~oserra/seminari/jackedmonds2010.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/
*
**********************************************************

[DMANET] EGRES OPEN

The Egerv\'ary Research Group (EGRES) launched a new research forum,
called EGRES OPEN ( http://www.cs.elte.hu/egres/open ).


One aim of this website is to continuously expanding (and hopefully
occasionally shrinking) a collection of open problems that may be
interesting for a broader audience, with a discussion forum open to
anyone in the combinatorial optimization community. A special feature
of this site is that we place the research problems in a larger
context by including surveys and explanations that highlight
motivations and connections between the various questions and existing
results. It is our goal to promote joint researches, to help graduate
students in finding promising research areas, to support researchers
in preparing research proposals.

New problems, solutions, observations or just
any remarks, questions or suggestions concerning any aspects of EGRES
OPEN are most warmly appreciated. Please contact Tam\'as Kir\'ly
(tkiraly@cs.elte.hu) or Andr\'as Frank (frank@cs.elte.hu).

On behalf of EGRES Group: Andr\'as Frank

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

Post-doc position in Approximation Algorithms

West Virginia University
Postdoctoral Associate Positions in Approximation Algorithms

The Lane Department of Computer Science and Electrical Engineering invites applications
for multiple postdoctoral positions in the field of Approximation Algorithms. Duties include
design and development of approximation algorithms for problems in risk management and
computer security.

Required qualifications include an earned Ph.D. in theoretical computer science (with an
emphasis on approximation algorithm design) or applied mathematics or a closely related
discipline. Some experience in risk management and computer security is preferred but not
essential.

West Virginia University (www.wvu.edu) is a comprehensive land-grant research institution
enrolling over 28,000 students in 113 degree programs, including engineering and health
sciences. Interested candidates must send a letter of application, a CV and contact information
for at least three references to k.subramani@mail.wvu.edu. Review of completed applications will
commence January 1 and the positions will remain open until filled. West Virginia University is and
affirmative action, equal opportunity employer dedicated to building a culturally diverse and
plurastic faculty and staff committed to teaching and working in a multicultural environment.
Applications are strongly encouraged from women, minorities, individuals with disabilities and
covered veterans.

[DMANET] Post-doc position in Approximation algorithms

West Virginia University
Postdoctoral Associate Positions in Approximation Algorithms

The Lane Department of Computer Science and Electrical Engineering invites
applications for multiple postdoctoral positions in the field of Approximation Algorithms.
Duties include design and development of approximation
algorithms for problems in risk management and computer security.

Required qualifications include an earned Ph.D. in theoretical computer
science (with an emphasis on approximation algorithm design) or applied
mathematics or a closely related discipline.
Some experience in risk management and computer security is preferred but
not essential.

West Virginia University (www.wvu.edu) is a comprehensive land-grant
research institution enrolling over 28,000 students in 113 degree
programs, including engineering and health sciences.

Interested candidates must send a letter of application, a CV and contact
information for at least three references to k.subramani@mail.wvu.edu.
Review of completed applications will commence January 1 and the positions
will remain open until filled.

West Virginia University is and affirmative action, equal opportunity
employer dedicated to building a culturally diverse and plurastic faculty
and staff committed to teaching and working in a multicultural environment.
Applications are strongly encouraged from women, minorities, individuals
with disabilities and covered veterans.
**********************************************************
*
* 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 -- IntelNet 2010 in conjunction with CIT'10 :: Special Issues

>>>>>>> Submission Deadline Extended to February 11, 2010 <<<<<<<

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

Distinguished selected papers, after further extensions, will be published
in CIT 2010's special issues of the following prestigious SCI-indexed
journals:

-- The Journal of Supercomputing - Springer
-- Journal of Computer and System Sciences - Elsevier
-- Concurrency and Computation: Practice and Experience - John Wiley & Sons

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

CALL FOR PAPERS

The 2010 International Workshop on Intelligent Sensor and Wireless
Networks (IntelNet 2010)

To be held in conjunction with CIT'10 (Supported by IEEE Computer
Society), June 29 - July 1, 2010, Bradford, UK

http://www.inf.brad.ac.uk/~xjin/IntelNet10/index.html
http://www.scim.brad.ac.uk/~ylwu/CIT2010/

SCOPE:

Modern sensor and wireless networks have been becoming more and more
large-scaled and complicated. Due to their rapidly increasing scale
and complexity, the management and maintenance of sensor and wireless
networks have posed many grand challenges to both industrial and
academic communication communities. To overcome these challenges, it
is very necessary to find new levels of autonomy and intelligence in
deploying, managing, and maintaining sensor and wireless networks.

The purpose of the 2010 International Workshop on Intelligent Sensor
and Wireless Networks (IntelNet 2010) is to bring together scientists,
researchers, professionals, and practitioners from both industry and
academia to exchange ideas, discuss solutions, share experiences, and
report state-of-the-art research results on various aspects of
intelligent sensor and wireless networks. The topics of interest
include, but are not limited to:

-- Advanced Technologies for Enabling Intelligent and Autonomic
Communications
-- Autonomy-Oriented Sensor/Wireless Networks
-- Biological, Social, and Economic Models for Intelligent Networks
-- Bio-Inspired Network Protocol Design
-- Bio-Inspired Network Services
-- Bio-Inspired Sensor/Wireless Networks
-- Characterization and Detection of Emergent Properties in Self-
Organizing Networks
-- Complex Dynamics of Autonomous Communication Networks
-- Experimental Case Studies and Testbeds of Intelligent Networks
-- Novel Design and Management Technologies for Autonomic Sensor/
Wireless Networks
-- Scalability and Complexity of Self-Organizing Communication
Networks
-- Self-Organization in Autonomic Communication Networks
-- Self-Organizing, Self-Adaptive and Self-Tuning Sensor/Wireless
Networks
-- Sensing, Monitoring, Evaluation, and Measurements of Intelligent
Networks
-- Stability and Dependability of Intelligent Sensor/Wireless
Networks
-- Tools and Techniques for Designing, Implementing, and Analyzing
Intelligent Sensor/Wireless Networks

GENERAL CHAIR:

Xiaolong Jin
School of Informatics
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: x.jin@brad.ac.uk

PROGRAM CHAIRS:

Lei Liu
Department of Computing
University of Bradford
Bradford, BD7 1DP, U.K.
E-mail: l.liu6@brad.ac.uk

Hui Cheng
Department of Computer Science
University of Leicester
Leicester, LE1 7RH
U.K.
E-mail: hc118@le.ac.uk

STEERING COMMITTEE:

Jiming Liu, Hong Kong Baptist University, Hong Kong
Ruqian Lu, Chinese Academy of Sciences, China

PAPER SUBMISSION:

Authors are invited to submit manuscripts reporting original unpublished
research and recent developments in the topics related to the workshop.
The length of the papers should not exceed 8 pages (IEEE Computer
Society Proceedings Manuscripts style: two columns, single-spaced),
including figures and references, using 10 fonts, and number each page.
Papers should be submitted electronically in PDF format (or postscript) by
sending it as an e-mail attachment to Xiaolong Jin (x.jin@bradford.ac.uk).
All papers will be peer reviewed and the comments will be provided to the
authors. The accepted papers will be published together with those of
other CIT'10 workshops by the IEEE Computer Society Press.

IMPORTANT DATES:

Submission Deadline: February 11, 2010
Author Notification: March 26, 2010
Final Manuscript Due: April 18, 2010
Registration Due: April 18, 2010
Conference Date: June 29 - July 1, 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/
*
**********************************************************

FAW 2011

A number of researchers are working to make the International
Frontiers of Algorithmics Workshop (FAW)
the premier conference in Asia for presenting research results in the
area of algorithms.
The FAW'2010 conference will be held on August 11-13, 2010 in Wuhan,
China and the deadline for submissions is March 1, 2010.
The conference website can be accessed at http://www.faw2010.org. I
hope that you will help us in this effort
by submitting a paper and encouraging your colleagues and students to
also submit.



All papers will be carefully refereed by a program committee of
international experts
led by PC co-Chairs DT Lee and Danny Chen, and only the best
will be selected for the conference.  This will mean that having a
paper accepted will be a recognition that the author is among the top
researchers in Asia.  Those institutions with multiple acceptances
will become recognized as the leading research intensive institutions
in the area of algorithms.



Our most recent conference has had first-rate invited speakers including
Guoliang Chen, Andy Yao, and Frances Yao, with excellent works from
major research institutes such as Chinese Academy of Sciences,
Microsoft Research Asia, and others. We hope your effort
to present your best works at the conference, and being part of it,
will help to enrich its academy quality and at the same time to
promote your institute's international visibility in algorithmic research area.



An exciting component of the workshop will be several s
essions for students and new researchers on how to
get started on research.  As part of this activity,
along with several noted researchers, I will discuss some
new research problems and help students make some initial progress.
By illustrating some possible first steps, the hope is that this activity
will lead to several papers at FAW 2011.

[DMANET] Doctoral studies in Management Science at the University of Oxford

Title: Doctoral studies in Management Science at the University of Oxford

The Said Business School is interested in receiving applications from people
interested in studying for a PhD in the Management Science area. The group
consists of Dolores Romero Morales and James W. Taylor, and their research
interests can be found at:
http://www.sbs.ox.ac.uk/research/managementscience/Pages/People.aspx
Information regarding funding is available at:
http://www.sbs.ox.ac.uk/Documents/newsletters/DPhil_Funding_flyer_Dec_09.html

The closing date for applications is 08 January 2010.

Dolores Romero Morales
Reader in Operations Research
Said Business School
University of Oxford
United Kingdom
email: Dolores.Romero-Morales@sbs.ox.ac.uk
web: www.doloresromero.com<http://www.doloresromero.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/
*
**********************************************************