Tuesday, October 21, 2014

[DMANET] Position at IBM Research: Research Staff Member in Mathematical Programming

===========================================================
Position at IBM Research: Research Staff Member (in Mathematical Programming)
===========================================================

IBM Research is seeking a Research Staff Member to work with the
Mathematical Programming group in the Business Solutions and
Mathematical Sciences Department. The ideal candidate should possess a
strong publication record and be willing and able to apply theoretical
ideas to industrial problems.

Our group offers a unique environment that combines basic research
with applied optimization projects for our internal and external
customers. A Research Staff Member is expected to conduct basic
research, publish in leading journals and present in scientific
conferences, as well as to model, design and implement solutions for
practical problems.

IBM T.J Watson Research Center
(http://www.watson.ibm.com/general_info_ykt.shtml) is located
30 miles north of New York City in Yorktown Heights, NY.

Interested candidates are invited to send their CVs with names of
references to leoliberti@us.ibm.com
**********************************************************
*
* 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] Director, Helsinki Institute for Information Technology HIIT

Aalto University and the University of Helsinki are looking for a proven
leader to be the next Director of Helsinki Institute for Information
Technology HIIT.

The new leader will create and execute an ambitious research agenda in
an institute conducting basic and applied research in ICT. With almost
300 multidisciplinary researchers, a budget of EUR 10 million and
partnerships with global ICT corporations and major research
institutions, the Director has an opportunity to contribute to ICT
research with world-class results. http://www.hiit.fi

The parent universities of HIIT offer up to a five years contract
starting from August 1, 2015 and excellent facilities in Finland. The
position is renewable.

The application deadline is November 20, 2014.

More information at www.hiit.fi/jobs

Additional information is available from:

Professor Risto Nieminen, Dean of Aalto University School of Science,
risto.nieminen@aalto.fi
Professor Jouko Väänänen, Dean of Faculty of Science at University of
Helsinki, ml-dekaani@helsinki.fi
Professor Pekka Orponen, Head of the Department of Information and
Computer Science at Aalto University, pekka.orponen@aalto.fi
Professor Jukka Paakki, Head of the Department of Computer Science at
the University of Helsinki, jukka.paakki@helsinki.fi

Recruitment process: HR Specialist Helena Knuuttila,
helena.knuuttila@aalto.fi
**********************************************************
*
* 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] Call for papers : special issue of EURO Journal on Computational Optimization on Nonlinear and Combinatorial Methods for Energy Optimization

Dear colleagues,

Following the recent successful "Workshop on Mathematical Models and
Methods for Energy Optimization (CWM^3EO)"

http://www.math.bme.hu/CostWG2014

of the EU COST-Action TD1207 on "Mathematical Optimization in the Decision
Support Systems for Efficient and Robust Energy Networks (ICT)"

http://energy-opt.eu

and in anticipation of the forthcoming PGMO-COST "Workshop on Validation
and Software"

http://www.fondation-hadamard.fr/fr/pgmo/conferences/2014/cost

we are glad to announce a special issue of the journal EURO Journal on
Computational Optimization (EJCO) about "Nonlinear and Combinatorial
Methods for Energy Optimization".

Energy optimization is among the biggest challenges of our time, since
energy is a scarce resource whose efficient production and fair
distribution is associated with many technical, economical, political and
ethical issues like environmental protection and people health.
Optimization problems arise at different levels: planning, production,
transmission, distribution, maintenance, only to mention a few.

We are looking for papers related to the themes of optimization methods
applied to the energy optimization context. Topics of interest include but
are not limited to:
- Energy markets
- Unit commitment
- Economic dispatch
- Nuclear reactors outage
- Infrastructure planning
- Energy distribution
- Smart grid optimization
- Integration of renewables
- Nonlinear and discrete methods for energy related challenges

All interested researchers are invited to submit by January 31, 2015 high
quality contributions to the website
https://www.editorialmanager.com/ejco/

In order to submit a paper for a Special Issue,

1. Log on the editorial manager using the Author Login.

2. Select Submit New Manuscript in the main menu.

3. In the drop down list associated with Choose Article Type, select the
desired special issue ("SI: Nonlinear and Combinatorial Methods for Energy
Optimization"). Note that the entries corresponding to the special issues
start with SI.


Looking forward to receiving your contributions.

The Guest Editors

Claudia D'Ambrosio
Antonio Frangioni
Andrea Lodi
Martin Mevissen


**********************************************************
*
* 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] CIAC 2015 SUBMISSION SERVER IS NOW OPEN

CIAC 2015: SECOND ANNOUNCEMENT AND CALL FOR PAPERS


9th International Conference on Algorithms and Complexity (CIAC)
May 20-22, 2015, Paris, France

http://www.lamsade.dauphine.fr/~ciac2015/cfp.php

The 9th International Conference on Algorithms and Complexity is
intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and
experimentation of efficient algorithms and data structures.

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

sequential, parallel and distributed algorithms and data structures;
approximation and randomized algorithms;
graph algorithms and graph drawing;
on-line and streaming algorithms;
analysis of algorithms and computational complexity;
algorithm engineering;
web algorithms;
algorithmic game theory;
computational biology;
communication networks;
computational geometry;
discrete optimization.

The conference proceedings will be published by Springer-Verlag in
its Lecture Notes in Computer Science (LNCS) series.

Deadline for submission: November 02, 2014.
Notification of acceptance: December 22, 2014.
Final manuscript, camera ready: January 31, 2015.
Conference: May 20-22, 2015.

Invited Speakers
Elias Koutsoupias, St Anne's College, Oxford University, UK
Haim Kaplan, School of Computer Science, Tel Aviv University, Israel
Bernard Chazelle, Department of Computer Science, Princeton University, USA
Mikkel Thorup, Department of Computer Science, University of
Copenhagen, Denmark

Steering Committee
Giorgio Ausiello, Sapienza University of Rome, Italy
Josep Diaz, TU Catalonia, Spain
Rossella Petreschi, Sapienza University of Rome, Italy
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece

Program Committee
Hannah Bast, University of Freiburg, Germany
Vincenzo Bonifaci, IASI-CNR, Rome, Italy
Jérémie Chalopin, CNRS and Université d'Aix-Marseille, France
Victor Chepoi, University of Aix-Marseille, France
Marek Chrobak, University of California, Riverside, USA
Pierluigi Crescenzi, University of Florence, Italy
Jurek Czyzowicz, University of Québec in Outaouais, Canada
Yann Disser, TU Berlin, Germany
Thomas Erlebach, University of Leicester, UK
Bruno Escoffier, UPMC, France
Irene Finocchi, Sapienza University of Rome, Italy
Fedor Fomin, University of Bergen, Norway
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Herman Haverkort, TU Eindhoven, Netherlands
Matúš Mihalák, ETH Zurich, Switzerland
Luca Moscardelli, University of Chieti-Pescara, Italy
Yoshio Okamoto, University of Electro-Communications, Japan
Vangelis Th. Paschos, University Paris-Dauphine, France
David Peleg, Weizmann Institute of Science, Israel
Marie-France Sagot, Inria & University Lyon 1, France
Piotr Sankowski, University of Warsaw, Poland
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece
Dimitrios M. Thilikos, CNRS, LIRMM, France and UoA, Greece
Roger Wattenhofer, ETH Zurich, Switzerland
Peter Widmayer (Chair), ETH Zurich, Switzerland
Gerhard J. Woeginger, TU Eindhoven, Netherlands

Organizing Committee
Katerina Kinta, University Paris-Dauphine, France
Cecile Murat, University Paris-Dauphine, France
Eleni Palaiologou, University Paris-Dauphine, France
Vangelis Th. Paschos (Chair), University Paris-Dauphine, France
Olivier Rouyer, University Paris-Dauphine, France
Florian Sikora, University Paris-Dauphine, France
Georgios Stamoulis, University Paris-Dauphine, France

--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/

**********************************************************
*
* 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] Heillbronn Institute Research Fellowship (UK)

Deadline November 27, 2014

The University of Bristol, School of Mathematics invites applications
for one or more Research Fellowships in association with the Heilbronn
Institute for Mathematical Research. You will divide your time equally
between your own research and the research programme of the Heilbronn
Institute.

The Fellowships will be for three years, with a preferred start date
in October 2015, though another date may be possible by agreement.
Fellows are likely to be working in Bristol during the fellowship,
though may have the opportunity to work in London.

Research areas of interest include but are not restricted to Number
Theory and Algebraic Geometry, Algebra, Combinatorics, Probability,
Quantum Information, Computation Statistics and Data Science.

Please see the following link for further details as well as the
application process.

http://www.bristol.ac.uk/jobs/find/details.html?nPostingID=2489&nPostingTargetID=8900&option=28&sort=DESC&respnr=1&ID=Q50FK026203F3VBQBV7V77V83&keywords=heilbronn&Resultsperpage=10&lg=UK&mask=uobext
**********************************************************
*
* 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] ICALP 2015 First Call for Papers

ICALP 2015

http://www.kurims.kyoto-u.ac.jp/icalp-lics2015/

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

The 42nd International Colloquium on Automata, Languages, and
Programming (ICALP) will take place in the period 6-10 July 2015 in
Kyoto, Japan. The conference will co-locate with LICS 2015, the 30th
ACM/IEEE Symposium on Logic in Computer Science. The ICALP 2015
conference chair is Kazuo Iwama (Kyoto University).

ICALP is the main conference and annual meeting of the European
Association for Theoretical Computer Science (EATCS). As usual, the
main conference will be preceded and/or followed by a series of
workshops.

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

Submission deadline: Tuesday, 17 February 2015, 23:59 PST (Pacific
Standard Time, UTC-8)
Author notification: 15 April 2015
Final manuscript due: 30 April 2015

Deadlines are firm; late submissions will not be considered.

Proceedings
-----------

ICALP proceedings are published in the Springer-Verlag ARCoSS
(Advanced Research in Computing and Software Science) subseries of
LNCS (Lecture Notes in Computer Science).

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

Ken Kawarabayashi, NII, Japan
Valerie King, University of Victoria, Canada
Thomas Moscibroda, MSR Asia, China
Anca Muscholl, Universite Bordeaux, France (Joint with LICS)
Peter O'Hearn, Facebook, UK (Joint with LICS)

Invited Tutorial Speakers (Joint with LICS)
-------------------------------------------
Piotr Indyk, MIT, USA
Andrew Pitts, University of Cambridge, UK
Geoffrey Smith, Florida International University, USA

Masterclass speaker
-------------------
Ryuhei Uehara, JAIST, Japan

Topics
======

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, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Principles and Semantics of Programming Languages
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi

Track C: Foundations of Networked Computation:
Models, Algorithms and Information Management
------------------------------------------------------

* Algorithmic Aspects of Networks and Networking
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Submission Guidelines
--------------------

Authors are invited to submit an extended abstract of no more than 12
pages, including references, in LNCS style presenting original
research on the theory of Computer Science. All submissions will be
electronic via the EasyChair page for the conference, with three
tracks (A, B and C):

https://easychair.org/conferences/?conf=icalp2015

Submissions should be made to the appropriate track of the conference.
No prior publication or simultaneous submission to other publication
outlets (either a conference or a journal) is allowed.

Submissions must adhere to the specified format and
length. Submissions that are too long or formatted incorrectly may be
rejected immediately. All the technical details that are necessary
for a proper scientific evaluation of a submission must be included in
a clearly-labelled appendix, to be consulted at the discretion of
program committee members. This includes, in particular, the proofs of
all the key theorems in a paper.

Should I submit my paper to Track A or Track C?
------------------------------------------------

While the scope of Tracks A and B are generally well understood given
their long history, the situation for Track C may be less obvious. In
particular, some clarifications may be helpful regarding areas of
potential overlap, especially between Tracks A and C.

The aim for Track C is to be the leading venue for theory papers truly
motivated by networking applications, and/or proposing theoretical
results relevant to real networking, certified analytically, but not
necessarily tested practically. The motivation for the track was the
lack of good venues for theory papers motivated by applications in
networking. On the one hand, the good networking conferences typically
ask for extended experiments and/or simulations, while the TCS
community is hardly able to do such experiments or simulations. On the
other hand, the good conferences on algorithms tend to judge a paper
based only on its technical difficulty and on its significance from an
algorithmic perspective, which may not be the same as when judging the
paper from the perspective of impact on networks.

Several areas of algorithmic study of interest to track C have a broad
overlap with track A. Graph algorithmics can belong in either, though
if the work is not linked to networking, it is more appropriate in
track A. Algorithmic game theory is another area of major
overlap. Aspects involving complexity, the computation of equilibria
and approximations, belong more in Track A, while results with
applications in auctions, networks and some aspects of mechanism
design belong in Track C.

Finally, it should be noted that algorithms and complexity of
message-passing based distributed computing belong squarely in track
C, while certain other aspects of distributed computing do not fall
under its scope.

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.

Committees
==========

Track A: Algorithms, complexity, and games
------------------------------------------

Peyman Afshani, Aarhus University, Denmark
Hee-Kap Ahn, POSTECH, South Korea
Hans Bodlaender Utrecht University, The Netherlands
Karl Bringmann, Max-Planck Institut für Informatik, Germany
Sergio Cabello, University of Ljubljana, Slovenia
Ken Clarkson, IBM Almaden Research Center, USA
Eric Colin de Verdiere, École Normale Supérieure Paris, France
Stefan Dziembowski, University of Warsaw, Poland
David Eppstein, University of California at Irvine, USA
Dimitris Fotakis, National Technical University of Athens, Greece
Paul Goldberg, University of Oxford, UK
MohammadTaghi Hajiaghayi, University of Maryland at College Park, USA
Jesper Jansson, Kyoto University, Japan
Andrei Krokhin, Durham University, UK
Asaf Levin, Technion, Israel
Inge Li Gortz, Technical University of Denmark, Denmark
Pinyan Lu, Microsoft Research Asia, China
Frederic Magniez, Universite Paris Diderot, France
Kazuhisa Makino, Kyoto University, Japan
Elvira Mayordomo, Universidad de Zaragoza, Spain
Ulrich Meyer, Goethe University Frankfurt am Main, Germany
Wolfgang Mulzer, Free University Berlin, Germany
Viswanath Nagarajan, University of Michigan, USA
Vicky Papadopoulou, European University Cyprus, Cyprus
Michal Pilipczuk, University of Bergen, Norway
Liam Roditty, Bar-Ilan University, Israel
Ignaz Rutter, Karlsruhe Institute of Technology, Germany
Rocco Servedio, Columbia University, USA
Jens Schmidt, TU Ilmenau, Germany
Bettina Speckmann (chair), TU Eindhoven, The Netherlands
Csaba D. Toth, California State University Northridge, USA
Takeaki Uno, National Institute of Informatics, Japan
Erik Jan van Leeuwen, Max-Planck Institut für Informatik, Germany
Rob van Stee, University of Leicester, UK
Ivan Visconti, University of Salerno, Italy

Track B: Logic, semantics, automata and theory of Programming
-------------------------------------------------------------

Andreas Abel, Chalmers and Gothenburg University, Sweden
Albert Atserias, Universitat Politècnica de Catalunya, Spain
Christel Baier, TU Dresden, Germany
Lars Birkedal, Aarhus University, Denmark,
Luis Caires, Universidade Nova de Lisboa, Portugal
James Cheney, University of Edinburgh, UK
Wei Ngan Chin, National University of Singapore, Singapore
Ugo Dal Lago, University of Bologna, Italy
Thomas Ehrhard, CNRS, Université Paris Diderot, France
Zoltan Esik, University of Szeged, Hungary
Xinyu Feng, University of Science and Technology of China, China
Wan Fokkink, VU University Amsterdam, The Netherlands
Shin-ya Katsumata, Kyoto University, Japan
Naoki Kobayashi (chair), The University of Tokyo, Japan
Eric Koskinen, New York University, USA
Antonín Kucera, Masaryk University, Czech Republic
Orna Kupferman, Hebrew University, Israel
Annabelle Mclver, Macquarie University, Australia
Dale Miller, INRIA Saclay, France
Markus Mueller-Olm, University of Münster, Germany
Andrzej Murawski, Univeristy of Warwick, UK
Joel Ouaknine, Univeristy of Oxford, UK
Prakash Panangaden, McGill University, Canada
Pawel Parys, University. of Warsaw, Poland
Reinhard Pichler, TU Vienna, Austria
Simona Ronchi Della Rocca, University of Torino, Italy
Jeremy Siek, Indiana University, USA

Track C: Foundations of networked computation:
Models, algorithms and information management
------------------------------------------------------

Ioannis Caragiannis, Univ. Patras, Greece
Katarina Cechlarova, Pavol Jozef Safarik Univ., Slovakia
Shiri Chechik, Tel Aviv Univ., Israel
Yuval Emek, Technion, Israel
Sandor Fekete, TU Braunschweig, Germany
Pierre Fraigniaud, CNRS and Paris Diderot, France
Leszek Gasieniec, Univ. Liverpool, UK
Aristides Gionis, Aalto Univ., Finland
Magnus M. Halldorsson (chair), Reykjavik Univ, Iceland
Monika Henzinger, Univ. Wien, Austria
Bhaskar Krishnamachari, USC, USAL
Fabian Kuhn, Freiburg, Germany
Michael Mitzenmacher, Harvard Univ, USA
Massimo Merro, Univ. Verona, Italy
Gopal Pandurangan, NTU, Singapore
Pino Persiano, Salerno, Italy
R. Ravi, CMU, USA
Ymir Vigfusson, Emory Univ., USA
Roger Wattenhofer, ETH Zurich, Switzerland
Masafumi Yamashita, Kyushu Univ., Japan

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

Monday, October 20, 2014

[DMANET] Full Professor in Algorithms and Complexity at RWTH Aachen

Full Professor (W3) in Algorithms and Complexity
RWTH Aachen University
Faculty of Mathematics, Computer Science and Natural Sciences

We are seeking qualified applicants for teaching and research in the
area of algorithms and complexity. The starting date is 1st October
2015. The research focus of this professorship should be in one or
several branches of current algorithms research, for example,
algorithmic game theory, approximation algorithms, distributed
algorithms, fixed-parameter tractability, networking algorithms,
online algorithms, randomised algorithms. The successful candidate is
expected to seek collaboration both within the department of computer
science and with other disciplines at RWTH Aachen University. We
expect an active involvement in all informatics curricula, as well as
in courses for other areas.

A Ph.D. degree is required; additionally, Habilitation (post-doctoral
lecturing qualification), an exemplary record of research achievement
as an assistant / an associate / a junior professor or university
researcher and/or an outstanding career outside academia are highly
desirable. Ability in and commitment to teaching are essential. German
is not necessary to begin but will be expected as a teaching language
within the first 5 years. The application should include supporting
documents regarding success in teaching.

Please send a cover letter stating research aims and a CV to: An den
Dekan der Fakultät für Mathematik, Informatik und Naturwissenschaften
der RWTH Aachen, Professor Dr. Stefan Schael, 52056 Aachen, Germany.

The deadline for applications is 14th November 2014.

Informal inquiries may be addressed to
Prof. Martin Grohe, RWTH Aachen, grohe@informatik.rwth-aachen.de

Martin Grohe
RWTH Aachen
Lehrstuhl Informatik 7
Ahornstr. 55
52074 Aachen
Germany

e: grohe@informatik.rwth-aachen.de
t: +49 241 80 21700
f: +49 241 8022 215

**********************************************************
*
* 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 COMCOM, Elsevier: Special Issue on Security and Privacy in Unified Communications: Challenges and Solutions, Manuscript Due October 31, 2014

[Apologies if you receive multiple copies of this message]

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

*Call for Papers*

Computer Communications Journal, Elsevier
(Current Impact Factor: 1.352)

Special Issue on:
Security and Privacy in Unified Communications: Challenges and Solutions

Direct Link:
http://www.journals.elsevier.com/computer-communications/call-for-papers/special-issue-on-security-and-privacy-in-unified-communicati/

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

Unified Communications (UC) merge different communication
technologies, types of products, and services, from various
manufacturers, operators, and countries, following diverse policies
and standards. Specifically, in the context of UC, a range of
communication tools are integrated in a way that both corporations and
individuals are able to manage all their communications in one entity
instead of doing it disjointly. It is therefore said that UC bridges
the opening between the various computer related communication
technologies and Voice over IP (VoIP). However, this high level of
heterogeneity expands the risks related to security and privacy that
stakeholders should deal with. To eliminate or even prevent the
increasing threats to end-users and operators, it is important to
explore this growing and timely research topic.
This feature topic will benefit the research community towards
identifying challenges and disseminating the latest methodologies and
solutions to UC security and privacy issues. Its objective is to
publish high-quality articles presenting open issues, algorithms,
protocols, policies, frameworks, standards, and solutions for UC
related to security and privacy. Only technical papers describing
previously unpublished, original, state-of-the-art research, and not
currently under review by a conference or a journal will be
considered. Reviews and case studies which address state-of-art
research and state-of-practice industry experiences are also welcomed.
We solicit papers in a variety of topics related to unified
communications security and privacy, including, but not limited to:

- Authorization and access control for UC services
- Denial of service prevention schemes for UC
- Reliability and availability issues on UC
- Penetration testing, intrusion detection and prevention
- End-to-end security solutions
- Cryptographic protocols for UC
- Voice security
- Signaling security and privacy
- Multimedia application security and privacy analysis
- Multimedia communication platforms vulnerabilities and attacks
- Security and privacy in mobile communication services
- Smartphone multimedia apps security and privacy
- Social networking security and privacy
- Testbed and case studies for secure and private UC services
- Trust establishment in UC
- IP Multimedia Subsystem (IMS) security
- Privacy and identity management
- Privacy enhancing technologies for UC
- Privacy models for UC
- Security and privacy assessment for UC
- Security policies
- Auditing, verification, and validation of UC services
- Risk analysis and management
- Cyber-security issues affecting UC
- Protection of UC as a Critical Information Infrastructure
- VoIP peering security issues

All received submissions will be sent out for peer review by at least
two experts in the field and evaluated with respect to relevance to
the special issue, level of innovation, depth of contributions, and
quality of presentation. Guest editors will make an initial
determination of the suitability and scope of all submissions. Papers
that either lack originality, clarity in presentation or fall outside
the scope of the special issue will not be sent for review and the
authors will be promptly informed in such cases. Submitted papers must
not be under consideration by any other journal or publication.


Schedule

Manuscript submission deadline: October 31, 2014
Pre-notification (first round): January 30, 2015
Final-notification (second round): April 3, 2015
Publication of special issue: 2015 (Tentative)


Submission Details

Authors should follow the instructions available at
http://ees.elsevier.com/comcom - kindly click the "Guide for Authors"
link in the top box on the right side. When submitting the article,
select "UC Security and Privacy" in the "Select an Article Type" box
in the submission process.


Guest Editors

Georgios Karopoulos
Joint Research Centre (JRC), Italy
e-mail: georgios.karopoulos@jrc.ec.europa.eu

Georgios Portokalidis
Stevens Institute of Technology, USA
e-mail: gportoka@stevens.edu

Josep Domingo-Ferrer
Universitat Rovira i Virgili, Catalonia
e-mail: josep.domingo@urv.cat

Ying-Dar Lin
National Chiao Tung University (NCTU), Taiwan
e-mail: ydlin@cs.nctu.edu.tw

Dimitris Geneiatakis
Joint Research Centre (JRC), Italy
e-mail: dimitrios.geneiatakis@jrc.ec.europa.eu

Georgios Kambourakis
University of the Aegean, Greece
e-mail: gkamb@aegean.gr

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

Sunday, October 19, 2014

[DMANET] Deadline extended: Elsevier ComCom Special Issue on Online Social Networks (new deadline 2 November)

CALL FOR PAPERS

********************************************
Extended submission deadline: 2 November 2014
(see below for updated schedule)
********************************************

Elsevier - Computer Communications Journal
Special Issue on
Online Social Networks
http://www.journals.elsevier.com/computer-communications/call-for-papers/special-issue-on-online-social-networks1/

Online Social Networks are a massively successful phenomenon, used by
billions of users to interact. Nowadays they are key platforms for,
among others, content dissemination, social and professional networking,
recommendation, scouting, alerting, and political campaigns. The
research interest in OSNs is multi-faceted, and exploits an unmatched
source of large-scale data about the human behavior. It spans a number
of disciplines, across numerous fields in and beyond computer science,
all the way up to the analysis of human social relationships and how
they evolve and mature over time. Moreover, the pervasive presence of
users' mobile devices (e.g., smartphones) has opened new avenues in the
design of mobile social networking services, and in the study of the
interplay between mobility and social interactions. Research in OSN is a
fertile ground also for industry, to develop innovative ideas fostering
the design of the new generation of communication platforms and their
services.

This special issue seeks contributions pushing the state of the art in
all facets of Online Social Networks highlighted above. We also
encourage original work based on an interdisciplinary research (at the
boundary between computer science and humanistic disciplines such as
sociology and anthropology) where quantitative evidence is available
demonstrating the mutual advantage of such an approach. Therefore,
purely methodological papers or papers that do not present quantitative
results with real Online or Mobile Social Networking technologies are
considered out of scope. Moreover, special attention is expected in
interpreting the proposed research results in order to shed light
towards what users may need and wish in terms of novel, practical
services and application.

Topics of interest include (but are not limited to) the following:
- Design of OSN platforms based on human behavioural models
- Analysis of OSN users' behaviour and its evolution over time
- Comparison of human social behaviour in Online and "offline" Social
Networks, and across OSNs
- Impact of Online Social Networks on human social behaviour
- Analysis of the use of social-networking sites in the urban context
- OSNs for supporting novel, social-oriented applications and services
- Mobile and Location-aware Online Social Networks
- OSN services enabled by the analysis of mobility and social behaviour
- Crowdsourcing for Online and Mobile Social Networks
- Dynamics of trends, information and opinion diffusion in OSN
- Smart recommendations and advertising in Online Social Networks
- Information extraction and search in Online Social Networks
- Privacy in management and analysis of Online and Mobile Social
Networks data
- Privacy, Security, Trust and Reputation in Online Social Networks
- Prevention of misbehaviours (spamming, phishing, ...) in Online Social
Networks
- Modelling of Online Social Networks characteristics and mechanisms
- Graph analysis applied to Online Social Networks
- Complex networks techniques applied to the investigation of OSN
- Data Mining and Machine Learning to gain novel insights on Online
Social Networks
- Novel distributed solutions for designing, supporting and operating
Online Social Networks
- Networking, computation and data infrastructure support for Online
Social Network systems

*********************************
Schedule (updated)
Submission deadline: 2 November 2014
Author notification: 15 February 2015
Revised paper due: 31 March 2015
Final author notification: 30 April 2015
Publication (tentative): 3rd Quarter 2015
*********************************

Guest Editors
Xiaoming Fu, Georg-August-University of Goettingen, Germany
Andrea Passarella, IIT-CNR, Italy
Daniele Quercia, Yahoo Labs, Spain
Alessandra Sala, Bell Labs, Ireland
Thorsten Strufe, TU Dresden, Germany

Instructions for submission
---------------------------
Manuscripts must not have been previously published nor currently under
review by other journals or conferences. If prior work was published in
a conference, the submitted manuscript should include a substantial
extension of at least 35% novel contributions. In this case, authors are
also required to submit their published conference articles and a
summary document explaining the enhancements made in the journal
version.

Papers must be submitted through the Computer Communications website at
http://ees.elsevier.com/comcom, where guidelines for manuscript
preparation can also be found
(http://www.elsevier.com/journals/computer-communications/0140-3664/guide-for-authors).
To ensure that all manuscripts are correctly identified for consideration
by the Special Issue, the authors should select "Special Issue: OSN"
when they reach the "Article Type" step in the submission process.

For further information, please contact the guest editors at
comcomsi_osn at 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/
*
**********************************************************

Saturday, October 18, 2014

[DMANET] Last CFP: 6th NIPS workshop on Discrete Optimization in Machine Learning

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

Call for Papers
DISCML -- 6th Workshop on Discrete Optimization in Machine Learning
at NIPS 2014 (Montreal)

Dec 13, 2014
www.discml.cc

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


Discrete optimization problems and combinatorial structures are becoming
increasingly important in machine learning. They arise for discrete
labels with complex dependencies, structured estimators, learning with
graphs, partitions, permutations, or when selecting informative subsets
of data or features.

What are efficient algorithms for handling such problems? Can we robustly
solve them in the presence of noise? What about streaming or distributed
settings? Which models are computationally tractable and rich enough for
applications? What theoretical worst-case bounds can we show?
What explains good performance in practice?

Such questions are the theme of the DISCML workshop. It aims to bring
together theorists and practitioners to explore new applications, models
and algorithms, and mathematical properties and concepts that can help
learning with complex interactions and discrete structures.

We invite high-quality submissions that present recent results related
to discrete and combinatorial problems in machine learning, and submissions
that discuss open problems or controversial questions and observations,
e.g., missing theory to explain why algorithms work well in certain
instances but not in general, or illuminating worst case examples.
We also welcome the description of well-tested software and benchmarks.

Areas of interest include, but are not restricted to:
* discrete optimization for machine learning
* graph algorithms
* relaxations
* learning of discrete structures
* new models (e.g. diversity priors, regularization, discrete
probabilistic models)
* algorithms for large data (streaming, sketching, distributed)
* online learning
* new applications


Submissions:

Please send submissions in NIPS 2014 format (length max. 6 pages,
non-anonymous) to
submit<at>discml.cc

submission deadline: October 23, 2014.


Organizers:
Andreas Krause (ETH Zurich, Switzerland),
Jeff A. Bilmes (University of Washington, Seattle),
Stefanie Jegelka (UC Berkeley)
**********************************************************
*
* 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] CTW 2015 - CALL FOR PAPERS

--------------------------
CTW 2015 - CALL FOR PAPERS
--------------------------

13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
Istanbul, Turkey
May 26-28, 2015.

------------------------------------------------------------------
* Website: http://ctw2015.eng.marmara.edu.tr
* Deadline for submission: February 15, 2015
* Notification of acceptance: March 15, 2015
* Workshop dates: May 26-28, 2015
------------------------------------------------------------------

The 13th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in a wide
sense. Following a well established tradition, the 13th edition of the
workhop aims to disseminate scientific results, especially by young
researchers, in a friendly and interactive atmosphere.

If you want to submit a contribution, please prepare an extended
abstract of at most 4 pages by Februaury 15, 2015 following the
guidelines on the workshop website at http://ctw2015.eng.marmara.edu.tr.

