Looking forward to seeing you on zoom.
Topics in Algorithmic Graph Theory 2021
Monday July 26, 2021 (on zoom)
New York 8:30-11:30; Rio and Buenos Aires 9:30-12:30;
London 13:30-16:30; Paris 14:30-17:30;
Jerusalem 15:30-18:30; Bangalore 18:00-21:00
Greetings and Introduction
Lowell W. Beineke and Robin J. Wilson
Short talks for advanced students and seasoned researchers
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
A workshop to mark the publication of the new book:
Topics in Algorithmic Graph Theory
(Cambridge University Press, 2021)
Exploring recent developments in graph algorithms and related concepts.
Registration is free but mandatory.
To receive Zoom details, please visit:
<http://www.cri.haifa.ac.il<
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>
=======================================================
Schedule
Authors of selected chapters will introduce their topic with short
talks suitable for both graduate students and seasoned researchers.
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
Ann N. Trenk and 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 Nesetril:
Graph homomorphisms
farewell
**********************************************************
*
* 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
