Monday, July 1, 2024

[DMANET] Combinatorial Reconfiguration Workshop - Last call for presentations

CALL FOR PRESENTATIONS

=======================================================
The 5th Combinatorial Reconfiguration Workshop

October 7-11, 2024
Nishijin Plaza, Kyushu University, Japan

Submission deadline: July 7, 23:59 (AoE)
=======================================================

* Aim and Scope
Combinatorial Reconfiguration studies reachability and related questions
over combinatorial structures. (See, e.g., a survey at
https://doi.org/10.3390/a11040052 ) These types of questions arise in
many areas of computer science, mathematics, and related fields. In
addition to presenting the latest research findings related to
combinatorial reconfiguration, a major feature of this workshop is to
allocate ample time for participants to engage in working sessions
tackling open problems. Our previous workshops have each resulted in new
    collaborations, many stemming from open problem sessions during
which researchers have a chance to meet and work together for the first
time.

* Call for Presentations
We are seeking participants interested in presenting in one or more of
the following types of sessions:
- Contributed talks
- Mentoring sessions
- Open problem sessions

All topics relating to any aspect or application of combinatorial
reconfiguration are welcome, including both published and unpublished
work. Presentations of ongoing work and open problems are encouraged.

Mentoring sessions are designed for newcomers to the area to obtain
feedback from more senior members in the community, including on work in
progress.

Open problem sessions will be used as the starting point for working
sessions during the workshop, allowing for new collaborations to be
formed. We will accommodate new open problem presentations suggested
during the workshop if time permits; submitting open problems by the
submission deadline will ensure a reserved time slot.

Please feel free to propose more than one type of presentation. For each
proposed presentation, please provide a title and a single paragraph
explaining what will be discussed, via the Google form below. If you are
submitting more than one proposal, use the Google form once for each
proposal. There will be no formal refereeing process; however, the
Program Committee reserves the right to reject contributions that are
substantially off-topic.

https://forms.gle/satzTguSbj9FjDTcA


We anticipate that the length of presentations will be approximately
20-30 minutes (or less at the request of the presenter); however, exact
times will be determined only when we know how many presentations have
been accepted.

* Important Dates:
- Submission deadline: July 7, 23:59 (AoE)
- Notification: July 19

* Invited Speakers:
- Jean Cardinal (Université libre de Bruxelles, Belgium)
- Naoto Ohsaka (CyberAgent, Inc., Japan)

* Program Committee:
- Nicolas Bousquet (CNRS, Université Claude Bernard Lyon 1, France)
- Takehiro Ito (Tohoku University, Japan), Chair
- Naomi Nishimura (University of Waterloo, Canada)
- Akira Suzuki (Tohoku University, Japan)

* Organizing Committee:
- Takehiro Ito (Tohoku University, Japan), Chair
- Naoyuki Kamiyama (Kyushu University, Japan)
- Akira Suzuki (Tohoku University, Japan)

* Contact
Please send any questions to reconf.workshop2024@grp.tohoku.ac.jp

* Support
- Institute of Mathematics for Industry, Joint Usage/Research Center in
Kyushu University (Reference No. 2024a037)
- JSPS Grant-in-Aid for Scientific Research (Grant No. JP24H00686)


--
Nicolas Bousquet, for the program committee


**********************************************************
*
* 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/
*
**********************************************************