>
Seminar

Our group runs an open seminar on all topics related to theoretical computer science and practical algorithms.

2019 Semester 2 – Seminar series (Tuesday 11:00am, room 124)

  • 06. Aug, Talk: William – Tight Bounds for Online Weighted Tree Augmentation
  • 13. Aug, Talk: Mitchell Jones – On Locality-Sensitive Orderings and Their Applications
  • 27. Aug, Problem: Martin – Deterministic Rank Approximation ** room 459 **
  • 03. Sep, Talk: Kazuo Iwama – Narrowing Small Complexity Gaps
  • 17. Sep, Problem: Sasha – The Computational Complexity of Solving Games on Graphs
  • 24. Sep, Talk: André – Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
  • break: Mid-semester
  • 08. Oct, Talk: Maram – TBA
  • 15. Oct, Talk: Yuan – TBA ** room 459 **
  • 22. Oct, TBD: Sampson – TBA
  • 29. Oct, TBD: Milutin – TBA
  • 05. Nov, Talk: Patrick – Preprocessing Ambiguous Imprecise Points
  • break: STUVAC
  • 19. Nov,
  • 26. Nov,

2019 Semester 1 – Seminar series (Tuesday morning)

  • 19. + 26. Feb, 10:00am, 124: Martin – Algorithm Engineering in Geometric Problems
  • 5. Mar, 9:30am, 124: Zeinab – Data Structures For Frechet Distance Queries in Trajectory Data
  • 12. Mar, 11:00am, 459: Sampson – Hotspot Computation
  • 19. Mar, 10:00am, 124: André – Diameter and Center in Simple Polygons and Polygonal Domains
  • 26. Mar, 10:00am, 124: Patrick – Optimal Shortest Path Queries in a Simple Polygon
  • 2. Apr, 10:00am, 124: Milutin – Low Diameter Geometric Spanners
  • 9. Apr, 11:00am, 124: Jeremy – I/O-Efficient Topological Sort
  • 16. Apr, 10:00am, 124: Ágnes Cseh – Pairwise Preferences in the Stable Marriage Problem
  • break: STUVAC
  • break: SECW 2019
  • 14. May, 10:00am, 459: John – Complex Movement Classification
  • 21. May, 10:00am, 124: Jonathan – Discrete Algorithms for Geometric Topology
  • 19. June, 10:00am, 124: Max – Online Spanning Trees

2018 Semester 2 – Seminar series (11:00am, room 124)

  • Tue 04 Sept 2018: André – Limited Memory Algorithms
  • Tue 11 Sept 2018: Joachim – Geodesic spanners for points on a polyhedral terrain
  • Tue 18 Sept 2018: William – Online network design algorithms via hierarchical decompositions
  • Tue 25 Sept 2018: Break
  • Tue 02 Oct 2018: Sampson – Ray Shooting and Parametric Search
  • Tue 09 Oct 2018: Lijun – Cohesive Subgraph Computation over Large Sparse Graphs
  • Tue 16 Oct 2018: Julian – Precedence-Constrained Min Sum Set Cover
  • Tue 23 Oct 2018: Patrick – Semi-algebraic Range Searching (and Monkeys)
  • Tue 30 Oct 2018: John – Hyper-Vector Computing
  • Tue 06 Nov 2018: STUVAC
  • Tue 13 Nov 2018: Maram – Efficient Maximum Independent Set Discovery in Massive Graphs
  • Tue 20 Nov 2018: Jorrick – Map construction
  • Tue 27 Nov 2018: Vikrant – Efficiently Navigating a Bounded Degree and Light Planar Spanner Without a Map
  • Tue 04 Dec 2018: Jonathan – Optimally Locating a New Candidate in Spatial and Valence Models of Voting Games
  • Tue 11 Dec 2018: Haris – Fair Allocation of Indivisible Goods and Chores

2018 Semester 1 – Seminar series (2:00pm, room 459)

  • Wed 14 Mar 2018: William – Multiway cuts
  • Wed 21 Mar 2018: Patrick Eades – Robust Yao Graphs for Uncertain Points
  • Wed 28 Mar 2018: Sampson – Parametric search
  • Wed 11 Apr 2018: Lexi – Ethereum blockchains
  • Wed 18 Apr 2018: Patrick Nappa – Hashing
  • Wed 02 May 2018: Lexi – Static program analysis
  • Wed 09 May 2018: Vikrant – Communication complexity
  • Wed 16 May 2018: Patrick Nappa – Concurrent data structures
  • Wed 23 May 2018: Vikrant – Probabilistic method
  • Wed 30 May 2018: John – Approximate trajecory queries
  • Wed 06 Jun 2018:
    • 14:00-15:00 Lijun Chang: Graph Research in Database and Data Mining
    • 15:00-16:00 Michael Horton: Approximating (k,l)-center clustering for curves

Comments are closed.

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 75 other followers

%d bloggers like this: