Sunday, April 24, 2011

[DMANET] Combinatorics conference, Monash University, Melbourne, Australia, 5-9 December 2011.

The 35th Australasian Conference on Combinatorial Mathematics and
Combinatorial Computing (35ACCMCC) will be held at
Monash University, in Melbourne, Australia, 5-9 December 2011.

The webpage is http://users.monash.edu.au/~accmcc/

ACCMCC is the annual conference of the Combinatorial Mathematics
Society of Australasia. The conference covers all areas of
combinatorics in mathematics and computer science.

The following is a tentative list of invited speakers.

* Elizabeth Billington, University of Queensland, Australia
* Peter Cameron, Queen Mary University of London, UK
* Nick Cavenagh, University of Waikato, New Zealand
* Keith Edwards, University of Dundee, UK
* Tony Evans, Wright State University, USA
* Brendan McKay, Australian National University, Australia
* Patric Östergård, Aalto University, Finland
* Cheryl Praeger, University of Western Australia, Australia
* Petr Vojtěchovský, University of Denver, USA
* Bridget Webb, Open University, UK
* Herb Wilf, University of Pennsylvania, USA
* David Wood, University of Melbourne, Australia

Attendees are invited to give contributed talks. Contributed talks
will be 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.

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

Thursday, April 21, 2011

[DMANET] PhD-Algorithms-Bergen

PhD position in Algorithms at the University of Bergen, Norway

We are looking for an excellent PhD candidate (from either computer
science or mathematics) with a background in Algorithms, Complexity
and Combinatorics. The candidate must hold a M.Sc. degree or similar.
Financing is for 4 years. Preferred starting date: August-September
2011.

The working environment will be the Algorithms Research Group at the
Department of Informatics, University of Bergen. The successful
candidate will work with Prof. Fedor Fomin on "Rigorous Theory of
Preprocessing" project funded by the European Research Council (ERC)
via the Advanced Investigator Grant scheme. The goal of Preprocessing
project is the study of heuristic algorithms, mainly in the realm of
Parameterized Complexity. The research areas are Algorithms and
Complexity, in particular, fixed parameter tractability, parameterized
complexity, kernelization.

ERC finances 75% of the position and the University of Bergen 25%.
There can be teaching assistance duties (at most 25% time of the
position). However, knowledge of Norwegian is not necessary. In
Norway, a PhD position is a regular job with social benefits. Starting
salaries at salary level 48 (code 1017) on the government salary
scale; currently NOK 383.900 per year before tax.

The applicants interested in the position are encouraged to send CV,
summary of training and experience, publications (if any), and any
other supplementary materials to Fedor FOMIN by email: fomin@ii.uib.no
before May 20, 2011. For more information on the position feel free to
contact Fedor Fomin.
**********************************************************
*
* 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] RP2011: Second Call for Papers - Reachability Problems 2011, Genova, Italy

***************************************************
5th Workshop on Reachability Problems (RP'11)
(September 28-30, 2011, Genova, Italy)

Deadline for submissions: 10 May, 2011,
Springer Verlag LNCS Proceedings

http://rp11.disi.unige.it/
***************************************************

The 5th Workshop on Reachability Problems will be hosted by
DISI (Dip. di Informatica e Scienze dell'Informazione),
Universita' di Genova, Italy.

The Reachability Workshop is specifically aimed at gathering
together scholars from diverse disciplines and backgrounds
interested in reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic
- Verification

Invited Speakers:

- Krishnendu Chatterjee, IST Austria
- Bruno Courcelle, LABRI, Bordeaux
- Joost-Pieter Katoen, RWTH, Aachen
- Jean-Francois Raskin, Univerite' Libre de Bruxelles

Submissions:
Papers presenting original contributions related to
reachability problems in different computational
models and systems are being sought.
Topics of interest include (but are not limited to):
Reachability for infinite state systems, rewriting
systems; Reachability analysis in counter/ timed/
cellular/ communicating automata; Petri-Nets;
computational aspects of semigroups, groups and
rings; Reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable
reachability problems; complexity and decidability aspects;
predictability in iterative maps and new computational paradigms

Easychair submissions are open:
http://www.easychair.org/conferences/?conf=rp2011

Authors are invited to submit a draft of a full paper with
at most 12 pages (in LaTeX, formatted according to LNCS guidelines)
via the conference web page.
Proofs omitted due to space constraints must be put into an
appendix to be read by the program committee members at their discretion.
Submissions deviating from these guidelines risk rejection.
Electronic submissions should be formatted
in postscript or pdf. Simultaneous submission to other
conferences or workshops with published proceedings is not allowed.

Important Dates

Submission deadline: 10 May, 2011
Notification: 28 June, 2011
Final version: 5 July, 2011
Conference: 28-30 September, 2011

Proceedings

The Conference Proceedings will be published
as the volume of the Springer Verlag LNCS
(Lecture Notes in Computer Science) series and
distributed at the Conference. We plan also to publish
selected papers in a special issue of a high quality journal
following the regular referee procedure.

Program Commitee:

Parosh Aziz Abdulla , Uppsala
Davide Ancona , Genova
Bernard Boigelot , Liege
Olivier Bournez, Palaiseau
Cristian S. Calude , Auckland
Giorgio Delzanno , Genova
Stephane Demri , Cachan
Javier Esparza , München
Laurent Fribourg , Cachan
Vesa Halava , Turku
Juhani Karhumäki, Turku
Antonin Kucera , Brno
Alexander Kurz , Leicester
Jerome Leroux , Bordeaux
Alexei Lisitsa , Liverpool
Igor Potapov , Liverpool
Arnaud Sangnier, Paris
Hsu-Chun Yen , Taipei
Gianluigi Zavattaro , Bologna


Organizing Committee:

- Giorgio Delzanno, Genova
- Igor Potapov, Liverpool

Contacts

E-mail:delzanno@disi.unige.it,
potapov@liverpool.ac.uk
Web:http://rp11.disi.unige.it
**********************************************************
*
* 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] DNA 17 Final Call for Papers

*** DNA 17 Call for Papers ***
The Seventeenth International Conference on
DNA Computing and Molecular Programming
September 19-23, 2011
California Institute of Technology
Pasadena, California, USA

A PDF of this call for papers for printing is available on the website:
http://dna17.caltech.edu/CFP.pdf


*** CONFERENCE WEBSITE ***
For further information, please see http://dna17.caltech.edu.


*** INTRODUCTION ***
--- The Meeting ---
Research in DNA computing and molecular programming draws together
mathematics, computer science, physics, chemistry, biology, and
nanotechnology to address the analysis, design, and synthesis of
information-based molecular systems. This annual meeting is the premier
forum where scientists with diverse backgrounds come together with the
common purpose of advancing the engineering and science of biology and
chemistry from the point of view of computer science, physics, and
mathematics. Continuing this tradition, the 17th International Conference
on DNA Computing and Molecular Programming (DNA17), under the auspices of
the International Society for Nanoscale Science, Computation and
Engineering (ISNSCE), will focus on the most recent experimental and
theoretical results that promise the greatest impact.

--- Solicitation for Papers ---
Papers and poster presentations are sought in all areas that relate to
biomolecular computing using DNA and/or other molecules, including but not
restricted to:
1) algorithms and models of computation for biomolecular systems;
2) control of molecular folding and self-assembly to construct
nanostructures;
3) demonstration of switches, gates, devices, and circuits;
4) molecular motors and molecular robotics;
5) computational processes in vitro and in vivo;
6) studies of fault-tolerance and error correction;
7) synthetic biology and in vitro evolution;
8) software tools for analysis, simulation, and design;
9) applications in engineering, physics, chemistry, biology, and medicine.

