CALL FOR PAPERS: PARAMETERIZED COMPLEXITY AND PRACTICAL COMPUTING (PCPC)
WORKSHOP. August 5--9, 2019 in Bergen, Norway.
======================================================================================
The objective of the workshop is to build bridges between parameterized
complexity theory and practical applications.
WEBSITE:
https://www.uib.no/en/rg/algo/127995/parameterized-complexity-and-practical-computing-workshop
KEYNOTE SPEAKERS AND THEIR APPLICATION AREAS:
• Prof. Gregory Gutin (Royal Holloway, University of London) -
Di-graphs, Computer Security-Cryptography, Workflow Satisfiability.
• Prof. Klaus Jansen (University of Kiel, Germany) - Scheduling problems
• Prof. Blair Sullivan (Univ Utah, Oak Ridge National Laborator, USA)
-Data-driven science: Computational neuroscience, quantum computing,
biomechanical engineering, cybersecurity, social networks.
========================================================================================
LOCATION AND DATES
• Dates: The workshop will take place in Bergen, Norway during the week
starting Monday 05 August, 2019.
• Place: The first two days (Monday and Tuesday, 05 and 06 August) will
be held at the Solstrand Hotel.
• Place: Day 3 (Wednesday 07 August) will be a fjord trip offering the
opportunity for continued discussion. See below.
• Place: Days 4 and 5 (Thursday and Friday, 08 and 09) talks will be
presented at the University of Bergen.
========================================================================================
SUBMISSIONS
The workshop aims to bring together researchers and practitioners of
Parameterized algorithms to share their perspectives and experiences. We
solicit submissions describing research results with practical
applications, and position statements leading to new directions,
standpoints, and learned lessons. There will be long (40 minute) and
short (20 minute) talks and discussion time. Exact format TBA.
ABSTRACT
Submit an abstract with your preference for length of talking time to:
Mateus De Oliveira Oliveira <Mateus.Oliveira@uib.no>. In the Subject
line put the words: PCPC REGISTRATION.
========================================================================================
REGISTRATION
There is no fee for the workshop.
The following expenses will be covered by Mike Fellows' Norwegian
Toppforsk Grant:
• Accommodation to all participants for one night (August 05 to August
06) at the Solstrand Hotel. Meals are provided at the hotel.
• Buses from UiB to the workshop venue on the morning of August 05 and
back to UiB on the evening of August 06.
• Taxis from the airport to Solstrand Hotel for people arriving at
Bergen airport on the morning of August 05. If you are contemplating
this possibility please make taxi arrangements through the hotel so that
the hotel can arrange joint taxi if suitable.
• Fjord trip outing on Wednesday to continue discussions.
Fjord Trip on Wednesday, Day 3
There will be a cruise trip to the fjords on Wednesday, 07 July. The
cruise will pass through deep fjords, steep mountains, mighty
waterfalls, and powerful currents. The duration of the trip is about 3
hours.
• The cruise is called Fjordcruise Bergen-Mostraumen.
• The departure is from Zachariasbryggen quay at the Fish Market in
Bergen. Boarding at 13:30 pm.
==========================================================================================
FOR MORE INFORMATION CONTACT: Frances.rosamond@uib.no,
Michael.fellows@uib.no
--
Frances Rosamond, Professor
Department of Informatics, University of Bergen
Parameterized Complexity Newsletter
Parameterized Complexity wiki (www.fpt.wikidot.com)
Parameter Implementation PACE (https://pacechallenge.org/2019/)
President and CEO: Rosamond Computer Science Research and Education
**********************************************************
*
* 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/
*
**********************************************************
Posts
