Combinatorics and Algorithms
June 20-22, 2023 -- Registration is open
Tuesday June 20, 2023
Mt. Carmel Campus,, Univ. of Haifa,
570 Education Building
Thursday June 22, 2023
(*new*) City Campus, Univ. of Haifa
508 Amir Building
Rehov HaNamal 65 -- a 3 minute walk! from Haifa–HaShmona train station
You are invited to attend --
Please register and bring your students and colleagues.
Best wishes, Marty Golumbic
==============================
2023 Haifa Workshop on Interdisciplinary Applications of Graphs,
Combinatorics and Algorithms*
sponsored by
the Caesarea Rothschild Institute at the University of Haifa
*Tuesday June 20, 2023 Mt. Carmel Campus, 570 Education Building *
* 9:30 Registration and coffee
*10:00 Martin Golumbic *(University of Haifa, Israel)
Welcome greetings
*10:05 Boris Bychkov* (University of Haifa, Israel)
Electrical networks and Lagrangian Grassmannians
*10:30 S. Venkitesh *(University of Haifa, Israel)
On vanishing properties of polynomials over the
Boolean cube, and applications
*10:55 Dalu Jacob* (Indian Institute of Science, Bengaluru, India)
New bounds on the anti-Ramsey numbers of star graphs
*11:20 *Coffee break*
*11:40 Seunghun Lee (Hebrew University, Israel)
Transversals and colorings of geometric hypergraphs:
simplicial spheres and hypergraphs embeddable into R^d
*12:05* *Ron Adin *(Bar-Ilan University, Israel)
Gallai and transitive colorings: enumerative,
structural and algebraic aspects
*12:30* *Avichai Marmor (Bar-Ilan University, Israel)
Maximal Gallai colorings and perfect matchings
*13:00* *Lunch* (for those registered)
*14:00 Abraham Berman (Technion, Israel)*
14th Uri N. Peled Memorial Lecture*
Line perfect graphs, triangle-free graphs
and completely positive matrices
*15:15* *Elena Kreines* (Tel Aviv University, Israel)
From plain trees to matrix integrability
*15:40 Suleiman Hamud *(Technion, Israel)
A new construction of non-regular cospectral graphs
*16:05* *Coffee break*
*16:25* Pavel Shteyner* (Bar-Ilan University, Israel)
Matrix majorizations and graphs*
*16:50* Harmender Gahlawat* (Ben Gurion University)
On the cop number of string graphs 17:15 David Tankus* (Sami
Shamoon College of Engineering, Ashdod, Israel)
Shedding vertices and their recognition*
*17:45* *End of the day*
---------------
*Thursday June 22, 2023 City Campus !!! 508 Amir Building*
*Rehov HaNamal 65 (3 minute walk! from Haifa–HaShmona train station)
* 9:30 Registration and coffee*
*10:00 Martin Golumbic *(University of Haifa, Israel)
*Welcome greetings*
*10:10 Shmuel Onn* (Technion, Israel)
Degree sequence optimization and sparse integer programming
*10:35 Gyorgy Turan* (Univ. of Illinois, Chicago and Univ. of Szeged, Hungary)
On graph neural networks*
*11:00 Alain Hertz* (GERAD, Montreal, Canada)
*Decycling bipartite graphs*
*11:25 Coffee break*
*11:50* *Jayme Luiz Szwarcfiter* (Univ. Federal do Rio de Janeiro)
On edge domination of graphs*
*12:15 Mathew Francis* (Indian Statistical Institute, Chennai,India)
Variants of the Gyarfas-Sumner conjecture*
*13:00* *Lunch* (for those Registered)
*14:00 Michal Dory* (University of Haifa, Israel)
Approximate all-pairs shortest paths:
recent advances and open questions
*15:00* *Michal Stern *(Academic College of Tel Aviv, Yaffo, Israel)
Gaining feasibility of clustered trees on grid
intersection graphs by insertions*
*15:25 Shakhar Smorodinsky *(Ben Gurion University, Israel)
Conflict-free colouring of subsets*
*15:50* *Coffee break*
*16:10 Ilan Doron-Arad* (Technion, Israel)
Approximating bin packing with conflict graphs via
maximization techniques*
*16:35 Vincent Limouzy* (Université Clermont Auvergne, France)
Polynomial delay algorithm for minimal chordal completions
*17:00 Martin Golumbic *(University of Haifa, Israel)
Why are they called trivially perfect graphs?*
*17:30* *End of the day*
**********************************************************
*
* 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
