Theory Announcements

[DMANET] Ph.D. positions in algorithms for wireless networks at Reykjavik University

2012-02-16T06:57:00.000-06:00

Two Ph.D. fellowships: "Design of Ad-Hoc Wireless Networks"
School of Computer Science, Reykjavik University

Applications are invited for two Ph.D. fellowships at the School of
Computer Science (SCS), Reykjavik University. The positions are part
of a three-year research project funded by a grant-of-excellence by
the Icelandic Research Fund, under the direction of Magnús M.
Halldórsson.

See http://www.ru.is/~mmh/Ad-Phds.htm for further details.

Aim of the project

The aim of this project is to elucidate fundamental properties of
wireless networks, broadly construed. Our focus is on general provable
properties that hold for arbitrary configurations and are independent
of situation-specific characteristics. We explore realistic models of
interference, with the aim of bridging some of the gap between
theoretical and applied research. We will also investigate practical
protocols to disseminate information in general networks.

Some of the aspects of the projects include:
• Spectrum management, including game theory and spectrum auctions,
and cognitive radio.
• Analysis of increasingly realistic models of wireless communication,
including shadowing and obstacles, mobility, and network coding.
• Installation of a comprehensive wireless testbed, and the
implementation of empirical confirmation studies.
• Resolution of fundamental open questions on wireless scheduling and
capacity, and the design of communication primitives.
• Creating and evaluating protocols for information dissemination in
combined wired and wireless networks.
• Devising practical systems and implementing applications for general networks.

The mode of operation of the project is three-pronged:
• Designing and implementing systems and kernel primitives.
• Conducting empirical studies in a wireless testbed, along with
simulations studies.
• Designing and analyzing algorithms with provable performance bounds.

Research environment

The research group consists of faculty members from three schools at
Reykjavik University and collaborators at TU Aachen and ETH Zurich.
The group includes Ýmir Vigfússon, Henning Úlfarsson and Pradipta
Mitra (SCS), Eyjólfur Ásgeirsson (School of Science and Engineering)
and Sverrir Ólafsson (School of Business and School of Science and
Engineering). The project director is Magnús M. Halldórsson (SCS). Our
primary collaborators are Berthold Vöcking (TU Aachen) and Roger
Wattenhofer (ETH Zurich); we also collaborate with other world-class
researchers in Europe, N-America, and Asia. The research group website
is http://alnet.ru.is/sinr.html.

The successful candidates will benefit from, and contribute to, the
research environment at the Icelandic Centre of Excellence in
Theoretical Computer Science (ICE-TCS). ICE-TCS has currently 14
permanent members, five postdoctoral researchers and three Ph.D.
students. For more information about ICE-TCS, its members and its
activities, seehttp://www.icetcs.ru.is/.

Qualification requirements

Applicants for the Ph.D. fellowships should have a MSc degree in
Computer Science, or closely related fields, and have a solid
background in the analysis of algorithms and a good understanding of
networking. One of the studentships is expected to be
systems-oriented, for which an experience with systems design and
implementation is essential. The other will be focused on algorithmic
analysis, for which mathematical competence is crucial.

Remuneration

Each Ph.D position provides a stipend of 250,000 ISK (roughly 1600€)
per month before taxes, for three years, starting as early as possible
and no later than September 2012.

Application details

By Friday, 29 February 2012, interested applicants should send their
CV, including a list of publications where applicable, as a PDF
document to mmh@ru.is, together with a transcript of their academic
record, a 1-2 page statement outlining their suitability for the
project and the names of two referees who can comment on the research
potential of the candidate.

We will start reviewing applications as soon as they arrive, and will
continue to accept applications until the positions are filled.
However, we strongly encourage interested applicants to send in their
applications as soon as possible.

About the School of Computer Science at Reykjavik University

The School of Computer Science at RU (http://en.ru.is/CS) has
approximately 440 students at the undergraduate, masters and doctorate
levels. The School is home to several strong research groups and the
main research areas are algorithmics, artificial intelligence,
combinatorics, concurrency theory, databases, human-computer
interaction, natural language processing, engineering software
systems, theoretical computer science and virtual environments.

The School of Computer Science at Reykjavik University has ties with
several leading foreign universities, facilitating collaboration, as
well as faculty and student exchanges. In particular, the School has a
joint M.Sc. degree in Computer Science with the University of
Camerino, Italy, and joint Ph.D. degree programs with KTH, Stockholm,
Sweden, and Eindhoven University of Technology, Holland.
Information about Ph.D. studies at the School of Computer Science is
available at http://en.ru.is/departments/school-of-computer-science/ph.d-studies/
**********************************************************
*
* 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/
*
**********************************************************

Announcement: 2nd International SAT/SMT Summer School

2012-02-16T04:01:00.000-06:00

[ Apologies for multiple copies ]

-------------------------------------------------------------------------
CALL FOR PARTICIPATION AT THE

Second International SAT/SMT Summer School
Trento, Italy, June 12-15th, 2012
http://satsmtschool2012.fbk.eu/
-------------------------------------------------------------------------

NEWS:

Registration and grant application are now open! The full details are
available at the school website (http://satsmtschool2012.fbk.eu).

Grant application deadline: 15th March 2012
Registration deadline: 6th June 2012

ABOUT:

The SAT/SMT Summer School 2012 (2nd edition) aims at providing graduate
students and researchers from universities and industry with a
comprehensive overview of the research in SAT, SMT, and their
application. The lectures cover the foundational and practical aspects
of SAT and SMT solvers, as well as their application to verification,
planning, scheduling, and optimization problems.

This second edition follows the Summer School of 2011 organized by Vijay
Ganesh at MIT, and is co-located with the SAT 2012 conference. The
school will take place in Trento, Italy, from June 12th to June 15th
2012.

The program will feature four lectures per day, with the first two days
dedicated to SAT and SMT foundations, and the last two to applications
on various domains.

List of speakers:
- Armin Biere (Johannes Kepler University, Linz, Austria)
- Leonardo de Moura (Microsoft Research Redmond, USA)
- Bruno Dutertre (SRI International, USA)
- Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany)
- John Franco (University of Cincinnati, USA)
- Silvio Ghilardi (Università di Milano, Italy)
- Patrice Godefroid (Microsoft Research Redmond, USA)
- Holger Hoos (University of British Columbia, Vancouver, Canada)
- Tomi Janhunen (Aalto University, Finland)
- Pete Manolios (Northeastern University, USA)
- Joao Marques-Silva (University College Dublin, Ireland)
- Ken McMillan (Microsoft Research Redmond, USA)
- Jussi Rintanen (Austrialian National University, Australia)
- Fabio Somenzi (University of Colorado, Boulder, USA)
- Gunnar Stålmarck (Prover Technology and Gain Sweden AB, Sweden)
- Cesare Tinelli (University of Iowa, USA)

A more detailed program is available at the school website
(http://satsmtschool2012.fbk.eu).

The school organizers,
Alberto Griggio <griggio@fbk.eu> and
Stefano Tonetta <tonettas@fbk.eu>

[DMANET] GD 2012: Preliminary Call for Papers

2012-02-16T03:06:00.001-06:00

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

Call for Papers

GD 2012
20th International Symposium on Graph Drawing

September 19-21, 2012 - Redmond, Washington, USA

http://www.gd2012.org/
===========================================================================

Graph Drawing is concerned with the visualization of graphs and networks.
It is motivated by those application domains where it is crucial to visually
analyze and interact with relational datasets. Examples of such application
domains include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
software engineering. Bridging the gap between theoretical advances and
system implementations is therefore a key factor of Graph Drawing.

The International Symposium on Graph Drawing is the main annual event in
this area. This year the conference celebrates its 20th anniversary. It
will take place on September 19-21, 2012, and will be hosted by Microsoft
Research in Redmond, Washington, USA. Researchers and practitioners working
on any aspect of graph drawing are invited to contribute papers and posters,
and participate in the graph drawing contest.

PAPERS
------

Submitted papers must describe original research of theoretical or practical
significance to graph drawing. This year, for the first time, the call for
papers is split into two distinct tracks. Each paper must be submitted in one
of the two tracks. Papers submitted to one track will not compete with papers
submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs

Track 2: Visualization systems and interfaces
---------------------------------------------

This track is mainly devoted to practical aspects of graph drawing, such as the
development of graph visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to) the following:
* Visualization of graphs and networks in application areas
(e.g., social sciences, biology, geography, software engineering, circuit
design, business intelligence)
* Software systems for graph visualization
* Interfaces for interacting with graphs
* Benchmarks and experimental analysis for graph visualization systems and
user interfaces
* Cognitive studies on graph drawing readability and user interaction

All papers must be submitted in the single-spaced LNCS style. Each submission
may be either long (up to 12 pages) or short (up to 6 pages). The claims of the
paper should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page limits,
the authors should include it in a clearly marked appendix, whose length is not
constrained.

POSTERS
-------

Submissions of posters on graph drawing and related areas are also solicited.
The poster session will provide a forum for the communication of late-breaking
research results (which may also appear elsewhere) to the graph drawing community.
Posters should be accompanied by an abstract (up to 2 pages in the single-spaced
LNCS style).

CONTEST
-------

Entertainment during the conference will be provided by the graph drawing game
contest. We call for submissions in this contest: Develop a game that is playable,
relevant to graph drawing, and fun. A team of experts will judge the relevance of
the game to graph drawing, while conference attendees, whom we invite to test and
play all games, will judge the fun factor. We will provide further details on the
conference Web site.

PUBLICATION AND AWARDS
----------------------

Accepted papers and abstracts of accepted posters will appear in the conference
proceedings, published by Springer in the series Lecture Notes in Computer Science.
Selected papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications. Best paper awards for each of the two tracks
will be given. Details will be provided on the conference Web site.

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

Paper submission deadline: June 8
Notification of paper acceptance: July 17
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 18
Symposium on Graph Drawing: September 19-21

All deadlines are 23:59 PDT and fixed. There will be no extensions.

INVITED SPEAKERS
----------------

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

Daniel Archambault, UCD, Dublin
Markus Chimani, Friedrich-Schiller-Univ., Jena
Sabine Cornelsen, University of Konstanz
Walter Didimo (co-chair), University of Perugia
David Eppstein, University of California, Irvine
Jean-Daniel Fekete, INRIA
Emden Gansner, AT&T
Seok-Hee Hong, University of Sydney
Michael Kaufmann, University of Tübingen
Stephen Kobourov, University of Arizona
Jan Kratochvil, Charles University of Prague
Marc van Kreveld, Utrecht University
Anna Lubiw, University of Waterloo
Guy Melançon, Université Bordeaux I
Yoshio Okamoto, JAIST
Maurizio Patrignani (co-chair), Roma Tre University
Nathalie Henry Riche, Microsoft Research
Ioannis G. Tollis, FORTH-ICS and Univ. of Crete
Christian Tominski, University of Rostock
Géza Tóth, Hungarian Academy of Sciences
Jarke J. van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg
Xiaoru Yuan, Peking University

ORGANIZING COMMITTEE
--------------------

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia

SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

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

GD 2012: Preliminary Call for Papers

2012-02-16T03:06:00.000-06:00

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

Call for Papers

PAPERS
------

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

Track 2: Visualization systems and interfaces
---------------------------------------------

POSTERS
-------

CONTEST
-------

PUBLICATION AND AWARDS
----------------------

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

All deadlines are 23:59 PDT and fixed. There will be no extensions.

INVITED SPEAKERS
----------------

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

ORGANIZING COMMITTEE
--------------------

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia

SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

yWorks

CFP: 8th Scandinavian Logic Symposium

2012-02-16T00:17:00.000-06:00

8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK

First Announcement and Call for Papers

The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner, Denmark, 20-21 August 2012.

After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.

As with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.

Related events:

A post-SLS tutorial day will be organized on August 22

Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL: http://hylocore.ruc.dk/aiml2012/ .

TOPICS

The scope of SLS 2012 is broad, ranging over the whole area of
mathematical and philosophical logic, and logical methods in computer science. Suitable topics
include (but are not limited to) Proof Theory and Constructivism, Model Theory (including Finite
Model Theory), Set Theory, Computability Theory, Categorical Logic, Logic and Provability,
Logic and Computer Science, Logic and Linguistics, Modal, Hybrid, Temporal and Description
Logic, Logics of Games, Dynamics and Interaction, and Philosophical Logic.

PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:

7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968

The proceedings of several of these meetings have been published in book form.

INVITED SPEAKERS

To be announced

PROGRAM COMMITTEE

Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)

Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist (Vienna)
Jouko Väänänen (Helsinki)

ORGANISING COMMITTEE

Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)

SUBMISSIONS

Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system

https://www.easychair.org/conferences/?conf=sls2012

The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.

LOCATION

Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.

ACCOMMODATION

Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.

REGISTRATION

The conference website will be found at:

http://scandinavianlogic.weebly.com/

Details concerning registration will be posted there in due course.

[DMANET] COCOON 2012: Final call for papers

2012-02-15T17:41:00.000-06:00

FINAL CALL FOR PAPERS: COCOON 2012

The 18th Annual International Computing and Combinatorics Conference
20-22 August 2012, Sydney, Australia.
http://cocoon.it.usyd.edu.au/
Contact: cocoon2012@it.usyd.edu.au

Original research papers in the areas of algorithms, theory of computation,
computational complexity, and combinatorics related to computing are
solicited. In addition to theoretical results, we are interested in submissions
that report on experimental and applied research of general algorithmic
interest. The conference proceedings will be published by Springer-Verlag
in the Lecture Notes in Computer Science series. Typical, but not exclusive,
topics of interest include:
- Algorithms and Data Structures
- Algorithmic Game Theory
- Approximation and online algorithms
- Automata, Languages, Logic, and Computability
- Combinatorics Related to Algorithms and Complexity
- Complexity Theory
- Computational Learning Theory and Knowledge Discovery
- Cryptography, Reliability and Security, and Database Theory
- Computational Biology and Bioinformatics
- Computational Algebra, Geometry, and Topology
- Graph Drawing and Information Visualization
- Graph Theory, Communication Networks, and Optimization
- Parallel and Distributed Computing

Paper Submission
Contributors are invited to submit a full paper with a maximum of 12 pages in
the Springer LNCS format including title, abstract and references. An appendix,
beyond the 12 pages, may be added and may be read at the reviewers'
discretion. Please format your paper in the Springer Lecture Notes style
according to the LNCS Author Instructions. Submitted papers must describe
work not previously published. They must not be submitted simultaneously to
another conference with refereed proceedings or to a journal. Only electronic
submission (pdf) will be allowed.

Publication
The conference proceedings will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series. After the conference, selected
papers will be published in special issues.

Awards
A best paper award and a best student paper award will be given. A paper is
eligible for the best student paper award if all authors are full-time
students at
the time of submission.

Student grants
There will be a number of student travel awards consisting in free
registration.
These awards will be granted on the merits of the applicants. Priority will be
given to students presenting a paper at the meeting.

Invited Speakers
Kamal Jain
Joseph Mitchell, Stony Brook

Important Dates
Submission deadline February 18, 2012 (by 11:59:59pm CST)
Notification of acceptance April 18, 2012
Final version due May 12, 2012
**********************************************************
*
* 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] Preliminary CFP: SustainIT 2012 - IFIP Conference on Sustainable Internet & ICT for Sustainability

2012-02-15T08:12:00.000-06:00

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

PRELIMINARY CALL FOR PAPERS

SustainIT 2012

Second IFIP Conference on
Sustainable Internet and ICT for Sustainability

http://cnd.iit.cnr.it/sustainit2012/

October 4-5, 2012
Pisa, Tuscany, Italy

Sponsored by the IFIP TC6 WG 6.3, Performance of Communication Systems

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

******* SUBMISSION DEADLINE: APRIL 16, 2012 *******

SPECIAL ISSUE of Selected Papers in COMPUTER COMMUNICATIONS
BEST PAPER AWARD

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

In the last years, the increasing social awareness about the need for containing energy consumption within sustainable rates has caught the interest of both the industrial and academic communities. In this scenario, Internet - and more generally ICT - may play a twofold role, being both a significant energy consumer and a potential actor in steering a more clever usage of energy resources.

Both aspects of the problem raise interesting scientific challenges, and require a comprehensive effort and inter-disciplinary research at all levels of abstraction. The goal of this conference is to bring together people from different research areas, and provide a forum to exchange ideas, discuss solutions, and share experiences among researchers, professionals, and application developers both from industry and academia.

Original papers addressing both theoretical and practical aspects of energy-awareness for Internet-based systems, and the design of ICT solutions for eco-sustainability are solicited. Papers of interest should point out the expected long-term benefits to eco-sustainability.

Topics of interest include but are not limited to:

- Green Internet
- Power-aware Internet applications
- Energy-efficient network architecture and protocols
- Green wireless networking
- Energy-efficient network technologies
- Cross-layer optimization for green networking
- Standards and metrics for green communications
- Energy-efficient management of network resources
- Energy efficiency in data centers
- Energy efficiency, Quality of Service, and reliability
- Algorithms for reduced power, energy and heat
- ICT for energy efficiency in buildings
- ICT for sustainable smart cities
- ICT for sustainable transports and logistics
- ICT for green mobility
- ICT for energy efficiency in industrial environments
- ICT for smart grids
- Sustainability achievements due to ICT-based optimization
- Energy consumption measurements, models, and monitoring tools
- Measurement and evaluation of the Internet sustainability
- Test-bed and prototype implementations

EDITORIAL FOLLOW-UP
------------------------------------------------------------------------
The best paper presented at the conference will receive the Best Paper Award. Papers of particular merit will be considered for a SPECIAL ISSUE in the Elsevier Journal of COMPUTER COMMUNICATIONS.

