Algorithms @ UNSW

Seminar series

We recommend the following online seminar series

• AI-based Optimisation: seminar series
• COMSOC Video Seminar: international seminar series on social choice
• CMSA seminars by the Combinatorial Mathematics Society of Australasia
• Frontiers of Parameterized Complexity
• MD4SG: Mechanism Design for Social Good
• Oxford Discrete Mathematics and Probability Seminar
• Online Social Choice and Welfare Seminar Series
• Sydney algorithms group (USYD) seminar

Algorithms talks at UNSW

2021

• Serge Gaspers. Graph algorithms for intractable vertex-subset problems
  Online, Tue 30 Mar 2021 12:00.
• Arindam Pal. AI for Legal Data Analytics: From Text to Citation Networks and Beyond
  AI seminar, UNSW, online. Fri 19 Mar 2021 14:00.
• Sophie Spirkl. The Erdos-Hajnal conjecture for the five-cycle
  Online, Wed 03 Mar 2021 11:30.
• Joanna Batstone. AI for Social Good
  AI seminar, UNSW, online. Thu 25 Feb 2021 12:30.
• Visu Makam. Interactions between invariant theory and complexity theory
  Online, Thu 25 Feb 2021 12:00.
• Fahimeh Ramezani. Multi-Robot Task Allocation - Complexity and Approximation.
  Online, Tue 23 Feb 2021 15:00.
• Rosalind Cameron. Surrounding cops and robber: a vertex-pursuit game
  Combinatorics seminar, UNSW, online. Wed 17 Feb 2021 11:30.
• Simon Mackenzie. The Direct Sum Question in Communication Complexity.
  Online, Tue 16 Feb 2021 15:00.

2020

• Andrew Kaploun. Faster Algorithms for Weak Backdoors for 3CNF formulas.
  Online, Tue 03 Nov 2020 15:00.
• Ariel Kulik. Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
  Online, Tue 13 Oct 2020 17:00.
• Haris Aziz. The Vigilant Eating Rule: A General Approach For Probabilistic Economic Design With Constraints.
  AI seminar, UNSW, online. Fri 09 Oct 2020 14:00.
• Toby Walsh. Fair Division in the Wild: from food banks to organ banks.
  AI seminar, UNSW, online. Fri 07 Aug 2020 12:00.
• Xiaohui Bei. Fair Division of Mixed Divisible and Indivisible Goods
  K17, seminar room 113, Tue 10 Mar 2020 14:00.
• Michael Kaminski. Tutorial on Finite-memory automata
  K17, seminar room 113, Fri 21 Feb 2020 14:00.

2019

• 42ACCMCC. We organised the 42nd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing at UNSW Sydney, 9-13 Dec 2019.
• Marcin Pilipczuk. Packing Directed Circuits Quarter-Integrally
  The Red Centre, room RC-2063, Thu 05 Dec 2019 13:00.
• Martin Golumbic. Scrumptious Sandwich Problems: A Tasty Retrospective for Before Lunch
  The Red Centre, room RC-2063, Thu 10 Oct 2019 11:00.
• Martin Golumbic. The Wonderful World of Chordal Graphs
  K17, seminar room 113, Thu 19 Sep 2019 14:00.
• Nina Narodytska. Assessing Heuristic Machine Learning Explanations with Model Counting
  K17, seminar room 113, Fri 09 Aug 2019 11:00.
• Ali Pourmiri. Ultra-Fast Asynchronous Rumor Spreading.
  K17, meeting room 302, Tue 30 Jul 2019 15:00.
• David Harvey. Integer multiplication in time O(n log n).
  The Red Centre, room RC-4082, Tue 07 May 2019 12:00.
• Ágnes Cseh. Popular Matchings in Complete Graphs.
  The Red Centre, room RC-3085, Wed 24 Apr 2019 12:00.
• Zhaohong Sun. From matching with diversity constraints to matching with regional quotas.
  K17, meeting room 302, Tue 09 Apr 2019 15:00.
• Ali Dorri. A primer on Blockchain.
  K17, meeting room 302, Tue 02 Apr 2019 15:00.
• Begoña Subiza. Sharing the cost of maximum quality optimal spanning trees.
  K17, meeting room 302, Tue 26 Mar 2019 15:00.
• Simon Rey. Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods.
  K17, meeting room 302, Tue 26 Feb 2019 15:00.

2018

• William Umboh. Online network design algorithms via hierarchical decompositions.
  K17, meeting room 302, Fri 16 Nov 2018 11:30.
• Martin Hoefer. Approximation Algorithms for Nash Social Welfare.
  K17, seminar room 113, Tue 11 Sep 2018 14:00.
• The 2018 Sydney Algorithms Day happened on 25 Jun 2018, Lecture Theatre 123, School of IT, University of Sydney.
• Ayumi Igarashi. Fair division of a graph.
  K17, seminar room 113, Thu 17 May 2018 14:00
