The Application of Novel Technology in Cultural Heritage Graph Theory, Combinatorics and Algorithms The Application of Novel Technology in Cultural Heritage Graph Theory, Combinatorics and Algorithms Weekly CRI Seminar The Application of Novel Technology in Cultural Heritage Graph Theory, Combinatorics and Algorithms

17th Haifa Workshop on Interdisciplinary

Applications of Graphs, Combinatorics and Algorithms

Monday-Thursday, June 5-8, 2017

Room 570, 5th Floor,

Education Building


Registration ~~~  Book of Abstracts ~~~  Accepted Contributed Talks 

Final Schedule (PDF)


  Monday, 5 June 2017

09:00 - 09:30 Gathering and greetings
09:30 - 10:30 Coloring and stability in classes of graphs defined by forbidden subgraphs Frederic Maffray
10:30 - 10:45 Coffee break
10:45 - 11:10 Conflict-Free Coloring of Intersection Graphs of Geometric Objects Chaya Keller
11:10 - 11:35 Polychromatic Coloring of Axis-Parallel Strips Alexandre Rok
11:35 - 12:00 On the Price of Anarchy in Non-Monochromatic and Conflict-Free Hypergraph Coloring Games Shakhar Smorodinskyy
12:00 - 12:25 Positional Games on Vertex Sets of Random Graphs Adva Mond
12:25 - 12:50 Twins in Subdivision Drawings of Hypergraphs Manuel Sorge
12:50 - 14:00 Lunch break
14:00 - 15:00 Restricted Types of Matchings Dieter Rautenbach
15:00 - 15:15 Coffee break
15:15 - 15:40 Enumerating all Minimum Clique Covers in Indifference Graphs with Applications to Transportation Science Irith Ben-Arroyo Hartman
15:40 - 16:05 A Refined Version of the Roller Coaster Conjecture Vadim E. Levit
16:05 - 16:30 Efficiently Enumerating Minimal Triangulations Batya Kenig
16:30 - 16:55 Inverses of Graphs and Reciprocal Eigenvalue Properties Swarup Panda
16:45 - 17:10 Optimal Threshold for a Random Graph to be 2-Universal Gal Kronenberg
17:10 - 17:30 Coffee break
17:30 - 18:30 Constrained Recognition Problems on Geometric Graph Classes Steve Chaplick

Tuesday, 6 June 2017

09:00 - 09:30 Gathering and greetings
09:30 - 10:30 Results on variants of the Majority problem. Myriam Preissmann
10:30 - 10:45 Coffee break
10:45 - 11:10 A Polynomial-time Algorithm for the Maximum Cardinality Cut Problem in Proper Interval Graphs Mordechai Shalom
11:10 - 11:35 Maximum Number of Edges in Claw-Free Graphs whose Maximum Degree and Matching Number are Bounded Tinaz Ekim
11:35 - 12:00 Generating Subgraphs in Chordal Graphs David Tankus
12:00 - 12:25 Dependence Graph Model for Seamless Routes Replacement in SDN Daniel Khankin
12:25 - 14:00 Lunch break
14:00 - 15:00 The 8th Uri Natan Peled Memorial Lecture On Edge Intersection Graphs of Paths in a Grid Bernard Ries and presentation of the 2017 Uri Natan Peled Memorial Awards
15:00 - 15:15 Coffee break
15:15 - 15:40 Optimal Distance Labeling Schemes for Trees Ofer Freedman
15:40 - 16:05 Constant Threshold Intersection Graphs of Orthodox Paths in Trees Jayme Luiz Szwarcfiter
16:05 - 16:30 Dispersion on Trees Nadav Krasnopolsky
16:30 - 16:55 Violator Spaces vs Closure Spaces Yulia Kempner
16:55 - 17:30 Coffee break
17:30 - 18:30 Directed hypergraphs Gyorgy Turan


Wednesday, 7 June 2017 and Thursday, 8 June 2017

Individual Research Group meetings (all day)
Invited Lectures:
Ilan is 60 A conference in honor of Prof. Ilan Newman's 60th birthday
For updates, please visit: http://cs.haifa.ac.il/~yuri/Ilan60/program.html

June 7 Speaker Title

10:00-10:10 Greetings
10:10-10:50 Harry Buhrman, CWI Inverse Newman's Theorems
10:50-11:30 Michael Elkin, BGU Hopsets with Constant Hopbound
11:30-12:00 Coffee Break
12:00-12:40 Noam Nisan, HUJI TBA
12:40-13:20 Yuval Rabani, HUJI TBA
13:20-14:30 Lunch
14:30-15:20 Hagit Attiya, Technion Fences and RMRs Required for Synchronization
15:20-16:00 Nati Linial, HUJI Hypertrees
16:00-16:30 Coffee Break
16:30-17:20 Alex Samorodnitsky, HUJI TBA
18:30 Conference Dinner

June 8 Speaker Title

10:00-10:40 Noga Alon, TAU Graph Coloring: Local and Global
10:40-11:20 Ilan Newman, Haifa University TBA
11:20-11:50 Coffee Break
11:50-12:30 Mario Szegedy, Rutgers TBA
12:30-13:10 Michael Krivelevich, TAU Finding and Using Expanders in Locally Sparse Graphs
13:10-14:30 Lunch
14:30-15:10 Yishay Mansour, TAU TBA
15:10-15:50 Oded Lachish, Birkbeck Trading Query Complexity for Sample-Based and Multi-Testing Scalability
15:50-16:20 Coffee Break
16:20-17:00 Eldar Fishcer, Technion TBA