Wednesday, December 9, 2009

Call for Papers: ICLP 2010

[Sorry, in case of multiple postings]

------------------------------------------------------------------------
CALL FOR PAPERS
26th International Conference on Logic Programming (ICLP 2010)

Edinburgh, Scotland, U.K., July 16-19, 2010
ICLP 2009 will be held as part of the
Fifth Federated Logic Conference (FLoC 2010)
Submission deadline: January 26, 2010

http://www.floc-conference.org/ICLP-home.html
----------------------------------------------------------------------

CONFERENCE SCOPE

Since the first conference held in Marseilles in 1982, ICLP has been
the premier international conference for presenting research in logic
programming. Contributions (papers and posters) are sought in all
areas of logic programming including but not restricted to:

Theory: Semantic Foundations, Formalisms, Non-monotonic Reasoning,
Knowledge Representation.
Implementation: Compilation, Memory Management, Virtual Machines,
Parallelism.
Environments: Program Analysis, Transformation, Validation,
Verification, Debugging, Profiling, Testing.
Language Issues: Concurrency, Objects, Coordination, Mobility, Higher
Order, Types, Modes, Assertions, Programming Techniques.
Related Paradigms: Abductive Logic Programming, Inductive Logic
Programming, Constraint Logic Programming, Answer-Set Programming.
Applications: Databases, Data Integration and Federation, Software
Engineering, Natural Language Processing, Web and Semantic Web,
Agents, Artificial Intelligence, Bioinformatics.

In addition to the presentations of accepted papers, the technical
program will include plenary invited talks in association with other
FLoC conferences, as well as ICLP invited talks, advanced tutorials,
the doctoral consortium, and several workshops.

SUBMISSION DETAILS

The four broad categories for submissions are: (1) technical papers
for describing technically sound, innovative ideas that can advance
the state of the art of logic programming; (2) application papers,
where the emphasis will be on their impact on the application domain;
(3) system and tool papers, where the emphasis will be on the novelty,
practicality, usability and general availability of the systems and
tools described; and (4) short papers/posters, for ongoing work not
yet ready for full publication and research project overviews.

All papers must describe original, previously unpublished
research, and must not simultaneously be submitted for publication
elsewhere. They must be written in English. Technical papers,
application papers, and system and tool papers must not exceed 15
pages. The limit for short papers / posters is 5 pages. Submissions
must be made in TPLP format
(ftp://ftp.cup.cam.ac.uk/pub/texarchive/journals/latex/tlp-cls/) via
the Easychair submission system, available at
http://www.easychair.org/conferences/?conf=iclp2010.

IMPORTANT DATES
Paper registration deadline: January 26, 2010
Submission deadline: February 2, 2010
Notification to authors: March 20, 2010
Camera-ready copy due: April 21, 2010
Conference: July 16-19, 2010

PAPER PUBLICATION

All accepted long papers will be published in the journal Theory and
Practice of Logic Programming (TPLP), Cambridge U. Press (CUP), in one
or more special issues.

In order to ensure the quality of the final version, papers may be
subject to more than one round of refereeing (within the decision
period) and/or "shepherding."

At the time of the conference CUP will make the web page for
this(ese) TPLP issue(s) available including volume and issue numbers,
table of contents, page numbers, and the papers themselves. All
registered attendants at the conference will get a password for
on-line access to this web page during the conference and indefinitely
from then on ("lifetime access"), which can be used to read papers on
line, download them, or print them for personal use. Attendants will
also receive all the papers in a USB memory stick at the conference.

For short papers / posters the journal issue(s) will include a
listing of the titles and authors of these papers, as well as a URL
pointing to their printable copy. Short papers / posters will also get
space in the program for presentation.

ICLP'2010 ORGANIZATION

General Chair:
Veronica Dahl (Simon Fraser University, Canada)
Program Co-chairs:
Manuel Hermenegildo (IMDEA Soft. and UPM, Spain)
Torsten Schaub (University of Potsdam, Germany)
Workshops Chair:
Veronica Dahl (Simon Fraser University, Canada)
Doctoral Consortium:
Marcello Balduccini (Kodak Research Labs, USA)
Prolog Programming Contest:
Tom Schrijvers (K.U. Leuven, Belgium)

PROGRAM COMMITTEE

Maria Alpuente (Technical U. of Valencia, Spain)
Pedro Cabalar (Corunya University, Spain)
Manuel Carro (Technical U. of Madrid, Spain)
Marina De Vos (University of Bath, UK)
James Delgrande (Simon Fraser University, Canada)
Marc Denecker (KU Leuven, Belgium)
Agostino Dovier (University of Udine, Italy)
Esra Erdem (Sabanci University, Istanbul, Turkey)
Wolfgang Faber (University of Calabria, Italy)
Thom Fruehwirth (University of Ulm, Germany)
Maurizio Gabbrielli (University of Bologna, Italy)
John Gallagher (Roskilde University, Denmark)
Samir Genaim (Complutense University, Spain)
Haifeng Guo (University of Nebraska at Omaha, USA)
Joxan Jaffar (National U. of Singapore, Singapore)
Tomi Janhunen (Helsinki U. of Technology, Finland)
Michael Leuschel (U. of Duesseldorf, Germany)
Stephen Muggleton (Imperial College London, UK)
Alan Mycroft (U. of Cambridge, UK)
Gopalan Nadathur (University of Minnesota, USA)
Lee Naish (Melbourne University, Australia)
Enrico Pontelli (New Mexico State University, USA)
Vitor Santos Costa (University of Porto, Portugal)
Tom Schrijvers (K.U. Leuven, Belgium)
Tran Cao Son (New Mexico State University, USA)
Peter J. Stuckey (Melbourne University, Australia)
Terrance Swift (CENTRIA, Portugal)
Peter Szeredi (Budapest U. of Tech. and E., Hungary)
Frank Valencia (Ecole Polytechnique, France)
Wim Vanhoof (University of Namur, Belgium)
Kewen Wang (Griffith University, Australia)
Stefan Woltran (Vienna U. of Technology, Austria)
Neng-Fa Zhou (City University of New York, USA)

SPONSOR

The conference is sponsored by the Association for Logic Programming.

FINANCIAL ASSISTANCE

The Association for Logic Programming has funds to assist financially
disadvantaged participants and, specially, students in order to be
able to attend the conference.

WORKSHOPS

The ICLP 2009 program will include several workshops, held also as
part of FLoC. They are perhaps the best places for the presentation of
preliminary work, undeveloped novel ideas, and new open problems to a
wide and interested audience with opportunities for intensive
discussions and project collaboration.

DOCTORAL CONSORTIUM

The 6th Doctoral Consortium (DC) on Logic Programming provides
research students with the opportunity to present and discuss their
research directions, and to obtain feedback from both peers and
world-renown experts in the field. Accepted participants will receive
partial financial support to attend the event and the main
conference. The best paper and presentation from the DC will be given
the opportunity to present in a special session of the main ICLP
conference.

CONFERENCE VENUE / CO-LOCATION

In 2010 (as in the previous two FLoC editions) ICLP will be held as
part of the Fifth Federated Logic Conference, FLoC 2010 in Edinburgh,
Scotland, U.K., July 16-19, 2010. FLoC is held every four years
bringing together several international conferences related to
mathematical logic and computer science. Other participating
conferences are:

- Computer-Aided Verification (CAV),
- Int'l Joint Conference on Automated Reasoning (IJCAR),
- Interactive Theorem Proving (ITP),
- Logic in Computer Science (LICS),
- Rewriting Techniques and Applications (RTA), and
- Theory and Applications of Satisfiability Testing (SAT).

Plenary events involving multiple conferences are planned.
------------------------------------------------------------------------

Tuesday, December 8, 2009

Postdoc position, Carnegie Mellon University, Theoretical Computer Science

The Simons Foundation has awarded Carnegie Mellon a Postdoctoral
Fellowship in Theoretical Computer Science for the two-year period
Fall 2010 through Summer 2012. Applicants must have received a PhD in
the academic year immediately preceding the fellowship (i.e.
2009-2010). Postdoctoral Fellows will have opportunity to work with
all members of the Algorithms and Complexity group at CMU. In addition
to salary, fellows will receive a $7,000/year travel/equipment
research budget.

Applications (CV and research statement) as well as recommendation
letters should be sent to Marilyn Walgora at mwalgora [at] cs.cmu.edu.
Please include the words "Simons Postdoctoral Fellowship" in the
header.

For full consideration, applications should be received by February 28, 2010.

Postdoc position, Carnegie Mellon University, Theoretical Computer Science

The Simons Foundation has awarded Carnegie Mellon a Postdoctoral
Fellowship in Theoretical Computer Science for the two-year period
Fall 2010 through Summer 2012. Applicants must have received a PhD in
the academic year immediately preceding the fellowship (i.e.
2009-2010). Postdoctoral Fellows will have opportunity to work with
all members of the Algorithms and Complexity group at CMU. In addition
to salary, fellows will receive a $7,000/year travel/equipment
research budget.

Applications (CV and research statement) as well as recommendation
letters should be sent to Marilyn Walgora at mwalgora [at] cs.cmu.edu.
Please include the words "Simons Postdoctoral Fellowship" in the
header.

For full consideration, applications should be received by February 28, 2010.

[DMANET] AOFA '10 - Second Announcement and Call for Papers

AOFA '10 - SECOND ANNOUNCEMENT AND CALL FOR PAPERS

AOFA '10
21st International Meeting on
Probabilistic, Combinatorial, and Asymptotic
Methods for the Analysis of Algorithms

Vienna University of Technology (AUSTRIA)
June 28-July 2, 2010

with a Mini-Summerschool from
June 25-26, 2010


Scope
-----

This conference is the first joint meeting of two previous conference and
seminar series on "Mathematics and Computer Science" and "Analysis of
Algorithms". The common aim of these and the present meeting is to study
discrete objects that appear as data structures or algorithms (including
graphs, networks etc.) by mathematical methods, in particular by probabilistic,
combinatorial and asymptotic methods.

* Properties of large randomly formed data structures,
* Probabilistic methods for the analysis of algorithms,
* Combinatorial methods for the analysis of algorithms,
* Analytic tools for the analysis of algorithms
* New results concerning average case analysis of classical or new
algorithms
* Analytical and enumerative combinatorics
* Random trees and graphs
* Branching processes
* Stochastic processes in relation with random discrete structures
* Random walks
* Discrete probabilities
* Random generation of combinatorial structures
* Data compression and language-modeling methods.
* Performance evaluation


Invited talks
-------------

The following speakers confirmed to give an invited talk:

Noga Alon (Tel Aviv University)
Yuliy Baryshnikov (Bell Laboratories)
Daniel Panario (Carleton University)
Oliver Riordan (University of Oxford)
Peter Winkler (Dartmouth)

Tutorial talks of the Mini-Summerschool (June 25-26)
----------------------------------------------------

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

Submission of papers
--------------------

We invite you to submit an extended abstract (12 pages) or a short abstract for
a poster (2 pages) via the Easy-Chair system:

https://www.easychair.org/login.cgi?conf=aofa10

The deadline for submission of papers is

February 28, 2010,

for posters

May 31, 2010.

It is planned to publish the proceedings in DMTCS.

Steering committee
------------------

Brigitte Chauvin, Versailles (France)
Luc Devroye, Montreal (Canada)
Michael Drmota, Vienna (Austria)
Philippe Flajolet, INRIA Rocquencourt (France)
Robert Sedgewick, Princeton (USA)
Wojciech Szpankowski, Purdue (USA)

Programme committee
-------------------

Brigitte Chauvin, Versailles (France)
Jacek Cichon, Wroclaw (Poland)
Michael Drmota, Vienna (Austria), Chair
Daniele Gardy, Versailles (France)
Philippe Flajolet INRIA Rocquencourt (France)
Martin Klazar, Prague (Czech Republic)
Jean Francois LeGall, Paris (France)
Ralph Neininger, Frankfurt (Germany)
Marc Noy, Barcelona (Spain)
Conrado Martinez, Barcelona (Spain)
Alois Panholzer, Vienna (Austria)
Helmut Prodinger, Stellenbosch (South Africa)
Uwe Roesler, Kiel (Germany)
Bob Sedgewick, Princeton (USA)
Peter Winkler, Dartmouth (USA)
Wojciech Szpankowski, Purdue (USA)

Organizing committee
--------------------

Michael Drmota
Bernhard Gittenberger (Chair)
Alois Panholzer

Important dates
---------------

February 28, 2010 deadline for submission

April 30, 2010 notification to authors

May 31, 2010 final version of accepted papers
and deadline for poster submissions


Official language English.
-----------------


Address
-------

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

e-mail : aofa10@dmg.tuwien.ac.at
Web site: www.aofa10.at


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

CSR-2010: extended deadline, Last CfP

Dear Colleagues,

Unfortunately, our web server was unreachable for several days last week
for reasons independent of us.  We apologize!  The PC decided to
extend the deadline until December 18, 23:59 CET (Central European Time).

Note that Kazan is easily reachable by plane from most European cities
using convenient connections in, for example, Frankfurt.

Please find below the last version of the CfP.
(We apologize for multiple copies.)

Best regards,
CSR-2010 organizers

P.S. Please keep in mind for the future that a "master" page for
CSR conferences is located at http://logic.pdmi.ras.ru/~csr/
If anything ever happens to current conference web pages, please refer to it.

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

Last Call for Papers

5th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2010)