--- Dates and Deadlines ---
Please note that the conference dates have been shifted from June to
September to be suitably staggered from the other ISNSCE-sponsored
conference, Foundations of Nanoscience: Self-Assembled Architectures and
Devices (FNANO). Please note that the new schedule demands that deadlines
will be *firmly enforced*. The May 2 submission deadline will not be
extended. Revised manuscripts submitted by the July 17 deadline will be
the final versions for the LNCS proceedings; there will be no additional
revisions possible after the conference.


*** INVITED SPEAKERS ***
- Vincent Danos, Computational Systems Biology, University of Edinburgh,
Edinburgh, UK
- Yamuna Krishnan, Biochemistry, Biophysics, & Bioinformatics, National
Centre for Biological Sciences, Bangalore, India
- Niles Lehman, Chemistry, Portland State University, Portland, Oregon,
USA
- Jack Lutz, Computer Science, Iowa State University, Ames, Iowa, USA
- Hao Yan, Chemistry & Biochemistry, Arizona State University,
Tempe, Arizona, USA


*** IMPORTANT DATES ***
Submission deadline (firm): May 2, 2011 before 10pm PST
Notification of acceptance: June 19, 2011
Revised manuscripts due: July 17, 2011
Conference: September 19-23, 2011
Accommodation deadline: Auguest 19, 2011


*** RELATED EVENTS ***
September 19, 2011 -- Tutorial Day: The first day of the meeting will
consist of tutorials covering important topics related to DNA computing and
molecular programming.


*** INSTRUCTIONS FOR AUTHORS ***
Electronic Submissions: All papers and abstracts should be submitted
electronically following the instructions and link at the conference web
page, http://dna17.caltech.edu. The submission site will open by April 2,
2011 and close on May 2, 2011 at 10pm Pasadena time (PST). Papers must be
submitted in PDF format. The use of LaTeX is strongly encouraged for Track
A submissions, as it will be required for the revised manuscript included
in the LNCS proceedings of accepted papers.


*** TRACKS ***
Authors may choose between three submission tracks.

--- Track A - Full Paper ---
For authors who want their full papers to be published in the conference
proceedings. Submissions will be considered for oral presentation; those
that are not accepted for oral presentation will automatically be
considered for poster presentation. Submissions should conform to the
following guidelines:

- The total length of the paper should not exceed 15 pages and should be
formatted in LaTeX for the Springer-Verlag Lecture Notes in Computer
Science (LNCS). Please follow the formatting instructions at
http://www.springer.de/comp/lncs/authors.html.

- Each paper should contain an abstract which briefly describes the primary
results and their importance.

- Selected papers will be published in the proceedings, available at the
conference and as part of the LNCS series. Submissions to Track A may not
be previously published or simultaneously submitted to another conference
or journal for publication.

--- Track B - One-Page Abstract ---
Primarily for authors submitting experimental results who plan to submit to
a journal rather than publish in the conference proceedings. (Abstracts
for work recently submitted to or published in a journal will also be
considered.) Submissions will be considered for oral presentation; those
that are not accepted for oral presentation will automatically be
considered for poster presentation. Submissions should conform to the
following guidelines:

- The total length of the abstract should not exceed 1 page (11 point type,
single spaced, 1 inch margins).

- The one-page abstract should describe the primary results and their
importance.

- Authors must include a preliminary manuscript, a thesis chapter or some
other form of supporting documentation that can be used by the program
committee to evaluate the merit of the work for oral presentation. Only the
one-page abstract will appear in the proceedings. Track B papers
unaccompanied by adequate documentation will not be eligible for oral
presentation.

--- Track C - Poster Only ---
For authors interested in presenting their work only in the poster session.
Submissions should conform to the following guidelines:

- The total length of the abstract should not exceed 1 page (11 point type,
single spaced, 1 inch margins).

- The one-page abstract should describe the primary results and their
importance.


*** STUDENT PAPER PRIZES ***
The best two papers with a student as the lead and presenting author will
be awarded travel prizes. For eligible papers, a brief recommendation
letter (such as from the student's advisor) should be emailed to
dna17@easychair.org. Recipients of the prize will be notified at the time
of acceptance. Some other student scholarships may also be available.
**********************************************************
*
* 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, April 20, 2011

[DMANET] PhD scholarships available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES (MDS)
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities will offer

several SCHOLARSHIPs

for Ph.D. Studies starting July 1st, 2011 or later.

The MDS program covers topics at the interface between algorithms,
combinatorics, geometry, probability, and optimization. The MDS faculty
consists of Susanne Albers, Helmut Alt, Stefan Felsner, Martin Groetschel,
Martin Grohe, Rolf Moehring, Guenter Rote, Martin Skutella, Tibor Szabo,
and Guenter Ziegler.

The scholarships are 1468 EUR (tax-free) per month - according to DFG
rules. They are usually granted as 2-year fellowships, extendible by a
third year.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools, regular predoc programs, etc. -
all this in a very lively Berlin discrete mathematics context, which
also includes the DFG Research Center MATHEON (http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for
the "Phase II" part of BERLIN MATHEMATICAL SCHOOL
(http://www.math-berlin.de), the joint international graduate program of
the three major Berlin universities - which has a lot to offer! Students
of the MDS program may apply to be members of the BERLIN MATHEMATICAL
SCHOOL.

Applicants for Ph.D. scholarships are expected to have a
Diploma/Master's degree or equivalent, usually in Mathematics or
Computer Science. Applications for scholarships starting in 2011
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Dr. Martin Skutella, Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 5-2
TU Berlin
D-10623 Berlin, Germany

email: martin.skutella@tu-berlin.de
http://www.math.tu-berlin.de/~skutella/
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Please send your application before May 31st, 2011.
Applications by email are welcome. If you have applied to BERLIN
MATHEMATICAL SCHOOL Phase II, then please just inform us about this -
there is no need to submit your materials again.

**********************************************************
*
* 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] ALEA @ EPIA 2011 - second call for papers

* Our apologies if you receive multiple copies of this announcement *

********************************************
ALEA @ EPIA 2011
--------> second call for papers <--------
********************************************

Artificial Life and Evolutionary Algorithms
(ALEA is a thematic track of EPIA 2011)

http://epia2011.appia.pt
http://epia2011.appia.pt/Events/ThematicTracksBAD/ALEA.aspx

October 10-13, 2011
Lisbon - Portugal

Submission deadline:
--> May 10, 2011 <--

ALEA is dedicated to the theory and applications of Artificial Life and
Evolutionary Algorithms. It has been a track of the biennial
international EPIA conferences since 2003, aiming to bring together
researchers and practitioners from different backgrounds and domains,
and providing a pleasant venue for the fruitful discussion of current
developments and applications.

-> This year ALEA will take place in Lisbon,
one of the most beautiful European capitals:
http://www.google.com/images?q=lisbon

ALEA invites contributions in all aspects related to Artificial Life and
Evolutionary Algorithms, ranging from theoretical work to innovative
applications. Topics of interest include, but are not limited to:
- Artificial Chemistries
- Artificial Immune Systems
- Classifier Systems
- Complex Networks
- Emergent Behaviours
- Evolution and Learning Dynamics
- Evolutionary Algorithms
- Evolutionary Optimization
- Evolutionary Robotics
- Genetic Programming
- Hybrid Approaches
- Multi-objective Optimization
- Origins of Life
- Parallel Evolutionary Algorithms
- Self-organizing Systems
- Swarm Intelligence

Submissions must be original and not published elsewhere. Papers should
not exceed fifteen (15) pages in length and must be formatted according
to Springer's LNCS instructions for authors. Papers must be submitted in
PDF and will not be accepted in any other format. Papers that exceed 15
pages or do not follow the LNCS guidelines risk being rejected
automatically without a review. More information and templates of the
LNCS format is available on this Springer website:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0

The submissions will be peer reviewed by at least three members of the
Programme Committee. The reviewing process is double blind, so authors
should remove names and affiliations from the submitted papers, and must
take reasonable care not to indirectly disclose their identity.
References to own work can be included in the paper, but should be
referred to in the third person.

The authors of accepted papers will have to improve their paper on the
basis of the recommendations from the reviewers and will be asked to
send a camera ready version of their manuscripts. Even though the
submissions can be made in PDF (preferable) or PS, we encourage authors
to prepare their papers in TEX or LATEX because these are more
convenient source formats for the camera ready final version. At least
one author of each accepted work must register for the conference and
present the work.

Accepted papers will be presented orally or as posters. The best
accepted papers will appear in the proceedings published by Springer in
the Lecture Notes in Artificial Intelligence (LNAI), a subseries of
LNCS. The remaining accepted papers will be published in a local
edition, both in hard-copy, CD-ROM and on the web.

Important Dates:
- Paper submission: May 10
- Acceptance notifications: June 10
- Camera-ready papers: July 1
- ALEA @ EPIA 2011: October 10-13

Programme chairs:
- Sara Silva
INESC-ID Lisboa, Portugal
http://kdbio.inesc-id.pt/~sara/
sara(at)kdbio.inesc-id.pt
- Francisco B. Pereira
Instituto Superior de Engenharia de Coimbra, Portugal
https://cisucpt.dei.uc.pt/view_member.php?id_m=127
xico(at)dei.uc.pt
- Leonardo Vanneschi
University of Milano-Bicocca, Italy
http://personal.disco.unimib.it/Vanneschi/
vanneschi(at)disco.unimib.pt

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

[DMANET] post-doctoral position in risk management

Seeking highly qualified candidates for post-doctoral position in Risk
Management at University College Cork, Ireland

STOCHASTIC CONSTRAINT PROGRAMMING FOR MINIMISING RISK

Stochastic Programming is a subfield of Operations Research that can
solve multi-stage decision problems. Constraint Programming is a
younger subfield of Artificial Intelligence aimed at deterministic
(non-stochastic) problems, with a rich modelling language and a large
family of powerful solution algorithms. Stochastic Constraint
Programming (SCP) is a recent hybrid of the two frameworks, designed
to compactly model and efficiently solve problems involving both
constraints and uncertainty. However, SCP requires further
development in order to be a useful real-world tool, as most current
solution algorithms do not scale up to large applications.

This project will develop SCP for risk management. It is part of a
project jointly funded by the Irish Research Council for Science and
Engineering Technology (IRCSET) and IBM. Three different strands will
work alongside IBM in carrying out new research to make users better
informed about risk, through a wide variety of mathematical and AI
instruments. Its overarching objective is to bring together
complementary approaches to risk assessment and delivery.

Principal Investigator: Dr S. Prestwich (s.prestwich@cs.ucc.ie)

Candidates should have a recent Ph.D. in Computer Science or
Operations Research, with strong programming skills and experience in
constraint programming and/or stochastic optimization.
**********************************************************
*
* 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] Final CfP: Massive 2011, Submssion deadline April 27.

Final Call for Papers, Submission deadline April 27, 2011.

Third Workshop on Massive Data Algorithmics
(MASSIVE 2011)

June 16, 2011
Paris, France

In connection with SoCG'11 and organized by
Center for Massive Data Algorithmics (MADALGO)

Webpage: http://www.madalgo.au.dk/massive2011


Aim and Scope

Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in
a spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly
data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means
that in general focus on algorithm efficiency is increasing. However,
the large size of the data, and/or the small size of many modern
computing devices, also means that issues such as memory hierarchy
architecture often play a crucial role in algorithm efficiency. Thus
the availability of massive data also means many new challenges for
algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a
forum for researchers from both academia and industry interested in
algorithms for massive dataset problems. The scope of the workshop
includes both fundamental algorithmic problems involving massive data,
as well as algorithms for more specialized problems in, e.g.,
graphics, databases, statistics and bioinformatics. Topics of interest
include, but are not limited to:

- I/O-efficient algorithms
- Cache-oblivious algorithms
- Memory hierarchy efficient algorithms
- Streaming algorithms
- Sublinear algorithms
- Parallel algorithms for massive data problem
- Engineering massive data algorithms

Paper submission

We invite submissions of extended abstracts (at most 10 pages not
counting references) of original research. Extended abstract should be
submitted through the EasyChair website by Wednesday April 27. Authors
will be notified about acceptance by Monday May 9, and final versions
will be due on May 30. Accepted extended abstracts will be collected
in a booklet, which will be distributed at the workshop. There will be
no formal proceedings, so work presented at the workshop can also be
(or have been) presented at other conferences. An author of each
accepted abstract is expected to give a presentation of the abstract
at the workshop.

Program committee

Pankaj Agarwal (Duke)
Lars Arge (Aarhus and MADALGO)
Mark de Berg (Eindhoven)
Guy E. Blelloch (CMU)
Gerth Stølting Brodal (Aarhus and MADALGO)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Research)
Erik Demaine (MIT and MADALGO)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT and MADALGO)
Riko Jacob (TU Munich)
Christian S. Jensen (Aarhus and MADALGO)
Ravi Kumar (Yahoo! Research)
Ian Munro (Waterloo)
S. Muthu Muthukrishnan (Google)
Mihai Pătraşcu (AT&T Research)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (KIT)
Suresh Venkatasubramanian (Utah)
Jeffrey Scott Vitter (Kansas)
Norbert Zeh (Dalhousie)

