Sunday, October 31, 2010

LAST CALL FOR PAPERS, CCA 2010 Post Conference Special Issue

                      

                             LAST CALL FOR PAPERS

                    CCA 2010 Post Conference Special Issue

 

The Seventh International Conference on Computability and Complexity in Analysis (CCA 2010) took place from June 21 to June 25, 2010, in Zhenjiang, China. There will be a special issue dedicated to CCA 2010 in the open access journal

 

    Logical Methods in Computer Science

 

         http://www.lmcs-online.org/

 

We invite submissions to this special issue of original research papers in all CCA related areas. Papers not presented at CCA 2010 may also be submitted. All submitted papers will be subject to the usual refereeing process of the journal. Submitted papers must not be previously published nor submitted for publication elsewhere and must deviate significantly from the CCA 2010 conference proceedings in PETCS.

 

The authors should follow the instructions for the authors on the LMCS web page

 

   http://www.lmcs-online.org/ojs/information.php

 

with the following special author instructions:

 

1. Register as an author on the web page lmcs-online.org and use the special issue code:

 

             -C-C-A-1-0-

 

(In case you are already registered, go to "profile" and enter the above special code under "register for special issue".)

 

2. Go through the submission routine on the webpage.

In Step 0 choose the name of the meeting for which this special issue is being organized.

 

 

The authors should prepare their manuscripts using the style file requested by the journal upon submission. Please see the LMCS web page 

 

  http://www.lmcs-online.org/Information/style.php

 

for instructions on style for authors.

 

 

Deadline for submission: November 29, 2010

Notification: March1, 2011

Final Version: April 1, 2011

 

Martin Escardo

Klaus Weihrauch

Xizhong Zheng

Ning Zhong

 

(Editors of Special Issue)

 

 

Friday, October 29, 2010

Ph D position at Univ. of Wisconsin-Milwaukee

1-2 Research assistantships are available for PhD Students in the area of
algorithms and computational geometry in the department of Computer Science
at the University of Wisconsin-Milwaukee. These appointments are for a duration
of one year, extendible after the first year. These assistantships are to work
towards PhD degrees under the supervision of Prof. Adrian Dumitrescu.

Position start: Spring 2011 or Fall 2011

Job description: The research is focused on the theory of algorithms,
particularly in the area of computational geometry.

Qualifications:
The applicant should have a Masters degree in computer science, mathematics
or related field, and have a solid background in the areas of algorithms,
geometry, and discrete mathematics.

The position is subject to the candidate being accepted
in the PhD program in Computer Science at the
University of Wisconsin-Milwaukee.
Students must apply to the PhD program and comply with the graduate
school application requirements provided at
http://www.cs.uwm.edu/html/csAcadPhD.html.
For more information visit http://www.cs.uwm.edu/

Further information can be obtained on the Web at
http://www.cs.uwm.edu/faculty/ad/
or by contacting Prof. Adrian Dumitrescu.

+-++--+-++--+-++--+-++--+-++--+-++--+-++--+-++--+-++--+-++--

Thursday, October 28, 2010

[DMANET] Call for Papers: Special Issue of the Journal of Discrete Algorithms

Call for Papers: Special Issue of the Journal of Discrete Algorithms

We invite submissions to a special issue of the Journal of Discrete
Algorithms dedicated to the fourth Algorithms and Complexity in Durham
workshop which took place 20 -- 22 September 2010.

http://www.dur.ac.uk/acid.2010/

The call is not limited to the participants of the meeting and we invite
papers related to the themes of the event. Topics of interest include,
but are not limited to:

-Algorithm Design and Analysis
-Computational Complexity
-Randomized Algorithms
-Algorithmic Graph Theory
-Combinatorial Algorithms
-Approximation Algorithms
-Applications of Algorithms
-Constraint Satisfaction
-Exact and Parameterized Computation
-Proof Complexity
-Databases and Information Retrieval
-Quantum Computing
-Discrete Optimization

The deadline for submissions is 1 December 2010.

Please submit using the journal's online system:

http://ees.elsevier.com/jda/default.asp

When choosing "Article Type", highlight "ACiD 2010 Special Issue".
Papers will be refereed according to the usual procedures of JDA with
the workshop organizers as guest editors.

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

Wednesday, October 27, 2010

[DMANET] 24th Cumberland Conference, May 12-14, 2011

This announcement is beling sent to multiple mailing lists; apologies
to those who receive duplicate copies of it.

The 24th Cumberland Conference on Combinatorics, Graph Theory, and
Computing will be held at the University of Louisville from Thursday,
May 12 through Saturday, May 14, 2011.

This annual conference has brought together combinatorial
mathematicians and computer scientists from the southeastern and
midwestern United States since 1988. The conference features four
hour-long plenary addresses by invited speakers and 60 twenty-minute
contributed talks. Plenary addresses this year will be presented by:

* Maria Axenovich (Iowa State University)
* Jeno Lehel (University of Memphis)
* Dhruv Mubayi (University of Illinois at Chicago)
* William T. Trotter (Georgia Institute of Technology)

Information about the conference schedule and local area can be found
at the website:
< http://www.math.louisville.edu/Cumberland/ >

Registration and abstract submission are available via the
website. The deadline for abstract submission is Friday, April 8,
2011, or when all speaking slots are filled.

This message is being sent on behalf of the organizing committee for
the 24th Cumberland Conference: Csaba Biro, Adam Jobson, Andre Kezdy,
Ewa Kubicka, Grzegorz Kubicki, Susan White, and Jake Wildstrom.
**********************************************************
*
* 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/
*
**********************************************************

CFP: NETWORKS Special Issue: Algorithmic Approaches for Transportation Modelling, Optimization, and Systems

CALL FOR PAPERS: NETWORKS SPECIAL ISSUE

ALGORITHMIC APPROACHES FOR TRANSPORTATION MODELLING, OPTIMIZATION, AND SYSTEMS


Following up on the ATMOS 2010 workshop (U Liverpool, UK, September 9,
2010, http://algo2010.csc.liv.ac.uk/atmos/), we invite submissions to a
special issue of the Wiley journal "NETWORKS" dedicated to the topics of
the workshop. Submission is *not* restricted to workshop participants, and
we encourage authors to submit relevant contributions of highest quality
from all fields, including computer science (in particular algorithms),
mathematics, and operations research.


BACKGROUND INFORMATION on the ATMOS workshop and the scope of the
special issue:

Since 2000, the series of ATMOS workshops brings together researchers
and practitioners who are interested in all aspects of algorithmic
methods and models for transportation optimization and provides a
forum for the exchange and dissemination of new ideas and techniques.

Transportation networks give rise to very complex and large-scale
network optimization problems requiring innovative solution techniques
and ideas from mathematical optimization, theoretical computer
science, and operations research. Applicable tools and concepts
include those from graph and network algorithms, combinatorial
optimization, approximation and online algorithms, stochastic and
robust optimization. The scope of the workshop comprises all modes
of transportation.

For the special issue we invite submissions on optimization problems
for passenger and freight transport, including---but not limited to:

* Infrastructure Planning
* Vehicle Scheduling
* Crew and Duty Scheduling
* Rostering
* Routing in Road Networks
* Novel Applications of Route Planning Techniques
* Demand Forecasting
* Design of Tariff Systems
* Delay Management
* Mobile Applications
* Humanitarian Logistics
* Simulation Tools
* Line Planning
* Timetable Generation
* Routing and Platform Assignment

Of particular interest are: the successful integration of several
(sub)problems or planning stages, algorithms operating in an
online/realtime or stochastic setting, and heuristic approaches
(including approximation algorithms) for real-world instances.


SUBMISSIONS

Authors are invited to submit a full paper with original, high quality
results relevant to this call. Papers must be submitted electronically
at

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

by December 31, 2010. Each paper will be peer-reviewed according to
the high standards of the journal.


The special issue is guest-edited by:

Thomas Erlebach, University of Leicester
Marco Luebbecke, RWTH Aachen University

Colt 2011 Call for Papers

The 24rd Annual Conference on Learning Theory (COLT 2011) will take
place in Budapest, Hungary, on July 9-11, 2011. It will be co-located
with the Foundations of Computational Mathematics conference (FOCM
2011, Budapest, July 4th - 14th, 2011).

We invite submissions of papers addressing theoretical aspects of
machine learning and empirical inference. We strongly support a broad
definition of learning theory, including:
* Analysis of learning algorithms and their generalization ability
* Computational complexity of learning
* Bayesian analysis
* Statistical mechanics of learning systems
* Optimization procedures for learning
* Kernel methods
* Boolean function learning
* Unsupervised and semi-supervised learning and clustering
* On-line learning and relative loss bounds
* Planning and control, including reinforcement learning
* Learning in social, economic, and game-theoretic settings
* Analysis of learning in related fields: natural language processing,
neuroscience, bioinformatics, privacy and security, machine vision,
data mining, information retrieval

We are also interested in papers that include viewpoints that are new
to the COLT community. We welcome experimental and algorithmic papers
provided they are relevant to the focus of the conference by
elucidating theoretical results. Also, while the primary focus of the
conference is theoretical, papers can be strengthened by the inclusion
of relevant experimental results.

Papers that have previously appeared in journals or at other
conferences, or that are being submitted to other conferences, are not
appropriate for COLT. Papers that include work that has already been
submitted for journal publication may be submitted to COLT, as long as
the papers have not been accepted for publication by the COLT
submission deadline (conditionally or otherwise) and that the paper is
not expected to be published before the COLT conference (June 2010).

Papers will be published electronically without printed proceedings.


Paper awards:
COLT will award both the best paper and best student paper. Best
student papers must be authored or coauthored by a student. Authors
must indicate at submission time if they wish their paper to be
eligible for a student award. This does not preclude the paper to be
eligible for the best paper award.

Open Problems Session:
We also invite submission of open problems (see separate call). These
should be constrained to two pages. There is a shorter reviewing
period for the open problems. Accepted contributions will be allocated
short presentation slots in a special open problems session and will
be allowed two pages each in the proceedings.

Submission Instructions:
Formatting and submission instructions will be available at the
conference website.

Important Dates:
Paper submission deadline: February 11, 2011
Author notification: May 2, 2011
Conference: Jul 9 - 11, 2011

Program Chairs:
Sham Kakade and Ulrike von Luxburg

Tuesday, October 26, 2010

[DMANET] MAPSP 2011 Call for Papers

===================
Call for Papers
===================

MAPSP 2011

Tenth Workshop on Models and Algorithms for Planning
and Scheduling Problems

June 19-24, 2011
Nymburk, Czech Republic

http://www.mapsp.org/
mapsp@kam.mff.cuni.cz

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

MAPSP is a biennial workshop dedicated to all theoretical and practical
aspects of scheduling, planning, and timetabling. Previous MAPSP meetings
have been held in Menaggio, Italy (1993), Wernigerode, Germany (1995),
Cambridge, UK (1997), Renesse, Netherlands (1999), Aussois, France (2001),
Aussois, France (2003), Siena, Italy (2005), Istanbul, Turkey (2007), and
Kerkrade, Netherlands (2009).

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

Submissions:

MAPSP submissions undergo a selection process based on a light refereeing
by the PC. MAPSP does not publish proceedings other than a conference
booklet. Hence, presenting your paper at MAPSP will not prevent you from
submitting it to journals or to other conferences. Similarly, it is
acceptable to submit a paper that was presented at an earlier conference.

Abstracts of 2-3 pages must be submitted according to the guidelines at
http://www.mapsp.org/. Most talks will have 20 minutes. Some submissions
will be selected for 30 minute plenary talks.

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

Important dates:

Submissions January 31, 2011
Notification March 7, 2011
Early registration March 21, 2011
Conference June 19-24, 2011

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

Invited speakers:

Bert Zwart (CWI, Amsterdam)
David Shmoys (Cornell University, Ithaca, NY)
Ralf Borndoerfer (Zuse Institute, Berlin)
Roman Bartak (Charles University, Prague)
Yossi Azar (Tel-Aviv University)

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

The program committee:

Nikhil Bansal (IBM Watson Research Center, Yorktown Heights)
Sanjoy Baruah (University of North Carolina, Chapel Hill)
Christoph Duerr (Ecole Polytechnique, Palaiseau)
Leah Epstein (University of Haifa, Haifa)
Monaldo Mastrolilli (IDSIA, Manno)
Rolf Moehring (Technische Universitaet Berlin, Berlin, chair)
Chris Potts (University of Southampton, Southampton)
Andreas Schulz (Massachusetts Institute of Technology, Cambridge, MA)
Jiri Sgall (Charles University, Prague, cochair)
Frits Spieksma (KU Leuven, Leuven)
Maxim Sviridenko (IBM Watson Research Center, Yorktown Heights)
Steef van de Velde (Erasmus University, Rotterdam)
Gerhard Woeginger (Technische Universiteit Eindhoven)
Guochuan Zhang (Zhejiang University, Hangzhou)

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

Organization:

Anna Kotesovcova, CONFORG s.r.o., conforg@conforg.cz

Jiri Sgall (Organizing Committee Chair), Charles University, Prague

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

Detailed workshop information is available at
http://www.mapsp.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/
*
**********************************************************

Professorship in Informatics, University of the Faroe Islands

Dear Professor Bein,

We'd be grateful if you could post the following position announcement on
the THEORYNT list, or advise why it cannot.

The University of the Faroe Islands, Faculty of Science and Technology,
invites professorship applications in Information and Communication
Technology (ICT) in the areas of Software Engineering, Computer Science,
Computer Engineering, or System Development. The level of appointment
will be as full, associate, or assistant professor, depending on the
qualifications of the successful applicant.

Application deadline is December 1, 2010, position is available from
January 1, 2011 (see the details in the attached .pdf file)

The announcement is intentionally made general to keep it open for
applicants at all levels in a broad range of CS disciplines.

A non-exhaustive list of relevant research interests includes: high
performance computing, algorithms and data structures, databases,
security, cryptography, game theory, mathematical and combinatorial
optimization, operations research, bioinformatics, scientific
computing (e.g., for oceanography, geophysics, ecology, climate, oil
exploration, fishery, etc.), systems programming and operating systems
(especially open source), programming theory, computer-aided
verification...

For any questions please contact:

Hans Pauli Joensen, Faculty Dean, hanspj AT setur DOT fo
Hannes Gislason, professor, hannesg AT setur DOT fo
Sergei Vorobyov, professor, svorobyov AT gmail DOT com
sergeiv AT setur DOT fo

Sincerely,
Sergei Vorobyov (on behalf of the faculty)

[DMANET] IEEE WoWMoM 2011: Call For Papers

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

CALL FOR PAPERS

WoWMoM 2011
Twelfth International Symposium on a
World of Wireless, Mobile and Multimedia Networks

http://wowmom2011.imtlucca.it/

sponsored by
IEEE Computer Society,
University of Texas at Arlington,
IEEE CS TC on Computer Communications (TCCC)

June 20-24, 2011
Lucca, Tuscany, Italy

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

**** SUBMISSION DEADLINE: NOVEMBER 21, 2010 *******

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

IEEE WoWMoM 2011 is soliciting original and previously unpublished papers
addressing research challenges and advances towards a world of wireless,
mobile, and multimedia pervasive communications.
The evolution of wireless networking technologies and their key role in
Future Internet scenarios offer an increasing wealth of opportunities
for distributing multimedia contents over wireless networks, enabling
dissemination of professional contents to mobile users as well as
sharing user-generated contents between them. Users will be able to
retrieve, publish, and manage information, communicate with other users
or devices, access and author services, create and exploit context-
awareness and so on. Papers that present original work, validated by
experimentation, simulation, or analysis, are solicited. Practical
experiences and experimental efforts from both industry and academy,
duly documenting the lessons learned from test-beds, field-trials, or
real deployments, are also welcome.

Topics of interest include, but are not limited to:
- Wireless multimedia systems,services&applications
- System prototypes, measurements, real deployment, and experiences
- Opportunistic and delay-tolerant networks
- Mobile Social Networking
- Participatory and urban sensing
- Energy-efficient protocols and power management
- Seamless inter-networking and self-organization
- Networking services for pervasive systems
- Content-centric architectures, multimedia content management and
distribution for mobile networks
- Ad-hoc, Sensor and wireless mesh networks
- Wireless BAN, PAN, LAN, MAN and WAN
- Vehicular wireless networks
- Middleware services for wireless, mobile and multimedia networks
- Context-awareness in wireless, mobile and multimedia networks
- Quality of Service and Quality of Experience
- Location mechanism and services
- Multicasting and broadcasting issues
- Handoff and mobility management
- Network management and control
- IP-based mobile networks and wireless multimedia services
- Wireless security, dependability, reliability and survivability
- Authentication, authorization, and accounting
- Modeling and performance evaluation


AWARDS AND EDITORIAL FOLLOW-UPS
------------------------------------------------------------------------
Papers presented at the Symposium will be considered for a Best Paper
Award. Papers of particular merit will be considered for a fast track
publication in the Elsevier Pervasive and Mobile Computing Journal
(PMC).


PAPER SUBMISSION AND PUBLICATION
------------------------------------------------------------------------
All submissions must describe original research, not published or
currently under review for another workshop, conference, or journal.
Papers must be submitted electronically through EDAS.
You can find detailed submission instructions at
http://wowmom2011.imtlucca.it/submission.html

*******************
Submission implies the willingness of at least one author to attend
the conference and present the paper. Accepted papers will be included
in the proceedings of IEEE WoWMoM 2011 and published in the
IEEE Digital Library.
WoWMoM organizers reserve the right to exclude a paper from distribution
after the conference (e.g., removal from IEEE Xplore) if the paper
is not presented at the conference.
*******************


IMPORTANT DATES
------------------------------------------------------------------------
- Manuscript submission deadline: November 21, 2010.
- Manuscript acceptance notification: March 18, 2011.


CONTACTS
------------------------------------------------------------------------
For further information, please visit the conference website at
http://wowmom2011.imtlucca.it/index.html, or contact the PC-chairs
at wowmom11-pcchairs(at)iit.cnr.it


WORKSHOPS AND AFFILIATED EVENTS:
------------------------------------------------------------------------
Several workshops will be held in conjunction with the main conference.
Workshop papers will be included and indexed in the
IEEE Digital Library (Xplore), showing their affiliation with IEEE WoWMoM.
WoWMoM 2011 will also feature an Industry Track, PhD Forum and
a Demonstrations Session. Please visit the conference website for details.


ORGANIZING COMMITTEE
------------------------------------------------------------------------
GENERAL CO-CHAIRS
Mario Gerla, UCLA, USA
Enzo Mingozzi, Univ. of Pisa, Italy

TPC CO-CHAIRS
Mainak Chatterjee, Univ. of Central Florida, USA
Andrea Passarella, IIT-CNR, Italy

WORKSHOPS CO-CHAIRS
Albert Banchs, Univ. Carlos III of Madrid, Spain
Luciano Bononi, Univ. of Bologna, Italy

PUBLICATION CO-CHAIRS
Daniele Puccinelli, SUPSI, Switzerland
Marco Di Felice, Univ. of Bologna, Italy

INDUSTRY-TRACK CO-CHAIRS
Marc Brogle, SAP Research, Switzerland
Xavier Perez-Costa, NEC Laboratories Europe, Germany

PUBLICITY CO-CHAIRS
Habib M. Ammari, Hofstra Univ., USA
Daniele Migliorini, Univ. of Pisa, Italy
June-Koo Kevin Rhee, KAIST, Korea
Nirmalya Roy, Institute for Infocomm Research (I2R), Singapore

FINANCE & REGISTRATION CHAIR
Yonghe Liu, Univ. Texas at Arlington, USA

LOCAL ORGANIZATION CHAIR
Adriana Lazzaroni, IIT-CNR, Italy

WEB CHAIR
Carlo Vallati, Univ. of Pisa, Italy

STEERING COMMITTEE
Marco Conti, IIT-CNR, Italy
Sajal K. Das, Univ. Texas at Arlington, USA (chair)
Dipankar Raychaudhuri, Rutgers Univ., USA
Satish K. Tripathi, SUNY Buffalo, USA

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

[DMANET] 34ACCMCC Early-bird registration ends 31 October

The early-bird deadline is fast approaching: registration prices
increase on 1 November.

34ACCMCC: The 34th Australasian Conference on Combinatorial
Mathematics & Combinatorial Computing
Date: 6-10 December 2010
Venue: The Australian National University, Canberra, Australia
Website: http://www.maths.anu.edu.au/events/34accmcc/34accmcc.html

Registration is now open: early-bird registration ends on 31 October.

ACCMCC, the Australasian Conference on Combinatorial Mathematics and
Combinatorial Computing, is the annual conference of the Combinatorial
Mathematics Society of Australasia. This year it will be held at the
Australian National University in Canberra, Australia. The conference
covers all areas of combinatorics in mathematics and computer science.
The first two days of the conference will run concurrently with the
Annual Australian Statistical Mechanics Meeting.

The following people will be giving invited talks.

- Emeritus Professor Richard Brualdi, University of Wisconsin
- Professor Darryn Bryant, University of Queensland
- Professor Michael Fellows, University of Newcastle, Australia
- Dr Catherine Greenhill, University of New South Wales
- Dr Petteri Kaski, Aalto University
- Dr Dan Romik, UC Davis
- Dr Ian Wanless, Monash University
- Professor Catherine Yan, Texas A&M University

Attendees (especially students) are invited to give contributed talks.
Contributed talks are 20 minutes in length with an additional 5
minutes for questions. The CMSA Student Prize will be awarded to the
best student talk at the conference.

As usual, during the week there will be a conference dinner and an
excursion. The excursion will be in the Canberra region.

For more information about 34ACCMCC, please contact the organisers at 34accmcc@anu.edu.au
. For information about the Statistical Mechanics meeting, please
contact Murray Batchelor at Murray.Batchelor@anu.edu.au.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, October 25, 2010

[DMANET] Postdoc and student positions in graph theory

Postdoctoral positions supported by the ERC Starting grant CCOSA held
by Daniel Kral at Charles University, Prague, are announced. Successful
candidates should have strong background in graph theory, preferrably
in the area of extremal or algorithmic graph theory, the two main areas
of the grant. The postdocs will join a team formed by Zdenek Dvorak,
Daniel Kral, Ondrej Pangrac, Robert Samal and their students as well as
they will have opportunity to collaborate with many faculty members
of Charles University working in the area of discrete mathematics.

Informal inquiries should be addressed to Daniel Kral, kral@kam.mff.cuni.cz, and
formal applications, which include CV with a list of publications and a list of
academic references, should be sent to the secretary of DIMATIA center,
Mrs. Hana Polisenska, poli@kam.mff.cuni.cz . Dates of appointments are flexible.

We also offer a number of scholarships for visiting students, preferrably
for the duration between 3 and 10 monhts.

In addition, with support of the ERC Starting grant CSP-Complexity of
Manuel Bodirsky at LIX Ecole Polytechnique in Paris, we offer one joint
postdoc position. A successful candidate should have a strong background
in logic or algorithmic graph theory and be willing to extend his/her
expertise in the other field. A position is intended as a one-year position
at Charles University in Prague and a one-year position at LIX Ecole
Polytechnique in Paris. Informal inquiries for more details are welcome
by e-mail.

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

[DMANET] CFP - JORS Special Issue on Systems to Build Systems

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]
****************************************************************
CALL FOR PAPERS