June 16-20, 2010, Kazan, Russia

http://csr2010.antat.ru/
http://logic.pdmi.ras.ru/~csr/

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

CSR 2010 intends to reflect the broad scope of international cooperation in
computer science. It is the 5th conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), and
CSR 2009 in Novosibirsk (see LNCS 5675).

IMPORTANT DATES:

Deadline for submissions:       December 18, 2009 at 23:59 CET
Notification of acceptance:     January 31, 2010
Conference dates:               June 16-20, 2010

As has become tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!

TOPICS

* algorithms and data structures
* combinatorial optimization
* constraint solving
* complexity and cryptography
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods

OPENING LECTURE:

Alexander Razborov (University of Chicago and Steklov Mathematical Institute)

INVITED SPEAKERS:

Fedor Fomin (University of Bergen)
(many more names are coming soon!)

PROGRAM COMMITTEE:

Ernst W. Mayr (TU München, Germany; Chair)
Sergei N. Artemov (City University of New York, USA)
Lev Beklemishev (M.V. Lomonossov Moscow State University, Russia)
Michael Ben-Or (Hebrew University, Israel)
Harry Buhrman (University of Amsterdam, Netherlands)
Edith Cohen (AT&T Research, USA)
Samir Datta (Chennai Mathematical Institute, India)
Andrew V. Goldberg (Microsoft Research, USA)
Dima Grigoriev (Université de Lille, France)
Martin Hofmann (LMU München, Germany)
Stasys Jukna (Universität Frankfurt, Germany)
Yuri Matiyasevich (Steklov Inst. of Math., St. Petersburg, Russia)
Peter Bro Miltersen (Aarhus University, Denmark)
Georg Moser (University of Innsbruck, Austria)
Madhavan Mukund (Chennai Mathematical Institute, India)
Harald Räcke (University of Warwick, United Kingdom)
Uwe Schöning (Universität Ulm, Germany)
Jeffrey Shallit (University of Waterloo, Canada)
Alexander Shen (LIF, Marseille, France)
Alberto Marchetti Spaccamela (Università di Roma "La Sapienza", Italy)
Michael Tautschnig (TU Darmstadt, Germany)
Pascal Tesson (Université Laval, Canada)
Berthold Vöcking (RWTH Aachen, Germany)
Sergey Yekhanin (Microsoft Research, USA)
Alexander Zelikovsky (Georgia State University, USA)

ORGANIZERS:

Institute of Informatics, Tatarstan Academy of Sciences, and Kazan State University

CONFERENCE CHAIR:

Farid Ablayev (Kazan State University)

SUBMISSIONS:

Authors are invited to submit an extended abstract or a full paper of at most
12 pages in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
       http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed.  The proceedings of the symposium will be published in Springer's
LNCS series.

Selected papers from the conference will be reviewed for and published in a
special issue of Theory of Computing Systems (Springer-Verlag).

Submissions should be uploaded to the EasyChair Conference system:
https://www.easychair.org/login.cgi?conf=csr2010


FURTHER INFORMATION AND CONTACTS:

Web:    http://csr2010.antat.ru/
Web #2: http://logic.pdmi.ras.ru/~csr/
Email:  csr2010.kazan@gmail.com

CSR-2010: extended deadline, Last CfP

Dear Colleagues,

Unfortunately, our web server was unreachable for several days last week
for reasons independent of us. We apologize! The PC decided to
extend the deadline until December 18, 23:59 CET (Central European Time).

Note that Kazan is easily reachable by plane from most European cities
using convenient connections in, for example, Frankfurt.

Please find below the last version of the CfP.
(We apologize for multiple copies.)

Best regards,
CSR-2010 organizers

P.S. Please keep in mind for the future that a "master" page for
CSR conferences is located at http://logic.pdmi.ras.ru/~csr/
If anything ever happens to current conference web pages, please refer to it.

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

Last Call for Papers

5th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2010)

June 16-20, 2010, Kazan, Russia

http://csr2010.antat.ru/
http://logic.pdmi.ras.ru/~csr/

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

CSR 2010 intends to reflect the broad scope of international cooperation in
computer science. It is the 5th conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), and
CSR 2009 in Novosibirsk (see LNCS 5675).

IMPORTANT DATES:

Deadline for submissions: December 18, 2009 at 23:59 CET
Notification of acceptance: January 31, 2010
Conference dates: June 16-20, 2010

As has become tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!

TOPICS

