Computational Geometry Seminar

2016/2017

Wednesdays 16:10 - 18:00

Schreiber 309

Seminar

Date	Speaker & Affiliation	Title Of Talk
02.11.16	Paul Seiferth, FU Berlin	Routing in unit disk graphs
09.11.16	Sariel Har-Peled, UIUC	Proximity in the age of distraction: Robust approximate nearest neighbor search
16.11.16	Omer Gold, TAU	New bounds and relations for some basic geometric problems
23.11.16	Gershon Elber, The Technion	Contacts
07.12.16	Michal Kleinbort, TAU	Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
14.12.16	Kiril Solovey, TAU	Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching
21.12.16	Adam Sheffer, CalTech	Reductions for Distinct Distances Problems in R^d
28.12.16	Esther Ezra, Georgia Tech	A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
04.01.17	Elisha Sacks, Purdue University	Solid Modelling for VLSI Design
11.01.17	Boris Aronov, New York University	Breaking depth-order cycles and other adventures in 3D
18.01.17	Efi Fogel, TAU	GIT primer
25.01.17	Tal Wagner, MIT	Near-optimal (Euclidean) metric compression

08.02.17	Pankaj K. Agarwal, Duke University	Efficient Algorithms for Computing Transportation Maps

15.03.17	Leonardo Martinez, BGU	Depth with respect to a family of convex sets
22.03.17	Henny Admony, CMU	Toward Natural Human-Robot Collaboration
29.03.17	Laszlo Kozma, TAU	Maximum Scatter TSP in doubling metrics
05.04.17	Uri Grupel, Weizmann	Random Sampling and the Vector in Subspace Problem
12.04.17	Passover, no seminar
03.05.17	Dan Halperin, TAU	Minkowski Sums of Polyhedra with Holes
10.05.17	Micha Sharir, TAU	On Danzer's four points theorem
17.05.17	Aviel Atias, TAU	Effective Metrics for Multi-Robot Motion Planning
24.05.17	Nitzan Weissman, TAU	The planar separator strikes back: exact, approximate and quasi polynomial algorithms
31.05.17	SHAVU'OT, no seminar
14.06.17	Chaya Keller, BGU	Conflict-Free Coloring of Intersection Graphs of Geometric Objects
21.06.17	Shay Mozes, IDC	Voronoi diagrams, diameter and distance oracles for planar graphs
19.07.17	Noam Solomon, TAU	Incidences & Co. (a love story between discrete objects)
16.08.17	Micha Sharir, TAU	Near optimal algorithms in the linear decision tree model for k-SUM and related problems: The Kane-Lovett-Moran paper [slides]

Link for 2016 Spring : Computational Geometry Seminar

Dan Halperin
Gilit Zohar Oren

Sections

Personal tools

Computational Geometry Seminar

2016/2017

Wednesdays 16:10 - 18:00

Schreiber 309

Seminar

Document Actions