A special proceedings volume of Discrete Applied Mathematics, containing
full length papers, refereed according to the high standards of DAM, is
planned.

SCIENTIFIC COMMITTEE
Ulrich Faigle (U Cologne)
Johann L. Hurink (U Twente),
Renato de Leone (U di Camerino)
Leo Liberti (École Polytechnique, Paris)
Bodo Manthey (U Twente)

Ekrem Duman (U Ozyegin)

Ali Fuat Akaya (U Marmara)
Gaia Nicosia (U Roma Tre)
Andrea Pacifici (U Roma Tor Vergata)
Stefan Pickl (UBw München)
Giovanni Righini (U Milano)
Rainer Schrader (U Cologne)
Rüdiger Schultz (U Duisburg-Essen)


LOCAL ORGANIZATION
Ekrem Duman, Ali Fuat Alkaya

**********************************************************
*
* 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] Deadline extension: CONTENT 2015 || March 22 - 27, 2015 - Nice, France

INVITATION:

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

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

The submission deadline is November 12, 2014.

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

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


============== CONTENT 2015 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

CONTENT 2015, The Seventh International Conference on Creative Content
Technologies

March 22 - 27, 2015 - Nice, France


General page: http://www.iaria.org/conferences2015/CONTENT15.html

Call for Papers: http://www.iaria.org/conferences2015/CfPCONTENT15.html

Submission page: http://www.iaria.org/conferences2015/SubmitCONTENT15.html


Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]


Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posted on www.iaria.org]
- panels: [slide-deck posted on www.iaria.org]

Submission deadline: November 12, 2014

Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA
Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.:
http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library:
http://www.thinkmind.org


The topics suggested by the conference can be discussed in term of
concepts, state of the art, research, standards, implementations,
running experiments, applications, and industrial case studies. Authors
are invited to submit complete unpublished papers, which are not under
review in any other conference or journal in the following, but not
limited to, topic areas.

All tracks are open to both research and industry contributions, in
terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and comply with the editorial rules:
http://www.iaria.org/editorialrules.html


CONTENT 2015 Topics (topics and submission details: see CfP on the site)

BASICS: Content producers/distributors

Product-innovation and creative content platforms; Creative processes;
Product and content innovation; Knowledge representation for content
creativity; Content injection, cashing, storage, and distribution;
Producing and transmitting streaming content; Content localization
services; Content and customers profiles; Documenting and content
authoring; Authorizing topic-based content; Content customization and
metadata; On-demand content; Content retrieval from archives
(alarm-based, time stamp-based); Content management solutions and
systems; Unstructured content environment; Multi-channel content
delivery/publishing strategies; Content reuse

WEBCONTENT: Web content

Architectures and frameworks for Web content ; Web content mining;
Content retrieval on multimedia Web; XML and non-XML Web content;
Ontology and semantic for processing Web content; Recommenders for Web
content; Content-driven workflow design and management; Web content
performance, accuracy, security, and reliability; Web content modeling;
Web content-based applications

SOCIAL: Tools for producing and handling social content

On-line content; Games technologies; Multi-user and mono-user games;
For-kids contents and programs; Social content and tools (YouTube,
FaceBook, etc.); Open portals (e-Democracy, e-Health, etc.); Email lists
challenges (membership, spamming, etc.); Virtual social communities;
Hybrid real and virtual reality technologies

GRAPHICS: 3D Graphics

Interactive 3D graphics; High-performance 3D graphics; Mixed and
augmented reality; Interactive on-line gaming; Animated humanoids and
complex reactive characters; 3D documents and web/multimedia;
User-interface for real-time 3D graphics and virtual environments;
Innovative 3D web applications /industry, science, medicine, technology,
culture/; 3D content creation technologies and tools; Interactive 3D
graphics for mobile devices

ANIMA: Animation/cinematography

Computer animation; Computational cinematography; Virtual videography;
Autonomous interactive characters; Traditional animation and 3D computer
animation; Re-cinematography; Casual video; Cinematography; Image
stabilization; Virtual Cinematography; Relighting through computation

MEDIMA: Medical image producing, transmission and management

Medical image devices, mechanisms and procedures; Medical imaging
systems; Medical image capture and processing; Feature extraction and
pattern recognition; Matching and computing anatomical atlases; Surface
and volume registration; Medical image analysis (static and motion
analysis); Medical image analysis (functional, metabolic); Multi-modal
image analysis; Image segmentation; Multidimensional data visualization;
Statistical methods (population-based analysis); Image guided diagnosis,
surgery and therapy; Medical image transmission and storage (protocols,
databases)

AUDIO: Audio producing, transmission and management

Audio transmission and reception systems and devices; Digital audio
transmission signal processing; Audio transmission over Internet; Audio
Multiplexing Transmission Systems; Stereo audio transmission signal;
Digital infrared audio transmission; Multi-stream and multi-path audio
transmission; Wireless-compressed digital audio transmission; Perceptual
coding for audio; Transmission and storage; Laser audio transmission;
Synchronizing video and audio transmission; Wide-band audio
transmission; Index-frame audio transmission; Digital audio transmission
rights; Noise in wireless audio transmission; Audio tools and products;
Standards

DATA: Data transmission and management

Data transmission and reception mechanisms and techniques; Enhanced
tools for video data integrity; Data mining, filtering, and reporting;
Secure data transmission; Transmission media and data encoding; Text
reading devices (super-pen, pen-elite, reading-pen); Scanned and
generated lossy (progressive) multi-page text; (Visually) lossless
mechanisms; Pricing data transmission; Differential data transmission
systems; Data transmission equipments and transmission rates;
Delay-constrained data transmission; Undersea and satellite data
transmission techniques; Performance evaluation of data transmission;
Multicast data transmission; High speed data transmission; Data
transmission control; Integrity and privacy in data transmission; Data
transmission standards

VOICE: Voice producing, transmission and management

Planning and implementing voice networks and systems; Voice transmission
systems; Voice transmission performance; Quality real-time voice
transmission; Metrics for quality of voice transmission; Stereophonic
voice transmission systems; Header compression for VoIP over WLAN; Voice
over IP solution for mobile radio interoperability; VoIP over cable TV
networks; VoIP over Wi-Max; WiFi and cellular dual mode phones and
services; Voice over WLANs and Wi-Fi to cellular roaming; Voice
transmission via the Internet; Wi-Fi voice transmission; Bluetooth-based
Ad-Hoc networks for voice transmission; Standards for voice processing
and transmission

VIDEO: Coding/Transmission/Processing

Video coding standards (H.264, SMPTE 421M, AVS-China); Video coders and
decoders; Video surveillance and privacy; Network video recorders; Video
streaming; Video data integrity (error detection, error resilience,
error concealment, tamper resistance); Motion detection, object
tracking; Distributed video coding; Video quality assessment;
Omnidirectional video; 3D video

IMAGE: Image producing, transmission and management

Model-based progressive image transmission; Wireless image transmission;
Computer generated images; Image security, scrambling, and regions of
interest; Timing requirements for image transmission; Transmission of
still and moving images; Protocols for low bit rate; Error-prone image
transmission; Energy efficient image transmission; Multi-technology
image formation; Devices for image capturing and processing (cams,
web-cams, etc.); Scanning and sampling, quantization and halftoning,
color reproduction; Image representation and rendering, display and
printing systems; Image quality assessment; Image search and sorting,
video indexing and editing; Integration of images and video with other
media; Image authentication and watermarking; Image storage, retrieval
and multimedia; Image and video databases; Generic coding of moving
pictures; Media stream packetization; Modes for archival playback;
Image-based applications; Standard for image processing; Image analysis
and segmentation; Imag
e filtering, restoration and enhancement; Image representation and
modeling; Pattern recognition

SPEECH: Speech producing, transmission and management