• Serge Gaspers. Eternal Domination.
  K17, meeting room 302, Tue 15 May 2018 15:00.
• Abdallah Saffidine. The Complexity of Hex and Connection Games (or how to use Logic to refute a 20-year-old conjecture).
  K17, conference room 113, Tue 01 May 2018 16:00.
• Amin Coja-Oghlan. Phase transitions in discrete structures.
  K17, conference room 113, Tue 01 May 2018 15:00.
• Vicky Mak-Hau. Solving hard combinatorial optimisation problems.
  K17, conference room 113, Tue 01 May 2018 10:30.
• Zhaohong Sun. Feasibility and stability in matching with distributional constraints.
  K17, meeting room 302, Fri 27 Apr 2018 11:00.
• Xin Huang. Recent Development of Fair Division of Indivisible Items.
  K17, meeting room 302, Fri 23 Mar 2018 11:00.

2017

• Barton Lee. Achieving Proportional Representation via Voting.
  K17, meeting room 302, Fri 15 Dec 2017 11:00.
• Tamás Mészáros. A semi-random construction of small covering arrays.
  The Red Centre, room RC-4082, Mon 11 Dec 2017 11:00.
• Johann Makowsky. Integer sequences arising from graph polynomials: an application of a theorem by C. Blatter and E. Specker.
  The Red Centre, room RC-4082, Mon 20 Nov 2017 14:00.
• Michela Castagnone. Algorithms for generating uniformly random graphs.
  Old Main Building room 150, Fri 13 Oct 2017 12:00.
• Ahuva Mu'alem. From Game Theory to Cloud Computing: Theoretical and Experimental Perspectives.
  K17 (School of Computer Science and Engineering), meeting room 302, Fri 29 Sep 2017 11:00.
• Lirong Xia. Multi-Type Resource Allocation.
  K17 (School of Computer Science and Engineering), conference room 113, Thu 17 Aug 2017 14:00.
• Nina Narodytska. Adversarial Examples for Neural Networks.
  K17 (School of Computer Science and Engineering), meeting room 302, Fri 11 Aug 2017 11:00.
• Nicholas Cavenagh. Constructing (0,1)-matrices with large minimal defining sets.
  The Red Centre, room RC-4082, Tue 08 Aug 2017 13:00.
• Dirk P. Kroese. Counting via Stochastic Enumeration.
  The Red Centre, room M020, Mon 07 Aug 2017 14:00.
• Mathias Weller. Algorithms for Phylogenetic Trees.
  K17 (School of Computer Science and Engineering), seminar room 113, Wed 27 Jul 2017 16:30.
• Edward Lee. Fast Exponential-time Algorithms via Multivariate Subroutines.
  K17 (School of Computer Science and Engineering), conference room 313, Fri 05 May 2017 11:00.
• Shenwei Huang. Colouring (cap, even hole)-free graphs.
  The Red Centre building (Centre Wing), room RC-4082, Thu 13 Apr 2017 13:00.
• Toby Walsh. Deceased Organ Matching.
  UNSW Business School, room 205, Mon 09 Apr 2017 12:00.
• Ana Zumalacarregui. Threshold functions for systems of equations in random sets.
  The Red Centre building (Centre Wing), room RC-4082, Thu 06 Apr 2017 15:00.
• Catherine Greenhill. Hamilton cycles in random hypergraphs.
  The Red Centre building (Centre Wing), room RC-4082, Tue 04 Apr 2017 13:00.
• Changhao Chen. Projections in vector spaces over finite fields.
  The Red Centre building (Centre Wing), room RC-4082, Thu 23 Mar 2017 13:00.
• Haris Aziz. Justified Representation in Approval-Based Committee Voting.
  K17 (School of Computer Science and Engineering), conference room 313, Fri 03 Mar 2017 11:00.
• Frank Stephan. Deciding parity games in quasipolynomial time.
  K17 (School of Computer Science and Engineering), conference room 313, Fri 17 Feb 2017 11:00.
• Kamran Najeebullah. Network Destruction by Minimizing Inverse Geodesic Length.
  K17 (School of Computer Science and Engineering), conference room 313, Fri 10 Feb 2017 11:00.

2016

• Bettina Klaus. Non-Revelation Mechanisms for Many-to-Many Matching: Equilibria versus Stability.
  K17 (School of Computer Science and Engineering), conference room 313, Fri 30 Sep 2016 11:00.
• Antonin Lambilliotte. On The Parameterized Complexity on Some Games Played on Graphs
  K17 (School of Computer Science and Engineering), conference room 313, Fri 26 Aug 2016 11:00.
• Abdallah Saffidine. On the Complexity of Connection Games
  K17 (School of Computer Science and Engineering), meeting room 302, Fri 15 Apr 2016 11:00.
• Enrico Gerding. Online Mechanism Design and Vehicle-to-Grid: Algorithms with ex-post monotonicity
  K17 (School of Computer Science and Engineering), meeting room 302, Fri 11 Mar 2016 11:00.