PAPER SUBMISSION
------------------------------------------------------------------------
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. Detailed submission instructions will be made available at the conference website (http://cnd.iit.cnr.it/sustainit2012/).

*************************************************************************
Submission implies the willingness of, at least, one author to register and attend the conference to present the paper. The organizers reserve the right to exclude a paper from distribution after the conference if the paper is not presented at the conference.

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

TENTATIVE DATES
------------------------------------------------------------------------
- Manuscript submission deadline: April 16, 2012
- Acceptance/Reject notification: June 30, 2012
- Camera Ready Due: July 15, 2012

CONTACTS
------------------------------------------------------------------------
For further information, please visit the conference website (http://cnd.iit.cnr.it/sustainit2012/), or send an e-mail message to <giuseppe.anastasi@iet.unipi.it>

ORGANIZING COMMITTEE
------------------------------------------------------------------------
GENERAL CO-CHAIRS
Marco Conti, IIT-CNR, Italy
Jon Crowcroft, University of Cambridge, UK

PROGRAM CO-CHAIRS
Giuseppe Anastasi, University of Pisa, Italy
Ken Christensen, University of South Florida, USA

DEMO CHAIR
Giuseppe Lo Re, University of Palermo, Italy

Ph.D. FORUM CO-CHAIRS
Franco Davoli, University of Genova, Italy
Brunilde Sanso, Ecole Polytechnique de Montreal, Canada

FINANCE AND REGISTRATION CHAIR
Marco Ortolani, University of Palermo, Italy

PUBLICATION CHAIR
Emilio Ancillotti, IIT-CNR, Italy

PUBLICITY CHAIR
Valerio Arnaboldi, IIT-CNR, Italy
Xuefeng Liu, Honk Kong Polytechnic University, China

WEB MANAGER
Maria Bucci, IIT-CNR, Italy

TECHNICAL PROGRAM COMMITTEE
TBA

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

Valerio Arnaboldi - SustainIT2012 Publicity Chair

Institute for Informatics and Telematics (IIT)
Italian National Research Council (CNR)
Via G. Moruzzi, 1 - 56124 Pisa, Italy
phone: +39 050 315 2195
email: valerio.arnaboldi@iit.cnr.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/
*
**********************************************************

CFP: TCS 2012

2012-02-15T06:13:00.000-06:00

Call for Papers:
The 7th IFIP Conference on Theoretical Computer Science 2012
September 26 - 28, Amsterdam, The Netherlands

===== General Info =====

The conference Theoretical Computer Science, which is held every two
years, either in conjunction or in the framework of the IFIP World
Computing Congress, is the meeting place of the TC1 community where
new results of computation theory are presented and more broadly experts
in theoretical computer science meet to share insights and ask questions
about the future directions of the field.

TCS Website: http://tcs.project.cwi.nl

TCS 2012 is associated with The Alan Turing Year 2012
(http://www.mathcomp.leeds.ac.uk/turing2012).

Previous conferences of this series were held in Sendai (2000), Montreal
(2002), Toulouse (2004), Santiago (2006), Milano (2008), Brisbane (2010).

===== Venue =====

TCS 2012 will be held at the Centrum Wiskunde & Informatica (CWI),
Amsterdam (http://www.cwi.nl), The Netherlands.

===== Scope and Topics =====

Algorithms, Complexity and Models of Computation, Logic, Semantics,
Specification and Verification.

===== Invited Speakers =====

Rajeev Alur
Yuri Gurevich
Jiri Wiedermann

===== Proceedings =====

Accepted papers will be published in the Lecture Notes of Computer
Science series.

===== Important Dates =====

Paper submission: May 1
Notification: June 25
Camera ready version: July 16
TCS Conference: September 26-28

===== Organisation =====

General chair:

Jos Baeten (http://www.cwi.nl/people/630)

PC co-chairs:

Tom Ball (http://research.microsoft.com/en-us/people/tball/) and
Frank de Boer (http://homepages.cwi.nl/~frb/)

PC committee:

Ahmed Bouajjani
Ana Cavalcanti
Peter Grünwald
Joseph Kiniry
Peter Mueller
David Naumann
Susanne Graf
Juraj Hromkovic
Martin Kutrib
Aart Middeldorp
Jan Juerjens
Ugo Montanari
Catuscia Palamidessi
Jeff Shallit
Jan Rutten
Davide Sangiorgi
Igor Walukiewicz
Jim Woodcock

[DMANET] Open faculty position - Mathematical Optimization - U of Cologne

2012-02-15T05:26:00.000-06:00

The University of Cologne- the Mathematical Institute at the Faculty of
Mathematics and
Natural Sciences -- invites applications for a

W3-Professorship in Applied Mathematics

to be filled by April 1, 2013.

In the context of the ongoing coordinated development in applied
mathematics the
Mathematical Institute aims at enhancing its competence in the field of
mathematical
optimization. We are looking for a candidate with outstanding
achievements in a current area
of mathematical optimization and with international reputation. In
addition, applicants are
expected to display a proven openness for interdisciplinary research and
involvement in
cooperative projects. Experience in the acquisition and execution of
third-party funded projects
is desirable.

The successful candidate is expected to participate in the teaching and
administrative duties of
the Institute. Teaching includes courses in the area of optimization and
courses for science
and economics students. In addition, we expect an active commitment to
the programs in
business mathematics.

Applications from disabled persons are welcome. Disabled persons with
equal qualification will
be given priority. Applications from women are expressly welcome. Women
with comparable
qualifications will receive particular consideration, unless another
applicant displays
compelling reasons to prefer this person.

Please send your application (CV, list of publications, teaching
experience, academic
documents, letters of appointment) to the Dean Prof. K. Schneider,
Faculty of Mathematics
and Natural Sciences, University of Cologne, Albertus-Magnus-Platz,
D-50923 Cologne,
Germany. The deadline for application isMarch 31, 2012.

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

Open faculty position - Mathematical Optimization - U of Cologne

2012-02-15T02:34:00.000-06:00

The University of Cologne- the Mathematical Institute at the Faculty of Mathematics and
Natural Sciences – invites applications for a

W3-Professorship in Applied Mathematics

to be filled by April 1, 2013.

In the context of the ongoing coordinated development in applied mathematics the
Mathematical Institute aims at enhancing its competence in the field of mathematical
optimization. We are looking for a candidate with outstanding achievements in a current area
of mathematical optimization and with international reputation. In addition, applicants are
expected to display a proven openness for interdisciplinary research and involvement in
cooperative projects. Experience in the acquisition and execution of third-party funded projects
is desirable.

The successful candidate is expected to participate in the teaching and administrative duties of
the Institute. Teaching includes courses in the area of optimization and courses for science
and economics students. In addition, we expect an active commitment to the programs in
business mathematics.

Applications from disabled persons are welcome. Disabled persons with equal qualification will
be given priority. Applications from women are expressly welcome. Women with comparable
qualifications will receive particular consideration, unless another applicant displays
compelling reasons to prefer this person.

Please send your application (CV, list of publications, teaching experience, academic
documents, letters of appointment) to the Dean Prof. K. Schneider, Faculty of Mathematics
and Natural Sciences, University of Cologne, Albertus-Magnus-Platz, D-50923 Cologne,
Germany. The deadline for application is March 31, 2012.

--  ---------------------------------------------------------------------------  Prof. Dr. Rainer Schrader  Institut fuer Informatik                | phone   : [+49] (221) 470-6030  Universitaet zu Koeln                  | fax     : [+49] (221) 470-5160  Weyertal 80                                  | e-mail :  schrader@zpr.uni-koeln.de  D - 50931 Koeln                           | url: http://www.zaik.uni-koeln.de/AFS  --------------------------------------------------------------------------

[DMANET] CFP - APPROX RANDOM 2012

2012-02-15T02:18:00.000-06:00

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

APPROX 2012 and RANDOM 2012

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012
16th Intl. Workshop on Randomization and Computation - RANDOM 2012

http://cui.unige.ch/tcs/random-approx/

Aug. 15-17, 2012

M.I.T.

Call for papers

SCOPE

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012

16th Intl. Workshop on Randomization and Computation - RANDOM 2012

The 15th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2012) and the 16th.
International Workshop on Randomization and Computation (RANDOM'2012)
will be held on 15-17 August 2012 at M.I.T.
APPROX'2012 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2012 focus on
applications of randomness to computational and combinatorial problems.
RANDOM'2012 is the sixteenth workshop in the series; APPROX'2012 is the
fifteenth 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

Submissions must be received by 17:00pm (EDT) of April 20 at:
http://cui.unige.ch/tcs/random-approx/
in order 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 LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 20, 2012
Notifications: June 8, 2012
Camera ready: June 18, 2012

PROGRAM COMMITTEES

Approx

Alexandr Andoni (Microsoft Research SVC)
Yossi Azar (Tel-Aviv University)
Shuchi Chawla (University of Wisconsin - Madison)
Anupam Gupta (Carnegie Mellon University, chair)
Sariel Har-Peled (University of Illinois at Urbana-Champaign)
Jochen Koenemann (University of Waterloo)
Amit Kumar (Indian Institute of Technology, Delhi)
Lap Chi Lau (The Chinese University of Hong Kong)
Konstantin Makarychev (IBM Watson)
Monaldo Mastrolilli (IDSIA)
Dana Moshkovitz (MIT)
Rene Sitters (Vrije Universiteit Amsterdam)
David Steurer (Microsoft Research and Cornell)
Kunal Talwar (Microsoft Research SVC)
Jan Vondrak (IBM Almaden)
Lisa Zhang (Alcatel-Lucent Bell Labs)

Random

Eli Ben-Sasson (Technion)
Andrej Bogdanov (Chinese University of Hong Kong)
Mark Braverman (Princeton)
Colin Cooper (King's College, London)
Tobias Friedrich (Saarland University / Max-Planck-Institut)
Tali Kaufman (Bar-Ilan University / Weizmann Institute of Science)
Raghu Meka (Institute for Advanced Study)
Jelani Nelson (Princeton)
Ilan Newman (University of Haifa)
Ryan O'Donnell (Carnegie Mellon University)
Konstantinos Panagiotou (Max-Planck-Institut)
Prasad Raghavendra (Georgia Tech)
Atri Rudra (University at Buffalo, SUNY)
Rocco Servedio (Columbia, chair)
Alistair Sinclair (UC Berkeley)
Emanuele Viola (Northeastern)

PROGRAM CHAIRS

APPROX
Anupam Gupta, Carnegie Mellon University

RANDOM
Rocco Servedio, Columbia University

WORKSHOP CHAIRS

Jose Rolim, U. of Geneva
Klaus Jansen, U. of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

DICE 2012 - Call for Presentations

2012-02-15T02:16:00.000-06:00

===============================================================
CALL FOR ABSTRACTS/PRESENTATIONS
DICE 2012
3rd Workshop on Developments in Implicit Complexity
Tallinn (Estonia), March 31st and April 1st, 2012

(Affiliated with ETAPS 2012)

http://dice2012.cs.unibo.it/
===============================================================

SCOPE

The area of Implicit Computational Complexity (ICC) has grown out
from several proposals to use logic and formal methods to provide
languages for complexity-bounded computation (e.g. polytime or
logspace computation). It aims at studying computational
complexity without referring to external measuring conditions or
a particular machine model, but only by considering language
restrictions or logical principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather
than descriptive methods). In this approach one relates complexity
classes to restrictions on programming paradigms (functional
programs, lambda calculi, rewriting systems), such as ramified
recurrence, weak polymorphic types, linear logic and linear types,
and interpretative measures. The two main objectives of this area
are:
• to find natural implicit characterizations of various complexity
classes of functions, thereby illuminating their nature and
importance;
• to design methods suitable for static verification of program
complexity.

Therefore ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis. The
workshop will be open to contributions on various aspects of ICC
including (but not exclusively):
• types for controlling complexity,
• logical systems for implicit computational complexity,
• linear logic,
• semantics of complexity-bounded computation,
• rewriting and termination orderings,
• interpretation-based methods for implicit complexity,
• programming languages for complexity-bounded computation,
• certification of complexity properties of programs,
• application of implicit complexity to other programming paradigms
(e.g. imperative or object-oriented languages).

The first two DICE workshops were held in 2010 in Cyprus and in 2011
in Germany, both as part of ETAPS conferences. Before that, several
meetings on this topic had already been held with success in Paris
(WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit
computational complexity).
_______________________________________________________________

SUBMISSION

Extended abstracts for presentations of up to 3 pages.

The following deadlines are strict:

• Submission (extended abstracts): February 18th, 2012;
• Notification (extended abstracts): February 28th, 2012.

Abstracts must be submitted electronically, as pdf files, at the
following page:
https://www.easychair.org/conferences/?conf=dice2012.
_______________________________________________________________

PROGRAM COMMITTEE

• Guillaume Bonfante (Nancy)
• Ugo Dal Lago (Bologna, chair)
• Marco Gaboardi (Bologna and UPenn)
• Nao Hirokawa (JAIST)
• Martin Hofmann (Munchen)
• Olivier Laurent (ENS Lyon)
• Jean-Yves Moyen (Paris Nord)
• Isabel Oitavem (Lisboa)
• German Puebla (Madrid)
• Simona Ronchi Della Rocca (Torino)
_______________________________________________________________

[DMANET] CFP:: ICIA2012- Malaysia- Kuala Terengganu

2012-02-14T14:05:00.000-06:00

Apologies in advance for multiple received copies of the CFP.

The International Conference on Informatics & Applications (ICIA2012)
University Sultan Zainal Abidin, Kuala Terengganu, Malaysia
June 3-5, 2012
http://www.sdiwc.net/icia2012/
========================================================================
The proposed conference on the above theme will be held at University
Sultan Zainal Abidin, Kuala Terengganu, Malaysia, From June 3-5, 2012
which aims to enable researchers build connections between different
digital applications.

The conference welcomes papers on the following (but not limited to)
research topics:

- Information Ethics
- Information Content Security
- Data Compression
- E-Technology
- E-Government
- E-Learning
- Cloud Computing
- Grid Computing
- Green Computing
- Access Controls
- Data Mining
- Social Search
- Computer Forensics
- Computer Security
- Peer-to-Peer Social Networks
- Information and Data Management
- Network Security
- Social Networks
- Real-Time Systems
- Internet Modeling
- Assurance of Service
- Image Processing
- Web Services Security
- Multimedia Computing
- Software Engineering
- Biometrics Technologies
- Wireless Communications
- Semantic Web, Ontologies
- Mobile Social Networks
- Distributed and Parallel Applications
- Embedded Systems and Software
- Critical Computing and Storage
- Critical Infrastructure Management
- Soft Computing Techniques
- Confidentiality Protection
- Mobile Networking, Mobility and Nomadicity
- Anti-cyberterrorism
- Ubiquitous Computing, Services and Applications
- Forensics, Recognition Technologies and Applications
- Fuzzy and Neural Network Systems
- Signal Processing, Pattern Recognition and Applications
- User Interfaces,Visualization and Modeling
- Mobile, Ad Hoc and Sensor Network Management
- Web Services Architecture, Modeling and Design
- Quality of Service, Scalability and Performance
- Self-Organizing Networks and Networked Systems
- Computational Intelligence
- Data Management in Mobile Peer-to-Peer Networks
- Data Stream Processing in Mobile/Sensor Networks
- Indexing and Query Processing for Moving Objects
- User Interfaces and Usability Issues form Mobile Applications
- Sensor Networks and Social Sensing
- XML-Based Languages
- Cryptography and Data Protection
- Information Propagation on Social Networks
- Resource and Knowledge Discovery Using Social Networks
- Computer Crime Prevention and Detection

Researchers are encouraged to submit their work electronically. All papers
will be fully refereed by a minimum of two specialized referees. Before
final acceptance, all referees comments must be considered.

Important Dates
==============

Submission Date : Apr. 1, 2012
Notification of acceptance: Apr. 15, 2012
Camera Ready submission : May 2, 2012
Registration : May 2, 2012
Conference dates : June 3-5, 2012

[DMANET] ACM Q2SWinet 2012: Call for Papers

2012-02-14T07:09:00.000-06:00

Please accept our apologies if you receive multiple copies of this CFP.

----------------------------------------------------------------------
CALL FOR PAPERS
The 8th ACM* Symposium on QoS and Security for Wireless Mobile Networks
(ACM Q2SWinet 2012)
October 21st-25th, 2012
Paphos, Cyprus
http://cnd.iit.cnr.it/q2swinet2012

Jointly held with the 15th ACM MSWiM 2012 Conference.

* ACM Pending upon Approval

**** Paper Registration Deadline --- May 30th, 2012 ****
----------------------------------------------------------------------

SCOPE AND OVERVIEW
--------------------------------
In recent years, wireless and mobile communication systems have become increasingly popular as an inexpensive and promising means for ubiquitous communications. In this scenario, the QoS provisioning and the management of network security have become crucial tasks to determine the success of future generation wireless mobile networks.This symposium calls for cutting-edge research achievements on the provisioning of QoS and Security in wireless and mobile networks. It also aims at increasing the synergy between academic and industry professionals working in this area.

Authors are encouraged to submit full papers presenting new research related to theory or practice of all aspects of Quality of Service and Security issues in mobile and wireless systems.

Topics of interest for ACM Q2SWinet 2012 include, but are not limited to:

+ Security in Wireless MANETs, VANETs, Sensor, Mesh and PCS Networks
+ Secure PHY, MAC and Routing Protocols
+ Secure Cooperation-Based Systems and Services
+ Security for Cognitive Radio Networks
+ Intrusion Detection in Wireless Ad hoc and Sensor Networks
+ Privacy, anonymity and authentication
+ Trust Establishment
+ Cooperation and Prevention of Non-cooperative Behavior
+ Incentive Aware Secure Protocol Design
+ QoS/QoE for Wireless Multimedia Networks and Systems
+ QoS/QoE for Wireless/Wired Hybrid Systems
+ QoS/QoE support and Mobility Management in Wireless Internet
+ QoS/QoE-Aware Routing for Wireless Networks
+ QoS/QoE Metrics
+ Wireless Network Survivability
+ Wireless Systems Reliability
+ Field operating tests, Performance Modeling and Simulation Techniques
+ Real-time and QoS-aware Wireless Networks

PAPER SUBMISSION AND PUBLICATION
--------------------------------
Papers should neither have been published elsewhere nor being currently under review by another conference or journal. Manuscripts are limited to 10 pages, single spacing, double column, and must strictly adhere to the ACM template format. Guidelines on paper submission and formatting are available at http://cnd.iit.cnr.it/q2swinet2012/.

Submission is managed electronically through EDAS: http://edas.info/N12037

At least one author of each accepted paper must be registered for the symposium, in order for that paper to appear in the ACM proceedings and to be scheduled for presentation. Furthermore, authors of accepted papers must guarantee that their paper will be presented at the Symposium.

IMPORTANT DATES
---------------
Paper registration: May 30th, 2012
Paper submission: June 5th, 2012
Notification: July 15th, 2012
Symposium: October 21st-25th, 2012

ORGANIZING COMMITTEE
--------------------

General Chair
Peter Mueller, IBM Zurich Research Laboratory, Switzerland

Program Committee Chairs
Jalel Ben-Othman, University of Paris 13, France
Raffaele Bruno, IIT, CNR, Italy

Program Committee (tentative)
Nael Abu-Ghazaleh, State University of New York at Binghamton, USA
Gergely Acs, INRIA, Rhone-Alpes, France
Emilio Ancillotti, IIT-CNR, Italy
Regina Araujo, Federal University of Sao Carlos, Brazil
Jalel Ben-othman, University of Versailles, France
Boldizsar Bencsath, Budapest University of Tech. and Economics, Hungary
Luciano Bononi, University of Bologna, Italy
Azzedine Boukerche, University of Ottawa, Canada
Roberto Cascella, INRIA, France
Llorenç Cerdra-Alabern, Universitat Politecnica de Catalunya, Spain
Matteo Cesana, Politecnico di Milano, Italy
Bruno Crispo, University of Trento, Italy
Roberto Di Pietro, Universita' di Roma Tre, Italy
Falko Dressler, University of Erlangen
Rosario Garroppo, University of Pisa, Italy
Fabrizio Granelli, University of Trento, Italy
Stefanos Gritzalis, University of the Aegean, Greece
Dimitrios Koutsonikolas, University at Buffalo, SUNY, USA
Albert Levi, Sabanci University, Turkey
Lynda Mokdad, Université de Paris 12, France
Peter Mueller, IBM Zurich Research Laboratory, Switzerland
Stefano Paris, University of Bergamo, Italy
Mahalingam Ramkumar, Mississippi State University, USA
Peter Reiher, UCLA, USA
Simon Pietro Romano, University of Napoli Federico II, Italy
Susana Sargento, University of Aveiro, Portugal
Ahmed Serhrouchni, ENST, France
Sabrina Sicari, University of Insubria, Italy
Vasilios Siris, Athens University of Economics and Business, Greece
Avinash Srinivasan, George Mason University, USA
Damla Turgut, University of Central Florida, USA
Giacomo Verticale, Politecnico di Milano, Italy
André Zuquete, University of Aveiro, Portugal
Albert Zomaya, The University of Sydney, Australia

Publicity Co-chairs
Victor Govindaswamy, University of Texas at Arlington, USA
Maddalena Nurchis, IIT, CNR, Italy

2nd CfP: ESSLLI 2012 Student Session

2012-02-14T05:46:00.000-06:00

** APOLOGIES FOR MULTIPLE POSTINGS**

** PLEASE DISTRIBUTE TO STUDENTS **

Second Call for Papers
ESSLLI 2012 STUDENT SESSION

Held during
The 24th European Summer School
in Logic, Language and Information

Opole, Poland, August 6-17, 2012

Deadline for submissions: March 20, 2012
http://loriweb.org/ESSLLI2012StuS/

ABOUT:

The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience.

ESSLLI 2012 will feature a wide range of foundational and advanced courses and workshops in all areas of Logic, Language, and Computation. Consult the main ESSLLI website (link below) for further information.

SPRINGER PRIZES FOR BEST PAPER AND BEST POSTER

In 2012, Springer has again continued its generous support for the Student Session by offering € 1000 in prizes. These include a a € 500 for Best Paper and € 500 for Best Poster. The prizes are awarded best on the reviews of the submission as well as the oral presentation.

INSTRUCTIONS FOR AUTHORS:

Authors must be students, i.e., may not have received the Ph.D. degree before August 2012. All submissions must be in PDF format and be submitted to the conference EasyChair website. Submissions may be singly or jointly authored. No one may submit more than one singly and one jointly authored paper.

There are two types of papers. Long papers of up to 8 pages will be considered for both oral presentation and the poster session. Short papers of up to 4 pages will be considered as submissions for the poster session.

Submissions must be anonymous, without any identifying information, and must be must be received by March 20, 2012.

More detailed guidelines regarding submission can be found on the Student Session website: http://loriweb.org/ESSLLI2012StuS/
Links to previous years' proceedings are also available there.

Please direct inquiries about submission procedures or other matters relating to the Student Session to esslli2012stus@loriweb.org.

For general inquiries about ESSLLI 2012, please consult the main ESSLLI 2012 page, http://esslli2012.pl/.

Kind regards,
The ESSLLI 2012 Students Session Organization Committee,

Rasmus K. Rendsvig (Roskilde University) (chair)
Anders Johannsen (University of Copenhagen)
Dominik Klein (Tilburg University)
Margot Colinet (Université de Paris 7)
Matthijs Westera (Universiteit van Amsterdam)
Maxim Haddad (University of Osnabrück)
Niels Beuck (Hamburg University)

2nd International Conference on Practice and Theory of Algorithms in (Computer) Systems - TAPAS 2012

2012-02-14T04:12:00.000-06:00

Subject: Call for Papers TAPAS 2012 From: ICST News <no-reply@icst.org> Reply-To: ICST News <no-reply@icst.org> Content-Type: text/plain; charset="utf8"  ============================================================================ 2nd International Conference on Practice and Theory of Algorithms in  (Computer) Systems - TAPAS 2012 3-5 December 2012 Kibbutz Ein Gedi, Dead Sea, Israel (http://www.ein-gedi.co.il/en/)  http://tapasconference.org/2012/show/home ============================================================================  HIGHLIGHTS  - The event is endorsed by the European Alliance for Innovation, a  leading community-based organisation devoted to the advancement of  innovation in the field of ICT - All accepted papers will be published by Springer and made available  through SpringerLink Digital Library, one of the world's largest  scientific libraries - Proceedings will be submitted for indexing by Google Scholar, ISI, EI  Compendex, Scopus and many more  CALL FOR PAPERS  [Important dates]  Submission deadline: 20 July, 2012 (23:59 EDT) Author notification:  3 Sept, 2012 Camera-ready submission: 17 Sept, 2012 Conference dates: 3-5 December, 2012  [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.  [Topics]  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.  [Publications]  The proceedings will be published by Springer (Lecture Notes in Computer  Science).  [Paper submission]  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.  [Conference organising committees]  General Chair: Guy Even, Israel  Local Chair: Gabriel Scalosub, Israel  TPC Co-Chairs: Guy Even, Israel Dror Rawitz, Israel  Program Commitee Members: Hanna Bast, Germany Niv Buchbinder, Israel Matthias Englert, UK Pierre Fraigniaud, France Chien-Chung Huang, Germany Giuseppe Italiano, Italy Ilan Newman, Israel Liam Roditty, Israel Christian Scheideler, Germany Baruch Schieber, USA Tami Tamir, Israel Berthold Voecking, Germany Peter Widmayer, Switzerland Christos Zaroliagis, Greece Anke van Zuylen,  Germany  Publicity Chair: Moti Medina, Israel  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  Conference Coordinator: Justina Senkus, EAI, Italy

Justina Senkus
Community Development and Events Manager

European Alliance for Innovation

Phone: (+39) 0461 408400 - extension 664
Fax: (+39) 0461 421157
Skype: justina.senkus
http://eai.eu/

[DMANET] [IEEE AOC 2012] Call for Papers - Deadline fast approching

2012-02-14T03:00:00.000-06:00

--------------------------------------------------------------------------------
CALL FOR PAPERS
Sixth IEEE WoWMoM Workshop on
Autonomic and Opportunistic Communications (AOC 2012)
June 25, 2012 - San Francisco, California, USA
http://cnd.iit.cnr.it/aoc2012/

jointly supported by the

SCAMPI project
funded by the FP7-ICT Programme under the
Future Internet Research and Experimentation (FIRE) initiative
http://www.ict-scampi.eu/

and

RECOGNITION project
funded by the FP7-ICT Programme under the
Future and Emerging Technologies (FET) initiative
http://www.recognition-project.eu/

Fast Track on Computer Communication Journal
http://www.elsevier.com/locate/comcom

**** Submission Deadline --- February 17, 2012 ****
--------------------------------------------------------------------------------

The diffusion of lightweight, powerful portable devices, also enriched with a
variety of sensing capabilities, is enabling new ways for users' communication,
and laying the foundation for realizing the ubiquitous networking idea. Acting
either as the main communication mode or as complement to existing mobile
network infrastructures, opportunistic networking can leverage the mobility of
end users and enhance their communication capabilities. The opportunistic
exploitation of extemporary contacts among the users of the network paves the
way to a number of applications but also poses new and challenging problems to
the networking research community. The AOC 2012 workshop aims at serving as a
meeting point for people working in the area and a forum for exchanging ideas,
discussing solutions, and sharing experiences among researchers, professionals,
and application developers, both from industry and academia. As with the
previous five editions of the AOC workshop series, the scope of this year's
workshop will remain on general issues related to opportunistic networking and
computing. Yet, AOC 2012 will have a primary interest in new directions of
opportunistic communications, such as service composition techniques, scenarios
of co-existence with infrastructure networks, and insights to their operation
coming from other disciplines such as game theory and cognitive psychology. The
workshop will solicit original papers addressing theoretical and practical
aspects of autonomic and opportunistic communications but also papers describing
prototype implementations and deployments.

Topics of interest for AOC 2012 include, but are not limited to:

* Routing, transport, and reliability issues
* Techniques for data dissemination and replication
* Applications and middleware support, mobile social networking applications
* Mobility models and statistical analysis of mobility traces
* Context and social awareness mechanisms and algorithms
* Co-existence of opportunistic networks with infrastructure mobile wireless
networks
* Service composition in autonomic and opportunistic networks
* Cognition-driven information processing and decision making
* Performance modelling, scaling laws, and fundamental limits for autonomic
and opportunistic communications
* Game-theoretic insights to the operation of autonomic and opportunistic
networks
* Participatory and urban sensing in autonomic and opportunistic networks
* Trust, security, and reputation
* Autonomic and opportunistic communication testbeds and prototypes,
measurement data from real experiments
* Socio-economic models for autonomic and opportunistic communications

PAPER SUBMISSION AND PUBLICATION
--------------------------------

Papers should neither have been published elsewhere nor being currently under
review by another conference or journal. Manuscripts are limited to 6 pages,
single spacing, double column, and must strictly adhere to the template
format. Guidelines on paper submission and formatting are available at
http://cnd.iit.cnr.it/aoc2012/.

Accepted papers will appear in the symposium proceedings published by IEEE. At
least one author of each accepted paper is required to register and present
his/her work at the workshop. There will be no separate registration for
workshop, but one single registration will cover both conference and workshops
participation.

Extended versions of workshop selected papers will be considered for possible
fast track publication on the Computer Communications Journal (Elsevier).

IMPORTANT DATES
---------------
Full papers due: February 17, 2012
Notification: April 4, 2012
Workshop: June 25, 2012

ORGANIZING COMMITTEE
--------------------

WORKSHOP Chairs
Merkouris Karaliopoulos, University of Athens, Greece
Chiara Boldrini, IIT-CNR, Italy

STEERING Committee
Marco Conti, IIT-CNR, Italy
Silvia Giordano, SUPSI, Switzerland
Ioannis Stavrakakis, University of Athens, Greece

PUBLICITY Chairs
Fabio Pezzoni, IIT-CNR, Italy
Pushpendra Singh, IIIT Delhi, India

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

Gergely Acs, BUTE, Hungary
Eleonora Borgia, IIT-CNR, Italy
Jian-Nong Cao, Hong Kong Polytechnic University, HK
Vania Conan, Thales, France
Serge Fdida, UPMC, Paris VI, France
Laura Galluccio, University of Catania, Italy
Nidhi Hegde, Technicolor, France
Tristan Henderson, University of St. Andrews, UK
Gunnar Karlsson, KTH, Sweden
Mohan Kumar, University of Texas at Arlington, USA
Kyunghan Lee, North Carolina State University, USA
Franck Legendre, ETH Zurich, Switzerland
Daniele Miorandi, Create-net, Italy
Refik Molva, Eurecom, France
Valtteri Niemi, Nokia, Switzerland
Katia Obraczka, University of California, Santa Cruz, USA
Konstantinos Oikonomou, Ionian University, Greece
Joerg Ott, HUT, Finland
Elena Pagani, Universita' degli Studi di Milano, Italy
Andrea Passarella, IIT-CNR, Italy
Daniele Puccinelli, SUPSI, Switzerland
Christian Rohner, Uppsala University, Sweden
Fabrizio Sestini, EU Commission
Abdullatif Shikfa, Alcatel Lucent Bell Labs, France
Thrasyvoulos Spyropoulos, EURECOM, France
Roger Whitaker, Cardiff University, UK
Hongyi Wu, University of Louisiana at Lafayette, USA
Eiko Yoneki, University of Cambridge, UK
Franco Zambonelli, University of Modena-Reggio, Italy
Xiaolan Zhang, Fordham University, USA

ICTAC'12: 2nd Call For Papers

2012-02-14T02:31:00.000-06:00

==================================================
ICTAC 2012
9th International Colloquium on Theoretical Aspects of Computing
URL: http://www.iiitb.ac.in/ictac
24 - 27 September 2012, Bangalore, India
==================================================

The Colloquium will be held at the International Institute of
Information Technology (IIIT), which is located in Electronics City of
Bangalore. It is two hours by car or taxi from Bangalore International
Airport. Bangalore is internationally known as the Silicon Valley of
India, with many hi-tech companies and research labs. Holding the
conference in the Electronics City of Bangalore gives the conference
participants valuable opportunity to discuss and network with the
software practitioners and researchers in India's Information
Technology (IT) hub. This will be further facilitated via an Industry
Day, a special feature of ICTAC 2012.

SUBMISSION DEADLINE
--------------------------------------------------
Regular and Short Paper submission deadline: 16 April 2012

BACKGROUND
-------------------------------------------------
ICTAC 2012 is the 9th International Colloquium on Theoretical Aspects
of Computing, the latest in a series founded by the International
Institute for Software Technology of the United Nations University
(UNU-IIST). ICTAC 2012 will bring together practitioners and
researchers from academia, industry and government to present research
and to exchange ideas and experience addressing challenges in both
theoretical aspects of computing and in the exploitation of theory
through methods and tools for system development. The other main
purpose is to promote cooperation in research and education between
participants and their institutions, from developing and industrial
countries, as in the mandate of the United Nations University.

TOPICS
-------------------------------------------------
The topics of the conference include, but are not limited to:
* automata theory and formal languages;
* principles and semantics of programming languages;
* logics and their applications;
* software architectures and their description languages;
* relationship between software requirements, models and code;
* software specification, refinement, verification and testing;
* model checking and theorem proving;
* formal techniques in software testing;
* models of object and component systems;
* coordination and feature interaction;
* integration of theories, formal methods and tools for
engineering computing systems;
* service-oriented architectures: models and development methods;
* models of concurrency, security, and mobility;
* theory of parallel, distributed, grid and cloud computing;
* real-time, embedded, hybrid and cyber-physical systems;
* type and category theory in computer science;
* models for learning and education;
* case studies, theories, tools and experiments of verified systems;
* domain-specific modeling and technology: examples, frameworks
and experience.

INDUSTRY DAY
-------------------------------------------------
ICTAC 2012 will feature an Industry Day, a special feature being
introduced to the ICTAC colloquium for the first time. One of the days
of the conference is planned to be marked as Industry Day. The
industry day will feature technical talks from the industry
participants. These talks will be drawn from the papers submitted and
accepted to the conference; however any such paper must have at least
one co-author from the Industry and must be clearly marked for
`Industry Day' during submission. In addition, we plan to have tool
demonstrations and posters by the companies in the exhibition
floor. Participants from academia will thus also get a chance to
mingle with the industry participants in an informal atmosphere,
thereby getting a flavor of the ongoing activities in Bangalore's IT
industry.

Industry Day Co-chairs:
* Sriram Rajamani (Microsoft Research)
* Satish Chandra (IBM Research)

KEYNOTE SPEAKERS
-------------------------------------------------
* Gernot Heiser, UNSW (for Industry Day)
* Luke Ong, Oxford
* Ganesan Ramalingam, Microsoft Research

PUBLICATION AND SUBMISSION
-------------------------------------------------
The proceedings of ICTAC 2012 will be published by Springer in the
series Lecture Notes in Computer Science (LNCS) and will be available
at the colloquium. A special issue of a journal with extended version
of selected papers from ICTAC 2012 is under negotiation. Submissions
to the colloquium must not have been published or be concurrently
considered for publication elsewhere. All submissions will be judged
on the basis of originality, contribution to the field, technical and
presentation quality, and relevance to the conference. Submissions
can be either Regular Papers or Short Papers. Short papers can
present recent or ongoing work or discuss new ideas which are at an
early stage of development and have not been thoroughly evaluated yet.
Papers should be written in English. Regular Papers should not exceed
15 pages and Short Papers should be between 4 and 8 pages in LNCS
format (see http://www.springer.de/comp/lncs/authors.html for
details).

Papers shall be submitted at
http://www.easychair.org/conferences/?conf=ictac2012
All queries should be sent to: ictac2012@iist.unu.edu

IMPORTANT DATES
-------------------------------------------------
Paper submission deadline: 16 April 2012
Paper Accept/Reject Notification: 8 June 2012
Final paper submission: 29 June 2012

PROGRAM COMMITTEE
-------------------------------------------------
* Ana Cavalcanti, University of York, UK
* Supratik Chakraborty, IIT Mumbai, India
* Satish Chandra, IBM Watson, USA
* Yifeng Chen, Peking University, China
* Meenakshi D'Souza, IIIT Bangalore, India
* Thao Dang, Verimag, France
* Frank S. deBoer, CWI, Netherlands
* Xinyu Feng, USTC, China
* John Fitzgerald, University of Newcastle, UK
* Susanne Graf, Verimag, France
* Lindsay Groves, Victoria University, New Zealand
* Zhenjiang Hu, NII, Japan
* Lei Ju, Shandong University, China
* Moonzoo Kim, KAIST, Korea
* Daniel Kroening, Oxford University, UK
* Kim G. Larsen, Aalborg University, Denmark
* Martin Leucker, TU Munich, Germany
* Zhiming Liu, UNU-IIST, Macau SAR, China
* Kamal Lodaya, Inst. of Mathematical Sciences, India
* Annabelle McIver Macquarie University, Australia
* Madhavan Mukund, Chennai Mathematical Inst., India
* Kedar Namjoshi, Bell Labs, USA
* Jun Pang, Univ. of Luxembourg, Luxembourg
* Sanjiva Prasad, IIT Delhi, India
* Geguang Pu, ECNU, China
* Zongyan Qiu, Peking University, China
* Anders P. Ravn, Aalborg University, Denmark
* Abhik Roychoudhury, National University of Singapore, Singapore (Chair)
* Diptikalyan Saha, IBM Research, India
* Augusto Sampaio, UFPE, Brazil
* Bikram Sengupta, IBM Research, India
* R.K. Shyamasundar, TIFR, India
* Sofiene Tahar, Concordia University, Canada
* Kapil Vaswani, Microsoft Research, India
* Wang Yi, Uppsala University, Sweden
* Naijun Zhan, Chinese Academy of Sciences, China
* Jianjun Zhao, Shanghai Jiao Tong University, China

ORGANISING COMMITTEE
-------------------------------------------------
* Meenakshi D'Souza, IIIT-B (General Chair)
* Jun Pang, Univ. of Luxembourg (Publicity Chair)
* Deepak D'Souza, Indian Institute of Science
* Sumesh Divakaran, IIIT-B

STEERING COMMITTEE
-------------------------------------------------
* John Fitzgerald, UK
* Martin Leucker, Germany
* Zhiming Liu, Macau SAR China (Chair)
* Tobias Nipkow, Germany
* Augusto Sampaio, Brazil
* Natarajan Shankar, USA
* Jim Woodcock, UK

ISSAC 2012 Call for Posters

2012-02-13T21:20:00.000-06:00

Please distribute (apologies for multiple postings):

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

ISSAC 2012
Call for Posters

International Symposium on Symbolic and Algebraic Computation
Grenoble, France, July 22-25, 2012
http://www.issac-conference.org/2012/

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

The International Symposium on Symbolic and Algebraic Computation
(ISSAC) is the premier conference for research in symbolic computation
and computer algebra. ISSAC 2012 is the 37th meeting in the series,
started in 1966 and held annually since 1981, in North America, Europe
and Asia. The conference presents a range of invited speakers,
tutorials, poster sessions, software demonstrations and vendor
exhibits with a centerpiece of contributed research papers.

The poster sessions at ISSAC offer a forum for researchers to present
early research results that are of interest but not yet completed. Also
posters reporting on recent work published or accepted or submitted
elsewhere are welcome. We invite authors to submit an extended abstract
in PDF format of no more than 2 pages. The abstracts will be reviewed
by the poster committee and relevant experts when needed. The review
criteria are: content, originality, style and relevance. The accepted
poster abstracts will be printed and distributed at the conference as
well as published in an upcoming issue of the ACM SIGSAM Communications
in Computer Algebra.

Important Dates
---------------

Abstract submission deadline: Saturday, April 14, 2012
Notification of acceptance/rejection: Tuesday, May 08, 2012
Final version due: Friday, May 25, 2012

Submission Instructions
-----------------------

Abstracts must not exceed 2 pages in the style of Communications in
Computer Algebra (see http://www.sigsam.org/cca/ for LaTeX files) and
shall be submitted as PDF via EasyChair:

https://www.easychair.org/conferences/?conf=issac2012posters

Conference Topics
-----------------

All areas of computer algebra and symbolic computation are of
interest. See http://www.issac-conference.org/2012/ or the call
for papers for further information.

Poster Committee
----------------

Jeremy Berthomieu (Versailles Univ., France)
Xavier Dahan (Kiûshû Univ., Japan)
Xiao-Shan Gao (Chinese Academy of Science, China)
Irena Kogan (North Carolina State Univ., USA)
Bernard Mourrain (INRIA Sophia-Antipolis, France) - Chair

[DMANET] ICALP 2012, 2nd Call for Papers

2012-02-13T18:57:00.000-06:00

ICALP 2012 - 39TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING

Call for Papers
9 - 13 July 2012, University of Warwick, UK
http://www2.warwick.ac.uk/icalp2012

* The main conference and annual meeting of the European Association
for Theoretical Computer Science (EATCS). The conference is also
one of the Alan Turing Centenary Celebration events, celebrating the
Life and Work, and Legacy of Alan Turing. The main conference will
be preceded by a series of workshops.

* Papers presenting original research on all aspects of theoretical
computer science are sought. Typical but not exclusive topics of
interest are:

Track A: Algorithms, Complexity and Games

Algorithmic Game Theory, Approximation Algorithms, Combinatorial
Optimization, Combinatorics in Computer Science, Computational
Biology, Computational Complexity, Computational Geometry,
Cryptography, Data Structures, Design and Analysis of Algorithms,
Machine Learning, Parallel, Distributed and External Memory
Computing, Randomness in Computation, Quantum Computing.

Track B: Logic, Semantics, Automata and Theory of Programming

Algebraic and Categorical Models, Automata Theory, Formal Languages,
Emerging and Non-standard Models of Computation, Databases,
Semi-Structured Data and Finite Model Theory, Principles of
Programming Languages, Logics, Formal Methods and Model Checking,
Models of Concurrent, Distributed, and Mobile Systems, Models of
Reactive, Hybrid and Stochastic Systems, Program Analysis and
Transformation, Specification, Refinement and Verification, Type
Systems and Theory, Typed Calculi.

Track C: Foundations of Networked Computation

Cloud Computing, Overlay Networks, P2P Systems; Cryptography,
Privacy,Security, Spam; Distributed and Parallel Computing;
E-commerce, Auctions; Game Theory, Incentives, Selfishness; Internet
Algorithms; Mobile and Complex Networks; Natural and Physical
Algorithms; Network Information Management; Sensor, Mesh, and Ad Hoc
Networks; Social Networks, Viral Marketing; Specification,
Semantics, Synchronization; Trust and Reputation; Web Mining and
Analysis; Web Searching and Ranking; Wireless and Optical
Communication.

* Important Dates:
Submission: February 21, 2012
Notification: April 17 2012
Final manuscript due: May 8, 2012
The conference: July 9 - 13, 2012

* Submission Guidelines
http://www2.warwick.ac.uk/icalp2012/cfp/

* Best Paper Awards
As in previous editions of ICALP, there will be best paper and best
student paper awards for each track of the conference. In order to
be eligible for a best student paper award, a paper should be
authored only by students and should be marked as such upon
submission.

* Invited Speakers
Gilles Dowek (INRIA Paris)
Alan Turing talk: David Harel (The Weizmann Institute of Science)
Kohei Honda (Queen Mary London)
Stefano Leonardi (Sapienza University of Rome)
Daniel A. Spielman (Yale)
Berthold Vöcking (RWTH Aachen)

* Satellite Workshops (http://www2.warwick.ac.uk/icalp2012/workshops):
- Applications of Parameterized Algorithms and Complexity (APAC)
- Classical Logic and Computation (CL&C)
- Realistic Models for Algorithms in Wireles Networks (WRAWN)

Job Vacancy: Professor in Management Science

2012-02-13T17:59:00.000-06:00

-------------------------------------------------------------------------------------------
JOB VACANCY: Professor / Chair in Management Science
-------------------------------------------------------------------------------------------

We seek to appoint an established professor with a track record of internationally excellent research and proven teaching skills in an area that complements or overlaps with the current interests of the Department of Management Science. We are interested in candidates with expertise in any of: information systems, operations management and operational research. A competitive salary will be paid.

The Department employs about 30 established academic staff, plus research staff. It is the lead institution for NATCOR, the National Training Centre for Doctoral Studies in OR; is the admin base for the ESPRC-funded LANCS Initiative; and collaborates closely with other departments at Lancaster in the STOR-i and HighWire Doctoral Training Centres. The further details, available at the URL below, describe the Department's current activities.

Candidates should have a relevant PhD, evidence of research leadership, a publication record that demonstrates international excellence and demonstrable ability to perform at the highest level. Members of the Department are encouraged to engage with external organisations as well as conducting academic research.

Informal enquiries to:
Professor Mike Pidd
Head of The Department of Management Science
tel: +44 (0)1524 593870
email: m.pidd@lancaster.ac.uk

To apply online and for further information, please visit the HR website http://hr-jobs.lancs.ac.uk/Vacancies.aspx, and continue to Ref:A368 (or alternatively follow the direct link: http://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=A368)

Closing Date: March 23rd.

---------------------------------------------
LANCASTER UNIVERSITY MANAGEMENT SCHOOL
---------------------------------------------
Lancaster University is approaching its 50th anniversary with a world-class reputation as a centre for excellence in teaching, scholarship and research. Currently ranked as a top 10 UK university and in the top 125 universities in the world, Lancaster continues to sustain its reputation for teaching and research excellence both nationally and internationally. Lancaster University Management School (LUMS) is a high ranking global management school with ambitious growth plans. We are consistently ranked in the top research-led schools in Europe, the most recent Financial Times Global MBA rankings placed LUMS within the top-25 business schools in the world, and LUMS has topped the UK research rankings in business and management for nearly two decades. LUMS is triple accredited (AACSB, EQUIS, AMBA), and we have excellent links with business. 95% of our research is of international standing (RAE, 2008). We are seeking to recruit world-leading researchers and teachers who wish to join our large and dynamic academic community to enhance our global reputation.

Lancaster is investing in academic posts in support of our continued research excellence, delivery of high quality programmes and development of strong international alliances. For further information about Lancaster University Management School and its constituent departments, institutes and centres, please visit our website at: http://www.lums.lancs.ac.uk/. For information on the department please visit http://www.lums.lancs.ac.uk/departments/mansci/

[DMANET] 2012 AARMS Summer School

2012-02-13T14:50:00.001-06:00

The annual AARMS Summer School will begin its second decade on Monday July
16, 2012 at Memorial University in St. John's, Newfoundland and Labrador,
Canada. This four week event is open to exceptional undergraduate
students and graduate students from Canada and elsewhere. The 2012 school
will offer two courses in algebra and two in combinatorics:

+ Darryn Bryant from the University of Queensland will deliver a course on
Combinatorial Designs and Graph Decompositions

+ Pawel Pralat from Ryerson University will deliver a course on the
Probabilistic Method and Random Graphs

+ Alberto Elduque from the University of Zaragoza, Spain, will deliver a
course in Lie Theory

+ Nicolas Andruskiewitsch from the University of Cordoba, Argentina, and
Leandro Vendramin from the University of Buenos Aires, Argentina, will
deliver a course on Hopf Algebras and Applications.

Each course will be offered as a Memorial University graduate course,
thereby facilitating transfer credit to each student's home institution.

The local expenses of all students (accommodation, meals, textbooks) will
be met in full by the School. Moreover, there are no registration or
tuition fees.

Enrollment is limited to 30 students. For details regarding how to apply
to participate, please refer to the School's webpage:
www.aarms.math.ca/summer/2012/index.html

from Bernard Chazelle: Institute for Advanced Study Summer School in Computation and Biology, July 9-20, 2012

2012-02-13T14:50:00.000-06:00

The Institute for Advanced Study summer school in Computation and Biology,
July 9-20, 2012, will explore topics at the interface of theoretical
computer science, statistical physics and quantitative biology. Organizers
are Bernard Chazelle, David Huse, and Stanislas Leibler. Information about
application procedures and a program schedule can be found on the website:
www.ias.edu/pitp. The program is intended for both PhD students and
postdocs. Application deadline: March 1, 2012.

HIIT Postdoc Call (DL February 29, 2012)

2012-02-13T08:51:00.000-06:00

Helsinki Institute for Information Technology HIIT (http://www.hiit.fi/)

invites applications for

Postdoctoral researchers

Excellent applicants in the research fields of HIIT are welcome
and the positions will be filled for three years maximum,
starting 2 May 2012, or as agreed. For more detailed information,
please see the full call text at http://www.hiit.fi/node/1465 .
The closing date of the call is February 29, 2012.

Helsinki Institute for Information Technology HIIT conducts basic and
strategic research on information technology. It is a joint research
institute of the Aalto University and the University of Helsinki.
HIIT is a leading IT institute with research ranging from fundamental
methods and technologies to novel applications and their impact on
other sciences, people and society. HIIT's key competences are in
analysis of large sets of data, probabilistic modeling of complex
phenomena, Internet architecture and technologies, mobile and
human-centric computing, and user-created media.

[DMANET] Call for Papers: VLC 2012 (August, Miami)

2012-02-13T08:39:00.000-06:00

(Apologies if you receive multiple copies.)

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

VLC 2012 CALL FOR PAPERS

2012 International Workshop on Visual Languages and Computing
in conjunction with
The 18th International Conference on Distributed Multimedia Systems
Eden Roc Renaissance, Miami Beach, USA August 9 - August 11, 2012
(URL: http://www.ksi.edu/seke/dms12.html)

Theme: Effectiveness of Visual Languages

Organized by Knowledge Systems Institute, U.S.A.

SCOPE
Visual languages mediate human and computer interaction. For some visual languages this mediation is straightforward; using a mouse to access a drop-down menu is well-known to computer users. For others, this mediation can be enriched via sketch and gesture recognition. This is made possible by advances in commodity hardware. More formal visual languages allow experts to accurately specify complex systems, such as software architecture or chemical molecules. A visual language can also encompass complex human-computer interaction such as navigating a set of semantically linked videos. Indeed, precision of semantics underlies visual languages and computation.

Aspects of visual computing are multi-faceted in goals that are to be achieved during information or language design. The following represents a short list of qualities that are of importance to the study within visual computing: efficiency, aesthetics, pleasure, emotion, engagement, immersion, collaboration, and culture. Aspects of art, engineering, and science play key roles where certain practitioners focus on design and engineering of visual interactions whereas others analyze and study these interactions (i.e., science).

The International Workshop on Visual Languages and Computing will explore these issues, and will be held in conjunction with the 2012 International Conference of Distributed Multimedia Systems (http://www.ksi.edu/seke/dms12.html).

For this year's special theme we request high-quality submissions on visual languages that increase the efficacy of various tasks, or on the effectiveness of visual languages themselves. In addition to the special theme, we continue to solicit papers on all aspects and approaches to visual languages and computing, including interactive visual computing, computer-empowered visual computing, human-empowered visual computing, transformation algorithms for visual computing, and visual languages for visual computing.

TOPICS
The following topics are of special interest:
Aesthetic Computing
Ambient Information Interaction
Automated Generation and Layout of Visualisations
Biomedical Imagery
Computer-Assisted Visual Art and Design
Fusion of Vision with Audio and Other Modalities
Gestural Computing
Human-Machine Interface Design
Human Vision Systems and Models
Parallel/Distributed/Neural Computing and Representations for Visual Information
Pictorial Databases and Information Systems
Scientific Visualization
Sketch and Gesture based design
Sketch and Gesture based interaction with data
Sketch Recognition
Software to Support the use of Visual Languages
Visual and Spatial/Temporal Reasoning
Visual Computing for Expert Communities
Visual Computing in Bioinformatics and Systems Biology
Visual Computing on Sensed Data
Visual Languages
Visual Programming
Visualization of Computational Processes

SUBMISSION OF PAPERS
Submissions that address research and development on the above and other related topics are strongly encouraged. All the submitted papers will be reviewed by the international Program Committee members. Accepted papers will be published in the Proceedings of DMS 2012. A selection of the best papers will be invited for subsequent publication in a special issue of the Journal of Visual Languages and Computing. Papers of up to six (6) IEEE double-column pages should be submitted electronically via the VLC 2012 paper submission page: http://conf.ksi.edu/vlc2012/submit/SubmitPaper.php .

IMPORTANT DATES
Paper submission due: March 31, 2012
Notification of acceptance: May 20, 2012
Camera-ready copy: June 10, 2012
Early conference registration due: June 10, 2012

GENERAL CHAIR
Levent Burak Kara, Carnegie Mellon University, USA

PROGRAM CO-CHAIRS
A. J. Delaney, University of Brighton, UK; PC co-chair
Metin Sezgin, Koc University, Turkey; PC co-chair

PUBLICITY CHAIR
J. Burton, University of Brighton, UK

PROGRAM COMMITTEE
Dorothea Blostein, Queen's University, Canada
Jeff Browne, UC Santa Barbara, USA
Alfonso F. Cardenas, University of California, USA
Gennaro Costagliola, University of Salerno, Italy
Philip Cox, Dalhousie University, Canada
Sergiu Dascalu, University of Nevada, USA
Aidan Delaney, University of Brighton, UK
Vincenzo Deufemia, University of Salerno, Italy
Filomena Ferrucci, University of Salerno, Italy
Manuel J. Fonseca, INESC-ID, Portugal
Vittorio Fuccella, University of Salerno, Italy
Joaquim A Jorge, Instituto Suoerior Tecnico, Portugal
Levent Burak Kara, Carnegie Mellon University, USA
Robert Laurini, University of Lyon, France
Ian Oliver, Nokia, Finland
Joseph J. Pfeiffer, New Mexico State University, USA
Beryl Plimmer, University of Auckland, New Zealand
Tevfik Metin Sezgin, Koc University, Turkey
Gem Stapleton, University of Brighton, UK
Stefano Valtolina, University of Milan, Italy
Giuliana Vitiello, University of Salerno, Italy

CONFERENCE LISTED BY
DBLP
INSPEC
Compendex
AllConferences.com
WikiCFP

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

Regards,

Dr Jim Burton
Lecturer in Computing
University of Brighton

___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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] Computational Optimization

2012-02-13T05:34:00.000-06:00

[Please post - apologies for multiple copies.]

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

Call for Papers

5th Workshop on Computational Optimization (WCO 2012)
Wroclaw, Poland, September 9 - 12, 2012

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2012

http://www.fedcsis.org/

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

We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:

* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc

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

Important dates:

22.04.2012 (April 22, 2012) – Full paper submission

17.06.2011 (June 17, 2012) – Notification of acceptance

8.07.2012 (July 8, 2012) – Camera-ready version of the accepted paper
and registration

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

Submission and Publication

* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Studies of Computational
Intelligence of Springer.
====================

If you have any question do not hesitate to send a mail to wco2012@fedcsis.org .

Organizing Committee

Stefka Fidanova, Bulgaria
Josef Tvrdik, Czech Republicc
Daniela Zaharie, Romania
Antonio Mucherino, France

--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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 - APPROX RANDOM 2012

2012-02-13T03:17:00.000-06:00

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

APPROX 2012 and RANDOM 2012

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012
16th Intl. Workshop on Randomization and Computation - RANDOM 2012

http://cui.unige.ch/tcs/random-approx/

Aug. 15-17, 2012

M.I.T.

Call for papers

SCOPE

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012

16th Intl. Workshop on Randomization and Computation - RANDOM 2012

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

TOPICS

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

APPROX

RANDOM

SUBMISSIONS

Submissions must be received by 17:00pm (EDT) of April 20 at:
http://cui.unige.ch/tcs/random-approx/
in order 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 LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627
and as Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 20, 2012
Notifications: June 8, 2012
Camera ready: June 18, 2012

PROGRAM COMMITTEES

Approx

Random

PROGRAM CHAIRS

APPROX
Anupam Gupta, Carnegie Mellon University

RANDOM
Rocco Servedio, Columbia University

WORKSHOP CHAIRS

Jose Rolim, U. of Geneva
Klaus Jansen, U. of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

[DMANET] Three academic posts in Royal Holloway, University of London

2012-02-12T03:16:00.000-06:00

Department of Computer Science, Royal Holloway, University of London
has advertised three positions: Professor, Reader/Senior Lecturer, and
Lecturer. Fields of interest: Software Engineering, Distributed
Systems, or an area closely related to either.

For more information, visit
http://www.rhul.ac.uk/computerscience/vacancies/home.aspx

--
Professor Gregory Z. Gutin
Deputy Head of Department
Department of Computer Science
Royal Holloway, University of London
Egham, Surrey, TW20 0EX, UK
tel: +44-1784414229; fax: +44-1784439786
web: www.cs.rhul.ac.uk/home/gutin
**********************************************************
*
* 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: AiML 2012

2012-02-11T15:11:00.000-06:00

AiML-2012: FINAL CALL FOR PAPERS

9-TH INTERNATIONAL CONFERENCE ON ADVANCES IN MODAL LOGIC
COPENHAGEN, 22-25 AUGUST, 2012

http://hylocore.ruc.dk/aiml2012.html

Advances in Modal Logic is an initiative aimed at presenting
the state of the art in modal logic and its various applications. The
initiative consists of a conference series together with volumes based on
the conferences. Information about the AiML series can be obtained at
http://www.aiml.net. AiML-2012 is the ninth conference in the series.

TOPICS
We invite submission on all aspects of modal logic, including:

- history of modal logic
- philosophy of modal logic
- applications of modal logic
- computational aspects of modal logic (complexity and decidability of
modal and temporal logics, modal and temporal logic programming,
model checking, model generation, theorem proving for modal logics)
- theoretical aspects of modal logic (algebraic/categorical perspectives
on modal logic, coalgebraic modal logic, completeness and canonicity,
correspondence and duality theory, many-dimensional modal logics,
modal fixed point logics, model theory of modal logic, proof theory
of modal logic)
- specific instances and variations of modal logic (description logics,
modal logics over non-boolean bases, dynamic logics and other process
logics, epistemic and deontic logics, modal logics for agent-based
systems, modal logic and game theory, modal logic and grammar
formalisms, provability and interpretability logics, spatial and
temporal logics, hybrid logic, intuitionistic logic, substructural
logics, computationally light fragments of all such logics)

Papers on related subjects will also be considered.

CONFERENCE LOCATION
Advances in Modal Logic 2012 will be held at
the IDA conference centre in downtown Copenhagen:

http://ida.dk/sites/moedecenter/english/Sider/EnglishForside.aspx

This is in easy walking distance from Copenhagen Central Station and a
number of reasonably priced hotels.

PAPER SUBMISSIONS
There will be two types of submissions to AiML-2012: (1) Full papers
for publication in the proceedings and presentation at the
conference. (2) Abstracts for short presentation only. Both types of
papers should be submitted electronically using the EasyChair submission
page at

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

At least one author of each accepted paper of abstract must register for,
and attend, the conference to present his or her work.

(1) FULL PAPERS. Authors are invited to submit, for presentation at the conference
and publication in the proceedings, full papers reporting on original research
and not submitted elsewhere. The proceedings of AiML'2012 will be published
by College Publications (http://www.collegepublications.co.uk) in a volume
to be made available at the conference. The submissions should be at
most 15 pages, with an optional technical appendix of up to 5 pages, together
with a plain-text abstract of 100-200 words. The submissions must be typeset in
LaTeX, using a style file and template that will be provided on the AiML'2012
website.

(2) ABSTRACTS. These should be at most 5 pages. They may describe preliminary
results, work in progress etc., and will be subject to light reviewing. The
accepted abstracts will be made available at the conference, and the authors will
have the opportunity to make short presentations (of up to 15 minutes) on
them.

SPECIAL SESSION ON HYBRID LOGIC. Hybrid logic is an extension of modal logic
allowing to refer explicitly to states of the model in the syntax of formulas.
There will be a special session of AiML devoted to papers on hybrid logic.
The scope of the special session is standard hybrid-logical machinery like
nominals, satisfaction operators, and the downarrow binder, but also other
extensions of modal logic can be considered.

SPECIAL SESSION IN HONOUR OF LARISA MAKSIMOVA. There will be a
special session of AiML devoted to papers and talks in honour of Larisa
Maksimova, in recognition of her many outstanding contributions to modal
logic.

SPECIAL SESSION ON MODALITIES FOR TYPES. Recent years have witnessed
significant growth of interest in constructive type-theoretical modalities, in particular
modalities ensuring productivity and type safety of (co-)recursive definitions in
reactive programming. Some earlier examples include the use of modalities for staged
computation, metaprogramming or in computational lambda-calculus. In order to boost
interaction between programming, type-theoretical and modal communities, AiML 2012
will host a special session on these topics. Papers for this session should be
submitted to the EasyChair site along with others.

Papers for the special sessions should be submitted to the EasyChair site along with
others.

INVITED SPEAKERS
Lev Beklemishev (Moscow State University)
Johan van Benthem (University of Amsterdam and Stanford University)
Lars Birkedal (IT University of Copenhagen, Denmark)
Patrick Blackburn (Roskilde University)
Balder ten Cate, (UC Santa Cruz)
Larisa Maksimova (Novosibirsk State University)

PROGRAMME COMMITTEE
Carlos Areces (FaMAF, Universitad Nacional de Cordoba, Argentina)
Philippe Balbiani (IRIT, Toulouse, France)
Lev Beklemishev (Moscow State University, Russia)
Guram Bezhanishvili (New Mexico State University, USA)
Nick Bezhanishvili (Imperial College London, UK)
Patrick Blackburn (Roskilde University, Denmark)
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)
Giovanna Corsi (Università di Bologna, Italy)
Giovanna D'Agostino (Università di Udine, Italy)
Stephane Demri (LSV, ENS Cachan, France)
Melvin Fitting (Lehman College, CUNY, USA)
Robert Goldblatt (Victoria University of Wellington, New Zealand)
Valentin Goranko (Technical University of Denmark)
Rajeev Gore (Australian National University, Australia)
Andreas Herzig (IRIT, Toulouse, France)
Ian Hodkinson (Imperial College London, UK)
Wiebe van der Hoek (University of Liverpool, UK)
Rosalie Iemhoff (University of Utrecht, The Netherlands)
Alexander Kurz (University of Leicester, UK)
Tadeusz Litak (University of Leicester, UK)
Hiroakira Ono (Japan Advanced Institute of Science and Technology)
Martin Otto (Technical University of Darmstadt, Germany)
Alessandra Palmigiano (ILLC, University of Amsterdam, The Netherlands)
Renate Schmidt (University of Manchester, UK)
Lutz Schröder (DFKI GmbH and University of Bremen, Germany)
Valentin Shehtman (Moscow State University, Russia)
Dimiter Vakarelov (Sofia University, Bulgaria)
Yde Venema (ILLC, University of Amsterdam, The Netherlands)
Heinrich Wansing (Ruhr University Bochum, Germany)
Frank Wolter (University of Liverpool, UK)
Michael Zakharyaschev (Birkbeck College, London, UK)

PROGRAMME COMMITTEE CO-CHAIRS
Silvio Ghilardi (Università degli Studi di Milano, Italy)
Lawrence Moss (Indiana University, USA)

ORGANIZING COMMITTEE CO-CHAIRS
Thomas Bolander (Technical University of Denmark)
Torben Brauner (Roskilde University, Denmark)

IMPORTANT DATES
Full papers submission deadline: 30 March 2012
Full papers acceptance notification: 18 May 2012
Short presentations submission deadline: 1 June, 2012
Short presentations acceptance notification: 18 June, 2012
Final version of full papers and abstracts due: 15 June 2012
Conference: 22-25 August, 2012.

FURTHER INFORMATION. Please see http://hylocore.ruc.dk/aiml2012/

ENQUIRIES. E-mail enquiries should be directed respectively to
the PC co-chairs, sent to aiml2012@easychair.org

[ISBRA-L] Full Professor in Bioinformatics

2012-02-10T11:12:00.000-06:00

The Department of Computer Science at Georgia State University invites
applications for an anticipated position of Full Professor in the
bioinformatics area beginning Fall Semester 2012, pending budgetary
approval. Earned Ph.D. in Computer Science or a related discipline is
required. An offer of employment will be conditional on background
verification.

Prospective candidates should demonstrate ability to bring national and
international recognition to the department as a center of excellence
for bioinformatics research and education. The hired scholar is expected
to bring in major extramural funding, mentor junior faculty, recruit
top-quality Ph.D. students, and foster interdisciplinary collaborations
among faculty in various departments in GSU.

This position is part of a university-wide initiative
<http://www.gsu.edu/secondcentury> that is seeking to hire excellent
faculty in several interdisciplinary areas. Prospective candidates
should demonstrate ability to bring national and international
recognition to the department. The hired applicant is expected to foster
interdisciplinary research collaborations among faculty in various
departments in GSU.

Georgia State University, founded in 1913, is a Carnegie
Doctoral/Research Extensive university. Located in the heart of downtown
Atlanta, this major research university has an enrollment of more than
30,000 undergraduate and graduate students in six colleges. Georgia
State is the second-largest university in the state, with students
coming from every county in Georgia, every state in the nation, and from
over 145 countries. Georgia State University is currently embarking on a
record $1 billion campus expansion. The Computer Science Department
offers programs leading to the B.S., M.S., and Ph.D. degrees in computer
science. Currently, 20 out of more than 60 Ph.D. students are involved
in bioinformatics research. They are supervised by 10 faculty members
fully or substantially involved in bioinformatics research through
collaboration with Computer Science and Biology faculty. Departmental
computing facilities for research and instruction include a departmental
network of PCs, Unix/Linux workstations, two interconnected Beowulf
clusters, and a 24-processor supercomputer. The department's faculty
attracts substantial funding from many federal agencies, including five
NSF CAREER Awards.

Applicants should send letter of interest, C.V., and three letters of
recommendation to:

Dr. Yi Pan, Chair
Department of Computer Science
Georgia State University
34 Peachtree Street, Suite 1450
Atlanta, Georgia 30303

_______________________________________________
To modify subscription preferences or unsubscribe from the ISBRA-L mailing list visit http://dna.engr.uconn.edu/cgi-bin/mailman/options/isbra-l/theorynt%40listserv.nodak.edu

[DMANET] Two Ph.D. positions in algorithms and networking at Reykjavik University

2012-02-10T10:12:00.000-06:00

Two Ph.D. fellowships: "Design of Ad-Hoc Wireless Networks"
School of Computer Science, Reykjavik University

Aim of the project

Research environment

Qualification requirements

Remuneration

Each Ph.D position provides a stipend of 250,000 ISK (roughly 1600€)
per month before taxes, for three years, starting as early as possible
and no later than September 2012.

Application details

By Friday, 25 February 2012, interested applicants should send their
CV, including a list of publications where applicable, as a PDF
document to mmh@ru.is, together with a transcript of their academic
record, a 1-2 page statement outlining their suitability for the
project and the names of two referees who can comment on the research
potential of the candidate.

About the School of Computer Science at Reykjavik University

The School of Computer Science at Reykjavik University has ties with
several leading foreign universities, facilitating collaboration, as
well as faculty and student exchanges. In particular, the School has a
joint M.Sc. degree in Computer Science with the University of
Camerino, Italy, and joint Ph.D. degree programs with KTH, Stockholm,
Sweden, and Eindhoven University of Technology, Holland.
Information about Ph.D. studies at the School of Computer Science is
available at
http://en.ru.is/departments/school-of-computer-science/ph.d-studies/
**********************************************************
*
* 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 - WiNMee 2012 - DEADLINE APPROACHING (15 February 2012)

2012-02-10T08:30:00.000-06:00

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

CALL FOR PAPERS

The 8th International Workshop on Wireless Network Measurements (WiNMee)
WiNMee 2012
To be held in conjunction with WiOpt 2012
May 18th, 2012, Paderborn, Germany
http://wi-opt.cs.upb.de/winmee/home.htm

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

IMPORTANT DATES
-------------------------------------------
Submission deadline: February 15, 2012
Notification of acceptance: March 9, 2012
Camera-ready paper due: March 30, 2012
Workshop date: May 18, 2012
-------------------------------------------

The rise in wireless technologies for both local and wide-area networking, such
as ZigBee, Wi-Fi, WiMAX, 3G and LTE, indicates that the Internet is becoming
increasingly wireless. Accurate measurements of practical wireless deployments
are vital for researchers to evaluate the real-world performance of proposed
solutions. In addition to better understanding of systems, experimental wireless
network measurements allow for better analytical and simulation models which are
often limited by simplified protocol and wireless channel models. As a
consequence, the need for experimental wireless network measurements has gained
wide recognition in the wireless networking research community. This workshop
continues the successful WiNMee series, begun at WiOpt in 2005, and is intended
to bring together researchers in the field of experimental wireless networking
and serve as a forum for discussing advances and challenges in experimental
wireless network measurements.

We seek novel papers that advance the understanding of wireless networks through
testbed measurements or field experiments. Topics of interest include, but are
not limited to the following:

- Experimentations and measurements of wireless networks:
* Experience and measurements from building, designing and/or operating
wireless networks (including location and energy consumption)
* Measurement and characterization of mobile network (e.g., traffic, usage
and mobility patterns)
* Experimental validation of network simulation and mobility models in
actual wireless environments
* Measurements-driven models and simulations of wireless networks
operations
* Measurements-based network management and troubleshooting
* Large-scale or federated test-bed measurements
* Home networking measurements
- Techniques for wireless networks measurements:
* Techniques for improving the repeatability of tests, simplifying
experiment setup and reconfiguration
* Techniques for validating the results obtained in wireless testbeds
* Techniques for measuring heterogeneous wireless networks
* Techniques for collecting, archiving, anonymising and sharing wireless
measurement data
* Techniques and experimental results on performance measurements of
cognitive radio systems
* Software tools for building and/or managing wireless test-beds
(e.g., wireless link emulation)
* Spectrum utilization measurements techniques in spectrum sharing and
cognitive radio networks

The workshop seeks novel, previously unpublished papers, which are not currently
under review by another conference or journal. All submissions should be written
in English with a maximum paper length of six printed pages (IEEE conference
double column format, 10pt) including figures without incurring additional page
charges (maximum 1 additional page with over-length page charge if accepted).
The submitted manuscript should include a brief abstract of up to 150 words. The
submission will be handled via EDAS (http://edas.info//N11509). Only PDF files
are acceptable. The accepted papers will be published in the conference
proceedings and will be available via the IEEE Xplore website.

KEYNOTE SPEAKERS:
- Prof. Douglas Leith, Hamilton Institute
- Dr. Nico Bayer, Telekom Innovation Labs

ORGANIZING COMMITTEE:

Workshop Chairs:
- Keivan Navaie (University of LEEDS, UK)
- Cigdem Sengul (Telekom Innovation Labs, Germany)
- Daniele Miorandi (CREATE-NET, Italy)

Publicity Chair:
- Emilio Ancillotti (CNR, Italy)

Web Chair:
- Karina Gomez (CREATE-NET, Italy)

Technical Program Committee:
- Andrzej Duda (Grenoble Institute of Technology)
- Aruna Seneviratne (University of New South Wales)
- Ashutosh Sabharwal (Rice University)
- Christoph Lindemann (University of Leipzig)
- Christoph MecklenbrÃ¤uker (Vienna University of Technology)
- Cigdem Sengul (TU-Berlin)
- Daniele Miorandi (Create-Net)
- David Malone (NUI Maynooth)
- Djamal-Eddine Meddour (Orange Labs)
- Emilio Ancillotti (Italian National Research Council)
- Erik NordstrÃ¶m (Princeton University)
- Fabrizio Granelli (University of Trento)
- Georgios Paschos (CERTH - ITI, Center for Research and Technology)
- Henrik Lundgren (Technicolor)
- Iacopo Carreras (Create-Net)
- Ivan Seskar (Rutgers University)
- Kapil Dandekar (Drexel University)
- Karina Gomez (Create-Net)
- Keivan Navaie (University of Leeds)
- Laura Feeney (Swedish Institute of Computer Science)
- Marcelo Dias de Amorim (UPMC Sorbonne UniversitÃ©s)
- Marwan Fayed (University of Stirling)
- Navid Nikaein (Eurecom)
- Patrick Marsch (Nokia Siemens Networks)
- Ramya Raghavendra (IBM Research)
- Timo Ojala (University of Oulu)
- Wei-jen Hsu (University of Florida)

For information: winmee12-chairs@create-net-ml.org

[DMANET] Post-Doc Position at TU Chemnitz

2012-02-10T08:07:00.000-06:00

Post-Doc Position at TU Chemnitz
Department of Mathematics, Algorithmic and Discrete Mathematics

At the Department of Mathematics of Technische Universitaet Chemnitz
a post-doc position is available in the Algorithmic and Discrete
Mathematics group starting on 01.04.2012 at the level

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

initially for two years until 31.03.2014 within usual regulations
according to Saxonian law. The official German announcement will
soon be available on

http://www.tu-chemnitz.de/tu/stellen.php

Applicants should have completed their dissertation within the
last two years on a topic within algorithmic/discrete mathematics or
discrete/convex optimization. They should aim at extending their
qualifications for a university career and be willing to participate
actively in the development of our working group.

There will be some teaching duties for the department, therefore
fluency in German is a prerequisite, but we also hope to broaden
the teaching spectrum via the applicant's own field of expertise.

Applications should be in German, refer to the official announcement
above and should be directed electronically or by standard mail
before 26.02.2012 to

Prof. Dr. Christoph Helmberg
Technische Universitaet Chemnitz
Fakultaet fuer Mathematik
Reichenhainer Str. 39/41
09126 Chemnitz

Phone: 0371 531 34122
Email: 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] APEX 2012: Call for participation

2012-02-10T05:08:00.000-06:00

APEX 2012
International Workshop on Approximation,
Parameterized and EXact algorithms
February 28-29, 2012, Paris,
France
http://apex.lip6.fr/

- Registration is
open:http://apex.lip6.fr/registration.html

No fees are
required.
However, the registration is mandatory due to
administrative reasons.

- Program:

*** Tuesday,
February 28, 2012 ***

9h00-9h30 Welcome

9h30-10h30 Invited talk: Henning Fernau

Definitions, motivations, techniques and limitations of

parameterized approximation

10h30-10h45 Coffee break

10h45-11h15 A. Langer, F. Reidl, P. Rossmanith and S. Sikdar
Linear Kernels on Graphs Excluding Topological
Minors
11h15-11h45 P. Golovach, M. Kaminski, D. Paulusma and D.
Thilikos
Increasing the Minimum
Degree of a
Graph by Contractions
11h45-12h15 A. Perez and S. Bessy

A quartic kernel for Proper Interval Completion

12h15-14h30 Lunch

14h30-15h30 Invited talk: Martin
Skutella
Unsplittable and k-splittable flows in
single-source
networks

15h30-15h45 Coffee break

15h45-16h15 S. Mengel and A. Durand
The
Complexity of Weighted Counting for Acyclic
Conjunctive

Queries
16h15-16h45 R. Watrigant, M. Bougeret, R.
Giroudeau and J.-C. König
On the
approximability of the Sum-Max graph
partitioning problem

16h45-17h00 Coffee break

17h00-17h30 Ch. Lenté, M.
Liedloff, A. Soukhal and V. T'Kindt
Scheduling
parallel machines with exponential algorithms
17h30-18h00 R.
Crowston, M. Jones and M. Mnich
Max-Cut
Parameterized Above the Edwards-Erdös Bound

*** Wednesday,
February 29, 2012 ***

9h30-10h00 K. Jansen

A (3/2+\epsilon) approximation algorithm for scheduling

malleable and non-malleable parallel tasks
10h00-10h30 T.
Dokka, A. Kouvela and F. Spieksma
Approximating the
multi-level bottleneck assignment
problem

10h30-10h45
Coffee break

10h45-11h15 M. Chapelle

Domination-like problems parameterized by tree-width
11h15-11h45
E.-J. Kim and D. Goncalves
On Exact Algorithms for
Permutation CSP
11h45-12h15 K. Meeks and A. Scott

The parameterised complexity of list problems on graphs of

bounded treewidth

[DMANET] DBSEC 2012 - Deadline extended to February 26, 2012 (firm deadline)

2012-02-10T04:13:00.000-06:00

[Apologies if you receive multiple copies of this message]

Call For Papers DBSEC 2012

26th Annual WG 11.3 Conference on
Data and Applications Security and Privacy
DBSEC 2012
Paris, France, July 11-13, 2012
http://conferences.telecom-bretagne.eu/dbsec2012/

The 26th Annual WG 11.3 Conference on Data and Applications Security
and Privacy provides a forum for presenting original unpublished
research re-sults, practical experiences, and innovative ideas in data
and applications security and privacy. Both research papers and panel
proposals are solicited. Proceedings will be published by Springer as
the next volume in the Research Advances in Database and Information
Systems Security series (http://www.springeronline.com/lncs).

Papers may present theory, techniques, applications, or practical
experience on topics of relevance to IFIP WG 11.3:

- Access control
- Applied cryptography in data security and privacy
- Identity theft and countermeasures
- Integrity maintenance
- Intrusion detection
- Knowledge discovery and privacy
- Logics for security and privacy
- Organizational security
- Privacy-preserving data management
- Secure transaction processing
- Secure information integration
- Secure semantic web
- Secure sensor monitoring
- Secure web services
- Risk management
- Traceability and accountability
- Trust management

Additional topics of interest include (but are not limited to):
Critical Infrastructure Protection, Cyber Terrorism, Information
Warfare, Database Forensics, Electronic Commerce Security, and
Security in Digital Health Care.

* Submissions Guidelines:

Authors are invited to submit their contributions electronically to
the conference submission web site at
http://www.easychair.org/conferences/?conf=dbsec2012. Submission must
be in the form of a PDF file. Manuscripts must be in English, typed in
11-point font (minimum), and must not be more than 16 pages long.
Manuscripts must have a cover page with title, names and addresses
(including e-mail address) of authors, an abstract, and a set of
keywords. At least one author of each accepted paper is required to
register with the conference and present the paper. Accepted papers
will be published in the conference proceedings. The final copy of a
paper for the proceedings must use LaTeX, and must be laid out
according to the Camera Ready Copy format required by Springer. A
submitted paper must not be under review for inclusion in any other
conference or journal, and must be substantially different from
previously published work. Duplicate submissions will be automatically
rejected and without review.

* Award for the best student paper:

This award will be chosen by the program committee. The student must
be the first author to be eligible.

* Panel Proposals:

Proposals for panels should be e-mailed to the PC chair
(dbsec2012@easychair.org). Proposals should include a one-page
description of the subject matter, the name and address (including
e-mail address) of the organizer, and a list of proposed panelists.

* Important Dates:

- Paper submission due: *** February 26, 2012 11:59 PM EST (firm) ***
- Notification to authors: April 8, 2012
- Camera ready due: May 2, 2012

* Committees:

General Chair

- David Sadek, Institut TELECOM, France

PC Chairs

- Frederic Cuppens, TELECOM Bretagne, France
- Nora Cuppens-Boulahia, TELECOM Bretagne, France

IFIP WG 11.3 Chair

- Vijay Atluri, Rutgers University, USA

Program Committee

- Kamel Adi, Universite du Quebec en Outaouais, Canada
- Gail-Joon Ahn, Arizona State University, USA
- Claudio A. Ardagna, Universita degli Studi di Milano, Italy
- Vijay Atluri, Rutgers University, USA
- Steve Barker, King's College London, UK
- Joachim Biskup, Technische Universitat Dortmund, Germany
- Marina Blanton, University of Notre Dame, USA
- David Chadwick, University of Kent, UK
- Jason Crampton, Royal Holloway, UK
- Frederic Cuppens, TELECOM Bretagne, France
- Nora Cuppens-Boulahia, TELECOM Bretagne, France
- Mourad Debbabi, Concordia University, Canada
- Sabrina De Capitani, Universita degli Studi di Milano, Italy
- Josep Domingo-Ferrer, Universitat Rovira i Virgili, Spain
- Eduardo B. Fernandez, Florida Atlantic University, USA
- Simone Fischer-Hubner, Karlstad University, Sweden
- Simon Foley, University College Cork, Ireland
- Sara Foresti, Università degli Studi di Milano, Italy
- Alban Gabillon, University of French Polynesia, France
- Ehud Gudes, Ben-Gurion University, Israel
- Ragib Hasan, University of Alabama at Birmingham, USA
- Sushil Jajodia, George Mason University, USA
- Sokratis Katsikas, University of Piraeus, Greece
- Adam J. Lee, University of Pittsburgh, USA
- Yingjiu Li, Singapore Management University
- Peng Liu, Pennsylvania State University, USA
- Jorge Lobo, IBM Research T.J. Watson, USA
- Javier Lopez, University of Malaga, Spain
- Emil Lupu, Imperial College London, UK
- Martin Olivier, University of Pretoria, South Africa
- Stefano Paraboschi, Universita di Bergamo, Italy
- Wolter Pieters, University of Twente, Netherlands
- Indrajit Ray, Colorado State University, USA
- Indrakshi Ray, Colorado State University, USA
- Kui Ren, Illinois Institute of Technology, USA
- Mark Ryan, University of Birmingham, UK
- Kouchi Sakurai, Kyushu University, Japan
- Pierangela Samarati, Universita degli Studi di Milano, Italy
- Anoop Singhal, NIST, USA
- Traian Marius Truta, Northern Kentucky University, USA
- Leon van der Torre, University of Luxemburg, Luxemburg
- Vijay Varadharajan, Macquarie University, Australia
- Jaideep Vaidya, Rutgers University, USA
- Lingyu Wang, Concordia University, Canada
- Meng Yu, Virginia Commonwealth University, USA
- Xinwen Zhang, Samsung Information Systems, USA
- Jianying Zhou, Institute for Infocomm Research, Singapore
- Zutao Zhu, Google Inc., USA

Publication and Publicity Chair

- Joaquin Garcia-Alfaro, TELECOM Bretagne, France

Local Arrangement

- Ghislaine Le Gall, TELECOM Bretagne, France

Web Chair

- Said Oulmakhzoune, TELECOM Bretagne, France

[DMANET] 2nd Call for PRIZE NOMINATION: Prize for Innovation in Distributed Computing

2012-02-10T03:52:00.000-06:00

--- Call for PRIZE nominations - Deadline February 28, 2012 ---

(Please note that the deadline for papers for the conference is
different; the prize will be given at the conference this year, in
Iceland!)

Prize for Innovation in Distributed Computing

Awarded by the Colloquium on Structural Information and Communication
Complexity
(SIROCCO)

The Prize for Innovation In Distributed Computing was established
to recognize individuals whose research contributions expanded the
collective investigative horizon in SIROCCO's area of interest. That is,
they formulated new problems, or identified new research areas, that were
at the time of their introduction unorthodox and outside the mainstream,
but later attracted the interest of SIROCCO's community.

This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of
the SIROCCO conference.

The prize is presented at the annual meeting of the SIROCCO conference,
but may not necessarily be awarded every year.

Eligibility

The following conditions must be met by the nominees to be eligible for
the prize.

(1) The original innovative contribution was introduced by the nominee(s)
for the first time in a publication at least five years before the
nomination deadline, and the publication must have appeared in a
conference proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the
original paper, or a paper directly related to the innovative
contribution, must have appeared in SIROCCO proceedings.

Past SIROCCO papers and authors can be found at indexing sites, e.g.
Google Scholar or
http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.

Selection process

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference,
the PC chairs, including co-chairs, of the three SIROCCO conferences
immediately preceding the nominations deadline, plus one additional
member of the Advisory Board, selected by the Steering Committee for the
current year.

In 2012, the Award Committee consists of:
Shay Kutten (Technion)- chair
Evangelos Kranakis (Carleton)
Boaz Patt-Shamir (Tel Aviv University)
Alexander A. Shvartsman (University of Connecticut)
Masafumi Yamashita (Kyushu University)

A call for nomination is disseminated every year in the main mailing
lists of the Distributed Computing community, at least four months prior
to the date of that year's SIROCCO meeting.

Nominations can be made by any member of the scientific community. Each
nomination must identify the person(s) being nominated, and justify the
nomination by a short text including:

(a) a brief description of the innovative contribution in Distributed
Computing to be recognized by the award, and an explanation of its
originality and significance,

(b) the paper(s) of the nominee(s) that establish their eligibility as
described in the Eligibility section above items (1) and (2).

Nominations for 2012 should be sent to the Steering Committee chair of
SIROCCO: kutten@ie.technion.ac.il by February 28, 2012. Please write
SIROCCO Prize Nomination in the subject line.
**********************************************************
*
* 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] Second announcement and call for papers - MATCH-UP 2012: the Second International Workshop on Matching Under Preferences

2012-02-10T03:43:00.000-06:00

Second announcement and call for papers (with apologies if you receive this
more than once):

MATCH-UP 2012:
the Second International Workshop on Matching Under Preferences

19-20 July 2012
Corvinus University of Budapest, Hungary
http://econ.core.hu/english/res/MATCH-UP_2012.html

co-located with SING8: The 8th Spain-Italy-Netherlands Meeting
on Game Theory (http://sing8.iehas.hu/)

Celebrating the 50th anniversary of the seminal paper by Gale and Shapley,
and following the success of the first MATCH-UP workshop in Reykjavík in
2008 (http://www.optimalmatching.com/workshop), we are organising another
interdisciplinary workshop on stable matchings and related topics.

Background
----------
Matching problems with preferences occur in widespread applications such
as the assignment of school-leavers to universities, junior doctors to
hospitals, students to campus housing, children to schools, kidney
transplant patients to donors and so on. The common thread is that
individuals have preference lists over the possible outcomes and the task
is to find a matching of the participants that is in some sense optimal
with respect to these preferences.

The remit of this workshop is to explore matching problems with
preferences from the perspective of algorithms and complexity, discrete
mathematics, combinatorial optimization, game theory, mechanism design
and economics, and thus a key objective is to bring together the research
communities of the related areas.

Invited speakers
----------------
* Nicole Immorlica, Northwestern University
* Rob Irving, University of Glasgow
* Fuhito Kojima, Stanford University (on leave at Columbia University)
* Tayfun Sönmez, Boston College

List of topics
--------------
The matching problems under consideration include, but are not limited to:

* two-sided matchings involving agents on both sides (e.g. college
admissions, resident allocation, job markets, school choice, etc.)
* two-sided matchings involving agents and items (e.g. house allocation,
course allocation, project allocation, assigning papers to reviewers,
school choice, etc.)
* one-sided matchings (roommates problem, kidney exchanges, etc.)
* matching with payments (assignment game, auctions, etc.)

Submissions
-----------
We call for two types of contributed papers.

Format A: original contribution
* at most 12 pages
* accepted papers will be published in proceedings (however, this should
not prevent the simultaneous or subsequent submission of contributed
papers to other workshops, conferences or journals)

Format B: not necessarily original work
* no page limit
* only the abstract will be published in proceedings

Authors should indicate which format type their paper should be
considered under. Papers may be submitted by clicking here:
https://www.easychair.org/conferences/?conf=matchup2012.

A selection of papers presented at the workshop in the algorithms and
complexity area will be invited for submission to a special issue of the
open-access journal Algorithms (http://www.mdpi.com/journal/algorithms),
with no article processing charge for the authors of accepted papers.

Important dates
---------------
* Deadline for submission of contributed papers: 19 March 2012
* Notification of acceptance: 20 April 2012
* Early registration deadline: 18 May 2012
* Workshop: 19-20 July 2012

Organising committee
--------------------
* Péter Biró (Institute of Economics, Hungarian Academy of Sciences)
* Tamás Fleiner (Budapest University of Technology and Economics)
* David Manlove (University of Glasgow)
* Tamás Solymosi (Corvinus University, Budapest)

Programme committee
-------------------
* Péter Biró (Chair, Institute of Economics, Hungarian Academy of Sciences)
* Estelle Cantillon (Université Libre de Bruxelles)
* Katarína Cechlárová (Univerzita Pavla Jozefa Safárika)
* Paul Dütting (EPFL, Lausanne)
* Aytek Erdil (University of Cambridge)
* Tamás Fleiner (Budapest University of Technology and Economics)
* Guillaume Haeringer (Universitat Autonoma de Barcelona)
* Elena Inarra (University of the Basque Country)
* Zoltán Király (Eötvös Loránd University, Budapest)
* Flip Klijn (Universitat Autonoma de Barcelona)
* David Manlove (University of Glasgow)
* Eric McDermid (21st Century Technologies)
* Shuichi Miyazaki(Kyoto University)
* Marina Nunez (Universitat de Barcelona)
* Ildikó Schlotter (Budapest University of Technology and Economics)
* Tamás Solymosi (Corvinus University, Budapest)

Further information
-------------------
See http://econ.core.hu/english/res/MATCH-UP_2012.html

The University of Glasgow, charity number SC004401
**********************************************************
*
* 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/
*
**********************************************************

Second announcement and call for papers - MATCH-UP 2012: the Second International Workshop on Matching Under Preferences

2012-02-10T03:40:00.000-06:00

Second announcement and call for papers (with apologies if you receive th
is
more than once):

MATCH-UP 2012:
the Second International Workshop on Matching Under Preferences

19-20 July 2012
Corvinus University of Budapest, Hungary
http://econ.core.hu/english/res/MATCH-UP_2012.html

co-located with SING8: The 8th Spain-Italy-Netherlands Meeting
on Game Theory (http://sing8.iehas.hu/)

Celebrating the 50th anniversary of the seminal paper by Gale and Shapley
,
and following the success of the first MATCH-UP workshop in Reykjavík i
n
2008 (http://www.optimalmatching.com/workshop), we are organising another

interdisciplinary workshop on stable matchings and related topics.

Background
----------
Matching problems with preferences occur in widespread applications such

as the assignment of school-leavers to universities, junior doctors to

hospitals, students to campus housing, children to schools, kidney
transplant patients to donors and so on. The common thread is that
individuals have preference lists over the possible outcomes and the task

is to find a matching of the participants that is in some sense optimal

with respect to these preferences.

The remit of this workshop is to explore matching problems with
preferences from the perspective of algorithms and complexity, discrete

mathematics, combinatorial optimization, game theory, mechanism design

and economics, and thus a key objective is to bring together the research

communities of the related areas.

List of topics
--------------
The matching problems under consideration include, but are not limited to
:

course allocation, project allocation, assigning papers to reviewers,

school choice, etc.)
* one-sided matchings (roommates problem, kidney exchanges, etc.)
* matching with payments (assignment game, auctions, etc.)

Submissions
-----------
We call for two types of contributed papers.

Format A: original contribution
* at most 12 pages
* accepted papers will be published in proceedings (however, this should

not prevent the simultaneous or subsequent submission of contributed

papers to other workshops, conferences or journals)

Format B: not necessarily original work
* no page limit
* only the abstract will be published in proceedings

Authors should indicate which format type their paper should be
considered under. Papers may be submitted by clicking here:
https://www.easychair.org/conferences/?conf=matchup2012.

A selection of papers presented at the workshop in the algorithms and
complexity area will be invited for submission to a special issue of the

open-access journal Algorithms (http://www.mdpi.com/journal/algorithms),

with no article processing charge for the authors of accepted papers.

Programme committee
-------------------
* Péter Biró (Chair, Institute of Economics, Hungarian Academy of Sci
ences)
* Estelle Cantillon (Université Libre de Bruxelles)
* Katarína Cechlárová (Univerzita Pavla Jozefa Safárika)
* Paul Dütting (EPFL, Lausanne)
* Aytek Erdil (University of Cambridge)
* Tamás Fleiner (Budapest University of Technology and Economics)
* Guillaume Haeringer (Universitat Autonoma de Barcelona)
* Elena Inarra (University of the Basque Country)
* Zoltán Király (Eötvös Loránd University, Budapest)
* Flip Klijn (Universitat Autonoma de Barcelona)
* David Manlove (University of Glasgow)
* Eric McDermid (21st Century Technologies)
* Shuichi Miyazaki(Kyoto University)
* Marina Nunez (Universitat de Barcelona)
* Ildikó Schlotter (Budapest University of Technology and Economics)
* Tamás Solymosi (Corvinus University, Budapest)

Further information
-------------------
See http://econ.core.hu/english/res/MATCH-UP_2012.html

[DMANET] 2nd CfP FUTURE COMPUTING 2012 July 22-27, 2012 - Nice, France

2012-02-09T14:21:00.000-06:00

INVITATION:

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

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish
original scientific results to FUTURE COMPUTING 2012.

The submission deadline is set to March 5, 2012.

In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org

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

============== FUTURE COMPUTING 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

FUTURE COMPUTING 2012, The Fourth International Conference on Future Computational Technologies and Applications

July 22-27, 2012 - Nice, France

General page: http://www.iaria.org/conferences2012/FUTURECOMPUTING12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPFUTURECOMPUTING12.html

- regular papers

- short papers (work in progress)

- posters

Submission page: http://www.iaria.org/conferences2012/SubmitFUTURECOMPUTING12.html

Submission deadline: March 5, 2012

British Colloquium for Theoretical Computer Science

2012-02-09T09:32:00.000-06:00

British Colloquium for Theoretical Computer Science
Manchester, UK
2nd--5th April 2012
http://bctcs2012.cs.manchester.ac.uk

CALL FOR CONTRIBUTED TALKS
Deadline for abstract submission: 19th March

The 28th British Colloquium for Theoretical Computer Science will be
hosted by the School of Computer Science, University of Manchester,
from 2nd to 5th April, 2012.

The purpose of BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers.
This year, BCTCS is part of the Alan Turing Year, and will be
collocated with the Automated Reasoning Workshop ARW
(http://arw2012.cs.man.ac.uk/).

Newsflash: PhD Student Bursaries are now available. Please see the
website for details.

The scope of the colloquium includes all aspects of theoretical
computer science, including automata theory, algorithms, complexity
theory, semantics, formal methods, concurrency, types, languages and
logics. Both computer scientists and mathematicians are welcome to
attend, as are participants from outside of the UK.

The colloquium features both invited and contributed talks. This
year's invited speakers are

Rod Downey, School of Mathematics, Statistics and Operations Research,
Victoria University of Wellington. (LMS Keynote Speaker in
Discrete Mathematics)
Mike Edmunds, School of Physics and Astronomy, University of Cardiff.
Reiner Haehnle, Fachbereich Informatik, Technische Universitaet
Darmstadt.
Nicole Schweikardt Institut fuer Informatik, Goethe-Universitaet,
Frankfurt am Main.

Participants wishing to give 30 minute contributed talks may simply to
submit a title and abstract (100--300 words) by the deadline given
below.

Further details are available from the Colloquium website:
http://bctcs2012.cs.manchester.ac.uk .

Important dates:

16th January 2012 --- Registration/accommodation booking opens.
19th March 2012 --- Abstract submission deadline for participants
wishing to give contributed talks.
2nd--5th April, 2012 --- Colloquium.

[DMANET] 3 associate professorships at KTH in computer science (including TCS)

2012-02-08T17:14:00.000-06:00

The School of Computer Science and Communication at KTH Royal Institute of
Technology invites applications for 3 associate professor positions in
computer science, including but not limited to theoretical computer
science. The TCS group at KTH would love to see strong theory applicants
for these positions.

KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The TCS
group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.

The associate professorships are permanent positions including both
research and teaching at the undergraduate and master levels. Details
regarding teaching load and support package for getting started with
research in Sweden will be negotiated on an individual basis with the
successful candidates.

The deadline for applications is February 29, 2012. For the full
announcement including instructions how to apply, see
http://www.kth.se/en/om/work-at-kth/vacancies/associate-professor-in-computer-science-1.286611
. We want to stress that KTH is looking for international candidates of
the highest possible calibre (so, in particular, any wording in the
official announcement that might give the impression of suggesting
otherwise should be taken with grain of salt).

Informal enquiries are welcome and may be directed (from TCS candidates)
to Johan Hastad, johanh@csc.kth.se .

[DMANET] Postdoctoral Fellow position at Duke University

2012-02-08T16:42:00.000-06:00

The Departments of Computer Science and Statistical Science at Duke University
invite applications for a postdoctoral researcher position for the project
"Integrating Algorithmic and Stochastic Modeling
Techniques for Environmental Prediction," under the supervision of Professors
Pankaj K. Agarwal, Jim Clark, and Alan Gelfand. The position, contingent upon
grant funding, is for one year and can be extended for one or more additional
years by mutual consent.

This interdisciplinary project, funded by National Science Foundation under the
cyber-enabled discovery initiative (CDI), aims to develop a prediction framework
for biodiversity, which coherently combines broad-scale pattern data with
fine-scale data on species interactions and which is computationally scalable.
The goal is to develop a multi-scale modeling framework and to design algorithms
that make environmental models computationally scalable. The approach hinges
upon strong interplay of algorithmic and statistical techniques. Statistical
inference brings stochastic modeling sophistication in space and time, and
sophisticated algorithms make models and processes scalable and provide
trade-offs between accuracy and efficiency. The project draws on a wide range of
topics in computer science and statistics, including geometric algorithms,
approximation algorithms, hierarchical specifications within a Bayesian
framework, and space-time process modeling.

Candidates should have a PhD in computer science or statistics, with a strong
background in stochastic modeling and algorithms. Apart from working on the
project, the candidate will have an opportunity to work on a broad set of
modeling and algorithmic problems and to collaborate with the research groups of
the PIs. Additional responsibilities will include helping the PIs prepare
contracts and reports.

All applicants should submit curriculum vitae and research statement and arrange
three reference letters. All materials should be submitted online at Academic
Jobs Online (https://academicjobsonline.org). For inquiries and e-mail
correspondence please write to alan@stat.duke.edu or pankaj@cs.duke.edu. The
position will remain open until filled but for full consideration all material
should be submitted by February 29, 2012.

Duke University prohibits discrimination and harassment, and provides equal
employment opportunity without regard to race, color, religion, national origin,
disability, veteran status, sexual orientation, gender identity, sex or age.
Duke is committed to recruiting, hiring, and promoting qualified minorities,
women, individuals with disabilities, and veterans.
--
--------------------------------------------------------------------
Pankaj K. Agarwal Dept. of Computer Science
RJR Nabisco Professor D214 LSRC Bldg
Phone (919) 660-6540 Box 90129
e-mail: pankaj@cs.duke.edu Duke University
url: http://www.cs.duke.edu/~pankaj Durham, NC 27708-0129

[DMANET] Reminder - Deadline 17h February CFP: SCOR 2012 - 3rd Student Conference on Operational Research

2012-02-08T09:21:00.000-06:00

****REMINDER - DEADLINE 17th February****

CALL FOR PAPERS:

SCOR 2012
3rd Student Conference on Operational Research
20-22 April 2012, Nottingham, UK
www.scor2012.com

Building on the success of the previous Student Conferences on
Operational Research, we are proud to announce the 3rd edition, SCOR 2012.

PhD students from all European Universities studying Operational
Research, Management Science or a related field are kindly invited to
submit an abstract for presentation at the conference. The purpose of
SCOR 2012 is to provide a friendly environment for doctoral candidates
to develop their presentation skills, to receive constructive feedback
on their work and to meet other students with similar interests.

Plenary talks will be given by various OR professionals undertaking a
wide range of exciting careers. This will give students an opportunity
to consider the many career paths available to them after completing
their doctorate.

Registration cost includes accommodation, a full social program and full
catering. We have strived to keep costs to a minimum in order to
maximise attendance.

Deadline for abstract submission: Friday 17th February 2012

Presenters will also be invited to submit a paper (no more than 10
pages) on their work to be published electronically as part of the SCOR
2012 proceedings. This will be available in the Dagstuhl OpenAccess
Series in Informatics (OASIcs).

Important dates:

* 30th Novemeber 2011: Opening of the abstract submission/registration
procedure
* 17th February 2012: Closing of the abstract submission procedure
* 29th February 2012: Notification of abstract submission
* 4th April 2012: Closing of paper submission procedure
* 11th April 2012: Closing of the registration procedure
* 20th - 22th April 2012: CONFERENCE
* 10th May 2012: Notification of paper submission

Organising committee:

Stefan Ravizza (Chairman), University of Nottingham,smr@cs.nott.ac.uk
Penny Holborn (Vice-chair), Cardiff University
Michael Clark, University of Nottingham
Emily Cookson, Lancaster University
Magdalena Gajodosz, University of Strathclyde
Pablo Gonzalez Brevis, University of Edinburgh
Izabela Komenda, Cardiff University
Urszula Neumann, University of Nottingham
Martin Tak, University of Edinburgh
Alessia Violin, Universit Libre de Bruxelles

--
Alessia Violin
Service Graphes et Optimisation Mathématique (G.O.M.)
Université Libre de Bruxelles
C.P. 210/01
Boulevard du Triomphe
B-1050 BRUXELLES
Tel: 02 650 56 28 - Fax: 02 650 59 70
Email: aviolin@ulb.ac.be
Webpage: http://homepages.ulb.ac.be/~aviolin/

[DMANET] 2nd cfp COGNITIVE 2012 July 22-27, 2011 - Nice, France

2012-02-08T08:56:00.000-06:00

INVITATION:

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

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish
original scientific results to COGNITIVE 2012.

The submission deadline is set to March 5, 2012.

In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org

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

============== COGNITIVE 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

COGNITIVE 2012, The Fourth International Conference on Advanced Cognitive Technologies and Applications

July 22-27, 2011 - Nice, France

General page: http://www.iaria.org/conferences2012/COGNITIVE12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPCOGNITIVE12.html

- regular papers

- short papers (work in progress)

- posters

Submission page: http://www.iaria.org/conferences2012/SubmitCOGNITIVE12.html

Submission deadline: March 5, 2012

[DMANET] CFP - VTP 2012: 1st IEEE WoWMoM Workshop on VANETs from Theory to Practice

2012-02-08T07:51:00.000-06:00

Apologies for cross-postings

*****************************************************************
The 1st IEEE Workshop on VANETs
from Theory to Practice
(IEEE VTP 2012)
http://vtp.gforge.uni.lu

held in conjunction with
The Thirteenth International Symposium on a
World of Wireless, Mobile and Multimedia Networks
(IEEE WoWMoM 2012)
June 25-28, 2012

San Francisco, California, USA
http://wowmom2012.it.uc3m.es
*****************************************************************

WORKSHOP THEME
==================
Vehicular ad hoc networks (VANETs) use in-vehicle, vehicle-to-roadside
infrastructure and vehicle-to-backoffice communication to provide drivers
with safety- and efficiency- related services. The design and implementation
of these services in a high-performance, reliable, scalable, secure and
privacy-preserving fashion presents exciting research challenges. Additionally,
the experimentation and validation in VANETs either relies on simulations or
testbeds. On the one hand, simulation requires realistic network and mobility
models. On the other hand, with the emergence of communications standards
and hardware, prototyping and testbeds allow to obtain performance measures
under real-word conditions such as realistic signal propagation and vehicles' mobility.
VANETs are therefore a popular and active research field with many ongoing
large-scale projects involving governments, academia and industry.

The workshop on VANETs from Theory to Practice (VTP 2012) will to bring together
researchers on VANETs to present and discuss recent advances in the development of
inter-vehicular networking technologies. The workshop covers all theoretical and
practical aspects related to applications modelling, simulation, prototyping and testbeds in VANETs.

Areas of interest include, but are not limited to:

* Simulation frameworks
* Safety and traffic information applications
* Telematics applications
* Electric vehicle applications
* Security and privacy issues
* Network management
* Mobility modelling
* Mobility prediction and control
* Power control and scalability issues
* Multi-channel organization and operation
* Channel modelling and allocation
* Modulation and coding
* Communication protocol design
* Vehicle-to-vehicle/roadside/backoffice communication
* Cross-layer design
* Validation of simulation models
* Innovative measurement methodologies and tools
* Experiences/lessons from recent testbed deployments and measurements
* Field operational testing

Both theoretical papers and papers describing practical experiences will be welcome.

PAPER SUBMISSION AND PUBLICATION
==================================
Papers should contain original material and not be previously published, or
currently submitted for consideration elsewhere. Accepted papers will be
published by the IEEE in the combined WoWMoM 2012 proceedings, hence
manuscripts must be formatted in accordance with the IEEE Computer Society
author guidelines. The IEEE LaTeX and Microsoft Word templates, as well as
related information, can be found on the [IEEE Computer Society website]
(http://www.computer.org/portal/web/cscps/formatting). Submission must be
limited to 6 pages, single spacing, double column, and must STRICTLY adhere
to the template format.

PDF version of your contribution should be submitted via the workshop EDAS
website: http://edas.info/newPaper.php?c=11881.

Each paper will receive a minimum of two reviews. Papers will be selected based on their originality,
relevance, technical clarity and presentation. Authors of accepted papers must guarantee that their
papers will be registered and presented at the workshop.

In case of question/problems regarding the submission process, please send
an email to [Julien Schleich](julien.schleich@uni.lu).

GENERAL CO-CHAIRS
===================
* Pascal Bouvry, University of Luxembourg
* Bjorn Landfeldt, University of Sydney

PROGRAMME CO-CHAIRS
======================
* Gregoire Danoy, University of Luxembourg
* Patricia Ruiz, University of Luxembourg
* Julien Schleich, Interdisciplinary Center for Security, Reliability and Trust
* Marcin Seredynski, Interdisciplinary Center for Security, Reliability and Trust

PROGRAMME COMMITTEE (to be completed)
=====================================
* Enrique Alba, University of Malaga, Spain
* Azzedine Boukerche, University of Ottawa, Canada
* Bertrand Ducourthial, University of Compi?gne, France
* El-Ghazali Talbi, University of Lille, France
* Scott Fowler, Linkoping University, Sweden
* Frederic Guinand, University of Le Havre, France
* Marek Krygier, United Navigation Gmbh, Poland
* Ricky Yu-Kwong Kwok, University of Hong Kong, China
* Xiaoliang Ma, Centre for Traffic Research - KTH, Sweden
* Yoann Pigne, University of Le Havre, France
* Apivadee Piyatumrong, NECTEC, Thailand
* Jedrzej Rybicki, Heinrich Heine University D?sseldorf
* Franciszek Seredynski, PJIIT, Poland
* Albert Zomaya, University of Sydney, Australia

IMPORTANT DATES
=================
* Submission Deadline: February 17, 2012
* Acceptance Notification: April 8, 2012
* Camera Ready: TBA
* Workshop: June 25, 2012
**********************************************************
*
* 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] PostDoc position at University Paris 13

2012-02-08T06:36:00.000-06:00

University Paris 13 is offering a postdoctoral position in integer
programming. The candidate will join the research team AOC of LIPN,
working on re-optimization and column generation for combinatorial
optimization, supported by Google Grant Program on Mathematical
Optimization and Combinatorial Optimization.

The research concerns re-optimization in column generation, focusing on
methodological contributions, and in developing exact and heuristic
algorithms based on mathematical programming. Applicants should have a
strong background in mathematical programming (specifically column
generation) completed by algorithmic and C/C++ implementation skills.

The position is open to international candidates. Further information
and application details can be found here:
http://www-lipn.univ-paris13.fr/~letocart/PostDoc_Reopt_GC.pdf

Lucas Létocart and Roberto Wolfler Calvo
LIPN, UMR CNRS 7030
Université Paris 13
France
letocart@lipn.fr and wolfler@lipn.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] PhD Studentship in Computer Science and Operational Research: Computational Search

2012-02-08T04:42:00.000-06:00

[Please distribute widely. Apologies if you receive this announcement
multiple times.]

PhD Studentship available now

(Fully funded for UK students - which can include EU citizens having
lived in the UK, unfortunately EU/International students need to obtain
supplementary funding.)

Topic:
Computational Search Methods for Mixing Online & Offline Optimisation

University of Nottingham - School of Computer Science

This studentship is to work on a project to investigate
automated decision making processes that effectively handle the
interactions between the online and offline decision making. It will
develop appropriate computational search methods, and ultimately combine
together queuing networks (e.g. using simulation) and combinatorial
optimisation, so as to solve real-world problems. The mix of online and
offline will place it in an exciting and relatively unexplored area of
computer science and operational research. The specific research is
motivated by real-world situations that require some immediate (online)
decision making, but have aspects requiring (offline) planning over a
longer time period. A particular focus of interest will be that of the
management of a hospital emergency room. As patients arrive, then
decisions need to be made immediately. Conversely, staffing
decisions, such as which nurses work on which shifts, can be made weeks
in advance (offline). The challenge in this case is to design a system
so that these online and offline decision making processes work
efficiently and effectively together. As far as possible, patients
should get rapid treatment, but also staffing costs should be reduced,
and nurses should have working times matching their preferences. This is
a computationally challenging problem (e.g. NP-hard), but of practical
interest in many real-world situations.

Students should have at least an upper second-class honours degree
(ideally a first class degree), in computer science, artificial
intelligence, mathematics, operational research, management science
(with a substantial mathematics component), or a related area, or a
combination of qualifications and/or experience equivalent to that
level. Good programming ability will be required. Students with a
mathematical background, if they have some programming experience, are
encouraged to apply. Knowledge of one or more of computational
complexity theory, heuristic and exact search methods, mathematical
programming, and stochastic processes (such as queuing theory or Markov
chains), is also desirable, though the main requirement is good
analytical thinking.

This studentship will allow the student to be associated with The LANCS
Initiative (see: http://www.lancs-initiative.ac.uk/), and particularly
the 'Heuristic understanding' and "Systems to build systems" research
clusters. The successful student will join the Automated Scheduling,
OptimisAtion and Planning (ASAP) research group (see:
http://www.asap.cs.nott.ac.uk/) and have the opportunity to interact
with the leading scientists in the field. ASAP is one of five main
Research Groups within the School of Computer Science at Nottingham.
ASAP has been carrying out innovative research into the development and
investigation of decision support, search methodologies and machine
learning for a wide and diverse range of real world problem environments
for the last decade. The group comprises 8 members of academic staff, 7
researchers, 37 PhD students and 1 administrator.

This studentship is available for 3 years and includes an approximate
maintenance grant of 13,300 per year, maintenance grant and UK/EU
tuition fees. Due to funding restrictions, this studentship is primarily
directed at UK students. However, in some circumstances EU or
International students might also be able to be supported. EU and
International students wishing to apply need to obtain one of the
scholarships offered by The International Office of the University of
Nottingham
(http://www.nottingham.ac.uk/internationalstudents/scholarshipsfeesfinance/scholarships/index.aspx#international)
to complement this studentship.

Informal enquiries are welcome and may be addressed to Dr Andrew Parkes,
see: http://www.cs.nott.ac.uk/~ajp/ Email: ajp@cs.nott.ac.uk.
However, please note that applications sent directly to this email
address will not be accepted. To apply, please access:
http://pgstudy.nottingham.ac.uk/apply-for-postgraduate-courses.aspx.

Please quote ref. SCI/1101. Closing date: The initial deadline is 9
February 2012, though this is primarily because of the early deadline
for international student scholarships, and otherwise the position
will remain open until filled. If in doubt please email to ask.

For all our vacancies and more about working at the University of
Nottingham see: http://jobs.nottingham.ac.uk/.

regards,
Andrew Parkes
http://www.cs.nott.ac.uk/~ajp/

This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.

This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* 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] ISCO 2012 - CALL FOR PARTICIPATION

2012-02-08T02:58:00.000-06:00

CALL FOR PARTICIPATION
---------------------------------------------------------------------------
ISCO 2012
2nd International Symposium on Combinatorial Optimization
April 19-21, 2012

and

SPRING SCHOOL
"Mathematical Programming and Design of Approximation Algorithms"
by David Shmoys and David Williamson
April 17-18, 2012

Department of Informatics
Athens University of Economics and Business (AUEB)
Athens, Greece

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

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

REGISTRATION
------------
Early registration is now open, until February 24,
http://isco12.cs.aueb.gr/?registration

SPRING SCHOOL
-------------
http://isco12.cs.aueb.gr/?spring

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

Accepted papers
-----------------
http://isco12.cs.aueb.gr/?accepted

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

[DMANET] Joint MIT-SUTD postdoc

2012-02-07T16:46:00.000-06:00

The SUTD-MIT Postdoctoral Programme offers unique research
opportunities to highly talented international individuals to engage
in new or on-going research programmes at MIT and SUTD. These two-year
appointments are competitive and are designed to advance MIT's and
SUTD's postdoctoral research environment in technology, architecture,
engineering, manufacturing, and systems design. Postdoctoral fellows
will spend one year at MIT and one year at SUTD. Up to 10 fellowships
will be awarded. Both fundamental and applied research projects are
encouraged.

It is highly recommended that the applicants contact relevant faculty
in the area of interest at SUTD-MIT before submitting an application,
because the postdoctoral fellows are expected to have an advisor at
SUTD or MIT (preferably both). The applicants are expected to submit a
research proposal (max 10 pages), curriculum vitae and letters of
reference. Deadline for application is March 1st 2012, the
appointments will commence on September 1st 2012. For more information
and a detailed description of the documents and format required for
application: postgraduate@sutd.edu.sg

Within the context of this program, applicants interested in working
on combinatorial optimization are encouraged to contact Giacomo Nannicini
at nannicini@sutd.edu.sg. Research projects are available in the areas of:
computational combinatorial optimization, mixed-integer linear and nonlinear
programming.
**********************************************************
*
* 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] WG 2012 SECOND CALL FOR PAPERS - Submission page is now open

2012-02-07T04:53:00.000-06:00

*********************************************************
* SECOND CALL FOR PAPERS - WG 2012
* Submission page is now Open
*********************************************************
*
* 38th International Workshop on
* Graph-Theoretic Concepts in Computer Science (WG 2012)
*
* Ramat-Rachel Kibbutz Hotel, Jerusalem, Israel
* June 26 - 28, 2012
*
* Workshop website: http://www.cri.haifa.ac.il/wg2012/
*
*********************************************************

The Easychair submission server for WG 2012 is now open.
The submission deadline is March 2, 2012.

Submission website: https://www.easychair.org/conferences/?conf=wg2012

*SUBMISSION*

Authors are invited to submit an extended abstract in English no longer
than 10 pages on letter-size or A4-size paper using at least 11-point font
(and preferably LaTeX article style 11pt A4-paper). Proofs omitted due to
space constraints must be put into an appendix to be read by the program
committee members at their discretion. Simultaneous submission to other
conferences with published proceedings is not allowed.

*BEST STUDENT PAPER AWARD*

A best student paper award will be granted. The program committee will
judge the submissions and announce the best student paper during the
workshop. For the purpose of this award, a student paper is defined as one
in which *all authors* are students (without a doctoral degree) as of the
submission date.

*STUDENT POSTER SESSION*

Students who are authors of papers accepted to other international
refereed conferences in 2012, may apply to present a poster at WG2012.
(Other authors may be non-students, but the presentation of the poster
MUST be by the student author.)

The posters should NOT be submitted via Easychair!

Rather, they are to be emailed to: wg2012.info@gmail.com
together with the required supporting documentation until April 20, 2012.
For full instructions, See the Workshop website:
http://www.cri.haifa.ac.il/wg2012/

*CHAIRS*

Conference chair: Martin Golumbic <golumbic@cs.haifa.ac.il>
Program co-chair: Michal Stern <stern@mta.ac.il>
Organizational co-chair: Avivit Levy <avivitlevy@gmail.com>

*PROGRAM COMMITTEE*

Threse Biedl (Canada), Hans Bodlaender (Netherlands), Andreas Brandstadt
(Germany), L. Sunil Chandran (India), Jianer Chen (USA), Lenore J. Cowen
(USA), Celina de Figueiredo (Brazil), Fedor Fomin (Norway), Magnus M.
Halldorsson (Iceland), Martin Charles Golumbic (Co-chair) (Israel),
Gregory Z. Gutin (UK), Irith Hartman (Israel), Pavol Hell (Canada),
Seok-Hee Hong (Australia), Tibor Jordan (Hungary), Michael Kaufmann
(Germany), Dieter Kratsch (France), Lap Chi Lau (Hong Kong), Avivit Levy
(Israel), Vincent Limouzy (France), Alberto Marchetti-Spaccamela (Italy),
Ross McConnell (USA), Gila Morgenstern (Israel), Radiger Reischuk
(Germany), Michal Stern (Co-chair) (Israel), Dimitrios Thilikos (Greece),
Yaokun Wu (China), Shmuel Zaks (Israel).

[DMANET] Postdoc Positions in Algorithms & Complexity and in Probabilistic Reasoning at the Vienna University of Technology, Austria

2012-02-07T04:26:00.000-06:00

Postdoc Position in Algorithms & Complexity
Postdoc Position in Probabilistic Reasoning
Vienna University of Technology, Austria

Postdoc positions are available at the Institute of Information Systems, Vienna University of Technology, Austria. The positions are supported by the European Research Council (ERC) Starting Grant "The parameterized complexity of computational reasoning" and are available for a duration between one year and two and a half years.

Further information on the project, the job requirements, and the application procedure can be found at the project's web-site:

http://www.kr.tuwien.ac.at/drm/szeider/complex-reason

[DMANET] ATMOS 2012: first call for papers

2012-02-06T13:52:00.000-06:00

FIRST CALL FOR PAPERS

12th WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELING, OPTIMIZATION, AND SYSTEMS (ATMOS 2012)

September 13, 2012
Ljubljana, Slovenia

http://algo12.fri.uni-lj.si/?file=atmos

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

The ATMOS 2012 workshop will be held in connection with ALGO 2012 in
Ljubljana, Slovenia, on September 13, 2012.

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.

------------------------------------------------------------------
INVITED SPEAKER

Matthias Mueller-Hannemann, University of Halle-Wittenberg, Germany

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

SUBMISSION DEADLINE: June 28, 2012, 23:59 PDT
NOTIFICATION TO AUTHORS: July 27, 2012
CAMERA READY SUBMISSION: August 22, 2012
WORKSHOP DATE: September 13, 2012

------------------------------------------------------------------
TOPICS

We invite papers for presentation at the workshop 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
* Transportation Systems

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 an extended abstract or full paper of
at most 12 pages. Papers must be formatted in LaTeX, using the OASIcs
(http://drops.dagstuhl.de/styles/oasics/oasics-authors.tgz) style
file. The paper should contain a succinct statement of the issues and
of their motivation, a summary of the main results, and a brief
explanation of their significance, accessible to non-specialist
readers. Proofs omitted due to space constraints can be put into an
appendix to be read by the program committee members at their
discretion. Papers must be submitted electronically at
https://www.easychair.org/conferences/?conf=atmos2012.
The submission must be received by 23:59 (PDT) on June 28, 2012. Each
accepted paper must be presented at the workshop by one of the
authors.

------------------------------------------------------------------
PROCEEDINGS

The proceedings will be published on the Dagstuhl OpenAccess Series
in Informatics (OASIcs) publication service.

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

* Teodor Gabriel Crainic, Universite du Quebec a Montreal, Canada
* Daniel Delling, Microsoft Research Silicon Valley, USA (co-chair)
* Daniele Frigioni, University of L'Aquila, Italy
* Felix Koenig, TomTom, Germany
* Gilbert Laporte, HEC Montreal, Canada
* Leo Liberti, Ecole Polytechnique, France (co-chair)
* Marco Luebbecke, RWTH Aachen University, Germany
* Frederic Meunier, Ecole des Ponts ParisTech, France
* Giacomo Nannicini, SUTD, Singapore
* Carolina Osorio, MIT, USA
* Christian Sommer, MIT, USA
* Paolo Toth, University of Bologna, Italy
* Eduardo Uchoa, Universidade Federal Fluminense, Brazil
* Roberto Wolfler Calvo, Paris-Nord University, France

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

* Alberto Caprara, Universita di Bologna, Italy
* Alberto Marchetti-Spaccamela, Universita di Roma "La Sapienza", Italy
* Spyros Kontogiannis, University of Ioannina, Greece
* Rolf Moehring, TU Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology (KIT), Germany
* Christos Zaroliagis, University of Patras, Greece
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CPM 2012 - Final Call for Papers

2012-02-06T12:34:00.000-06:00

*******************************************************
FINAL CALL FOR PAPERS

CPM 2012
23rd Annual Symposium on Combinatorial Pattern Matching
July 3-5, 2012, Helsinki, Finland
http://cpm2012.helsinki.fi/
cpm2012@cs.helsinki.fi
*******************************************************

Submission deadline: ** February 10, 2012 **

SWAT 2012 - 13th Scandinavian Symposium and Workshops on Algorithm Theory
July 4-6, 2012, will be co-located with CPM 2012. See:
http://swat2012.helsinki.fi/

SCOPE: Papers in all areas related to combinatorial pattern
matching and its applications are sought, including, but not
limited to: bioinformatics, coding and data compression,
computational biology, data mining, information retrieval,
natural language processing, pattern recognition, string algorithms,
string processing in databases, symbolic computing, text searching.

Both papers reporting on original research unpublished elsewhere
and surveys of important results are welcome.
The proceedings will be published in the Springer-Verlag series
Lecture Notes in Computer Science.

PC CHAIRS: Juha Karkkainen, University of Helsinki
Jens Stoye, Bielefeld University

KEYNOTE SPEAKERS: Gonzalo Navarro, University of Chile (CPM)
Ron Shamir, Tel Aviv University (CPM)
Joseph S. B. Mitchell, Stony Brook (SWAT)
Roger Wattenhofer, ETH Zurich (SWAT)

IMPORTANT DATES:
Submission: February 10, 2012
Notification: March 26, 2012
Final version: April 9, 2012
Symposium: July 3-5, 2012

Further details and a full printable pdf version of this
call for papers are available at the symposium web site:
http://cpm2012.helsinki.fi/

[DMANET] PhD-Position at Alpen-Adria-Universität Klagenfurt, Austria

2012-02-06T10:20:00.000-06:00

A university assistant position (for a PhD student) in Discrete Mathematics with
an emphasis on graph theory is available at Alpen-Adria-Universität Klagenfurt,
Austria.

Please see the official announcement (in german) for more details:
http://www.uni-klu.ac.at/career/inhalt/269_808.htm

Clemens Heuberger

--
Univ.-Prof. Dr. Clemens Heuberger Alpen-Adria-Universität Klagenfurt
Institut für Mathematik, Universitätsstraße 65-67, 9020 Klagenfurt, Austria
Tel: +43 463 2700 3121 Fax: +43 463 2700 99 3121
clemens.heuberger@aau.at http://wwwu.aau.at/cheuberg
**********************************************************
*
* 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] Global Optimization Workshop (GOW12) - Last CfP

2012-02-06T09:12:00.000-06:00

Due to numerous requests, the deadline for GOW'12 has been extended to

***** Monday, February 20, 2012 *****

Global Optimization Workshop 2012 (GOW12)
Natal, Brazil, 26-29th June, 2012.

Last Call for Papers

Global Optimization (GO) is a discipline aimed at finding global
optima for hard nonconvex optimization problems. The workshop will
bring together researchers dealing with this topic. We shall have at
most two parallel streams. Accordingly, only a limited number of
contributions will be accepted. A special issue of the Journal Of
Global Optimization will contain (fully refereed) papers derived from
works presented at the workshop.

GOW12 will take place in Natal, northeast of Brazil. The "City of the
Sun", as it is well-known, has a typical tropical climate, around
29°C, with the sun shining almost all the year. Bordered by the
Atlantic Ocean and surrounded by dunes, Natal has the perfect
combination of beautiful beaches, warm waters, lush nature and a
welcoming people, receiving more than two million Brazilian and
foreign tourists every year.

Wikipedia link: http://en.wikipedia.org/wiki/Natal,_Rio_Grande_do_Norte

Submission instructions:
------------------------------------------

Submit a 4-page extended abstract formatted using the LaTeX style
http://www.4nets.com.br/gow12/arquivos/central/latex_style.zip
through the EasyChair website
http://www.easychair.org/conferences/?conf=gow12

Important Dates:
------------------------------------------

Deadline for the submission of abstracts: February 6th, 2012
Notification of acceptance: April 6th, 2012
Deadline for reduced fee: April 20th, 2012
Welcome reception: June 25th, 2012
Start of conference: June 26th, 2012

Invited speakers:
------------------------------------------
Jon Lee (University of Michigan, USA)
Leo Liberti (Ecole Polytechnique, France)
Nelson Maculan (Universidade Federal do Rio de Janeiro, Brazil)
Frederic Messine (ENSEEIHT, France)
Panos Pardalos (University of Florida, USA)

Scientific Committee:
------------------------------------------

Daniel Aloise, Natal, Brazil (co-chair)
Charles Audet, Montreal, Canada
Pietro Belotti, Clemson, USA
Sonia Cafieri, Toulouse, France
Manoel Campelo, Fortaleza, Brazil
Emilio Carrizosa, Sevilla, Spain
Marcia Fampa, Rio de Janeiro, Brazil
Xavier Gandibleux, Nantes, France
Pierre Hansen, Montreal, Canada (co-chair)
Eligius Hendrix, Malaga, Spain
Carlile Lavor, Campinas, Brazil
Marco Locatelli, Parma, Italy
Marcel Mongeau, Toulouse, France
Dominique Orban, Montreal, Canada
Sylvain Perron, Montreal, Canada
Mauricio G. C. Resende, Florham Park, USA
Celso C. Ribeiro, Rio de Janeiro, Brazil
Caroline Rocha, Natal, Brazil
Sebastian Sager, Heidelberg, Germany
Fabio Tardella, Rome, Italy
Ider Tseveendorj, Versailles, France
Robert Weismantel, Zürich, Switzerland
Tapio Westerlund, Abo, Finland

Local Organizing Committee
------------------------------------------

Daniel Aloise (General Chair) Natal, Brazil
Caroline Rocha Natal, Brazil
Dario José Aloise Mossoró, Brazil
Lucídio dos Anjos Formiga Cabral João Pessoa, Brazil
Mariana Almeida Mossoró, Brazil
Pedro Fernandes Ribeiro Neto Mossoró, Brazil
Samuel Xavier de Souza Natal, Brazil

Contact:
------------------------------------------

For more details, see the conference website at
http://www.gow12.dca.ufrn.br
For more information, please write an email to
gow12natal@gmail.com

----------------------------------------------------
Daniel Aloise
President of the Organizing Committee

[DMANET] Call for papers in Optimization for JOCA and RAIRO-OR

2012-02-06T06:36:00.000-06:00

Dear colleagues,

A special issue of both the Journal of Convex Analysis and
RAIRO-Operations Research will be edited following the
15th Austrian-French-German Conference on Optimization (AFG'11).

Submission is open to any contribution in the fields covered by the
conference (and not only to the actual participants).

The AFG'11 was the 15th of a series of French-German meetings which
started in Oberwolfach in 1980. The last edition was organized jointly
with Austria, and took place in Toulouse last September (for more
detail, see: http://www.math.univ-toulouse.fr/afg11/).

Those who wish to submit a paper for one of these special issues must
follow the usual submission process of each journal, mentioning that
their contribution is intended for the AFG'11 special issue:

JOCA: http://www.heldermann.de/JCA/jcacover.htm
RAIRO-OR: http://journals.cambridge.org/action/displayJournal?jid=ROE

Submission deadline for both issues: June 30, 2012.

Looking forward to reading your latest research works,

G. Buttazzo L. Thibault R.J-B Wets
Managing Editors of JOCA

A.R. Mahjoub
Editor-in-Chief of RAIRO-OR

Ph. Mahey P. Maréchal M. Mongeau
Guest editors for the RAIRO-OR special issue

______________________________________________________________

Marcel Mongeau
École Nationale de l'Aviation Civile tél : +33 5 62 25 95 73
7 avenue Édouard-Belin - BP 54005 fax : +33 5 62 25 95 99
31055 Toulouse cedex 4 marcel.mongeau@enac.fr
France http://www.recherche.enac.fr/~mongeau
______________________________________________________________

[DMANET] CFP: AdHoc-Now 2012 || July 9-11,2012 - Belgrade, Serbia

2012-02-06T04:15:00.000-06:00

Call for Papers
ADHOC-NOW 2012
The 11th International Conference on Ad Hoc Networks and Wireless
Belgrade, Serbia, July 9-11, 2012
http://www.adhocnow.com/

Since its creation in 2002, the International Conference on Ad Hoc
Networks and Wireless (ADHOC-NOW) has become a well-established and
well known event dedicated to wireless and mobile computing. In the
ERA Conference Ranking Exercise, ADHOC-NOW is considered as a B
conference (same ranking as IEEE conferences ICC, Globecom, MASS,
DCOSS, etc.) ADHOC-NOW serves as a forum for interesting discussions
on ongoing research and new contributions. The conference addresses
both experimental and theoretical research in the areas of ad hoc
networks, sensor networks, mesh networks and vehicular networks. It
focuses on all issues from link layer up to the application layer.
The eleventh edition of this series will take place in Belgrade, Serbia,
from the 9th to the 11th of July, 2012.

We seek original contributions as work in progress, experimental and
theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless
Networks. Submissions must not be published or under review for another
conference or journal. We are interested, but not limited to, research
papers in any of the following areas:
* Access Control
* Algorithmic Issues
* Analytic Methods and Modeling for Performance Evaluation
* Applications and Architectures
* Autonomous Intelligent Systems
* Computing Platforms, Systems and Testbeds
* Data Communication Protocols
* Delay-Tolerant Networking
* Distributed Algorithms
* Energy Efficiency
* Geometric Graphs
* Location Discovery and Management
* Mobility Handling and Utilization
* Mobile Ad Hoc Computing Platforms
* Mobile Social Networking
* Quality-of-Service
* Robot Networks
* Secure Services and Protocols
* Self-Configuration
* Sensor Networks
* Service Discovery
* Timing Synchronization
* Vehicular Networks
* Wireless Mesh Networks
* Wireless Internet

IMPORTANT DATES
Paper Submission: February 17, 2012
Author Notification: March 30, 2012
Final Submission: April 13, 2012

All submissions must be full papers in PDF format and uploaded on:

http://senldogo0039.springer-sbm.com/ocs/home/AdHocNow2012

The conference proceedings will be published by Springer-Verlag, as part
of the Lecture Notes in Computer Science (LNCS) series. Each
accepted paper will be included in the conference proceedings, provided
at least one author of the paper registers to present the paper at the
conference. High-quality articles will be invited for submission to a
special issue of Ad Hoc & Sensor Wireless Networks: An International
Journal (AHSWN), SCIE-indexed.

General Chair
Ivan Stojmenovic, Univ. of Ottawa, Canada, and Univ. of Novi Sad, Serbia

TPC Co-Chairs
Xiangyang Li, Illinois Institute of Technology, USA
Symeon Papavassiliou, National Technical Univ. of Athens, Greece

Publicity Co-Chairs
Hannes Frey, University of Paderborn, Germany
Marcio Almeida, University of Ottawa, Canada
Sandra Sendra, Universidad Politecnica de Valencia, Spain

Local arrangements
Mirjana Prljic, Impala, Belgrade, Serbia

Proceedings Co-Chairs
Rafael Falcon, University of Ottawa, Canada
Stefan Ruehrup, Telecommunications Research Center Vienna, Austria

Submission Chair
Xu Li, INRIA Lille Ð Nord Europe, France

Webchair and Organizing Committee Chair
Milos Stojmenovic, Singidunum University, Serbia

Steering Committee Chair
Evengelos Kranakis, Carleton University,Canada
Michel Barbeau, Carleton University, Canada.
Thomas Kunz, Carleton University, Canada.
Ioanis Nikolaidis, University of Alberta, Canada.
S. S. Ravi, SUNY Albany, USA.
Violet Syrotiuk, Arizona State University, USA.
Ivan Stojmenovic, SITE University of Ottawa, Canada.
**********************************************************
*
* 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] 28th British Colloquium for Theoretical Computer Science: Call for contributions

2012-02-05T13:48:00.000-06:00

British Colloquium for Theoretical Computer Science
Manchester, UK
2nd--5th April 2012
http://bctcs2012.cs.manchester.ac.uk

CALL FOR CONTRIBUTED TALKS
Deadline for abstract submission: 19th March

The 28th British Colloquium for Theoretical Computer Science will be
hosted by the School of Computer Science, University of Manchester,
from 2nd to 5th April, 2012.

Newsflash: PhD Student Bursaries are now available. Please see the
website for details.

The colloquium features both invited and contributed talks. This
year's invited speakers are

Participants wishing to give 30 minute contributed talks may simply to
submit a title and abstract (100--300 words) by the deadline given
below.

Further details are available from the Colloquium website:
http://bctcs2012.cs.manchester.ac.uk .

Important dates:

CMCS 2012: Call for Participation and Short Contributions

2012-02-04T07:06:00.000-06:00

------------------------------------------------------------------------------
CMCS 2012 call for participation and short contributions
------------------------------------------------------------------------------

The 11th International Workshop on Coalgebraic Methods in Computer Science
31 March - 1 April 2012, Tallinn, Estonia
co-located with ETAPS 2012
www.coalg.org/cmcs12

Aims and scope
--------------

In more than a decade of research, it has been established that a wide
variety of state-based dynamical systems, like transition systems,
automata (including weighted and probabilistic variants), Markov
chains, and game-based systems, can be treated uniformly as
coalgebras. Coalgebra has developed into a field of its own interest
presenting a deep mathematical foundation, a growing field of
applications, and interactions with various other fields such as
reactive and interactive system theory, object-oriented and concurrent
programming, formal system specification, modal and description
logics, artificial intelligence, dynamical systems, control systems,
category theory, algebra, analysis, etc. The aim of the CMCS workshop
series is to bring together researchers with a common interest in the
theory of coalgebras, their logics, and their applications.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantic models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).

Registration
------------

Registration is handled via the ETAPS website; please visit

http://www.etaps.org/2012/registration

Keynote Speaker
---------------

Samson Abramsky, Oxford University, UK

Invited Speakers
----------------

Marcello Bonsangue, Leiden University, The Netherlands
Pawel Sobocinski, University of Southampton, UK

Submission of Short Contributions
---------------------------------

Submission is electronic via the easychair system at

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

following the submission guidelines below. Submission of regular
papers is closed. The submission deadline for short contributions is
February 20, 2012 (but see below under 'Important Dates'). Short
contributions will be bundled in a technical report. They should be
no more than two pages in LNCS format and may describe work in
progress, summarise work submitted to a conference or workshop
elsewhere, or in some other way appeal to the CMCS audience.

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

* 20 February 2012: submission deadline for short contributions
* 25 February 2012: author notification for short contributions
* 26 February 2012: ETAPS normal registration deadline
* 31 March - 1 April 2012: the workshop

We continue to accept short contributions (with notfication one week
after submisssion) until Februrary 27 based on avaliability of slots.
However, please note that the ETAPS normal registration deadline is
February 26.

Invited Papers
--------------
Samson Abramsky and Jonathan Zvesper.
From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference

Pawel Sobocinski.
Relational Presheaves as Labelled Transition Systems

Marcello Bonsangue, Jan Rutten and Joost Winter.
Defining context-free power series coalgebraically

Accepted Regular Papers
-----------------------

Alexander Kurz, Daniela Petrisan, Paula Severi and Fer-Jan de Vries.
An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
Bart Jacobs, Alexandra Silva and Ana Sokolova.
Trace Semantics via Determinization
Celia Picard and Ralph Matthes.
Permutations in Coinductive Graph Representation
Dusko Pavlovic.
Coalgebraic Man in the Middle
Eleftherios Matsikoudis and Edward Lee.
From Transitions to Executions
Giorgio Bacci and Marino Miculan.
Structural operational semantics for continuous state probabilistic processes
Jiri Adamek, Stefan Milius and Lawrence Moss.
On Finitary Functors and Their Presentations
Johannes Marti and Yde Venema.
Lax Extensions of Coalgebra Functors
Toby Wilkinson.
Internal Models for Coalgebraic Modal Logics
Vincenzo Ciancia and Yde Venema.
Stream automata are coalgebras

Programme Committee
-------------------

Luis Barbosa, University of Minho, Braga, Portugal
Filippo Bonchi, LIP ENS-Lyon, France
Josee Desharnais, Université Laval, Canada
Mai Gehrke, Radboud University Nijmegen, The Netherlands
H. Peter Gumm, University of Marburg, Germany
Ichiro Hasuo, University of Tokyo, Japan
Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK
Ekaterina Komendantskaya, University of Dundee, Scotland, UK
Dexter Kozen, Cornell University, Ithaca, NY, USA
Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania
Stefan Milius, Technical University of Braunschweig, Germany
Larry Moss, Indiana University, Bloomington, USA
Prakash Panangaden, McGill University, Montreal, Canada
Dirk Pattinson, Imperial College London, UK (co-chair)
Dusko Pavlovic, Royal Holloway, London, UK
Daniela Petrisan, University of Leicester, UK
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Luigi Santocanale, University of Provence, Marseille, France
Lutz Schröder, DFKI GmbH, Bremen, Germany (co-chair)
Alexandra Silva, Radboud University Nijmegen, The Netherlands
Ana Sokolova, University of Salzburg, Austria
Sam Staton, University of Cambridge, UK
Yde Venema, University of Amsterdam, The Netherlands

Steering Committee
------------------

Jiri Adamek, Technical University of Braunschweig, Germany
Corina Cirstea, University of Southampton, UK
H. Peter Gumm (chair), University of Marburg, Germany
Bart Jacobs, Radboud University Nijmegen, The Netherlands
Alexander Kurz, University of Leicester, UK
Marina Lenisa, University of Udine, Italy
Ugo Montanari, University of Pisa, Italy
Larry Moss, Indiana University, Bloomington, USA
Dirk Pattinson, Imperial College London, UK
John Power, University of Bath, UK
Horst Reichel, Technical University of Dresden, Germany
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Lutz Schröder, DFKI GmbH and University of Bremen, Germany

Publicity Chair
---------------

Alexandra Silva, Radboud University Nijmegen, The Netherlands
.

[DMANET] CMCS 2012: Call for Participation and Short Contributions

2012-02-04T06:54:00.000-06:00

The 11th International Workshop on Coalgebraic Methods in Computer Science
31 March - 1 April 2012, Tallinn, Estonia
co-located with ETAPS 2012
www.coalg.org/cmcs12

Aims and scope
--------------

The topics of the workshop include, but are not limited to:

Registration
------------

Registration is handled via the ETAPS website; please visit

http://www.etaps.org/2012/registration

Keynote Speaker
---------------

Samson Abramsky, Oxford University, UK

Invited Speakers
----------------

Marcello Bonsangue, Leiden University, The Netherlands
Pawel Sobocinski, University of Southampton, UK

Submission of Short Contributions
---------------------------------

Submission is electronic via the easychair system at

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

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

Invited Papers
--------------
Samson Abramsky and Jonathan Zvesper.
From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference

Pawel Sobocinski.
Relational Presheaves as Labelled Transition Systems

Marcello Bonsangue, Jan Rutten and Joost Winter.
Defining context-free power series coalgebraically

Accepted Regular Papers
-----------------------

Programme Committee
-------------------

Steering Committee
------------------

Publicity Chair
---------------

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

Call for papers - CCCG 2012

2012-02-03T21:56:00.000-06:00

Call for Papers - CCCG 2012

24th Canadian Conference on Computational Geometry

August 8-10, 2012, Charlottetown, PEI.

PDF version:
http://2012.cccg.ca/CFP-CCCG-2012.pdf
----------------------------------------------------

The 24th Canadian Conference on Computational Geometry will be held in Charlottetown, Prince
Edward Island, on August 8-10, 2012. There will be a reception on the evening of the 7th.

CCCG has a tradition of being welcoming to students. It is expected that this year registration fees
will be reimbursed for most students and postdocs.
See http://2012.cccg.ca for details and updates.

SCOPE

CCCG focuses on the design of efficient algorithms, the development of software, and the study of
the mathematical foundations of computational problems whose formulations involve geometric
constraints. The field of computational geometry is motivated by problems from a broad range of
application areas, as diverse as computer graphics and animation, computer vision, computer-aided
design and manufacturing, geographic information systems, pattern recognition, wireless
communications, robotics, protein folding, urban planning, graph drawing, or statistical analysis to
name just a few. Authors are invited to submit papers describing original research of theoretical or
practical significance in computational, combinatorial and discrete geometry, as well as related
areas.

AUDIENCE

CCCG is an international forum, accessible to a broad community of researchers, to disseminate and
discuss new theoretical and applied results in discrete and computational geometry. The intended
audience for this conference includes graduate and undergraduate students, researchers in the area,
and members of industry whose work involves geometric computation.

SUBMISSION DETAILS

Submissions should not exceed six pages, must be submitted electronically, and must be prepared
using LaTeX; the appropriate template is available from the conference website. Authors who feel
that additional details are necessary should include a clearly marked appendix, which will be read at
the discretion of the Program Committee. Each submission will be refereed by at least three
members of the Program Committee.
Details on the submission procedure are outlined on the conference website. Six-page papers
accepted at CCCG will appear in the printed proceedings of the conference. Electronic proceedings
without page limits will be hosted at http://cccg.ca
Selected papers from the conference will be invited for submission to a special issue of the journal
Computational Geometry: Theory and Applications.

INVITED SPEAKERS

Pankaj K. Agarwal (Duke University)
Joseph S.B. Mitchell (State University of New York at Stony Brook)
Gunter M. Ziegler (Freie Universitat Berlin) * [Paul Erdos Memorial Lecture]

IMPORTANT DATES in 2012

Submissions due: May 7
Notification of acceptance: June 4
Final versions due: June 15
Student applications for fee waivers: June 15
Early registration deadline: July 7
Conference: August 8-10 (reception on 7th)

PROGRAM COMMITTEE

Oswin Aichholzer (T.U. Graz)
Greg Aloupis (U. Libre de Bruxelles)
Therese Biedl (U. Waterloo)
David Bremner (U. New Brunswick)
Mark de Berg (T.U. Eindhoven)
Jeff Erickson (U. Illinois at Urbana-Champaign)
Ferran Hurtado (U. Politecnica de Catalunya)
John Iacono (Polytechnic Institute of New York U.)
Mark Keil (U. Saskatchewan)
David Kirkpatrick (U. British Columbia)
Stefan Langerman (U. Libre de Bruxelles)
Alex Lopez-Ortiz (U. Waterloo)
Anna Lubiw (U. Waterloo)
Anil Maheshwari (Carleton U.)
Michael McAllister (Dalhousie U.)
Pat Morin (Carleton U.)
Bradford Nickerson (U. New Brunswick)
Diane Souvaine (Tufts U.)
Csaba Toth (U. Calgary)
Godfried Toussaint (New York U. Abu Dhabi)
Ryuhei Uehara (JAIST)
Steve Wismath (U. Lethbridge)
Hamid Zarrabi-Zadeh (Sharif U. of Technology)
Norbert Zeh (Dalhousie U.)

ORGANIZING COMMITTEE

Greg Aloupis, Universite Libre de Bruxelles
David Bremner, University of New Brunswick

[DMANET] Call for papers - CCCG 2012

2012-02-03T21:43:00.000-06:00

Call for Papers - CCCG 2012

24th Canadian Conference on Computational Geometry

August 8-10, 2012, Charlottetown, PEI.

PDF version:
http://2012.cccg.ca/CFP-CCCG-2012.pdf
----------------------------------------------------

The 24th Canadian Conference on Computational Geometry will be held in Charlottetown, Prince Edward Island, on August 8-10, 2012. There will be a reception on the evening of the 7th.

CCCG has a tradition of being welcoming to students. It is expected that this year registration fees will be reimbursed for most students and postdocs.
See http://2012.cccg.ca for details and updates.

SCOPE

CCCG focuses on the design of efficient algorithms, the development of software, and the study of the mathematical foundations of computational problems whose formulations involve geometric constraints. The field of computational geometry is motivated by problems from a broad range of application areas, as diverse as computer graphics and animation, computer vision, computer-aided design and manufacturing, geographic information systems, pattern recognition, wireless communications, robotics, protein folding, urban planning, graph drawing, or statistical analysis to name just a few. Authors are invited to submit papers describing original research of theoretical or practical significance in computational, combinatorial and discrete geometry, as well as related areas.

AUDIENCE

CCCG is an international forum, accessible to a broad community of researchers, to disseminate and discuss new theoretical and applied results in discrete and computational geometry. The intended audience for this conference includes graduate and undergraduate students, researchers in the area, and members of industry whose work involves geometric computation.

SUBMISSION DETAILS

Submissions should not exceed six pages, must be submitted electronically, and must be prepared using LaTeX; the appropriate template is available from the conference website. Authors who feel that additional details are necessary should include a clearly marked appendix, which will be read at the discretion of the Program Committee. Each submission will be refereed by at least three members of the Program Committee.
Details on the submission procedure are outlined on the conference website. Six-page papers accepted at CCCG will appear in the printed proceedings of the conference. Electronic proceedings without page limits will be hosted at http://cccg.ca
Selected papers from the conference will be invited for submission to a special issue of the journal Computational Geometry: Theory and Applications.

INVITED SPEAKERS

Pankaj K. Agarwal (Duke University)
Joseph S.B. Mitchell (State University of New York at Stony Brook)
Gunter M. Ziegler (Freie Universitat Berlin) * [Paul Erdos Memorial Lecture]

IMPORTANT DATES in 2012

PROGRAM COMMITTEE

ORGANIZING COMMITTEE

Greg Aloupis, Universite Libre de Bruxelles
David Bremner, University of New Brunswick

2nd announcement: Applications of Graph Spectra in Computer Science

2012-02-03T17:24:00.000-06:00

2nd Announcement
=====================================================================================
CRM CONFERENCE ON APPLICATIONS OF GRAPH SPECTRA IN COMPUTER SCIENCE

July 16-20, 2012, Barcelona

http://www.crm.es/Activitats/Activitats/2011-2012/GraphSpectra/web-graphspectra/
=====================================================================================

DESCRIPTION

The spectra of matrices associated with a network are widely used
to characterize its properties and to extract structural information.
Applications of spectral graph theory may be easily found in
combinatorial optimization (e.g., Goemans-Williamson MAXCUT algorithm),
computer science (e.g., spectral clustering, expander graphs,
pattern recognition)
or complex networks (e.g., web page ranking, synchronization,
epidemic thresholds).

The aim of this conference is to bring together the diverse collection
of researchers from graph theory, computer science and complex networks,
who are interested in the theory and applications of graph spectra
to discuss current trends and future directions in this area.
The conference is expected to provide cross-fertilization of ideas,
create more awareness among disparate groups of researchers and
foster an increase in collaborations between theory- and
application-oriented studies.
For young researchers in particular, this will be an excellent opportunity
to see the full scope of the subject and many interesting
directions they can explore.

ORGANIZATION

The conference is organized and sponsored by

Centre de Recerca Mathematica (CRM), Barcelona
http://www.crm.es/

and co-sponsored by

Ministry of Science and Innovation (MICINN), Spain.

The conference will take place at CRM in Campus de Bellaterra,
Edifici C, 08193 Bellaterra (Barcelona).

KEYNOTE SPEAKERS

Anirban Banerjee, Indian Institute of Science Education and
Research, Kolkata
Fan Chung, University of California at San Diego
Dragos Cvetkovic, Serbian Academy of Sciences and Arts
Ernesto Estrada, University of Strathclyde
Miguel Angel Fiol, UPC BarcelonaTech
Edwin Hancock, University of York
Jurgen Jost, Max Planck Institute for Mathematics in Sciences, Leipzig
Nathan Linial, Hebrew University of Jerusalem
Ulrike von Luxburg, University of Hamburg
Piet Van Mieghem, Delft University of Technology
Daniel Spielman, Yale University

SCIENTIFIC COMMITTEE

Francesc Comellas, UPC BarcelonaTech
Fan Chung, University of California at San Diego
Dragos Cvetkovic, Serbian Academy of Sciences and Arts
Robert Elsasser, University of Paderborn
Miguel Angel Fiol, UPC BarcelonaTech
Steve Kirkland, Hamilton Institute
Nair Maria Maia de Abreu, Federal University of Rio de Janeiro
Piet Van Mieghem, Delft University of Technology
Dieter Mitsche, ETH Zurich
Vladimir Nikiforov, University of Memphis
Maria Jose Serna, UPC BarcelonaTech
Dragan Stevanovic (chair), University of Primorska, Koper, Slovenia
and University of Nis, Serbia

ORGANIZING COMMITTEE

Francesc Comellas (co-chair), UPC Barcelona
Cristina Dalfo, UPC Barcelona
Josep Fabrega, UPC Barcelona
Alicia Miralles, UPC Barcelona
Margarida Mitjana, UPC Barcelona
Dragan Stevanovic (co-chair), University of Primorska, Slovenia and
University of Nis, Serbia

IMPORTANT DATES

Abstracts may be submitted by first creating an EasyChair account
at https://www.easychair.org/conferences/?conf=ags2012,
and then by filling out "New submission" form after logging in to
your account.

Abstract submission deadline: May 15, 2012
Abstract acceptance notification: June 15, 2012

INSTEAD OF BOOK OF PROCEEDINGS

There will be no standard book of proceedings for the conference.
Instead, selected papers will be published in a special issue of
Discrete Applied Mathematics
devoted to the conference theme. The deadline for submission is
November 15, 2012.
Note that the special issue is open also for papers not presented
at the conference.
Papers will be subject to a strict review process managed by the
Guest Editors:
Francesc Comellas, Robert Elsasser and Dragan Stevanovic.

CONTACT

For more information, please contact secreteria@crm.cat
or check the website

http://www.crm.es/Activitats/Activitats/2011-2012/GraphSpectra/web-graphspectra/

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

[DMANET] 2nd announcement: Applications of Graph Spectra in Computer Science

2012-02-03T14:06:00.000-06:00

2nd Announcement
=======================================================================
CRM CONFERENCE ON APPLICATIONS OF GRAPH SPECTRA IN COMPUTER SCIENCE

July 16-20, 2012, Barcelona

http://www.crm.es/Activitats/Activitats/2011-2012/GraphSpectra/web-graphspectra/
=======================================================================

DESCRIPTION

ORGANIZATION

The conference is organized and sponsored by

Centre de Recerca Mathematica (CRM), Barcelona
http://www.crm.es/

and co-sponsored by

Ministry of Science and Innovation (MICINN), Spain.

The conference will take place at CRM in Campus de Bellaterra,
Edifici C, 08193 Bellaterra (Barcelona).

KEYNOTE SPEAKERS

SCIENTIFIC COMMITTEE

ORGANIZING COMMITTEE

IMPORTANT DATES

Abstract submission deadline: May 15, 2012
Abstract acceptance notification: June 15, 2012

INSTEAD OF BOOK OF PROCEEDINGS

CONTACT

For more information, please contact secreteria@crm.cat
or check the website

http://www.crm.es/Activitats/Activitats/2011-2012/GraphSpectra/web-graphspectra/

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

Postdoctoral Research Fellow

2012-02-03T02:28:00.000-06:00

Postdoctoral Research Fellow

The Parallel and Distributed Systems Laboratory at the Faculty of
Informatics, Masaryk University is currently expanding its research team
and
is looking for highly motivated and talented individuals to a three
year-fixed term post.

The position is available to participate in a project focused on formal
verification of complex computational systems with special emphasis on
combination of explicit and symbolic methods.

The Parallel and Distributed Systems Laboratory aims at intensifying the
basic and applied research in the area of parallel and distributed method
s
for the specification, modelling, analysis, and verification of parallel
and
distributed systems. The mainspring of the research is the development an
d
application of theories which underlie mentioned system development
activities. The objective is to bridge the gap between academics and
industry by exploiting academically well-founded formal methods and by
promoting theory formation in the academic sense on the major issues of
selected industrial areas. We want to come-up with practical solutions an
d
tooling to address the needs found in current and innovative development
industry projects.

The topic of the advertised research position is the development of new
original methods and techniques for the automated verification and analy
sis
of large-scale computer systems. The main obstacle in reaching the goal i
s
the computational complexity of the task. Several methods have been propo
sed
to fight the problem, however only few of them are used in combination.
Our
goal is to employ a synergy of explicit and symbolic methods in disstribu
ted
and parallel verifications to overcome the computational barrier.

Requirements
Candidates must hold a PhD degree (or equivalent) awarded after 1 April
2008, should be highly motivated and have a strong background in
informatics. Candidate must have excellent analytical skills, and strong
interpersonal and communication skills.

The deadline for applications is March 31, 2012. The gross salary is abou
t
2200 € per month. The post is available from 1 September 2012, but the
precise starting date is negotiable.

Interested candidates should email their CV, list of publications, brief
statement of interest and career goals, names and contact information for
3
references contained in one single PDF file to:
Prof. Ivana Cerna
Masaryk University Brno
Faculty of Informatics
Botanicka 68a, 602 00 Brno
Czech Republic
Email: cerna at fi dot muni dot cz
http://paradise.fi.muni.cz/

SAT 2012: Final Call for Papers

2012-02-02T12:52:00.000-06:00

[ We apologize if you receive multiple copies of this CFP. ]

-------------------------------------------------------------------------
15th International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2012 ---

Trento, Italy, June 17-20th, 2012
http://sat2012.fbk.eu/
-------------------------------------------------------------------------

AIM and SCOPE
=============

The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the propositional satisfiability
problem. Importantly, here SAT is interpreted in a rather broad sense:
besides plain propositional satisfiability, it includes the domains of
MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean
Formulae (QBF), Satisfiability Modulo Theories (SMT), Constraints
Programming (CSP) techniques for word-level problems and their
propositional encoding.

To this extent, many hard combinatorial problems can be encoded as SAT
instances, in the broad sense mentioned above, including problems that
arise in hardware and software verification, AI planning and
scheduling, OR resource allocation, etc. The theoretical and practical
advances in SAT research over the past twenty years have contributed
to making SAT technology an indispensable tool in these domains.

SAT 2012 will take place in Trento, Italy, a cosmopolitan city set in
a spectacular mountain scenery, and home to a world-class university
and research centres.

RELEVANT TOPICS
===============

The topics of the conference span practical and theoretical research
on SAT (in the broader sense above) and its applications, and include,
but are not limited to:

* Theoretical issues
- Combinatorial Theory of SAT
- Proof Systems and Proof Complexity in SAT
- Analysis of SAT Algorithms
* Solving:
- Improvements of current solving procedures
- Novel solving procedures, techniques and heuristics
- Incremental solving
* Beyond solving:
- Functionalities (e.g., proofs, unsat-cores, interpolants,...)
- Optimization
* Applications
- SAT techniques for other domains
- Novel Problem Encodings
- Novel Industrial Applications of SAT

A more detailed description can be found on the web site.

INVITED SPEAKERS
================

We are honored to announce the following invited speakers at SAT 2012:

* Aaron Bradley, Boulder, USA.
"SAT-based Verification with IC3: Foundations and Demands"

* Donald Knuth, Stanford, USA.
"Satisfiability and The Art of Computer Programming"

The presence of both speakers has been confirmed, although the titles
of the talks may be provisional.

AFFILIATED EVENTS
=================

SAT 2012 is co-located with the 2nd International SAT/SMT Summer School
(June 12-15), http://satsmtschool2012.fbk.eu/.

SAT 2012 will also host related events like workshops (June 16) and various
competitive events.

PAPER SUBMISSION
================

Papers must be edited in LATEX using the LNCS format and
be submitted electronically as PDF files via EasyChair.
We envisage three categories of submissions:

REGULAR PAPERS. Submissions, not exceeding fourteen (14) pages, should
contain original research, and sufficient detail to assess the
merits and relevance of the contribution. For papers reporting
experimental results, authors are strongly encouraged to make their
data available with their submission. Submissions reporting on case
studies in an industrial context are strongly invited, and should
describe details, weaknesses and strength in sufficient
depth. Simultaneous submission to other conferences with proceedings
or submission of material that has already been published elsewhere
is not allowed.

TOOL PRESENTATIONS. Submissions, not exceeding six (6) pages, should
describe the implemented tool and its novel features. A
demonstration is expected to accompany a tool presentation. Papers
describing tools that have already been presented in other
conferences before will be accepted only if significant and clear
enhancements to the tool are reported and implemented.

EXTENDED ABSTRACTS/POSTERS. Submissions, not exceeding two (2) pages,
briefly introducing work in progress, student work, or preliminary
results. These papers are expected to be presented as posters at the
conference.

Further information about paper submission, including a more detailed
description of the scope and specification of the three submission
categories, will be made available at SAT 2012 web page. The review
process will be subject to a rebuttal phase.

IMPORTANT DATES:
================
Abstract Submission: 05/02/2012
Paper Submission: 12/02/2012
Rebuttal phase: 28-30/03/2012
Final Notification: 12/04/2012
Final Version Due: 04/05/2012

SAT/SMT School: 12-15/06/2012
Workshops: 16/06/2012
Conference: 17-20/06/2012

PROCEEDINGS
===========

The proceedings of SAT 2012 will be published by Springer-Verlag in the
LNCS series.

PROGRAM CHAIRS
==============

Alessandro Cimatti -- FBK-Irst, Trento, Italy
Roberto Sebastiani -- DISI, University of Trento, Italy

PROGRAM COMMITTEE
=================

Dimitris Achlioptas -- UC Santa Cruz, USA
Fahiem Bacchus -- University of Toronto, Canada
Paul Beame -- University of Washington, USA
Armin Biere -- Johannes Kepler University, Austria
Randal Bryant -- Carnegie Mellon University, USA
Uwe Bubeck -- University of Paderborn, Germany
Nadia Creignou -- Aix-Marseille Université, France
Leonardo DeMoura -- Microsoft Research, USA
John Franco -- University of Cincinnati, USA
Malay Ganai -- NEC, USA
Enrico Giunchiglia -- Università di Genova, Italy
Youssef Hamadi -- Microsoft Research, UK
Zyiad Hanna -- Jasper, USA
Holger Hoos -- University of British Columbia, Canada
Marijn Heule -- Johannes Kepler University, Austria
Kazuo Iwama -- Kyoto University, Japan
Oliver Kullmann -- Swansea University, UK
Daniel Le Berre -- Université d'Artois, France
Ines Lynce -- Instituto Superior Técnico, Portugal
Panagiotis Manolios -- Northeastern University, USA
Joao Marques-Silva -- University College Dublin, Ireland
David Mitchell -- Simon Fraser University, Canada
Alexander Nadel -- Intel, Israel
Jussi Rintanen -- The Austrailan National University, Australia
Lakhdar Sais -- Université d'Artois, France
Karem Sakallah -- University of Michigan, USA
Bart Selman -- Cornell University, USA
Laurent Simon -- Université Paris 11, France
Carsten Sinz -- Karlsruhe Institute of Technology, Germany
Niklas Sorensson -- Chalmers University, Sweden
Ofer Strichman -- Technion, Israel
Stefan Szeider -- Vienna University of Technology, Austria
Allen Van Gelder -- University of California, Santa Cruz, USA
Toby Walsh -- University of New South Wales, Australia
Xishun Zhao -- Sun Yat-Sen University, China

[DMANET] SWAT best paper award

2012-02-02T11:49:00.000-06:00

Following a very recent decision of SWAT Steering Committee, I am
happy to make the following addition to SWAT 2012 call for papers:

A prize will be awarded to the author(s) of the best student-authored
paper. A paper is eligible if all of its authors are full-time
students at
the time of submission. This must be indicated in the submission process.

--
With best regards,
Fedor
**********************************************************
*
* 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 - Special issue of Discrete Applied Mathematics

2012-02-02T07:36:00.000-06:00

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

Special Issue of Discrete Applied Mathematics:
Applications of Graph Spectra in Computer Science
=============================================================

The spectra of matrices associated with a graph are widely used
to characterize its properties and to extract structural information.
Apart from a natural link to Discrete Mathematics,
Spectral Graph Theory has many applications in other scientific fields
such as complex networks, theoretical physics and quantum mechanics.

In Computer Science, Spectral Graph Theory provides fundamental techniques to
a series of important algorithmic problems such as
the design of interconnection networks, graph partitioning,
load balancing, as well as information retrieval and data mining.

This special issue aims to publish a collection of original work
on applications of graph spectra in Computer Science,
with a special focus on the connection between
traditional spectral graph theory on one side and
theoretical computer science or network analysis on the other side.

The deadline for submission is November 15, 2012.
Authors should submit a cover letter and a manuscript by November 15, 2012
via http://ees.elsevier.com/dam/.
Select the article type "SI: Applications of Graph Spectra" to make sure
that your work is to be considered for this special issue.
Please see Author Instructions on the site if you have not yet
submitted a paper through this web-based system.

Papers will be subject to a strict review process managed by the Guest Editors
and accepted papers will be published online individually, before
print publication.

Guest Editors:
==============
Francesc Comellas, Universitat Politècnica de Catalunya, Barcelona,
Spain, e-mail: comellas@ma4.upc.edu

Robert Elsässer, University of Paderborn, Germany, e-mail:
elsa@uni-paderborn.de

Dragan Stevanović, University of Primorska, Koper, Slovenia and
University of Niš, Serbia, e-mail: dragan.stevanovic@upr.si

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

3 associate professorships at KTH in computer science (including TCS)

2012-02-02T07:23:00.000-06:00

Informal enquiries are welcome and may be directed (from TCS candidates)
to Johan Hastad, johanh@csc.kth.se .

[DMANET] conference announcement

2012-02-02T05:52:00.000-06:00

===========================================
International Symposium on Combinatorial Optimization
(CO 2012)
17-19 September 2012, University of Oxford, UK
===========================================

CALL FOR PAPERS #1

CO 2012 is an International Symposium on Combinatorial Optimization. It is the next in a series of biennial conferences. The last few conferences were held in Malaga (2010), Warwick (2008), Porto (2006), Lancaster (2004), Paris (2002), Greenwich (2000), Brussels (1998), and London (1996). CO 2012 is hosted by the University of Oxford.

The program topics will be on any subject related to theory and applications of combinatorial optimization, which includes but not limited to:

PROGRAM TOPICS

* Computational complexity
* Constraint satisfaction
* Crew scheduling
* Cutting and packing
* Data Mining
* Exact and approximation algorithms
* Frequency assignment
* Graphs
* Heuristic methods
* Integer programming
* Location
* Meta-heuristics
* Network design
* Polyhedral theory
* Production and logistics scheduling
* Timetabling
* Vehicle routing and scheduling

PAPER SUBMISSION

Contributed papers are cordially invited. Please submit your contribution
on-line via EasyChair at https://www.easychair.org/conferences/?conf=co2012. Your submission should be a one-page (A4) abstract, which includes a list of key words and is in the PDF format.

CONFERENCE WEBSITE

Further information will be found soon on the conference website:
http://www.sbs.oxford.edu/co2012
**********************************************************
*
* 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/
*
**********************************************************

Classical Logic and Computation (CL&C'12): Call for Papers

2012-02-01T15:54:00.000-06:00

International Workshop on Classical Logic and Computation (CL&C'12)
http://www.doc.ic.ac.uk/~svb/CLaC12
July, 8 2012
Warwick, England

CL&C'12 is a satellite workshop of ICALP'12.

IMPORTANT DATES
Deadline for abstract: March, 29, 2012
Deadline for submission: April, 9, 2012
Notification of acceptance: June, 11, 2012
Final version due: June, 25, 2012
Workshop date: July, 8, 2012

INTRODUCTION
CL&C'12 is the fourth of a conference series on Classical Logic and
Computation. It intends to cover all work aiming to explore computational
aspects of classical logic and mathematics. This year CL&C will be held as
satellite workshop of ICALP'12 in Warwick:
http://www2.warwick.ac.uk/fac/cross_fac/dimap/icalp2012/

CL&C is focused on the interplay between program extraction from classical
the exploration of the computational content of mathematical and logical
principles. The scientific aim of this workshop is to bring together
researchers from both fields and exchange ideas.

SCOPE OF CL&C
This workshop aims to support a fruitful exchange of ideas between the
various lines of research on Classical Logic and Computation. Topics of
interest include, but are not limited to,

- version of lambda calculi adapted to represent classical logic;
- design of programming languages inspired by classical logic;
- cut-elimination for classical systems;
- proof representation and proof search for classical logic;
- translations of classical to intuitionistic proofs;
- constructive interpretation of non-constructive principles;
- witness extraction from classical proofs;
- constructive semantics for classical logic (e.g. game semantics);
- case studies (for any of the previous points).

SUBMISSION AND PUBLICATION.
This is intended to be an informal workshop. Participants are encouraged to
present work in progress, overviews of more extensive work, and
programmatic /
position papers, as well as completed projects. We therefore ask for
submission both of short abstracts and of longer papers.

All submitted papers will be reviewed to normal standards. The PC
recognises
two kinds of papers: it will distinguish between accepted (full) papers
that
contain unpublished results not submitted elsewhere, and presentations
of (short) papers about work in progress. The accepted papers will appear
in EPTCS.

In order to make a submission:
- Format your file using the LNCS guidelines; there is a 15 page limit.
- Use the submission instructions at

https://www.easychair.org/conferences/?conf=clc2012

A participants' proceedings will be distributed at the workshop.

PROGRAMME COMMITTEE
* Herman Geuvers (Nijmegen) - chair
* Stefano Berardi (Turin)
* Steffen van Bakel (Imperial College London)
* Silvia Ghilezan (Novi Sad)
* Ugo de'Liguoro (Turin)

CONTACT
deligu@di.unito.it

[DMANET] CFP: SI on M&S of Complex Communication Networks (SCI-E), Extended Deadline: May, 2012

2012-02-01T11:30:00.000-06:00

Dear Colleagues,

Apologies if you receive multiple copies.

Due to several requests, we have extended the deadline for the Special
Issue.

http://cecosm.yolasite.com/sisimulation.php

======================== CALL FOR PAPERS =========================

            SAGE - Simulation-Transactions of the SCS
                              (SCI-E, JCR)
          Special Issue on Agent-based Modeling & Simulation of
      Complex Adaptive Communication Networks & Environments
                              (CACOONS)

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

      Network simulation is typically an important step in the development
of most modern communication networks. It can involve the use of generalized
tools such as Matlab and C++ in addition to a variety of basic network
simulation tools such as NS2, NS3, OPNET, OMNET++ etc. demonstrating the
vibrant simulation culture prevalent in communication networks. While these
simulation tools have proven their worth for focused application case
studies, it can become increasingly difficult to use existing tools for
modeling complex communication, variability or mobility in the network as
well as for modeling complex environments surrounding the network nodes
(Which can e.g. be important in the case of Wireless networks in general and
Sensor Networks in particular, with their primary goal being the sensing of
different environment parameters).
      Unlike specialized simulation paradigms/tools, Agent-based Modeling
(ABM) is a flexible general-purpose modeling and simulation paradigm
well-established in various scientific disciplines for the modeling of
complex phenomena emanating from Complex Adaptive Systems (cas), systems
where a large number of communicating components interact in a nonlinear
manner, thereby resulting in advanced adaptive behavior observable at the
global scale. ABM has previously found uses extensively in social,
biological, ecological, archeological and other scientific domains.
      Due to recent rapid advancements in Communication technology, today's
Communication networks such as those formed by wireless sensor, ad-hoc,
Peer-Peer (P2P), multiagent, nano-Communication and mobile robot
communication networks, are expected to grow larger and more complex than
ever previously anticipated. Thus, these networks can give rise to complex
global emergent phenomena whose effects cannot be easily traced back to the
individual components. Such patterns can be important to understand since,
at times, they can have considerable effect on various aspects of a network
such as unanticipated traffic congestion, unprecedented increase in
communication cost or perhaps a complete network/grid shutdown. Some
well-known examples include the emergence of cascading faults in Message
Queue-based Financial transactions after New Year holidays, recent cascading
failures reported in the Amazon.com cloud, effects of viral and worm
infections in large networks, effects of torrent and other complex traffic
on ISP network planning and corporate networks, multi-player gaming and
other similar P2P traffic in company intranets, self-organization and
self-assembly related effects in sensor and robotic communication networks
etc.
      Recent work has demonstrated that ABM can also offer a much shorter
learning curve and ability to flexibly model Complex phenomena in
communication networks (e.g. such as networks with a larger scale,
heterogeneous or mobile nodes etc.). ABM can thus prove to be suitable in
application case studies, testing of new communication protocols,
investigation of problems in large-scale networks before or after deployment
or for modeling improvement in existing algorithms and hardware.
      The goal of this special issue is to solicit papers, not submitted
elsewhere for review, on the state-of-the-art with a focus on the use of
modeling and simulation for theoretical frameworks, application case studies
as well as novel communication models of Complex Adaptive Communication
Networks and Environments. Suggested topics include but are not limited to:
-     Wireless Sensor and Actuator Networks (Routing, data aggregation,
fusion, energy consumption and any other issues)
-     Complex environments surrounding sensors and mobile robots
-     Mobile and swarm robotic networks
-     Nano-Communication networks
-     Mobile ad-hoc networks
-     P2P networks (Structured and Unstructured etc.)
-     Engineered self-organization for Green computing in networks
-     Planning and management of home and corporate (Wired/Wireless)
Networks
-     Modeling and Simulation of Multiagent Systems (including Mobile
agents, Learning and Communicating agents etc.)
-     Effects of cooperative, competitive agents and peers on networks
-     Game theoretical approaches in communication networks
-     Fault-tolerant and self-healing large scale networks
-     Emergent effects of security and trust policies in large scale network
-     Use of agent-based modeling for or in conjunction with network
emulation
-     Service Oriented Architectures, Semantic web, use of XML/SOAP etc.
-     Client Server, three tier and n-tiered architectures
-     Pervasive Communication networks, for example, those using Mobile
Devices, RFIDs and others
-     Simulation of Internet and Intranet scale networks
-     Complex Network analysis itself or else combined with agent-based
modeling for classifying or Modeling and Simulation of large networks
(including measures of Degree, eccentricity and other Centralities,
Clustering Coefficients, Matching indices etc.) of Networks
-     Internet based Social Networking (including the use of Social Network
Analysis)
-     Coupling Formal Specification Models with agent-based modeling of
Communication Networks (using frameworks such as DEVS, FABS etc.)
-     Verification, Validation and Accreditation of network simulation
models
-     Signaling and Communication Networks inside living beings (cells,
animals, plants etc.) or between living or intelligent beings
-     Modeling Communication Networks as Social Simulation problems
-     Critical Comparative Reviews of studies using traditional Network
Simulators and agent-based modeling
-     Use of agent-based, multiagent tools and toolkits (NetLogo, Repast,
Mason, Jade etc.) for modeling of communication networks

Submission process:
Full papers, describing original, previously unpublished research work,
reviews, experimental efforts and practical experiences are solicited. The
due dates given below are firm and must be observed in order to ensure
timely reviews and, in the event of acceptance, inclusion of a paper in the
special issue.
Instructions for Manuscript Preparation

For manuscript formatting and other guidelines, please visit the Author
Guidelines for "Simulation".

Submissions of full Paper for review
All manuscripts must be submitted electronically through the paper
submission system to the "Simulation" Manuscript Submission System. In the
cover letter, author(s) must specifically mark the paper as intended for
this special issue as follows: "Submission for the Special Issue of
Simulation: Modeling and Simulation of Complex Adaptive Communication
Networks and Environments."

Note: Manuscripts must not have been previously published or be submitted
for publication elsewhere. Each submitted manuscript must include title,
names, authors' affiliations, postal and e-mail addresses and a list of
keywords. For multiple author submission, please identify the corresponding
author. Details on expansion of existing conference papers are given on the
Journal website.

Links:
Submission System: http://mc.manuscriptcentral.com/simulation
Author Guidelines: http://scs.org/?q=node/92

Due Dates
Full Papers Due   May 31, 2012
Notification of Acceptance    June 30, 2012
Minor Revisions Due     July 31, 2012
Major Revisions & Final Papers Due September 30, 2012
Publication Expected    Spring 2013

Final paper submissions
Each final submission must be prepared based on the Simulation journal
requirements (see Author Guidelines for "Simulation" page).

Guest Editors of the Special Issue:
Muaz Niazi, University of Stirling, Scotland, muaz.niazi@gmail.com, Amir
Hussain, University of Stirling, Scotland, ahu@cs.stir.ac.uk
http://www.uk.sagepub.com/repository/binaries/pdf/SIM-Cacoons.pdf
http://scs.org/simulation/specialissues?q=node/289

postdoctoral position in Cambridge

2012-02-01T10:31:00.000-06:00

http://www.jobs.cam.ac.uk/job/-12991/

Applications are invited for the position of postdoctoral research associate
in the area of Logic and Complexity Theory. The position is for one year
initially, to start on 1 April 2012 or as soon as possible thereafter, with a
possible extension of tenure to 1 April 2014, dependent on funding being
available.

The successful candidate will work on an EPSRC-funded project in the area of
Descriptive Complexity with Algebraic Operators under the supervision of Prof.
Anuj Dawar.

Candidates should have a PhD degree in Computer Science, Mathematics or a
related discipline, with research experience in a relevant area of theoretical
computer science. Candidates with a published record in the areas of logic and
algorithms, computational complexity and algebraic algorithms would be
particularly welcome.

Informal expressions of interest and enquiries should be made to: Prof. Anuj
Dawar: anuj.dawar@cl.cam.ac.uk

Applications should include:

A CV, a brief statement of the particular contribution you would make to the
project and a completed form CHRIS6: http://www.admin.cam.ac.uk/offices/hr/form
s/chris6/

Completed applications should be sent by post to: Personnel-Admin, Computer
Laboratory, Williams Gates Building, JJ Thomson Avenue, Cambridge, CB3 0FD or
by email to: personnel-admin@cl.cam.ac.uk

* The funds for this post are available for one year in the first instance.

Quote Reference: NR12991,Closing Date: 29 February 2012

[DMANET] Postdoc/PhD/Master positions in Health Care Management at the Ecole des Mines de Saint-Etienne, France

2012-02-01T09:13:00.000-06:00

Open one postdoc and two Phd (may be preceded by master thesis) at the Ecole des Mines de Saint-Etienne (France) in Logistics and Home Health Cares department (http://www.emse.fr/spip/-Departement-genie-industriel-.html).

* Skills in operations research and/or stochastic optimization will be appreciated.

* Find details at :

Postdoc position on Logistics of home health cares

http://www.emse.fr/~augusto/gih/downloads/PostDocHomeCare.pdf

Master/Phd position on Demand modelling and operation management of complex cares (English version on the second page)

http://www.emse.fr/~augusto/gih/downloads/MasterTheseSoinsComplexe2012.pdf

Master/Phd position on "Optimisation dynamique des flux de patients et de ressources humaines d'un hôpital en période d'infections épidémiques" (Knowledge of french requested, because of partnership with French hospitals)

http://www.emse.fr/~augusto/gih/downloads/SujetMasterTheseHOST.pdf

* Send applications by email to Xiaolan Xie (xie@emse.fr)

[DMANET] EuoCG2012: Call for participation

2012-02-01T02:49:00.001-06:00

EuroCG 2012
28th European Workshop on Computational Geometry
March 19-21, 2012 - Assisi, Perugia, Italy
http://www.diei.unipg.it/eurocg2012

Invited Speakers:

* Olivier Devillers, INRIA Sophia Antipolis.
* Jan Kratochvíl, Charles University Prague.
* Günter Rote, Freie Universität Berlin.

Accepted Papers:
http://www.diei.unipg.it/eurocg2012/accepted.html

Early registration ends February 24. Early registration fees are Euro 120 for
students and 170 for non-students. To register for EuroCG 2012, please go
to http://www.diei.unipg.it/eurocg2012/registration.html

Accomodation Information can be found at http://www.diei.unipg.it/eurocg2012/accommodation.html

For travel information, please go to http://www.diei.unipg.it/eurocg2012/travel.html

We look forward to seeing you in Assisi.

The EuroCG 2012 Organizing Committee
**********************************************************
*
* 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/
*
**********************************************************

EuoCG2012: Call for participation

2012-02-01T02:49:00.000-06:00

EuroCG 2012
28th European Workshop on Computational Geometry
March 19-21, 2012 - Assisi, Perugia, Italy
http://www.diei.unipg.it/eurocg2012

Invited Speakers:

* Olivier Devillers, INRIA Sophia Antipolis.
* Jan Kratochvíl, Charles University Prague.
* Günter Rote, Freie Universität Berlin.

Accepted Papers:
http://www.diei.unipg.it/eurocg2012/accepted.html

Accomodation Information can be found at http://www.diei.unipg.it/eurocg2012/accommodation.html

For travel information, please go to http://www.diei.unipg.it/eurocg2012/travel.html

We look forward to seeing you in Assisi.

The EuroCG 2012 Organizing Committee

Permanent Position at IBM TJ Watson Research Center (Algorithms group)

2012-01-31T17:18:00.000-06:00

Permanent Position at IBM TJ Watson Research Center (Algorithms group)
Deadline: February 19, 2012
Web: https://jobs3.netmedia1.com/cp/job_summary.jsp?job_id=RES-0362481

We invite applications for a permanent research staff position in the
Algorithms group (http://researcher.ibm.com/researcher/view_pic.php?id=
134)
at IBM TJ Watson Research Center. We do basic research in optimization,
approximation and online algorithms and other areas of theoretical comput
er
science and apply our theoretical ideas to industrial problems. Applicant
s
must have a Ph.D. (or obtain the degree by the time of employment) in
Computer Science or in a closely related field. Complete details are
available at https://jobs3.netmedia1.com/cp/job_summary.jsp?job_id=RES-
0362481

IBM is committed to creating a diverse environment and is proud to be an
equal opportunity employer. All qualified applicants will receive
consideration for employment without regard to race, color, religion,
gender, gender identity or expression, sexual orientation, national origi
n,
genetics, disability, age, or veteran status.

[DMANET] [IEEE AOC 2012] Call for Papers

2012-01-31T03:00:00.000-06:00

jointly supported by the

SCAMPI project
funded by the FP7-ICT Programme under the
Future Internet Research and Experimentation (FIRE) initiative
http://www.ict-scampi.eu/

and

RECOGNITION project
funded by the FP7-ICT Programme under the
Future and Emerging Technologies (FET) initiative
http://www.recognition-project.eu/

Fast Track on Computer Communication Journal
http://www.elsevier.com/locate/comcom

**** Submission Deadline --- February 17, 2012 ****
--------------------------------------------------------------------------------

Topics of interest for AOC 2012 include, but are not limited to:

PAPER SUBMISSION AND PUBLICATION
--------------------------------

Extended versions of workshop selected papers will be considered for possible
fast track publication on the Computer Communications Journal (Elsevier).

IMPORTANT DATES
---------------
Full papers due: February 17, 2012
Notification: April 4, 2012
Workshop: June 25, 2012

ORGANIZING COMMITTEE
--------------------

WORKSHOP Chairs
Merkouris Karaliopoulos, University of Athens, Greece
Chiara Boldrini, IIT-CNR, Italy

STEERING Committee
Marco Conti, IIT-CNR, Italy
Silvia Giordano, SUPSI, Switzerland
Ioannis Stavrakakis, University of Athens, Greece

PUBLICITY Chairs
Fabio Pezzoni, IIT-CNR, Italy
Pushpendra Singh, IIIT Delhi, India

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

Postdoctoral Researcher in Forecasting & Time Series Data Mininig

2012-01-30T12:02:00.000-06:00

==============================================
Postdoctoral Researcher
in the
Lancaster Centre for Forecasting

Lancaster University Management School
Department of Management Science
www.lums.lancs.ac.uk/forecasting
==============================================

Salary: £25,251 to £35,938
Closing Date: Monday 12 March 2012
Interview Date: Monday 26 March 2012
Reference: A363

Applications are invited for a two-year post-doctoral position to commence early in 2012, funded by the Lanacster Research Centre for Forecasting.

You should have the potential to develop academic and applied research of international standard; research interest and expertise should include the areas of time series forecasting, and / or time series data mining, either with methods of statistics, econometrics, machine learning or computational intelligence (e.g. artificial Neural Networks, etc), preferably in the context of management science, operational research or operations management. You should have, or almost have, excellent Masters and PhD degrees in management, engineering or computer science (or in a related subject area), with initial publications in preparation for leading scholarly journals. Corporate experience from applied research and consultancy projects is particularly valued. You will also have excellent verbal/written communication skills, a strong quantitative background, and basic computer programming experience (in C#, Matlab, or R etc.).

You would be expected to work approximately two days per week for the forecasting centre under the supervision of Dr Sven F Crone and Prof Robert Fildes, and to engage in joint research with the team in the remainder. You will work with academic colleagues and students whilst developing their research agenda. In addition to all aspects of academic research you will support the Forecasting Centre by engaging in applied forecasting research projects with companies, liaising with external clients, providing support in executive education courses and supporting the above activities through marketing and administration.

If you are selected to go through to the next stage of recruitment you will be asked to provide a complete research proposal in the area of forecasting or data mining on time series data according to the guidelines provided online which can be found at: www.lums.lancs.ac.uk/departments/ManSci/Research/

Enquiries on the research topics should be directed to either: Professor Robert Fildes (Tel: +44 1524 593879) or Dr. Sven F. Crone, Directors, Lancaster Centre for Forecasting, Tel. +44 (0)1524 592991 - Email: r.fildes@lancaster.ac.uk or s.crone@lancaster.ac.uk

Apply Online

Further details:
Job Description http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A262%20JD.pdf
Person Specification http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A363%20PS.pdf
Further Info http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A363%20Additional%20Info.pdf

Theory Announcements

[DMANET] Ph.D. positions in algorithms for wireless networks at Reykjavik University

Announcement: 2nd International SAT/SMT Summer School

[DMANET] GD 2012: Preliminary Call for Papers

GD 2012: Preliminary Call for Papers

CFP: 8th Scandinavian Logic Symposium

[DMANET] COCOON 2012: Final call for papers

[DMANET] Preliminary CFP: SustainIT 2012 - IFIP Conference on Sustainable Internet & ICT for Sustainability

CFP: TCS 2012

[DMANET] Open faculty position - Mathematical Optimization - U of Cologne

Open faculty position - Mathematical Optimization - U of Cologne

[DMANET] CFP - APPROX RANDOM 2012

DICE 2012 - Call for Presentations

[DMANET] CFP:: ICIA2012- Malaysia- Kuala Terengganu

[DMANET] ACM Q2SWinet 2012: Call for Papers

2nd CfP: ESSLLI 2012 Student Session

2nd International Conference on Practice and Theory of Algorithms in (Computer) Systems - TAPAS 2012

[DMANET] [IEEE AOC 2012] Call for Papers - Deadline fast approching

ICTAC'12: 2nd Call For Papers

ISSAC 2012 Call for Posters

[DMANET] ICALP 2012, 2nd Call for Papers

Job Vacancy: Professor in Management Science

[DMANET] 2012 AARMS Summer School

from Bernard Chazelle: Institute for Advanced Study Summer School in Computation and Biology, July 9-20, 2012

HIIT Postdoc Call (DL February 29, 2012)

[DMANET] Call for Papers: VLC 2012 (August, Miami)

[DMANET] Computational Optimization

CFP - APPROX RANDOM 2012

[DMANET] Three academic posts in Royal Holloway, University of London

CFP: AiML 2012

[ISBRA-L] Full Professor in Bioinformatics

[DMANET] Two Ph.D. positions in algorithms and networking at Reykjavik University

[DMANET] CfP - WiNMee 2012 - DEADLINE APPROACHING (15 February 2012)

[DMANET] Post-Doc Position at TU Chemnitz

[DMANET] APEX 2012: Call for participation

[DMANET] DBSEC 2012 - Deadline extended to February 26, 2012 (firm deadline)

[DMANET] 2nd Call for PRIZE NOMINATION: Prize for Innovation in Distributed Computing

[DMANET] Second announcement and call for papers - MATCH-UP 2012: the Second International Workshop on Matching Under Preferences

Second announcement and call for papers - MATCH-UP 2012: the Second International Workshop on Matching Under Preferences

[DMANET] 2nd CfP FUTURE COMPUTING 2012 July 22-27, 2012 - Nice, France

British Colloquium for Theoretical Computer Science

[DMANET] 3 associate professorships at KTH in computer science (including TCS)

[DMANET] Postdoctoral Fellow position at Duke University

[DMANET] *Reminder - Deadline 17h February* CFP: SCOR 2012 - 3rd Student Conference on Operational Research

[DMANET] 2nd cfp COGNITIVE 2012 July 22-27, 2011 - Nice, France

[DMANET] CFP - VTP 2012: 1st IEEE WoWMoM Workshop on VANETs from Theory to Practice

[DMANET] PostDoc position at University Paris 13

[DMANET] PhD Studentship in Computer Science and Operational Research: Computational Search

[DMANET] ISCO 2012 - CALL FOR PARTICIPATION

[DMANET] Joint MIT-SUTD postdoc

[DMANET] WG 2012 SECOND CALL FOR PAPERS - Submission page is now open

[DMANET] Postdoc Positions in Algorithms & Complexity and in Probabilistic Reasoning at the Vienna University of Technology, Austria

[DMANET] ATMOS 2012: first call for papers

[DMANET] CPM 2012 - Final Call for Papers

[DMANET] PhD-Position at Alpen-Adria-Universität Klagenfurt, Austria

[DMANET] Global Optimization Workshop (GOW12) - Last CfP

[DMANET] Call for papers in Optimization for JOCA and RAIRO-OR

[DMANET] CFP: AdHoc-Now 2012 || July 9-11,2012 - Belgrade, Serbia

[DMANET] 28th British Colloquium for Theoretical Computer Science: Call for contributions

CMCS 2012: Call for Participation and Short Contributions

[DMANET] CMCS 2012: Call for Participation and Short Contributions

Call for papers - CCCG 2012

[DMANET] Call for papers - CCCG 2012

2nd announcement: Applications of Graph Spectra in Computer Science

[DMANET] 2nd announcement: Applications of Graph Spectra in Computer Science

Postdoctoral Research Fellow

SAT 2012: Final Call for Papers

[DMANET] SWAT best paper award

[DMANET] Cfp - Special issue of Discrete Applied Mathematics

3 associate professorships at KTH in computer science (including TCS)

[DMANET] conference announcement

Classical Logic and Computation (CL&C'12): Call for Papers

[DMANET] CFP: SI on M&S of Complex Communication Networks (SCI-E), Extended Deadline: May, 2012

postdoctoral position in Cambridge

[DMANET] Postdoc/PhD/Master positions in Health Care Management at the Ecole des Mines de Saint-Etienne, France

[DMANET] EuoCG2012: Call for participation

EuoCG2012: Call for participation

Permanent Position at IBM TJ Watson Research Center (Algorithms group)

[DMANET] [IEEE AOC 2012] Call for Papers

Postdoctoral Researcher in Forecasting & Time Series Data Mininig

[DMANET] Reminder - Deadline 17h February CFP: SCOR 2012 - 3rd Student Conference on Operational Research