dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. ISCO 2016 - Conference Program (ISCO 2016)
2. PhD position in graph algorithms in Bergen Norway
(Pinar Heggernes)
3. [ACM CHANTS 2016] Call for Papers - 4 weeks to deadline!
(Elisabetta Biondi)
4. 3rd Creative Mathematical Sciences Communication
(Frances Rosamond)
5. 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms
(FOGA XIV) (Dirk Sudholt)
----------------------------------------------------------------------
Message: 1
Date: Tue, 03 May 2016 18:42:05 +0200
From: ISCO 2016 <info@isco2016.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ISCO 2016 - Conference Program
Message-ID: <9f5c5e21acfb53481259b5bf346148c7@pop.isco2016.it>
Content-Type: text/plain; charset=UTF-8; format=flowed
=========================================================
4th International Symposium on Combinatorial Optimization
(ISCO 2016) May 16-18, 2016
Vietri sul Mare (Salerno), Italy
www.isco2016.it
info@isco2016.it
=========================================================
The ISCO 2016 conference program has been published on the conference
website.
Please visit http://www.isco2016.it/ to download it.
--
The Organizing Committee - ISCO 2016
------------------------------
Message: 2
Date: Wed, 4 May 2016 10:04:45 +0300
From: Pinar Heggernes <Pinar.Heggernes@uib.no>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] PhD position in graph algorithms in Bergen Norway
Message-ID: <57299F0D.5060501@uib.no>
Content-Type: text/plain; charset=utf-8; format=flowed
PhD position in Algorithms
The Algorithms Research Group at The Department of Informatics of
University of Bergen, Norway has a vacancy for a PhD position for 3
years, starting September 1, 2016. The application deadline is May 29, 2016.
The position is part of the project "CLASSIS : The renaissance of graph
classes - New algorithmic theory of forbidden induced subgraphs" funded
by the Research Council of Norway. The goal of this project is to
develop a new algorithmic theory of graph classes based on forbidden
induced subgraphs. Main research areas are algorithms and complexity,
combined with structural graph theory (graph classes).
The applicants must have ha master's degree in computer science,
industrial engineering, or mathematics, with a solid background in graph
algorithms. In particular, candidates with a specialization within
structural and algorithmic graph theory will be preferred. The
applicants must be highly motivated, able to work independently in a
disciplined manner, and have the ability to cooperate with others.
Proficiency in both written and oral English is a requirement.
The successful candidate will be working under the supervision of
Professor Pinar Heggernes.
Detailed information can be obtained and applications must be submitted
via the following web page:
https://www.jobbnorge.no/en/available-jobs/job/125338/phd-position-in-algorithms
Pinar Heggernes
http://www.ii.uib.no/~pinar/
------------------------------
Message: 3
Date: Wed, 04 May 2016 10:34:01 +0200
From: Elisabetta Biondi<chants16_publicity@iit.cnr.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [ACM CHANTS 2016] Call for Papers - 4 weeks to
deadline!
Message-ID: <5729b3f9.PS0Rt2KbVFgXne9/%chants16_publicity@iit.cnr.it>
Content-Type: text/plain; charset=us-ascii
===============================================================================
===============================================================================
ACM CHANTS 2016 - 11th Workshop on Challenged Networks
co-located with ACM MobiCom 2016
October 3-7, 2016, New York, USA
===============================================================================
===============================================================================
Challenged networks comprise those situations where communication is desired,
but traditional Internet architectures fail to provide it effectively. Such
networks may be characterized by intermittent connectivity, a heterogeneous mix
of nodes, frequent nodal churn, and widely varying network conditions. Examples
of challenged networks include deployments in rural and remote areas, networks
to support emergency response operations, inter-planetary networks, sensor and
wildlife monitoring networks, underwater networks, road vehicle networks, and,
more recently, networks of micro aerial vehicles. The applications of challenged
networks range from time-critical communications such as for disaster relief to
delay-tolerant transmission in poorly connected regions or where censorship
should be counteracted. However, challenged networking has also found many
applications in everyday settings, for which they were not initially conceived,
such as opportunistic networking supporting data-centric communications, traffic
offloading from cellular networks, mobile cloud/edge computing, opportunistic
and participatory sensing, challenged IoT. The increasing availability of
wireless communications in embedded devices as well as integration of
technologies such as Wi-Fi direct on Android platforms and LTE's D2D
(device-to-device) communication on general purpose mobile devices, will further
push the development of challenged networking solutions. Challenged networking
has also chartered new directions for inter-disciplinary research, e.g.,
applying findings from social networks and network science.
This workshop builds on the success of the ten previous CHANTS workshops, and
WDTN 2005, and aims to stimulate research on the most novel topics of challenged
networking research. This year's edition encourages submission of theoretical
and experimental work (including studies of real deployment), with a primary
interest in the **new directions of challenged networking such as mobile
cloud/mobile edge computing, IoT, mobile data offloading, and challenged SDN**.
The workshop seeks original work presented in the form of research papers
describing new research approaches and results, as well as demo submissions.
Highly disruptive work-in-progress and position papers are also welcome,
provided they focus on particularly innovative, out-of-the-box, solutions or
applications for challenged networks. All papers shall be forward-looking,
describe their relationship to existing work, and shall argue their impact and
implications for ongoing or future research.
Topics of interest include, but are not limited to:
- Delay/disruption-tolerant networks (DTNs), opportunistic communication and computing
- Architecture, design, and implementation of communication systems for challenged networks
- Modeling, analysis, and characterization of challenged networks and protocols
- Challenged networking techniques for mobile cloud computing
- Mobile data offloading via challenged networks
- Challenged networking techniques for participatory and opportunistic sensing
- Challenged networking in the Internet of Things
- Big data analytics in challenged networking
- Software-defined networking in challenged environments
- Security/trust/privacy concerns and solutions in challenged networks
- Energy-efficient communication in challenged networks
- Information centric and content-centric networking in challenged networks
- Real-world mobility trace collection, analysis, and modeling for challenged environments
- Network science methods for challenged networks
- Network coding in challenged networks
- Novel challenged networking systems (e.g., networks of micro aerial vehicles)
- Real deployment and case studies in various stages of use
- Disrupted scenarios for challenged networks (e.g., disaster relief and emergency management)
- Daily use applications (e.g., mobile social networking, crowdsourcing, censorship evasion, sensor networks, smart cities)
- Test and simulation tools for evaluating challenged network systems
- Configuration, management, and monitoring of challenged networks.
PAPER FORMAT AND SUBMISSION INSTRUCTIONS
----------------------------------------
Submitted papers must be no longer than 6 pages, and should adhere to the
standard ACM conference proceedings format. Demo proposals (to be published as
part of the proceedings) must not be longer than 2 pages plus 1 page description
of the precise setup and requirements (the 1-page setup description will not be
published in the proceedings). Reviews will be single-blinded. Papers should
neither have been published elsewhere nor being currently under review by
another conference or journal.
EDITORIAL FOLLOW-UPS
--------------------
Extended versions of the selected workshop papers will be considered for
possible fast track publication on the Computer Communications Journal
(Elsevier), in a special section on Challenged Networks.
IMPORTANT DATES
---------------
- Abstract Registration: 25 May 2016
- Submission Deadline: 1 June 2016
- Acceptance Notification: 6 July 2016
- Camera Ready Due: 20 July 2016
PROGRAM COMMITTEE CHAIRS
------------------------
Chiara Boldrini (IIT-CNR, Italy)
Marcelo Dias de Amorim (UPMC and CNRS, France)
TECHNICAL PROGRAM COMMITTEE
---------------------------
Kevin Almeroth (UC-Santa Barbara, USA)
Mostafa Ammar (Georgia Institute of Technology, USA)
Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)
Guohong Cao (The Pennsylvania State University, USA)
Marco Cello (Nokia Bell Labs)
Vania Conan (Thales Communications & Security, France)
Luis Costa (Universidade Federal do Rio de Janeiro, Brazil)
Do Young Eun (North Carolina State University, USA)
Kevin Fall (Carnegie Mellon University, USA)
Stephen Farrell (Trinity College Dublin, Ireland)
Domenico Giustiniano (IMDEA Networks Institute, Spain)
Tristan Henderson (University of St Andrews, UK)
Andrea Hess (Trinity College Dublin, Ireland)
Pan Hui (Hong Kong Unive. of Science and Technology)
Karin Anna Hummel (JKU Linz, Austria)
Mohan Kumar (Rochester Institute of Technology, USA)
Kyunghan Lee (UNIST, Korea)
Anders Lindgren (SICS Swedish ICT, Sweden)
Mirco Musolesi (University College London, UK)
Katia Obraczka (UC Santa Cruz, USA)
Melek Onen (Eurecom, France)
Joerg Ott (Technische Universitat Munchen, Germany)
Elena Pagani (Universita degli Studi di Milano, Italy)
Andrea Passarella (IIT-CNR, Italy)
Eric Rozner (IBM Research, USA)
Pavlos Sermpezis (FORTH, Greece)
Thrasyvoulos Spyropoulos (Eurecom, France)
Stavros Toumpis (Athens University of Economics and Business, Greece)
Thierry Turletti (INRIA, France)
Yu Wang (University of North Carolina at Charlotte, USA)
Eiko Yoneki (University of Cambridge, UK)
Xiaolan Zhang (Fordham University, USA)
WEB CHAIR
---------
Fehmi Ben Abdesslem (SICS Swedish ICT, Sweden)
PUBLICITY CHAIR
---------------
Elisabetta Biondi (IIT-CNR, Italy)
STEERING COMMITTEE
------------------
Kevin Almeroth (UC Santa Barbara, USA)
Kevin Fall (Carnegie Mellon University, USA)
Stephen Farrell (Trinity College Dublin, Ireland)
Jorg Ott (Technische Universitat Munchen, Germany)
Andrea Passarella (IIT-CNR, Italy)
------------------------------
Message: 4
Date: Wed, 04 May 2016 12:27:48 +0200
From: Frances Rosamond <Frances.Rosamond@uib.no>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 3rd Creative Mathematical Sciences Communication
Message-ID: <ce32d1032b6120a6c90e6e3122f2f271@webmail.uib.no>
Content-Type: text/plain; charset=US-ASCII; format=flowed
3rd CREATIVE MATHEMATICAL SCIENCES COMMUNICATION CONFERENCE (CMSC)
4 - 7 October 2016, Luebeck, Germany
http://www.tcs.uni-luebeck.de/cmsc
Explore new ways of popularizing the rich mathematics underlying
computer
science including outdoor activities, art, dance, drama and all forms of
storytelling. This is CSUnplugged (www.csunplugged.org) and Beyond.
Challenge yourself to communicate our research culture to young people
and you will inevitably confront fresh
mathematical questions that will renew your own research, and your
field. The creative dynamic is bi-directional.
This conference series explores new ways of helping students to achieve
21st Century competencies in mathematics and computer science. The
previous
conferences, held in Darwin, Australia in 2013 and in Chennai, India
in 2014 (Videos from 2014) saw a unique interaction between computer
science / mathematics researchers and educators and artists (theatre,
dance, graphic arts).
Everyone interested in innovative ways to teach / popularize
algorithmics
and its foundations is welcome. We encourage you to present your own
efforts and discuss new ideas. Presentations and demonstrations welcome,
also ideas for leading round-table discussions.
Important dates:
Abstracts due: 10 June 2016
Submissions due: 8 July 2016
Early Registration: 15 August 2016
Conference: 4-7 October 2016
------------------------------
Message: 5
Date: Wed, 4 May 2016 14:11:34 +0100
From: Dirk Sudholt <d.sudholt@sheffield.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 14th ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms (FOGA XIV)
Message-ID: <13ddaee4-5287-6a55-d030-6f8800da641a@sheffield.ac.uk>
Content-Type: text/plain; charset=utf-8; format=flowed
The 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XIV)
12-15 January 2017, Copenhagen, Denmark
http://foga-2017.sigevo.org
contact: foga@list.ku.dk
FOGA is the premier event on the theoretical foundations of evolutionary
computation and invites submissions on all kinds of randomised search
heuristics, including but not limited to evolutionary algorithms, ant
colony optimisation, artificial immune systems, particle swarm
optimisation, simulated annealing, Bayesian optimisation, and other
Monte Carlo methods for search and optimisation.
The goal of FOGA is to advance the theoretical understanding of
randomised search heuristics and to contribute to making randomised
search heuristics more useful in practice. We particularly encourage
submissions bridging theory and practice. In addition to rigorous
mathematical investigations, experimental studies contributing towards
the theoretical foundations of randomised search heuristics are also
welcome.
Topics include but are not limited to runtime analysis; fitness
landscapes and problem difficulty; single- and multi-objective
optimisation problems; stochastic and dynamic environments; population
dynamics; statistical approaches; self-adaptation; black-box complexity;
working principles of all kinds of randomised search heuristics.
Accepted papers will be published in post-conference proceedings by ACM
Press.
Authors should submit their papers (12 page maximum) consistent with the
alternate ACM SIG style file by the submission deadline (see
http://www.acm.org/sigs/publications/proceedings-templates).
Submissions are made through EasyChair:
https://www.easychar.org/conferences/?conf=foga2017
Deadline for paper submission: 31 August, 2016 (non-extensible)
Notification of authors: 1 November, 2016
Organisers:
Christian Igel, University of Copenhagen, Denmark.
Dirk Sudholt, University of Sheffield, United Kingdom.
Carsten Witt, Technical University of Denmark, Denmark.
Apologies for cross-posting!
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 99, Issue 6
*************************************
No comments:
Post a Comment