Journal of the Operational Research Society
Special Issue on Systems to Build Systems

Deadline: 1st of March, 2011

http://www.cs.nott.ac.uk/~exo/specialissue/JORS2011.html
****************************************************************
Guest editors:
Edmund K. Burke, ekb@cs.nott.ac.uk
Ender Ozcan, exo@cs.nott.ac.uk
Jonathan Thompson, ThompsonJM1@cardiff.ac.uk

DESCRIPTION:
The current state of the art in the development of decision support systems
and search methodologies is focused around the human design of bespoke
systems, which are specifically tailored to the problem solving environment
in hand. Although such systems are often highly successful and useful, their
development cost is often high due to the human (expert) resources required.
Hence, an ever more important goal is to develop intelligent systems which
are capable of automatically building (and/or selecting) other systems. Over
the past few years, there has been a growing interest in developing such
-systems to build systems- to accomplish this challenging task. The ultimate
aim is to raise the level of generality by providing a more broadly
applicable solution, as opposed to dealing with single problems. These types
of -systems to build systems- have the potential to significantly reduce the
resource cost that is often associated with developing tailored systems,
since the algorithm construction/selection part of the development process
is automated.

The main purpose of this special issue is to reveal the recent advances in
the field, including novel methodologies, their foundations, frameworks and
applications to real-world problems.

