TOCT Editor Search

Dear Colleagues

This is to let you know that ACM Transactions on Computation
Theory is seeking nominations for a new editor-in-chief to replace
Lance Fortnow (many thanks to Lance for serving as the founding
editor-in-chief).

A link to the call for nominations is below

http://people.csail.mit.edu/madhu/toct-search.html

The nomination process is really simple - just send mail to me at
toct@csail.mit.edu. Please nominate strong candidates !

Madhu Sudan
Chair, Search Committee

[DMANET] ICIAM 2011 - August 2010 update

ICIAM 2011 - 7th International Congress on Industrial and Applied
Mathematics

July 18-22, 2011

Vancouver, British Columbia, CANADA

www.iciam2011.com <http://www.iciam2011.com>

If this year's outstanding summer weather is any indication, you have
yet another reason to come to Vancouver, Canada for ICIAM 2011 from July
18 to 22!

This just in! The ICIAM 2011 poster is now available on line. Click here
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=5
&Itemid=8> to download!

Don't forget that the early submission deadline
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=2
6:mini-symposia-a-papers&catid=4:iciam2011-calls&Itemid=5> for
mini-symposia proposals is August 18th with all remaining submissions
due by October 4. Those seeking visa requests should try to take
advantage of the early submission deadline.

Information about sponsorship and exhibit opportunities
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=9
&Itemid=7> has just been posted on the ICIAM 2011 website; we encourage
all of you to review these opportunities to learn if they are in line
with your organization's strategic goals.

For those delegates travelling from overseas, please remember that
citizens from many countries require visas to enter Canada. Please visit
Citizen & Immigration Canada (www.cic.gc.ca) for more information very
soon. Here is a link to the visa information page.
(www.cic.gc.ca/english/visit/visas.asp)

Mark your calendars! Registration for ICIAM 2011 will open in August.
Check www.iciam2011.com for the latest information. To be notified when
registration opens, please sign up for e-lerts here
<http://www.iciam2011.com/index.php?option=com_wrapper&view=wrapper&Item
id=10> if you haven't done so already.

Fast fact about Vancouver: Did you know that the iconic cauldron from
the 2010 Olympic Winter Games is located on the site of the Vancouver
Convention Centre where ICIAM 2011 will take place?

Quick links to ICIAM 2011's:

* 27 international invited speakers
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=1
2&Itemid=26>
* Over 20 thematic tracks
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=1
3&Itemid=3>
* Embedded and satellite meetings
<http://www.iciam2011.com/index.php?option=com_content&view=article&id=6
&Itemid=4>

On behalf of CAIMS, SIAM and MITACS - the organizing societies behind
ICIAM 2011 - we encourage you to join us in Vancouver for this
world-class congress. Keep visiting www.iciam2011.com as new information
about the Congress is posted constantly.

I look forward to welcoming you to Vancouver!

Arvind Gupta

President, ICIAM 2011

CEO & Scientific Director, MITACS

Sent on Arvind's behalf to SIAM members by Michelle Montgomery;
montgomery@siam.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/
*
**********************************************************

[DMANET] Buchankuendigung: Graphentheorie_4.Auflage_erscheint_im_September_eBook_bereits_jetzt

Zum Wintersemester 2010/11 wird es die 4.Auflage meines
Graphentheoriebuchs auch in deutscher Ausgabe geben. Im Druck wird sie
bei Springer Ende September erscheinen; eBook-Ausgaben (auch eine
druckbare) sowie Skriptlizenzen gibt's unter

http://diestel-graph-theory.com/german/

Gruss, RD
**********************************************************
*
* 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] Lecturer/Senior Lecturer in Mathematics position at University of New South Wales

Lecturer/Senior Lecturer (2 Positions) Faculty of Science, School of Mathematics
and Statistics, University of New South Wales, Sydney, Australia REF. 7392NET

Salary Level B Lecturer: A$80,028 - A$94,344 per year, plus 17% employer
superannuation, plus leave loading.

Salary Level C Senior Lecturer: A$97,203 - A$111,519 per year, plus 17% employer
superannuation, plus leave loading.

Applications are invited for Lecturer or Senior Lecturer positions in the
Department of Applied Mathematics within the School of Mathematics and
Statistics. To be successful in these positions, you will have a research
doctorate in a relevant mathematical science; an innovative research program;
success in conducting high quality research in Applied Mathematics; capacity to
continue productive research at the international level; evidence of effective
teaching, including service teaching; and an excellent written and oral
communication skills. A record of successful interaction or consultancies with
business or industries is highly desirable as well as success in obtaining
research grants. Preference maybe given to candidates whose expertise
compliments the research strengths of the Department. The Department has active
research groups in fluid dynamics, nonlinear phenomena, biomathematics,
computational mathematics and optimization.

