NMR 2012 Call for Papers

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

CALL FOR PAPERS

NMR 2012

14th International Workshop on Non-Monotonic Reasoning (NMR 2012)

http://www.dbai.tuwien.ac.at/NMR12/

Co-located with KR 2012, DL 2012, AI*IA 2012

Rome, Italy

June 8-10, 2012

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

AIMS AND SCOPE

The NMR workshop series is the premier specialized forum for researchers in
non-monotonic reasoning and related areas. This will be the 14th workshop in
the series. Its aim is to bring together active researchers in the broad area
of non-monotonic reasoning, including belief revision, reasoning about
actions, argumentation, declarative programming, preferences, non-monotonic
reasoning for ontologies, uncertainty, and other related topics.

In this year, NMR will share a joint session together with the International
Workshop on Description Logics (DL 2012).

TOPICS

NMR 2012 welcomes the submission of papers broadly centered on issues and
research in non-monotonic reasoning. We welcome papers of either a
theoretical or practical nature. Topics of interest include (but are not
limited to):
- abductive reasoning and diagnosis
- algorithms and complexity analysis
- argumentation and argument-based non-monotonic logics
- answer set programming,
- belief revision and information fusion
- belief updating and inconsistency handling
- declarative programming for non-monotonic reasoning
- default reasoning
- empirical studies of reasoning strategies
- foundations of non-monotonic reasoning
- hybrid approaches (nonmonotonic reasoning combined with
other computing paradigms)
- implementations and systems
- non-monotonic logics in multi-agent interaction, including
negotiation and dispute resolution
- non-monotonic reasoning for ontologies
- reasoning and decision-making under uncertainty
- reasoning with preferences
- representing actions and planning
- similarity-based reasoning

SUBMISSIONS