SCOPE:
Topics on the systems to build systems (e.g. hyper-heuristics) include (but
not limited to):
* new methodologies to build (and/or select) systems
* automated (computer aided) design of heuristics (e.g., by genetic
programming, grammatical evolution, and others)
* adaptive/self-tuning methodologies to build systems (e.g. evolutionary
algorithms, multi-meme algorithms, adaptive operator selection, dynamic
algorithm portfolios, reactive search, and others)
* machine learning techniques to support/build systems (e.g. learning
classifier systems, data mining, reinforcement learning, neural networks,
and others)
* fuzzy systems to build systems
* applications and new challenging domains, particularly real-world
problems
* foundational studies towards the understanding of systems to build
systems
* classifications of methodologies
* generality of the methodologies to build systems
* scalability issues
* issues in multi-objective, discrete and continuous methodologies to build
systems
* issues in comparison of systems to build systems over multiple problem
domains

SUBMISSIONS:
Papers should be submitted electronically via the Journal of the Operational
Research Society's online submission system at http://jors.msubmit.net/,
following the journal's instructions to authors at
http://www.palgrave-journals.com/jors/. Please indicate that your submission
is to the Special Issue on "Systems to Build Systems" (by selecting it as
the article type). All papers submitted to the special issue will go through
the normal strict peer review process of the Journal of the Operational
Research Society to ensure the high quality of this volume.
- - - - - - - - - - - - -
**********************************************************
*
* 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/
*
**********************************************************

[qest-announce] Positions in quantitative/probabilistic model checking at Oxford

[Please forward to anyone who might be interested. Apologies for
multiple mailing.]

One Doctoral Studentship is available in association with ERC Advanced
Grant VERIWARE led by Professor Marta Kwiatkowska. For more information see:
http://www.comlab.ox.ac.uk/news/236-full.html

Two one year Research Assistant positions (Grade 6 and Grade 7) in
probabilistic model checking are expected to be announced shortly,
supervised by Professor Marta Kwiatkowska and Dr Dave Parker.