The School of Mathematics and Statistics at the University of New South Wales is
the largest in Australia and a major centre of research in the mathematical
sciences. The School has notable strengths in fundamental research right
through to cutting edge applications. Its teaching and research activities are
carried out in three departments: Applied Mathematics, Pure Mathematics and
Statistics with activities ranging across multitude of areas including
applications in finance, medicine and environmental science.

The Department of Applied Mathematics has a vigorous postgraduate research
program and an outstanding record in attracting external research support. It
also operates an extensive visitors program for fostering research
collaboration. Its academic staff members provide specialist teaching in
Applied Mathematics in all undergraduate levels (including honours) and a major
part of the School's service teaching.

These are full-time continuing positions. The positions are available from
January 2011; however, an earlier start date can be negotiated.

Applicants should systematically address the selection criteria in their
application.

Enquiries may be directed to Professor Anthony Dooley, Head, School of
Mathematics and Statistics, on telephone (61 2) 9385 7114 or email:
a.dooley@unsw.edu.au; or Professor V. Jeyakumar, Head, Department of Applied
Mathematics on telephone (61 2) 9385 7046 or email v.jeyakumar@unsw.edu.au.

For information on the School: www.maths.unsw.edu.au
For information on the position and application procedures, see
http://www.hr.unsw.edu.au/services/recruitment/jobs/13081002.html


Applications close : 10 September 2010

Dear DMANET,

I would be grateful if you can please post the contents of the attached text file regarding a tenure-track optimisation position at the University of New South Wales, Sydney, Australia.

 

Best regards,

Gary Froyland.

 

[DMANET] PhD positions in Algorithmics

===================================
O P E N P H D P O S I T I O N S
===================================

The Research Group Algorithmic Bioinformatics of the Institute for
Informatics at the Ludwig-Maximilians-Universitaet Muenchen offers several
PhD positions in the area of

ALGORITHMICS and ALGORITHMIC BIOINFORMATICS

Our research focuses in design and analysis of efficient algorithms for
discrete and combinatorial problems in Bioinformatics.

Applicants for these positions need to have the equivalent of the German
University Diploma (e.g., M.Sc.) in Bioinformatics, Computer Science or
Mathematics. Candidates are expected to have in-depth knowledge in
Computer Science, in particular in algorithmics, and should have basic
knowledge in Molecular Biology. Due to teaching obligations, profound
knowledge of the German language is helpful.

One position is a fixed term positions for a period of 3 years. The
salary rate is according to the federal salary scale on the TV-L E13
level. Applications (including curriculum vitae, copies of
certificates, and a statement of research interests) could be sent to my
E-Mail address.