Papers must describe original research and should not exceed 9 pages
in AAAI style (http://www.aaai.org/Publications/Author/author.php)
including references, figures, and appendixes if any.

The best paper among the ones written solely by students (i.e. persons
not holding a PhD as of February 28th, 2012) will be awarded a prize of
400 Euros. Authors of such papers are requested to indicate their
eligibility upon submission at Easychair.
Short Papers (max. 4 pages) presenting implemented systems related to NMR
are also welcome!

Paper submission will be handled electronically by means of the
Easychair system. Papers must be submitted in PDF only.
The submission page is available at

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

NMR does not ask authors to sign over the copyright of their papers.
Copyright therefore lies with the authors, and as far as NMR is concerned,
they are free to submit to other conferences and workshops as well.

IMPORTANT DATES

Submission deadline: February 28, 2012
Notification: March 31, 2012
Camera-ready articles due: April 25, 2012
Workshop: June 8-10, 2012

PROCEEDINGS

The workshop contributions will be published electronically.

LOCATION

The workshop will be held in the conference rooms of
Sapienza Università di Roma.

WORKSHOP CO-CHAIRS

Riccardo Rosati (Sapienza Università di Roma, Italy)
Stefan Woltran (Vienna University of Technology, Austria)

CONTACT

nmr12@dbai.tuwien.ac.at

SEA 2012 - 1st Call for Papers

SEA 2012
11th International Symposium on Experimental Algorithms
http://sea2012.labri.fr/

June 7-9, 2012
Bordeaux, France

CALL FOR PAPERS

AIMS & SCOPE

SEA, previously known as WEA (Workshop on Experimental Algorithms), is an
international forum for researchers in the area of design, analysis, and
experimental evaluation and engineering of algorithms, as well as in various
aspects of computational optimization and its applications. The preceding
symposia were held in Riga, Monte Verita, Rio de Janeiro, Santorini, Menorca
Island, Rome, Cape Cod, Dortmund, Ischia Island, and Crete.

The main theme of the symposium is the role of experimentation and of
algorithm engineering techniques in the design and evaluation of
algorithms and data structures. Submissions should present significant
contributions supported by experimental evaluation, methodological
issues in the design and interpretation of experiments, the use of
(meta-)heuristics, or application-driven case studies that deepen the
understanding of a problem's complexity.

TOPICS OF INTEREST

Topics of interest include, but are not limited to:

- Algorithm Engineering
- Algorithmic Libraries
- Algorithmic Mechanism Design
- Analysis of Algorithms
- Algorithms for Memory Hierarchies
- Approximation Techniques
- Bioinformatics
- Branch and Bound Algorithms
- Combinatorial and Irregular Problems
- Combinatorial Structures and Graphs
- Communication Networks
- Complex Networks
- Computational Geometry
- Computational Learning Theory
- Computational Optimization
- Computer Systems
- Cryptography and Security
- Data Streams
- Data Structures
- Distributed and Parallel Algorithms
- Evaluation of Algorithms for Realistic Environments
- Experimental Techniques and Statistics
- Graph Drawing
- Heuristics for Combinatorial Optimization
- Implementation, Testing, Evaluation and Fine-tuning
- Information Retrieval
- Integer Programming
- Logistics and Operations Management
- Machine Learning and Data Mining
- Mathematical Programming
- Metaheuristic Methodologies
- Multiple Criteria Decision Making
- Network Analysis
- Novel Applications of Algorithms in Other Disciplines
- On-line Problems
- Parallel Algorithms and Computing
- Railway Optimization using Algorithmic Methods
- Randomized Techniques
- Robotics
- Semidefinite Programming
- Simulation
- Software Repositories and Platforms for using Algorithms
- Telecommunications and Networking
- World Wide Web Algorithms

IMPORTANT DATES

Submission deadline: January 25, 2012
Author notification: March 9, 2012
Camera-ready submission: March 25, 2012

PROCEEDINGS

Accepted papers will appear in the SEA 2012 proceedings published
by Springer Verlag in the LNCS series. (Some papers may be invited
to be published as short papers.)

SPECIAL ISSUE

Selected papers from SEA 2012 will be considered for a special
issue of the ACM Journal on Experimental Algorithmics
(http://www.jea.acm.org/).

SUBMISSION

Authors are invited to submit high-quality manuscripts reporting
original unpublished research and recent developments in the topics
related to the symposium. Simultaneous submission to other conferences
or workshops with published proceedings is not allowed.

Submissions must not exceed 12 pages formatted according to LNCS
style plus an optional, clearly marked appendix of reasonable
length (to be read at the program committee's discretion). All papers
will be peer reviewed and comments will be provided to the authors.

The submission system can be accessed via http://sea2012.labri.fr/.

PROGRAM COMMITTEE

Ioannis Caragiannis (U. Patras & CTI, Greece)
Colin Cooper (King's College London, UK)
David Coudert (INRIA Sophia, France)
Jurek Czyzowicz (U. Québec en Outaouais, Canada)
Robert Elsässer (U. Paderborn, Germany)
Thomas Erlebach (U. of Leicester, UK)
Sándor P. Fekete (TU Braunschweig, Germany)
Paola Festa (U. of Napoli Federico II, Italy)
Michele Flammini (U. L'Aquila, Italy)
Pierre Fraigniaud (CNRS and U. Paris Diderot, France)
Leszek A. GÄ…sieniec (U. Liverpool, England)
Juraj Hromkovič (ETH Zürich, CH)
Christos Kaklamanis (U. Patras & CTI, Greece)
Ralf Klasing (chair) (CNRS and U. Bordeaux, France)
Mirosław Korzeniowski (Wrocław U. Technology, Poland)
Adrian Kosowski (INRIA Bordeaux, France)
Arie Koster (RWTH Aachen, Germany)
Dariusz R. Kowalski (U. Liverpool & IMDEA Networks)
Christian Laforest (U. Blaise Pascal, Clermont Ferrand, France)
Leo Liberti (LIX, Ecole Polytechnique, France)
Andrea Lodi (U. of Bologna, Italy)
Alberto Marchetti-Spaccamela (U. of Rome "La Sapienza", Italy)
Luca Moscardelli (U. Pescara, Italy)
Petra Mutzel (TU Dortmund, Germany)
Alfredo Navarra (U. Perugia, Italy)
Marina Papatriantafilou (Chalmers U. Technology, Göteborg, Sweden)
Panos M. Pardalos (U. Florida, USA)
Vangelis Th. Paschos (U. Paris-Dauphine, France)
Joseph G. Peters (Simon Fraser U., Canada)
Guido Proietti (U. L'Aquila, Italy)
Tomasz Radzik (King's College London, UK)
Mauricio G.C. Resende (AT&T Labs Research, USA)
Celso C. Ribeiro (U. Federal Fluminense, Brazil)
Nicolas Schabanel (CNRS and U. Paris Diderot, France)
Christian Scheideler (U. Paderborn, Germany)
Leen Stougie (VU University & CWI, Amsterdam, NL)
Walter Unger (RWTH Aachen, Germany)
Annegret Wagler (U. Blaise Pascal, Clermont Ferrand, France)
Christos Zaroliagis (U. Patras & CTI, Greece)

STEERING COMMITTEE

Edoardo Amaldi (Politecnico di Milano, Italy)
David A. Bader (Georgia Inst. of Technology, USA)
Josep Diaz (T.U. Catalonia, Spain)
Giuseppe F. Italiano (U. Roma "Tor Vergata", Italy)
David Johnson (AT&T Labs--Research, USA)
Klaus Jansen (U. Kiel, Germany)
Kurt Mehlhorn (MPII Saarbruecken, Germany)
Ian Munro (U. Waterloo, Canada)
Sotiris Nikoletseas (U. Patras & CTI, Greece)
Jose Rolim (chair) (U. Geneva, Switzerland)
Pavlos Spirakis (U. Patras & CTI, Greece)

ORGANIZING COMMITTEE

Florent Foucaud (U. Bordeaux, France)
Ralf Klasing (chair) (CNRS and U. Bordeaux, France)
Mirosław Korzeniowski (Wrocław U. Technology, Poland)
Adrian Kosowski (INRIA Bordeaux, France)
Dominik PajÄ…k (INRIA Bordeaux, France)
Petru Valicov (U. Bordeaux, France)

CONTACT

For further information, please send an e-mail to sea2012@labri.fr.

Dear Colleagues,

Attached please find the 1st Call for Papers for SEA 2012. Please,
distribute the Call for Papers to any of your colleagues who may be
potentially interested in SEA 2012.

Thank you very much.

Best regards,

Ralf Klasing

[DMANET] EURO 2012: Optimization in Public Transport

Call for Sessions/Papers within the Stream

===== Optimization in PUBLIC TRANSPORT =====

at the EURO XXV Conference

July 8-11, 2012 in Vilnius, Lithuania

http://www.euro-2012.lt/welcome


Following the success of the Public Transport stream on the previous EURO
conferences, EURO 2012 will again offer a stream "Optimization in Public Transport".
This session is organized by Anita Schoebel and Leo Kroon.

We are now looking for session organizers and for papers fitting in this stream.

Are you interested to organize a session of 4 talks (80 min) on some particular
topic within the topic "Optimization in Public Transport"?

This task involves choosing the specific topic, contacting speakers, and handling
their submissions in the online system of the conference, to which you will then
get access. Usually, but not necessarily, the session organizer is also session
speaker and/or chair.

If you are interested, please let us know as soon as possible, but certainly
before November 30, 2011, even if you are not yet fully sure, and best before
contacting potential speakers.

In case you plan to present a paper within our stream, but do not want to organize
a full session, please let us know as well, and submit your title and abstract first
to us. Abstracts submitted directly to the conference are much harder to trace later
for inclusion in the correct stream.

We are looking forward to a successful Public Transportation stream at EURO 2012
and to meeting you in Vilnius!

Anita Schoebel and Leo Kroon


Anita Schoebel
University of Göttingen
schoebel@math.uni-goettingen.de

Leo Kroon
Rotterdam School of Management
Erasmus University Rotterdam
lkroon@rsm.nl

--------------------------------Disclaimer--------------------------------
De informatie verzonden in dit e-mail bericht inclusief de bijlage(n) is
vertrouwelijk en is uitsluitend bestemd voor de geadresseerde van dit
bericht. Lees verder: http://www.eur.nl/email-disclaimer

The information in this e-mail message is confidential and may be legally
privileged. Read more: http://www.eur.nl/english/email-disclaimer
--------------------------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************

ICFP 2012: Call for workshops and co-located events

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2012
17th ACM SIGPLAN International Conference on Functional Programming
September 9 - 15, 2012
Copenhagen, Denmark
http://icfpconference.org/icfp2012/

The 17th ACM SIGPLAN International Conference on Functional
Programming will be held in Copenhagen, Denmark on September 9-15,
2012. ICFP provides a forum for researchers and developers to hear
about the latest work on the design, implementations, principles, and
uses of functional programming.

Proposals are invited for workshops (and other co-located events, such
as tutorials) to be affiliated with ICFP 2012 and sponsored by
SIGPLAN. These events should be more informal and focused than ICFP
itself, include sessions that enable interaction among the attendees,
and foster the exchange of new ideas. The preference is for one-day
events, but other schedules can also be considered.

The workshops are scheduled to occur on September 9 (the day before
ICFP) and September 13-15 (the three days after ICFP).

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

Submission details
Deadline for submission: November 19, 2011
Notification of acceptance: December 17, 2011

Prospective organizers of workshops or other co-located events are
invited to submit a completed workshop proposal form in plain text
format to the ICFP 2012 workshop co-chairs (Patrik Jansson and
Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au
by November 19, 2011. (For proposals of co-located events other
than workshops, please fill in the workshop proposal form and just
leave blank any sections that do not apply.) Please note that this
is a firm deadline.

Organizers will be notified if their event proposal is accepted by
December 17, 2011, and if successful, depending on the event, they
will be asked to produce a final report after the event has taken
place that is suitable for publication in SIGPLAN Notices.

The proposal form is available at:

http://www.icfpconference.org/icfp2012/icfp12-workshops-form.txt

Further information about SIGPLAN sponsorship is available at:

http://acm.org/sigplan/sigplan_workshop_proposal.htm

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

Selection committee

The proposals will be evaluated by a committee comprising the
following members of the ICFP 2012 organizing committee, together with
the members of the SIGPLAN executive committee.

Workshop Co-Chair: Gabriele Keller (University of New South Wales)
Workshop Co-Chair: Patrik Jansson (Chalmers University of Technology)
General Chair : Peter Thiemann (University of Freiburg)
Program Chair: Robby Findler (Northwestern University)

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

Further information

Any queries should be addressed to the workshop co-chairs (Patrik Jansson and
Gabriele Keller), via email to icfp12-workshops at cse.unsw.edu.au

[DMANET] Additive Combinatorics in Paris 2012

Dear colleague,

We are organizing a week-long conference next summer entitled

Combinatoire Additive à Paris
9th-13th July, 2012

http://caparis2012.wordpress.com

It will be held at the Institut Henri Poincare in the centre of Paris.

The conference is dedicated to the memory of Yahya ould Hamidoune, and its
envisioned scope is additive combinatorics, perceived broadly to include
additive and combinatorial number theory, additive group theory, graph
theory, probabilistic combinatorics and adjacent fields.

Amongst those who have agreed to represent these topics are Noga Alon,
Emmanuel Breuillard, Alfred Geroldinger, Tim Gowers, Ben Green, Mel
Nathanson, Oriol Serra, Benny Sudakov and Tamar Ziegler. A more detailed
list of speakers and already registered participants is available from the
website.

There will be no registration fee, but early registration will help us
plan, and you will therefore find a form for this purpose on the website.
For doctoral students and early-career researchers, we might have
a limited amount of travel funding available.

We look forward to welcoming you in Paris next year. In the meantime,
please feel free to contact us at caparis2012@ihp.fr with any questions or
concerns.

For the organisers, A. Plagne, E. Balandraud, B. Girard, W. Schmid, J. Wolf,
with best regards,

Wolfgang Schmid

p.s. We apologise in case you receive multiple copies of this message.
**********************************************************
*
* 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] Junior faculty position in Operations Research at MIT Sloan

The MIT Sloan School invites applications for a tenure-track faculty position in the area of Operations Research & Statistics beginning July 1, 2012 or as soon thereafter as possible. Strong applicants will demonstrate the potential for excellence in research and teaching; duties will include teaching undergraduate and graduate level courses in the area of Operations Research or Statistics. We are especially interested in candidates who can build a strong methodological research base, contribute to application areas of high impact, and be successful teachers for the undergraduate, MBA, and PhD programs.

Applicants should possess or be close to the completion of a PhD in a relevant field by the date of appointment. We especially want to identify qualified female and minority candidates for consideration in this position. Applicants need to submit 1) an up-to-date curriculum vitae, 2) relevant information about teaching as well as research experience and performance, and 3) three letters of recommendation by November 1, 2011. If papers are available, please provide electronic copies.

Please send applications to:
or-search@mit.edu
Operations Research & Statistics Faculty Search Committee
c/o Mr. David V. Merrill
MIT Sloan School of Management

MIT is an equal opportunity employer committed to building a culturally diverse intellectual community and strongly encourages applications from women and minorities.

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

Book Announcement - "Apartness and Uniformity: A Constructive Development"

__________________________________________________________________________
BOOK ANNOUNCEMENT:

Published 2011 in the CiE/Springer book series "Theory and Applications of
Computability" -

Douglas S. Bridges and Luminita Simona Vita:
"Apartness and Uniformity: A Constructive Development"

Largely an exposition of the authors' own research, this is the first book
dealing with the apartness approach to constructive topology, and is a
valuable addition to the literature on constructive mathematics and on
topology in computer science. It is aimed at graduate students and
advanced researchers in theoretical computer science, mathematics, and
logic who are interested in constructive/algorithmic aspects of topology.

Hardcover, ISBN 978-3-642-22414-0
http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-22414-0

Please order this book for your personal/university library

For more information on forthcoming books in the series see:

http://www.computability.de/series/

__________________________________________________________________________

[DMANET] Book Announcement - "Apartness and Uniformity: A Constructive Development"

__________________________________________________________________________
BOOK ANNOUNCEMENT:

Published 2011 in the CiE/Springer book series "Theory and Applications of
Computability" -

Douglas S. Bridges and Luminita Simona Vita:
"Apartness and Uniformity: A Constructive Development"

Largely an exposition of the authors' own research, this is the first book
dealing with the apartness approach to constructive topology, and is a
valuable addition to the literature on constructive mathematics and on
topology in computer science. It is aimed at graduate students and
advanced researchers in theoretical computer science, mathematics, and
logic who are interested in constructive/algorithmic aspects of topology.

Hardcover, ISBN 978-3-642-22414-0
http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-22414-0

Please order this book for your personal/university library

For more information on forthcoming books in the series see:

http://www.computability.de/series/

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

Upcoming Theory Grant Deadlines

Dear Colleagues:

I am writing with a brief report on funding opportunities for theoretical CS
at NSF and DARPA.  See also the webpage
   http://theorymatters.org/pmwiki/pmwiki.php?n=Main.FundingOpportunities
for more information.

NSF:

 - The CCF Core Programs deadlines are: November 28 for large size
  ($1,200,001 to $3,000,000 total budget with durations up to five
  years) and December 19 for small size (up to $500,000 total budget
  with durations up to three years).  CCF has three Core Programs, of
  which Algorithmic Foundations (AF) is the primary program for TCS
  work.  One note is that CS/Econ style work is now supported by the
  cross-cutting ICES program (see below). The CCF Core Program
  solicitation is available at
  http://www.nsf.gov/pubs/2011/nsf11557/nsf11557.htm

 - Interface between Computer Science and Economics & Social
  Sciences (ICES). Deadline is December 6.  Includes small projects
  of up to $400,000 total budget with durations up to three years and
  large projects with $400,001 to $1,000,000 total budget with
  durations up to four years. See solicitation at:
  http://www.nsf.gov/pubs/2011/nsf11584/nsf11584.htm

 Note: In the long run, the health of the Algorithmic Foundations
 cluster will depend upon the quality and quantity of proposals it
 receives.  Also, unlike a number of years ago, having another grant
 does not disqualify you from from getting a new theory grant.


DARPA:

 - DARPA-BAA-12-01: Graph-theoretic Research in Algorithms and the
  PHenomenology of Social networks (GRAPHS). Deadline: December 15,
  2011.  See solicitation at
  https://www.fbo.gov/index?s=opportunity&mode=form&id=04329fe397d72eccd3f7873bc123ff49&tab=core&_cview=0


Avrim Blum
Chair, Sigact Committee for the Advancement of Theoretical Computer Science

Please Post - ACM-SIAM Symposium on Discrete Algorithms (SODA12) - Registration and Program

Subject: 

Registration and Program Now Available - ACM-SIAM Symposium on Discrete Algorithms (SODA12)

 

Conference Name:

ACM-SIAM Symposium on Discrete Algorithms (SODA12)

 

Program Committee Chair:

Yuval Rabani, The Hebrew University of Jerusalem, Israel

 

Location:

The Westin Miyako, Kyoto, Japan

 

Dates:

January 17-19, 2012

 

Invited Speakers:

Jennifer Chayes, Microsoft Research, US

Martin Grohe, Humboldt-Universität zu Berlin, Germany

 

+++++++++++++++++++++++

Registration and the conference schedule are now posted at http://www.siam.org/meetings/da12/index.php

 

HOTEL RESERVATION DEADLINE
December 17, 2011

 

PRE-REGISTRATION DEADLINE
December 20, 2011 (The registration system will close at midnight, Japan Standard Time)

+++++++++++++++++++++++

 

Twitter hashtag: #SIAMDA12

 

For additional information, contact the SIAM Conference Department at meetings@siam.org.

 

 

 

 

 

 

 

[DMANET] Call for Papers: Special Issue JOC on Graph and Hypergraph Limits

Call for Papers: Special Issue on Graph & Hypergraph Limits,
Journal of Combinatorics (www.intlpress.com/JOC)

Aim and Scope:
The development of a limit notion based on homomorphism densities for
graphs, hypergraphs, and other combinatorial structures, has had
interesting ramifications in combinatorics and probability, and has found
applications in extremal graph theory, statistical physics, and computer
science. Papers are solicited on all topics relating to this new theory,
including (but not restricted to): homomorphisms, quasi-random graphs,
quantum graphs, limits of sparse graphs, extremal graph theory, random
infinite graphs.

Guest Editor:
Jeannette Janssen, Dalhousie University

Journal:
The new Journal of Combinatorics (JOC), launched in 2010, publishes
high-quality research papers in all branches of combinatorics and related
areas, including both the structural as well as the algorithmic aspects of
these subjects. (Prior to 2010, International Press published the print
version of the "Electronic Journal of Combinatorics".)
Editors-in-Chief are Ron Graham and Fan Chung.

Deadline:
The submission deadline is March 30, 2012. The Special Issue is scheduled
for publication early 2013.

Submission:
Manuscripts should be submitted through the JOC submission site:
http://www.intlpress.com/JOC/JOC-Submissions.php
Authors should prepare and submit their manuscripts according to the
directions given at this site. IMPORTANT: Authors should include the
message "for the Special issue on graph limits" in "Author's comments to
the editor" when they submit their manuscripts.

Papers should contain original research, and not have been previously
published nor be currently under consideration for publication elsewhere.
Refereeing and the selection of papers follow the normal standards of JOC.
For further questions and communications, please contact the Guest Editor
at janssen@mathstat.dal.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/
*
**********************************************************

CSR-2012, 1st CfP

We apologize for multiple copies.

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

First Call for Papers

7th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2012)

July 3-7, 2012, Nizhni Novgorod, Russia

http://agora.guru.ru/display.php?conf=csr2012

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

CSR 2012 intends to reflect the broad scope of international cooperation in
computer science. It is the seventh conference in a series of regular events
previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008),
Novosibirsk (2009), Kazan (2010), and St.Petersburg (2011). The proceedings
are published in Springer LNCS.

IMPORTANT DATES

Deadline for submissions: December 11, 2011
Notification of acceptance: February 17, 2012
Conference dates: July 3-7, 2012

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

VENUE

Nizhni Novgorod was founded by Prince Yuri (George) Vsevolodovich in 1221
on the confluence of two great Russian rivers, Volga and Oka.
It is a large city accessible by multiple international airlines
including regular Lufthansa flights from Frankfurt.

TOPICS include, but are not limited to:

* algorithms and data structures
* automata and formal languages
* combinatorial optimization
* constraint solving
* computational complexity
* cryptography
* combinatorics in computer science
* 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

INVITED SPEAKERS include

* Lev Beklemishev (MI RAS)
* Mikolaj Bojanzcyk (Warsaw)
* Julien Cassaigne (Marseille)
* Jaroslav Nesetril (Prague)
* Pavel Pevzner (UCSD and SPbAU RAS)

TURING LECTURE connected to the THE ALAN TURING YEAR 2012 will be given by

* Yuri Matiyasevich (PDMI RAS)

PROGRAM COMMITTEE

* Susanne Albers (Berlin)
* Andris Ambainis (Riga)
* Alberto Bertoni (Milan)
* Bruno Durand (Marseille)
* Edward A. Hirsch (PDMI RAS)
* Juraj Hromkovic (ETH Zurich)
* Kazuo Iwama (Kyoto)
* Juhani Karhumaki (Turku, chair)
* Markus Lohrey (Leipzig)
* Ernst Mayr (Munich)
* Ilya Mironov (Microsoft Research)
* Anca Muscholl (Bordeaux)
* Alexander Okhotin (Turku)
* Alexander Razborov (Chicago)
* Wojcieh Rytter (Warsaw)
* Jiri Sgall (Prague)
* Alexander Shen (Moscow)
* Arseny Shur (Ekaterinburg)
* Wofgang Thomas (Aachen)
* Nikolai Vereshchagin (Moscow)
* Mikhail Vyalyi (CC RAS)
* Gerhard Woeginger (Eindhoven)

ORGANIZERS

N.I.Lobachevsky State University of Nizhni Novgorod

CONFERENCE CHAIR

Michail Prilutskii (UNN)

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),
in English; instructions can be found at
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.

Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2012

FURTHER INFORMATION AND CONTACTS

Web: http://agora.guru.ru/display.php?conf=csr2012
Email: csr2012.conf at gmail.com

[DMANET] ARC postdoc position at Georgia Tech

Please post the advertisement below:

The Algorithms, Randomness and Complexity (ARC) Center at Georgia Tech http://www.arc.gatech.edu/  is seeking a postdoctoral fellow to participate in research investigations.  Candidates with a PhD in Computer Science, Mathematics, Operations Research or a related field are encouraged to apply. The selected candidate will have the opportunity to work on any aspect of algorithms and complexity, broadly interpreted, and collaborate with ARC faculty.

The position is for up to two years, with a start date between July 1 and September 1. There is no teaching requirement, but the postdoc is encouraged to lead a research seminar. Interested candidates should send a CV, research statement, and request 3 letters of recommendation be sent to:  arc-postdoc@cc.gatech.edu

Applications should be received by December 10, 2011 for full consideration.

Please contact Elizabeth Ndongi (ndongi@cc.gatech.edu) for any further information.

Elizabeth

Elizabeth Ndongi
Georgia Institute of Technology
College of Computing
School of Computer Science
Klaus Advanced Computing Building
266 Ferst Drive, Atlanta GA 30332-0765
Phone: 404-385-3190
E-Mail: ndongi@cc.gatech.edu
http://www.cc.gatech.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/
*
**********************************************************

Call for papers JSC-ISSAC 2011 -- extended deadline

CALL FOR PAPERS

JOURNAL OF SYMBOLIC COMPUTATION

SPECIAL ISSUE FOR ISSAC 2011

***** EXTENDED DEADLINE: October 30th, 2011 *****

Guest Editors: Ioannis Z. Emiris, Eric Schost

The International Symposium on Symbolic and Algebraic Computation
(ISSAC) is the premier annual conference to present and discuss new
developments and original research results in all areas of symbolic
mathematical computation. This special issue is related to topics
discussed in the context of the ISSAC 2011 Conference, held in San
Jose, California.

IMPORTANT DATES:
- submission: 30th of October, 2011
- notification of acceptance / rejection: early April 2012
- camera ready version: May 2012
- issue ready: July 2012

All areas of computer algebra and symbolic computation are of
interest. These include, but are not limited to:

Algorithmic aspects: Exact and symbolic linear, polynomial and
differential algebra. Symbolic-numeric, homotopy, and series methods.
Computational geometry, group theory, number theory, quantifier
elimination and logic. Summation, recurrence equations, integration,
ODE & PDE. Theoretical and practical aspects, including algebraic
complexity, and techniques for important special cases.

Software aspects: Design of packages and systems, data representation.
Parallel and distributed algebraic computing, considerations for
modern hardware. User-interface issues, and use with systems for,
e.g., digital libraries, courseware, simulation and optimization,
automated theorem-proving, computer-aided design, and automatic
differentiation.

Application aspects: Applications that stretch the current limits of
computer algebra, use it in new ways, or apply it in situations with
broad impact, in particular to the natural sciences, life sciences,
engineering, economics and finance, and education.

The submission is open to contributions not necessarly related to
papers included in the proceedings of ISSAC 2011. Papers must not
duplicate work already published or submitted for publication
elsewhere. Improved or extended versions of papers included in the
proceedings of ISSAC 2011 are welcome; in that case, a cover letter
should explain what are the new ideas compared to the related ISSAC
2011 proceedings paper.

All the papers will be refereed according to the JSC standards.
Papers submissions should follow the guidelines for JSC submssions
(see www4.ncsu.edu/~hong/jsc.htm) and should be submitted to easychair
at http://www.easychair.org/conferences/?conf=jscissac11

The introduction of the paper must explicitly address the following
questions in succinct and informal manner:
- What is the problem?
- Why is the problem important?
- What has been done so far on the problem?
- What is the main contribution of the paper on the problem?
- Why is the contribution original?
- Why is the contribution non-trivial?

When feasible, all the main definitions, theorems and algorithms
should be illustrated by simple but meaningful examples.

Presburger Award 2012 - Call for Nominations

Presburger Award for Young Scientists

Call for Nominations

Deadline: December 31st, 2011

Starting in 2010, the European Association of Theoretical Computer Science (EATCS) established
the Presburger Award, conferred annually at the International Colloquium on Automata, Languages
and Programming (ICALP) to a young scientist (in exceptional cases to several young scientists) for
outstanding contributions in theoretical computer science, documented by a published paper or a
series of published papers.

The Award is named after Mojżesz Presburger who accomplished his path-breaking work on
decidability of the theory of addition (which today is called Presburger arithmetic) as a student in
1929. In 2010 the Presburger Award was given to Mikołaj Bojańczyk (Warsaw) for his deep
contributions to automata theory and to logic and algebra in computer science. Patricia Bouyer-
Decitre was the recipient of the award in 2011 for her fundamental contributions to the theory and
applications of timed automata as a model of real-time systems.

Nominations for the Presburger Award can be submitted by any member or group of members of
the theoretical computer science community except the nominee and his/her advisors for the
master thesis and the doctoral dissertation. Nominated scientists have to be at most 35 years at
the time of the deadline of nomination (i.e., for the Presburger Award of 2012 the date of birth
should be in 1976 or later).

The Presburger Award Committee of 2012 consists of Monika Henzinger (Vienna), Antonín Kučera
(Brno) and Stefano Leonardi (Rome, chair). Nominations, consisting of a two page justification and
(links to) the respective papers, as well as additional supporting letters (if any), should be sent to:

Stefano Leonardi,

Dipartimento di Ingegneria Informatica,
Automatica e Gestionale Antonio Ruberti,
Sapienza University of Rome,
Via Ariosto 25, 00185 Roma, Italy; or

leon@dis.uniroma1.it

by December 31st, 2011.

The award includes an amount of 1000 Euro and an invitation to ICALP2012 for a lecture.
The Presburger Award is sponsored by BiCi, the Bertinoro international Center for informatics.

For further information: http://www.eatcs.org/index.php/presburger

ACM Author-Izer

ACM is introducing the ACM Author-Izer, a unique service that enables ACM authors to post links on either their own web page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.  ACM Author-Izer also allows the dynamic display of download and citation statistics for each "authorized" article on the author's personal page. By linking the author's personal bibliography with the ACM Digital Library, downloads from the author's site are captured in official ACM statistics, more accurately reflecting total usage. ACM Author-Izer also expands ACM's reputation as an innovative "Green Path" publisher.

ARC postdoc position at Georgia Tech

The Algorithms, Randomness and Complexity (ARC) Center at Georgia Tech
http://www.arc.gatech.edu/ is seeking a postdoctoral fellow to participate
in research investigations. Candidates with a PhD in Computer Science,
Mathematics, Operations Research or a related field are encouraged to apply.
The selected candidate will have the opportunity to work on any aspect of
algorithms and complexity, broadly interpreted, and collaborate with ARC
faculty.

The position is for up to two years, with a start date between July 1 and
September 1. There is no teaching requirement, but the postdoc is encouraged
to lead a research seminar. Interested candidates should send a CV, research
statement, and request 3 letters of recommendation be sent to:
arc-postdoc@cc.gatech.edu

Applications should be received by December 10, 2011 for full consideration.

Please contact Elizabeth Ndongi (ndongi@cc.gatech.edu) for any further
information.

Elizabeth

Elizabeth Ndongi
Georgia Institute of Technology
College of Computing
School of Computer Science
Klaus Advanced Computing Building
266 Ferst Drive, Atlanta GA 30332-0765
Phone: 404-385-3190
E-Mail: ndongi@cc.gatech.edu
http://www.cc.gatech.edu

ISCO 2012: 2nd CfP

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
April 19-21, 2012

Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012

Athens University of Economics and Business,
Athens, Greece

http://isco12.cs.aueb.gr/
isco12@cs.aueb.gr

ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.

Spring School

ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.

Invited Speakers

Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna

Important Dates

Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012

Submission - Publications

The submission deadline is Thursday December 1, 2011.
Paper submission will be handled only via Easychair:
https://www.easychair.org/conferences/?conf=isco2012

Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

There will be two types of submissions:

a) Regular papers