Chair: Ulrich Meyer (Frankfurt and MADALGO)

Organizing committee

Else Magård (Aarhus and MADALGO)
Gerth Stølting Brodal (Aarhus and MADALGO)
Lars Arge (Aarhus and MADALGO)
Ulrich Meyer (Frankfurt and MADALGO)

Important dates

Call for Papers: February 2011
Paper submission deadline: Wednesday April 27, 2011
Notification of acceptance: Monday May 9, 2011
Early registration deadline: May 16, 2011
Final version due: May 30, 2011
Symposium: June 16, 2011

Participation

The workshop will take place on June 16, 2011 in Paris, France,
immediately following the 27th Annual Symposium on Computational
Geometry (SoCG'11). The symposium is located at the venue of SoCG'11
at UICP in the Espace named Espace George Stephenson. Participants
should register through On-line registration site. Accomodation
information is available at the SoCG'11 venue website. All researchers
and industry people interested in massive data algorithmics are
encouraged to attend the workshop.
**********************************************************
*
* 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, April 19, 2011

[DMANET] [MobiWac 2011] Call for Paper (June 10, 2011)

==================================================================
The 9th ACM* International Symposium on Mobility Management
and Wireless Access (MobiWac 2011)
www.mobiwac.org
==================================================================

The 9th ACM* International Symposium on Mobility Management and Wireless
Access (MobiWac 2011) will be held in conjunction with MSWiM 2011 (the
14th ACM International Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems) from October 31 to November 4, 2011 at Miami
Beach, FL, USA.

The MOBIWAC series of events are intended to provide an international
forum for the discussion and presentation of original ideas, recent
results and achievements by researchers, students, and systems developers
on issues and challenges related to mobility management and wireless
access protocols.

Authors are encouraged to submit both theoretical and practical results of
significance on all aspects of wireless and mobile access technologies,
with an emphasis on mobility management and wireless access. Authors are
invited to submit full papers describing original research. Submitted
papers must neither have been published elsewhere nor currently be under
review by another conference or journal.

TOPICS OF INTEREST include, but are not limited to:

- Wireless/Mobile Access Protocols
- Wireless/Mobile Web Access
- Wireless Internet and All-IP integration
- Next Generation Wireless systems
- Mobile Broadband Wireless Access
- Pervasive Communication and Computing
- Ubiquitous and mobile access
- Wireless Applications and testbeds
- Multi-Homing and Vertical Handoff
- Multi-Channel Multi-Radio MAC / network layer management
- Channels and resources allocation algorithms
- Energy and power management algorithms
- Multi-technology switching using Software Defined Radios
- Context-aware services and applications
- Context-aware protocols and protocol architectures
- Interactive applications
- Mobile database management
- Wireless Multimedia Protocols
- Mobile and Wireless Entertainment
- Mobile Info-services
- QoS management
- Mobility Control and Management
- Localization and tracking
- Mobile/Vehicular environment access
- Wireless ad hoc and sensor networks
- Security,Trust management and Privacy issues
- Fault Tolerance solutions
- Wireless Systems' Design
- Analysis/Simulation of wireless mobile systems
- Testbeds for experimental and simulation analysis

FOR MORE INFORMATION about the conference, organizing committee,
submission instructions, and venue please see the conference
website (http://www.mobiwac.org/).

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

ORGANIZING COMMITTEE:

General Chair

Jose Rolim, University of Geneva, Switzerland

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

Paper Submission, Publication and Important Dates:

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active
in the field to ensure high quality and relevance to the Symposium. The
symposium will Have a single track for regular papers and in addition, a
separate interwoven track with short papers / posters. A paper should be
no more than 10 pages, double column, ACM style including tables and
figures. Only PDF format is accepted. All accepted papers will appear in
the Symposium proceedings published by ACM press.

- Paper registration due: June 10, 2011 (11:59PM EST)

- Submission Deadline: June 17, 2011 (11:59PM EST)

- Notification of Acceptance: July 25, 2011

- Camera Ready version due: August 10, 2011

- Speaker Author Registration deadline: September 6, 2011

- Regular Early Registration deadline: September 20, 2011


CONFIDENTIALITY: This email is intended solely for the person(s) named and
may be confidential and/or privileged. If you are not the intended
recipient, please delete it, notify us and do not copy, use, or disclose
its content. Thank you.

Towards A Sustainable Earth: Print Only When Necessary

--
Constantinos Marios Angelopoulos

Phd student
Department of Computer Engineering & Informatics
University of Patras & CTI
**********************************************************
*
* 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] New "Discrete Algorithms" section of the journal DMTCS

Announcing the formation of a new section on Discrete Algorithms in
the open-access journal Discrete Mathematics and Theoretical Computer
Science (DMTCS).

DMTCS is a high standard peer-reviewed electronic journal devoted to
rapid publication of innovative research in the fields of Discrete
Mathematics and Theoretical Computer Science with an emphasis on the
intersection of the two. It is one of the earliest open-access journal
in the fields, and is listed by ISI.

The Discrete Algorithms section covers research in all aspects of the
design and analysis of discrete algorithms. This extends also to data
structures, combinatorial structures, and lower bounds.

Topics includes: Algorithmic aspects of networks - Algorithmic game
theory - Approximation algorithms - Combinatorial optimization -
Computational biology - Distributed algorithms - Computational
geometry - Data compression - Data structures - Databases and
information retrieval - Graph algorithms - Hierarchical memories -
Mobile computing - On-line algorithms - Parallel algorithms -
Parametrized complexity - Pattern matching - Randomized algorithms -
Scheduling - Streaming algorithms

Section editors
* Therese Biedl, University of Waterloo, Canada
* Hans Bodlaender, Universiteit Utrecht, The Netherlands
* Magnus Halldorsson, Reykjavik University
* Jan Kratochvil, Charles University, Praha, Czech Republic
* Jaikumar Radhakrishnan, Tata Insititute of Fundamental Research
* Jiri Sgall, Charles University, Praha, Czech Republic
* Zsolt Tuza, Hungarian Academiy of Sciences, Hungary

The Editor-in-Chief of DMTCS is Jens Gustedt, INRIA Nancy - Grand Est.
**********************************************************
*
* 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 position in graph theory at LIAFA, Paris, France

A one-year postdoctoral position supported by the ANR grant Heredia held by
Jean-Sébastien Sereni (LIAFA, Paris) is available (http://liafa.jussieu.fr/~sereni/Heredia/).

Candidates should have a strong background in graph theory. The fields of research are
pretty open, with a preference for the areas of hereditary classes of graphs, algorithmic graph theory,
and extremal graph theory, the main areas of the grant.
The chosen candidate will join a team formed by Pierre Charbit, Louis Esperet and Nicolas Trotignon.

The candidate will also have the opportunity to collaborate with other members of LIAFA working in the area of
algorithmic graph theory. Moreover, there are opportunities to spend a part of the post-doc at G-Scop (Grenoble)
and/or LIP (ENS Lyon).

Informal inquiries as well as formal applications should be addressed to Jean-Sébastien Sereni
(Jean-Sebastien.Sereni@liafa.jussieu.fr).
The formal applications should include a CV with a list of publications and a list of
academic references.

The dates of appointments are flexible, starting from October 2011.
**********************************************************
*
* 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, April 18, 2011

[DMANET] Deadline Extension: Second Conference on Auctions, Market Mechanisms and Their Applications (AMMA 2011)

Please note that the submission deadline of the conference has been extended to April 22. The new notification date is May 30.

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

Call for Papers: The Second Conference on Auctions, Market Mechanisms and their Applications (AMMA 2011)
August 22-23, New York City, USA

www.ammaconference.org

SCOPE

The conference seeks papers devoted to issues that arise in all stages of deploying a market mechanism to solve a problem. This includes, but is not limited to, theoretical and empirical examination of questions such as:

* Is a market the right mechanism for the problem? What are the externalities involved? What are the issues with central planning?

* How should novel markets be organized? What is the "right" micro-structure for a given problem?

* What is the best way to provide incentives? Is (real) money necessary?

* Will the use of markets lead to the creation of artificial economies? What can we say about these economies?

* What new problems arise because of the special nature of these markets (e.g., from everyone wanting to use a cluster around the time of a conference deadline)?

* What protocols need to be in place for agents to participate in such markets (including everything from practical matters like integrating bidding protocols into the system to theoretical questions like incentive compatibility)?

* Is there a need for new mechanisms for specific applications (e.g., auctions used in sponsored search were never used in other settings)? If so, what properties of applications warrant such mechanisms?

In addition to more traditional academic papers, we are also interested in experiences from the real world (case studies and new applications). Below are some sample application areas, though we welcome papers in all areas of market design.

Sample areas include:

* Prediction markets
* Student-school matching
* Kidney exchanges
* Combinatorial auctions
* Content delivery networks
* Resource allocation in networks
* Sponsored search auctions
* Road pricing

PAPERS

In order to accommodate people from different disciplinary traditions, papers may be submitted in two tracks:

1. An archival track: papers will be considered for both presentation and publication in the conference proceedings. Papers submitted in the archival track must conform to the layout specifications and page limits. Proceedings will be published by Springer.

2. A non-archival track: working papers in any format will be considered for oral presentation in the conference.

Authors can choose which track they are submitting to by using the appropriate layout format. All papers should be submitted through the conference website.

IMPORTANT DATES

Full Papers due: April 22, 2011
Notification of Acceptance: May 30, 2011
Camera-ready Manuscripts due: June 15, 2011
Conference Dates: August 22-23, 2011 (NYC)

SUBMISSION INSTRUCTIONS

Please visit the Submission page on the conference website for detailed submission requirements and procedures.

STEERING COMMITTEE

Boleslaw Szymanski, Rensselaer Polytechnic Institute
Peter Coles, Harvard Business School
Vincent Conitzer, Duke University
Sanmay Das, Rensselaer Polytechnic Institute
Sebastien Lahaie, Yahoo! Research
Michael Ostrovsky, Stanford GSB
David Pennock, Yahoo! Research

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

Sunday, April 17, 2011

[DMANET] PhD positions at CTIC, Aarhus University

PhD positions at CTIC, Aarhus University

Center for the Theory of Interactive Computation (CTIC) is a Sino-Danish
research center that started operations on April 1st, 2011. The center
is a collaboration between the Computer Science Department at Aarhus
University, Denmark and ITCS, Tsinghua University, Beijing, China.
Center leaders are Professor Andrew Chi-Chih Yao, Tsinghua, and
Professor Peter Bro Miltersen, Aarhus. The focus areas of the center are
computational complexity theory, cryptography, quantum informatics, and
algorithmic game theory. See also http://ctic.au.dk/.

A number of attractive PhD grants within the focus areas is available at
the center. The successful candidates will obtain their degrees from
Aarhus University and are expected to do most of their studies there,
but also do stays at ITCS. The Aarhus University Graduate School of
Science PhD program requires between 3 and 5 years of study, depending
on the background of the candidate. The minimum requirement for applying
is a bachelor's degree. Applications should be entered at the Aarhus
Graduate School of Science (AGSoS) web interface, where PhD applicants
will also find detailed and relevant information about the application
process, deadlines, financing etc.:
http://science.au.dk/en/studies/phd-studies/. To obtain further
information before applying, please email ctic@cs.au.dk. The next
application deadline is May 1st, 2011.


**********************************************************
*
* 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, April 16, 2011

[DMANET] CFP: Extended deadline for i-Society 2011

Please note that the paper submission deadline has been extended. See
thedetails below:

Important Dates:

Paper Submission Date: Extended April 25, 2011
Short Paper (Extended Abstract or Work in Progress): Extended April 20,
2011
Notification of Paper Acceptance /Rejection: April 15-30, 2011
Notification of Short Paper (Extended Abstract or Work in Progress)
Acceptance /Rejection: April 10-25, 2011
Camera Ready Paper and Short Paper Due: May 31, 2011
Participant(s) Registration (Open): March 1, 2011
Early Bird Attendee Registration Deadline (Authors only): March 1 to May
13, 2011
Late Bird Attendee Registration Deadline (Authors only): May 13 to June
15, 2011
Late Bird Registration for Participants only: June 27, 2011
Conference Dates June: 27-29, 2011

These details are also available at
http://www.i-society.eu/Important%20Dates.html

*******************************************************************
International Conference on Information Society (i-Society 2011),
Technically Co-Sponsored by IEEE UK/RI Computer Chapter
27-29 June, 2011, London, UK
www.i-society.eu
*******************************************************************

The International Conference on Information Society (i-Society 2011)
is Technically Co-Sponsored by IEEE UK/RI Computer Chapter.
The i-Society is a global knowledge-enriched collaborative effort
that has its roots from both academia and industry. The conference
covers a wide spectrum of topics that relate to information society,
which includes technical and non-technical research areas.

The mission of i-Society 2011 conference is to provide opportunities
for collaboration of professionals and researchers to share existing
and generate new knowledge in the field of information society.
The conference encapsulates the concept of interdisciplinary science
that studies the societal and technological dimensions of knowledge
evolution in digital society. The i-Society bridges the gap
between academia and industry with regards to research collaboration
and awareness of current development in secure information management
in the digital society.

The topics in i-Society 2011 include but are not confined to the
following areas:

*New enabling technologies
- Internet technologies
- Wireless applications
- Mobile Applications
- Multimedia Applications
- Protocols and Standards
- Ubiquitous Computing
- Virtual Reality
- Human Computer Interaction
- Geographic information systems
- e-Manufacturing

*Intelligent data management
- Intelligent Agents
- Intelligent Systems
- Intelligent Organisations
- Content Development
- Data Mining
- e-Publishing and Digital Libraries
- Information Search and Retrieval
- Knowledge Management
- e-Intelligence
- Knowledge networks

*Secure Technologies
- Internet security
- Web services and performance
- Secure transactions
- Cryptography
- Payment systems
- Secure Protocols
- e-Privacy
- e-Trust
- e-Risk
- Cyber law
- Forensics
- Information assurance
- Mobile social networks
- Peer-to-peer social networks
- Sensor networks and social sensing

*e-Learning
- Collaborative Learning
- Curriculum Content Design and Development
- Delivery Systems and Environments
- Educational Systems Design
- e-Learning Organisational Issues
- Evaluation and Assessment
- Virtual Learning Environments and Issues
- Web-based Learning Communities
- e-Learning Tools
- e-Education

*e-Society
- Global Trends
- Social Inclusion
- Intellectual Property Rights
- Social Infonomics
- Computer-Mediated Communication
- Social and Organisational Aspects
- Globalisation and developmental IT
- Social Software

*e-Health
- Data Security Issues
- e-Health Policy and Practice
- e-Healthcare Strategies and Provision
- Medical Research Ethics
- Patient Privacy and Confidentiality
- e-Medicine

*e-Governance
- Democracy and the Citizen
- e-Administration
- Policy Issues
- Virtual Communities

*e-Business
- Digital Economies
- Knowledge economy
- eProcurement
- National and International Economies
- e-Business Ontologies and Models
- Digital Goods and Services
- e-Commerce Application Fields
- e-Commerce Economics
- e-Commerce Services
- Electronic Service Delivery
- e-Marketing
- Online Auctions and Technologies
- Virtual Organisations
- Teleworking
- Applied e-Business
- Electronic Data Interchange (EDI)

*e-Art
- Legal Issues
- Patents
- Enabling technologies and tools

*e-Science
- Natural sciences in digital society
- Biometrics
- Bioinformatics
- Collaborative research

*Industrial developments
- Trends in learning
- Applied research
- Cutting-edge technologies

* Research in progress
- Ongoing research from undergraduates, graduates/postgraduates and
professionals

Important Dates:

Paper Submission Date: March 31, 2011
Short Paper (Extended Abstract or Work in Progress): March 20, 2011
Notification of Paper Acceptance /Rejection: April 15, 2011
Notification of Short Paper (Extended Abstract or Work in Progress)
Acceptance /Rejection: April 10, 2011
Camera Ready Paper and Short Paper Due: April 30, 2011
Participant(s) Registration (Open): January 1, 2011
Early Bird Attendee Registration Deadline (Authors only): February 1 to
April 30, 2011
Late Bird Attendee Registration Deadline (Authors only): May 1 to June
1, 2011
Conference Dates: June 27-29, 2011

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

Friday, April 15, 2011

[DMANET] Two Ph.D. positions in Combinatorics at the University of Strathclyde

Two Ph.D. positions in Combinatorics at the University of Strathclyde

The Combinatorics Group at the University of Strathclyde is pleased to
announce two Ph.D. positions in the Department of Computer and
Information Sciences. The candidates will preferably commence studies
during September 2011 (exact starting date is negotiable). The
positions will be for three years. For more information see

http://www.jobs.ac.uk/job/ACL316/scholarships/ and
http://www.strath.ac.uk/cis/research/phdresearchopportunities/

We are looking for candidates with a degree in mathematics or computer
science who have a research interest in combinatorics. The Ph.D
candidates will be expected to take part in research projects that
concern sorting algorithms and other research specialties of the
group. In particular, this research will be part of the ongoing work
of the group on permutation statistics and patterns.

The Combinatorics Group's web site is
http://combinatorics.cis.strath.ac.uk/

For further information about the application process, please contact
enquiries@cis.strath.ac.uk. For enquiries about the combinatorics
group and its work please contact Einar Steingrimsson,
<einar.steingrimsson at cis.strath.ac.uk>, or Anders Claesson
<anders.claesson at cis.strath.ac.uk>.
**********************************************************
*
* 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: Autonomous Systems

**********************************************************
CALL FOR PAPERS
WORKSHOP AUTONOMOUS SYSTEMS
10/30/2011 - 11/03/2011
http://www.fernuni-hagen.de/kn/phdseminar11/index_en.html
**********************************************************

The 4th workshop Autonomous Systems will take place from
October 30th until November 3rd 2011 on Mallorca Island,
Spain.
For this event we are looking for unpublished papers
that deal with autonomous systems in the broadest sense.
This can be research results, industrial applications,
experience reports as well as discussions of yet unsolved
problems. All contributions will be peer reviewed by at
least 3 members of the international program committee;
accepted papers will be published in a voluem of the
Springer 'Studies in Computational Intelligence' series.

Relevant topics are:

* Theories, models and algorithms for communities
o Distributed algorithms
o Simulation models
o Evolution of cooperation in social and biologic systems
o Game theory, graph theory and cost models
o Innovative communication protocols
o Self organization and self stabilization
o Small world models and clouds
o Structure building, overlay networks, and functional separation
o Nonlinear dynamic systems, chaos theory
o Complex networks
o Decision making and decision support systems

* Technolgies
o Distributed systems and und realtime systems
o Ad-Hoc- and sensornetworks
o Security and privacy protection
o Context- and location aware applications
o Natural language processing and translation
o Peer-To-Peer-, grid-, and cloud technologies
o Software agents and adaptive systems
o Service oriented architectures
o Content management
o Semantic web
o Engineering applications of chaos theory
* Swarm Intelligence and system biology

o Swarm-based optimization techniques
o Swarm computing
o Particle swarm optimization
o Ant colony optimization
o Fish school search
o Bioinformatics
o Cognitive science
o Social evolution
o Optimization theory and methods
o Evolutionary computation
o Simulation and emulation of nature
o Multi-agent based complex systems
o Collective intelligence
o Social intelligence
o Mathematic theoretic approaches to emergence in swarms


For further information about registration and paper submission,
please refer to the workshop's homepage:

http://www.fernuni-hagen.de/kn/phdseminar11/index_en.html


IMPORTANT DATES

* 02/15/2011: Paper submission is open
* 05/15/2011: Paper submission
* 06/13/2011: Notification of acceptance
* 07/01/2011: Camera-Ready paper
* 07/01/2011: Early registration deadline
* 10/30/2011 - 11/03/2011: Workshop Autonomous Systems 2011


Kind regards,

The program committee of the workshop Autonomous Systems 2011

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

Thursday, April 14, 2011

[DMANET] Workshop on Algorithms and Data Structures for Selection, Identification and Encoding

CALL FOR PAPERS
ICALP 2011 Workshop on

ALGORITHMS AND DATA STRUCTURES FOR SELECTION,
IDENTIFICATION AND ENCODING
Group testing, compressed sensing, multi access communication and more.

July, 3, 2011, Zurich (Switzerland)
https://sites.google.com/site/icalp2011gt/


SCOPE

The workshop aims at bringing together researchers to exchange ideas and results related to the theoretical and practical aspects of group testing, compressed sensing, and combinatorial identification in a broad sense.

Papers presenting use of group testing and selection primitives in pattern matching, data structures for static membership, communication protocols, cryptographic protocols, streaming computation, bioinformatics and computational biology, compressed sensing, as well as papers focussing on theoretical aspects of combinatorial structures for identification and coding, like randomness extractors, superimposed codes, list-decodable codes, selectors, and the like are welcome.

All the above topics are open to both research and industry contributions. Papers reporting on original research unpublished elsewhere as well as surveys of important results, especially recent ones, are invited.


SUBMISSIONS:

Authors should send an extended abstract of at most 15 pages via the online submission system (easy chair) at https://www.easychair.org/account/signin.cgi?conf=icalp2011gt

Accepted papers are expected to be presented at the workshop.

IMPORTANT DATES

* Paper submission due: April 30, 2011
* Notification of acceptance: May 31, 2011
* Camera-ready copy: June 15, 2011

PROCEEDINGS and SPECIAL ISSUE
The conference proceedings will be distributed to the participants at the workshop.
A selection of the papers accepted for presentation at the workshop will be invited for a special issue of Algorithmica.

ORGANIZING COMMITTEE
Ferdinando Cicalese, University of Salerno, Italy
Ely Porat, Bar Ilan University, Israel

PROGRAM COMMITTE

Ferdinando Cicalese - University of Salerno, Italy (co-chair)
Charles J. Colbourn - Arizona State University, USA
Peter Damaschke - Chalmers University, Sweden
Avinatan Hassidim - Google inc.
Sampath Kannan - University of Pennsylvania, USA
Hung Q. Ngo - University at Buffalo, The State University of New York
Ely Porat - Bar Ilan University, Israel (co-chair)
Atri Rudra - University at Buffalo, The State University of New York, USA
Miklós Ruszinkó - MTA SZTAKI, Hungary
Milan Ružić - ITU, Denmark
Noam Shental - Open University of Israel, Israel
Martin J. Strauss - University of Michigan, USA
Ugo Vaccaro - University of Salerno, Italy

CONTACT INFORMATION:

For any further information regarding the workshop, please contact the organizers:
Ferdinando Cicalese, cicalese@dia.unisa.it
Ely Porat, porately@gmail.com

SPONSORS

Department of Computer Science, University of Salerno, Italy
Department of Computer Science, Bar Ilan University, Israel
**********************************************************
*
* 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] approx random 2011

-----------------------------------------------------------------
Call for papers

APPROX 2011 and RANDOM 2011
Aug. 17-19, 2011
Princeton University
http://cui.unige.ch/tcs/random-approx/


The 14th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2011),
and the 15th International Workshop on Randomization and Computation
(RANDOM'2011)
will be held in 17-19 August 2011 at Princeton University.
APPROX'2011 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate
solutions to computationally difficult problems, while RANDOM'2011 focus
on applications of randomness to computational
and combinatorial problems. RANDOM'2011 is the fifteenth workshop in the
series; APPROX'2011 is the fourteenth in the series.

TOPICS

Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:

APPROX

* design and analysis of approximation
* algorithms
* hardness of approximation
* small space, sub-linear time, and
* streaming algorithms
* embeddings and metric space methods
* mathematical programming methods
* combinatorial problems in graphs and
* networks
* game theory, markets, and economic
* applications
* geometric problems
* packing, covering, and scheduling
* approximate learning
* other applications

RANDOM

* design and analysis of randomized
* algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* property testing
* computational learning theory

SUBMISSIONS

Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx11
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random11
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such
an account are available at the submission servers (you may also have an
old account from a previous conference submission).
The postscript must be received by 17:00pm (PDT) of April 15 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper).
An abstract should start with the title of the paper, each author's
name, affiliation, and e-mail address, followed by a one-paragraph
summary of the results to be presented. This should then be followed by
a technical exposition of the main ideas
and techniques used to achieve these results including motivation and a
clear comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references).
If the authors believe that more details are essential to substantiate
the main claims of the paper,
they may include a clearly marked appendix that will be read at the
discretion of the program committee.

