Topics in Algorithmic Graph Theory 2021

Book launch workshop:

Topics in Algorithmic Graph Theory 2021

Monday July 26, 2021 (on zoom)

8:30-11:30 New York; 9:30-12:30 Rio and Buenos Aires; 13:30-16:30 London;

14:30-17:30 Paris; 15:30-18:30 Jerusalem; 18:00-21:00 Bangalore; 22:30-01:30+1 Sydney

Greetings and Introduction

Lowell W. Beineke and Robin J. Wilson

Short talks

Martin Golumbic, Alain Hertz, Celina deFigueiredo, Ilan Newman,

Vadim Lozin, Ann Trenk, Karen Collins, Martin Milanič,

Dieter Rautenbach, Gila Morgenstern and Jaroslav Nešetřil

To mark the publication of the new book,

Topics in Algorithmic Graph Theory

Cambridge University Press, 2021,

https://www.cambridge.org/core/books/topics-in-algorithmic-graph-theory/4AD9538A0062A16AC1D53D2BD01A5AF9

the volume editors, Lowell W. Beineke, Martin Charles Golumbic and Robin J. Wilson,

and the chapter authors of the volume. invite our colleagues and the general

scientific community to a book launch workshop.

Registration is free but mandatory to receive Zoom details.

Please click here: https://forms.gle/QyfP29g3dc7o4Qj7A

Sponsored by University of Haifa, Caesarea Rothschild Institute and Holon Institute of Technology, Computer Science Department

Co-Chairs: Martin Charles Golumbic <golumbic@cs.haifa.ac.il>

Gila Morgenstern <gilam@hit.ac.il>

Zoom Chair: Nathan Wallheimer <nathanwallh@gmail.com>

Organizing Chair: Tamir Gadot <tamir_gadot@hotmail.com>

-------------------------------------------------------------------------------------------------------

Tentative Schedule

Session 1: 60 minutes

Lowell Beineke and Robin Wilson: An Introduction to the Cambridge Topics series

Martin Charles Golumbic : Touring the Topics in Algorithmic Graph Theory

Alain Hertz: Graph colouring variations

Celina Figueiredo: Total colouring

break

Session 2: 45 minutes

Ilan Newman: Testing of graph properties

Vadim Lozin: Cliques, colouring and satisfiability: from structure to algorithms -- highlights

Ann Trenk & Karen Collins: Split graphs

break

Session 3: 60 minutes

Martin Milanič: Strong cliques and stable sets

Dieter Rautenbach: Restricted matchings

Gila Morgenstern: Covering geometric domains

Jaroslav Nešetřil: Graph homomorphisms