Friday, March 11, 2022

Re: [DMANET] IPCO 2022 -- Call for Posters

*IPCO 2022 -- Call for Posters*

We would like to open the call for participation for the poster session of the 23rd Conference on Integer Programming and Combinatorial Optimization (IPCO 2022). The conference will take place at TU Eindhoven on June 27-29 preceded by a summer school on June 25-26 (for more info, see https://www.ipco2022.com/home). The poster session will take place in-person during the afternoon of Monday June 27.

The call is open to all and the posters may be on any topic of interest to IPCO. We particularly welcome posters from Ph.D. students and Postdocs. There will be an award for the best poster, where the winner will be decided by a committee present during the poster session.

In order to present a poster, authors must send an email to ipco@tue.nl by April 15, 2022, with subject line: "IPCO POSTER: FIRSTNAME LASTNAME".

The email must contain the following information:

- Author(s)
- Affiliation(s)
- A title
- A short abstract (a pdf of max 1 page (excluding references))
- The name of the participant presenting the poster (one of the authors)

Notification of acceptance will be provided by April 22, 2022. The number of posters accepted is subject to the number of available poster slots. Furthermore, the organizing committee reserves the right to turn down submissions considered out of scope. Details about the poster format will be provided shortly after the notification deadline. Poster presenters are required to register for the conference.

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