I enclose the final call for papers for this year's WG. Please note the
deadline in about 3 weeks.
Kind regards,
Dan Kral
=======================
WG 2024 CALL FOR PAPERS
=======================
WG 2024
Gozd Martuljek, Slovenia
June 19-21, 2024
https://conferences.famnit.upr.si/event/31/
IMPORTANT DATES
===============
Deadline for article registration (abstract submission): 8 February 2024 AoE
Deadline for article submission: 15 February 2024 AoE
Notification of acceptance: 19 April 2024
Early registration: 30 April 2024
Conference: June 19-21, 2024
Final versions due: 12 July 2024
WG 2024 is the 50th International Workshop on Graph-Theoretic Concepts in
Computer Science that aims to connect theory and applications by
demonstrating how graph-theoretic concepts can be applied in various areas
of computer science.
INVITED SPEAKERS
================
Shiri Chechik, Tel-Aviv University
Michał Pilipczuk, University of Warsaw
WG 2024 TEST OF TIME AWARD AND LECTURE
=====================================
The WG 2024 Test of Time Award is given to Hans L. Bodlaender, John R.
Gilbert, Ton Kloks, and Hjálmtyr Hafsteinsson, for their paper
"Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height"
from WG 1991.
The WG 2024 Test of Time Award lecture will be given by Hans L. Bodlaender,
Utrecht University.
ORGANIZED BY
============
- The Mathematics Departments of the Faculty of Mathematics, Natural
Sciences and Information Technologies and Andrej Marušič Institute,
University of Primorska,
- Slovenian Discrete and Applied Mathematics Society, and
- Institute of Mathematics, Physics and Mechanics, Ljubljana.
For questions please contact the organizers at wg2024@famnit.upr.si.
CONTRIBUTED PAPERS
===================
Submitted papers should describe original results in any aspects of graph
theory related to computer science, including but not restricted to: design
and analysis of sequential, parallel, randomized, parameterized, and
distributed graph and network algorithms; structural graph theory with
algorithmic or complexity applications; computational complexity of graph
and network problems; graph grammars, graph rewriting systems and graph
modeling; graph drawing and layouts; computational geometry; computational
biology; graph mining; random graphs and models of the web and scale-free
networks; and support of the above concepts by suitable implementations and
applications.
Contributed papers will be selected from submissions received by the
Program Committee consisting of:
Isolde Adler (University of Bamberg)
Édouard Bonnet (LIP, ENS Lyon)
Flavia Bonomo-Braberman (University of Buenos Aires)
Sergio Cabello (University of Ljubljana and IMFM)
Tınaz Ekim (Boğaziçi University)
Jessica Enright (University of Glasgow)
Henning Fernau (University of Trier)
Jakub Gajarský (University of Warsaw)
Archontia C. Giannopoulou (National and Kapodistrian University of Athens)
Thekla L.S. Hamm (Utrecht University)
Meike Hatzel (National Institute of Informatics)
Philipp Kindermann (University of Trier)
Ekkehard Köhler (Brandenburg University of Technology Cottbus–Senftenberg)
Daniel Kráľ (Masaryk University, co-chair)
Jan Kratochvíl (Charles University)
Matjaž Krnc (University of Primorska)
O-joung Kwon (Hanyang University)
Barnaby Martin (Durham University)
Dániel Marx (CISPA)
Martin Milanič (University of Primorska, co-chair)
Bojan Mohar (Simon Fraser University and IMFM)
Torsten Mütze (University of Warwick)
Christophe Paul (CNRS, Université Montpellier)
Paweł Rzążewski (Warsaw University of Technology and University of Warsaw)
Jan Arne Telle (University of Bergen)
Viktor Zamaraev (University of Liverpool)
Stanislav Živný (University of Oxford)
The Program Committee cordially invites all researchers to submit their
papers in all areas related to the above topics for presentation at the
conference and inclusion in the proceedings of WG 2024 at
https://easychair.org/conferences/?conf=wg2024.
Papers must be submitted in PDF format, using the LNCS style (available at
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines)
and must have a maximum of 12 pages, including title and abstract, but
excluding references. Proofs omitted due to space restrictions must be
placed in an appendix, to be read by programme committee members at their
discretion. All papers must be original and not simultaneously submitted to
another journal or conference. At least one author of each accepted paper
will be expected to register and present the paper in person at the
conference.
Accepted papers will be published in the conference post-proceedings in the
Lecture Notes in Computer Science (LNCS) series of Springer-Verlag.
AWARDS
=======
WG 2024 will offer awards for the best paper and the best student paper.
The awards will be decided by the program committee. The committee can
decide to split the awards over multiple papers, or not to offer an award.
Papers eligible for the best student paper can have non-student co-authors,
but the main work in a paper that is a candidate for the best student paper
award must be done by co-authors that were students at the time of
submission, and the award can be received only by such co-authors. It must
be indicated at the time of submission whether a paper is eligible for this
award.
SPONSORS
==========
The conference has received support from the European Mathematical Society
and Springer.
**********************************************************
*
* 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