• Ronald de Haan. Parameterized Complexity of Problems in the Polynomial Hierarchy
  K17 (School of Computer Science and Engineering), meeting room 302, Fri 04 Mar 2016 11:00.
• Enrico Gerding. Minimising the Rank Aggregation Error
  K17 (School of Computer Science and Engineering), meeting room 302, Thu 03 Mar 2016 15:30.
• Iris van de Pol. Cognition and Complexity
  K17 (School of Computer Science and Engineering), meeting room 302, Thu 03 Mar 2016 15:00.
• Ronald de Haan. Using Parameterized Complexity to Analyze Problems Beyond NP
  K17 (School of Computer Science and Engineering), seminar room 113, Tue 23 Feb 2016 16:00.

2015

• Benjamin Edser. The Hospitals/Residents Problem with Couples: Algorithms and Complexity
  G4 (Blockhouse), level 2 meeting room, Mon 21 Dec 2015 15:00.
• Stefan Rümmele. On the Parameterized Complexity of Abduction
  G4 (Blockhouse), level 2 meeting room, Fri 11 Dec 2015 12:00.
• Serge Gaspers. Exact Algorithms via Monotone Local Search.
  K17 (School of Computer Science and Engineering), seminar room 113, Thu 26 Nov 2015 14:00.
• Serge Gaspers. Exact Algorithms via Monotone Local Search.
  G4 (Blockhouse), level 2 meeting room, Fri 13 Nov 2015 12:00.
• Gerhard Rauchecker. Unrelated Parallel Machine Scheduling with Sequence-and-Machine-Dependent Setup Times: An Exact Branch-and-Price Algorithm and its Parallel Implementation on HPC Systems.
  G4 (Blockhouse), level 2 meeting room, Fri 04 Sep 2015 12:00.
• Martin Aleksandrov. Online Fair Division: Analysing a Foodbank Problem.
  G4 (Blockhouse), level 2 meeting room, Fri 14 Aug 2015 12:00.
• Catherine Greenhill. The Switch Markov Chain for Sampling Irregular Graphs.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 19 Jun 2015 12:00.
• David Harvey. Even faster integer multiplication.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 22 May 2015 12:00.
• Hubert Chan. Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 24 Apr 2015 12:00.
• Pål Grønås Drange. The square root phenomenon in H-free edge modification problems.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 13 Mar 2015 12:00.
• Omer Lev. The Big Equilibria Cull: Advances in the Effort to Make Nash Equilibria Relevant for Voting Games.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 27 Feb 2015 12:00.
• Amin Coja-Oghlan. Local convergence of random graph colourings.
  H13 (Red Centre, centre wing), RC-4082, Thu 26 Feb 2015 12:00.
• Milind Tambe. Towards a Science of Security Games: Key Algorithmic Principles, Deployed Applications and Research Challenges.
  L5 (223 Anzac Parade), level 4 seminar room, Mon 16 Feb 2015 11:00.
• Kai Wang. Dynamic Dominating Set Experimental Analysis and an Improvement.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 16 Jan 2015 12:45.
• Peter Shaw. Parameterization in The Service of Heuristics for Practical Computing.
  L5 (223 Anzac Parade), level 4 seminar room, Fri 16 Jan 2015 12:00.

2014

• Kevin Leyton-Brown. Beyond Equilibrium: Predicting Human Behavior in Normal Form Games.
  L5, level 4 boardroom, Tue 16 Dec 2014 12:00.
• Bettina Klaus. Strategy-Proofness makes the Difference: Deferred-Acceptance with Responsive Priorities.
  L5, level 4 boardroom, Thu 07 Aug 2014 12:00.
• Omer Gold. Coping with Physical Attacks on Random Network Structures.
  K17, CSE seminar room 113, Fri 13 Jun 2014 15:00.
• Mathias Weller. Parameterized Certificate Dispersal and its Variants.
  K17, CSE seminar room 113, Wed 21 May 2014 14:00.
• Simon Mackenzie. Fair Assignment Of Indivisible Objects Under Ordinal Preferences.
  L5, level 6 meeting room, Wed 20 Apr 2014 16:00.
• Gábor Erdélyi. Manipulative Attacks Under Voting-Rule Uncertainty.
  L5, level 4 boardroom, Thu 13 Mar 2014 11:00.
• Paul Stursberg. Vehicle Routing with Containers.
  L5, level 1 seminar room, Fri 17 Jan 2014 12:00.
• Abdallah Saffidine. Overview talk on the exciting world of combinatorial games.
  L5, level 4 board room, Thu 16 Jan 2014 11:00.

2013

• Serge Gaspers. Augmenting Graphs to Minimize the Diameter.
  L5, level 1 seminar room, Fri 13 Dec 2013 12:00.
• Abdallah Saffidine. The Complexity of General Game Playing.
  K17, level 3 meeting room, Thu 21 Nov 2013 14:00.