Presentations
Here is a list of some presentations I gave. As I only recently decided to maintain this list and couldn't find all slides this list is unfortunately far from exhaustive. Feel free to use parts of my presentations in your own, but if you use very authentic parts, I'd appreciate an acknowledgement.
| Year | Venue | Name | Link | Notes |
|---|---|---|---|---|
| 2022 | Advances in Parameterized Graph Algorithms, Calp | Tight bounds for counting colorings and connected edge sets parameterized by cutwidth | slides(pdf) | |
| 2021 | HIM workshop on approximation and relaxation, Bonn | Bipartite TSP in O(1.9999^n) Time, Assuming Quadratic Time Matrix Multiplication | slides(pptx) | |
| IISc MSR Seminar Series (online) | Improved (exponential time) algorithms: A case study for Subset Sum and Bin | slides(pptx) | ||
| UU weekly seminar (online) | A Matrix and Online and Parameterized Algorithms | slides(pptx) | ||
| 2020 | UU weekly seminar (online) | A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins | slides(pptx) | |
| STOC 2020 (online) | Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time | slides(pptx) | Youtube | |
| STOC 2020 (online) | Bipartite TSP in O(1.9999^n) Time, Assuming Quadratic Time Matrix Multiplication | slides(pptx) | Youtube | |
| Aalto CS Theory Seminar (online) | Bipartite TSP in O(1.9999^n) Time, Assuming Quadratic Time Matrix Multiplication | slides(pptx) | ||
| Frontiers of Parameterized Complexity seminar (online) | Bipartite TSP in O(1.9999^n) Time, Assuming Quadratic Time Matrix Multiplication | slides(pptx) | https://frontpc.blogspot.com/, Youtube | |
| UU weekly seminar (online) | Detecting Feedback Vertex Sets of size k in O*(2.7^k) Time | slides(pptx) | ||
| UU Departmental Seminar | On the worst-case complexity of the Traveling Salesman Problem | unpublished work; no slides available | ||
| 2019 | NETWORKS Training Week 8 | Algebraic Graph Algorithms - Part 3 | slides(pptx) | |
| NETWORKS Training Week 8 | Algebraic Graph Algorithms - Part 2 | slides(pptx) | ||
| NETWORKS Training Week 8 | Algebraic Graph Algorithms - Part 1 | slides(pptx) | ||
| CWI N&O seminar | On the worst-case complexity of the Traveling Salesman Problem | unpublished work; no slides available | ||
| CANADAM | Subset Sum (and related problems) | slides(pptx) | ||
| NETWORKS training week 8 | Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time | slides(pptx) | ||
| Utrecht University | Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time | slides(pptx) | ||
| Karpacz retreat Warsaw algorithms group (Poland) | Subset Sum (and related problems) | slides(pptx) | ||
| Eindhoven CO seminar | Treewidth meets Planarity | slides(pptx) | ||
| Dagstuhl | New Algorithms for Planar Subgraph Isomorphism | slides(pptx) | ||
| SODA | Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces | slides(pptx) | ||
| 2018 | NWO - JSPS workshop | Understanding the algorithmic value of graph decompositions via matrix rank (a survey) | slides(pptx) | |
| STOC POSTER | More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture | poster(pdf) | ||
| HALG 2018 poster | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | poster(pdf) | ||
| HALG 2018 | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | slides(pptx) | ||
| NETWORKS training week 6 | More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture | slides(pptx) | ||
| TACO 2018 | A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | slides(pptx) | ||
| 2017 | NETWORKS training week 5 | Using graph decompositions algorithmically via matrix rank | unpublished work; no slides available | |
| STOC POSTER | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | poster(pdf) | STOC | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | slides(pptx) |
| CWI | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | slides(pptx) | ||
| MPI | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | slides(pptx) | ||
| Dagstuhl | Exponential Time Paradigms Through the Polynomial Time Lens | slides(pptx) | ||
| Dagstuhl | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | slides(pptx) | ||
| 2016 | Simons Reunion | Faster Space Efficient Algorithms for Subset Sum k-Sum and related problems | slides(pptx) | |
| ESA | Finding Large Set Covers Faster via the Representation Method | slides(pptx) | ||
| ESA | Exponential Time Paradigms Through the Polynomial Time Lens | slides(pptx) | ||
| ISIT | Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs | slides(pptx) | ||
| 2015 | Workshop `Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms' at Simons Institute | Dense Subset Sum May be the Hardest | slides(pptx) | |
| STACS | Solving Subset Sum in the absence of concentration | slides(pptx) | Click here for video | |
| TACO | Subexponential time algorithms and lower bounds for finding path and tree decompositions with few bags | slides(pptx) | ||
| 2013 | TACO | Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. | slides(pptx) | |
| STOC | Fast Hamiltonicity Checking via Bases of Perfect Matchings | slides(pptx) | ||
| 2012 | CCC | On Problems as Hard as CNF-Sat | slides(pptx) | |
| IPEC | Homomorphic Hashing for Sparse Coefficient Extraction | slides(pptx) | ||
| 2011 | PhD defense UiB | Space and Time Efficient Structural Improvements of Dynamic Programming Algorithms | slides(pptx) | Pictures by Pinar Heggernes |
| Trial lecture UiB | Property Testing (a.k.a. Sublinear Algorithms ) | slides(pptx) | ||
| Dagstuhl seminar `Exploiting graph structure to cope with hard problems' | Solving Connectivity problem parameterized by treewidth in single exponential time | slides(ppsx) | Check out the last comment before `Thanks for listening'! | |
| 2010 | STOC | Saving Space by Algebraization | slides(pdf) | |
| WG | Recognizing (p,q)-cluster graphs | slides(pdf) | ||
| WG | Computing the cutwidth of bipartite permutation graphs in linear time | slides(pdf) | ||
| AGT seminar UiB | The inefficiency of equilibria 1 | slides(pdf) | ||
| AGT seminar UiB | The inefficiency of equilibria 2 | slides(pdf) | ||
| 2009 | ICALP | Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner Tree and related problems | slides(pdf) | |
| 2007 | Graph drawing course UU | Shortest paths | slides(pdf) | |
| Graph drawing course UU | Shortest paths 2 | slides(pdf) |