* algorithms and data structures
* combinatorial optimization
* constraint solving
* complexity and cryptography
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods

OPENING LECTURE:

Alexander Razborov (University of Chicago and Steklov Mathematical Institute)

INVITED SPEAKERS:

Fedor Fomin (University of Bergen)
(many more names are coming soon!)

PROGRAM COMMITTEE:

Ernst W. Mayr (TU München, Germany; Chair)
Sergei N. Artemov (City University of New York, USA)
Lev Beklemishev (M.V. Lomonossov Moscow State University, Russia)
Michael Ben-Or (Hebrew University, Israel)
Harry Buhrman (University of Amsterdam, Netherlands)
Edith Cohen (AT&T Research, USA)
Samir Datta (Chennai Mathematical Institute, India)
Andrew V. Goldberg (Microsoft Research, USA)
Dima Grigoriev (Université de Lille, France)
Martin Hofmann (LMU München, Germany)
Stasys Jukna (Universität Frankfurt, Germany)
Yuri Matiyasevich (Steklov Inst. of Math., St. Petersburg, Russia)
Peter Bro Miltersen (Aarhus University, Denmark)
Georg Moser (University of Innsbruck, Austria)
Madhavan Mukund (Chennai Mathematical Institute, India)
Harald Räcke (University of Warwick, United Kingdom)
Uwe Schöning (Universität Ulm, Germany)
Jeffrey Shallit (University of Waterloo, Canada)
Alexander Shen (LIF, Marseille, France)
Alberto Marchetti Spaccamela (Università di Roma "La Sapienza", Italy)
Michael Tautschnig (TU Darmstadt, Germany)
Pascal Tesson (Université Laval, Canada)
Berthold Vöcking (RWTH Aachen, Germany)
Sergey Yekhanin (Microsoft Research, USA)
Alexander Zelikovsky (Georgia State University, USA)

ORGANIZERS:

Institute of Informatics, Tatarstan Academy of Sciences, and Kazan State University

CONFERENCE CHAIR:

Farid Ablayev (Kazan State University)

SUBMISSIONS:

Authors are invited to submit an extended abstract or a full paper of at most
12 pages in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed. The proceedings of the symposium will be published in Springer's
LNCS series.

Selected papers from the conference will be reviewed for and published in a
special issue of Theory of Computing Systems (Springer-Verlag).

Submissions should be uploaded to the EasyChair Conference system:
https://www.easychair.org/login.cgi?conf=csr2010


FURTHER INFORMATION AND CONTACTS:

Web: http://csr2010.antat.ru/
Web #2: http://logic.pdmi.ras.ru/~csr/
Email: csr2010.kazan@gmail.com

[DMANET] CSR-2010: extended deadline, Last CfP

Dear Colleagues,

Unfortunately, our web server was unreachable for several days last week
for reasons independent of us. We apologize! The PC decided to
extend the deadline until December 18, 23:59 CET (Central European Time).

Note that Kazan is easily reachable by plane from most European cities
using convenient connections in, for example, Frankfurt.

Please find below the last version of the CfP.
(We apologize for multiple copies.)

Best regards,
CSR-2010 organizers

P.S. Please keep in mind for the future that a "master" page for
CSR conferences is located at http://logic.pdmi.ras.ru/~csr/
If anything ever happens to current conference web pages, please refer to it.

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

Last Call for Papers

5th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2010)

June 16-20, 2010, Kazan, Russia

http://csr2010.antat.ru/
http://logic.pdmi.ras.ru/~csr/

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

CSR 2010 intends to reflect the broad scope of international cooperation in
computer science. It is the 5th conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in
Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), and
CSR 2009 in Novosibirsk (see LNCS 5675).

IMPORTANT DATES:

Deadline for submissions: December 18, 2009 at 23:59 CET
Notification of acceptance: January 31, 2010
Conference dates: June 16-20, 2010

As has become tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!

TOPICS

* algorithms and data structures
* combinatorial optimization
* constraint solving
* complexity and cryptography
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods

OPENING LECTURE:

Alexander Razborov (University of Chicago and Steklov Mathematical Institute)

INVITED SPEAKERS:

Fedor Fomin (University of Bergen)
(many more names are coming soon!)

PROGRAM COMMITTEE:

Ernst W. Mayr (TU München, Germany; Chair)
Sergei N. Artemov (City University of New York, USA)
Lev Beklemishev (M.V. Lomonossov Moscow State University, Russia)
Michael Ben-Or (Hebrew University, Israel)
Harry Buhrman (University of Amsterdam, Netherlands)
Edith Cohen (AT&T Research, USA)
Samir Datta (Chennai Mathematical Institute, India)
Andrew V. Goldberg (Microsoft Research, USA)
Dima Grigoriev (Université de Lille, France)
Martin Hofmann (LMU München, Germany)
Stasys Jukna (Universität Frankfurt, Germany)
Yuri Matiyasevich (Steklov Inst. of Math., St. Petersburg, Russia)
Peter Bro Miltersen (Aarhus University, Denmark)
Georg Moser (University of Innsbruck, Austria)
Madhavan Mukund (Chennai Mathematical Institute, India)
Harald Räcke (University of Warwick, United Kingdom)
Uwe Schöning (Universität Ulm, Germany)
Jeffrey Shallit (University of Waterloo, Canada)
Alexander Shen (LIF, Marseille, France)
Alberto Marchetti Spaccamela (Università di Roma "La Sapienza", Italy)
Michael Tautschnig (TU Darmstadt, Germany)
Pascal Tesson (Université Laval, Canada)
Berthold Vöcking (RWTH Aachen, Germany)
Sergey Yekhanin (Microsoft Research, USA)
Alexander Zelikovsky (Georgia State University, USA)

ORGANIZERS:

Institute of Informatics, Tatar Academy of Sciences, and Kazan State University

CONFERENCE CHAIR:

Farid Ablayev (Kazan State University)

SUBMISSIONS:

Authors are invited to submit an extended abstract or a full paper of at most
12 pages in the LNCS format (LaTeX, as pdf; final version with source);
instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed. The proceedings of the symposium will be published in Springer's
LNCS series.

Selected papers from the conference will be reviewed for and published in a
special issue of Theory of Computing Systems (Springer-Verlag).

Submissions should be uploaded to the EasyChair Conference system:
https://www.easychair.org/login.cgi?conf=csr2010


FURTHER INFORMATION AND CONTACTS:

Web: http://csr2010.antat.ru/
Web #2: http://logic.pdmi.ras.ru/~csr/
Email: csr2010.kazan@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/
*
**********************************************************

Monday, December 7, 2009

Research Experiences for Undergraduates (REU) Supplemental Funding Opportunity

The NSF Directorate for Computer and Information Science and Engineering (CISE) invites its grantees to submit requests for Research Experiences for Undergraduates (REU) supplemental funding. Interested grantees may submit their REU supplement requests between December 1, 2009 and March 31, 2010.

In the case of a single investigator project, a CISE REU supplement typically requests support for no more than two students for one year. Research teams funded through multi-investigator projects may request support for a larger number of students, commensurate with the size and nature of their projects. For example, in projects involving four principal investigators, REU supplement support typically may be requested for about four undergraduates for one year.  As a guide for budget development, CISE REU supplement support averages about $8,000 per student per year, which might include $6,400 for student stipend support and $1,600 for administrative allowance (in lieu of indirect costs); this guideline is neither a floor not a ceiling.

In these trying economic times, REU stipend support is one means by which to retain talented students in undergraduate education while providing meaningful research experiences.  Therefore, grantees are encouraged to consider economic hardship as one key factor in student selection.  The participation of students from groups underrepresented in computing - underrepresented minorities, women and persons with disabilities - is strongly encouraged.

Investigators are encouraged to refer to the program solicitation "Research Experiences for Undergraduates (REU): Sites and Supplements," for detailed information concerning submission requirements. Grantees with questions may also contact the CISE program officer managing their grant.

In the event that requests for REU support exceed funds available in CISE, requests will be considered in the order in which they are received.  Other factors influencing the funding decision include the status of the project and the number of REU requests submitted by any one principal investigator across all of her/his CISE grants.

 

Sincerely,

 

Jeannette M. Wing, Ph.D.

Assistant Director, Directorate for Computer and Information Science and Engineering

News from Center for Computational Intractability

Dear Colleague,

I wish to let you know about certain opportunities at the Center for
Computational Intractability that may interest you or other colleagues
or students from your department. Please forward this email to
departmental mailing list and/or anyone you think may be interested.
To subscribe/unsubscribe to this mailing list, please click the link at the bottom of the mail. Please visit our website http://intractability.princeton.edu/ for further details on center activities,
including streaming videos of all lectures and workshops.

Postdoc positions:
We have several postdoc positions for the 2009-2010 academic year. Application information can be found on
http://intractability.princeton.edu/contact-us/opportunities/ .
Deadline is January 1st, 2010.

Events, workshops:

