Haifa Graph Workshop—on ZOOM—June 7-8, 2020
11 views
Skip to first unread message
Prof. Martin Charles Golumbic
May 28, 2020, 8:45:46 AM5/28/20
to Martin Golumbic on Gmail, c...@cs.haifa.ac.il, col...@cs.haifa.ac.il, dma-...@nic.surfnet.nl, dma...@zpr.uni-koeln.de, dm-...@siam.org, icaps-co...@googlegroups.com, is...@googlegroups.com, the...@di.uoa.gr, TheoryNet, csco...@cs.biu.ac.il
Haifa Graph Workshop—on ZOOM—June 7-8, 2020
Registration: free but mandatory
Please visit: <http://www.cri.haifa.ac.il>*
20th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics and Algorithms
June 7-8, 2020* (Sunday – Monday)
11:00-13:00 and 16:00-17:30 Israel time*
(Sydney: +7h; Paris: -1h, London: -2h, Rio: -6h, New York: -7h, L.A.: -10h)
Sponsored by University of Haifa, Caesarea Rothschild Institute
3 INVITED SPEAKERS
Ignasi Sau (LIRMM, University of Montpellier, France)
Shakhar Smorodinsky (Ben Gurion University, Israel)
Meirav Zehavi (Ben Gurion University, Israel)
11 CONTRIBUTED TALKS
See the schedule below
or the website <http://www.cri.haifa.ac.il>
-----------------------------------------------------------------
Registration is free but mandatory.
Zoom details will be sent before the workshop to those registered.
-----------------------------------------------------------------*
General Chair: Martin Charles Golumbic <golu...@cs.haifa.ac.il>
Program co-Chairs:* Nili Beck <beck...@mta.ac.il>
and Michal Stern <st...@mta.ac.il>
Publicity and Abstracts Chair: Abhiruk Lahiri <abh...@iisc.ac.in>
Organizing Chair: Tamir Gadot <tamir...@hotmail.com>
*-----------------------------------------------------------------*
Session A Sunday Morning 11:00-13:00 June 7, 2020
11:00-11:45 Shakhar Smorodinsky (invited talk)
An extension of the notion of a median
11:50-12:10 Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná*, Daniël
Paulusma and Paweł Rzążewsk
Clique-Width: Harnessing the power of atoms
12:15-12:35 O. Herscovici, J.A. Makowsky*, and V. Rakita
Harary polynomials
12:40-13:00 Fiona Skerman*, Michael Albert, Cecilia Holmgren and Tony
Johansson
Permutations in binary trees and random trees
Session B Sunday Afternoon 16:00-17:35 June 7, 2020
16:00-16:20 Flavia Bonomo-Braberman, Esther Galby, and Carolina Luc´ıa
Gonzalez*
Characterising circular-arc contact B0–VPG graphs
16:25-16:45 Eranda Cela and Elisabeth Gaar*
On the relationship of k-bend and monotonic l-bend edge
intersection graphs of paths on a grid
16:50-17:35 Meirav Zehavi (invited talk)
Parameterized analysis, graph minors and planar disjoint paths
Session C Monday Morning 11:00-13:00 June 8, 2020
11:00-11:45 Ignasi Sau (invited talk)
FPT algorithms for hitting forbidden minors
11:50-12:10 Amir Abboud, Shon Feller* and Oren Weimann
On the fine-grained complexity of parity problems
12:15-12:35 Yuval Emek, Shay Kutten, Mordechai Shalom* and Shmuel Zaks
Multicast communications in tree networks with heterogeneous
capacity constraints
12:40-13:00 Ioana Bercea* and Guy Even
Upper tail analysis of bucket sort and random tries
Session D Monday Afternoon 16:00-17:10 June 8, 2020
16:00-16:20 Michal Stern *, Nili Guttmann-Beck and Sayag Hadas
Vertices removal for feasibility of CTSP
16:25-16:45 Jordan Barrett, Salomon Bendayan*, Yanjia Li, and Bruce Reed
Partitioning into prescribed number of cycles and mod k t-join
with slack
16:50-17:10 Diptapriyo Majumdar*, Rian Neogi Venkatesh Raman, and S.
Vaishali
Tractability of K¨onig edge deletion problems
Registration: free but mandatory
Please visit: <http://www.cri.haifa.ac.il>*
20th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics and Algorithms
June 7-8, 2020* (Sunday – Monday)
11:00-13:00 and 16:00-17:30 Israel time*
(Sydney: +7h; Paris: -1h, London: -2h, Rio: -6h, New York: -7h, L.A.: -10h)
Sponsored by University of Haifa, Caesarea Rothschild Institute
3 INVITED SPEAKERS
Ignasi Sau (LIRMM, University of Montpellier, France)
Shakhar Smorodinsky (Ben Gurion University, Israel)
Meirav Zehavi (Ben Gurion University, Israel)
11 CONTRIBUTED TALKS
See the schedule below
or the website <http://www.cri.haifa.ac.il>
-----------------------------------------------------------------
Registration is free but mandatory.
Zoom details will be sent before the workshop to those registered.
-----------------------------------------------------------------*
General Chair: Martin Charles Golumbic <golu...@cs.haifa.ac.il>
Program co-Chairs:* Nili Beck <beck...@mta.ac.il>
and Michal Stern <st...@mta.ac.il>
Publicity and Abstracts Chair: Abhiruk Lahiri <abh...@iisc.ac.in>
Organizing Chair: Tamir Gadot <tamir...@hotmail.com>
*-----------------------------------------------------------------*
Session A Sunday Morning 11:00-13:00 June 7, 2020
11:00-11:45 Shakhar Smorodinsky (invited talk)
An extension of the notion of a median
11:50-12:10 Konrad K. Dabrowski, Tomáš Masařík, Jana Novotná*, Daniël
Paulusma and Paweł Rzążewsk
Clique-Width: Harnessing the power of atoms
12:15-12:35 O. Herscovici, J.A. Makowsky*, and V. Rakita
Harary polynomials
12:40-13:00 Fiona Skerman*, Michael Albert, Cecilia Holmgren and Tony
Johansson
Permutations in binary trees and random trees
Session B Sunday Afternoon 16:00-17:35 June 7, 2020
16:00-16:20 Flavia Bonomo-Braberman, Esther Galby, and Carolina Luc´ıa
Gonzalez*
Characterising circular-arc contact B0–VPG graphs
16:25-16:45 Eranda Cela and Elisabeth Gaar*
On the relationship of k-bend and monotonic l-bend edge
intersection graphs of paths on a grid
16:50-17:35 Meirav Zehavi (invited talk)
Parameterized analysis, graph minors and planar disjoint paths
Session C Monday Morning 11:00-13:00 June 8, 2020
11:00-11:45 Ignasi Sau (invited talk)
FPT algorithms for hitting forbidden minors
11:50-12:10 Amir Abboud, Shon Feller* and Oren Weimann
On the fine-grained complexity of parity problems
12:15-12:35 Yuval Emek, Shay Kutten, Mordechai Shalom* and Shmuel Zaks
Multicast communications in tree networks with heterogeneous
capacity constraints
12:40-13:00 Ioana Bercea* and Guy Even
Upper tail analysis of bucket sort and random tries
Session D Monday Afternoon 16:00-17:10 June 8, 2020
16:00-16:20 Michal Stern *, Nili Guttmann-Beck and Sayag Hadas
Vertices removal for feasibility of CTSP
16:25-16:45 Jordan Barrett, Salomon Bendayan*, Yanjia Li, and Bruce Reed
Partitioning into prescribed number of cycles and mod k t-join
with slack
16:50-17:10 Diptapriyo Majumdar*, Rian Neogi Venkatesh Raman, and S.
Vaishali
Tractability of K¨onig edge deletion problems
Reply all
Reply to author
Forward
0 new messages