Research Talks

List of Research Talks

∎ On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
(Broadcasting and Gossiping in Graphs mini-symposium)
CanaDAM 2025, May 2025 (planned)

∎ Robust Learning-Augmented Dictionaries
Paris LIP6 Seminar, April 2024.

∎ Online Interval Scheduling with Predictions
The 18th Algorithms and Data Structures Symposium (WADS), Aug. 2023.

∎ Improved Algorithms for Burning Planar Point Sets
The 35th Canadian Conference on Computational Geometry (CCCG), Aug. 2023.

∎ A Review of Online Bin Packing with Advice and Prediction
University of Massachusetts Amherst, Oct. 2022. 

∎ Graph Burning (Summer School)
Graph Searching in Canada (GRASCan) Summer School, Aug. 2022.

∎ Online Bin Packing with Predictions
The Thirty-First International Joint Conference on Artificial Intelligence (IJCAI), Jul. 2022.

∎ Online Algorithms: A Journey from Theory to Practice.
Paris LIP6 Seminars, May 2022.

∎ A Review of the Graph Burning Problem.
The 10th Workshop on GRAph Searching, Theory and Applications (GRASTA), May 2022.

∎ Online Algorithms with Predictions.
MIT Supertech seminar, Nov. 2021.

∎ Algorithms for Burning Graph Families.
Combinatorics Seminar, University of Manitoba, Dept. of Mathematics, Oct. 2021,
Graph Searching in Canada (GRASCan), Aug. 2021.

∎ Online Bin Packing with Predictions.
Bin Packing Seminar Series, Apr. 2021.

∎ Advice in the context of some geometric problems
Online Algorithms with Advice and Related Models (OLAWA@MFCS), Aug. 2020.

∎ Lossless Image Compression Using List Update Algorithms
International Symposium on String Processing and Information Retrieval (SPIRE), Oct. 2019.

∎ On the Complexity of Burning and Broadcasting Problems.
Graph Searching in Canada (GRASCan), Aug. 2019.

∎ Online bin Covering with Advice.
Algorithms and Data Structures Symposium (WADS), Aug. 2019.

∎ Approximation Algorithms for Burning Graphs.
Canadian Mathematical Society Meeting in Regina (CMS Summer Meeting), Jun. 2019.

∎ A Review of Telephone Broadcast Problem [slides]
University of Manitoba, Dept. of Mathematics Combinatorics Seminar, Nov. 2018.

∎ Online Bin Covering with Advice
Modern Online Algorithms Workshop (MOLI), Satellite Workshop of International Colloquium on Automata, Languages and Programming (ICALP), July 2018.

∎ Online k-server Problem: Recent Developments and Applications.
University of Manitoba, Dept. of Mathematics Combinatorics Seminar, Dec. 2017.

∎ Compact Navigation Oracles for Graphs with Bounded Clique-Width.
Data Compression Conference (DCC), Mar. 2016.

∎ List Update Problem and Compression: a Review, MIT SuperTech Seminar, Nov. 2016.

∎ Online Bin Packing: Recent Developments and Applications, MIT SuperTech Seminar, Oct. 2016.

∎ All-around Near-optimal Solutions for the Classic Bin Packing Problem
International Symposium on Algorithms and Computation (ISAAC), Dec. 2015.

∎ Efficient Bin Packing Algorithms for Resource Provisioning in the Cloud
International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD, in ALGO), Sept. 2015.

∎ Online Bin Packing with Advice of Small Size
Algorithms and Data Structures Symposium (WADS), Aug. 2015.

∎ Online Packing of Equilateral Triangles
Canadian Conference on Computational Geometry (CCCG), Aug. 2015.

∎ Hermes: Dynamic Partitioning for Distributed Social Network Graph Databases
International Conference on Extending Database Technology (EDBT), Mar. 2015.

∎ Online Bin Packing Problem: Alternative Analysis Methods and New Applications
ACO seminar, Carnegie Mellon University, Mar. 2015.

∎ Efficient Online Strategies for Renting Servers in the Cloud.
International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan. 2015.

∎ Online Bin Packing Algorithms for Resource Allocation in the Cloud.
Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA), Universite Paris Diderot - Paris 7, Oct. 2014.

∎ Online Bin Packing Problem: Recent Developments and Applications.
Laboratoire d'Informatique de Paris 6 (LIP6), Pierre-and-Marie-Curie University, Oct. 2014.

∎ Almost Online Square Packing.
Canadian Conference on Computational Geometry (CCCG), Aug. 2014.

∎ Online Fault-Tolerant Server Consolidation Problem.
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Jun. 2014.

∎ Better Compression through Better List Update Algorithms.
Data Compression Conference (DCC), Apr. 2014.

∎ Online Bin Packing with Advice.
International Symposium on Theoretical Aspects of Computer Science (STACS), Mar. 2014.

∎ On the List Update Problem with Advice.
International Conference on Language and Automata Theory and Applications (LATA), Mar. 2014.

∎ Online Bin Packing Problem: Recent Developments and Advice Complexity.
Algorithms and Complexity Seminar, University of Waterloo, Aug. 2013.

∎ Data Partitioning for Video-on-Demand Services.
International Symposium on Network Computing and Applications (NCA), Aug. 2013.

∎ k-Server Problem: Recent Developments and Advice Complexity.
Algorithms and Complexity Seminar, University of Waterloo, Jul. 2013

∎ On Advice Complexity of the k-server Problem under Sparse Metrics.
International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jul. 2013.

∎ Broadcasting in Conflict Aware Multi-Channel Networks.
International Workshop on Algorithms and Computation (WALCOM), Feb. 2013.

∎ Compact Navigation and Distance Oracles for Graphs with Small Treewidth.
International Colloquium on Automata, Languages and Programming (ICALP), Jul. 2011.

∎ Dynamic Data Allocation with Replication in Distributed Systems.
International Performance Computing and Communications Conference (IPCCC), Nov. 2011.

∎ Dynamic Positioning Based on Voronoi Cells (DPVC).
RoboCup International Symposium (RoboCup), Aug. 2005.