Simultaneous submission to other conferences with published proceedings
is not allowed.

PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624,
4110 and 4627 while previous proceedings of RANDOM appeared as
NCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627 and as
Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 15, 2011
Notifications: June 8, 2011
Camera ready: June 17, 2011

PROGRAM COMMITTEES

APPROX

Julia Chuzoy, Toyota Technological Institute at Chicago
Naveen Garg, IIT Delhi
Michel Goemans, MIT
Fabrizio Grandoni, University of Roma - Tor Vergata
Anupam Gupta, Carnegie Mellon University
Prahalad Harsha, Tata Institute of Fundamental Research, Mumbai
Satoru Iwata, Research Institute for Mathematical Sciences, Kyoto
Philip Klein, Brown University
Robert Krauthgammer, The Weizmann Institute of Science
Kamesh Munagala, Duke University
Zeev Nutov, The Open University of Israel
R. Ravi, Carnegie Mellon University (chair)
Guido Scheaffer, Centrum Wiskunde& Informatica
Chaitanya Swamy, University of Waterloo
Kunal Talwar, Microsoft Research Silicon Valley
Gerhard Woeginger, Eindhoven University of Technology

RANDOM

Per Austrin, University of Toronto
Nayantara Bhatnagar, Hebrew University of Jerusalem
Amin Coja-Oghlan, University of Warwick
Josep Diaz, Universitat Politecnica Catalunya
Benjamin Doerr, MPI Saarbrucken
Devdatt Dubhashi, Chalmers University
Martin Dyer, University of Leeds
Tom Friedetzky, University of Durham
Leslie Goldberg, University of Liverpool (PC chair)
Mark Jerrum, Queen Mary, University of London
Elitza Maneva, University of Barcelona
Allan Sly, Microsoft Research
Eli Upfal, Brown University
Juan Vera, Tilburg University
Osamu Watanabe, Tokyo Institute of Technology
David Zuckerman, University of Texas at Austin