Women in Theory workshop ("WIT"): June 19-23, 2010. This is the second WIT.
As in WIT'08, the program will consist of first-rate technical
talks by leading female researchers, combined with social activities
and some discussion of relevant issues. See
http://intractability.princeton.edu/blog/2009/11/women-in-theory-2010-workshop/
for more details. Please encourage female graduate students and
outstanding female undergraduate students in your department to apply
to the workshop (deadline is February 1st). Participants in
WIT'08 called it an "inspirational" and "eye-opening" experience.

"Decentralized Mechanism Design,Distributed Computing, and Cryptography". Princeton June 3-4 2010. Currently participation is by invitation only but this may later change.

Pseudorandomness workshop: June 14-18, 2010 at IAS.

Geometric Complexity Theory (a la Mulmuley-Sohni): tentatively scheduled for July 6-8, 2010
at Princeton University. 3-day tutorial on GCT by a team of speakers.

Barriers in Theoretical CS: 5-day workshop around first week of Sept 2010. Like last year's Barriers I workshop, it  will focus on problems where theoretical CS is stuck, but will focus on a different set of sub areas.

Visitor positions:

Funding is available to visit for short and long visits (including sabbaticals). For the former, please contact any of the center members you wish to interact with. For the latter, please send mail to me, preferably by Jan 1.


Best regards,

Sanjeev Arora
Director, Center for Computational Intractability
Princeton, NJ

CCI is a collaborative effort of IAS, NYU, Princeton, and Rutgers.
Funded by the NSF.

Associate Professor in Algorithms and Data Structures - University of Aarhus

An Associate Professor position in the area of Algorithms and Data
Structures is available in the Department of Computer Science, Aarhus
University, Denmark starting August 2010. The position will be
affiliated with Center for Massive Data Algorithms (MADALGO)

More information about Aarhus University can be found here: www.au.dk
More information about the department can be found here: www.cs.au.dk
More information about MADALGO can be found here: www.madalgo.au.dk

Further information about the position and application proceedure can be
found here: science.au.dk/en/positions-and-fellowships/academic-positions/

Sunday, December 6, 2009

[DMANET] Book Announcement

New book to appear:

Supply Chain Engineering
Useful Methods and Techniques
by Dolgui, Alexandre, and Proth, Jean-Marie
Springer, 2010, XX, 539 p. 149 illus., Hardcover
ISBN: 978-1-84996-016-8

Table of contents:
- Preface.
- Introduction to Pricing.
- Dynamic Pricing Models.- Outsourcing.
- Inventory Management in Supply Chains.
- Radio Frequency Identification (RFID): Technology and Applications.
- Flexible, Agile, Reconfigurable and Lean Manufacturing Systems.
- Design and Balancing of Paced Assembly Lines.
- Advanced Line Balancing Approaches and Generalizations.
- Dynamic Scheduling and Real-time Assignment.
- Manufacturing Layout.
- Warehouse Management and Design.
- Index.

*** Please contact the Publisher for further information and ordering details. ***
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

Preface and detailed table of contents of each chapter are available on
http://www.emse.fr/en/transfert/g2i/personnel/dolgui_a/New_book_by_Dolgui_and_Proth.pdf

Best regards,
Authors:
Alexandre Dolgui and Jean-Marie Proth


____________________________________________________________________

Alexandre Dolgui, Ph.D., Dr.Hab.
Professor
Director of the Centre for Industrial Engineering and Computer Science
National Institute of Science and Technology, Saint-Etienne
/Ecole Nationale Supérieure des Mines de Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

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

Saturday, December 5, 2009

[DMANET] ISCO - Spring School

ISCO Spring School:
'Cutting plane methods for integer and combinatorial optimization',
Hammamet, March 22-23, 2010

Pierre Bonami, Laboratoire d'Informatique Fondamentale, CNRS/Aix
Marseille Universitee, Marseille, France

Gérard Cornuéjols, Tepper School of Business,
Carnegie Mellon Univrsity, USA

Andrea Lodi, Dipartimento di Elettronica, Informatica e Sistemistica,
Universita di Bologna, Italy

We will focus on methods which present both a theoretical and
computational interest. The first half-day will be devoted to recalling
some of the best known and most efficient families of cutting planes,
their separation and their use. The rest of the course will be divided
into three advanced subtopics for which ongoing research is very active:
elementary closures, cuts for Mixed Integer NonLinear Programming (MINLP)
and cuts from Multiple Rows. We give below a more detailed program.

Introduction to cutting planes for MIP (Monday morning): We will present
several families of cutting planes. In particular: Gomory Fractional
and Mixed Integer cuts, Mixed-Integer Rounding (MIR) cuts,
Intersection cuts, Disjunctive cuts, Lift-and-Project cuts, and
Projected Chvatal-Gomory cuts.

Elementary Closures (Monday afternoon): After having defined the concept
of elementary closures, we will show some equivalences between families of cuts.
We will then discuss the problem of separating over closures. Finally, we
will discuss the use of normalizations in the separation of disjunctive cuts.

Cuts for MINLP (Tuesday Morning): In this part we will first discuss the
use of Disjunctive Programming to build strong relaxations for non-convex
problems (mainly quadratically constrained but also separable).
We will then focus on convex MINLPs (those whose continuous relaxation
is a convex program) and several cutting plane methods which have been proposed
for them: Outer Approximation cuts, Conic MIR cuts, Disjunctive Cuts.

An introduction to cuts from Multiple Rows (Tuesday Afternoon): In the
last three years, a very active area of research has been generalizations of
Gomory cuts using more than one row of the simplex tableau.
We will give us an introduction to this new and very active area of
research.

Prerequisites: Attendees with a good knowledge of the basics of Linear
Programming

--
-----------------------------------------
A. Ridha Mahjoub
Laboratoire LAMSADE
Université Paris Dauphine
Place du Maréchal de Lattre de Tassigny
75775 Paris Cedex 16
France
Tel: +33 (0)1 44 05 48 96
Fax: +33 (0)1 44 05 40 91
E-mail: mahjoub@lamsade.dauphine.fr
URL: http://www.lamsade.dauphine.fr/~mahjoub


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

Friday, December 4, 2009

[DMANET] Job Announcement: University of Rochester

Dear Colleague,

FYI, the Dept. of Computer Science at the University of Rochester is
currently conducting a faculty search, for which algorithms is among
the areas explicitly mentioned (and I suspect one can construe that
broadly, so researchers developing/analyzing algorithms in the context
of a focus area such as algorithmic game theory or crypto or
computational geometry or etc., etc., etc. should not in any way
hesitate to apply). If you know of bright graduating graduate
students (or others) who might be interested in the position, would
you please forward this message (which below includes a copy of the
job announcement) to them? Thank you very much, and wishing you happy
theorems and happy holidays!

Cheers,
Lane (Lane A. Hemaspaandra) [and the job ad is below]
++++++++++++++++++++
University of Rochester
Department of Computer Science
Assistant to Full Professor of Computer Science

The UR Department of Computer Science seeks applicants for a
tenure-track position for 2010. Candidates in computer vision, machine
learning, networks, security, or algorithms are of particular
interest, but strong applicants from all areas of computer science are
welcome. Candidates must have a PhD in computer science or related
discipline. Senior candidates should have an extraordinary record of
scholarship, leadership, and funding.

The Department of Computer Science is one of the best small,
research-oriented departments in the nation, with an unusually
collaborative culture and strong ties to cognitive science,
linguistics, and electrical and computer engineering. Over the past
decade, a third of its PhD graduates have won tenure-track faculty
positions, and its alumni include leaders at major research
laboratories such as Google, Microsoft, and IBM.

The University of Rochester is a private, Tier I research institution
located in western New York State. The University of Rochester
consistently ranks among the top 30 institutions, both public and
private, in federal funding for research and development. Half of its
undergraduates go on to post-graduate or professional education. The
university includes the Eastman School of Music, a premiere music
conservatory, and the University of Rochester Medical Center, a major
medical school, research center, and hospital system. The Rochester
area features a wealth of cultural and recreational opportunities,
excellent public and private schools, and a low cost of living.

Candidates should apply online at
http://www.cs.rochester.edu/recruit. Review of applications will begin
on Dec. 1, 2009, and continue until all interview openings are
filled. The University of Rochester has a strong commitment to
diversity and actively encourages applications from candidates from
groups underrepresented in higher education. The University is an
Equal Opportunity Employer.
++++++++++++++++++++
**********************************************************
*
* 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/
*
**********************************************************

Job Announcement: University of Rochester

Dear THEORYNT Colleagues,

FYI, the Dept. of Computer Science at the University of Rochester is
currently conducting a faculty search, for which algorithms is among
the areas explicitly mentioned (and I suspect one can construe that
broadly, so researchers developing/analyzing algorithms in the context
of a focus area such as algorithmic game theory or crypto or
computational geometry or etc., etc., etc. should not in any way
hesitate to apply). If you know of bright graduating graduate
students (or others) who might be interested in the position, would
you please forward this message (which below includes a copy of the
job announcement) to them? Thank you very much, and wishing you happy
theorems and happy holidays!

