PARAMETERIZED COMPLEXITY FOR PRACTICAL COMPUTING
**********************************************************
We kindly invite you to a one day FPT workshop to be held at Victoria 
University of Wellington on Wednesday 25 July 2018.
Additional information is on the fpt page of the www.cmsc.nz website 
located at https://www.cmsc.nz/ftp-workshop/
Objective: The objective of this workshop is to stimulate discussion on 
the useful purpose of FPT. Discussion may include how parameterized 
complexity interacts with operations research, algorithms engineering, 
machine learning, artificial intelligence, and other areas. Topics 
include turbo-charging heuristics, groovy FPT, reverse kernelization, 
extremal gradients and others.
Keynote speaker: Mike Fellows will talk about Future Directions of the 
Field.   The Research Council of Norway has awarded a Toppforsk grant of 
about 4.5 million AUD for the project: Parameterized Complexity for 
Practical Computing. The funding scheme supports "scientific quality at 
the forefront of international research; boldness in scientific thinking 
and innovation".  (See www.mrfellows.net for a copy of the Toppforsk 
grant proposal).
The workshop is informal and broad, and appropriate for PhD, PostDoc and 
Masters students as well as more senior academics.
Location: Wellington, New Zealand at Victoria University, Cotton 
Building, CO350.
Date: Wednesday July 25th 2018
Register / Submit Abstract: by sending an email to Catherine McCartin 
<C.M.McCartin@massey.ac.nz>  (Massey University, New Zealand) or to 
Frances Rosamond <frances.rosamond@uib.no> (University of Bergen, 
Norway).
There is no fee for the workshop.
Topic:
The original book introducing parameterized complexity written by Downey 
and Fellows and published in 1999, envisioned the central goal of the 
program: "to serve the community". This workshop is intended to 
highlight how FPT practitioners are employing parameterized algorithm 
design and application in a wide variety of areas. There has been 
tremendous progress in bringing the toolkit to support fields such as 
AI, computational biology, computational social choice and other 
disciplines, and subfields of computer science. The PACE Parameterized 
Algorithms and Computational Experiments Challenge is helping deepen the 
relationship between parameterized algorithmic theory and practice.
To encourage wide participation and  discussion, there will be no formal 
publication of workshop proceedings. Accepted papers will be posted 
online for the benefit of the workshop participants. Submission of 
preliminary work and papers being prepared for other major venues in the 
field are invited.
****************************************
Adjacent Conference: CREATIVE MATHEMATICAL SCIENCES COMMUNICATION 
(CMSC2018). Explore important topics and open questions for computer 
science outreach. At this conference we discuss how to design activities 
that communicate the foundational ideas of computer science. These will 
contribute to the CS Unplugged! repository and Bebras. Come early to the 
FPT Workshop and also attend CMSC 2018 (See www.cmsc.nz).
****************************************
Anyone coming from outside New Zealand should check VISA requirements.
-- 
Frances Rosamond, Professor
Department of Informatics
University of Bergen
Editor: Parameterized Complexity Newsletter
Editor: Parameterized Complexity wiki (www.fpt.wikidot.com)
Program Committee: Parameter Implementation PACE 
(https://pacechallenge.wordpress.com)
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
Posts
 