The successful applicants will be working with the probabilistic model
checker PRISM (http://www.prismmodelchecker.org/).

Informal enquiries enclosing CVs should be sent to Professsor Marta
Kwiatkowska, email Marta.Kwiatkowska@comlab.ox.ac.uk, before 15th
November 2010.

--
Professor Marta Kwiatkowska
Fellow of Trinity College
Director of Graduate Studies

Oxford University Computing Laboratory
Wolfson Building, Parks Road
Oxford, OX1 3QD

Tel: +44 (0)1865 283509 (office)
Email: Marta.Kwiatkowska@comlab.ox.ac.uk
URL: http://web.comlab.ox.ac.uk/people/Marta.Kwiatkowska/
_______________________________________________
qest-announce mailing list
qest-announce@iti.uiuc.edu
http://mailman.crhc.uiuc.edu/mailman/listinfo/qest-announce

Sunday, October 24, 2010

[DMANET] CfP: NETWORKS Special Issue: Algorithmic Approaches for Transportation Modeling, Optimization, and Systems

CALL FOR PAPERS: NETWORKS SPECIAL ISSUE

ALGORITHMIC APPROACHES FOR TRANSPORTATION MODELING, OPTIMIZATION, AND
SYSTEMS


Following up on the ATMOS 2010 workshop (U Liverpool, UK, September 9,
2010, http://algo2010.csc.liv.ac.uk/atmos/), we invite submissions to
a special issue of the Wiley journal "NETWORKS" dedicated to the
topics of the workshop. Submission is *not* restricted to workshop
participants, and we encourage authors to submit relevant
contributions of highest quality from all fields, including computer
science (in particular algorithms), mathematics, and operations
research.


BACKGROUND INFORMATION on the ATMOS workshop and the scope of the
special issue:

Since 2000, the series of ATMOS workshops brings together researchers
and practitioners who are interested in all aspects of algorithmic
methods and models for transportation optimization and provides a
forum for the exchange and dissemination of new ideas and techniques.

Transportation networks give rise to very complex and large-scale
network optimization problems requiring innovative solution techniques
and ideas from mathematical optimization, theoretical computer
science, and operations research. Applicable tools and concepts
include those from graph and network algorithms, combinatorial
optimization, approximation and online algorithms, stochastic and
robust optimization. The scope of the workshop comprises all modes of
transportation.

For the special issue we invite submissions on optimization problems
for passenger and freight transport, including---but not limited to:

* Infrastructure Planning
* Vehicle Scheduling
* Crew and Duty Scheduling
* Rostering
* Routing in Road Networks
* Novel Applications of Route Planning Techniques
* Demand Forecasting
* Design of Tariff Systems
* Delay Management
* Mobile Applications
* Humanitarian Logistics
* Simulation Tools
* Line Planning
* Timetable Generation
* Routing and Platform Assignment

Of particular interest are: the successful integration of several
(sub)problems or planning stages, algorithms operating in an
online/realtime or stochastic setting, and heuristic approaches
(including approximation algorithms) for real-world instances.


SUBMISSIONS

Authors are invited to submit a full paper with original, high quality
results relevant to this call. Papers must be submitted electronically
at

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

by December 31, 2010. Each paper will be peer-reviewed according to
the high standards of the journal.


The special issue is guest-edited by:

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

Saturday, October 23, 2010

Position in Softw. Engin. & IT Security, Fraunhofer ISST, Dortmund (Germany)

Please forward the message below to anyone who might be interested. Thanks a lot !

[! Please reply to the email address given at http://jan.jurjens.de !]

Fraunhofer Institute for Software and Systems Engineering (ISST), Dortmund, Germany

Researcher position [German language required]

Researcher position to be filled as soon as possible. The positions is
part of a Fraunhofer Attract research group on the topic:
"Architectures for Auditable Business Process Execution (APEX):
Monitoring, Control, and Compliance in the Insurance Domain"
which is directed by Prof. Dr. Jan Jürjens. Goal of the project is the
development of concepts and solutions for business processes and
their execution in the context of service-oriented IT architectures.
The project goal in particular includes the compliance with relevant
regulatory documents regarding Coporate Governance and IT security
(such as Solvency II).
More information on the Attract program can be found at:
http://www.fraunhofer.de/en/jobs-career/fraunhofer-attract

More information on the position and how to apply is available at the following link:
http://de.gigajob.com/job_offer_48536347.html

--
Prof. Dr. Jan J"urjens

Software Engineering, Technical University Dortmund, http://jan.jurjens.de

Fraunhofer-Institute for Software and Systems Engineering ISST
Project Group Apex, Scientific Coordinator Enterprise Engineering
Emil-Figge-Straße 91, 44227 Dortmund, Germany
Telefon: +49 (0) 231 / 97677-320
http://www.isst.fraunhofer.de/geschaeftsfelder/insuranceandfinance/refpro/gruppe-apex

--
NOTE: This is a legacy email address that is now only used to receive
(lots of) spam. If you would like to send me a legitimate email, please
use the address given at http://jan.jurjens.de . Thanks a lot !

Friday, October 22, 2010

CFP: 12th ACM Conference on Electronic Commerce (EC'11), San Jose, June 5-9 2011

CALL FOR PAPERS, WORKSHOPS, AND TUTORIALS

 Twelfth ACM Conference on Electronic Commerce (EC'11)
 June 5-9, 2011, San Jose, California, USA
            http://www.sigecom.org/ec11/

Part of the Federated Computing Research Conference (FCRC),
http://www.acm.org/fcrc/.

Since 1999 the ACM Special Interest Group on Electronic Commerce
(SIGECOM) has sponsored the leading scientific conference on advances
in theory, systems, and applications for electronic commerce. The
Twelfth ACM Conference on Electronic Commerce (EC'11) will feature
invited speakers, paper presentations, workshops, and tutorials
covering all areas of electronic commerce.

The natural focus of the conference is on computer science issues, but
the conference is interdisciplinary in nature, addressing research
related to (but not limited to) the following topics:

Applications, Empirical and Experimental Studies, including

o       Consumer search and online behavior
o       Crowdsourcing and collective intelligence
o       Prediction/information markets
o       Social and economic networks
o       Experience with e-commerce systems and markets
o       Pricing for quality of service
o       Web analysis and characterization for e-commerce
o       Open access publishing
o       User contributed content
o       Economics of online textual content
o       Behavioral and experimental economics related to e-commerce

Theory and Foundations, including

o       Computational aspects of economics, game theory, finance, and social choice
o       Algorithmic mechanism design
o       Auction and negotiation technology
o       Formation of supply chains, coalitions, and virtual enterprises
o       Agency and contract theory in e-commerce
o       Game-theoretic aspects of e-commerce and the Internet
o       Preferences and decision theory
o       Economics of information
o       Economics of networks

Architectures and Languages, including

o       Peer-to-peer, grid, and other open distributed systems
o       Mobile commerce
o       Software and systems requirements, architectures, and performance
o       Languages for describing agents, goods, services, and contracts

Automation, Personalization, and Targeting, including

o       AI and autonomous agent systems in e-commerce
o       Automated shopping, trading, and contract management
o       Recommendation, reputation, and trust systems
o       Advertising and marketing technology
o       Sponsored web search, viral marketing
o       Databases and data mining
o       Machine learning for e-commerce applications
o       Mobile and location-based services
o       Search and information retrieval for e-commerce

Security, Privacy, Encryption, and Digital Rights, including

o       Intellectual property and digital rights management
o       Digital payment systems
o       Authentication
o       Privacy-enhancing technologies
o       Economics of information security and privacy
o       Economics of intellectual property and digital rights

Social factors, including

o       Usability of e-commerce systems
o       Human factors in security and privacy
o       Human factors in agents and mechanism design for e-commerce
o       Legal, policy, and social issues
o       Impact of social networks

The conference will be held from Sunday, June 5 through Thursday June 9
in San Jose, California, as part of the FCRC conference.  Tutorials and
Workshops will be held on Sunday June 5 and Monday June 6. Accepted
technical papers and invited talks will be presented from Tuesday
June 7 through Thursday June 9, 2011.

PAPER SUBMISSION

The conference is soliciting full papers (as well as workshop and
tutorial proposals; see below) on all aspects of electronic commerce.
Submitted papers will be evaluated on significance, originality,
technical quality, and exposition. They should clearly establish the
research contribution, its relevance to electronic commerce, and its
relation to prior research. Submissions to be considered for
publication in the archival ACM proceedings may be up to 10 pages
(including the bibliography), in 10-point font, double-column format,
with reasonable margins and interline spacing. Additional details may
be included in appendices beyond the 10 page limit but will only be
read at the discretion of the reviewers.

Results previously published in another conference proceedings or journal
(or scheduled for publication prior to EC) will not be accepted at EC.
Simultaneous submissions of the results to another conference with a
published proceedings is not allowed.

All accepted submissions will need to be migrated to the publisher's
format/macros for the proceedings. Instructions will be given by the
publisher after the paper is accepted. Accepted papers will be
presented at the conference in one of two formats: (1) a long oral
presentation or (2) a short oral presentation. Presentation format
will be chosen by the program committee with the goal of encouraging
breadth and diversity among presentations. Presentation format will
have no bearing on how papers appear in the archival conference
proceedings: all accepted papers will be allotted 10 pages in the
proceedings.

IMPORTANT NOTICE: To accommodate the publishing traditions of
different fields, authors may instead submit working papers that are
under review or nearly ready for journal review. These submissions
will be subject to review and considered for presentation at the
conference but only a one page abstract will appear in the proceedings
with a URL that points to the full paper and that will be reliable for
at least two years. Open access is preferred although the paper can be
hosted by a publisher who takes copyright and limits access, as long
as there is a link to the location. Electronic submission is required,
and the title page should state clearly that the submission is a working
paper.  Details on the submission procedure will be made available on the
main conference web page.

WORKSHOP AND TUTORIAL PROPOSALS

The conference is soliciting proposals for tutorials and workshops to
be held in conjunction with the conference. Tutorial proposals should
contain the title of the tutorial, a two-page description of the topic
matter, the names and short biographies of the tutor(s), and
dates/venues where earlier versions of the tutorial were given (if
any). Workshop proposals should contain the title of the workshop, the
names and short biographies of the organizers, and the names of
confirmed or candidate participants. Workshop proposals should also
include a two-page description describing the theme, the reviewing
process for participants, the organization of the workshop, and
required facilities for the workshop. Informal suggestions for
workshop or tutorial ideas can also be sent without a full proposal to
the workshop and tutorial chairs at any time. Submission information
can be found on the conference website.

KEY DATES

o       February 4, 2011: Full electronic paper submissions due
      Instructions will be posted at http://www.sigecom.org/ec11/
o       February 8, 2011: Workshop and Tutorial proposals due
      Send to: ec11-workshops-chair@acm.org and ec11-tutorial-chair@acm.org.
o       March 1, 2011: Tutorial & workshop proposal accept/reject
                      notifications
o       March 15, 2011: Paper Accept/Reject Notifications
o       March 31, 2011: Camera-ready copies arrive at the publisher
o       June 5-6, 2011: Conference Workshops and Tutorials, San Jose, CA, USA
o       June 7-9, 2011: Conference Technical Program, San Jose, CA, USA

ORGANIZING COMMITTEE

General Chair:  Yoav Shoham, Stanford University

Program Chairs: Yan Chen, University of Michigan and
Tim Roughgarden, Stanford University

Workshop Chair: Sanmay Das, Rensselaer Polytechnic Institute

Tutorial Chair: Vahab Mirrokni, Google

Senior Program Committee:

Craig Boutilier         University of Toronto
Felix Brandt            Technische Universität München
Shuchi Chawla           University of Wisconsin
David Easley            Cornell University
Joan Feigenbaum         Yale University
Anindya Ghose           NYU
Jason Hartline          Northwestern University
Ramesh Johari           Stanford University
Robert Kleinberg        Cornell University
Kevin Leyton-Brown      University of British Columbia
John Morgan             UC Berkeley
Rudolf Mueller          Maastricht University
Michael Ostrovsky       Stanford University
Christos Papadimitriou  UC Berkeley
David Reiley            Yahoo! Research
Rahul Sami              University of Michigan
Michael Wellman         University of Michigan
Berthold Voecking       Aachen University

FURTHER INFORMATION

More information and details are available at the conference web site:
http://www.sigecom.org/ec11/

General inquiries and requests pertaining to the conference should be
sent to: ec11-general-chair@acm.org

Inquiries and requests pertaining specifically to the program, and in
particular to paper submission and decision status, should be sent to:
ec11-pc-chairs@acm.org

Inquiries and requests pertaining specifically to workshop and tutorials
should be sent to: ec11-workshops-chair@acm.org and
ec11-tutorial-chair@acm.org.

Wednesday, October 20, 2010

[DMANET] Postdoc position at LAAS-CNRS (Toulouse, France)

Sorry for the multiple copies
-----------------------------

http://homepages.laas.fr/brun/OSEC/osec.html
LAAS-CNRS
Toulouse, France.

OSEC is a 2-year project funded by the LAAS laboratory. It is a joint
project of 3 research groups: MRS, OLC and MOGISA. We are seeking a
9-months postdoc (possible extension to 1 year) to work on the project
OSEC. The position is to be filled up to January 3rd, 2011 and is funded
by a grant from the LAAS-CNRS.

Title: Scheduling for Critical On-board Systems
-----

Context:
-------
The conditions for the correct performance of a real-time system include
not only the logical correctness of each of the tasks that are executed
but also their timing correctness, that is the system should meet the
timing requirements of each task. The design of such systems usually
relies on a pessimistic analysis based on worst-case execution times of
the tasks in order to find a taks scheduling meeting the strict
real-time requirements of the tasks. Even if it is approriate in some
specific application areas (e.g. aeronautics), this approach does not
allow to address many of the most important real-time system
applications because, when the execution time variance is high, it leads
to a significant over-provisionning of resources and puts
unnecessary constraints on the development. For real-time systems for
which the task set exhibit substantial variability, one would like to
develop approaches taking into account the stochastic nature of
processing times. Such approaches can lead to a drastic reduction in the
amount of on-board processing resources. Similarly, taking into account
the needs for system reconfiguration in case of failure can lead to
significant gains.

Candidate Profile:
------------------
The candidate must have:
- a PhD degree in computer science or control,
- Excellent skills in stochastic modelling (queueing theory, stochastic
Petri nets, (max,+)-systems,...),
- Knowledge in the domain of real-time systems,
- Good organizational and communication skills.


Application :
-----------
Each application must contain the following documents:
- a detailed CV
- a cover letter with a short description of previous works
- one or two reference letters with contact addresses


Starting date: January 3rd, 2011.
-------------

Applications should be sent electronically to Olivier Brun (brun@laas.fr)

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

[DMANET] Postdoctoral Research Positions in Integer Programming at University of Pittsburgh

Apologies for cross-posting.

The Department of Industrial Engineering at the University of Pittsburgh
anticipates two postdoctoral research positions in Integer Programming
starting January 2011 or later. The initial appointments are for one
year with an extension possible, subject to the availability of funds.

One postdoctoral associate will work with Juan Pablo Vielma in
developing theory and methodologies for solving Mixed Integer Nonlinear
Programming problems. Necessary qualifications include a Ph.D. in
Industrial Engineering, Operations Research, Mathematics or related
field and a strong background in the theory of Integer Programming
and/or Convex Optimization. Computer programming expertise (C/C++) is
highly desirable.

Another postdoctoral associate will work with Andrew Schaefer, Juan
Pablo Vielma and medical school collaborators to apply mathematical
programming techniques to liver transplantation problems. Necessary
qualifications include a Ph.D. in Industrial Engineering, Operations
Research or a related field, a strong background in Large-Scale Integer
Programming and extensive computer programming expertise (specially
C/C++). No prior research experience in health care is required.

We will be reviewing applications immediately. Candidates should send
their CV to:

Juan Pablo Vielma
University of Pittsburgh
Department of Industrial Engineering
Email: jvielma@pitt.edu

The University of Pittsburgh is an affirmative action, equal opportunity
employer. We especially encourage applications from under-represented
groups.

http://www.pitt.edu/~jvielma/postdoc.pdf


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

TAPAS 2011 - Deadline extended to November 1st

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

******************************************************
* *
* Submission deadline extended to November 1st *
* *
******************************************************

SCOPE
-----

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. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

IMPORTANT DATES
---------------

* Paper submission due: November 1, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

PROGRAM COMMITTEE
-----------------

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universit?t Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universit?t K?ln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

STEERING COMMITTEE
------------------

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)

[DMANET] TAPAS 2011 - Deadline extended to November 1st

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

Call for Papers

TAPAS 2011
Theory and Practice of Algorithms in Computer Systems

April 18-20, 2011, Rome, Italy

http://tapasconference.org/
=======================================================================

******************************************************
* *
* Submission deadline extended to November 1st *
* *
******************************************************

SCOPE
-----

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. The aim of
TAPAS is to provide a forum for presentation of original research in the
design, implementation and evaluation of algorithms. TAPAS is dedicated
to the use, design and evaluation of algorithms for combinatorial
optimization problems (either efficient optimal or efficient approximation
algorithms) and to real-world applications, engineering and experimental
analysis of algorithms. It aims, in particular, at fostering the
cooperation among researchers in computer science, networking, discrete
mathematics, mathematical programming and operations research.

PAPERS
------

The conference will focus on the design, engineering, theoretical and
experimental performance analysis of algorithms for problems arising in
different areas of computation. We invite submissions that present
significant case studies in theoretical and experimental analysis and
evaluation of algorithms with specific areas including communications
networks, combinatorial optimization and approximation, parallel and
distributed computing, computer systems and architecture, economics, game
theory, social networks and the world wide web. Novel uses of discrete
algorithms in all disciplines and the evaluation of algorithms for
realistic environments are particularly welcome.

Submitted papers will consider a succinct summary of the problem and of
the results obtained (emphasizing the significance and potential impact
of the research), and a clear comparison with related work, all accessible
to non-specialist readers. The remainder of the extended abstract should
provide sufficient detail to allow the program committee to evaluate the
validity, quality, and relevance of the contribution.

* The maximum length of the paper (excluding the optional appendix) is 12
pages.

* Proofs and any other material omitted due to space constraints must be
placed in an appendix to be read by the program committee members at
their discretion.

The proceeding will be published by Springer (Lecture Notes in Computer
Science).

IMPORTANT DATES
---------------

* Paper submission due: November 1, 2010
* Notification of acceptance: December 17, 2010

PROGRAM COMMITTEE CO-CHAIRS
---------------------------

Alberto Marchetti-Spaccamela
(Sapienza University of Rome, Italy)
alberto@dis.uniroma1.it

Michael Segal
(Ben-Gurion University of the Negev, Israel)
segal@cse.bgu.ac.il

PROGRAM COMMITTEE
-----------------

Stefano Basagni (Northeastern University, USA)
Alex Kesselman (Google Inc., USA)
Peng-Jun Wan (Illinois Institute of Technology, USA)
Peter Widmayer (ETH, Switzerland)
Stefan Funke (Universit?t Stuttgart, Germany)
Alessandro Mei (Sapienza University of Rome, Italy)
Leen Stougie (VU University, Amsterdam, Netherlands)
Alon Efrat (University of Arizona, USA)
Jack Snoeyink (University of North Carolina at Chapel Hill, USA)
Andrei Broder (Yahoo Inc., USA)
Gerhard Woeginger (Eindhoven University of Technology, Netherlands)
Michael Juenger (Universit?t K?ln, Germany)
Hanan Shpungin (University of Calgary, Canada)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), co-Chair
Michael Segal (Ben-Gurion University of the Negev, Israel), co-Chair

STEERING COMMITTEE
------------------

David Peleg (Weizmann Institute, Israel)
Paul Spirakis (University of Patras, Greece))
Imrich Chlamtac (University of Trento, Italy)
Pankaj Agarwal (Duke University, USA)
Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy)
Michael Segal (BGU, Israel)
Roger Wattenhofer (ETH, Switzerland)

**********************************************************
*
* 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 positions in algorithms at the University of Vienna

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF VIENNA

PH.D. and POST-DOCTORAL RESEARCH ASSISTANT POSITIONS

PhD and post-doctorial research assistant positions are available in
the research group of Professor Dr. Monika Henzinger, who was
formerly the Director of Research of Google Inc. Her research area is
efficient algorithms and algorithmic game theory, as well as data
analysis and data mining.
See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
for more information on the research group.

PhD position: The positions are available immediately and will be of
48 months. Applicants should have a bachelor or master's degree in
computer science or some other relevant discipline, with a strong
background in theoretical computer science or statistics.

See https://univis.univie.ac.at/ausschreibungstellensuche (Freetext
search for 1549 ) for more details and instructions on how to apply.


Post-doctoral position: The position is available immediately and will
be of 12 months with extension possible. Applicants should have have,
or expect shortly to obtain, a PhD in computer science or some other
relevant discipline, with a strong background in theoretical computer
science. Experience in the analysis of algorithms or in algorithmic
game theory is very useful.

To apply, please send your CV, letter of motivation, and names of at
least two references to monika.henzinger@univie.ac.at.
**********************************************************
*
* 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/
*
**********************************************************

Tuesday, October 19, 2010

Post Doctoral and PhD positions in Bioinformatics

Post-Doctoral and PhD positions in Bioinformatics
(Applied Algorithmics Lab, UConn)

Multiple Ph.D. and a post-doctoral position in the general area of
bioinformatics are open in the Applied Algorithmics Lab at the University of
Connecticut.

The candidates for PhD Research Assistant positions should have strong
analytical and algorithmic skills.

The post-doctoral candidates should have a strong background in
bioinformatics (especially involving algorithms). Familiarity with motif
search algorithms will be a plus. They must have received or be very close
to getting their PhD's. Publications in relevant Bioinformatics venues are
expected.

These positions are partially supported by a recent NIH R01 grant and are
open immediately. Interested persons are asked to send a resume to
Sanguthevar Rajasekaran (rajasek@engr.uconn.edu). Queries are welcome.

[DMANET] Universitaetsprofessur fuer Diskrete Mathematik

Am Institut fuer Mathematik der Fakultaet fuer Technische Wissenschaften an der
Alpen-Adria-Universitaet Klagenfurt gelangt voraussichtlich mit 1. Oktober 2011
eine

Universitaetsprofessur fuer Diskrete Mathematik

im vollen Beschaeftigungsausmass unbefristet zur Besetzung.

Aufgabenbereich:
Vertretung des Fachgebietes Diskrete Mathematik in Forschung und Lehre
Abhaltung von Grund- und Speziallehrveranstaltungen in den Bachelor- und
Masterstudien Technische Mathematik, Beteiligung an der mathematischen
Ausbildung in den Studien Informatik, Informationstechnik, Angewandte
Betriebswirtschaft und Lehramt Unterrichtsfach Mathematik sowie Mitwirkung in
den Doktoratsstudien
Mitwirkung an der universitaeren Selbstverwaltung

Anstellungserfordernisse:
fachspezifische Habilitation oder gleich zu wertende wissenschaftliche
Leistungen
herausragende anwendungsorientierte Forschungsaktivitaeten und Lehrerfahrung in
einem oder mehreren Forschungsgebieten des Themenkreises Diskrete Mathematik,
insbesondere Kombinatorik, Graphentheorie oder Angewandte Algebra
nachgewiesene universitaere Lehrerfahrung und hochschuldidaktische Kompetenz
Qualifikation als Fuehrungskraft

Erwuenscht sind:
Erfahrungen in der in der internationalen Forschungskooperation
Erfahrungen in der Einwerbung und Durchfuehrung von Drittmittelprojekten
Teamfaehigkeit
Kompetenz in Gender Mainstreaming
Einschlaegige Praxiserfahrung
Faehigkeit zu interdisziplinaeren Kooperationen in Anwendungsgebieten der
Informatik und Informationstechnik
Erfahrungen im Bereich postgradualer Fort- und Weiterbildung

Erwartet wird:
Bereitschaft zur Mitwirkung an der Profilbildung des Institutes
die grundsaetzliche Bereitschaft zur Leitung einer Organisationseinheit nach UG
2002

Von der zukuenftigen Professorin/vom zukuenftigen Professor wird erwartet, dass
sie/er den Arbeitsmittelpunkt nach Klagenfurt verlegt.

Die Universitaet strebt eine Erhoehung des Frauenanteils beim wissenschaftlichen
Personal insbesondere in Leitungsfunktionen an und fordert daher qualifizierte
Frauen ausdruecklich zur Bewerbung auf. Frauen werden bei gleicher Qualifikation
vorrangig aufgenommen.
Menschen mit Behinderungen oder chronischen Erkrankungen, die die geforderten
Qualifikationen erfuellen, werden ausdruecklich zur Bewerbung aufgefordert.

Details zur Bewerbung: siehe
http://www.uni-klu.ac.at/rechtabt/downloads/mbl25_09_10.pdf
---846256206-1224311733-1287122991=:2589--
**********************************************************
*
* 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] Greenet Workshop at VTC Spring 2011