Tooling, architectures, components and standards; Voice modulation,
frequencies; Linguistics, phonology and phonetics; Discourse and
dialogue; Speech analysis, synthesis, coding, and recognition; Speech
enhancement and noise reduction; Speech features, production, and
perception; Speech coding and transmission; Speech signal processing;
Spoken language generation and synthesis; Speech QoS enhancement;
Speaker characterization and recognition; Spoken language resources and
annotation; Spoken/Multi-modal dialogue technology and systems; Spoken
language information extraction/retrieval; Speech transmission
technology for the aged and disabled; Audio-visual speech processing;
Biomedical applications of speech analysis; Spoken document retrieval;
Speech processing in a packet network environment; Automatic speech
recognition in the context of mobile communications; Human factors in
speech and communication systems; Automatic speech recognition and
understanding technology; Speech to text
systems; Spoken dialog systems; Multilingual language processing; New
applications of spoken language technology and systems

Committee: http://www.iaria.org/conferences2015/ComCONTENT15.html

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

Friday, October 17, 2014

[DMANET] MAPSP2015 - First Call for Papers

MAPSP 2015 - First Call for Papers

Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems

June 8-12, 2015
La Roche-en-Ardenne, Belgium

The site : http://www.mapsp2015.com/



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

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

Submissions:

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

Abstracts of 2-3 pages must be submitted using Easychair according to the guidelines at www.mapsp2015.com.

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

Important dates:

Submissions January 31, 2015
Notification March 7, 2015
Early registration March 28, 2015
Conference June 8-12, 2015

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

Invited speakers:

Onno Boxma (TU Eindhoven)
Michel Goemans (MIT)
Rolf Niedermeier (TU Berlin)
Willem-Jan Van Hoeve (Carnegie-Mellon University)
Stephan Westphal (TU Clausthal),
------------------------------------------

The program committee:


Alberto Marchetti-Spaccamela, Sapienza University of Rome (chair); Eyjolfur I. Ásgeirsson, Reykjavik University, Iceland; Sem Borst, TU Eindhoven, Netherlands; Dirk Briskorn, University of Cologne, Germany; Liliana Cucu-Grosjean, INRIA, France; Vitus J.Leung, Sandia National Lab, US; Benjamin Moseley, Washington University in St. Louis, US; Frits Spieksma, KU Leuven, Belgium; Sebastian Stiller, TU University Berlin, Germany; José Verschae, Pontificia Universidad Católica de Chile, Chile; Prudence W.H. Wong, University of Liverpool, UK

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

Organization:

Yves Crama (chair)
Frits Spieksma (chair)
Dries Goossens
Roel Leus
Michael Schyns

**********************************************************
*
* 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] VCLA International Student Awards

The Vienna Center for Logic and Algorithms calls for the nomination of
authors of outstanding scientific works in the field of Logic and
Computer Science, for the following awards:

- Outstanding Master Thesis Award (thesis for obtaining a Masters
degree or equivalent)

- Outstanding Undergraduate Research Award (thesis or final project
for obtaining a Bachelors degree or equivalent)

In both categories, the work must make an original contribution to a
research field that can be classified as part of Logic in Computer
Science, with focus on databases and artificial intelligence,
verification, and computational logic.

The degree must have been awarded no earlier than November 1st, 2012.
Students that obtained the degree at the Vienna University of
Technology are excluded from nomination.

The committee will select a winner for each category. The winners will
be invited to Vienna to present their project and participate in a
festive award ceremony. Additionally, the Outstanding Master Thesis
Award category is accompanied by a prize of 1,200 Eur, and the
Outstanding Undergraduate Research Award by a prize of 800 Eur. The
decisions of the committee are not appealable.

For more information, please see http://logic-cs.at/award/


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

Nomination deadline: November 15, 2014 (AoE)
Notification of decision: Mid January 2015
Award ceremony: Spring 2015 (precise date to be announced)


TOPICS OF INTEREST
------------------

Both awards recognize the author of an original contribution to a
research field that can be classified as part of *Logic in Computer
Science*, understood broadly as the use of logic as a tool that
enables computer programs to reason about the world.

The main areas of interest are:

- Databases and artificial intelligence, including subjects like
answer-set programming and Datalog, query languages based on logical
concepts (such as SQL, current XML-based languages), optimization of
queries, novel database-theoretical methods (like schema mappings,
information integration, querying ontologies), logic programming,
description logics, knowledge representation and reasoning (belief
change, abductive reasoning, multi-context systems, inconsistency
handling, incomplete knowledge, diagnosis), and AI formalisms
(argumentation, planning, preferential reasoning, decision support
systems).


- Verification, concerned with logical methods and automated tools for
reasoning about the behavior and correctness of complex state-based
systems such as software and hardware designs as well as hybrid
systems. It ranges from model checking, program analysis and
abstraction to new interdisciplinary areas such as fault localization,
program repair, program synthesis, and the analysis of biological
systems.


- Computational logic, covering theoretical and mathematical
foundations such as proof theory (cut elimination, proof mining,
interpolants), automated deduction (resolution, refutation, theorem
proving), non-classical logics (multi-valued logics, juridical
reasoning, deontic logics, modal and temporal logics), computational
complexity (complexity analysis, parameterized complexity,
decomposition methods) and constraint satisfaction (SAT, QSAT, CSP).


NOMINATION INSTRUCTIONS
------------------

Nominations must include:

* A cover page with the name and contact details of the nominated
person, the title of the work for which the person is being nominated,
category, date on which the degree was awarded (or if not applicable,
the date on which the work was submitted), and name of the university.

* An English summary of the thesis or project of maximum 3 pages,
excluding references (A4 or letter page size, 11pt font min.). The
summary must clearly state the main contribution of the work, its
novelty, and its relevance to some of the aforementioned areas of
interest.

* CV of the nominated person, including publication list (if applicable)

* An endorsement letter from a supervisor or another endorsing person,
preferably affiliated to the university to which the work was
submitted. The letter must clearly state what was the independent and
novel contribution done by the student and why the endorser believes
the student deserves the award.

* The full thesis/project

All documents should be in English, with the exception of the thesis
or project. In case the thesis or project is in a different language,
it must be accompanied by a research report in English with a maximum
length of 12 pages
excluding references (A4 or letter page size, 11pt font min.). This
report should be sufficient for the committee to evaluate the merit
and quality of the submitted work. In case such a report is provided,
the 3-page summary is
optional.

Nominations should be submitted electronically via EasyChair:

https://easychair.org/conferences/?conf=vcla2014

All documents except the full thesis should be combined (in the order
they are listed) into a single pdf file, to be submitted as "paper" in
Easychair. The full thesis should be submitted as attachment.

The submission must be accompanied by a plain text electronic abstract
of the thesis or project of at most 400 words, and three keywords.


The nominated student must always be listed as first and corresponding
author in the Easychair form. The supervisor or endorser may
optionally be included as second author (for example, in case (s)he
does the electronic submission).


AWARD COMMITTEE
------------------
Ezio Bartocci
Simone Bova
Michael Fink
Robert Ganian
Igor Konnov
Tomer Kotek
Roman Kuznets
Magdalena Ortiz (chair)
Revantha Ramanayake
Mantas Simkus
Daniel Weller
Florian Zuleger
**********************************************************
*
* 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] Call for papers - 31st International Symposium on Computational Geometry

Call for Papers
31st International Symposium on
Computational Geometry
Eindhoven, June 22-25, 2015

www.win.tue.nl/SoCG2015/

The 31st International Symposium on Computational Geometry will be held
in Eindhoven,
the Netherlands, as part of Computational Geometry Week. We invite
submissions of
high-quality papers that describe original research on computational
problems in a
geometric setting, in particular their algorithmic solutions,
implementation issues,
applications, and mathematical foundations. The program committee
intends to interpret
the scope of the conference broadly, and will seriously consider all
papers that are
of signicant interest to the computational geometry research community.
Topics of
interest include, but are not limited to:

* design, analysis, and implementation of geometric algorithms and data
structures;
lower bounds on the computational complexity of geometric problems;

* mathematical, numerical, and algebraic issues arising in the
formulation, analysis,
implementation, and experimental evaluation of geometric algorithms and
heuristics;
discrete and combinatorial geometry; computational topology;

* novel algorithmic applications of geometry in computer graphics,
geometric modeling,
computer-aided design and manufacturing, scientic computing, geographic
information
systems, database systems, robotics, computational biology, machine
learning,
sensor networks, medical imaging, combinatorial optimization,
statistical analysis,
discrete dierential geometry, theoretical computer science, graph drawing,
pure mathematics, and other fields.

Important Dates
* November 21, 2014: Paper abstracts (at most 300 words) due (23:59, UTC-12)
* December 1, 2014: Paper submissions due (23:59, UTC-12)
* February 11, 2015: Notication of acceptance/rejection of papers
* March 23, 2015: Final versions of accepted papers due
* June 22-25, 2015: Symposium in Eindhoven

There will be no extension of abstract and paper submission deadlines;
late submissions will not be considered.

Program committee
* Lars Arge (co-chair, MADALGO, Aarhus U.)
* Boris Aronov (NYU Poly)
* Anne Driemel (TU Eindhoven)
* John Hershberger (Mentor Graphics)
* Akitoshi Kawamura (U. Tokyo)
* Stefan Langerman (U. Libre de Bruxelles)
* Kasper Larsen (MADALGO, Aarhus U.)
* Nabil Mustafa (U. Paris-Est, ESIEE Paris)
* Amir Nayyeri (Oregon State U.)
* Janos Pach (co-chair, EPFL & Renyi)
* Marcus Schaefer (DePaul U.)
* Donald Sheehy (U. Connecticut)
* Anastasios Sidiropoulos (Ohio State U.)
* Michiel Smid (Carleton U.)
* Monique Teillaud (INRIA)
* Csaba Toth (Cal State Northridge)
* Antoine Vigneron (KAUST)
* Haitao Wang (Utah State U.)

Publication and Awards
Final versions of accepted papers will be published by LIPIcs (Leibniz
International
Proceedings in Informatics) in the symposium proceedings. An author of
each accepted
paper will be expected to attend the Symposium and give a presentation
(approximately
20 minutes) of the paper. Authors of a selection of papers from the
conference will
be invited to submit extended versions of their papers to special issues
of one or
two journals, and awards will be given to the best paper and the best
student paper.
A best student presentation award will also be given based on the
quality of the
presentation of a paper by a student during the conference.

Paper Submission Guidelines
Submissions must be formatted in accordance with the LIPIcs proceedings
guidelines
and not exceed 15 pages including title-page and references, but
excluding a clearly
marked appendix (further described below). LIPIcs typesetting
instructions can be
found at http://www.dagstuhl.de/en/publications/lipics and the
lipics.cls LaTeX style 
at http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz. Final
proceedings
versions of accepted papers must be formatted using the same rules but
without the
appendix.

Papers should be submitted in the form of an extended abstract, which
begins with the
title of the paper, each author's name and aliation, as well as a short
abstract.
This should be followed by the main body of the paper that begins with a
precise
statement of the problem considered, a succinct summary of the results
obtained
(emphasizing the signicance, novelty, and potential impact of the
research), and a
clear comparison with related work. The remainder of the extended
abstract should
provide sucient detail to allow the program committee to evaluate the
validity,
quality, and relevance of the contribution. Clarity of presentation is
very important;
the whole extended abstract should be written carefully, taking into
consideration
that it will be read and evaluated by both experts and non-experts,
often under tight
time constraints. All details needed to verify the results must be
provided, and
supporting materials, including proofs of theoretical claims and
experimental details,
that do not fit in the 15-page limit should be given in an appendix.
The appendix will
be read by the program committee members at their discretion and will not be
published as part of the proceedings. Thus the paper without the
appendix should be
able to stand on its own, but contain all material with the appendix.
Submissions
deviating from the above guidelines will be rejected without
consideration of
their merits.

Results previously published in another conference proceedings cannot be
submitted.
Simultaneous submissions of the results to another conference with
published proceedings
are not allowed. Exempted are workshop or conference handouts containing
short abstracts.
Results that have already been accepted (with or without revision) for
publication by a
journal, at the time of their submission to the conference, will not be
allowed. A paper
submitted to a journal but not yet accepted to a journal can be
submitted to the
conference. In such cases, the authors must mention this in the
submission appendix and
clearly identify the status of the journal submission on November 21, 2014.

Paper Submission
All submissions must be made electronically; see the EasyChair SoCG2015
web page
https://www.easychair.org/conferences/?conf=socg2015 for detailed
submission instructions.
**********************************************************
*
* 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] MADALGO PhD student and Post Doc positions (Deadline November 1 and November 15)

Center for Massive Data Algorithmics (MADALGO), is a basic research
center funded by the Danish National Research Foundation. The center is
located in the Department of Computer Science, Aarhus University,
Denmark, but also includes researchers at CSAIL, Massachusetts Institute
of Technology, at the Max Planck Institute for Informatics and at
Frankfurt University. The center covers all areas of the design,
analysis and implementation of algorithms and data structures for
processing massive data (interpreted broadly to cover computations where
data is large compared to the computational resources), with focus on
I/O-efficient, cache-oblivious and streaming algorithms. See
www.madalgo.au.dk for more information.

Starting February 1, 2015 or later, several positions are available at
MADALGO under the supervision of Professor Lars Arge
(www.madalgo.au.dk/~large), Associate Professor Gerth S. Brodal
(www.madalgo.au.dk/~gerth), Assistant Professor Peyman Afshani
(www.madalgo.au.dk/~peyman), and Assistant Professor Kasper Green Larsen
(www.madalgo.au.dk/~larsen).

Several PhD student positions may be available. The positions are
administered through Graduate School of Science and Technology at Aarhus
University (talent.au.dk/phd/scienceandtechnology) and include full
tuition waiver and a very competitive scholarship. Applications are
welcomed from students with at least three years of full-time study by
February 2015. Students with a strong background in the design and
analysis of algorithms will be preferred.

One or more MADALGO postdoc positions at the level of Research Assistant
Professor of Computer Science are also available. Postdoc positions are
initially for one year, but can be extended with an additional year by
mutual consent. MADALGO welcomes postdoctoral researchers with clearly
demonstrated experience and skills in the design and analysis of
algorithms and data structures. Researchers with experience with
I/O-efficient, cache-oblivious or streaming algorithms, as well as with
implementation of such algorithms (algorithm engineering experience) are
preferred. The responsibilities of MADALGO postdocs include work on
algorithms for massive dataset problems in collaboration with center
researchers, along with modest teaching responsibilities.

The application deadlines for PhD student and postdoc positions are
November 1 and November 15, 2014, respectively. Applicants for PhD
student positions should apply using the Aarhus Graduate School of
Science and Technology application system also accessible from
www.madalgo.au.dk. Applicants for postdoc positions should apply by
uploading a letter of interest and a CV, as well as indicate at least
two names of references for recommendations, using the application form
available at www.madalgo.au.dk.

For further information, contact Center Director, Professor Lars Arge at
large@madalgo.au.dk.
**********************************************************
*
* 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

[Please post - apologies for multiple copies.]

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

Call for Papers