They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Simultaneous submission to other conferences with published proceedings or
journals is not allowed.

Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors. The authors will have to prepare their
camera-ready version two weeks after the end of ISCO 2012.

b) Short papers

They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings.

Special issues

Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.

Program Committee

Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens

Organizing Committee

Christos Amanatidis, AUEB,
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens

________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105

[DMANET] ISCO 2012: 2nd CfP

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
April 19-21, 2012

Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012

Athens University of Economics and Business,
Athens, Greece

http://isco12.cs.aueb.gr/
isco12@cs.aueb.gr

ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.

Spring School

ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.

Invited Speakers

Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna

Important Dates

Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012

Submission - Publications

The submission deadline is Thursday December 1, 2011.
Paper submission will be handled only via Easychair:
https://www.easychair.org/conferences/?conf=isco2012

Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

There will be two types of submissions:

a) Regular papers

They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Simultaneous submission to other conferences with published proceedings or
journals is not allowed.

Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors. The authors will have to prepare their
camera-ready version two weeks after the end of ISCO 2012.

b) Short papers

They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings.

Special issues

Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.

Program Committee

Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens

Organizing Committee

Christos Amanatidis, AUEB,
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens

________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105

**********************************************************
*
* 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 algorithm engineering at KIT Karlsruhe

=======================================================================
The group Theoretical Computer Science / Parallel Computing (Juniorprof.
Meyerhenke) at the Department of Informatics of Karlsruhe Institute of
Technology (KIT) is inviting applications for the position of a

