CompSci 269S, Fall 2017: Theory Seminar

The Theory Group normally meets Fridays at 1:00pm; this quarter we are in DBH 1300.

Below is this quarter's schedule.

Oct 6:

Timothy Johnson

Talk title: Low Ply Drawings of Outerplanar Graphs

 

Oct 13:

Amelia Regan

Talk title: An attractive alternative to traditional auctions for spot markets -- formulations, heuristics, algorithms and more theoretical extensions

 

Oct 20:

Nil Mamano

Talk title: The combinatorial complexity of stable-matching Voronoi diagrams

--

Grady Yu

Talk title: How Hard is Mini Metro?

 

Oct 27:

Nodari Sitchinava

Talk title: Sorting in the Asymmetric External Memory model

 

Nov 3:

Daniel Lokshtanov

Talk title: Exact Algorithms via Monotone Local Search

 

Nov 17:

Elham Havvaei

Talk title: All maximal independent sets and dynamic dominance for sparse graphs

---

Jordan Jorgensen

Talk title: A Geometric Approach to Fingerprint Matching: Oriented Point-Set Pattern Matching

 

Dec 1:

Pedro Matias

Talk title: Algorithms for Speed Scaling

---

Koosha Azartash

Talk title: Balanced Line Separators of Unit Disk Graphs

 

Dec 8:

Juan Jose Besa Vial

Talk title: Quadratic Time Algorithms Appear to Be Optimal for Sorting Evolving Data

 

Previous quarters' theory seminars