---------------------------------------------------------------------------
Second Green Wireless Communications and Networks Workshop (GreeNet)
---------------------------------------------------------------------------

Co-located with IEEE VTC Spring 2011, Budapest, Hungary
15th-18th May 2011

Workshop Overview
----------------------
The objective of this workshop is to discuss new technologies that can be
exploited to improve the efficiency and sustainability of future wireless
networks. One major area where advances may be made is in moving towards more
heterogeneous wireless networks which employ a mix of network components,
such as macro-cell base stations, wireless (fixed and/or mobile) relays,
microcells, picocells and femtocells. A second important avenue of research
relates to new technologies and algorithms that can be deployed within the
radio of each device to reduce energy consumption. Examples of such
technologies include efficient radio amplifiers, antennas and multiple input
multiple output (MIMO) configurations as well as new energy saving physical layer
techniques and packet scheduling algorithms.

Papers on the following (but not limited to) topics are invited:

* Energy Efficient Wireless Network design: Efficient network architectures
; Radio access networks; Network traffic engineering and QoS support; Netwo
rk operation and management

* Enabling technologies: Physical layer techniques; MAC protocols;
Cross-layer optimization; Cognitive networks

* Network components and devices: Low power devices User terminal designs
Base station hardware architectures Power management for user terminals and
network devices

