Research Seminar in Discrete and Computational Geometry

Matya Katz and Shakhar Smorodinsky

 

2009-10, Monday 12:15-13:45 (58/-101)


Schedule of talks:

2.11.2009

Panos Hilaris, BGU

Unique-maximum and conflict-free vertex colorings of graphs

 

9.11.2009

Paz Carmi, BGU

Several open problems concerning geometric networks

 

16.11.2009

Lena Yuditsky, BGU

Polychromatic coloring for geometric hypergraphs

 

30.11.2009

Rom Aschner, BGU

Properties of Symmetric Disk Graphs

 

8.3.2010

Karim Abu-Affash, BGU

Minimum power energy spanners  in wireless ad hoc networks

 

15.3.2010

Panos Hilaris and Lena Yuditsky, BGU

A non-linear lower bound for planar epsilon-nets

 

22.3.2010

Gila Morgenstern, BGU

A generic scheme for obtaining PTASs by simple local search

 

 


2008-9

8.12.2008

Shakhar Smorodinsky, BGU

A window to modern combinatorial geometry via epsilon-nets

 

15.12.2008

Matya Katz, BGU

Geometric set cover and discrete piercing of disks

 

22.12.2008

Zvi Lotker, BGU

SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks

 

29.12.2008

Adi Shraibman, Weizmann Institute

Lower bounds on the multiparty communication complexity of set intersection

 

5.1.2009 - postponed

Shay Solomon, BGU

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners

 

12.1.2009 - postponed

Boaz Ben-moshe, Ariel University Center

Compressing Geometric Images

 

19.1.2009

Natan Rubin, TAU

Line Transversals and Geometric Permutations

 

26.1.2009

Michael Elkin, BGU

Construction of Progression-Free Sets

 

2.2.2009

Rom Pinchasi, Technion

On some unrelated small results

 

9.2.2009

Micha Sharir, TAU

Improved bounds and new proofs for epsilon-nets

 

16.2.2009

Karim Abu-Affash, BGU

Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object

 

23.2.2009

Shay Solomon, BGU

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners

 

20.4.2009

Dror Aiger, BGU

Point Pattern Matching – Theory and Practice

 

27.4.2009

Boaz Ben-moshe, Ariel University Center

Compressing Geometric Images

 

4.5.2009

Oded Schwartz, TU Berlin

Colorful Strips

 

11.5.2009

Elad Horev, BGU

Structure and size of graphs without a semi-topological wheel

 

18.5.2009

Open problem session

 

25.5.2009

Hanan Shpungin, BGU

Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks

 

1.6.2009

Roi Krakovski, BGU

Topological Minors in Line Graphs

 

15.6.2009, 17.6.2009, 22.6.2009, 24.6.2009

Joe Mitchell, Stony Brook U. – Mini course on geometric optimization

 

29.6.2009

Adam Sheffer, TAU

Maximal Numbers of Various Types of Non-Crossing Graphs

 

6.7.2009

Gila Morgenstern, BGU

A Scheme for Computing Minimum Covers within Simple Regions

 

13.7.2009

Eric Berberich (TAU and MPI Saarbrücken)

Algebraic Curves and Surfaces, Arrangements, and Applications (in CGAL)