====================
OPEN PROBLEM SESSION
====================
Since its earliest gatherings, the International (originally Australasian)
Workshop on Combinatorial Algorithms (IWOCA) has had collaborative problem
solving as an essential part of its meetings. This takes place alongside
the formal progamme of invited and contributed talks, although there is now
one timetabled meeting to fire-up activity! This provides an enjoyable and
fraternal element and contributes to the special nature of these workshops.
Following a well-established tradition there will be an (online) open
problems session at IWOCA 2020, on June 10 at 17:00 CEST time.
If you have an open problem you would like to present, or have presented,
at the conference, we would like to invite you to suggest it for the open
problem section. You can just write to either of the IWOCA Problem Section
Chairs (or both):
Alessio Conte (conte [at] di.unipi.it)
Gabriele Fici (gabriele.fici [at] unipa.it).
During and after the conference, open problems are collected and documented
on the IWOCA homepage:
https://nms.kcl.ac.uk/iwoca/index_problems.html
Our aim is to publish each problem in the form of 1-2 page PDFs, that also
provide some background information and references for the problems, like
here:
https://nms.kcl.ac.uk/iwoca/problems_list.html
Please be ready to put your problem into this format if we ask you to.
To attend you must register to IWOCA 2020 at
https://iwoca2020.labri.fr/registration/ (free of charge)
====================
GRAPHMASTERS
====================
For the second time, IWOCA will also host a GraphMasters workshop. The
workshop will be on June 11, and its goal is to foster collaboration
between researchers interested in graph algorithms and problems. The spirit
of the workshop is informal: (virtual) working space is provided to the
participants, who are welcome to group as they like and seek each other's
counsel and opinion. More details can be found at
http://graphmasters.di.unipi.it/ .
The workshop will start with participants introducing interesting
graph-related problems: ideally these should be problems that can be
introduced quickly and without excessive technical detail (which can be
further discussed later on in the working sessions), while grabbing the
attention of a wide range of graph-savy researchers.
Please send a demonstration of interest to the organizer:
Alessio Conte (conte [at] di.unipi.it).
In the email, we encourage to mention whether you have an interesting
problem to share. We also encourage to already present the problems during
the IWOCA Open Problems Session.
Best regards,
Alessio Conte and Gabriele Fici
**********************************************************
*
* 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
