Graph Theory, Computational Intelligence

Sept. 25, 2008- University of Haifa

Time

Thursday

  How to get there

 

Room 570

Room 566

9:00- 9:30

Mark Korenblit
(Holon Institute of Technology, Israel)
A Note on the Recognition of Nested Graphs

Shmuel Gal
(University of Haifa)
A Simple Strategy for Searching Networks

9:30- 10:00

Alon Itai
(Technion - Israel Institute of Technology)
Covering a Tree by a Forest

Shaul Markovitch
(Technion - Israel Institute of Technology)
Automatic Generation of Semantic Knowledge Using Wikipedia and Other Large-Scale Web Repositories

10:00-10:30

Gadi Moran 
(University of Haifa)
What is the Genus of this Surface?

Haim Kaplan (Tel Aviv University)
Effective Sampling from Large Data Sets

10:30-11:00

György Turán
(U.Illinois at Chicago and Hungarian Academy)
Combinatorial Problems for Horn clauses

David Bernstein
(IBM-Haifa Research Labs) 
Software Enablement for Multicore Architectures

11:00-11:30

Coffee Break

11:30-12:00

Yonatan Aumann
(Bar-Ilan University)
Fixed Structure Complexity

Eli Shamir (Hebrew University)
Design of mutually -orthogonal binary valued square matrices {M.O.B.S}

12:00-12:20

Shimon Shrem 
(University of Haifa)
Edge-Paths and Shortcuts for Detecting an Odd Hole

Steve Tanny
(University of Toronto)
Conolly-Like Nested Recursions and Counting Leaves in Infinite Trees

12:20-12:50

Gregory Gutin
(University of London)
Out-Branchings with Extremal Number of Leaves

Shmuel (Tomi) Klein
(Bar-Ilan University)
On the Usefulnes of Fibonacci Compression Codes

12:50-14:00

Lunch Break

 

14:00-14:30

Tom Trotter (Georgia Institute of Technology)
First Fit Coloring of Interval Graphs

14:30-15:00

Ron Y. Pinter (Technion – Israel Institute of Technology)
Local Properties of Biological Networks

15:00-15:30

Ronen Feldman (Hebrew University)
Utilizing Text Mining for Marketing and Accounting Applications

15:30-15:50

Coffee Break

15:50-16:20

Craig Gotsman (Technion - Israel Institute of Technology)
Greedy Routing on Embedded Graphs

16:20-17:00

Ann Trenk (Wellesley College)
The Distinguishing Chromatic Number

17:00

Refreshments

17:30

Martin Golumbic
Landmarks in Algorithmic Graph Theory: a Personal Retrospective

19:00-22:30

Festive Dinner