* Applications of wireless technologies: Wireless networking for smart grid
and power management; home working/smart office; Intelligent transport;
Machine-to-machine communications; Regulatory issues; Applications to 3GPP/IE
EE 802 standards

Key Dates
-----------
Paper Deadline: 15 Nov 2010
Notification: 9 Jan 2011
Camera Ready Deadline: 20 Feb 2011

Plenary Speaker
---------------
Shugong Xu, Huawei

Workshop Organisers
-----------------------
John Thompson, University of Edinburgh
Ngoc Dao, Toshiba Research Labs
Simon Armour, University of Bristol
Vasilis Friderikos, Kings College London
Tim O?Farrell, Swansea University

Technical Programme Committee
----------------------------------
Andre Brandao, CRC Canada
Chadi Khirallah, University of Edinburgh
Chan-Byoung Chae, Alcatel-Lucent Bell Labs
Congzheng Han, University of Bristol
David Lister, Vodafone
Shunqing Zhang, Huawei
Emilio Leonardi, Politecnico de Torino
Ha Nguyen, University of Saskatchewan
Imran Ashraf, Alcatel-Lucent Bell Labs
Liqiang Zhao, Xidian University
Man-Fai Wong, Orange
Mythri Hunukumbure, Fujitsu
Oliver Holland, Kings College London
Raymond Kwan, NEC Telecom Modus
Richard Mackenzie, BT
Robert Joyce, O2
Stefan Kaiser, NTT Docomo
Zhisheng Niu, Tsinghua University
**********************************************************
*
* 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] 29th Colloquium on Combinatorics: Early Registration Deadline Now

Dear all,

just a reminder: The early registration deadline for the 29th Colloquium
on Combinatorics is in two days (October 21st).

All the best
Benjamin Doerr

CONFERENCE ANNOUNCEMENT


******************************************
* *
* Colloquium on Combinatorics *
* Saarbruecken *
* 12th & 13th of November 2010 *
* *
******************************************


The 29th Colloquium on Combinatorics will take place in
Saarbruecken (Germany), November 12 and 13. This conference
traditionally attracts both young researchers and well
established scientists.

The colloquium covers all parts of Combinatorics and Discrete
Mathematics in a broad sense, including combinatorial aspects
in Algebra, Geometry and Computer Science.

This year's plenary talks will be given by
- Dominique Foata (Strasbourg)
- Daniela Kuehn (Birmingham)
- Gabriele Nebe (RWTH Aachen)
- Marc Noy (UPC Barcelona)

Participants are invited to give a 20-minute presentation on their
current work. Please register for the conference before October 21 via
the conference webpage at

http://www.mpi-inf.mpg.de/conferences/kolkom10/index.html

If you intend to give a talk, please send us an abstract using the
template provided on the webpage before October 29.

See you in Saarbruecken!

Benjamin Doerr
MPI Informatics and Saarland University
Saarbruecken, Germany

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

Monday, October 18, 2010

[DMANET] Ph.D. Project on Convex and Discrete Chance Constraint Models, TU Chemnitz

S T E L L E N A U S S C H R E I B U N G

An der Fakultaet fuer Mathematik der Technischen Universitaet Chemnitz
ist an der Professur Algorithmische und Diskrete Mathematik fuer die
Bearbeitung der Teilprojekts

"Konvexe Chance-Constraint Modelle fuer Robuste Kommunikationsnetze"