The other position is a PhD scholarship within the DFG-funded
International Research Training Group `Regulation and Evolution of
Cellular Systems' (RECESS), cf. www.cellular-systems.de. For
application see www.graduatecenter-lmu.de/recess/index.php.

--
Volker Heun www.bio.ifi.lmu.de/~heun/
Institut fuer Informatik Volker.Heun@bio.ifi.lmu.de
Ludwig-Maximilians-Universitaet +49-89-2180-4341 (FAX -2180-99-4341)
Amalienstr. 17, 80333 Muenchen, Germany Office: A 303 (3rd floor)
**********************************************************
*
* 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/
*
**********************************************************

DARPA RFI for Social Network Privacy

In recent years, interest in social networks has dramatically increased. Massive amounts of social network data are being collected for military, government and commercial purposes. In all three sectors, there is an ever growing need for the exchange or publication of this data for analysis and scientific research activities. However, this data is rich in private details about individuals whose privacy must be protected and great care must be taken to do so. A major technical challenge for social network data exchange and publication is the simultaneous preservation of data privacy and security on the one hand and information utility on the other. The Defense Advanced Research Projects Agency (DARPA) Information Processing Techniques Office (IPTO) is requesting information on areas of research related to the technology required to meet this challenge.

http://www.darpa.mil/ipto/solicit/baa/RFI-SN-10-60_PIP.pdf

CCR 2011

First Call for Papers and Announcement
Sixth International Conference on

  Computability, Complexity and Randomness (CCR 2011)

January 31-February 4, 2011, Cape Town, South Africa

Submission deadline: October 1, 2010 (Abstracts only!)
______________________________________________________________

co-located with the Eighth International Conference on
Computability and Complexity in Analysis (CCA 2011).

The conference CCR, also known as conference on Logic,
Computability and Randomness, will be in the tradition
of the previous meetings in Córdoba (Argentina) 2004,
Buenos Aires (Argentina) 2007, Nanjing (China) 2008,
Luminy (France) 2009 and Notre Dame (USA) 2010.

Cape Town is very beautiful at this time of year, and we
expect another equally successful conference.


Invited Speakers

       * Verónica Becher       (Buenos Aires, Argentina)
       * Willem Fouché         (Pretoria, South Africa)
       * Noam Greenberg        (Wellington, New Zealand)
       * Wolfgang Merkle       (Heidelberg, Germany)
       * André Nies            (Auckland, New Zealand)
       * Theodore A. Slaman    (Berkeley, USA)


Scientific Program Committee

       * Eric Allender         (Rutgers, USA)
       * Luis Antunes          (Porto, Portugal)
       * Laurent Bienvenu      (Paris, France)
       * Vasco Brattka, co-chair (Cape Town, South Africa)
       * Rod Downey, co-chair  (Wellington, New Zealand)
       * Denis Hirschfeldt     (Chicago, USA)
       * Bjørn Kjos-Hanssen    (Hawaii, USA)
       * Antonín Kučera        (Prague, Czech Republic)
       * Steffen Lempp         (Madison, USA)
       * Jan Reimann           (Pennsylvania, USA)


Organizing Committee

       * Margaret Archibald    (Cape Town, South Africa)
       * Vasco Brattka, chair  (Cape Town, South Africa)
       * Holger Spakowski      (Cape Town, South Africa)


Venue

The venue for CCA 2011 will be on the Upper Campus
of the University of Cape Town, South Africa. Further
information will be available on the conference web page
soon.


Submissions

Authors are invited to submit a PDF abstract (typically
1-2 pages) via the following web page:

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

No full papers will be required for this conference.


Proceedings

No proceedings will be published before the conference.
A booklet with abstracts will be made available at the
conference. It is planned to publish post-conference
proceedings in a special issue of some journal afterwards.


Funding

Funding opportunities for student members of the
Association for Symbolic Logic (ASL) are anticipated.


Dates

Submission deadline:            October 1, 2010
Notification of authors:        October 22, 2010
Early registration:             November 1, 2010
Final version of abstract:      November 22, 2010


Conference Web Page

  http://cca-net.de/ccr2011/

______________________________________________________________

AIT Budapest

Dear Students,

We're writing to let you know about a new and very exciting study abroad program for students with interests in computer science and software engineering.

The program is called AIT (Acquincum Institute of Technology). The campus is on a lovely part of the Danube River in Budapest, Hungary. The program is friendly and intimate, enrolling between 30-50 students per semester, primarily from U.S. colleges and universities and with some Hungarian students as well.

All classes are taught in English by prominent and enthusiastic Hungarian professors. Classes are small (5-15 students is typical) and cover a breadth of topics including:

* Core courses in computer science;
* Elective CS courses such as computer vision for digital film post-production (taught by faculty affiliates from Colorfront, recent winner of a Technical and Scientific Oscar Award) and computational biology;
* Courses in IT entrepreneurship; and
* Courses in design (including a studio course taught by Erno Rubik, inventor of the Rubik's cube).

The program also offers a variety of extra-curricular activities including opportunities to explore Hungary and Europe.

More information on the program is available at www.ait-budapest.com.  Applications for Spring 2011 are due on October 15. We hope that you will consider this program for this spring or some future semester.

In the meantime, if you have any questions please don't hesitate to contact us (Professor Ran Libeskind-Hadas, hadas@cs.hmc.edu,and Professor Michael Orrison, orrison@hmc.edu ) or the AIT North America office at info@ait-budapest.com .

Best regards,

Ran and Michael

Ran Libeskind-Hadas, Professor of Computer Science, Harvey Mudd College
Michael Orrison, Associate Professor of Mathematics, Harvey Mudd College

[DMANET] Workshop announcement: Analysis and Geometry of Boolean Threshold Functions

Ryan O'Donnell and Rocco Servedio would like to announce an upcoming
workshop at the Center for Computational Intractability in Princeton.

The topic is "Analysis and Geometry of Boolean Threshold Functions". It
will take place the Thursday and Friday morning before FOCS, Oct. 21--22.

For detailed information, please see:
http://intractability.princeton.edu/blog/2010/08/workshop-ltfptf/

There is also a poster here: http://www.cs.cmu.edu/~odonnell/ltf-ptf/
**********************************************************
*
* 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] Workshop on Advances in Algorithmic Game Theory, CWI Amsterdam, Sep. 2-3, 2010

(Apologies if you receive multiple copies!)

FINAL CALL FOR PARTICIPATION
==========================================================

WORKSHOP ON ADVANCES IN ALGORITHMIC GAME THEORY

Center for Mathematics and Computer Science (CWI)
Amsterdam, The Netherlands
September 2-3, 2010

Workshop website: http://www.cwi.nl/~schaefer/agt10

***** PLEASE REGISTER BEFORE AUGUST 16, 2010 *****

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

Algorithmic game theory has become a highly active research field that
contributed successfully to the understanding of many fundamental
games in recent years. The aim of the workshop is to provide an
international forum for researchers that are active in this field to
present and discuss recent results, exchange ideas and identify
potential future research directions. The workshop will also offer
young scientists the opportunity to get an overview of the state-of-
the-art of the field.

The two-day workshop will be hosted at the Center for Mathematics and
Computer Science (CWI) in Amsterdam and will take place September 2-3,
2010. There will be four keynote talks and about 16 contributed talks.
The keynote speakers are:

* Ioannis Caragiannis (University of Patras, Greece)
* Michal Feldman (Hebrew University of Jerusalem, Israel)
* Jason Hartline (Nothwestern University, USA)
* Tim Roughgarden (Stanford University, USA)

A preliminary program (including abstracts) is available on the website.

Local organizer:
Guido Schaefer
**********************************************************
*
* 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] CATS 2011 - submission deadline approaching

Reminder: CATS submission deadline is Monday August 16.

---

CATS 2011 -- Computing: The Australasian Theory Symposium
Perth, Australia, January 17-20, 2011
http://cats.it.usyd.edu.au/

The 17th Computing: The Australasian Theory Symposium (CATS) will be held in
Perth, Australia, January 17-20, 2011. CATS is an annual conference held in
the Australia-New Zealand region, dedicated to theoretical computer science.

Authors are invited to submit papers that present original and unpublished
research on topics related to theoretical aspects of computer science,
including (but not limited to): algorithms and data structures, algorithmic
game theory, combinatorial optimization, computability, computational
complexity theory, computational geometry, foundational calculi, graph
theory and combinatorics, logic and type systems, program derivation,
analysis, transformation, program verification and safety, semantics of
programming languages, theory of programming.

Deadlines and other dates:
Paper submission deadline: Monday August 16, 2010
Acceptance notification: Monday October 4, 2010
Final version of accepted papers due: Monday November 5, 2010
Early registration: Monday December 6, 2010
Conference dates: January 17-20, 2011

The proceedings of this event will be published by the Australian Computer
Society (ACS) in the CRPIT Series (http://crpit.com/), and will also appear
in the ACM digital library.

CATS 2011 is part of the Australasian Computer Science Week (ACSW), an
international annual conference event, supported by the Computing Research
and Education Association (CORE) in Australia. ACSW 2011 is hosted by Curtin
University in Perth, Australia.

For more information please visit http://cats.it.usyd.edu.au/
Contact: taso viglas and alex potanin at <cats2011@easychair.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/
*
**********************************************************

[DMANET] ALENEX 2011 - Call for Papers

CALL FOR PAPERS

*****************************************************************
*
* Workshop on Algorithm Engineering and Experiments
* (ALENEX 2011)
*
* San Francisco, California USA
* January 22, 2011
*
* http://www.siam.org/meetings/alenex11/
*
*****************************************************************

*Description*

The Workshop on Algorithm Engineering and Experiments (ALENEX11) will
be held on January 22, 2011 at the Holiday Inn San Francisco Golden
Gateway, San Francisco, California, USA.

The aim of the ALENEX workshop is to provide a forum for presentation
of original research in the implementation and experimental evaluation of
algorithms and data structures. We invite submissions that present
significant case studies in experimental analysis (such studies may
tighten, extend, or otherwise improve current theoretical results) or
in the implementation, testing, and evaluation of algorithms for realistic
environments and scenarios, including specific applied areas (for
example, databases, networks, operations research, computational biology
and physics, computational geometry, and the world wide web) that present
unique challenges in their underlying algorithmic problems. We
also invite submissions that address methodological issues and standards
in the context of empirical research on algorithms and data structures.
The scientific program will include time for discussion and debate of
topics in this rapidly evolving research area.
This workshop precedes the ACM-SIAM Symposium on Discrete Algorithms

(SODA11) <http://www.siam.org/meetings/da11/>
being held January 23-25, 2011.
The workshop will take place on the same day as the Analytic
Algorithmics and Combinatorics (ANALCO11)
<http://www.siam.org/meetings/analco11/>.
Since researchers in both
fields are approaching the problem of learning detailed information
about the performance of particular algorithms, we expect that
interesting synergies will develop.

Registrants from either workshop will be cross-registered with the
other. Proceedings of ALENEX and ANALCO will be published openly and
electronically in January 2011. A special issue of the ACM Journal of
Experimental Algorithmics will be dedicated to selected papers from
ALENEX10.

A paper that has been reviewed and accepted for presentation at SODA
is not eligible for submission to ALENEX. We recognize, however, that some
research projects spawn multiple papers that elaborate on different
aspects of the work, and are willing to respond to inquiries about SODA,
ALENEX, and ANALCO papers that may overlap. Papers of interest to both
the ALENEX and the ANALCO communities are particularly encouraged. Such
papers may be submitted to either workshop and will, as appropriate,
be presented in a joint session. Inquiries regarding ALENEX may be sent
to workshop organizers Matthias Mueller-Hannemann
(muellerh<at>informatik.uni-halle.de) or Renato Werneck
(renatow<at>microsoft.com).

The ALENEX workshop is supported by SIAM (Society for Industrial and
Applied Mathematics) and SIGACT (ACM Special Interest Group on
Algorithms and Computation Theory).

*Important Deadlines*

*SUBMISSION DEADLINE*
Tuesday, October 5, 2010

*PRE-REGISTRATION DEADLINE*
December 20, 2010

*HOTEL RESERVATION DEADLINE*
December 20, 2010

*Workshop Co-chairs*

Matthias Mueller-Hannemann, Martin-Luther-Universitaet Halle-Wittenberg, Germany
Renato Werneck, Microsoft Research Silicon Valley, USA

*Program Committee*

Glencora Borradaile, Oregon State University, USA
Rezaul Chowdhury, University of Texas at Austin, USA
Camil Demetrescu, University of Rome ''La Sapienza'', Italy
Marco E. Luebbecke, Technische Universitaet Darmstadt, Germany
Rolf H. Moehring, Technische Universitaet Berlin, Germany
Bernard Moret, Ecole Polytechnique Federale de Lausanne, Switzerland
David Mount, University of Maryland, USA
Kunihiko Sadakane, National Institute of Informatics, Japan
Roberto Tamassia, Brown University, USA
Laura Toma, Bowdoin College, USA
Anthony Wirth, University of Melbourne, Australia
Ke Yi, Hong Kong University of Science and Technology, Hong Kong
Christos Zaroliagis, University of Patras, Greece
**********************************************************
*
* 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 Hamburg

A PhD position as a

Teaching Assistant (Wissenschaftliche/r Mitarbeiter/in, 50% TV-L 13)

is available in the Discrete Mathematics group at Universitaet Hamburg,
Germany. We are looking for a PhD student who is interested in
probabilistic combinatorics and extremal graph theory.

Candidates must hold a Diploma, Master's, or equivalent degree in
mathematics or computer science and have very good knowledge in discrete
mathematics. In addition to research, the position includes a very
limited amount of teaching and for that knowledge of the German language
is required.

The position is offered for 3 years.
The preferred starting date is October 16th, 2010.

Payment will be according to the regulations for scientific employees at
Universitaet Hamburg (0.5 TV-L13).

Please address your application (including a cover and motivation
letter, a cv, copies of diplomas) until September 1st, 2010 to:

Universitaët Hamburg
Fachbereich Mathematik
Verwaltung
Bundesstraße 55
20146 Hamburg

For further information, please contact:

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

[DMANET] CP 2010: Call for Participation

---

CALL FOR PARTICIPATION

CP 2010

16th International Conference on Principles and Practice of Constraint Programming
St Andrews, Scotland, UK
6-10 September 2010
http://cp2010.cs.st-andrews.ac.uk

*** NOTE: Early Registration is due to end on the 19th of August ***

The International Conference on Principles and Practice of Constraint
Programming is the annual conference on all aspects of computing with
constraints, including: theory, algorithms, applications, environments,
languages, models and systems.

Invited Speakers:

- Robert Nieuwenhuis, University of Catalonia
"SAT Modulo Theories: getting the best of SAT and global constraint filtering"
- Edward Tsang, University of Essex
"Constraint-directed Search in Computational Finance and Economics"
- Moshe Y. Vardi, Rice University
"Constraints, Graphs, Algebra, Logic, and Complexity"

The preliminary program and the list of accepted papers can be found at:
http://cp2010.cs.st-andrews.ac.uk/program.php

List of Tutorials:

- From SAT to Parallel SAT Solving
Youssef Hamadi, Microsoft Research
- Distributed Search by Constrained Agents
Prof. Amnon Meisels, Ben-Gurion University and Dr. Roie Zivan, Carnegie Mellon University
- Valued Constraint Satisfaction Problems
Martin Cooper, Simon de Givry, and Peter Jeavons
- Backdoors to Satisfaction
Barry O'Sullivan

List of Workshops:

- 9th Workshop on Constraint Modelling and Reformulation
http://www.it.uu.se/research/group/astra/ModRef10
- 10th Workshop on Symmetry in Constraint Satisfaction Problems
http://www.it.uu.se/research/group/astra/SymCon10/
- 7th Workshop on Local Search Techniques in Constraint Satisfaction
http://becool.info.ucl.ac.be/lscs2010/
- 3rd Workshop on Quantification in Constraint Programming
http://qicp2010.greyc.fr/
- 10th Workshop on Preferences and Soft Constraints
http://logos.ucd.ie/events/soft10/
- 3rd Workshop on Techniques for Implementing Constraint Programming Systems
http://people.cs.kuleuven.be/~guido.tack/2010TRICS/
- 1st Workshop on Constraint Reasoning and Graphical Structures
http://www.4c.ucc.ie/cp-graphical-ws-2010/
- 3rd Workshop on Constraint Reasoning and Optimization for Computational Sustainability
http://www.computational-sustainability.org/crocs-at-cp10

Registration and Accommodation can now be booked through:
https://onlineshop.st-andrews.ac.uk/browse/extra_info.asp?compid=1&modid=2&prodid=154&deptid=29&catid=34
**********************************************************
*
* 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] DIALM-POMC 2010 Early Registration and Call for Participation

Early registration deadline is on Aug 14. Please register online at
http://www.regonline.com/register/checkin.aspx?EventId=875765 .
Please see updated information on registration and notification of
acceptance, as well as invited speakers below.

Hope to see you in Cambridge!

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

DIALM-POMC 2010 Call for Participation

The Sixth ACM SIGACT-SIGMOBILE International Workshop on
FOUNDATIONS OF MOBILE COMPUTING

Cambridge, Massachusetts, USA
September 16, 2010
http://dialm-pomc2010.engineering.asu.edu/

[Co-located with DISC 2010]

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

SCOPE:
Mobile computing and communications devices will have an enormous
impact on our lifestyle over the next several decades as the true
integration of personal computing, distributed computing, cellular
technologies and the Web becomes the reality. In the light of
continuously increasing interaction between communication and
computing, there arise a number of interesting, and difficult
algorithmic issues in diverse areas including coverage, mobility,
routing, cooperation, capacity planning, scheduling, and power control.

This workshop is devoted to cover contributions in both the design and
analysis of discrete and distributed algorithms and the system modeling
in the context of mobile, wireless, ad-hoc, and sensor networks.
In particular, it aims at bringing together the practitioners and
theoreticians of the field and is intended to foster cooperation among
researchers in mobile computing and researchers in discrete and
distributed algorithms. DIALM-POMC 2010 will be held in September
in Cambridge, MA, USA, and will be co-located with the 24th Symposium
on Distributed Computing (DISC 2010). Previous DIALM-POMC workshops had
been co-located with the International Conference on Mobile Computing
and Networking (MOBICOM) and the International Conference on Principles
of Distributed Computing (PODC).

The workshop covers all areas related to mobile and wireless computing
and communications where discrete algorithms and methods are utilized.
Specific topics include, but are not limited to:

- Channel assignment and management
- Energy saving methods and protocols
- Routing, multicast and broadcast
- Gossiping, information diffusion
- Scheduling
- Synchronization and discovery
- Emerging networks, including cognitive, delay-tolerant, ad hoc
and sensor networks
- Localization and location tracking, handover/handoff
- Network protocols: design, optimization, and analysis
- Local algorithms, algorithms with incomplete knowledge
- Distributed optimization algorithms
- Dynamic networks, dynamic graph algorithms
- Selfish behavior, incentives, and cooperation
- Modeling
- MAC layer protocols
- Network capacity
- Autonomous agents, mobile robot networks
- Location- and context-aware distributed systems
- Cryptography and security

======================================================================
INVITED SPEAKERS:

Rajmohan Rajaraman (Northeastern University)

Aravind Srinivasan (Uniersity of Maryland)

=======================================================================
IMPORTANT INFORMATION:

** Acceptance notification: August 12, 2010 **

** Early registration deadline: August 14, 2010 **

Please register at
http://www.regonline.com/register/checkin.aspx?EventId=875765

Workshop date: September 16, 2010

=======================================================================
CONFERENCE ORGANIZATION:

Program Committee Co-Chairs:
Thomas Moscibroda (Microsoft Research)
Andrea Richa (Arizona State University)

Program Committee
Ittai Abraham (Microsoft Research)
Matthew Andrews (Bell Labs)
Augustin Chaintreau (Thompson Research)
Alon Efrat (University of Arizona)
Sandor Fekete (TU Braunschweig)
Seth Gilbert (EPFL)
David Ilcinkas (Universite Bordeaux)
Anne-Marie Kermarrec (INRIA)
Goran Konjevod (Arizona State University)
Dariusz Kowalski (University of Liverpool)
Fabian Kuhn (University of Lugano)
Dave Levin (University of Maryland)
Christian Scheideler (Paderborn University)
Stefan Schmid (T-Labs, Berlin)
Michael Segal (Ben Gurion University)
Anil Vullikanti (Virginia Tech)
Jennifer Welch (Texas A&M)
Guoliang Xue (Arizona State University)

Publicity Chair
Jin Zhang (Arizona State University)

Steering Committee
Maurizio Bonuccelli (University of Pisa)
Errol L. Lloyd (University of Delaware)
Nancy Lynch (MIT)
Andre Schiper (EPFL)
Arunabha Sen (Arizona State University)
Nitin Vaidya (UIUC)

=======================================================================
**********************************************************
*
* 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] Journal of Computational Geometry (JoCG)

Journal of Computational Geometry (JoCG)

The first five articles have been published in JoCG and are freely
available on jocg.org. On the journals webpage there is now the option
to subscribe to the current issue using RSS/Atom feeds.

Managing Editors
Pat Morin and Joachim Gudmundsson
**********************************************************
*
* 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/
*
**********************************************************

New Program at NSF

CISE has announced a new funding opportunity administered jointly with

the Directorate for Social, Behavioral and Economic Sciences (SBE).  The
new program is called ICES (Interface between Computer Science and
Economics and Social Sciences).  You'll find the all the details about
ICES here: http://www.nsf.gov/funding/pgm_summ.jsp?pims_id=503549.  Be
sure to read the whole solicitation and click through to the
non-exhaustive list of example topics as well.  ICES seeks to fund
interdisciplinary work at one particular boundary between computer
science and economics & social sciences.  As always with anything new at
NSF, there will be lots of questions.   Email CISE/CCF Program Director
Tracy Kimbrel (tkimbrel@nsf.gov), SBE/SES Program Director Nancy Lutz
(nlutz@nsf.gov), CISE/IIS Program Director Sven Koenig
(skoenig@nsf.gov), or CISE/CNS Program Director Darleen Fisher
(dlfisher@nsf.gov) and we will do our best to answer the questions.  If
you're wondering "Is my project suitable for ICES?" be sure to include a
one or two page description with your email because that will help us
with the answer. The deadline for submitting proposals to ICES is
October 5, 2010.

[DMANET] PCCR 2010 -- Final Call for Participation

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

CALL FOR PARTICIPATION

PCCR 2010

Parameterized Complexity of Computational Reasoning

Satellite Workshop of MFCS & CSL
Brno, Czech Republic, 28 August 2010

http://www.kr.tuwien.ac.at/drm/pccr2010

This workshop aims to support a fruitful exchange of ideas between the
research on parameterized complexity on one side and the research on various
forms of computational reasoning (such as nonmonotonic, probabilistic, and
constraint-based reasoning) on the other. The workshop features invited
and contributed talks and presentations of surveys and new technical results.

Invited speakers are:

* Mike Fellows, Charles Darwin University
* Nicola Galesi, Sapienza University of Rome
* Gregory Gutin, University of London
* Petr Hlineny, Masaryk University Brno
* Reinhard Pichler, Vienna University of Technology

List of Presentations:

* Mike Fellows: An Overview of Parameterized Complexity and Recent Research
Directions in Constraint Satisfaction and Artificial Intelligence
* Gregory Gutin, Keynote Talk: Complexity of Permutation Constraint Satisfaction
Problems Parameterized Above Average
* Petr Hlineny: Where Myhill-Nerode Theorem meets Parameterized Algorithmics
* Reinhard Pichler: Bounded Treewidth in Non-Monotonic Reasoning
* M. Praveen: Does Treewidth Help in Modal Satisfiability?
* Fran Rosamond: On the Complexity of Some Constraint Satisfaction Problems with
Global Constraints and Convexity
* Nicola Galesi: The Complexity of Proofs in Parameterized Resolution
* Yijia Chen: Optimal Proof Systems, Slicewise Monotone Parameterized Problems,
and Logics for PTIME

For the schedule of the talks, see http://www.kr.tuwien.ac.at/drm/pccr2010/

For information on how to register and local information please consult the
MFCS-CSL 2010 web-site http://mfcsl2010.fi.muni.cz/

The workshop is organized by Igor Razgon, Marko Samer, Stefan Szeider (chair),
and Stefan Woltran.

==============================================================================
**********************************************************
*
* 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] Open PhD / postdoc position at TU Berlin

Open research position at TU Berlin

The Combinatorial Optimization and Graph Algorithms Group at TU Berlin
(http://www.math.tu-berlin.de/coga/) invites applications for a research
position in the project "Scalable methods for the optimization of survivable
IP networks" within the BMBF joint research project "ROBUKOM - Robust
communication networks".

The position is a fixed-term full-time research position to be filled from
October 1, 2010 until March 31, 2013. Payment will be according to the
regulations for research employees at the TU Berlin (currently BAT IIa).

We are looking for a PhD student or postdoc who is or wishes to specialize
in discrete optimization. The successful candidate will participate in the
development and the implementation of mathematical models and algorithms to
solve large-scale optimization problems arising in the planning of
telecommunication networks. He or she will collaborate with 15+ researchers
in our group, interested in areas such as computational integer programming,
network flows, scheduling, online and robust optimization, graph theory, and
their application in practice.

Candidates must hold a Diploma, Master's, or equivalent degree in
mathematics or computer science and have very good knowledge in discrete
optimization, in particular in integer programming, combinatorial
optimization, and graph algorithms. The possibility to work towards a
doctoral degree will be given. Good command of C++ or an equivalent
programming language is required. Knowledge in telecommunication network
modeling and optimization would be appreciated.

Please address your application (including a cover and motivation letter, a
cv, copies of diplomas etc., addresses of references, and further
appropriate documentation) with the job reference number FO-315 to

President of TU Berlin
Inst. of Mathematics
Prof. Dr. Bley, Sekr. MA 5-2
Strasse des 17. Juni 136
10623 Berlin
Germany

and send it, preferably by email as a single pdf file, to Andreas Bley (see
below).

The closing date for applications is September 2, 2010.

For further information, please contact

Andreas Bley
Fak. II, Institute of Mathematics, Sekr. MA 5-2
Technische Universitaet Berlin
Strasse des 17. Juni 136
10623 Berlin, Germany
Email: bley@math.tu-berlin.de

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

[DMANET] [GD2010] Call for Participation, Posters, PhD Expositions

=======================================================================
early registration deadline: August 22, 2010
=======================================================================

18th International Symposium
G R A P H D R A W I N G
(GD 2010)

21-24 September, 2010
University of Konstanz, Germany (on campus)

http://www.graphdrawing.org/gd2010/

=======================================================================
deadlines: posters Aug 16, PhD presentations Aug 23, contest Sep 17
=======================================================================

Graph Drawing is concerned with the geometric representation of graphs
and networks and is motivated by those applications where it is crucial
to visualize structural information as graphs.

Since graph drawing methods form the algorithmic core of network
visualization, bridging the gap between theoretical advances and
implemented solutions is an important aspect of the conference.

Indeed, advances in graph drawing are important in several technological
areas such as Web computing, e-commerce, VLSI circuit design,
information systems, software engineering, computational cartography,
visual interfaces, bioinformatics, and networking.

Researchers and practitioners working on any aspect of graph drawing
are invited to contribute and participate.

The range of topics includes, but is not limited to:

* visualization of networks from application areas such as the
life sciences, social sciences, geography, engineering,
business intelligence, or communications
* software systems for graph visualization
* interfaces for interacting with graphs
* graph drawing algorithms
* geometric graphs
* planarity and topological graph theory
* graph theory and optimization on graphs

Invited Speakers:
-----------------
Peter Eades, University of Sydney, Australia
Carsten Thomassen, Technical University of Denmark, Lyngby, Denmark

Accepted Papers:
----------------
A list of accepted papers and the preliminary program can be found on
the conference Web site at http://www.graphdrawing.org/gd2010/

Call for Participation:
-----------------------
GD will take place on the campus of the University of Konstanz, overseeing
beautiful Lake Constance. In addition to the main conference, a satellite
event will be held on Tuesday, September 21. This is

Call for Posters:
-----------------
Submissions of posters on graph drawing and related areas are also
solicited. The poster session will provide a forum for the communication
of late-breaking research results (which may also appear elsewhere) to
the graph drawing community. Posters should be accompanied by an abstract
(up to 2 pages); abstracts of accepted posters will be included in the
conference proceedings.

Call for PhD Colloquium submissions:
------------------------------------
PhD students will have an opportunity to present and exhibit their ongoing
or planned work in a dedicated workshop prior to the main conference.
We solicit submissions consisting of a poster and a status summary of
two pages. See http://www.graphdrawing.org/gd2010/progd.html for details.

Call for GD Contest submissions:
--------------------------------
Following the tradition of previous conferences, a graph drawing contest
will be held. See http://www.graphdrawing.de/contest2010/ for details.

Important Dates
---------------
Poster submission: August 16
Early registration deadline: August 22
PhD Colloquium submission: August 23
Contest submission: September 17
Symposium: September 21-24, 2010

Committees:
-----------
Contest Christian Duncan (Louisiana Tech)
Carsten Gutwenger (TU Dortmund)
Lev Nachmanson (Microsoft)
Georg Sander (IBM, chair)

Organization Melanie Badent
Ulrik Brandes (co-chair)
Sabine Cornelsen (co-chair)
Martin Mader
Barbara Pampel

Contact: gd2010@graphdrawing.org

=======================================================================
GD 2010 is supported by the University of Konstanz, DFG, and

Gold Sponsors: Tom Sawyer Software, yWorks
Silver Sponsor: IBM, Microsoft Research
Contributors: EADS, Siemens
=======================================================================

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