PROGRAM CHAIRS

R. Ravi, Carnegie Mellon University
Leslie Goldberg, University of Liverpool

WORKSHOP CHAIRS

Jose Rolim, University of Geneva
Klaus Jansen, University of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/
**********************************************************
*
* 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, April 13, 2011

[DMANET] 2nd CFP: GA - Graph algorithms and Applications (ICALP 2011 satellite workshop)

SECOND CALL FOR PAPERS

"GA - Graph algorithms and Applications"

Satellite workshop co-located with the 38th International
Colloquium on Automata, Languages and Programming (ICALP 2011)

Sunday, July 3rd, 2011
Institute of Theoretical Computer Science, ETH Zurich, Switzerland
--------------------------------------------------------------------

GA aims to provide a forum for researchers to discuss the most
recent trends and results in graph algorithms and their
applications. One goal is to show how theoretical advances,
engineering principles and thorough experimental evaluations can help
developers build efficient, robust, and scalable applications for
domain-specific scenarios. Another goal is to extract, formalize,
and model new algorithmic graph problems from modern real-world
applications, exploring directions for future research.

The workshop is in honor of Giorgio Ausiello in the occasion of his
70th birthday.

--------------------------------------------------------------------
SCOPE

Submitted papers should consider any aspects of graph algorithms and
their applications, including but not restricted to:

Sequential, parallel, randomized, parameterized, and distributed
graph and network algorithms, I/O and cache-efficient graph
algorithms, on-line and incremental graph algorithms,
approximation algorithms for graph problems, game theoretical
concepts, graph algorithms in computational geometry, graph
algorithms in bioinformatics, graph drawing algorithms, graph
models of the Web and social networks.

We are seeking for papers presenting theoretical results and/or
computational studies. Position and survey papers as well as
papers formalizing novel interesting open problems on the workshop
topics are also welcome.

--------------------------------------------------------------------
SUBMISSION GUIDELINES

Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix. Papers must be formatted
in LaTeX. Contributions should be submitted electronically in pdf
format via the EasyChair submission system, accessible at:
http://www.easychair.org/conferences/?conf=ga20110

There will be no proceedings, but a selection of the papers accepted
for presentation at the workshop will be invited for a special issue
of Theoretical Computer Science. Indeed, because of the lack of a
proceedings, submission of work that is intended for publication
elsewhere is welcome. Such submissions should include details of
the other submission.

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

o Submission deadline: Saturday, April 30, 2011
o Notification: Friday, May 20, 2011
o Workshop: Sunday July 3rd, 2011 (ETH Zurich, Switzerland)

--------------------------------------------------------------------
PLENARY SPEAKERS