8th Workshop on Computational Optimization (WCO 2014
Warsaw, Poland, September 13 - 16, 2015

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

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
* continues 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, chemistry, biology, medicine, engineering etc.

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

Important dates:

24.04.2015 (April 24, 2015) – Full paper submission

01.06.2015 (June 01, 2015) - Position paper submission

15.06.2015 (June 15, 2015) – Notification of acceptance

01.07.2015 (July 01, 2015) – 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 Springer Studies of
Computational Intelligence.
====================

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Daniela Zaharie, West University of Timisoara, Romania
Antonio Mucherino, IRISA, 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/
*
**********************************************************

[DMANET] Deadline extension: ADAPTIVE 2015 || March 22 - 27, 2015 - Nice, France

INVITATION:

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

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

The submission deadline is November 12, 2014.

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

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


============== ADAPTIVE 2015 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ADAPTIVE 2015, The Seventh International Conference on Adaptive and
Self-Adaptive Systems and Applications

March 22 - 27, 2015 - Nice, France


General page: http://www.iaria.org/conferences2015/ADAPTIVE15.html

Call for Papers: http://www.iaria.org/conferences2015/CfPADAPTIVE15.html

Submission page: http://www.iaria.org/conferences2015/SubmitADAPTIVE15.html


Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]

Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posted on www.iaria.org]
- panels: [slide-deck posted on www.iaria.org]

Submission deadline: November 12, 2014

Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA
Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.:
http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library:
http://www.thinkmind.org

The topics suggested by the conference can be discussed in term of
concepts, state of the art, research, standards, implementations,
running experiments, applications, and industrial case studies. Authors
are invited to submit complete unpublished papers, which are not under
review in any other conference or journal in the following, but not
limited to, topic areas.

All tracks are open to both research and industry contributions, in
terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and comply with the editorial rules:
http://www.iaria.org/editorialrules.html


ADAPTIVE 2015 Topics (topics and submission details: see CfP on the site)

Fundamentals and design of adaptive systems

Fundamentals on adaptive and self-adapting systems; Frameworks and
architectures for adaptive supporting platforms; Architectures for
adaptive applications; Specification of adaptive behavior; Specification
of adaptive structures and topologies; Design and implementation of
adaptive components; Composition of adaptive behaviors and structures;
Adaptive individual and collective behavior and structures; Adaptive
deterministic and non-deterministic behavior; Semantic modeling

Adaptive entities

Adaptive environments; Adaptive hardware configurations; Adaptive
software applications; Adaptive protocols; Adaptive algorithms; Adaptive
and interactive interfaces; Adaptive filters; Adaptive clock speeds;
Adaptive schedulers; Adaptive load balancers

Adaptive mechanisms

Adaptive real-time strategies; Learning-based adaptive strategies;
Adaptive mechanisms (trees, ant algorithms, fuzzy-logic, etc. ); Agent
based-adaptive mechanisms; Policy- based adaptation; Feedback-based
adaptive systems; Context-aware adaptation; User-aware adaptation

Adaptive applications

Adaptive artificial intelligence in computer wargames; Intelligent
complex adaptive systems; Adaptive virtualization; Adaptive social
networks; Adaptive entertainment applications; Adaptive disaster
recovery systems; Anticipative adaptive systems; Fault-tolerant adaptive
systems; Adaptive ad hoc networks; Application domains, e,g., building
(AEC projects, simulation models, facility management), tourism, etc.;
Adaptive economic applications (finance, stock exchange, regulatory
decisions, etc.); Adaptive vehicular traffic

Adaptivity in robot systems

Adaptive robot behavior; self-organization and emergence; flexible
and reconfigurable robot structures; adaptation in collective and swarm
robotics

Self-adaptation

Theory of self-adaptation and control; Self-adaptive networks,
systems, and applications; Self-adaptive services; Self-adaptive
behavior and topology/structure; Specification of self-adaptive
behavioral control

Self-adaptation applications

Self-monitoring and self-management; Self-configuration,
self-healing, self-management; Self-defense, self-protection,
self-diagnosis; Self-adaptation of overlay networks; Self-adaptation in
ad hoc sensor networks; Context-aware self-adaptation of networks and
services

Computational Trust for Self-Adaptive Systems

Trust models for adaptive systems; Trust models for self-organizing
and autonomics systems; Agent-based trust models for cooperation;
Privacy and Security in self-organizing and adaptive systems; Human and
social factors involved in trust and adaptation; Applications of trust
and security on adaptive systems, with a focus on web-based
applications, social networks, social search; Trust models for
self-organizing systems of information (wikis, forums, blogs.); Trust
and personalisation for enabling adaptation; Models for learning trust
and the evolution of trust; Decentralised trust models; Case studies;
Theoretical trust models for self-adaptation

Metrics for adaptive and self-adaptive systems

Stability and convergence; Optimal (self-) adaptation; Accuracy
validation of (self-) adaptation; Real-time (self-) adaptive performance


Committee: http://www.iaria.org/conferences2015/ComADAPTIVE15.html

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

Thursday, October 16, 2014

[DMANET] CfP: CPM 2015, Ischia Island, Italy

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

============= First Call for Paper - CPM 2015 =========

FIRST CALL FOR PAPERS

CPM 2015
26th Annual Symposium on Combinatorial Pattern Matching
June 28 - July 1, 2015, Ischia Island, Italy

http://www.cpm2015.di.unisa.it

Submission deadline: ** February 2, 2015 **
Notification: ** March 31, 2015 **
******************************************************************

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

Both papers reporting on original research unpublished else-
where and surveys of important results are welcome.

The proceedings will be published in the Springer-Verlag
series Lecture Notes in Computer Science.


IMPORTANT DATES:
Submission: February 2, 2015
Notification: March 31, 2015
Final version: April 15, 2015
Symposium: June 28- July 1, 2015


PROGRAM COMMITTEE:

• Francine Blanchet-Sadri (University of North Carolina, USA)
• Timothy Chan (University of Waterloo, Canada)
• Ferdinando Cicalese (University of Salerno, Italy, co-chair)
• Raphaël Clifford (University of Bristol, UK)
• Paolo Ferragina (University of Pisa, Italy)
• Travis Gagie (University of Helsinki, Finland)
• Leszek Gąsieniec (University of Liverpool, UK)
• Raffaele Giancarlo (University of Palermo, Italy)
• Inge Li Gørtz (Technical University of Denmark, Denmark)
• Roberto Grossi (University of Pisa, Italy)
• John Iacono (New York University, USA)
• Gregory Kucherov (Université Paris-Est Marne-la-Vallée, France)
• Eduardo Sany Laber (PUC-Rio, Brazil)
• Gad Landau (University of Haifa, Israel)
• Jesper Larsson (Malmö University, Sweden)
• Noa Lewenstein (Netanya College, Israel)
• Stefano Lonardi (University of California, Riverside, USA)
• Veli Mäkinen (University of Helsinki, Finland)
• Ian Munro (University of Waterloo, Canada)
• Gonzalo Navarro (University of Chile, Chile)
• Ely Porat (Bar-Ilan University, Israel, co-chair)
• Simon Puglisi (University of Helsinki, Finland)
• Kunihiko Sadakane (The University of Tokyo, Japan)
• Marie-France Sagot (INRIA Grenoble Rhône-Alpes, Lyon, France)
• Tatiana Starikovskaya (Higher School of Economics, Russia)
• Jens Stoye (Bielefeld University, Germany)
• Oren Weimann (University of Haifa, Israel)

ORGANIZING COMMITTEE

• Ferdinando Cicalese (University of Salerno, Italy)
• Travis Gagie (University of Helsinki, Finland)
• Luisa Gargano (University of Salerno, Italy)
• Zsuzsanna Lipták (University of Verona, Italy)
• Ugo Vaccaro (University of Salerno, Italy)

STEERING COMMITTEE

• Alberto Apostolico (Georgia Institute of Technology, USA)
• Maxime Crochemore (King's College London, UK)
• Zvi Galil (Georgia Institute of Technology, USA)


Further details are available at the symposium web site:

http://www.cpm2015.di.unisa.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/
*
**********************************************************