Our group runs an open seminar on all topics related to theoretical computer science and practical algorithms.
2022 Semester 2 (Tuesday 11:00am via zoom)
- 9. Aug: David Wajc – Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
- 16. Aug: Kheeran Naidu – Space Optimal Vertex Cover in Dynamic Streams (with an overview of graph streaming)
- 30. Aug: Noam Touitou – Online Network Design Problems with Deadlines/Delay
- 13. Sep: Alex Bie – Private Estimation with Public Data
- 20. Sep: Aleksandar (Sasho) Nikolov – Private Query Release via the Johnson-Lindenstrauss Transform
- 4. Oct: Arindam Pal – New algorithms for graph compression and their applications to real-world problems
- 11. Oct: Chay Machluf – Competitive Vertex Recoloring
- 18 Oct: Maike Buchin – Realizability of Free Space Diagrams
- 25. Oct: Santhoshini Velusamy – Approximating CSPs in the streaming setting
- 22. Nov: Joseph Lizier – Enabling tools to model information processing in brains
2022 Semester 1 (Tuesday 11:00am via zoom)
2021 Semester 2 (Tuesday 11:00am via zoom)
- 03. Aug: Yuan – Algorithms for Radius-Optimally Augmenting Trees in a Metric Space (in WADS21)
- 07. Sep: Avi Wigderson (via) – The Value of Errors in Proofs – a fascinating journey from Turing’s seminal 1936 R ≠ RE to the 2020 breakthrough of MIP* = RE
- 05. Nov: Makrand Sinha – Online Vector Balancing and Geometric Discrepancy (Fr 1pm)
- 09. Nov: John – Novel Data Structures for Advanced Computational Movement Analysis
- 07. Dec: Thomas Ahle – Sketching Tensors with Structured Random Matrices
- 15. Dec: Jordan Ellenberg (via) – Upper Bounds for Rational Points
2021 Semester 1 (Tuesday 11:00am via zoom)
2020 Semester 2 – Seminar series (Tuesday 11:00am)
- 08. Sep:
Yucheng Sun: The Stretch Factor of Delaunay Triangulations Using an Arbitrary Rectangle
Tom Schwarz: The Online Bidding Problem
- 15. Sep:
Finn Waugh: Online Bipartite Matching with Reassignments
Qiao Hu and Hanin Zenah: Robust Geometric Map Matching using Shortest Paths
- 22. Sep: Milutin – canceled
- 29. Sep: Julian – The Ad Types Problem
- 06. Oct: Mid-semester break
- 13. Oct: William – Anupam Gupta: A Survey on chasing convex bodies
- 20. Oct: Milutin – (𝑘, ℓ)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
- 27. Oct: Sampson – Improving the dilation of a metric graph by adding edges
- 03. Nov: Patrick – Recency and Frequency in Data Streams
- 10. Nov: Yuan – Graph augmentation while minimizing the radius
2020 Semester 1 – Seminar series (Tuesday 11:00am, room 124)
- 03. Mar, Talk:
Abdallah Saffidine – Peer Reviewing in Participatory Guarantee Systems: Modelisation and Algorithmic Aspects (in AAMAS’20)
- Wed. 11. Mar 1:00pm, room 459 Talk:
Naveen Garg – Half-integral Duals, Connectivity Augmentation and Multiflows in Planar Graphs
- Virus Break…
- 05. May, Talk: John – Human Action Recognition
- 12. May, Talk: Joachim – On beta-plurality points in spatial voting games
- 19. May, Talk: Martin – A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions
- break: STUVAC
- 16. June, Talk: Sampson – An Exact Algorithm for the Average Frechet Distance in One Dimension
- 23. June, Talk: Frank Staals and André van Renssen – Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
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 – Fast Community Extraction Based on Distance Dynamics Model
- 15. Oct, Talk: Yuan – Approximating the Fréchet Distance for Realistic Curves in Near Linear Time ** room 459 **
- 22. Oct, Talk: Sampson – Covering a Trajectory with Few Squares
- 29. Oct, Talk: Mohammad Polash – Mixed Neighbourhood Local Search for Customer Order Scheduling Problem
- 05. Nov, Talk: Patrick – Preprocessing Ambiguous Imprecise Points
- break: STUVAC
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 T. Fineman – 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 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
Like this:
Like Loading...
Comments are closed.