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. CfP: GECCO 2016: Late-Breaking Abstracts
(José Francisco Chicano García)
2. BGW2016 (Bordeaux Graph Workshop) - November 7-10, 2016 -
Save the date (Eric Sopena)
3. postdoc position(s) at IRIF (LIAFA), Paris, France (Adi Rosen)
4. CFC PACE 2016 - The 1st Parameterized Algorithms and
Computational Experiments Challenge (Christian Komusiewicz)
----------------------------------------------------------------------
Message: 1
Date: Tue, 8 Mar 2016 12:41:05 +0100
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: GECCO 2016: Late-Breaking Abstracts
Message-ID: <C9BEEFCC-0DAF-45E9-AB6D-B68C72A69678@lcc.uma.es>
Content-Type: text/plain; charset=us-ascii
*********************************************************************************************************
CALL FOR PAPERS
2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO 2016)
LATE-BREAKING ABSTRACTS
July 20-24, 2016, Denver, CO, USA
Submission deadline: April 3rd, 2016
Organized by ACM SIGEVO
http://gecco-2016.sigevo.org/index.html/Late-Breaking+Abstracts
*********************************************************************************************************
** DESCRIPTION
Two-page abstracts describing late-breaking developments in the field
of genetic and evolutionary computation are solicited for presentation
at the Late-Breaking Abstracts Workshop of the 2016 Genetic and
Evolutionary Computation Conference (GECCO 2016), and for inclusion in
the proceedings companion to be distributed on USB key to all attendees
of the conference and in the ACM Digital Library.
** PRESENTATION FORMAT
Following the success of the last year poster format for Late Breaking
Abstracts, authors of the accepted submissions will be asked to prepare
a poster summarizing their contributions. The chair will introduce each
work at the beginning of the session and attendees will have the opportunity
to interact with authors and enjoy a dynamic forum to share and spread
scientific ideas. The details about the poster preparation will be sent
to the authors of accepted abstracts.
** SELECTION PROCESS
Late-breaking abstracts will be briefly examined for relevance and
minimum standards of acceptability, but will not be peer reviewed in
detail. Authors of accepted late-breaking abstracts will individually
retain copyright (and all other rights) to their late-breaking abstracts.
Accepted late breaking abstracts with no author registered by the deadline
will not appear in the Late-Breaking Abstracts section on the USB key nor
the ACM Digital Library.
** HOW TO SUBMIT AN ABSTRACT
Submission site: https://ssl.linklings.net/conferences/gecco
Page limit: 2 pages using ACM template.
Templates for Word and LaTeX are available on the ACM website at
http://www.acm.org/publications/article-templates/proceedings-template.html.
** IMPORTANT DEADLINES
Submissions close: April 03, 2016, 23:59 (Anywhere on Earth)
Authors notification: April 20, 2016
Camera Ready Files Deadline: May 04, 2016
** TUTORIALS & WORKSHOPS
GECCO 2016 offers a rich program of tutorials and workshops.
See the full list at:
http://gecco-2016.sigevo.org/index.html/Tutorials
http://gecco-2016.sigevo.org/index.html/Workshops
** VENUE
GECCO 2016 will take place in Denver, Colorado, USA. This city is an
important industrial center, a major destination for business travel,
and a good base for trips into the Rocky Mountains.
** MORE INFORMATION
For more information, visit
http://gecco-2016.sigevo.org/index.html/Late-Breaking+Abstracts
** CONTACT
For technical matters, contact the Late Breaking Abstracts Workshop Chairs,
Francisco Chicano at chicano@lcc.uma.es
***************************************************************************************
GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).
------------------------------
Message: 2
Date: Tue, 8 Mar 2016 13:11:50 +0100
From: Eric Sopena <Eric.Sopena@labri.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] BGW2016 (Bordeaux Graph Workshop) - November 7-10,
2016 - Save the date
Message-ID: <56DEC186.3040108@labri.fr>
Content-Type: text/plain; charset=utf-8; format=flowed
BGW2016 (Bordeaux Graph Workshop) - Save the date
*BORDEAUX GRAPH WORKSHOP*
SAVE THE DATE - BGW 2016 - http://bgw.labri.fr/2016
*BGW 2016 - November 7-10, 2016*
BGW 2016 is the fourth edition of an international workshop on graph
theory, organized by the LaBRI team Graphes et optimisation.
The aim of this workshop is to gather renowned researchers from the
international graph community for a scientific meeting in a friendly
atmosphere. Its scope includes every field of graph theory.
Invited speakers:
Maria Axenovich (Karlsruher Institut für Technologie, Karlsruhe,
Germany)
Csilla Bujtás (University of Pannonia, Veszprém, Hungary)
Kathie Cameron (Wilfrid Laurier University, Waterloo, Canada)
Pavol Hell (Simon Fraser University, Burnaby, Canada)
Alexandr Kostochka (University of Illinois, Urbana, USA)
Daniel KráΔΎ (University of Warwick, Coventry, United Kingdom)
Carsten Thomassen (Technical University of Denmark, Copenhagen,
Denmark)
The scientific program includes invited talks (50 min) and contributed
talks (20 min). Details on the submission process will be given with the
opening of the submission platform.
The estimated fee for the conference participation (including lunches
and evening events) is about 300 euros.
--
on behalf of the organizing committee.
http://bgw.labri.fr/2016/
--
Eric Sopena.
-----------------------------------------------------------------
LaBRI, Université de Bordeaux
351 crs de la Libération, CS 10004, F-33405 Talence cedex, France
Tél. +33 5 40 00 38 71 - Fax. +33 5 40 00 66 69
-----------------------------------------------------------------
IUT de Bordeaux, Département Informatique
15, rue Naudet, CS 10207
33175 GRADIGNAN CEDEX, France
Tél. +33 5 56 84 57 85 - Fax. +33 5 56 84 58 86
-----------------------------------------------------------------
------------------------------
Message: 3
Date: Tue, 8 Mar 2016 14:10:40 +0100
From: Adi Rosen <adiro@liafa.univ-paris-diderot.fr>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] postdoc position(s) at IRIF (LIAFA), Paris, France
Message-ID:
<11E8C16C-4AD5-4628-9096-7822ACE45A3E@liafa.univ-paris-diderot.fr>
Content-Type: text/plain; charset=us-ascii
The Algorithms and Complexity group of IRIF - previously LIAFA -
(CNRS and University Paris Diderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions. The financing of this position
is provided by the ANR grant RDAM joint to that group and the Talgo team of the
Computer Science Department at the Ecole Normale Superieure, Paris.
Topics of interest include (but are not limited to):
algorithms, streaming algorithms, approximation algorithms, online algorithms,
computational game theory; and the application to those areas, or the
development, of complexity tools such as communication complexity or
information theory.
The successful candidate will be based at the Algorithms and Complexity
group of IRIF, but will be expected to interact also with the Talgo team
(located just 15 minutes away), and to work jointly with members of
both teams.
IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot - Paris 7.
For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr/en/index ,
and for more information about the Algorithms and Complexity group
please see https://www.irif.univ-paris-diderot.fr/en/equipes/algo/index .
The Computer Science Department of the Ecole Normale Superieure
is a joint laboratory of the ENS, the CNRS, and INRIA. For more informations
about that department please see:
http://www.di.ens.fr/WebHome.html.en ,
and for more information about the Talgo team please see:
http://www.di.ens.fr/TalgoTeam.html.en .
The starting date of the position will usually be in September 2016
but can be negotiated.
The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the "openings" sections at:
http://algo.irif.univ-paris-diderot.fr/ .
Due to a tight schedule, applications should be received by March 31, 2016.
Due to a tight schedule, please arrange that the references send their
letters of reference to the same address as the application itself, by the
same deadline.
------------------------------
Message: 4
Date: Tue, 8 Mar 2016 15:55:42 +0100
From: Christian Komusiewicz <christian.komusiewicz@uni-jena.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFC PACE 2016 - The 1st Parameterized Algorithms and
Computational Experiments Challenge
Message-ID: <56DEE7EE.4040304@uni-jena.de>
Content-Type: text/plain; charset=utf-8; format=flowed
Individuals and teams are invited to compete in the 1st Parameterized
Algorithms and Computational Experiments Challenge (PACE 2016).
Benchmark instances and submission requirements are available at the
challenge website pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com>.
The challenge has two different tracks:
Track A "Tree Width": optimal solutions, heuristics, generating hard
instances, and collecting real-world instances.
Track B "Feedback Vertex Set": fixed-parameter algorithms.
IMPORTANT DATES:
----------------
- 1 March 2016: Call for contributions; benchmark instances available.
- 1 June 2016: Register participation (see pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com> for details).
- 1 August 2016: DEADLINE to submit implementations.
- 22–26 August 2016: Results announced at the International Symposium
on Parameterized and Exact Computation (IPEC 2016
<http://conferences.au.dk/algo16/ipec/>).
GOALS:
------
PACE investigates the applicability of algorithmic ideas studied and
developed in the subfields of multivariate, fine-grained, parameterized,
or fixed-parameter algorithms. It aims to:
- Bridge between algorithms design and analysis theory and algorithm
engineering practice.
- Inspire new theoretical developments.
- Produce universally accessible libraries of implementations and
repositories of benchmark instances.
- Encourage the dissemination of these findings in scientific papers.
Program Committee:
------------------
TRACK A:
- Holger Dell, Saarland University and Simons Institute for the Theory
of Computing
- Thore Husfeldt, Lund University and IT University of Copenhagen
TRACK B:
- Falk Hüffner, TU Berlin
- Christian Komusiewicz, Friedrich Schiller University Jena
PACE Steering Committee:
------------------------
- Holger Dell, Saarland University and Simons Institute for the Theory
of Computing
- Thore Husfeldt, Lund University and IT University of Copenhagen
- Bart M. P. Jansen, Eindhoven University of Technology
- Petteri Kaski, Aalto University
- Christian Komusiewicz, Friedrich Schiller University Jena
- Amer Mouawad, University of Bergen
- Frances Rosamond (chair), University of Bergen
More information can be found on pacechallenge.wordpress.com
<https://pacechallenge.wordpress.com>.
------------------------------
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 97, Issue 10
**************************************
No comments:
Post a Comment