DIMAP Seminar archive
Previous DIMAP seminar talks.
| Date | Speaker | Affiliation | Talk title |
|---|---|---|---|
| 29 Jun 2026 | Amin Coja-Oghlan | TU Dortmund University | The random XORSAT decimation process |
| 25 Jun 2026 | Michael Wehar | Bryn Mawr College | Efficient Algorithms for the Four Corners Problem with Connections to Computer Graphics |
| 15 Jun 2026 | Radek Piórkowski | University of Warwick | An MSO logic for register automata |
| 08 Jun 2026 | Marin Ricros | The Max Planck Institute for Software Systems | Constructing small monadic decompositions in Presburger Arithmetic |
| 12 May 2026 | Alessio Mansutti | IMDEA Software Institute | Existential Presburger Arithmetic with Divisibility Constraints: A tour |
| 16 Mar 2026 | Pascal Baumann | The Max Planck Institute for Software Systems | Verification of DCPS with Bounded Context-Switching |
| 09 Mar 2026 | Vihan Shah | University of Birmingham | Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries (SODA 2026) |
| 02 Mar 2026 | Lance Fortnow | Illinois Institute of Technology | Complexity in the Era of AI and Data-Driven Computing |
| 23 Feb 2026 | Luca Prigioniero | Loughborough University | Descriptional Complexity of Models for Regular Languages |
| 16 Feb 2026 | Richard Montgomery | University of Warwick | A proof of the Kim-Vu sandwich conjecture |
| 26 Jan 2026 | Søren Riis | Queen Mary University of London | Coin racing and waiting-time paradoxes: why fair coins are exceptional |
| 15 Dec 2025 | Daniel Grier | University of California, San Diego | Quantum Threshold is Powerful |
| 17 Nov 2025 | Brink van der Merwe | Stellenbosch University | From Evil to Efficient: Ten Years of Theoretical and Practical Insights into Regular Expression Matching |
| 10 Nov 2025 | Viresh Patel | Queen Mary, University of London | Zeros of the independence polynomial for structured graphs |
| 4 Nov 2025 | Yanlin Chen | University of Maryland | A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix |
| 27 Oct 2025 | Bruno Pasqualotto Cavalar | University of Oxford | Monotone Circuit Complexity of Matching |
| 13 Oct 2025 | Karolina Okrasa | University of Oxford | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa |
| 14 Jul 2025 | Boris Bukh | Carnegie Mellon University | Maximal sets of given diameter in Hamming spaces |
| 9 Jul 2025 | Rob van Stee | University of Siegen | Improved online load balancing with known makespan |
| 1 Jul 2025 | Ashutosh Trivedi | University of Colorado Boulder | Hyperproperties for Privacy, Fairness, and Legal Requirements |
| 16 Jun 2025 | Iddo Tzameret | Imperial College London | Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets |
| 12 Jun 2025 | Michail Fasoulakis | Royal Holloway, University of London | New Algorithms for Two-Player Zero-Sum Games: From Games to Optimization and Learning |
| 9 Jun 2025 | Parinya Chalermsook | University of Sheffield | Extremal Combinatorics Meets Algorithms and Data Structures |
| 22 May 2025 | Manoj Gupta | IIT Gandhinagar | Fault Tolerant Distance Oracle |
| 19 May 2025 | Rahul Savani | University of Liverpool | Monotone Contractions |
| 12 Mar 2025 | Jakub Łącki | Google Research | Scalable graph clustering |
| 10 Mar 2025 | Mark Jerrum | Queen Mary, University of London | Rapid mixing of Glauber dynamics at low temperature |
| 3 Mar 2025 | Sourav Chakraborty | Indian Statistical Institute Kolkata | Distinct Elements in Streams and the Klee's Measure Problem |
| 26 Feb 2025 | Patrick Totzke | University of Liverpool | Optimally Controlling a Random Population |
| 17 Feb 2025 | Tom Gur | University of Cambridge | A Zero-Knowledge PCP Theorem |
| 27 Jan 2025 | Gramoz Goranci | University of Vienna | Near-Optimal Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs |
| 13 Jan 2025 | Dan Kral | Masaryk University | Matroid depth and width parameters |
| 02 Dec 2024 | Andrew Ryzhikov | University of Oxford | How combinatorics stands in the way of matrix reachability (and what we can do about it) |
| 28 Nov 2024 | Joseph Slote | Caltech | Quantum circuit lower bounds and the role of structure in quantum advantage |
| 18 Nov 2024 | Robert Andrews | University of Waterloo | Constant-Depth Arithmetic Circuits for Linear Algebra Problems |
| 11 Nov 2024 | Oliver Korten | Columbia University | Strong vs. Weak Range Avoidance and the Linear Ordering Principle |
| 28 Oct 2024 | Laure Daviaud | University of East Anglia | Open problems for weighted automata, and why they are so difficult... |
| 14 Oct 2024 | Arnab Bhattacharya | National University of Singapore | Distribution Learning Meets Graph Structure Sampling |
| 12 Sep 2024 | Filip Mazowiecki | University of Warsaw | Soundness problems for workflow nets |
| 9 Sep 2024 | Philip Cervenjak | University of Melbourne | Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound |
| 6 Sep 2024 | Prantar Ghosh | Georgetown University, USA | Low-Memory Algorithms for Online Edge Coloring |
| 5 Sep 2024 | Uri Zwick | Tel Aviv University | Exact approximation ratios for some constraint satisfaction problems |
| 5 Sep 2024 | Rasmus Pagh | University of Copenhagen | Differentially Private Continual Counting |
| 14 Jun 2024 | Yonggang Jiang | Max Planck Institute for Informatics, Saarbrucken | Deterministic k-Vertex Connectivity in k Max-flows |
| 10 Jun 2024 | László Végh | London School of Economics | Approximating Nash Social Welfare by Matching and Local Search |
| 13 May 2024 | Noam Mazor | Tel Aviv University | The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity is False |
| 29 Apr 2024 | Neil Olver | London School of Economics | A strongly polynomial algorithm for linear programs with at most two non-zero entries per row or column |
| 19 Apr 2024 | Moni Naor | Weizmann Institute of Science | Adjacency Sketches in Adversarial Environments or "Adversaries, What Are They Good For?" |
| 11 Mar 2024 | Varun Kanade | University of Oxford | Partial Prediction and an application to Matrix Completion |
| 4 Mar 2024 | Etienne Boursier | INRIA Paris-Saclay | Training overparameterised networks: the early alignment phenomenon and its consequences |
| 26 Feb 2024 | Dimitris Achlioptas | University of Athens | The Lovász Local Lemma as Approximate Dynamic Programming |
| 5 Feb 2024 | Sagnik Mukhopadhyay | The University of Sheffield | Submodular Function Minimisation: How Hard Is It, Really? |
| 29 Jan 2024 | James Davies | University of Cambridge | Odd distances in colourings of the plane |
| 24 Jan 2024 | Yannic Maus | TU Graz | Recent Developments in Distributed Graph Coloring |
| 15 Jan 2024 | Marcin Bieńkowski | University of Wrocław | Online Facility Location with Linear Delay |
| 8 Jan 2024 | Dan Kral | Masaryk University | Matroid width parameters |
| 4 Dec 2023 | Sven Schewe | University of Liverpool | Automata for Profit and Pleasure |
| 13 Nov 2023 | Matthew Jenssen | King's College London | On the evolution of structure in triangle-free graphs |
| 30 Oct 2023 | Nikhil Mande | University of Liverpool | Randomized Versus Deterministic Decision Tree Size |
| 24 Oct 2023 | Marcus Michelen | University of Illinois, Chicago | Optimal mixing of the down-up walk on independent sets of a given size |
| 23 Oct 2023 | Joachim Spoerhase | University of Sheffield | Parameterized Approximation Schemes for Clustering with General Norm Objectives |
| 2 Oct 2023 | Matthew Bowen | University of Oxford | Monochromatic sums and products in N and Q |
| 26 June 2023 | Raghunath Tewari | IIT Kanpur | Green's Theorem and its Application to the Isolation Problem in Planar Graphs |
| 19 June 2023 | Oliver Janzer | University of Cambridge | On MaxCut and the Lovasz theta function |
| 12 June 2023 | Hanlin Ren | University of Oxford | Polynomial-Time Pseudodeterministic Construction of Primes |
| 6 June 2023 | Leszek Gasieniec | University of Liverpool | Selective Population Protocols |
| 15 May 2023 | Argyrios Deligkas | Royal Holloway University of London | Recent improvements on approximate equilibria in bimatrix games |
| 24 Apr 2023 | Tony Wirth | The University of Melbourne | Maximum Coverage in Sublinear Space, Faster |
| 13 Mar 2023 | Mahsa Shirmohammadi | IRIF, France | Stochastic games and strategy complexity |
| 6 Mar 2023 | Richard Montgomery | University of Warwick | Towards the Erdős-Gallai Cycle Decomposition Conjecture |
| 20 Feb 2023 | Mihyun Kang | TU Graz | Random subgraphs of the hypercube and high-dimensional product graphs |
| 13 Feb 2023 | Michael Benedikt | University of Oxford | Rewriting queries in theory |
| 6 Feb 2023 | David Ellis | University of Bristol | Hypercontractivity on compact Lie groups, and some applications |
| 30 Jan 2023 | Sayan Bhattacharya | University of Warwick | Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time |
| 26 Jan 2023 | Sebastian Ordyniak | University of Leeds | SAT Backdoors: Depth Beats Size |
| 17 Jan 2023 | Adi Shamir | Weizmann Institute of Science | Efficient Detection of High Probability Cryptanalytic Properties of Boolean Functions |
| 16 Jan 2023 | Jan Volec | Czech Technical University, Prague | The sixth Ramsey number is at most 147 |
| 9 Jan 2023 | Zhenyu Cai | University of Oxford | Towards low-cost quantum error correction |
| 5 Dec 2022 | Ron Lavi | University of Bath and Technion | Optimal Auctions for Correlated Private Values: Ex-Post vs. Ex-Interim Individual Rationality |
| 28 Nov 2022 | Eoin Long | University of Birmingham | Properties of graphs with small homogeneous numbers |
| 24 Nov 2022 | Weiming Feng | University of Edinburgh | An MCMC approach to the sampling Lovász local lemma |
| 21 Nov 2022 | Christian Ikenmeyer | University of Warwick | Geometric Complexity Theory |
| 8 Nov 2022 | Panagiotis Charalampopoulos | Birkbeck, University of London | On Edit Distance Oracles and Planar Distance Oracles |
| 31 Oct 2022 | Ian Mertz | How to Reuse Space | |
| 24 Oct 2022 | Johannes Carmesin | University of Birmingham | Local separators: from tree-decompositions to graph-decompositions |
| 17 Oct 2022 | Dan Kral | Masaryk University | Extremal problems concerning quasirandom structures |
| 10 Oct 2022 | Andreas Galanis | University of Oxford | Fast sampling via spectral independence beyond bounded-degree graphs |
| 26 Sep 2022 | Naveen Garg | IIT Delhi | Maximizing Nash Social Welfare when allocations are independent sets in a matroid |
| 14 Jul 2022 | Ruzica Piskac | Yale University | Efficient reasoning about multisets with cardinality constraints |
| 13 Jun 2022 | Martin Dyer | University of Leeds | Counting independent sets in graph classes |
| 6 Jun 2022 | Alantha Newman | Université Grenoble Alpes | Correlation Clustering |
| 30 May 2022 | Karol Wegrzycki | Max-Planck-Institut für Informatik | Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. |
| 23 May 2022 | Julia Wolf | University of Cambridge | Irregular triads in 3-uniform hypergraphs |
| 14 Mar 2022 | Paul Balister | University of Oxford | 1-independent percolation on $\mathbb{Z}^n$ |
| 7 Mar 2022 | Elias Koutsoupias | University of Oxford | On the Nisan-Ronen conjecture for graphs |
| 28 Feb 2022 | Bernard Lidický | Iowa State University | 11/4-colorability of subcubic triangle-free graphs |
| 21 Feb 2022 | Karoliina Lehtinen | CNRS, Aix-Marseille Université, LIS | History-determinism and quantitative synthesis |
| 14 Feb 2022 | Nick Spooner | University of Warwick | How to Rewind a Quantum Computer |
| 7 Feb 2022 | Kolja Knauer | Universtiy of Barcelona | sample COMpression |
| 31 Jan 2022 | Robert Johnson | Queen Mary University of London | Correlation for Permutations |
| 24 Jan 2022 | Sagnik Mukhopadhyay | The University of Sheffield | A(n almost) Universal Algorithm for Global Minimum Cut |
| 17 Jan 2022 | Mikołaj Bojańczyk | University of Warsaw | Logic and automata for transducers |
| 6 Dec 2021 | Bart Jansen | Eindhoven University of Technology | Vertex Deletion Parameterized by Elimination Distance and Even Less |
| 29 Nov 2021 | Lutz Warnke | Georgia Tech | The jump of the clique chromatic number of random graphs |
| 22 Nov 2021 | Stefan Felsner | TU Berlin | Combinatorics of Pseudocircle Arrangements |
| 15 Nov 2021 | Yoshiharu Kohayakawa | University of Sao Paulo | A tight lower bound for the online bounded space hypercube bin packing problem and bounds for a related game-theoretic problem |
| 8 Nov 2021 | Sophie Spirkl | University of Waterloo | New results for polynomial χ-boundedness |
| 1 Nov 2021 | Paul Duetting | Google Research, Zürich | An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions |
| 25 Oct 2021 | Vera Traub | ETH Zürich | Better-Than-2 Approximations for Weighted Tree Augmentation |
| 18 Oct 2021 | Jugal Garg | University of Illinois at Urbana-Champaign | Fair division of indivisible goods |
| 11 Oct 2021 | Jan Grebik | University of Warwick | Local problems on grids |
| 5 Oct 2021 | Pranabendu Misra | Chennai Mathematical Institute | An optimal approximation algorithm for Feedback Vertex Set in Tournaments |
| 28 Jun 2021 | Aaron Williams | Williams College | De Bruijn Sequence Constructions: Old and New |
| 22 Jun 2021 | Sayan Bhattacharya | University of Warwick | Deterministic Rounding of Dynamic Fractional Matchings |
| 21 Jun 2021 | Abdallah Saffidine | UNSW Sydney | A Computational Perspective on Fragments of the Dynamic Logic of Propositional Assignments |
| 16 Jun 2021 | Agelos Georgakopoulos | University of Warwick | Convergence of square tilings to the Riemann map |
| 14 Jun 2021 | Michael Krivelevich | Tel Aviv University | Linearly sized induced odd subgraphs |
| 7 Jun 2021 | Srinivasan Arunachalam | IBM Research | Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators |
| 24 May 2021 | Gramoz Goranci | University of Toronto | Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications |
| 11 May 2021 | Jeff Kahn | Rutgers | Thresholds |
| 26 Apr 2021 | Fahad Panolan | IIT Hyderabad | Low-Rank Binary Matrix Approximation in Column-Sum Norm |
| 22 Mar 2021 | Rico Zenklusen | ETH Zürich | Reducing Path TSP to TSP |
| 15 Mar 2021 | Alina Ene | Boston University | Adaptive gradient descent methods for constrained optimization |
| 8 Mar 2021 | Shoham Letzter | University College London | Size-Ramsey numbers of powers of tight paths |
| 1 Mar 2021 | Piotr Micek | Jagiellonian University | Adjacency Labelling for Planar Graphs |
| 15 Feb 2021 | Atul Mantri | University of Maryland | Secure Quantum Computation over Classical Networks |
| 8 Feb 2021 | Thatchaphol Saranurak | University of Michigan | Recent Applications of Expanders to Graph Algorithms |
| 25 Jan 2021 | Harald Räcke | Technical University of Munich | The Expander Hierarchy and its Applications to Dynamic Graph Algorithms |
| 18 Jan 2021 | Aaron Bernstein | Rutgers University | Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths |
| 8 Dec 2020 | Yufei Zhao | MIT | Equiangular lines, spherical two-distance sets, and spectral graph theory |
| 1 Dec 2020 | Bartosz Walczak | Jagiellonian University | Approximating pathwidth for graphs of small treewidth |
| 24 Nov 2020 | Monika Henzinger | University of Vienna | Hierarchical decompositions in dynamic graph algorithms |
| 10 Nov 2020 | Gil Kalai | Hebrew University of Jerusalem | Problems around Helly theorem |
| 3 Nov 2020 | Julia Böttcher | London School of Economics | Clique factors in randomly perturbed graphs (and related questions) |
| 27 Oct 2020 | Magnus Wahlström | Royal Holloway University of London | Solving hard cut problems via flow augmentation |
| 20 Oct 2020 | László Végh | London School of Economics | Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers |
| 13 Oct 2020 | Sergey Kitaev | University of Strathclyde | Permutation Patterns |
| 6 Oct 2020 | Jean Cardinal | Université Libre de Bruxelles | Trees on Trees |
| 23 Jun 2020 | Viktor Zamaraev | University of Liverpool | Connectivity threshold in random temporal graphs |
| 16 Jun 2020 | Krzysztof Onak | IBM T.J. Watson Research Center | Walking Randomly, Massively, and Efficiently |
| 9 Jun 2020 | Alexandr Andoni | Columbia University | Edit Distance in Near-Linear Time: it’s a Constant Factor |
| 2 Jun 2020 | Meirav Zehavi | Ben-Gurion University | Parameterized Analysis, Graph Minors and Planar Disjoint Paths |
| 26 May 2020 | Iddo Tzameret | Royal Holloway, University of London | Semi-Algebraic Proofs and the tau-Conjecture: Can a Natural Number be Negative? |
| 19 May 2020 | Roei Tell | The Weizmann Institute of Science | Derandomization and Circuit Lower Bounds in an Exponentially-Hard (Uniform) World |
| 12 May 2020 | Barnaby Martin | Durham University | The Complexity of Quantified Constraints |
| 5 May 2020 | Michal Kocvara | University of Birmingham | Solving Large Scale Semidefinite Problems by Decomposition |
| 28 Apr 2020 | Sarah Peluse | University of Oxford | An asymptotic version of the prime power conjecture for perfect difference sets |
| 21 Apr 2020 | Miriam Backens | University of Birmingham | Counting complexity and quantum information theory |
| 10 Mar 2020 | Mary Cryan | University of Edinburgh | Euler-tours of low-height toroidal grids |
| 5 Mar 2020 | Lijie Chen | Massachusetts Institute of Technology | Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization |
| 3 Mar 2020 | Kostas Tsakalidis | University of Liverpool | An updating method for geometric data structures |
| 27 Feb 2020 | Ramanathan Thinniyam Srinivasan | Max Planck Institute for Software Systems | The Complexity of Bounded Context Switching with Dynamic Thread Creation |
| 25 Feb 2020 | Rahul Santhanam | University of Oxford | Structure vs Randomness in Complexity Theory |
| 18 Feb 2020 | Pan Peng | The University of Sheffield | Sublinear Time Algorithms for Graph Clustering with Noisy Partial Information |
| 11 Feb 2020 | Jan van den Heuvel | The London School of Economics and Political Science | Hadwiger's Conjecture - Quo ? |
| 4 Feb 2020 | Alexander Kozachinskiy | University of Warwick | One-sided error Gap Hamming Distance |
| 28 Jan 2020 | Lena Yuditsky | Ben-Gurion University of the Negev | The $\epsilon$-$t$-Net Problem. |
| 21 Jan 2020 | Mikhail Vyalyi | HSE University, Moscow | Computational Hardness of Multidimensional Subtraction Games |
| 14 Jan 2020 | Daniel Kral | Masaryk University and University of Warwick | Matroid algorithms and integer programming |
| 7 Jan 2020 | Jan Grebik | University of Warwick | Measurable versions of Vizing’s theorem |
| 4 Dec 2019 | Moritz Müller | Universitat Politecnica de Catalunya | Automating resolution is NP-hard |
| 3 Dec 2019 | David Ellis | University of Bristol | Families of permutations with a forbidden intersection |
| 26 Nov 2019 | Gal Kronenberg | University of Oxford | The maximum length of K_r-Bootstrap Percolation. |
| 20 Nov 2019 | Varun Kanade | University of Oxford | Implicit regularization for optimal sparse recovery |
| 19 Nov 2019 | Andrew Ryzhikov | Université Paris-Est Marne-la-Vallée | Synchronization of finite automata |
| 12 Nov 2019 | Candida Bowtell | University of Oxford | Maximum hittings by maximal left-compressed intersecting families |
| 5 Nov 2019 | Justin Ward | Queen Mary, University of London | Guarantees for Maximising Negative and Non-Monotone Submodular Functions |
| 29 Oct 2019 | Torsten Muetze | University of Warwick | Combinatorial generation via permutation languages |
| 22 Oct 2019 | Julian Sahasrabudhe | University of Cambridge | On Combinatorial discrepancy and an old problem of J.E. Littlewood |
| 18 Oct 2019 | Vladimir Podolskii | HSE University, Moscow | Complexity of Linear Operators |
| 17 Oct 2019 | Alex Scott | University of Oxford | Graphs with large chromatic number |
| 9 Oct 2019 | Yuval Filmus | Technion – lsrael Institute of Technology | One-sided linearity testing |
| 8 Oct 2019 | Standa Zivny | University of Oxford | Complexity of graph colouring and beyond |
| 1 Oct 2019 | Amin Coja-Oghlan | Goethe University Frankfurt | Group testing |
| 19 Sep 2019 | Adi Shamir | Weizmann Institute | Memory-efficient algorithms for finding needles in haystacks |
| 3 Sep 2019 | Chris Cox | Carnegie Mellon University | Periodic words, common subsequences and frogs |
| 23 Jul 2019 | Rob van Stee | University of Siegen | The price of clustering in bin-packing with applications to bin-packing with delays |
| 4 Jul 2019 | Ashley Montanaro | University of Bristol | Quantum algorithms from foundations to applications |
| 25 Jun 2019 | Mark Jerrum | Queen Mary, University of London | Partial rejection sampling with an application to all-terminal network reliability |
| 18 Jun 2019 | David Mestel | University of Luxembourg | Widths of regular and context-free languages |
| 13 Jun 2019 | Radosław Piórkowski | University of Warsaw | WQO dichotomy conjecture: decidability in Petri nets with homogeneous data |
| 11 Jun 2019 | Peter Pal Pach | Budapest University of Technology and Economics | Caps and progression-free sets in Z m n |
| 06 Jun 2019 | Grigory Yaroslavtsev | Indiana University, Bloomington | Advances in hierarchical clustering of vector data |
| 21 May 2019 | Alexey Pokrovskiy | Birkbeck | Bounded diameter tree partitions |
| 7 May 2019 | Thomas Sauerwald | University of Cambridge | Random walks on dynamic graphs: Mixing times, hitting times, and return probabilities |
| 12 Mar 2019 | Peter Keevash | Oxford | Designs and decompositions |
| 05 Mar 2019 | Johannes Carmesin | University of Birmingham | Embedding simply connected 2-complexes in 3-space |
| 26 Feb 2019 | Tom Gur | Warwick | Codes, locality, and randomised algorithms |
| 19 Feb 2019 | Matthew Jenssen | Oxford | Algorithms for #BIS-hard problems on expander graphs |
| 15 Feb 2019 | Stefano Leonardi | Sapienza University of Rome | Algorithmic Mechanism Design for Two-sided Markets |
| 14 Feb 2019 | Filip Mazowiecki | University of Bordeaux | The Reachability Problem for Petri Nets is Not Elementary |
| 12 Feb 2019 | Charilaos Efthymiou | University of Warwick | Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model |
| 05 Feb 2019 | Michael Shekelyan | University of Warwick | Multidimensional Data Summaries |
| 29 Jan 2019 | Daniel Kráľ | Masaryk University | Cycles in tournaments |
| 24 Jan 2019 | Fabian Kuhn | University of Freiburg | On the role of randomization in local distributed algorithms |
| 22 Jan 2019 | Carla Groenland | Oxford | Size reconstructability of graphs |
| 15 Jan 2019 | John Fearnley | University of Liverpool | Unique End of Potential Line |
| 08 Jan 2019 | Lorenzo Federico | University of Warwick | Critical scaling limit of the random intersection graph. |
| 17 Dec 2018 | Laurent Doyen | LSV, ENS Cachan | Graph Planning with Expected Finite Horizon |
| 4 Dec 2018 | Marcin Mucha | University of Warsaw | Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration |
| 27 Nov 2018 | Ioannis Kontoyiannis | University of Cambridge and Athens UEB | Sumset Bounds for the Entropy on Abelian Groups |
| 20 Nov 2018 | Richard Montgomery | University of Birmingham | Spanning cycles in random directed graphs. |
| 13 Nov 2018 | Shaull Almagor | Oxford | O-Minimal Invariants for Linear Loops |
| 06 Nov 2018 | Nóra Frankl | LSE | On equilateral sets in subspaces of l_infty^n |
| 30 Oct 2018 | Denis Kuperberg | ENS Lyon | Is your automaton good for playing games? |
| 23 Oct 2018 | Karoliina Lehtinen | Christian-Albrechts University of Kiel | On the way to weak automata |
| 19 Oct 2018 | Mahdi Cheraghchi | Imperial College London | Capacity Upper Bounds for Deletion-Type Channels |
| 16 Oct 2018 | Dominik Kempa | University of Warwick | At the Roots of Dictionary Compression: String Attractors |
| 11 Oct 2018 | Dmitrii Pasechnik | Oxford | An almost sharp degree bound for sums of squares certificates for quaternary quartics |
| 2 Oct 2018 | Pavel Veselý | University of Warwick | A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines |
| 26 Jun 2018 | Stefanie Gerke | RHUL | Successive minimal paths in complete graphs with random edge weights |
| 12 Jun 2018 | Pascale Gourdeau | Oxford | Bisimulation Metrics for Weighted Automata |
| 8 Jun 2018 | Petr Jancar | Olomouc | Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with States |
| 29 May 2018 | Miguel Romero Orth | Oxford | The complexity of general-valued CSPs seen from the other side |
| 22 May 2018 | Janka Chlebikova | Portsmouth | Approximation hardness of (Graphic) Travelling Salesman Problem |
| 15 May 2018 | Ivan Tomasic | QMUL | Graphons, Tao’s regularity and difference polynomials |
| 8 May 2018 | Michaël Cadilhac | Oxford | Weak Cost Register Automata are Still Powerful |
| 1 May 2018 | Peter Richtarik | KAUST | Stochastic Quasi-Gradient Methods: Variance Reduction via Jacobian Sketching |
| 24 Apr 2018 | Shoham Letzter | Cambridge | Lagrangians of hypergraphs |
| 13 Mar 2018 | Nathanaël Fijalkow | ATI | The stochastic path problem and probabilistic automata of bounded ambiguity |
| 6 Mar 2018 | Irena Penev | Leeds | The class of (P 7 ,C 4 ,C 5 )-free graphs: decomposition, χ-boundedness, and algorithms |
| 27 Feb 2018 | Annika Heckel | Oxford | Colouring random graphs |
| 20 Feb 2018 | Arkadev Chattopadhyay | TIFR Mumbai | Simulation Beats Richness: New Data Structure Lower Bounds |
| 14 Feb 2018 | László Végh | LSE | A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem |
| 14 Feb 2018 | Tim Roughgarden | Stanford | How Computer Science Informs Modern Auction Design |
| 13 Feb 2018 | Imre Leader | Cambridge | Decomposing the Complete r-Graph |
| 6 Feb 2018 | Pawel Gawrychowski | Wroclaw | Labeling schemes for trees and planar graphs |
| 30 Jan 2018 | Guillermo Pérez | Brussels | Minimizing Regret in Infinite-Duration Games Played on Graphs |
| 23 Jan 2018 | Sophia Saller | Oxford | Local limit theorem for the number of K4 in G(n,p) |
| 16 Jan 2018 | Natasha Morrison | Cambridge | Maximising the number of induced cycles in a graph |
| 9 Jan 2018 | Robert Hancock | Birmingham | The Maker-Breaker Rado game on a random set of integers |
| 5 Dec 2017 | Anthony Widjaja Lin | Oxford | Decidable Logics for Path Feasibility of Programs with Strings |
| 28 Nov 2017 | Laure Daviaud | Warwick | An introduction to weighted automata |
| 21 Nov 2017 | Dirk Sudholt | Sheffield | On the Analysis of Evolutionary Algorithms - How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms |
| 14 Nov 2017 | Luke Postle | Waterloo | Correspondence Coloring and its Applications |
| 7 Nov 2017 | Péter Pál Pach | Warwick | On some Applications of Graph Theory to Number Theoretic Problems |
| 31 Oct 2017 | Joanna Ochremiak | IRIF | Proof complexity of constraint satisfaction problems |
| 24 Oct 2017 | Michelle Delcourt | Birmingham | On the List Coloring Version of Reed's Conjecture |
| 17 Oct 2017 | M. S. Ramanujan | Warwick | To iterate or not to iterate: A linear time algorithm for recognizing near acyclicity |
| 10 Oct 2017 | Alexandra Silva | UCL | CALF: Categorical Automata Learning Framework |
| 3 Oct 2017 | Marcin Wrochna | University of Warsaw | Coloring graph products and Hedetniemi's conjecture |
| 15 August 2017 | Seeun William Umboh | Eindhoven University of Technology | Nested Convex Bodies are Chaseable |
| 27 June 2017 | Mohammad Bardestani | Münster | Oscillatory integrals and their application in geometric graph theory |
| 20 Jun 2017 | Stefan Glock | Birmingham | Designs beyond quasirandomness |
| 13 Jun 2017 | Sergey Kitaev | Strathclyde | Universal Partial Words |
| 6 Jun 2017 | Danupon Nanongkai | KTH Stockholm | Challenges in Distributed Shortest Paths Algorithms |
| 30 May 2017 | Yury Person | Frankfurt | Blow-up lemmas |
| 23 May 2017 | Peter Fulla | Oxford | The complexity of Boolean surjective VCSPs |
| 16 May 2017 | Rasmus Ibsen-Jensen | IST Vienna | Strategies for stochastic games |
| 9 May 2017 | Adam Zsolt Wagner | UIUC | Families with few k-chains |
| 2 May 2017 | Mikhail Moshkov | KAUST | Extensions of Dynamic Programming for Decision Tree Study |
| 25 Apr 2017 | Carlo Comin | University of Trento | Linear Time Algorithm for Update Games |
| 14 Mar 2017 | Isolde Adler | University of Leeds | Property testing for structures of bounded degree |
| 7 Mar 2017 | Sayan Bhattacharya | University of Warwick | Dynamic Matching via Primal-Dual Method |
| 28 Feb 2017 | Paul Dütting | London School of Economics | Best-response Dynamics in Combinatorial Auctions with Item Bidding |
| 21 Feb 2017 | Harald Räcke | TU Munich | Reordering Buffer Management in General Metric Spaces |
| 14 Feb 2017 | Anton Bernshteyn | University of Illinois at Urbana-Champaign | Measurable combinatorics and the Lovász Local Lemma |
| 7 Feb 2017 | Konrad Dabrowski | Durham University | Colouring Diamond-free Graphs |
| 31 Jan 2017 | Christina Goldschmidt | University of Oxford | Parking on a tree |
| 10 Jan 2017 | Daniel Freund | Cornell University | Pricing and Optimization in Shared Vehicle Systems: Queueing Models and Approximation Algorithms |
| 6 Dec 2016 | Andrzej Grzesik | Jagiellonian University | Densities of 3-vertex graphs |
| 29 Nov 2016 | Mirna Dzamonja | University of East Anglia | Universal graphs |
| 22 Nov 2016 | Rafael Barbosa | University of Warwick | A new framework for distributed submodular maximization |
| 8 Nov 2016 | Marcin Bieńkowski | University of Wroclaw | Online algorithms for multi-level aggregation |
| 1 Nov 2016 | Andrew Treglown | University of Birmingham | Independent sets in hypergraphs and Ramsey properties of graphs and the integers |
| 25 Oct 2016 | Kristina Vuskovic | University of Leeds | Coloring square-free Berge graphs |
| 18 Oct 2016 | Christian Konrad | University of Warwick | On the Power of Advice and Randomization for Online Bipartite Matching |
| 4 Oct 2016 | James Maynard | University of Oxford | Primes with missing digits |
| 28 Jun 2016 | Stefan Kiefer | University of Oxford | Distinguishing Hidden Markov Chains |
| 21 Jun 2016 | Yufei Zhao | University of Oxford | Upper tails for arithmetic progressions in a random set |
| 14 Jun 2016 | Dmitry Chistikov | MPI-SWS | Navigating one-counter automata: Directions in the mountains |
| 31 May 2016 | Andrew Thomason | University of Cambridge | List colouring of hypergraphs |
| 24 May 2016 | Allan Lo | University of Birmingham | The decomposition threshold of a given graph |
| 17 May 2016 | Michal Przykucki | University of Oxford | The time of graph bootstrap percolation |
| 10 May 2016 | Viktor Zamaraev | University of Warwick | On forbidden induced subgraphs for unit disk graphs |
| 3 May 2016 | Alexandre Stauffer | University of Bath | Multi-particle diffusion limited aggregation |
| 26 Apr 2016 | Filip Mazowiecki | University of Warwick | Copyless cost register automata |
| 8 Mar 2016 | Patrick Totzke | University of Warwick | The Reachability Problem for Two-Dimensional Vector Addition Systems with States |
| 1 Mar 2016 | Jakub Gajarsky | Masaryk University, Brno | A New Perspective on FO Model Checking of Dense Graph Classes |
| 23 Feb 2016 | Richard Mycroft | University of Birmingham | Hamilton cycles in dense hypergraphs |
| 16 Feb 2016 | Ping Hu | University of Warwick | Minimum number of edges in odd cycles |
| 9 Feb 2016 | Bartosz Walczak | Jagiellonian University, Krakow | Partial representation extension problems for classes of graphs with geometric representations |
| 2 Feb 2016 | Pierre-André Maugis | UCL | Non-Parametric Network Inference |
| 26 Jan 2016 | Nikos Tzevelekos | Queen Mary, University of London | History-Register Automata |
| 19 Jan 2016 | Simon Griffiths | University of Oxford | Moderate deviations of random graph subgraph counts |
| 8 Dec 2015 | Huy Le Nguyen | Toyota Technological Institute at Chicago | Communication Lower Bounds for Statistical Estimation Problems |
| 1 Dec 2015 | Tamas Hubai | University of Warwick | Graph polynomials for locally convergent graph sequences |
| 24 Nov 2015 | Jozef Siran | Open University | Regular and orientably regular maps |
| 17 Nov 2015 | Hossein Jowhari | University of Warwick | An introduction to Lp samplers and their applications |
| 10 Nov 2015 | Golnaz Badkobeh | University of Warwick | Closed Words: Algorithms and Combinatorics |
| 3 Nov 2015 | He Sun | University of Bristol | Heat kernels in graphs: A journey from random walks to geometry, and back |
| 20 Oct 2015 | Peter Nelson | University of Waterloo | Exponentially dense matroids |
| 13 Oct 2015 | Lutz Warnke | University of Cambridge | The phase transition in bounded-size Achlioptas processes |
| 6 Oct 2015 | Guillem Perarnau | University of Birmingham | Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture |
| 21 Sept 2015 | Krzysztof Onak | IBM T.J. Watson Research Center | Parallel Algorithms for Geometric Graph Problems |
| 30 Jun 2015 | Henry Cohn | Microsoft Research | The role of symmetry in high-dimensional sphere packing |
| 23 Jun 2015 | László Miklós Lovász | MIT | Left and right convergence of bounded degree graphs |
| 15 Jun 2015 | Rob van Stee | University of Leicester | The optimal absolute ratio for online bin packing |
| 9 Jun 2015 | John Talbot | University College London | Mantel's theorem extensions and analogues |
| 2 Jun 2015 | Richard Cole | New York University | Approximating the Nash Social Welfare with Indivisible Items |
| 26 May 2015 | Sylvain Schmitz | ENS Cachan & CNRS & INRIA | Leverhulme Lecture: Complexity Hierarchies Beyond Elementary |
| 12 May 2015 | Daniela Kuhn | University of Birmingham | Optimal path and cycle decompositions of random graphs |
| 8 May 2015 | Magnus Wahlström | Royal Holloway | FPT algorithms via LP-relaxations |
| 28 Apr 2015 | Daniel Lokshtanov | University of Bergen | FO Model Checking on Posets of Bounded Width |
| 21 Apr 2015 | Will Perkins | University of Birmingham | Spectral Algorithms for Random Hypergraph Partitioning |
| 10 Mar 2015 | Stanislav Živný | University of Oxford | Hybrid tractability of binary CSPs |
| 3 Mar 2015 | Rahul Savani | University of Liverpool | The Complexity of the Simplex Method |
| 24 Feb 2015 | Alexandre Stauffer | University of Bath | Random walks on dynamic graphs given by dynamical percolation |
| 17 Feb 2015 | Deryk Osthus | University of Birmingham | Decompositions of large graphs into small subgraphs |
| 10 Feb 2015 | Justin Ward | University of Warwick | A Distributed Greedy Algorithm for Submodular Maximization in Large Datasets |
| 27 Jan 2015 | Alex Scott | University of Oxford | Colouring graphs without odd holes |
| 20 Jan 2015 | Paul Goldberg | University of Oxford | Learning game-theoretic equilibria via query protocols |
| 13 Jan 2015 | Jaehoon Kim | University of Birmingham | Regular subgraphs of hypergraphs |
| 6 Jan 2015 | Ping Hu | University of Warwick | Rainbow triangles in three-colored graphs |
| 2 Dec 2014 | Tomasz Łuczak | Adam Mickiewicz University | On the chromatic number of generalized shift graph |
| 25 Nov 2014 | Jozef Skokan | LSE | The Ramsey number of the clique and the hypercube |
| 11 Nov 2014 | Julia Wolf | University of Bristol | Ramsey multiplicity of patterns in abelian groups |
| 10 Nov 2014 | Elliot Anshelevich | Rensselaer Polytechnic Institute | Stable Matching, Friendship, and Altruism |
| 4 Nov 2014 | Thomas Bloom | University of Bristol | Structure in large spectra |
| 28 Oct 2014 | Endre Csóka | University of Warwick | Efficient Teamwork |
| 21 Oct 2014 | Swiatoslaw R. Gal | Wroclaw University | Flag triangulations of spheres: f-, h-, and γ- numbers |
| 14 Oct 2014 | Sune Kristian Jakobsen | Queen Mary, University of London | Information Theoretical Cryptogenography |
| 7 Oct 2014 | Alina Ene | University of Warwick | Approximation Algorithms for Multiway Partitioning Problems and a Simplex Coloring Conjecture |
| 30 Sept 2014 | Barnaby Martin | Middlesex University London | A tetrachotomy for positive equality-free logic |
| 3 July 2014 | Tony Wirth | University of Melbourne | Rooted Triplet Inconsistency: Hardness and Algorithms |
| 19 Jun 2014 | Marcin Pilipczuk | University of Bergen | Subexponential Parameterized Complexity of Completion Problems |
| 18 Jun 2014 | Jun Zhang | NTU Singapore | Differentially Private Data Release |
| 10 Jun 2014 | László Miklós Lovász | MIT | The height of the tower in Szemerédi's regularity lemma |
| 3 Jun 2014 | Bartosz Walczak | Jagiellonian University in Kraków | Minors and dimension |
| 27 May 2014 | Agelos Georgakopoulos | University of Warwick | Some problems around random walks |
| 20 May 2014 | Jan Volec | University of Warwick | Subcubic triangle-free graphs have fractional chromatic number at most 14/5 |
| 13 May 2014 | Einar Steingrimsson | University of Strathclyde | The topology and Möbius function of the permutation pattern poset |
| 29 Apr 2014 | Petra Berenbrink | Simon Fraser University | Diffusion Load Balancing |
| 14 Mar 2014 | Thomas Sauerwald | University of Cambridge | Balls into Bins via Local Search |
| 11 Mar 2014 | Zun-Bin Zhao | University of Birmingham | RSP-based analysis for the efficiency of l 1 -minimization for solving l 0 -problems |
| 04 Mar 2014 | Guglielmo Lulli | University of Milano-Bicocca | A new optimization framework for dynamic resource allocation problems |
| 25 Feb 2014 | Nicolas Gillis | Université de Mons | Fast projection methods for robust separable nonnegative matrix factorization |
| 18 Feb 2014 | Paul Spirakis | University of Liverpool | Temporal Networks : Optimization and Connectivity |
| 11 Feb 2014 | László Végh | London School of Economics | Strongly polynomial algorithm for generalized flow maximization |
| 31 Jan 2014 | Ilias Diakonikolas | University of Edinburgh | Learning Sums of Independent Integer Random Variables |
| 21 Jan 2014 | Viresh Patel | Queen Mary University of London | A domination algorithm for {0,1}-instances of the travelling salesman problem |
| 4 Dec 2013 | Jan Bulánek | Charles University/Academy of Sciences | Tight Lower Bounds for the Online Labeling Problem |
| 3 Dec 2013 | Lutz Warnke | University of Cambridge | The Evolution of Subcritical Achlioptas Processes |
| 26 Nov 2013 | Rob van Stee | University of Leicester | A Unified Approach to Truthful Scheduling on Related Machines |
| 26 Nov 2013 | Milan Vojnovic | Microsoft Research Cambridge | Balanced Graph Partitioning for Massive Scale Computations |
| 20 Nov 2013 | Alex Grigoriev | Maastricht University | Bidimensionality on Geometric Intersection Graphs |
| 19 Nov 2013 | Sergey Kitaev | University of Strathclyde | Equidistributions on Planar Maps via Involutions on Description Trees |
| 15 Nov 2013 | Sanjeeb Dash | IBM T. J. Watson Research Center, NY | Multi-Branch Split Cutting Planes for Mixed-Integer Programs |
| 12 Nov 2013 | Ben Barber | University of Birmingham | Partition Regularity in the Rationals |
| 5 Nov 2013 | Zhan Pang | Lancaster University | Dynamic Financial Hedging Strategies for a Storable Commodity with Demand Uncertainty |
| 30 Oct 2013 | Piotr Indyk | MIT | Faster Algorithms for the Sparse Fourier Transform |
| 22 Oct 2013 | Elias Koutsoupias | University of Oxford | Near-Optimal Multi-Unit Auctions with Ordered Bidders |
| 15 Oct 2013 | Robert Calderbank | Duke University | Information Theory and Compressed Sensing |
| 10 Oct 2013 | Alina Ene | University of Warwick / Princeton | Routing in Directed Graphs with Symmetric Demands |
| 8 Oct 2013 | Stanislav Böhm | VSB - Technical University of Ostrava | NL-completeness of Equivalence for Deterministic One-Counter Automata |
| 1 Oct 2013 | Sang-il Oum | KAIST | Vertex-Minors of Graphs |
| 25 July 2013 | Srikanta Tirthapura | Iowa State University | On Optimality of Clustering by Space Filling Curves |
| 25 Jun 2013 | Juan-Jose Salazar-Gonzalez | University of La Laguna | Optimizing the Management of Crews and Aircrafts in Canary Islands |
| 20 Jun 2013 | Graham Cormode | University of Warwick | Streaming Verification of Outsourced Computation |
| 18 Jun 2013 | Endre Boros | Rutgers University | A family of effective payoffs in stochastic games with perfect information |
| 11 Jun 2013 | John Fearnley | University of Liverpool | Reachability in Two-Clock Timed Automata is PSPACE-complete |
| 4 Jun 2013 | Martin Anthony | LSE | Quadratization of pseudo-Boolean functions |
| 28 May 2013 | Michel Habib | University Paris Diderot | New trends for graph searches |
| 21 May 2013 | Igor Potapov | University of Liverpool | Reachability Problems for Words, Matrices and Maps |
| 14 May 2013 | Anna Huber | Durham University | Skew Bisubmodularity and Valued CSPs |
| 13 May 2013 | Lila Fontes | University of Toronto | The Tradeoff Between Privacy and Communication |
| 7 May 2013 | Andrei Krokhin | Durham University | Robust algorithms for constraint satisfaction problems |
| 30 Apr 2013 | Daniel Paulusma | Durham University | Coloring (H1,H2)-free graphs |
| 23 Apr 2013 | Alain Hertz | Polytechnique Montreal | On the maximum difference between several graph invariants |
| 19 Mar 2013 | Lehilton Chaves | University of Warwick | Squared Metric Facility Location Problem and the Upper Bound Factor-Revealing Programs |
| 18 Mar 2013 | Richard Cole | New York University | Truthful Mechanisms for Approximating Proportionally Fair Allocations |
| 12 Mar 2013 | Tri-Dung Nguyen | University of Southampton | Optimal coalition structure and stable payoff distribution in large games |
| 05 Mar 2013 | Roman Glebov | University of Warwick | On bounded degree spanning trees in the random graph |
| 26 Feb 2013 | Andrew Treglown | Queen Mary, University of London | More on perfect matchings in uniform hypergraphs |
| 19 Feb 2013 | David Conlon | University of Oxford | Ramsey multiplicity |
| 12 Feb 2013 | Roman Belavkin | Middlesex University London | On Optimality of Deterministic and Non-Deterministic Transformations |
| 6 Feb 2013 | Liron Yedidsion | Technion - Israel Institute of Technology | Approximation Algorithm for the Resource Dependent Assignment Problem |
| 29 Jan 2013 | Thomas Dueholm Hansen | Aarhus University | Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor |
| 22 Jan 2013 | Steve Alpern | University of Warwick | A new method of searching a network |
| 15 Jan 2013 | Claire Mathieu | École Normale Supérieure and Brown University | Algorithms for optimization over noisy data |
| 8 Jan 2013 | Victor Zamaraev | HSE | On the factorial layer of hereditary classes of graphs |
| 27 Nov 2012 | Peter Keevash | Queen Mary, University of London | Turan Numbers of Bipartite Graphs Plus an Odd Cycle |
| 20 Nov 2012 | Wolfram Wiesemann | Imperial College London | Distributionally Robust Convex Optimisation |
| 13 Nov 2012 | Justin Ward | University of Toronto | A Tight, Combinatorial Algorithm for Submodular Matroid Maximization |
| 30 Oct 2012 | Timothy Griffin | University of Cambridge | Local Optimality in Algebraic Path Problems |
| 23 Oct 2012 | Alexander Tiskin | University of Warwick | Semi-local String Comparison |
| 16 Oct 2012 | Marcin Mucha | University of Warsaw | Lyndon Words and Short Superstrings |
| 9 Oct 2012 | Stanislav Živný | University of Warwick | The Power of Linear Programming for Valued CSPs |
| 4 Jul 2012 | Piotr Sankowski | University of Warsaw | Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings |
| 29 Jun 2012 | Andrew McGregor | University of Massachusetts, Amherst | Analyzing Graphs via Random Linear Projections |
| 19 Jun 2012 | Fabrizio Grandoni | Dalle Molle Institute for Artificial Intelligence | Pricing on Paths: A PTAS for the Highway Problem |
| 6 Jun 2012 | Etienne de Klerk | Tilburg University | Improved Lower Bounds on Crossing Numbers of Graphs Through Optimization |
| 22 May 2012 | Olof Sisask | Queen Mary, University of London | Arithmetic Progressions in Sumsets via (Discrete) Probability, Geometry and Analysis |
| 18 May 2012 | Benny Sudakov | UCLA | Induced Matchings, Arithmetic Progressions and Communication |
| 15 May 2012 | Igor Razgon | University of Leicester | Treewidth Reduction Theorem and Algorithmic Problems on Graphs |
| 8 May 2012 | Ashley Montanaro | University of Cambridge | Exact Quantum Query Algorithms |
| 1 May 2012 | Sergey Kitaev | University of Strathclyde | Representing Graphs by Words |
| 24 Apr 2012 | Catherine Greenhill | University of New South Wales | Making Markov Chains Less Lazy |
| 16 Apr 2012 | Tim Nonner | IBM Zurich Research Laboratory | Polynomial-Time Approximation Schemes for Shortest Path with Alternatives |
| 23 Mar 2012 | Andrew Treglown | Charles University | Minimum Degree Thresholds for Perfect Matchings in Hypergraphs |
| 21 Mar 2012 | Sebastian Stiller | TU Berlin | Robust Optimization over Integers |
| 20 Mar 2012 | Leslie Goldberg | University of Liverpool | The Complexity of Computing the Sign of the Tutte Polynomial |
| 13 Mar 2012 | Peter Butkovic | University of Birmingham | Combinatorics of Tropical Linear Algebra |
| 6 Mar 2012 | Christian Sohler | Technical University Dortmund | Every Property of Hyperfinite Graphs is Testable |
| 5 Mar 2012 | Justin Ward | University of Toronto | Improved Approximations for Monotone Submodular k-Set Packing and General k-Exchange Systems |
| 28 Feb 2012 | Jonathan Thompson | Cardiff University | Hybridising Heuristic and Exact Methods to Solve Scheduling Problems |
| 14 Feb 2012 | Martin Hoefer | RWTH Aachen University | Local Matching Dynamics in Social Networks |
| 6 Feb 2012 | Ola Svensson | EPFL | Approximating Graphic TSP by Matchings |
| 31 Jan 2012 | Eranda Dragoti-Çela | Graz University of Technology | The Quadratic Assignment Problem: on the Borderline Between Hard and Easy Special Cases |
| 25 Jan 2012 | Giacomo Zambelli | London School of Economics and Political Science | Extended Formulations in Combinatorial Optimization |
| 24 Jan 2012 | Vitaly Strusevich | University of Greenwich | The "Power of ..." Type Results in Parallel Machine Scheduling |
| 10 Jan 2012 | Daniel Kuhn | Imperial College London | Robust Markov Decision Processes |
| 6 Dec 2011 | Wojciech Samotij | University of Cambridge | Independent Sets in Hypergraphs |
| 5 Dec 2011 | J. Ian Munro | University of Waterloo | Creating a Partial Order and Finishing the Sort |
| 29 Nov 2011 | Guilhem Semerjian | École Normale Supérieure | Statistical Mechanics Approach to the Problem of Counting Large Subgraphs in Random Graphs |
| 22 Nov 2011 | Robert Brignall | The Open University | Applications and Studies in Modular Decomposition |
| 15 Nov 2011 | Nikolaos Fountoulakis | University of Birmingham | Random Graphs on Spaces of Negative Curvature |
| 8 Nov 2011 | Boris Bukh | University of Cambridge | Upper Bound for Centerlines |
| 4 Nov 2011 | Daniel Král' | Charles University in Prague | Algorithms for Testing FOL Properties |
| 1 Nov 2011 | Raphaël Clifford | University of Bristol | Lower Bounds for Online Integer Multiplication and Convolution in the Cell-probe Model |
| 14 Oct 2011 | Bernhard von Stengel | London School of Economics | Nash Codes for Noisy Channels |
| 4 Oct 2011 | Andreas Brandstädt | Universität Rostock | On Clique Separator Decomposition of Some Hole-Free Graph Classes |
| 30 Aug 2011 | Arie M.C.A. Koster | RWTH Aachen University | Network Design under Demand Uncertainties |
| 25 Jul 2011 | Laura Galli | Università di Bologna | Cutting-Planes for the Max-Cut Problem |
| 12 Jul 2011 | Leslie Valiant | Harvard University | Holographic Algorithms |
| 29 Jun 2011 | Maxim Sviridenko | IBM T.J. Watson Research | New and Old Algorithms for Matroid and Submodular Optimization |
| 28 Jun 2011 | Konstantinos Panagiotou | MPI | Ultra-Fast Rumor Spreading in Models of Real-World Networks |
| 21 Jun 2011 | Vitaliy Koshelev | Moscow Institute of Physics and Technology | On the Erdős-Szekeres Problem and its Modifications |
| 20 Jun 2011 | Paweł Gawrychowski | University of Wrocław | Optimal (Fully) LZW-compressed Pattern Matching |
| 14 Jun 2011 | Igor Razgon | University of Leicester | Understanding the Kernelizability of Multiway Cut |
| 7 Jun 2011 | Jan van den Heuvel | London School of Economics | Fractional Colouring and Pre-colouring Extension of Graphs |
| 31 May 2011 | Viresh Patel | Durham University | Partitioning Posets |
| 24 May 2011 | Martin Kochol | Slovak Academy of Sciences | Solution to an Edge-coloring Conjecture of Grunbaum |
| 17 May 2011 | Lutz Warnke | University of Oxford | Achlioptas Process Phase Transitions are Continuous |
| 3 May 2011 | David Saad | Aston University | Dynamics of Boolean Networks - An Exact Solution |
| 27 Apr 2011 | David S. Johnson | AT&T | The Traveling Salesman Problem: Theory and Practice in the Unit Square |
| 26 Apr 2011 | Ammar Oulamara | INPL | No-wait Flow Shop with Batching Machines |
| 15 Mar 2011 | Michel Deza | École Normale Supérieure, Paris | Space Fullerenes |
| 8 Mar 2011 | Michel Deza | École Normale Supérieure, Paris | Elementary Polycycles and Applications |
| 23 Feb 2011 | David Ellis | University of Cambridge | Triangle-intersecting Families of Graphs |
| 15 Feb 2011 | Fred Holroyd | The Open University | Overlap Colourings of Graphs: A Generalization of Multicolourings |
| 11 Feb 2011 | Amr Elmasry | University of Copenhagen | Number Systems and Data Structures |
| 8 Feb 2011 | Dave Cohen | Royal Holloway | The Complexity of the Constraint Satisfaction Problem: Beyond Structure and Language |
| 18 Jan 2011 | Xiaotie Deng | University of Liverpool | Auction and Equilibrium in Sponsored Search Market Design |
| 11 Jan 2011 | Robert Krauthgamer | Weizmann Institute | Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity |
| 7 Dec 2010 | Anders Yeo | Royal Holloway | All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with a Quadratic Number of Variables |
| 1 Dec 2010 | Tim Pigden | Optrak | Defining Real-world Vehicle Routing Problems: An Object-based Approach |
| 30 Nov 2010 | Simone Severini | University College London | A Role for the Lovasz Theta Function in Quantum Mechanics |
| 23 Nov 2010 | Bill Jackson | Queen Mary | Boundedness, Rigidity and Global Rigidity of Direction-Length Frameworks |
| 16 Nov 2010 | Nik Ruskuc | University of St Andrews | Grid Pattern Classes |
| 9 Nov 2010 | Gregory Sorkin | London School of Economics | Unsatisfiability Below the Threshold(s) |
| 4 Nov 2010 | Andrew Treglown | University of Birmingham | Matchings in 3-uniform Hypergraphs |
| 2 Nov 2010 | Artem Pyatkin | Durham University | On Incidentor Colorings of Multigraphs |
| 26 Oct 2010 | Michele Zito | University of Liverpool | The Empire Colouring Problem: Old and New Results |
| 19 Oct 2010 | Ilia Krasikov | Brunel University | Reconstruction Problems and Polynomials |
| 12 Oct 2010 | Vadim Lozin | University of Warwick | A Decidability Result for the Dominating Set Problem |
| 23 Sep 2010 | Marc Demange | ESSEC Business School | Hardness and Approximation of Minimum Maximal Matching in k-regular graphs |
| 12 Aug 2010 | Sourav Chakraborty | CWI | Query Complexity Lower Bounds for Reconstruction of Codes |
| 10 Aug 2010 | Alexander Skopalik | RWTH Aachen | Altruism in Atomic Congestion Games |
| 29 Jun 2010 | Wieslaw Kubiak | Memorial University | Proportional Optimization and Fairness: Applications |
| 22 Jun 2010 | Cole Smith | University of Florida | A Decomposition Approach for Insuring Critical Paths |
| 21 Jun 2010 | Prudence Wong | University of Liverpool | Energy Efficient Job Scheduling with Speed Scaling and Sleep Management |
| 15 Jun 2010 | Viresh Patel | Durham University | Edge Expansion in Graphs on Surfaces |
| 8 Jun 2010 | Guy Kortsarz | Rutgers University | A Survey of Connectivity Approximation via a Survey of the Techniques |
| 2 Jun 2010 | Troels Bjerre Sørensen | University of Warwick | The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements |
| 1 Jun 2010 | John Fearnley | University of Warwick | Exponential Lower Bounds For Policy Iteration |
| 25 May 2010 | Petr Golovach | Durham University | Paths of Bounded Length and their Cuts: Parameterized Complexity and Algorithms |
| 18 May 2010 | Paul Sant | University of Bedfordshire | Colouring Pairs of Binary Trees and the Four Colour Problem - Results and Achievements |
| 11 May 2010 | David Conlon | University of Cambridge | An Approximate Version of Sidorenko's Conjecture |
| 4 May 2010 | Juergen Branke | University of Warwick | Hybridizing Evolutionary Algorithms and Parametric Quadratic Programming to Solve Multi-Objective Portfolio Optimization Problems with Cardinality Constraints |
| 26 Apr 2010 | Shiva Kasiviswanathan | Los Alamos National Laboratory | A Rigorous Approach to Statistical Database Privacy |
| 22 Apr 2010 | F. Meyer auf der Heide | University of Paderborn | Local Algorithms for Robotic Formation Problems |
| 16 Mar 2010 | Stephan Kreutzer | University of Oxford | Algorithmic Meta-Theorems: Upper and Lower Bounds for the Parameterized Complexity of Problems on Graphs |
| 10 Mar 2010 | Martin Zimmermann | RWTH Aachen | Time-optimal Strategies for Infinite Games |
| 9 Mar 2010 | Marcin Kamiński | ULB | Induced Minors and Contractions - An Algorithmic View |
| 3 Mar 2010 | Oliver Riordan | University of Oxford | The Generalized Triangle-triangle Transformation in Percolation |
| 2 Mar 2010 | Rico Zenklusen | EPF Lausanne | A Flow Model Based on Linking Systems with Applications in Network Coding |
| 23 Feb 2010 | Robert Krauthgamer | Weizmann Institute | A Nonlinear Approach to Dimension Reduction |
| 16 Feb 2010 | Heiko Röglin | Maastricht University | k-Means has Polynomial Smoothed Complexity |
| 10 Feb 2010 | Daniel Král' | Charles University, Prague | Total Fractional Colorings of Graphs with Large Girth |
| 9 Feb 2010 | Deryk Osthus | University of Birmingham | Hamilton Decompositions of Graphs and Digraphs |
| 2 Feb 2010 | Mikhail Moshkov | KAUST | Time Complexity of Decision Trees |
| 27 Jan 2010 | Stefanie Gerke | Royal Holloway | Random Graph Processes |
| 26 Jan 2010 | Peter Keevash | Queen Mary | Cycles in Directed Graphs |
| 19 Jan 2010 | Andrei Toom | University of Pernambuco | Solvable and Unsolvable in Cellular Automata |
| 12 Jan 2010 | Colin Cooper | King's College London | Using Neighbourhood Exploration to Speed up Random Walks |
| 2 Dec 2009 | Tomasz Radzik | King's College London | Robustness of the Rotor-router Mechanism for Graph Exploration |
| 1 Dec 2009 | Vadim Zverovich | UWE Bristol | Discrepancy and Signed Domination in Graphs and Hypergraphs |
| 25 Nov 2009 | Frits Spieksma | KU Leuven | An Overview of Multi-index Assignment Problems |
| 24 Nov 2009 | Troels Bjerre Sørensen | LMU Munich | Approximability and Parameterized Complexity of Minmax Values |
| 18 Nov 2009 | Rajiv Raman | University of Warwick | Profit-maximizing Pricing: The Highway and Tollbooth Problem |
| 17 Nov 2009 | Patrick Briest | University of Paderborn | Pricing Lotteries |
| 12 Nov 2009 | Altannar Chinchuluun | Imperial College London | Some Multiobjective Optimization Problems |
| 11 Nov 2009 | Codruţ Grosu | University of Bukarest | The Extremal Function for Partial Bipartite Tilings |
| 10 Nov 2009 | Gregory Sorkin | IBM Research | The Power of Choice in a Generalized Pólya Urn Model |
| 10 Nov 2009 | Colin McDiarmid | University of Oxford | Random Graphs with Few Disjoint Cycles |
| 10 Nov 2009 | Harald Räcke | University of Warwick | Oblivious Routing in the L_p-norm |
| 4 Nov 2009 | Charilaos Efthymiou | University of Edinburgh | Correlation Decay and Applications to Counting Colourings |
| 3 Nov 2009 | Robert Brignall | University of Bristol | Antichains and the Structure of Permutation Classes |
| 27 Oct 2009 | Oded Lachish | University of Warwick | Wiretapping a Hidden Network |
| 13 Oct 2009 | Peter Cameron | Queen Mary | Synchronization |
| 6 Oct 2009 | Bernard Ries | University of Warwick | On Graphs that Satisfy Local Pooling |
| 29 Sep 2009 | Matthias Westermann | University of Bonn | The Power of Online Reordering |
| 24 Jun 2009 | Alex Scott | University of Oxford | Triangles in Random Graphs |
| 23 Jun 2009 | Imre Leader | University of Cambridge | Positive Projections |
| 16 Jun 2009 | Dieter Rautenbach | TU Ilmenau | Cycles, Paths, Connectivity and Diameter in Distance Graphs |
| 9 Jun 2009 | Amin Coja-Oghlan | University of Edinburgh | Discrepancy and eigenvalues |
| 3 Jun 2009 | Piotr Krysta | University of Liverpool | Social Context Games |
| 26 May 2009 | Darek Kowalski | University of Liverpool | 30 Years with Consensus: from Feasibility to Scalability |
| 19 May 2009 | Daniel Paulusma | Durham University | Disconnecting a Graph by a Disconnected Cut |
| 13 May 2009 | Mary Cryan | University of Edinburgh | Algorithms for Counting/Sampling Cell-Bounded Contingency Tables |
| 7 May 2009 | Diana Piguet | Charles University Prague | 4-Colour Ramsey Number of Paths |
| 6 May 2009 | Julia Böttcher | TU München | Sparse Random Graphs are Fault Tolerant for Large Bipartite Graphs |
| 6 May 2009 | Jan Hladký | Charles University Prague | Counting Flags in Triangle Free Digraphs |
| 5 May 2009 | Mathias Schacht | Humboldt-Universität Berlin | Regularity Lemmas for Graphs |
| 21 Apr 2009 | Russell Martin | University of Liverpool | Time and Space Efficient Anonymous Graph Traversal |
| 6 Apr 2009 | Noga Alon | Tel Aviv University | Eliminating Cycles in the Torus |
| 17 Mar 2009 | Berthold Vöcking | RWTH Aachen | Oblivious Interference Scheduling |
| 16 Mar 2009 | Yoshiaki Oda | Keio University | Polynomial Time Solvable Cases of the Vehicle Routing Problem |
| 11 Mar 2009 | Dolores Romero Morales | University of Oxford | Bounding Revenue Deficiency in Multiple Winner Procurement Auctions |
| 10 Mar 2009 | Gunnar W. Klau | CWI Amsterdam | Prize-Collecting Steiner Trees and Disease |
| 3 Mar 2009 | Kousha Etessami | University of Edinburgh | Adding Recursion to Markov Chains, Markov Decision Processes, and Stochastic Games |
| 2 Mar 2009 | Ayşegül Altin | TOBB University | The Robust Network Loading Problem under Polyhedral Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations |
| 24 Feb 2009 | Rudolf Müller | University Maastricht | Optimal Mechanisms for Scheduling |
| 10 Feb 2009 | Marc Wennink | BT Innovate | Distributed Optimisation in Network Control |
| 3 Feb 2009 | Christian Elsholtz | Royal Holloway | Multidimensional Problems in Additive Combinatorics |
| 27 Jan 2009 | Alexander Tiskin | University of Warwick | Fast Distance Multiplication of Unit-Monge Matrices |
| 20 Jan 2009 | Vadim Lozin | University of Warwick | Boundary Properties of Graphs and the Hamiltonian Cycle Problem |
| 13 Jan 2009 | Peter Allen | University of Warwick | Minimum Degree Conditions for Large Subgraphs |
| 2 Dec 2008 | Hajo Broersma | University of Durham | Degree Sequence Conditions for Graph Properties |
| 25 Nov 2008 | Bas Lemmens | University of Warwick | Min-Max Functions |
| 18 Nov 2008 | Kristina Vušković | University of Leeds | Even-hole-free Graphs and the Decomposition Method |
| 11 Nov 2008 | Piotr Krysta | University of Liverpool | Approximability of Combinatorial Exchange Problems |
| 4 Nov 2008 | Stefanie Gerke | Royal Holloway | Sensor Networks and Random Intersection Graphs |
| 28 Oct 2008 | Yves Crama | University of Liège | Throughput Optimization in Two-Machine Flowshops with Flexible Operations |
| 21 Oct 2008 | Stefan Szeider | Durham University | Tricky Problems for Graphs of Bounded Treewidth |
| 15 Oct 2008 | Jan van den Heuvel | London School of Economics | The External Network Problem and the Source Location Problem |
| 7 Oct 2008 | Andrew Thomason | University of Cambridge | Extremal Graph Theory with Colours |
| 30 Sep 2008 | Sinan Gürel | Warwick Business School | Machine-Job Assignment Problems with Separable Convex Costs and Match-up Scheduling with Controllable Processing Times |
| 22 Sep 2008 | Uri Zwick | Tel Aviv University | Discounted Deterministic Markov Decision Processes |
| 24 Jun 2008 | Haiko Müller | University of Leeds | On a Disparity Between Relative Cliquewidth and Relative NLC-width |
| 17 Jun 2008 | Tobias Müller | Universiteit Eindhoven | Colouring Random Geometric Graphs |
| 10 Jun 2008 | Jakub Mareček | University of Nottingham | A Clique-Based Integer Programming Formulation of Graph Colouring and Applications |
| 4 Jun 2008 | Richard Cole | New York University | Fast-Converging Tatonnement Algorithms for One-Time and Ongoing Market Problems |
| 29 May 2008 | Eli Upfal | Brown University | The Multi-Armed Bandit Meets the Web Surfer |
| 20 May 2008 | Peter Key | Microsoft Research | Optimizing Communication Networks: Incentives, Welfare Maximization and Multipath Transfers |
| 13 May 2008 | Andreas Bley | Zuse Institute Berlin | Unsplittable Shortest Path Routing: Hardness and Approximation Algorithms |
| 6 May 2008 | Sergey Nazarenko | University of Warwick | Diophantine Problems Arising in the Theory of Nonlinear Waves |
| 29 Apr 2008 | Ayalvadi Ganesh | University of Bristol | Controlling Epidemic Spread on Networks |
| 22 Apr 2008 | Bernhard von Stengel | London School of Economics | Strategic Characterization of the Index of an Equilibrium |
| 11 Mar 2008 | Paul Goldberg | University of Liverpool | On Recent Progress on Computing Approximate Nash Equilibria |
| 7 Mar 2008 | Matthias Englert | RWTH Aachen | Online Minimum Makespan Scheduling with Reordering |
| 4 Mar 2008 | Nicole Immorlica | CWI | Balloon Popping with Applications to Ascending Auctions |
| 26 Feb 2008 | Martin Dyer | University of Leeds | Randomly Colouring a Random Graph |
| 12 Feb 2008 | Vassili Kolokoltsov | University of Warwick | Game theoretic Approach to Hedging of Rainbow Options |
| 5 Feb 2008 | Wilfrid Kendall | University of Warwick | Short-length Routes in Low-cost Networks via Poisson Line Patterns |
| 29 Jan 2008 | Christian Sohler | University of Paderborn | Clustering for Metric and Non-Metric Distance Measures |
| 22 Jan 2008 | Alexander Tiskin | University of Warwick | The Travelling Salesman Problem: Are there any Open Problems left? Part II. |
| 15 Jan 2008 | Vladimir Deineko | University of Warwick | The Travelling Salesman Problem: Are there any Open Problems left? Part I. |
| 11 Dec 2007 | Arie Koster | University of Warwick | Improving Integer Programming Solvers: {0,½}-Chvátal-Gomory Cuts |
| 4 Dec 2007 | Peter Bro Miltersen | University of Aarhus | Strategic Game Playing and Equilibrium Refinements |
| 27 Nov 2007 | Mark Jerrum | Queen Mary | An Approximation Trichotomy for Boolean #CSP |
| 20 Nov 2007 | Vadim Lozin | University of Warwick | From Tree-width to Clique-width: Excluding a Unit Interval Graph |
| 13 Nov 2007 | Christian Raack | Zuse Institute Berlin | Cut-based Inequalities for Capacitated Network Design Problems |
| 6 Nov 2007 | Graham Brightwell | London School of Economics | Submodular Percolation and the Worm Order |
| 30 Oct 2007 | Marc Reimann | University of Warwick | Ant Colony Optimization for Vehicle Routing |
| 23 Oct 2007 | Gregory Gutin | Royal Holloway | Parameterized Algorithms for Directed Maximum Leaf Problems |
| 16 Oct 2007 | Harald Räcke | University of Warwick | Hierarchical Graph Decompositions for Minimising Congestion |
| 9 Oct 2007 | Mike Paterson | University of Warwick | Overhang Bounds |
| 19 Jul 2007 | Carl Seger | Intel | Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice |
| 28 Jun 2007 | Vadim Lozin | University of Warwick | Tree-width and Optimization in Bounded Degree Graphs |
| 29 May 2007 | Prahladh Harsha | TTI Chicago | A Survey of Short PCP Constructions |
| 3 May 2007 | Arie Koster | University of Warwick | Solved and Unsolved Optimization Challenges in Telecommunications |