Research Assistant (m/f) (pay grade 13 TV-L)

starting as soon as possible. This full-time position is initially
limited to three years. The pursuit of a Ph.D. degree as part of this
position is explicitly supported.

Working Area:
-------------

In the focus of this position are research projects in parallel
algorithm engineering. The research group, which has been established
only recently, is primarily concerned with the development of practical
sequential and parallel algorithms for problems from graph theory and
combinatorial scientific computing. Examples are the analysis of large
(social) networks and the acceleration of scientific simulations.

Further responsibilities as part of the position include teaching
tutorials and the supervision of bachelor and master students. That is
why at least basic knowledge of German is desirable.

Requirements:
-------------

* Very good university degree (Master or equivalent) in computer
science or a related field, in particular (applied) mathematics
* Knowledge in algorithm engineering, in particular proficiency in
software development as well as in theoretical analysis of algorithms
* Knowledge in parallel programming is a plus, but no requirement
* Self-motivation, team spirit and willingness to work in
interdisciplinary projects

KIT is pursuing a gender equality policy. We would therefore
particularly encourage qualified women to apply. If qualified,
handicapped applicants will be preferred.

Please send your application documents (cover letter, CV, copies of
certificates and the contact information of two references) by 7th
November 2011 to:

Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Juniorprof. Dr. Henning Meyerhenke
Am Fasanengarten 5
76131 Karlsruhe
Email: meyerhenke@kit.edu

KIT – Universität des Landes Baden-Württemberg und nationales
Forschungszentrum in der Helmholtz-Gemeinschaft.
========================================================================

--

=====================================
Juniorprof. Dr. Henning Meyerhenke
JP Theor. Inf. / Parallel Computing

Karlsruhe Institute of Technology
Institute of Theoretical Informatics

Box 6980
D-76128 Karlsruhe, Germany

Building 50.34, Room 281
Phone: +49-721-608-41876
=====================================
**********************************************************
*
* 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/
*
**********************************************************