o Giuseppe F. Italiano, U. Rome "Tor Vergata"
o Kurt Mehlhorn, MPII, Saarbruecken

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

o Gianfranco Bilardi. U. Padova
o Pierluigi Crescenzi, U. Firenze
o Camil Demetrescu (co-chair), Sapienza U. Rome
o Josep Diaz, UPC Barcelona
o Giuseppe Di Battista, U. Roma III
o Giorgio Gambosi, U. Rome "Tor Vergata"
o Ludek Kucera, Charles U.
o Jan van Leeuwen, Utrecht U.
o Stefano Leonardi (co-chair), Sapienza U. Rome
o Fabrizio Luccio, U. Pisa
o Alberto Marchetti-Spaccamela (co-chair), Sapienza U. Rome
o Jaroslav Nesetril, Charles U.
o Maurice Nivat, U. Paris VII
o Vangelis Paschos, U. Paris-Dauphine
o Franco Preparata, Brown U.
o Paul Spirakis, RACTI and U. Patras
o Leen Stougie, Free U. Amsterdam and CWI
o Peter Widmayer, ETH Zurich

--------------------------------------------------------------------
LOCAL ARRANGEMENTS COMMITTEE (ICALP conference chairs)

o Michael Hoffmann, ETH Zurich
o Juraj Hromkovic, ETH Zurich
o Ueli Maurer, ETH Zurich
o Angelika Steger, ETH Zurich
o Emo Welzl, ETH Zurich
o Peter Widmayer, ETH Zurich
**********************************************************
*
* 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 Announcement: Beyond Worst-Case Analysis

Workshop Announcement: Beyond Worst-Case Analysis

September 19-21, 2011
Stanford University

This workshop will bring together researchers interested in the design
and rigorous analysis of algorithms in models that complement the
standard worst-case model, to learn about each other's research and
identify the most promising avenues for advancing the field. Topics
include, but are not limited to: smoothed analysis; planted and
semi-random models; average-case analysis; robust models of data;
novel input parameterizations and parameterized guarantees;
self-improving and prior-independent algorithms. There will be a mix
of plenary talks, regular invited talks, and rump/discussion sessions
over the 3 days.

The confirmed plenary speakers are: Avrim Blum, Bernard Chazelle,
Uri Feige, Richard Karp, Michael Mitzenmacher, Dan Spielman, Shang-Hua
Teng, and Luca Trevisan.

This workshop will be the first of several taking place during
Stanford's 2011-2012 special year on theory. Further details and
registration information will be available in June.

The relevant URL is http://theory.stanford.edu/main/specialyear.shtml
Questions about the workshop should be addressed to Tim Roughgarden
(tim@cs.stanford.edu).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************