The 4th edition of the Winter School on Network Optimization will take place at the Hotel Sana, Estoril, from the 12th to the 16th of January 2015. Its main objective is to provide an opportunity for PhD students to get together and attend high level courses in the field of Network Optimization. Non-PhD students are welcome to attend the school, but the number of participants is limited and priority will be given to PhD students. In this edition of the school, the lecturers and subjects to be addressed are:
Bernard Gendron (Univ. Montreal): Decomposition methods for network design
Adam Ouorou (Orange Labs): Robust optimization in telecommunications
Gerhard Reinelt (Univ. Heidelberg): Ordering problems
Giovanni Rinaldi (IASI): Maximum weight cuts in graphs and extensions
Daniele Vigo (Univ. Bologna): Solution approaches for vehicle routing problems
Since the first edition in 2009, the school has been part of the activities of the CIO (Centro de Investigação Operacional) University of Lisbon as well as of the ENOG (European Network Optimization Group). The event is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).
Candidates are invited to submit their CVs to NetOpt2015@fc.ul.pt before the 5th of November 2014.
After a short period of evaluation, the participants will be notified and be invited to register.
More information is available at http:NetOpt2015.fc.ul.pt.
**********************************************************
*
* 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 31, 2014
Postdoc positions in Budapest (parameterized complexity & algorithms)
Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by Dániel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.
The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.
The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (Dániel Marx,
dmarx@cs.bme.hu) are welcome.
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by Dániel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.
The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.
The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (Dániel Marx,
dmarx@cs.bme.hu) are welcome.
[DMANET] Postdoc positions in Budapest (parameterized complexity & algorithms)
Postdoc positions are available at the Institute for Computer Science
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by Dániel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.
and Control (Hungarian Academy of Sciences), Budapest, Hungary,
supported by the European Research Council (ERC) Starting Grant
PARAMTIGHT: "Parameterized complexity and the search for tight
complexity results" held by Dániel Marx. The goal of the project is to
systematically push the boundaries of algorithmic and hardness results,
mostly in the framework of parameterized complexity, with the aim of
obtaining tight results that give an optimal understanding of the
complexity of a problem.
The candidates should have (or expect to have shortly) a PhD degree in
Computer Science or related area; research experience at postdoctoral
level is of advantage. A successful candidate should have excellent
knowledge of algorithms and/or complexity, preferably in the setting of
parameterized complexity and fixed-parameter tractability. Strong
background in graph theory, combinatorics, constraint satisfaction,
approximation, or kernelization is of advantage.
The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 15 November 2014 will
receive full consideration. Informal inquires by email (Dániel Marx,
dmarx@cs.bme.hu) are welcome.
**********************************************************
*
* 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] Special issue in TCS on ‘‘Theory and Applications of Graph Searching Problems’’ (GRASTA)
Call for Papers
Theoretical Computer Science (TCS)
Special Issue:
GRASTA'14, 6th Workshop on GRAph Searching, Theory and Applications
Cargese, Corsica, France, 2014
http://www-sop.inria.fr/coati/events/grasta2014/
Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on "Theory and Applications of Graph Searching Problems".
Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a team of pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.
With this Special Issue, we wish to foster research in the area by exposing new results and directions for further research.
The purpose of the issue is to put together various recent results related to Graph Searching both from the applied and the theoretical point of view.
Potential topics include (but are not limited to) the following:
* Graph Searching and Logic
* Graph Parameters Related to Graph Searching
* Graph searching and Robotics
* Conquest and Expansion Games
* Database Theory and Robber and Marshals Games
* Probabilistic Techniques in Graph Searching
* Monotonicity and Connectivity in Graph Searching
* New Variants of Graph Searching
* Graph Searching and Distributed Computing
* Graph Searching and Network Security
Submissions should be made in PDF format using the standard TCS submission system at http://ees.elsevier.com/tcs/ (submissions will be possible from December 2014)
Papers will be refereed according to the standards of TCS.
Submissions must be received before March 31, 2015.
Please contact the guest editors for additional information.
We are looking forward to receiving your contribution.
The Guest Editors,
Pierre Fraigniaud
Fedor V. Fomin
Nicolas Nisse
Dimitrios Thilikos
**********************************************************
*
* 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/
*
**********************************************************
Theoretical Computer Science (TCS)
Special Issue:
GRASTA'14, 6th Workshop on GRAph Searching, Theory and Applications
Cargese, Corsica, France, 2014
http://www-sop.inria.fr/coati/events/grasta2014/
Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on "Theory and Applications of Graph Searching Problems".
Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a team of pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.
With this Special Issue, we wish to foster research in the area by exposing new results and directions for further research.
The purpose of the issue is to put together various recent results related to Graph Searching both from the applied and the theoretical point of view.
Potential topics include (but are not limited to) the following:
* Graph Searching and Logic
* Graph Parameters Related to Graph Searching
* Graph searching and Robotics
* Conquest and Expansion Games
* Database Theory and Robber and Marshals Games
* Probabilistic Techniques in Graph Searching
* Monotonicity and Connectivity in Graph Searching
* New Variants of Graph Searching
* Graph Searching and Distributed Computing
* Graph Searching and Network Security
Submissions should be made in PDF format using the standard TCS submission system at http://ees.elsevier.com/tcs/ (submissions will be possible from December 2014)
Papers will be refereed according to the standards of TCS.
Submissions must be received before March 31, 2015.
Please contact the guest editors for additional information.
We are looking forward to receiving your contribution.
The Guest Editors,
Pierre Fraigniaud
Fedor V. Fomin
Nicolas Nisse
Dimitrios Thilikos
**********************************************************
*
* 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] CFP COMCOM, Elsevier: SI on Security and Privacy in Unified Communications: Challenges and Solutions, Manuscript Due November 21, 2014
[Apologies if you receive multiple copies of this message]
Manuscript submission: extended to November 21, 2014
========================================================================
*Call for Papers*
Computer Communications Journal, Elsevier
(Current Impact Factor: 1.352)
Special Issue on:
Security and Privacy in Unified Communications: Challenges and Solutions
========================================================================
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: November 21, 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/
*
**********************************************************
Thursday, October 30, 2014
[DMANET] Tractable special cases of hard combinatorial optimization problems (deadline extended)
This is a reminder of the workshop
"Tractable special cases of hard combinatorial optimization problems",
www.opt.math.tu-graz.ac.at/scco14
we will be hosting at the Department of Optimization and Discrete
Mathematics of the Graz University of Technology
from December 15 to December 16, 2014.
This will be a two-day, single stream event focussing at polynomially
solvable or approximable special cases of provably hard combinatorial
optimization problems.
This line of research deals with NP-hard combinatorial optimization
problems which become polynomially tractable if specific structural
properties are imposed on their input.
The identification of the sometimes thin boarderline between hard and
tractable cases is often a hard and interesting challenge.
The workshop will host invited talks in the mornings as well as
contributed talks and discussions or working sessions in the afternoons.
Confirmed invited speakers are:
* Vladimir Deineko, Warwick Business School, UK
* Martin Milanic, University of Primorska, Slovenia
* Frits Spieksma, KU Leuven, Belgium
* Gerhard Woeginger, Eindhoven University of Technology, The Netherlands
We herewith invite you to participate in the workshop and submit a
contribution related to the workshop topic.
The workshop venue is the building of the Department of Optimization and
Discrete Mathematics, Graz University of Technology,
Steyrergasse 30, 8010 Graz, Austria.
There will be a small participation fee payable on site. This will
cover the lunches on December 15 and 16 and the refreshments during the
workshop breaks. The participants will be responsable for their own travel
and accomodation expenses.
Important Dates:
* November 15, 2014: Deadline for the submission of contributed talks
* November 15, 2014: Registration deadline
* December 15-16, 2014: Workshop
We are looking forward to meeting you in Graz. Please do not hesitate to
contact us for any additional information.
Best regards,
Eranda Cela and Bettina Klinz
--
Eranda Dragoti-Cela, PhD, Associate Professor (ao. Univ.-Prof.)
Department of Optimization and Discrete Mathematics,
Graz University of Technology,
Steyrergasse 30, A-8010 Graz, Austria
Tel. ++43 316 873 5366, Fax: ++43 316 873105366,
Email: cela@math.tugraz.at
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
"Tractable special cases of hard combinatorial optimization problems",
www.opt.math.tu-graz.ac.at/scco14
we will be hosting at the Department of Optimization and Discrete
Mathematics of the Graz University of Technology
from December 15 to December 16, 2014.
This will be a two-day, single stream event focussing at polynomially
solvable or approximable special cases of provably hard combinatorial
optimization problems.
This line of research deals with NP-hard combinatorial optimization
problems which become polynomially tractable if specific structural
properties are imposed on their input.
The identification of the sometimes thin boarderline between hard and
tractable cases is often a hard and interesting challenge.
The workshop will host invited talks in the mornings as well as
contributed talks and discussions or working sessions in the afternoons.
Confirmed invited speakers are:
* Vladimir Deineko, Warwick Business School, UK
* Martin Milanic, University of Primorska, Slovenia
* Frits Spieksma, KU Leuven, Belgium
* Gerhard Woeginger, Eindhoven University of Technology, The Netherlands
We herewith invite you to participate in the workshop and submit a
contribution related to the workshop topic.
The workshop venue is the building of the Department of Optimization and
Discrete Mathematics, Graz University of Technology,
Steyrergasse 30, 8010 Graz, Austria.
There will be a small participation fee payable on site. This will
cover the lunches on December 15 and 16 and the refreshments during the
workshop breaks. The participants will be responsable for their own travel
and accomodation expenses.
Important Dates:
* November 15, 2014: Deadline for the submission of contributed talks
* November 15, 2014: Registration deadline
* December 15-16, 2014: Workshop
We are looking forward to meeting you in Graz. Please do not hesitate to
contact us for any additional information.
Best regards,
Eranda Cela and Bettina Klinz
--
Eranda Dragoti-Cela, PhD, Associate Professor (ao. Univ.-Prof.)
Department of Optimization and Discrete Mathematics,
Graz University of Technology,
Steyrergasse 30, A-8010 Graz, Austria
Tel. ++43 316 873 5366, Fax: ++43 316 873105366,
Email: cela@math.tugraz.at
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] 25th British Combinatorial Conference at the University of Warwick, 5 July - 10 July 2015
We are pleased to announce that the 25th British Combinatorial
Conference will take place in the Mathematics Institute at the
University of Warwick from Sunday 5 July (arrival date) to Friday 10
July 2015. The website for the conference is
http://warwick.ac.uk/25bcc where further information will be posted in
due course.
Conference will take place in the Mathematics Institute at the
University of Warwick from Sunday 5 July (arrival date) to Friday 10
July 2015. The website for the conference is
http://warwick.ac.uk/25bcc where further information will be posted in
due course.
The invited speakers are:
- Manuel Bodirsky (École Polytechnique, Paris)
- Xing Chaoping (Nanyang Technological University)
- David Conlon (University of Oxford)
- Stefanie Gerke (Royal Holloway, University of London)
- Gil Kalai (Hebrew University of Jerusalem)
- Tomasz Luczak (Adam Mickiewicz University, Poznan)
- Gary McGuire (University College Dublin)
- Sergey Norin (McGill University, Montreal)
- Nik Ruskuc (University of St Andrews)
There will be an opportunity for participants to contribute talks, and
details of this will be announced in due course.
The local organisation is being handled by
Artur Czumaj
Agelos Georgakopoulos
Dan Kral
Vadim Lozin (chair)
Oleg Pikhurko.
A further announcement will be made when registration opens (beginning
of February 2015). In the meantime, email queries can be sent to
25bcc[at]warwick.ac.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Research grant (BI-D) - BacHBerry project
Dear colleague,
Please distribute widely and sorry for crossposting. Thank you.
Best regards,
Susana Vinga
Please distribute widely and sorry for crossposting. Thank you.
Best regards,
Susana Vinga
--------------------------------
1 Research Grant – Post-doc (BI-D)
We are seeking one postdoc candidate in the context of a FP7 KBBE
European Project, BacHBerry - "BACterial Hosts for production of
Bioactive phenolics from bERRY fruits, www.bachberry.eu (European
Union FP7- 613793).
Scientific Area: Optimization and Operations Research.
Required education Level and research experience: PhD in one of the
following areas: optimization, operations research, machine learning,
computer science, mathematics, statistics or related, with a taste for
inter-disciplinary research, and with very good interpersonal skills.
Ideally, the person will have a long experience with optimization
techniques, machine learning and graphical models. Unusual CVs are
welcome.
Workplan: With the development of genetic and metabolic engineering is
it now possible to increase the cells' production of given substances
by manipulating the corresponding metabolic networks, which can be
defined as hypergraphs (nodes are compounds, edges are chemical
reactions). BachBerry is interested in the generation of bacterial
platforms for sustainable bio-based production of phenolic compounds
found in berry fruits. This is accomplished by maximizing the fluxes
in the network, a problem similar to those occurring in transportation
and logistics optimization. The candidate will work on the development
and application of optimization methods and algorithms, in particular
expanding techniques based on linear programming (FBA), bi-level
mixed-integer (OptKnock) and multi-level optimization (OptCom). Also
sparse optimization might provide relevant solutions and will be
explored during the project.
Workplace and scientific supervision: The candidate will work in the
Center of Intelligent Systems at the IDMEC
(http://www.idmec.ist.utl.pt/), Instituto Superior Técnico, Lisboa,
Portugal, under the supervision of Susana Vinga and in interaction
with the partners of BacHBerry, in particular the BAMBOO team at the
Inria-UCBL in Lyon, France (http://team.inria.fr/bamboo/) and
Marie-France Sagot. Both CSI and BAMBOO are methodological teams with
an expertise in computational and systems biology.
Duration: 12 months, from December 2014, and renewable for up to the
duration of the project.
Evaluation Criteria: The criteria for selection consists on the
academic record of the candidate (30%), publications in areas of the
grant (30%) and evidence of specialized knowledge in the area of the
grant, in particular in optimization (40%). The Jury may decide to
interview the candidates in order to perform a more objective
evaluation of some of the criteria.
Application Dates: From 10th November to 1st December 2014.
Documents to be submitted: Detailed curriculum vitae; motivation
letter; copy of academic study certificates; name of two personal
references. The applications should be submitted via email to
bachberry.wp8@gmail.com
For more details: http://web.ist.utl.pt/susanavinga/
--
_________________________
Susana Vinga, PhD
IDMEC/IST-UL
Av. Rovisco Pais, 1049-001 Lisboa, Portugal
Tel. (+351) 218 419 504 Fax: (+351) 218 498 097
Email: susanavinga@tecnico.ulisboa.pt
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, October 29, 2014
[DMANET] CIAC 2015: SUBMISSION DEADLINE EXTENDED TO NOVEMBER 9, 2014
CIAC 2015: SUBMISSION DEADLINE EXTENDED TO NOVEMBER 9, 2014
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] CFP IEEE SECON 2015 (Deadline - December 5, 2014)
[Please accept our apologies if you receive multiple copies of this Call
for Papers (CFP).]
***********************************************************************************
CALL FOR PAPERS
IEEE SECON 2015
12th Annual IEEE International Conference on
Sensing, Communications and Networking
http://www.ieee-secon.org/
June 22-25, 2015 - Seattle, USA
***********************************************************************************
IMPORTANT DATES
Abstract Registration: 4:00pm PST on December 5, 2014
Paper Submission Deadline: 4:00pm PST on December 12, 2014
Acceptance Notification: March 13, 2015
Camera Ready: April 10, 2015
SCOPE
The twelfth annual IEEE SECON conference will provide a unique forum to
exchange innovative research ideas, recent results, and share
experiences among researchers and practitioners in wireless networks and
mobile systems. The focus of IEEE SECON is novel communication
technologies and emerging applications and services, involving mobile
sensing and communication, and ubiquitous and pervasive computing.
In addition to the traditional topics published in SECON, this year the
conference would like to especially encourage papers in emerging
applications and services in areas related to Internet of Things, 5G,
small cells, wearable computing, and Software Defined Networking for
mobile and wireless networks.
TOPICS OF INTEREST
Papers describing original, previously unpublished research work,
experimental efforts, practical experiences, and industrial and
commercial developments in all aspects of sensor networks, mobile
devices, and wireless communication are solicited. Within this domain,
particular topics of interest include, but are not limited to:
* Experience with deployment of mobile apps, networks and systems
* Software Defined Networking for mobile and wireless networks
* Wearable computing
* White space, cooperative and cognitive communications
* Network management for mobile devices, including data consumption,
energy consumption, and performance
* Novel smartphone-based sensing systems, tools, applications and
experiences
* Novel applications: cyber-physical systems, Internet of Things,
distributed mobile computing
* New communication technologies, such as NFC, visible light, underwater
communication
* Low power and energy limited sensing and communications, including
energy-harvesting
* Cellular communications and data networks, such as cellular small
cells and 5G
* Measurement of wireless and sensor systems, and novel experimental
testbeds
* Security, privacy, and trustworthiness of mobile, wireless and sensor
systems
* Survivability, network management, and fault tolerance
* Application protocols and cross-layer design
PAPER SUBMISSION AND PUBLICATION
Papers should neither have been published elsewhere nor currently under
review by another venue. All papers for IEEE SECON 2015 must be
submitted via EDAS at https://edas.info/newPaper.php?c=18611 . Papers
must be no longer than 9 pages and in font size no smaller than 10
points. Additional paper submission instructions will be made available
on the IEEE SECON website http://ieee-secon.org . Papers that violate
the format guidelines will be rejected without review.
To be published in the IEEE SECON 2015 Conference Proceedings and to be
eligible for publication in IEEE Xplore, an author of an accepted paper
is required to register for the conference at the full (member or
non-member) rate and the paper must be presented by an author of that
paper at the conference unless the TPC Chair grants permission for a
substitute presenter arranged in advance of the event and who is
qualified both to present and answer questions. Non-refundable
registration fees must be paid prior to uploading the final IEEE
formatted, publication-ready version of the paper. For authors with
multiple accepted papers, one full registration is valid for up to 3
papers. Accepted and presented papers will be published in the IEEE
SECON 2015 Conference Proceedings and submitted to IEEE Xplore.
The organizers of IEEE SECON 2015 as well as our attendees expect
accepted papers to be presented at the conference. IEEE reserves the
right to exclude a paper from distribution after the conference (e.g.,
removal from IEEE Xplore) if the paper is not presented at the conference.
***********************************************************************************
EXECUTIVE COMMITTEE
General Chair:
Suresh Singh, Portland State University, singh@cs.pdx.edu
TPC Co-Chairs:
Sharad Agarwal, Microsoft Research, Sharad.Agarwal@microsoft.com
Song Chong, KAIST, songchong@kaist.edu
Technical Program Vice Chair for Information Systems
Kyunghan Lee, UNIST, khlee@unist.ac.kr
Publicity Co-Chairs:
Aline Carneiro Viana, INRIA, aline.viana@inria.fr
Jungmin So, Hallym University, jso1@hallym.ac.kr
Demo Chair:
Srihari Nelakuditi, U of S. Carolina, srihari@cse.sc.edu
Poster Chair:
Thanh Dang, WSU Vancover, thanh.dang@vancouver.wsu.edu
Panel Chair:
Raju Pandey, UC Davis and Synapsense Inc., pandey@synapsense.com
Web Chair:
Tian Lan, George Washington University, tlan@email.gwu.edu
Publications Chair:
Guiling Wang, NJIT, guiling.wang@njit.edu
Travel Grants Co-Chairs:
Ranga Rao Venkata Prasad, TU Delft, Netherlands,
R.R.VenkateshaPrasad@tudelft.nl
Joseph Camp, SMU, camp@lyle.smu.edu
Workshop Chairs:
Ehsan Aryafar, Intel/Princeton, earyafar@gmail.com
Xinyu Zhang, U. Wisconsin, Madison, xyzhang@ece.wisc.edu
Local Arrangements/Finance Chair:
Eduardo Cuervo Laffaye, MSR, cuervo@microsoft.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/
*
**********************************************************
for Papers (CFP).]
***********************************************************************************
CALL FOR PAPERS
IEEE SECON 2015
12th Annual IEEE International Conference on
Sensing, Communications and Networking
http://www.ieee-secon.org/
June 22-25, 2015 - Seattle, USA
***********************************************************************************
IMPORTANT DATES
Abstract Registration: 4:00pm PST on December 5, 2014
Paper Submission Deadline: 4:00pm PST on December 12, 2014
Acceptance Notification: March 13, 2015
Camera Ready: April 10, 2015
SCOPE
The twelfth annual IEEE SECON conference will provide a unique forum to
exchange innovative research ideas, recent results, and share
experiences among researchers and practitioners in wireless networks and
mobile systems. The focus of IEEE SECON is novel communication
technologies and emerging applications and services, involving mobile
sensing and communication, and ubiquitous and pervasive computing.
In addition to the traditional topics published in SECON, this year the
conference would like to especially encourage papers in emerging
applications and services in areas related to Internet of Things, 5G,
small cells, wearable computing, and Software Defined Networking for
mobile and wireless networks.
TOPICS OF INTEREST
Papers describing original, previously unpublished research work,
experimental efforts, practical experiences, and industrial and
commercial developments in all aspects of sensor networks, mobile
devices, and wireless communication are solicited. Within this domain,
particular topics of interest include, but are not limited to:
* Experience with deployment of mobile apps, networks and systems
* Software Defined Networking for mobile and wireless networks
* Wearable computing
* White space, cooperative and cognitive communications
* Network management for mobile devices, including data consumption,
energy consumption, and performance
* Novel smartphone-based sensing systems, tools, applications and
experiences
* Novel applications: cyber-physical systems, Internet of Things,
distributed mobile computing
* New communication technologies, such as NFC, visible light, underwater
communication
* Low power and energy limited sensing and communications, including
energy-harvesting
* Cellular communications and data networks, such as cellular small
cells and 5G
* Measurement of wireless and sensor systems, and novel experimental
testbeds
* Security, privacy, and trustworthiness of mobile, wireless and sensor
systems
* Survivability, network management, and fault tolerance
* Application protocols and cross-layer design
PAPER SUBMISSION AND PUBLICATION
Papers should neither have been published elsewhere nor currently under
review by another venue. All papers for IEEE SECON 2015 must be
submitted via EDAS at https://edas.info/newPaper.php?c=18611 . Papers
must be no longer than 9 pages and in font size no smaller than 10
points. Additional paper submission instructions will be made available
on the IEEE SECON website http://ieee-secon.org . Papers that violate
the format guidelines will be rejected without review.
To be published in the IEEE SECON 2015 Conference Proceedings and to be
eligible for publication in IEEE Xplore, an author of an accepted paper
is required to register for the conference at the full (member or
non-member) rate and the paper must be presented by an author of that
paper at the conference unless the TPC Chair grants permission for a
substitute presenter arranged in advance of the event and who is
qualified both to present and answer questions. Non-refundable
registration fees must be paid prior to uploading the final IEEE
formatted, publication-ready version of the paper. For authors with
multiple accepted papers, one full registration is valid for up to 3
papers. Accepted and presented papers will be published in the IEEE
SECON 2015 Conference Proceedings and submitted to IEEE Xplore.
The organizers of IEEE SECON 2015 as well as our attendees expect
accepted papers to be presented at the conference. IEEE reserves the
right to exclude a paper from distribution after the conference (e.g.,
removal from IEEE Xplore) if the paper is not presented at the conference.
***********************************************************************************
EXECUTIVE COMMITTEE
General Chair:
Suresh Singh, Portland State University, singh@cs.pdx.edu
TPC Co-Chairs:
Sharad Agarwal, Microsoft Research, Sharad.Agarwal@microsoft.com
Song Chong, KAIST, songchong@kaist.edu
Technical Program Vice Chair for Information Systems
Kyunghan Lee, UNIST, khlee@unist.ac.kr
Publicity Co-Chairs:
Aline Carneiro Viana, INRIA, aline.viana@inria.fr
Jungmin So, Hallym University, jso1@hallym.ac.kr
Demo Chair:
Srihari Nelakuditi, U of S. Carolina, srihari@cse.sc.edu
Poster Chair:
Thanh Dang, WSU Vancover, thanh.dang@vancouver.wsu.edu
Panel Chair:
Raju Pandey, UC Davis and Synapsense Inc., pandey@synapsense.com
Web Chair:
Tian Lan, George Washington University, tlan@email.gwu.edu
Publications Chair:
Guiling Wang, NJIT, guiling.wang@njit.edu
Travel Grants Co-Chairs:
Ranga Rao Venkata Prasad, TU Delft, Netherlands,
R.R.VenkateshaPrasad@tudelft.nl
Joseph Camp, SMU, camp@lyle.smu.edu
Workshop Chairs:
Ehsan Aryafar, Intel/Princeton, earyafar@gmail.com
Xinyu Zhang, U. Wisconsin, Madison, xyzhang@ece.wisc.edu
Local Arrangements/Finance Chair:
Eduardo Cuervo Laffaye, MSR, cuervo@microsoft.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/
*
**********************************************************
Monday, October 27, 2014
[DMANET] PhD scholarships at SUTD
Multiple scholarships are available for bright and motivated students
who want to pursue a PhD in Singapore, starting September 2015, in a
number of areas broadly related to operations research such as: supply
chain, transportation and logistics, telecommunication systems and the
Internet, energy (renewables, environment, electricity markets),
service systems, financial engineering, critical infrastructure and
security, social networks, healthcare.
Students will be attached to the Engineering Systems and Design
pillar, a multidisciplinary department in SUTD with faculty from the
best universities in the world, including MIT, Cambridge, UC Berkeley,
Caltech, and Cornell. The faculty is engaged in numerous research
projects using tools from optimization, operations management, game
theory and mechanism design, applied probability, economics, and more.
SUTD is a research-intensive university, recently established in
collaboration with MIT, and its president is Tom Magnanti, former Dean
of Engineering at MIT and former President of INFORMS. Singapore is a
prime location to engage in research with real practical impact, and
is a meeting point of different cultures, providing an enriching life
experience for students.
The ESD PhD program comprises coursework, research, teaching, and
overseas research or industry experiences, with a flexible mentoring
structure. We offer highly attractive financial packages for qualified
PhD applicants who are selected for a scholarship.
More information about the program, and a link to the application
portal, can be found at: http://esd.sutd.edu.sg/academics/phd-program/
Feel free to get in touch with phd@esd.sutd.edu.sg or
nannicini@sutd.edu.sg for questions and clarifications.
**********************************************************
*
* 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/
*
**********************************************************
who want to pursue a PhD in Singapore, starting September 2015, in a
number of areas broadly related to operations research such as: supply
chain, transportation and logistics, telecommunication systems and the
Internet, energy (renewables, environment, electricity markets),
service systems, financial engineering, critical infrastructure and
security, social networks, healthcare.
Students will be attached to the Engineering Systems and Design
pillar, a multidisciplinary department in SUTD with faculty from the
best universities in the world, including MIT, Cambridge, UC Berkeley,
Caltech, and Cornell. The faculty is engaged in numerous research
projects using tools from optimization, operations management, game
theory and mechanism design, applied probability, economics, and more.
SUTD is a research-intensive university, recently established in
collaboration with MIT, and its president is Tom Magnanti, former Dean
of Engineering at MIT and former President of INFORMS. Singapore is a
prime location to engage in research with real practical impact, and
is a meeting point of different cultures, providing an enriching life
experience for students.
The ESD PhD program comprises coursework, research, teaching, and
overseas research or industry experiences, with a flexible mentoring
structure. We offer highly attractive financial packages for qualified
PhD applicants who are selected for a scholarship.
More information about the program, and a link to the application
portal, can be found at: http://esd.sutd.edu.sg/academics/phd-program/
Feel free to get in touch with phd@esd.sutd.edu.sg or
nannicini@sutd.edu.sg for questions and clarifications.
**********************************************************
*
* 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] Frontiers of Algorithmics Workshop First Call for Papers -- deadline Feb. 1, 2015
The 9th International Frontiers of Algorithmics Workshop
Guilin, China, July 3-5, 2015
Important Dates
Submission deadline: February 1, 2015
Notification of acceptance: March 10, 2015
Final version due: April 10, 2015
The 9th International Frontiers of Algorithmics Workshop (FAW 2015)
will provide a focused forum on current trends of research on
algorithms, discrete structures, operation research, combinatorial
optimization and their applications, and will bring together
international experts at the research frontiers in these areas to
exchange ideas and to present significant new results.
Interesting new results in all areas of algorithmics, operation
research and combinatorial optimization and their applications are
welcome. In addition to theoretical work, we are also interested in
results that report on experimental and applied research of general
algorithmic interest. Special considerations will be given to
algorithmic research that is motivated by real-world applications.
Typical, but not exclusive, topics of interest include:
Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical
applications;
Biomedical imaging algorithms;
Combinatorial optimization;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.
Submission Guidelines and Publication Information
The submission deadline is February 1, 2015 (anywhere on Earth). FAW
2015 will only accept electronic (PS or PDF) submissions. The
submission webpage for FAW 2015 is:
https://easychair.org/conferences/?conf=faw2015
Only previously unpublished new results will be considered for
publication. Papers that have already been published at another
journal or conference with proceedings, or simultaneously submitted or
accepted to another conference with proceedings will not be
considered. A submission should not exceed 10 pages, excluding
bibliography and appendices, formatted for letter-size paper using 11
point or larger font.
The proceedings of the Conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science (LNCS) series, and will be
available for distribution at the conference.
Selected high quality papers will be invited to a special issue in the
journal of Theoretical Computer Science and in the Journal of
Combinatorial Optimization, respectively. The invited papers will go
through the normal reviewing process.
General Conference Chairs
John Hopcroft (Cornell University, USA)
Shichao Zhang (Guangxi Normal University, China)
Program Chairs
Chee Yap (New York University, USA)
Jianxin Wang (Central South University, China)
**********************************************************
*
* 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/
*
**********************************************************
Guilin, China, July 3-5, 2015
Important Dates
Submission deadline: February 1, 2015
Notification of acceptance: March 10, 2015
Final version due: April 10, 2015
The 9th International Frontiers of Algorithmics Workshop (FAW 2015)
will provide a focused forum on current trends of research on
algorithms, discrete structures, operation research, combinatorial
optimization and their applications, and will bring together
international experts at the research frontiers in these areas to
exchange ideas and to present significant new results.
Interesting new results in all areas of algorithmics, operation
research and combinatorial optimization and their applications are
welcome. In addition to theoretical work, we are also interested in
results that report on experimental and applied research of general
algorithmic interest. Special considerations will be given to
algorithmic research that is motivated by real-world applications.
Typical, but not exclusive, topics of interest include:
Algorithms and data structures;
Algorithmic game theory and incentive analysis;
Approximation algorithms and online algorithms;
Automata, languages, logic, and computability;
Bioinformatics, computational biology and medicine, and biomedical
applications;
Biomedical imaging algorithms;
Combinatorial optimization;
Combinatorics and discrete structures related to algorithms and complexity;
Communication networks and optimization;
Complexity theory;
Computational algebra, geometry, number theory, and statistics;
Computational learning theory, knowledge discovery, and data mining;
Cryptography, reliability, and security;
Database theory, large databases, and natural language processing;
Experimental algorithmic methodologies;
Geometric information processing and communication;
Graph algorithms and theory;
Graph drawing and information visualization;
Internet algorithms and protocols;
Large graph algorithms and social network analysis;
Optimization algorithms in economic and operations research;
Parallel and distributed computing and multicore algorithms;
Parameterized algorithms, heuristics, and analysis;
Pattern recognition algorithms;
Trustworthy algorithms and trustworthy software.
Submission Guidelines and Publication Information
The submission deadline is February 1, 2015 (anywhere on Earth). FAW
2015 will only accept electronic (PS or PDF) submissions. The
submission webpage for FAW 2015 is:
https://easychair.org/conferences/?conf=faw2015
Only previously unpublished new results will be considered for
publication. Papers that have already been published at another
journal or conference with proceedings, or simultaneously submitted or
accepted to another conference with proceedings will not be
considered. A submission should not exceed 10 pages, excluding
bibliography and appendices, formatted for letter-size paper using 11
point or larger font.
The proceedings of the Conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science (LNCS) series, and will be
available for distribution at the conference.
Selected high quality papers will be invited to a special issue in the
journal of Theoretical Computer Science and in the Journal of
Combinatorial Optimization, respectively. The invited papers will go
through the normal reviewing process.
General Conference Chairs
John Hopcroft (Cornell University, USA)
Shichao Zhang (Guangxi Normal University, China)
Program Chairs
Chee Yap (New York University, USA)
Jianxin Wang (Central South University, China)
**********************************************************
*
* 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 (IndiaCom 2015 special session) -- 2 Weeks to Deadline
[We apologize if you receive multiple copies of this message.]
This is a reminder that the paper submission deadline is November 10, 2014.
---------------
CALL FOR PAPERS
---------------
We invite you to contribute to the special session of the Indiacom 2015 conference. Please, find the details below.
Session Title:
Wireless Sensor Networks for sustainable development
>From low layer communications to Software Oriented Architecture
Special Issue at IndiaCom 2015 (http://www.bvicam.ac.in/indiacom/)
With the recent advances in many fields of technologies, wireless sensor networks have gained in attention and are more and more envisioned for a large set of purposes ranging from environment monitoring to rescue operation ranging from health assistance or factory monitoring. For many of these applications, the use of this new technology allows more energy saving and sustainability.
The main focus of this special session 'Wireless Sensor Networks for sustainable development – From low layer communications to Software Oriented Architecture' in IndiaCom 2015 is to review and assess all the research done in the wireless sensor network area for sustainability.
Topics of particular interest include, but are not limited to:
- WSN-based paradigms and architectures for sustainable applications and technologies
- WSN Software oriented architectures
- Tools for developing sustainable WSN applications
- WSN cloud vs distributed computing
- Security and privacy control mechanisms
- Performance assessment and management (QoS, scalability, reliability, etc)
- PHY layer, Spectrum management for energy-efficiency
- MAC protocols (e.g., scheduling, power control etc.) for energy-efficiency
- Mobility management
- Object, device and service management
- Sustainable design and technologies (e.g. energy-efficiency)
- Test-beds and field trials
- Standardization and regulatory issues…
General chairs:
- Dr Nathalie Mitton, Inria, France
- Prof.Dr.O.P.Vyas, Indian Institute of Information Technology Allaha, India
Program committee members (tentative):
- Dr Milan Erdelj, UTC, France
- Dr Ibrahim Amadou, Université de Valenciennes, France
- Dr Nicola Zema, Mediterranean University of Reggio Calabria, Italy
- Dr. D.S.Kushwaha , Motilal Nehru National Institute of Technology, Allahabad (UP), India
- Akhilendra Pratap Singh, Department of Computer Science & Engineering, National Institute of Technology, Meghalaya, India
- Anuj Kumar Dwivedi, School of Computer Science & I.T., Pt.R.S.University Raipur (CG), India
Publicity chairs:
- Viktor Toldov, Université Lille 1, Inria, France
- Anuj Dwivedi, Indian Institute of Information Technology Allaha, India
Submission guidelines :
Authors are invited to submit original unpublished manuscripts by using the following link: https://easychair.org/conferences/?conf=indiacom15sustainabl
Papers should demonstrate current research. Paper submissions should be no longer than 6 pages with a font size of 10 using the IEEE conference template. Papers must be submitted electronically as PDF files. All submitted papers will be subject to peer reviews by Technical Program Committee members and other experts in the field. Please, note that at least one author of each accepted paper must register and attend the workshop to present the paper. Failure to present the paper at the workshop will result in the withdrawal of the paper from the Proceedings.
Important dates :
Submission Deadline: November 10, 2014
Acceptance Notification: January 12, 2015
Camera Ready Due: January 22, 2015
Registration deadline : January 22, 2015
Conference Dates: March 11-13, 2015
All information about the special issue :
http://www.bvicam.ac.in/indiacom/splSessionDetails.asp?sessionRequestID=18
All information about IndiaCom:
http://www.bvicam.ac.in/indiacom/
Contacts:
Nathalie.mitton@inria.fr
dropvyas@gmail.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/
*
**********************************************************
Sunday, October 26, 2014
[DMANET] Welcome You to DIPDMWC2015, Dubai
***************************************************************************
We apologize for multiples copies. Please circulate this CFP among your
colleagues and students.
***************************************************************************
[DIPDMWC2015] The International Conference on Digital Information
Processing, Data Mining, and Wireless Communications
http://sdiwc.net/conferences/dipdmwc2015/
***************************************************************************
The proposed conference on the above theme will be held at Academic City
Campus, Dubai, UAE, From January 28-30, 2015 which aims to enable
researchers build connections between different digital applications.
The conference welcomes papers on the following (but not limited to)
research topics:
**Digital Information Processing
* Adaptive Signal Processing
* Parallel Programming & Processing
* Artificial Intelligence
* Expert Systems
* Image Processing
* Information Security and Cryptography
* Modulation, Coding, and Channel Analysis
* Multimedia Signal Processing
* E-Learning, E-Commerce, E-Marketing, E-Banking
**Data Mining
* Data Mining Techniques
* Ethics of Data Mining
* Risk Management and Analysis
* Data Classification and Clustering
* Abnormally and Outlier Detection
* Feature Extraction and Data Reduction
* Multi-Task Learning
**Wireless Communications
* Energy Minimization in Cluster-Based Wireless Sensor Networks
* Bioinformatics and Scientific Computing
* Coding and Modulation
* Mobile IP Networks/ Ad-hoc Networks
* Vehicular Wireless Networks
* Security and Robustness in Wireless Networks
* Wireless Sensor Networks
* Network Management
****************************
Important Dates
****************************
* Submission Date: Open from now until Jan. 08, 2015
* Notification of Acceptance: 2-3 weeks from the submission date
* Camera Ready Submission and Registration: Open from now until Jan. 18, 2015
**********************************************************
*
* 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/
*
**********************************************************
We apologize for multiples copies. Please circulate this CFP among your
colleagues and students.
***************************************************************************
[DIPDMWC2015] The International Conference on Digital Information
Processing, Data Mining, and Wireless Communications
http://sdiwc.net/conferences/dipdmwc2015/
***************************************************************************
The proposed conference on the above theme will be held at Academic City
Campus, Dubai, UAE, From January 28-30, 2015 which aims to enable
researchers build connections between different digital applications.
The conference welcomes papers on the following (but not limited to)
research topics:
**Digital Information Processing
* Adaptive Signal Processing
* Parallel Programming & Processing
* Artificial Intelligence
* Expert Systems
* Image Processing
* Information Security and Cryptography
* Modulation, Coding, and Channel Analysis
* Multimedia Signal Processing
* E-Learning, E-Commerce, E-Marketing, E-Banking
**Data Mining
* Data Mining Techniques
* Ethics of Data Mining
* Risk Management and Analysis
* Data Classification and Clustering
* Abnormally and Outlier Detection
* Feature Extraction and Data Reduction
* Multi-Task Learning
**Wireless Communications
* Energy Minimization in Cluster-Based Wireless Sensor Networks
* Bioinformatics and Scientific Computing
* Coding and Modulation
* Mobile IP Networks/ Ad-hoc Networks
* Vehicular Wireless Networks
* Security and Robustness in Wireless Networks
* Wireless Sensor Networks
* Network Management
****************************
Important Dates
****************************
* Submission Date: Open from now until Jan. 08, 2015
* Notification of Acceptance: 2-3 weeks from the submission date
* Camera Ready Submission and Registration: Open from now until Jan. 18, 2015
**********************************************************
*
* 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 24, 2014
[DMANET] (Tenure-Track) Assistant Professor of Game Theory / Operations Research / Social Choice Theory
(Tenure-Track) Assistant Professor of Game Theory / Operations Research / Social Choice Theory
The Department of Quantitative Economics at Maastricht University School of Business and Economics (SBE) offers a tenure track assistant professorship in Game Theory / Operations Research / Social Choice Theory
Job description: The applicant will be appointed as a tenure track assistant professor and contribute to research and teaching within the overlapping areas of game theory, operations research, and social choice theory. Teaching concerns courses in economics, economic theory, and operations research, at the undergraduate and graduate levels. Research falls under the program Economic Theory, Behavior and Computation.
Job qualification: (Almost) Ph.D. in relevant area, affinity with teaching, strong research orientation and background in economic theory and/or operations research. Willingness to work in teams, potential to become a leading researcher in the field.
The Mathematical Economics and Operations Research Group at the Department of Quantitative Economics has a strong research orientation and record in the fields of game theory, mechanism design and social choice theory, including algorithmic and computational aspects. The members teach the undergraduate and graduate courses in these fields in the bachelor and masters programs in econometrics, business and economics at SBE.
Besides the strong focus on research, the group also aims to provide excellent education. The student population at SBE is international, with approximately 60% of students from outside of the Netherlands. All teaching is in the English language. Many of the activities of the group are performed in teams, and the group tries to foster such teamwork as much as possible.
Conditions of employment: The Assistant professor position is initially offered for a three-year period and, subject to a positive evaluation, extended by another three years, with the possibility of tenure thereafter.
Salary is competitive, depending on qualifications and work experience, between € 3.259,00 and € 5.070,00 per month for a fulltime assistant professorship (12 monthly payments. On top of this, there is an 8% holiday allowance. Non-Dutch applicants could be eligible for a favorable tax treatment (30% rule).
Applications: Applications should be received not later than November 7, 2014. They should include a curriculum vitae and copies of some written work. Two letters of reference, assessing the applicant's research potential and personality, should be sent independently by the referees. Applications can, preferably, be sent by e-mail to: sbe@maastrichtuniversity.nl
(with cc to h.peters@maastrichtuniversity.nl and r.muller@maastrichtuniversity.nl) or to: Maastricht University School of Business and Economics, Personnel Department, P.O. Box 616, 6200 MD, Maastricht, The Netherlands, and refer to vacancy AT2014.186 on both letter and envelope.
For further information on the position you may contact: Prof.dr. H.J.M. Peters at h.peters@maastrichtuniversity.nl, tel. + 31 43 388 3288 or Prof. dr. R. Müller at r.muller@maastrichtuniversity.nl, tel. + 31 43 388 3799.
**********************************************************
*
* 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/
*
**********************************************************
The Department of Quantitative Economics at Maastricht University School of Business and Economics (SBE) offers a tenure track assistant professorship in Game Theory / Operations Research / Social Choice Theory
Job description: The applicant will be appointed as a tenure track assistant professor and contribute to research and teaching within the overlapping areas of game theory, operations research, and social choice theory. Teaching concerns courses in economics, economic theory, and operations research, at the undergraduate and graduate levels. Research falls under the program Economic Theory, Behavior and Computation.
Job qualification: (Almost) Ph.D. in relevant area, affinity with teaching, strong research orientation and background in economic theory and/or operations research. Willingness to work in teams, potential to become a leading researcher in the field.
The Mathematical Economics and Operations Research Group at the Department of Quantitative Economics has a strong research orientation and record in the fields of game theory, mechanism design and social choice theory, including algorithmic and computational aspects. The members teach the undergraduate and graduate courses in these fields in the bachelor and masters programs in econometrics, business and economics at SBE.
Besides the strong focus on research, the group also aims to provide excellent education. The student population at SBE is international, with approximately 60% of students from outside of the Netherlands. All teaching is in the English language. Many of the activities of the group are performed in teams, and the group tries to foster such teamwork as much as possible.
Conditions of employment: The Assistant professor position is initially offered for a three-year period and, subject to a positive evaluation, extended by another three years, with the possibility of tenure thereafter.
Salary is competitive, depending on qualifications and work experience, between € 3.259,00 and € 5.070,00 per month for a fulltime assistant professorship (12 monthly payments. On top of this, there is an 8% holiday allowance. Non-Dutch applicants could be eligible for a favorable tax treatment (30% rule).
Applications: Applications should be received not later than November 7, 2014. They should include a curriculum vitae and copies of some written work. Two letters of reference, assessing the applicant's research potential and personality, should be sent independently by the referees. Applications can, preferably, be sent by e-mail to: sbe@maastrichtuniversity.nl
(with cc to h.peters@maastrichtuniversity.nl and r.muller@maastrichtuniversity.nl) or to: Maastricht University School of Business and Economics, Personnel Department, P.O. Box 616, 6200 MD, Maastricht, The Netherlands, and refer to vacancy AT2014.186 on both letter and envelope.
For further information on the position you may contact: Prof.dr. H.J.M. Peters at h.peters@maastrichtuniversity.nl, tel. + 31 43 388 3288 or Prof. dr. R. Müller at r.muller@maastrichtuniversity.nl, tel. + 31 43 388 3799.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, October 22, 2014
[DMANET] CiE 2015: Evolving Computability, Bucharest, June 29 - July 3, 2015
1st CALL FOR PAPERS:
COMPUTABILITY IN EUROPE 2015: Evolving Computability
Bucharest, Romania
June 29 - July 3
http://fmi.unibuc.ro/CiE2015/
IMPORTANT DATES:
Submission Deadline for LNCS: 11 January 2015
Notification of authors: 9 March 2015
Deadline for final revisions: 6 April 2015
CiE 2015 is the 11th conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others
interested in new developments in computability and their
underlying significance for the real world. Previous meetings
have taken place in Amsterdam (2005), Swansea (2006), Siena
(2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013) and Budapest (2014).
Evolution of the universe, and us within it, invite a parallel
evolution in understanding. The CiE agenda - fundamental and
engaged - targets the extracting and developing of computational
models basic to current challenges. From the origins of life, to
the understanding of human mentality, to the characterising of
quantum randomness - computability theoretic questions arise in
many guises. The CiE community, this coming year meeting for the
first time in Bucharest, carries forward the search for
coherence, depth and new thinking across this rich and vital
field of research.
In all cases we are looking for fundamental and theoretical
submissions. In line with other conferences in this series, CiE
2015 has a broad scope and provides a forum for the discussion of
theoretical and practical issues in Computability with an
emphasis on new paradigms of computation and the development of
their mathematical theory.
We particularly invite papers that build bridges between
different parts of the research community.
For topics covered by the conference, please visit
http://fmi.unibuc.ro/CiE2015/topics.html
TUTORIAL SPEAKERS
* John Reif (Duke Unversity)
* Steve Simpson (Pennsylvania State University)
CONFIRMED PLENARY SPEAKERS
* Ann Copestake (University of Cambridge)
* Mircea Dumitru (University of Bucharest, Public Lecture)
* Pawel Gawrychowski (Max-Planck-Institut fuer Informatik)
* Julia Knight (University of Notre Dame)
* Anca Muscholl (Universite Bordeaux)
* Gheorghe Paun (Romanian Academy)
* Alexander Razborov (University of Chicago
and Steklov Mathematical Institute)
* Vlatko Vedral (University of Oxford)
SPECIAL SESSIONS on
* Representing streams
(Organizers: Joerg Endrullis and Dimtri Hendriks)
* Automata, logic and infinite games
(Organizers: Dietmar Berwanger and Ioana Leustean)
* Reverse mathematics
(Organizers: Damir Dzhafarov and Alberto Marcone)
* Classical computability theory
(Organizers: Marat Arslanov and Steffen Lempp)
* Bio-inspired computation
(Organizers: Andrei Paun and Petr Sosik)
* History and philosophy of computing
(Organizers: Christine Proust and Marco Benini)
The PROGRAMME COMMITTEE consists of:
* Marat Arslanov (Kazan) * Jeremy Avigad (Pittsburgh)
* Veronica Becher (Buenos Aires) * Arnold Beckmann (Swansea)
* Laurent Bienvenu (Paris) * Alessandra Carbone (Paris)
* Gabriel Ciobanu (Iasi) * S Barry Cooper (Leeds)
* Laura Crosilla (Leeds) * Liesbeth De Mol (Ghent)
* Walter Dean (Warwick) * Volker Diekert (Stuttgart)
* Damir Dzhafarov (Storrs, Connecticut)
* Peter van Emde Boas (Amsterdam) * Rachel Epstein (Harvard)
* Johanna Franklin (Hempstead, NY) * Neil Ghani (Glasgow)
* Joel David Hamkins (New York) * Rosalie Iemhoff (Utrecht)
* Emmanuel Jeandel (LORIA) * Natasha Jonoska (Tampa, FL)
* Antonina Kolokolova (St.John's, NL)
* Antonin Kucera (Prague) * Oliver Kutz (Magdeburg)
* Benedikt Loewe (Hamburg & Amsterdam)
* Jack Lutz (Ames, IA) * Florin Manea (Kiel)
* Alberto Marcone (Udine) * Radu Mardare (Aalborg)
* Joe Miller (Madison, WI)
* Russell Miller (Flushing, NY) * Mia Minnes (La Jolla, CA)
* Victor Mitrana (Bucharest, co-chair)
* Ian Pratt-Hartmann (Manchester) * Dag Normann (Oslo)
* Mehrnoosh Sadrzadeh (London) * Anne Smith (St Andrews)
* Mariya Soskova (Sofia, co-chair) * Susan Stepney (York)
* Paul Spirakis (Patras & Liverpool)
* Jacobo Toran (Ulm) * Marius Zimand (Towson, MD)
The PROGRAMME COMMITTEE cordially invites all researchers
(European and non-European) in computability related areas to
submit their papers (in PDF format, max 10 pages using the LNCS
style) for presentation at CiE 2015.
The submission site
https://www.easychair.org/conferences/?conf=cie2015
is open.
For submission instructions consult
http://fmi.unibuc.ro/CiE2015/submission.html
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer
Verlag.
____________________________________________________________________
CiE 2015 http://fmi.unibuc.ro/CiE2015/
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE Membership Application Form http://www.lix.polytechnique.fr/CIE
Computability (Journal of CiE) http://www.computability.de/journal/
CiE on FaceBook https://www.facebook.com/AssnCiE
Association CiE on Twitter https://twitter.com/AssociationCiE
**********************************************************
*
* 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/
*
**********************************************************
COMPUTABILITY IN EUROPE 2015: Evolving Computability
Bucharest, Romania
June 29 - July 3
http://fmi.unibuc.ro/CiE2015/
IMPORTANT DATES:
Submission Deadline for LNCS: 11 January 2015
Notification of authors: 9 March 2015
Deadline for final revisions: 6 April 2015
CiE 2015 is the 11th conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others
interested in new developments in computability and their
underlying significance for the real world. Previous meetings
have taken place in Amsterdam (2005), Swansea (2006), Siena
(2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010),
Sofia (2011), Cambridge (2012), Milan (2013) and Budapest (2014).
Evolution of the universe, and us within it, invite a parallel
evolution in understanding. The CiE agenda - fundamental and
engaged - targets the extracting and developing of computational
models basic to current challenges. From the origins of life, to
the understanding of human mentality, to the characterising of
quantum randomness - computability theoretic questions arise in
many guises. The CiE community, this coming year meeting for the
first time in Bucharest, carries forward the search for
coherence, depth and new thinking across this rich and vital
field of research.
In all cases we are looking for fundamental and theoretical
submissions. In line with other conferences in this series, CiE
2015 has a broad scope and provides a forum for the discussion of
theoretical and practical issues in Computability with an
emphasis on new paradigms of computation and the development of
their mathematical theory.
We particularly invite papers that build bridges between
different parts of the research community.
For topics covered by the conference, please visit
http://fmi.unibuc.ro/CiE2015/topics.html
TUTORIAL SPEAKERS
* John Reif (Duke Unversity)
* Steve Simpson (Pennsylvania State University)
CONFIRMED PLENARY SPEAKERS
* Ann Copestake (University of Cambridge)
* Mircea Dumitru (University of Bucharest, Public Lecture)
* Pawel Gawrychowski (Max-Planck-Institut fuer Informatik)
* Julia Knight (University of Notre Dame)
* Anca Muscholl (Universite Bordeaux)
* Gheorghe Paun (Romanian Academy)
* Alexander Razborov (University of Chicago
and Steklov Mathematical Institute)
* Vlatko Vedral (University of Oxford)
SPECIAL SESSIONS on
* Representing streams
(Organizers: Joerg Endrullis and Dimtri Hendriks)
* Automata, logic and infinite games
(Organizers: Dietmar Berwanger and Ioana Leustean)
* Reverse mathematics
(Organizers: Damir Dzhafarov and Alberto Marcone)
* Classical computability theory
(Organizers: Marat Arslanov and Steffen Lempp)
* Bio-inspired computation
(Organizers: Andrei Paun and Petr Sosik)
* History and philosophy of computing
(Organizers: Christine Proust and Marco Benini)
The PROGRAMME COMMITTEE consists of:
* Marat Arslanov (Kazan) * Jeremy Avigad (Pittsburgh)
* Veronica Becher (Buenos Aires) * Arnold Beckmann (Swansea)
* Laurent Bienvenu (Paris) * Alessandra Carbone (Paris)
* Gabriel Ciobanu (Iasi) * S Barry Cooper (Leeds)
* Laura Crosilla (Leeds) * Liesbeth De Mol (Ghent)
* Walter Dean (Warwick) * Volker Diekert (Stuttgart)
* Damir Dzhafarov (Storrs, Connecticut)
* Peter van Emde Boas (Amsterdam) * Rachel Epstein (Harvard)
* Johanna Franklin (Hempstead, NY) * Neil Ghani (Glasgow)
* Joel David Hamkins (New York) * Rosalie Iemhoff (Utrecht)
* Emmanuel Jeandel (LORIA) * Natasha Jonoska (Tampa, FL)
* Antonina Kolokolova (St.John's, NL)
* Antonin Kucera (Prague) * Oliver Kutz (Magdeburg)
* Benedikt Loewe (Hamburg & Amsterdam)
* Jack Lutz (Ames, IA) * Florin Manea (Kiel)
* Alberto Marcone (Udine) * Radu Mardare (Aalborg)
* Joe Miller (Madison, WI)
* Russell Miller (Flushing, NY) * Mia Minnes (La Jolla, CA)
* Victor Mitrana (Bucharest, co-chair)
* Ian Pratt-Hartmann (Manchester) * Dag Normann (Oslo)
* Mehrnoosh Sadrzadeh (London) * Anne Smith (St Andrews)
* Mariya Soskova (Sofia, co-chair) * Susan Stepney (York)
* Paul Spirakis (Patras & Liverpool)
* Jacobo Toran (Ulm) * Marius Zimand (Towson, MD)
The PROGRAMME COMMITTEE cordially invites all researchers
(European and non-European) in computability related areas to
submit their papers (in PDF format, max 10 pages using the LNCS
style) for presentation at CiE 2015.
The submission site
https://www.easychair.org/conferences/?conf=cie2015
is open.
For submission instructions consult
http://fmi.unibuc.ro/CiE2015/submission.html
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer
Verlag.
____________________________________________________________________
CiE 2015 http://fmi.unibuc.ro/CiE2015/
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE Membership Application Form http://www.lix.polytechnique.fr/CIE
Computability (Journal of CiE) http://www.computability.de/journal/
CiE on FaceBook https://www.facebook.com/AssnCiE
Association CiE on Twitter https://twitter.com/AssociationCiE
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, October 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/
*
**********************************************************
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.
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/
*
**********************************************************
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/
*
**********************************************************
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
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
========================================================================
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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