innerhalb des BMBF-Verbundprojekts "Robuste Kommunikationsnetze" (ROBUKOM)
zum naechstmoeglichen Zeitpunkt eine Stelle als

Wissenschaftlicher Mitarbeiter/Wissenschaftliche Mitarbeiterin
( Entgeltgruppe 13 TV-L)

befristet bis zum 30.06.2013 zu besetzen. Die befristete Einstellung
erfolgt gemaess den Regelungen des Wissenschaftszeitvertragsgesetzes
(WissZeitVG) und des Saechsischen Hochschulgesetzes (SaechsHSG) in der
jeweils geltenden Fassung.

Der Aufgabenbereich umfasst die Entwicklung, wissenschaftliche Dikussion
und algorithmische Umsetzung von Chance-Constraint Modellen mit
Ganzzahligkeitsforderungen und entsprechenden Loesungsverfahren fuer die
robuste kapazitive Auslegung von Kommunikationsnetzen.

Einstellungsvoraussetzung ist ein abgeschlossenes wissenschaftliches
Hochschulstudium auf dem Gebiet der Mathematik, welches zur Zulassung
zum hoeheren Dienst berechtigt. Weiterhin sind die
Einstellungsvoraussetzungen
gemaess § 71 Saechsisches Hochschulgesetz zu erfuellen.

Der/die Kandidat(in) soll ein mathematisches Studium mit
ueberdurchschnittlichem Erfolg abgeschlossen haben, die Promotion oder
eine hoehere Qualifikation auf einem Gebiet der Optimierung oder der
Algorithmischen und Diskreten Mathematik anstreben und moeglichst
folgende Qualifikationen vorweisen koennen:

- Solide Kenntnisse und moeglichst praktische Erfahrung in mathematischer,
insbesondere konvexer oder gemischt-ganzzahliger Optimierung
- Beherrschung von C++ oder einer vergleichbaren Programmiersprache
- vorteilhaft sind Vorkenntnisse auf dem Gebiet der stochastischen
Optimierung oder in der Modellierung von Kommunikationsnetzen

Die Technische Universitaet Chemnitz strebt einen hohen Anteil von Frauen
in der Lehre und Forschung an. Qualifizierte Frauen sind deshalb
ausdruecklich aufgefordert, sich zu bewerben. Schwerbehinderte Menschen
werden bei gleicher Eignung bevorzugt beruecksichtigt.

Bewerbungen mit den ueblichen Unterlagen richten Sie bitte
bis zum 12.11.2010 an:

Prof. Dr. Christoph Helmberg
Technische Universitaet Chemnitz
Fakultaet fuer Mathematik
Reichenhainer Str. 39
09126 Chemnitz
Telefon: 0371 531 34122
christoph.helmberg@mathematik.tu-chemnitz.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] Professorship in Information and Communication Technology at the University of Faroe Islands

The University of the Faroe Islands invites applications for a
professorship in Information and Communication Technology (ICT).
Applicants should have professional experience related to one or more
of the following disciplines: software engineering, computer science,
computer engineering and system development.

The level of appointment will be as a full professor, associate
professor or assistant professor, depending on the qualifications of
the successful applicant.

Please see the announcement at www.nvd.fo. The funding for the
professorship is expected to be available from 1 January 2011.

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

[DMANET] Professor of Algorithms and Data Structures - University of Copenhagen

The Department of Computer Science, University of Copenhagen, seeks a
professor in algorithms and data structures. As part of the Algorithms
and Programming Languages research group, the professor is expected to
play a central role in teaching and research activities related to
algorithms and data structures at the department, including
collaboration with researchers from other areas such as programming
language technology, combinatorial optimization, high-performance
computing, data mining and machine learning. The professor is expected
to develop courses and perform relevant teaching and supervision at
the Copenhagen Master of Excellence (COME) program in Computer
Science.

Applicants should have an outstanding academic record in the
foundation of algorithms and data structures with a strong presence at
top venues such as STOC, FOCS, and SODA. The applicant should also
have a strong record for addressing more applied algorithmic problems
from other areas.

The applicant is expected to have a record of research funding from
academia and/or industry. Applicants with documented knowledge
transfer from academia (theory) to industry (practice) are
particularly welcome.

Deadline: December 1, 2010.

For more information:
http://www.offentlige-stillinger.dk/sites/cfml/kbhuni/kbhuniVis.cfm?plugin=1&englishJobs=NO&nJobNo=190957&nLangNo=1
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Saturday, October 16, 2010

[DMANET] TAMC2011 Call for Papers

CALL FOR PAPERS

TAMC 2011
8th Annual Conference on Theory and Applications of Models of Computation
May 23 -- 25, 2011, Tokyo, Japan

EMAIL: tamc2011@easychair.org
http://www.tamc2011.com/

After six annual meetings in China ('04-'09) and one in Czech
Republic ('10), TAMC2011 will be held in Japan, at the University
of Electro-Communications, approximately 10 miles southwest of
the Shinjuku district in Tokyo.

AIM AND SCOPE

TAMC aims at bringing together a wide range of researchers with interests
in computational models and their applications. The main themes of the
conference are computability, complexity, and algorithms. The topics of
interest include (but are not limited to):

- algebraic computation,
- approximation algorithms,
- automata theory,
- biological computing,
- circuit complexity,
- computability,
- computational biology,
- computational complexity,
- computational game theory,
- computational logic,
- computational geometry,
- cryptography,
- data structures,
- distributed algorithms,
- graph algorithms,
- information and randomness,
- learning theory,
- natural computation,
- network algorithms,
- neural computational models,
- online algorithms,
- parallel algorithms,
- proof complexity,
- quantum computing,
- randomized algorithms,
- streaming algorithms.

SUBMISSION GUIDELINE

Submission is through EasyChair:

https://www.easychair.org/account/signin.cgi?conf=tamc2011.

A submission must be typeset with LaTeX using the Springer-Verlag Lecture
Notes style. Its length must be no more than ten pages. A clearly marked
appendix may be added, but it will be read at the discretion of PC.
Submission of papers accepted for publication in journals is not
permitted. Nor is simultaneous submission to other conferences with
published proceedings.

PROCEEDINGS

The conference proceedings will be published as a volume in Lecture Notes
in Computer Science.

JOURNAL SPECIAL ISSUES

A special issue of selected papers from TAMC2011 in Theoretical Computer
Science is being planned. Another TAMC special issue may be published in
Mathematical Structures in Computer Science.


PLENARY SPEAKERS

Tetsuo Asano (JAIST, Japan)
Richard Lipton (Georgia Tech., USA)

PROGRAM COMMITTEE

Olaf Beyersdorff (Hannover, Germany)
Cristian Calude (Auckland, New Zealand)
Amit Chakrabarti (Hanover, USA)
Danny Chen (Notre Dame, USA)
Zhi-Zhong Chen (Tokyo, Japan)
Marek Chrobak (Riverside, USA)
Pierluigi Crescenzi (Firenze, Italy)
William Gasarch (College Park, USA)
Tero Harju (Turku, Finland)
Miki Hermann (Palesseau, France)
Sanjay Jain (Singapore, Singapore)
Ming-Yang Kao (Chicago, USA)
S Rao Kosaraju (Baltimore, USA)
Carlos Martin Vide (Tarragona, Spain)
Peter Bro Miltersen (Aarhus, Denmark)
Mitsunori Ogihara, chair (Miami, USA)
Ruediger Reischuk (Luebeck, Germany)
Christian Sohler (Dortmund, Germany)
Jun Tarui, co-chair (Tokyo, Japan)
Takeshi Tokuyama (Sendai, Japan)
Chee-Keng Yap (New York, USA)

STEERING COMMITTEE

Manindra Agrawal (Kanpur, India)
Jin-Yi Cai (Madison, USA)
S. Barry Cooper (Leeds, UK)
John Hopcroft (Ithaca, USA)
Angsheng Li (Beijing, China)

IMPORTANT DATES

Submission Deadline Jan. 10, '11
Notification of Acceptance Feb. 18, '11
Final Version Due Mar. 7, '11
Early Registration Deadline Mar. 28, '11
**********************************************************
*
* 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/
*
**********************************************************