Cheers,
Lane (Lane A. Hemaspaandra) [and the job ad is below]
++++++++++++++++++++
University of Rochester
Department of Computer Science
Assistant to Full Professor of Computer Science

The UR Department of Computer Science seeks applicants for a
tenure-track position for 2010. Candidates in computer vision, machine
learning, networks, security, or algorithms are of particular
interest, but strong applicants from all areas of computer science are
welcome. Candidates must have a PhD in computer science or related
discipline. Senior candidates should have an extraordinary record of
scholarship, leadership, and funding.

The Department of Computer Science is one of the best small,
research-oriented departments in the nation, with an unusually
collaborative culture and strong ties to cognitive science,
linguistics, and electrical and computer engineering. Over the past
decade, a third of its PhD graduates have won tenure-track faculty
positions, and its alumni include leaders at major research
laboratories such as Google, Microsoft, and IBM.

The University of Rochester is a private, Tier I research institution
located in western New York State. The University of Rochester
consistently ranks among the top 30 institutions, both public and
private, in federal funding for research and development. Half of its
undergraduates go on to post-graduate or professional education. The
university includes the Eastman School of Music, a premiere music
conservatory, and the University of Rochester Medical Center, a major
medical school, research center, and hospital system. The Rochester
area features a wealth of cultural and recreational opportunities,
excellent public and private schools, and a low cost of living.

Candidates should apply online at
http://www.cs.rochester.edu/recruit. Review of applications will begin
on Dec. 1, 2009, and continue until all interview openings are
filled. The University of Rochester has a strong commitment to
diversity and actively encourages applications from candidates from
groups underrepresented in higher education. The University is an
Equal Opportunity Employer.
++++++++++++++++++++

New! Simons Postdoctoral Fellowship at the MIT in Theoretical Computer Science!

*Simons Postdoctoral Fellowship at the Massachusetts Institute of
Technology in Theoretical Computer Science*

The Theory of Computation (TOC) group at the Computer Science and
Artificial Intelligence Laboratory (CSAIL) at MIT is seeking candidates
for a post-doctoral position in the general area of the theory of
computation. Applicants in /all areas/ of theory are encouraged to
apply, including (but not exclusive to) algorithms, complexity theory,
combinatorial optimization, cryptography, distributed computing, game
theory and computation, geometry, parallel computing, and quantum
computing. This fellowship is made possible by a generous gift from the
Simons Foundation.

The fellowship is a two year position, starting the summer or fall of
2010. The fellowship stipend is gauged to attract the highest caliber of
applicants. Generous funds for scientific travel will be available for
use at the fellow's discretion. Fellows will be assigned a faculty
member close to their research interests from the TOC group. Fellows
will be encouraged (although not required) to teach a graduate seminar
in their area of research.

*Eligibility: *Candidates must receive their PhD during the academic
year immediately preceding that in which the fellowship would begin.
There are no other restrictions based on nationality or any other basis.

*Application Process:* Candidate applications should include a
description of professional interests and goals in research. Each
application should include a curriculum vitae and the names and
addresses of three or more individuals who will provide letters of
recommendation. Letter writers should submit their letters directly to
MIT to the address below. Please submit complete applications by January
1st, 2010.

*Address to submit application*: all application materials and
recommendation letters should be sent electronically to
theory-postdoc@csail.mit.edu <mailto:theory-postdoc@csail.mit.edu>. The
candidates name should be included in the subject line of the email.
Alternatively, the materials can be also sent to the following address:
Simons Postdoctoral Fellowship, c/o Joanne Hanley
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center, Building 32 –G682
32 Vassar Street
Cambridge, MA 02139, USA.

[DMANET] Call for Extended Abstracts PhD Forum ACM/SIGMOBILE MobiOpp 2010

*******************************************************************************
Our Sincere apologies if you receive multiple copies of this Call

The Second International Workshop on Mobile Opportunistic Networking
ACM/SIGMOBILE MobiOpp 2010, February 22-23, 2010, PISA ITALY
http://cnd.iit.cnr.it/mobiopp2010/
*Call for Extended Abstracts*
*PhD Forum*

The first PhD Forum on Opportunistic Networking will be hosted at Second
International Workshop on Mobile Opportunistic Networking (MobiOpp2010).
Doctoral students working in areas related to opportunistic networking and
computing are solicited to submit an extended abstract comprising a
summary of their research findings, work in progress and planned research.
The forum will be a platform for PhD students to interact both with their
peers as well as experienced researchers from industry. The forum will be
organized as a poster session preceded by a '1-minute madness' introduction
by each student.

Current Ph.D. students, as well as researchers who have completed their
Ph.D.dissertations since May 2009, are encouraged to submit extended
abstracts. The Ph.D. student should be the sole author, although contributions
of the advisor and others may be acknowledged in the extended abstract.
Submissions will be reviewed to ensure quality and relevance. Authors of
accepted submissions are expected to travel to MobiOpp 2010 to present their
poster at the PhD Forum.

The best presentation at the Forum, will receive an award sponsored by
Elsevier Publications and there is likely to be travel assistance for some
students.Accepted extended abstracts will appear in conference proceedings.

*Extended Abstract Submission*:
Ph.D. students are invited to submit two-page extended abstracts that describe
current research and potential contributions to theory and innovation in
pervasive computing and communications.
Submissions must be received by no later than December 7, 2009. Extended abstracts
should include the author's name, affiliation, and email address. Submissions
must be PDF files and be written in English. Submissions should adhere to the ACM
format and be no more than two pages in length (all inclusive).
Papers must be submitted via email to mobiopp-PhD@iit.cnr.it.

*Important Dates*
Extended abstract submission deadline: December 7, 2009
Notification of acceptance: January 10, 2010
Camera-ready paper due: January 22, 2010
MobiOpp: February 22-23, 2010

*PhD Forum Co-Chairs*
Silvia Giordano, SUPSI, Switzerland
Mohan Kumar, The University of Texas at Arlington
*Corporate Sponsor TBD*

============================================================
Ing. Emilio Ancillotti, PhD
Pervasive Computing & Networking Lab. (PerLab)
Institute for Informatics and Telematics (IIT)
National Research Council (CNR)
Via G. Moruzzi, 1 || voice: +39 050 315 2437
56124 Pisa, Italy || fax: +39 050 315 2113
|| mobile: +39 328 2963760
============================================================

**********************************************************
*
* 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] CIAC 2010 - LAST CALL FOR PAPERS

SUBMISSION DEADLINE APPROACHING: *** December 11, 2009 ***

CIAC 2010
7th International Conference on Algorithms and Complexity
http://ciac.di.uniroma1.it/
May 26-28, 2010 Rome, Italy

CALL FOR PAPERS

We apologize if you receive multiple copies of this message.


AIM AND SCOPE OF THE CONFERENCE:

The 7th International Conference on Algorithms and Complexity is intended
to provide a forum for researchers working in all aspects of computational
complexity and the use, design, analysis and experimentation of efficient
algorithms and data structures.


TOPICS:

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

- sequential, parallel and distributed algorithms and data structures;
- approximation and randomized algorithms;
- graph algorithms and graph drawing;
- on-line and streaming algorithms;
- analysis of algorithms and computational complexity;
- algorithm engineering;
- web algorithms;
- algorithmic game theory;
- computational biology;
- communication networks;
- computational geometry;
- cryptography;
- discrete optimization.


SUBMISSION GUIDELINES:

Authors are invited to submit an extended abstract of at most 12 pages
(LNCS style) to arrive before December 11, 2009. Submission is handled
by EasyChair at the following web page:
http://www.easychair.org/conferences/?conf=ciac2010

Further information and submission details can be found on the Conference
web page. Simultaneous submissions to other conferences with published
proceedings are not allowed.


PROCEEDINGS:

The conference proceedings will be published by
Springer-Verlag in Lecture Notes in Computer Science (LNCS) series.
Selected papers from CIAC 2010 will be invited to a special issue of Journal
of Discrete Algorithms.


IMPORTANT DATES:

Deadline for submission: December 11, 2009.
Notification of acceptance: February 13, 2010.
Final manuscript due: March 12, 2010.
Conference: May 26-28, 2010.


INVITED SPEAKERS:

- Ricardo Baeza-Yates, Yahoo! Research
- Monika Henzinger, Ecole Polytechnique Federale de Lausanne
- Eran Halperin, Tel Aviv Univ.
- Bruce Reed, McGill Univ.


STEERING COMMITTEE:

- Giorgio Ausiello, Sapienza Univ. of Rome
- Giuseppe F. Italiano, Univ. of Rome Tor Vergata
- Rossella Petreschi, Sapienza Univ. of Rome


PROGRAM COMMITTEE:

- Sandip Das, Indian Statistical Institute
- Josep Diaz (Chair), Univ. Politecnica de Catalunya
- Irene Finocchi, Sapienza Univ. of Rome
- Fabrizio Grandoni, Univ. of Rome Tor Vergata
- Kazuo Iwama, Kyoto Univ.
- Jan Kratochvil, Charles Univ.
- Kurt Mehlhorn, Max Planck Institut
- Dieter Mitsche, Univ. Politecnica de Catalunya
- Jarik Nesetril, Charles Univ.
- Vangelis Paschos, Univ. Paris-Dauphine
- Maurizio Patrignani, Univ. Roma Tre
- David Peleg, Weizmann Institute of Science
- Piotr Sankowski, Univ. of Warsaw
- Paul Spirakis, Univ. of Patras
- Geppino Pucci, Univ. of Padova
- Jared Saia, Univ. of New Mexico
- Dimitrios Thilikos, National and Kapodistrian Univ. of Athens
- Luca Trevisan, Univ. of California, Berkeley
- Lusheng Wang, City Univ. of Hong Kong
- Peter Widmayer, ETH Zurich


ORGANIZING COMMITTEE:

- Tiziana Calamoneri (Chair), Sapienza Univ. of Rome
- Saverio Caminiti, Sapienza Univ. of Rome
- Umberto Ferraro Petrillo, Sapienza Univ. of Rome
- Emanuele G. Fusco, Sapienza Univ. of Rome
- Maria Daniela Salvati, Sapienza Univ. of Rome

**********************************************************
*
* 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] JELIA 2010 First Call for Papers

JELIA 2010 CALL FOR PAPERS

12th European Conference on Logics in Artificial Intelligence
Helsinki, Finland, September 13-15, 2010
http://jelia2010.tkk.fi/

Logics provide a formal basis and key descriptive notation for the study
(AI). With the depth and maturity of formalisms, methodologies, and
systems today, such logics are increasingly important. The European
Conference on Logics in Artificial Intelligence (or Journes Europennes
sur la Logique en Intelligence Artificielle --- JELIA) began back in 1988,
as a workshop, in response to the need for a European forum for the
discussion of emerging work in this field. Since then, JELIA has been
organised biennially, with English as the official language, and with
proceedings published in Springer-Verlag's Lecture Notes in Artificial
Intelligence series. In 2010 the conference is organized for the first
time in Scandinavia, following previous meetings mainly taking place in
Central and Southern Europe (see the general website http://www.jelia.eu/
for details). The increasing interest in this forum, its international
level with growing participation from researchers outside Europe, and the

overall technical quality, has turned JELIA into a major biennial forum
for the discussion of logic-based approaches to AI.

Aims and Scope

The aim of JELIA 2010 is to bring together active researchers interested
in all aspects concerning the use of logics in Artificial Intelligence to

discuss current research, results, problems, and applications of both
theoretical and practical nature. JELIA strives to foster links and
facilitate cross-fertilisation of ideas among researchers from various
disciplines, among researchers from academia and industry, and between
theoreticians and practitioners.

Authors are invited to submit papers presenting original and unpublished
research in all areas related to the use of logics in Artificial
Intelligence including:
-- Abductive and inductive reasoning
-- Answer set programming
-- Applications and foundations of logic-based AI systems
-- Argumentation systems
-- Automated reasoning including satisfiability checking and its extensions
-- Computational complexity and expressiveness
-- Description logics and other logical approaches to
semantic web and ontologies
-- Hybrid reasoning systems
-- Knowledge representation, reasoning, and compilation
-- Logic programming and constraint programming
-- Logics for uncertain and probabilistic reasoning
-- Logics in machine learning
-- Logics in multi-agent systems, games, and social choice
-- Non-classical such as modal, temporal, spatial,
paraconsistent, and hybrid logics
-- Nonmonotonic reasoning, belief revision, and updates
-- Planning and diagnosis based on logic
-- Preferences
-- Reasoning about actions and causality

Important Dates

* Deadline for abstract submission: May 3, 2010
* Deadline for paper submission: May 7, 2010
* Notification of acceptance: June 11, 2010
* Camera Ready Copy: June 30, 2010

Paper Submission

Proceedings will be published by Springer-Verlag in the Lecture Notes on
Artificial Intelligence series. Papers should be written in English, and
should be formatted according to the standard Springer LNCS style. All
submissions must be received by 23:59 GMT on May 3, 2010 (abstract) and
May 7, 2010 (full paper), and should be electronically submitted via the
link available on the JELIA 2010 web page.

There are two categories for submissions:

A. Regular papers
Submissions should not exceed 13 pages including figures, references,
etc., and should contain original research, and sufficient detail to
assess the merits and relevance of the contribution. Submissions must
not have been previously published or be simultaneously submitted for
publication elsewhere.

B. System descriptions
Submissions should not exceed 4 pages, and should describe an
implemented system and its application area(s). A demonstration is
expected to accompany a system presentation. Papers describing systems
that have already been presented in JELIA before will be accepted only
if significant and clear enhancements to the system are reported and
implemented.

Venue

The conference will be held in the main building of University of
Helsinki, located in the center of Helsinki. Founded in 1550, Helsinki has
been the Finnish capital since 1812, when it was rebuilt in the Empire
style by the orders of the Czar of Russia, hence sharing architectural
similarities with St. Petersburg even today. Located on the Baltic
peninsula centrally between the east and the west, Helsinki "the Daughter
of the Baltic" is a city full of contrasts: light and white in summer
while dark but full of warmth in winter, with a combination of high-tech,
contemporary design, and ever-present nature. Finnish design has made
Helsinki world famous, and recently Helsinki was appointed World Design
Capital 2012.

Programme Co-Chairs

Tomi Janhunen, Aalto University School of Science and Technology, Finland
http://www.tcs.hut.fi/~ttj/

Ilkka Niemelä, Aalto University School of Science and Technology, Finland
http://www.tcs.hut.fi/~ini/

Further Information

Conference web page: http://jelia2010.tkk.fi/
**********************************************************
*
* 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] Posting request

The Universite catholique de Louvain (UCL) seeks to fill a tenure
track or tenured position in Discrete Mathematics. All candidates
with a research activity in discrete mathematics will be considered.
The list of specific areas of interest includes: combinatorial optimization,
algorithmic complexity, graph and network theory, information and coding
theory. The successful candidate will have teaching assignments in
mathematics and applied mathematics within the degree programmes organized
by the Ecole Polytechnique de Louvain, and in particular in the engineering
degree in applied mathematics.

The successful candidate will be affiliated with the Institute of
Multidisciplinary Research for Quantitative Modelling and Analysis
and/or with the Institute of Information and Communication
Technologies, Electronics and Applied Mathematics.

Further information can be obtained from
Vincent Blondel (vincent.blondel@uclouvain.be)
or
Francois Glineur (francois.glineur@uclouvain.be).

Deadline for submission: January 15, 2010

Required documents for application http://www.uclouvain.be/en-38120.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/
*
**********************************************************

Thursday, December 3, 2009

[DMANET] New! Simons Postdoctoral Fellowship at the MIT in Theoretical Computer Science!

*Simons Postdoctoral Fellowship at the Massachusetts Institute of
Technology in Theoretical Computer Science*

The Theory of Computation (TOC) group at the Computer Science and
Artificial Intelligence Laboratory (CSAIL) at MIT is seeking candidates
for a post-doctoral position in the general area of the theory of
computation. Applicants in /all areas/ of theory are encouraged to
apply, including (but not exclusive to) algorithms, complexity theory,
combinatorial optimization, cryptography, distributed computing, game
theory and computation, geometry, parallel computing, and quantum
computing. This fellowship is made possible by a generous gift from the
Simons Foundation.

The fellowship is a two year position, starting the summer or fall of
2010. The fellowship stipend is gauged to attract the highest caliber of
applicants. Generous funds for scientific travel will be available for
use at the fellow's discretion. Fellows will be assigned a faculty
member close to their research interests from the TOC group. Fellows
will be encouraged (although not required) to teach a graduate seminar
in their area of research.

*Eligibility: *Candidates must receive their PhD during the academic
year immediately preceding that in which the fellowship would begin.
There are no other restrictions based on nationality or any other basis.

*Application Process:* Candidate applications should include a
description of professional interests and goals in research. Each
application should include a curriculum vitae and the names and
addresses of three or more individuals who will provide letters of
recommendation. Letter writers should submit their letters directly to
MIT to the address below. Please submit complete applications by January
1st, 2010.

*Address to submit application*: all application materials and
recommendation letters should be sent electronically to
theory-postdoc@csail.mit.edu <mailto:theory-postdoc@csail.mit.edu>. The
candidates name should be included in the subject line of the email.
Alternatively, the materials can be also sent to the following address:
Simons Postdoctoral Fellowship, c/o Joanne Hanley
MIT Computer Science and Artificial Intelligence Laboratory
The Stata Center, Building 32 –G682
32 Vassar Street
Cambridge, MA 02139, USA.

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

[DMANET] EuroCG 2010 - Second Call for Papers

*** The submission server is open ***

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

