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

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

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.

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

CMCS 2012: Call for Participation and Short Contributions

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

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

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

SPONSORS

We thank the following organizations for generously supporting CCCG 2012.

AARMS
Mprime
PIMS
Fields

[DMANET] Call for papers - CCCG 2012

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

SPONSORS

We thank the following organizations for generously supporting CCCG 2012.

AARMS
Mprime
PIMS
Fields

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

2nd announcement: Applications of Graph Spectra in Computer Science

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

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.

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

Postdoctoral Research Fellow

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

[ 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 Té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 -- Université 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

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

=============================================================
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.

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

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

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
.

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

[DMANET] conference announcement

===========================================
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

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

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

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

postdoctoral position in Cambridge

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

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)

**********************************************************
*
* 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] EuoCG2012: Call for participation

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

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