26th European Workshop on Computational Geometry

http://2010.eurocg.org
March 22-24, 2010
Technische Universitaet Dortmund, Germany

Second Call for Papers

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

The 26th European Workshop on Computational Geometry (EuroCG'10) will
be held March 22-24, 2010, at the Technische Universitaet Dortmund
(Dortmund, Germany). EuroCG is renown as a friendly workshop, where
researchers across Europe and the world can meet and exchange ideas in
a delightful atmosphere.

We invite authors to submit extended abstracts (4 pages, two columns)
of original research. Submissions will be handled through EasyChair.
Please refer to the website of the conference (http://2010.eurocg.org)
for additional information, in particular on the submission format.

Selected papers from EuroCG'10 will be considered for a special issue
of Computational Geometry: Theory and Applications.


IMPORTANT DATES

Submission Deadline: January 9, 2010
Acceptance Notification: January 30, 2010
Camera-ready version: February 13, 2010
Early Registration: February 16, 2010


TOPICS OF INTEREST

- discrete and combinatorial geometry and topology
- design and analysis of geometric algorithms and data structures
- implementation and experimental evaluation of geometric algorithms
- numerical and algebraic issues arising from implementations
- analysis of geometric configurations
- geometric modelling, visualization, and simulation
- combinatorial optimization
- computer-aided design and manufacturing
- structural molecular biology
- geographic information systems
- robotics and virtual worlds
- and other fields.

INVITED SPEAKERS

Timothy M. Chan, U Waterloo
Markus Gross, ETH Zurich and Disney Research Zurich
Janos Pach, EPFL Lausanne and Renyi Insitute Budapest


PROGRAM COMMITTEE

Sandor P. Fekete, TU Braunschweig
Herman Haverkort, TU Eindhoven
Klaus H. Hinrichs, U Münster
Heinrich Müller, TU Dortmund
Michiel Smid, Carleton U
Christian Sohler, TU Dortmund
Jan Vahrenhold, TU Dortmund (chair)


CONTACT

Jan Vahrenhold, Faculty of Computer Science, Computer Science XI,
Technische Universitaet Dortmund, 44221 Dortmund, Germany.

E-mail: jan (dot) vahrenhold (insert an @ here) cs.tu-dortmund.de
Phone: +49 (0) 231 755-7711
Fax: +49 (0) 231 755-7740

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

Student Travel Subsidies for SODA 2010

STUDENT TRAVEL SUBSIDIES FOR SODA 2010

So far only have 5 students have applied for for student travel subsidies
for SODA, and the deadline for applications 12/7.

As announced on the SODA webpage, the NSF has given us $15k to
help subsidize travel of US-based students to SODA 2010 in Austin TX.
We also have generous donations from Microsoft Research and IBM Research
for student travel support that are not restricted to US-based students.
Consequently, many more students could be supported if they would only apply.
Details are on the SODA webpage -- see

QIP 2010

The 13th Workshop on Quantum Information Processing (QIP 2010) will take
place from January 15 to 22 in Zurich, Switzerland.

We would like to remind you of the approaching deadline for poster
submission (December 7).

This year QIP will feature a tutorial programme during three days (January
15 to 17) before the start of the regular talks (January 18 to 22). In
addition, there will be a rump session with short presentations. Submissions
to the rump session are possible until January 19. Invited speakers include

Scott Aaronson (MIT)
Andre Chailloux (Université Paris-Sud)
Philippe Corboz (University of Queensland)
Aram Harrow (University of Bristol)
Rahul Jain (National University of Singapore)
Julia Kempe (Tel-Aviv University)
Ben Reichardt (University of Waterloo)
Umesh Vazirani (UC Berkeley) [to be confirmed]

Tutorial speakers include

Ignacio Cirac (MPQ, Garching)
Pawel Horodecki (Gdansk University of Technology)
Daniel Nagaj (Slovak Academy of Sciences)
Jiannis Pachos (University of Leeds)
Graeme Smith (IBM, Watson)

Zurich is a charming city, and close to skiing resorts in the Alps. We look
forward to welcoming you here!

The organizers

% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %

Website: http://www.qip2010.ethz.ch/

% % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % % %

[DMANET] PhD Scholarships at Carleton University

The Computational Geometry Lab in the School of Computer Science at
Carleton University is searching for PhD students to begin studies in
September 2010. Applicants working in any area related to algorithms
and data structures will be considered.

Successful applicants will receive a minimum scholarship of $30,000CAD
per year for 4 years.

Applicants should apply by email directly to morin@scs.carleton.ca
and should include a complete CV and a statement of research
interests.

The deadline for receipt of applications is February 1st, 2010.

Carleton University is located in Ottawa, Canada. For further
information about the Computational Geometry Lab, visit
http://cg.scs.carleton.ca/


**********************************************************
*
* 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, December 2, 2009

PhD-position in Combinatorics at the Freie Universität Berlin

A PhD-student position in combinatorics is available in the Department of
Mathematics and Computer Science at the Freie Universität Berlin, within
the research group of Tibor Szabo (http://page.mi.fu-berlin.de/szabo/). We
are seeking an excellent student with a Masters degree or Diploma in
mathematics or related field. Strong background in combinatorics and graph
theory is required. Prospective candidates with an interest in extremal
and
probabilistic combinatorics are particularly encouraged to apply. The
language of the group is English; however, the successful candidate should
be able to communicate in German in a teaching environment within at most
one year. The preferred starting date is Apr 1 (with some flexibility).

Applicants are asked to submit a cover letter, CV, copies of grade
transcripts, some form of written work (Master/Diploma/Bachelor, or
semester thesis, even if in preliminary form) and two reference letters
(submitted by the reference writers). The preferred mean of submission is
via email to Ms Margrit Barrett (barrett@math.fu-berlin.de); please write
"PhD position" in the Subject. Alternatively, hard copy applications can
be mailed to

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

Review of applications will commence on January 4th and continue until the
position is filled.


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

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

[DMANET] 3 PhD Studentships in Computer Science (University of Nottingham)

The School of Computer Science at the University of Nottingham invites
applications for 3 PhD studentships. The studentships are for 3.5 years
and include UK Pounds 13,290 per year maintenance grant and UK/EU
tuition fees. The applicants need to apply through the University's
postgraduate admissions system:

http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx

The deadline for applications is the 8th of January 2010.

The applications are invited in the areas listed below. Please contact
the academics listed for the research area first if you are interested
in applying for a PhD in their area.

Functional Programming (contact Henrik Nilsson, Graham Hutton, Thorsten
Altenkirch, Venanzio Capretta: {nhn, gmh, txa, vxc} at cs.nott.ac.uk)

Computational Photography and Content-based Image Retrieval (contact
Guoping Qiu, qiu at cs.nott.ac.uk)

Computer Vision and Graphics (contact Bai Li, bai at cs.nott.ac.uk)

Computational Finance (contact Rong Qu, rxq at cs.nott.ac.uk)

Adaptive and Learning Systems (contact Jon Garibaldi, jmg at cs.nott.ac.uk)

Intelligent Agents (contact Brian Logan and Natasha Alechina, {bsl, nza}
at cs.nott.ac.uk)

Computational Systems and Synthetic Biology (contact Natalio Krasnogor,
nxk at cs.nott.ac.uk)

Simulation of Complex Systems and Computational Modelling and Data
Mining (contact Uwe Aickelin, uxa at cs.nott.ac.uk)

Data mining (contact Jaume Bacardit, jqb at cs.nott.ac.uk)

Document Engineering (contact Steven Bagley, srb at cs.nott.ac.uk)

Opportunistic networking (contact Milena Radenkovic, mvr at cs.nott.ac.uk)

Reactive Environments (contact Holger Schnadelbach, Dave Kirk: hms,dsk
at cs.nott.ac.uk)

Intelligent Multilevel Search Methodologies (contact Ender Ozcan, exo at
cs.nott.ac.uk)

--
________________________________________________________________
Professor Uwe Aickelin
School of Computer Science
The University of Nottingham
Jubilee Campus, Wollaton Road
Nottingham, NG8 1BB, UK.

tel: +44 (0)115 95 14215
e-mail: uwe.aickelin@nottingham.ac.uk
web: http://www.aickelin.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] NMA'10

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "METAHEURISTICS FOR OPTIMIZATION
PROBLEMS" at the
7th Conference on Numerical Methods and Applications NM&A'10,
to be held 20-24 August 2010 in Borovets, Bulgaria.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute for Parallel Processing, Bulgarian Academy of
Sciences and
Assoc. Prof. Antonio Nebro (antonio@lcc.uma.es)
from University of Malaga, Spain.

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

Important deadlines
Deadline for submission of abstracts
February 15, 2010
Notification of acceptance of the talks on the basis of the submitted
abstract
March 1, 2010
Deadline for submission of full papers
April 30, 2010
Notification of acceptance of full papers
June 20, 2010
Submission of accommodation forms
July 15, 2010


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

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

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page:
http://www.math.bas.bg/~nummeth/nma10

Special session organizers
Assoc. Prof. S. Fidanova, Institute of Parallel Processing, Bulgarian
Academy of
Science, stefka@parallel.bas.bg
Assoc. Prof. A. Nebro, University of Malaga, Spain, e-mal:
antonio@lcc.uma.es

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

FLoC 2010: Call for Papers

2010 FEDERATED LOGIC CONFERENCE (FLoC'10)

 Edinburgh, Scotland, U.K.
 July 9-21, 2010
 http://www.floc-conference.org

 CALL FOR PAPERS

* The fifth Federated Logic Conference (FLoC'10) will be held in
 Edinburgh, Scotland, U.K. (www.edinburgh.org), in July 2010, at the
 School of Informatics at University of Edinburgh (www.inf.ed.ac.uk).

* The following conferences will participate in FLoC:
 - CAV 2010:   Int'l Conference on Computer-Aided Verification
 - CSF 2010:   IEEE Computer Security Foundations Symposium
 - ICLP 2010:  Int'l Conference on Logic Programming
 - IJCAR 2010: Int'l Joint Conference on Automated Reasoning
 - ITP 2010:   Int'l Conference on Interactive Theorem Proving
 - LICS 2010:  IEEE Symposium on Logic in Computer Science
 - RTA 2010:   Int'l Conference on Rewriting Techniques and Applications
 - SAT 2010:   Int'l Conference on Theory and Applications of
               Satisfiability Testing

* Plenary events involving all the conferences are planned. In addition
 to the participating conferences, FLoC'10 will host a number of
 pre- and post-conference workshops. There will be receptions in the
 Edinburgh Castle and at the National Galleries of Scotland.

* Travel support for US student participants is expected.

* Detailed calls for papers (as well as submission instructions) for each
 of the participating conferences can be found at the FLoC'10 website at
 http://www.floc-conference.org

* Important dates:
 - CAV 2010:
      PC chairs: Byron Cook, Paul Jackson, Tayssir Touili
      Jan 11: abstract submission deadline
      Jan 15: paper submission deadline
 - CSF 2010:
      PC chairs: Michael Backes, Andrew Myers
      Feb 04: abstract submission deadline
      Feb 08: paper submission deadline
 - ICLP 2010:
      PC chairs: Manuel Hermenegildo, Torsten Schaub
      Jan 26: paper registration deadline
      Feb 02: paper submission deadline
 - IJCAR 2010:
      PC chairs: Jürgen Giesl, Reiner Hähnle
      Jan 15: abstract submission deadline
      Jan 22: paper submission deadline
 - ITP 2010:
      PC chairs: Matt Kaufmann, Lawrence C. Paulson
      Jan 15: abstract submission deadline
      Jan 22: paper submission deadline
 - LICS 2010:
      PC chair: Jean-Pierre Jouannaud
      Jan 10: abstract submission deadline
      Jan 17: paper submission deadline
 - RTA 2010:
      PC chair: Christopher Lynch
      Jan 15: abstract submission deadline
      Jan 22: paper submission deadline
 - SAT 2010:
      PC chairs: Ofer Strichman, Stefan Szeider
      Feb 01: abstract submission deadline
      Feb 08: paper submission deadline

* FLoC'10 Steering Committee:
  - General Chair: Moshe Y. Vardi
  - Conference Co-chairs: Leonid Libkin, Gordon Plotkin
  - CAV Representative: Edmund Clarke
  - ICLP Representative: Manuel Hermenegildo
  - IJCAR Representative: Alan Bundy
  - ITP Representative: Tobias Nipkow
  - LICS Representative: Martin Abadi
  - RTA Representative: Juergen Giesl
  - SAT Representative: Enrico Giunchiglia
  - EasyChair Representative: Andrei Voronkov



Tuesday, December 1, 2009

[DMANET] COCOON 2010 - First Call For Papers

###################################################################################
COCOON 2010 - First Call for Paper
The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010)

http://www.cise.ufl.edu/cocoon2010/

July 19 - July 21, 2010.
Sheraton Hotel, NhaTrang, Vietnam
###################################################################################

IMPORTANT DATES

* Submission Deadline: February 15, 2010
* Notification of acceptance: April 12, 2010
* Camera Ready / Registration: April 29, 2010
* Early Registration: May 17, 2010
* Conference Dates: July 19 - 21, 2010


SCOPE and MISSION

The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010) will be held in Nha Trang, Vietnam during July 19 -- 21.
The conference organizers would like to extend their most cordial
invitation to researchers around the world to come to one of the most
beautiful countries in South East Asia, to explore its 4000-year-old
culture, to enjoy the beach scenery and to exchange their most
significant research works.

Original research works in the areas of algorithms, theory of
computation, computational complexity, and combinatorics related to
computing are solicited. In addition to theoretical studies,
submissions that report on experimental and applied research of
general algorithmic interest are especially encouraged.

Topics of interest (but not limited to)

* Algorithms and data structures;
* Algorithmic game theory and online algorithms;
* Automata, languages, logic, and computability;
* Combinatorics related to algorithms and complexity;
* Complexity theory;
* Computational learning theory and knowledge discovery;
* Cryptography, reliability and security, and database theory;
* Computational biology and bioinformatics ;
* Computational algebra, geometry, and number theory;
* Graph drawing and information visualization;
* Graph theory, communication networks, and optimization;
* Parallel and distributed computing;
* Experimental analysis of algorithms


Submitted manuscripts must be no longer than 10 pages long (including
figures, references, and appendices) and be formatted in standard LNCS
format (for LNCS templates, please refer to
http://www.springer.com/lncs).

The proceedings of the conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science. High quality papers will be
invited to a special issue in Algorithmica and Journal of
Combinatorial Optimization.

Best Regards,

My T. Thai and Sartaj Sahni
TPC co-chairs

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010
**********************************************************
*
* 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] Lectureship in Mathematics - London School of Economics and Political Science

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE

Department of Mathematics

Lectureship in Mathematics

Salary: £40,123 to £46,477 pa. incl.

Applications are invited from candidates with proven research ability in
Mathematics, especially those with research interests in an area where
the Department has current strengths, such as algorithms and discrete
mathematics, financial mathematics, game theory, and probability theory.
Interest in applications of Mathematics or Computer Science to the
Social Sciences is an asset.

You will maintain an active programme of research and will contribute to
the general work of the department, including the teaching of a range of
mathematics courses.

You should have an established track-record of research at a level of
international excellence as well as a completed, or nearly completed,
PhD in a mathematical subject.

Ideally, the post will commence on 1 September 2010.

Information about the department can be found at
http://www2.lse.ac.uk/maths|

For a full application pack visit www.lse.ac.uk/jobsatLSE. If you cannot
download the pack, email hr.recruit.lec@lse.ac.uk or call 020 7955 6183,
quoting reference LEC/09/14.

The closing date for the receipt of applications is 18 January 2010 at
5.30pm. Regrettably, we are unable to accept any applications that are
received after this date.

We value diversity and wish to promote equality at all levels.

Please also see: http://www2.lse.ac.uk/maths/News/lectureship.aspx.
**********************************************************
*
* 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 at Maastricht University

PhD Position at Maastricht University
=======================================

A full-time PhD position is available in the

Operations Research Group at Maastricht University,
Department of Quantitative Economics.

The PhD candidate will contribute to research in the field of
Combinatorial Optimization or Algorithmic Game Theory.
Research can be performed within these and related areas:
* randomized algorithms and probabilistic analysis,
* algorithmic game theory,
* experimental evaluation of algorithms,
* approximation and online algorithms.

The successful candidate should have a Master's degree in Mathematics,
Computer Science, Econometrics, or a related field. A solid background
in Discrete Optimization, Theoretical Computer Science, or Algorithmic
Game Theory is preferred but not a must as the candidate will be given
the opportunity to follow courses in the LNMB PhD program during her/his
first year:
http://www.math.leidenuniv.nl/~lnmb/

Our department consists of 3 research groups, namely Mathematical
Economics & Game Theory, Econometrics, and Operations Research.
The Operations Research group currently consists of 8 faculty members
and 6 PhD students. Our working language is English.

Please see the website of the OR group for more details on its members
and their research interests:
http://www.fdewb.unimaas.nl/KE_v2/research/operationsresarch.asp

Please do not hesitate to send any questions to the email given below.

Please send your application (including curriculum vitae, copies of
certificates, and a letter of motivation) as well as two letters of
recommendation to the address below. Electronic submissions are highly
encouraged (please attach relevant documents as pdf).

Deadline for applications is December 31, 2009.
The letters of recommendation can be sent after the application, not
later than January 15, 2010.

Heiko Röglin
Maastricht University
Quantitative Economics
P.O. Box 616
6200 MD Maastricht
The Netherlands
Email: Heiko@Roeglin.org
Phone: +31 43 38 83815
http://www.roeglin.org
**********************************************************
*
* 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/
*
**********************************************************