| 2024 | 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, July 8-12, 2024 Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson |
| 2024 | A Characterization of Complexity in Public Goods Games. Matan Gilboa |
| 2024 | A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions. Wojciech Rozowski |
| 2024 | A Faster Algorithm for Pigeonhole Equal Sums. Ce Jin, Hongxun Wu |
| 2024 | A Finite Presentation of Graphs of Treewidth at Most Three. Amina Doumane, Samuel Humeau, Damien Pous |
| 2024 | A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. Vikraman Arvind, Pushkar S. Joglekar |
| 2024 | A Note on Approximating Weighted Nash Social Welfare with Additive Valuations. Yuda Feng, Shi Li |
| 2024 | A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi |
| 2024 | A Sublinear Time Tester for Max-Cut on Clusterable Graphs. Agastya Vibhuti Jha, Akash Kumar |
| 2024 | A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width. Narek Bojikian, Stefan Kratsch |
| 2024 | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | Adaptive Sparsification for Matroid Intersection. Kent Quanrud |
| 2024 | Additive Spanner Lower Bounds with Optimal Inner Graph Structure. Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu |
| 2024 | Algorithms for the Generalized Poset Sorting Problem. Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yuhao Zhang |
| 2024 | Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | Alphabet Reduction for Reconfiguration Problems. Naoto Ohsaka |
| 2024 | An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche |
| 2024 | An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs. Weiming Feng, Heng Guo |
| 2024 | An Improved Integrality Gap for Disjoint Cycles in Planar Graphs. Niklas Schlomberg |
| 2024 | An Improved Quantum Max Cut Approximation via Maximum Matching. Eunou Lee, Ojas Parekh |
| 2024 | An O(loglog n)-Approximation for Submodular Facility Location. Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jaroslaw Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely |
| 2024 | An Optimal Sparsification Lemma for Low-Crossing Matchings and Its Applications to Discrepancy and Approximations. Mónika Csikós, Nabil H. Mustafa |
| 2024 | An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. Antoine Mottet, Tomás Nagy, Michael Pinsker |
| 2024 | Another Hamiltonian Cycle in Bipartite Pfaffian Graphs. Andreas Björklund, Petteri Kaski, Jesper Nederlof |
| 2024 | Approximate Counting for Spin Systems in Sub-Quadratic Time. Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Jiaheng Wang |
| 2024 | Approximation Algorithms for 𝓁 Yury Makarychev, Max Ovsiankin, Erasmo Tani |
| 2024 | Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese |
| 2024 | Automata-Theoretic Characterisations of Branching-Time Temporal Logics. Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron |
| 2024 | BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting. Sevag Gharibian, Jonas Kamminga |
| 2024 | Bayesian Calibrated Click-Through Auctions. Junjie Chen, Minming Li, Haifeng Xu, Song Zuo |
| 2024 | Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity. Yaowei Long, Yunfan Wang |
| 2024 | Better Space-Time-Robustness Trade-Offs for Set Reconciliation. Djamal Belazzougui, Gregory Kucherov, Stefan Walzer |
| 2024 | Better Sparsifiers for Directed Eulerian Graphs. Sushant Sachdeva, Anvith Thudi, Yibin Zhao |
| 2024 | Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle. Aaron Potechin, Aaron Zhang |
| 2024 | Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | Caching Connections in Matchings. Yaniv Sadeh, Haim Kaplan |
| 2024 | Computing Tree Decompositions with Small Independence Number. Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number. Boris Klemz, Marie Diana Sieper |
| 2024 | Cross-Paradigm Graph Algorithms (Invited Talk). Danupon Nanongkai |
| 2024 | Cut Sparsification and Succinct Representation of Submodular Hypergraphs. Yotam Kenneth, Robert Krauthgamer |
| 2024 | Decidability of Graph Neural Networks via Logical Characterizations. Michael Benedikt, Chia-Hsuan Lu, Boris Motik, Tony Tan |
| 2024 | Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers. Paul Gallot, Sebastian Maneth, Keisuke Nakano, Charles Peyrat |
| 2024 | Decremental Matching in General Weighted Graphs. Aditi Dudeja |
| 2024 | Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces. Christophe Paul, Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht |
| 2024 | Detecting Disjoint Shortest Paths in Linear Time and More. Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein |
| 2024 | Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication. Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski |
| 2024 | Domain Reasoning in TopKAT. Cheng Zhang, Arthur Azevedo de Amorim, Marco Gaboardi |
| 2024 | Dynamic PageRank: Algorithms and Lower Bounds. Rajesh Jayaram, Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
| 2024 | Edit Distance of Finite State Transducers. C. Aiswarya, Amaldev Manuel, Saina Sunny |
| 2024 | Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr. |
| 2024 | Exponential Lower Bounds via Exponential Sums. Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, Saswata Mukherjee |
| 2024 | FO Logic on Cellular Automata Orbits Equals MSO Logic. Guillaume Theyssier |
| 2024 | Fast Approximate Counting of Cycles. Keren Censor-Hillel, Tomer Even, Virginia Vassilevska Williams |
| 2024 | Faster Algorithms for Dual-Failure Replacement Paths. Shiri Chechik, Tianyi Zhang |
| 2024 | Finding Most-Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time. Kevin Hua, Daniel Li, Jaewoo Park, Thatchaphol Saranurak |
| 2024 | Finer-Grained Reductions in Fine-Grained Hardness of Approximation. Elie Abboud, Noga Ron-Zewi |
| 2024 | Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. Mohan Dantam, Richard Mayr |
| 2024 | Flattability of Priority Vector Addition Systems. Roland Guttenberg |
| 2024 | Forcing, Transition Algebras, and Calculi. Hashimoto Go, Daniel Gaina, Ionut Tutu |
| 2024 | From Proof Complexity to Circuit Complexity via Interactive Protocols. Noel Arteche, Erfan Khaniki, Ján Pich, Rahul Santhanam |
| 2024 | From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP. Leonid Gurvits, Nathan Klein, Jonathan Leake |
| 2024 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2024 | Fully Dynamic Strongly Connected Components in Planar Digraphs. Adam Karczmarz, Marcin Smulewicz |
| 2024 | Fully-Scalable MPC Algorithms for Clustering in High Dimension. Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, Pavel Veselý |
| 2024 | Function Spaces for Orbit-Finite Sets. Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski |
| 2024 | Functional Closure Properties of Finite ℕ-Weighted Automata. Julian Dörfler, Christian Ikenmeyer |
| 2024 | Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski |
| 2024 | Graphs Shortcuts: New Bounds and Algorithms (Invited Talk). Merav Parter |
| 2024 | Group Fairness: Multiwinner Voting and Beyond (Invited Talk). Edith Elkind |
| 2024 | High-Accuracy Multicommodity Flows via Iterative Refinement. Li Chen, Mingquan Ye |
| 2024 | Homogeneity and Homogenizability: Hard Problems for the Logic SNP. Jakub Rydval |
| 2024 | Identifying Tractable Quantified Temporal Constraints Within Ord-Horn. Jakub Rydval, Zaneta Semanisinová, Michal Wrona |
| 2024 | Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity. Zhenjian Lu, Rahul Santhanam |
| 2024 | Improved Algorithm for Reachability in d-VASS. Yuxi Fu, Qizhe Yang, Yangluo Zheng |
| 2024 | Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH. Shuangle Li, Bingkai Lin, Yuwei Liu |
| 2024 | Integer Linear-Exponential Programming in NP by Quantifier Elimination. Dmitry Chistikov, Alessio Mansutti, Mikhail R. Starchak |
| 2024 | Isomorphism for Tournaments of Small Twin Width. Martin Grohe, Daniel Neuen |
| 2024 | It's Hard to HAC Average Linkage! MohammadHossein Bateni, Laxman Dhulipala, Kishen N. Gowda, D. Ellis Hershkowitz, Rajesh Jayaram, Jakub Lacki |
| 2024 | Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations. Marin Bougeret, Bart M. P. Jansen, Ignasi Sau |
| 2024 | Learning Low-Degree Quantum Objects. Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, Carlos Palazuelos |
| 2024 | Limits of Sequential Local Algorithms on the Random k-XORSAT Problem. Kingsley Yung |
| 2024 | Limits of Symmetric Computation (Invited Talk). Anuj Dawar |
| 2024 | Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error. Guy Goldberg |
| 2024 | Lipschitz Continuous Allocations for Optimization Games. Soh Kumabe, Yuichi Yoshida |
| 2024 | List Update with Delays or Time Windows. Yossi Azar, Shahar Lewkowicz, Danny Vainstein |
| 2024 | Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata. Rohan Acharya, Marcin Jurdzinski, Aditya Prakash |
| 2024 | Low-Memory Algorithms for Online Edge Coloring. Prantar Ghosh, Manuel Stoeckl |
| 2024 | Lower Bounds for Matroid Optimization Problems with a Linear Constraint. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2024 | Lower Bounds on 0-Extension with Steiner Nodes. Yu Chen, Zihan Tan |
| 2024 | Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. Yasushi Kawase, Koichi Nishimura, Hanna Sumita |
| 2024 | Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. Nick Fischer, Leo Wennmann |
| 2024 | NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha |
| 2024 | Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. Holger Dell, John Lapinskas, Kitty Meeks |
| 2024 | New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. Michal Dory, Sebastian Forster, Yasamin Nazari, Tijn de Vos |
| 2024 | No Polynomial Kernels for Knapsack. Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
| 2024 | Non-Linear Paging. Ilan Doron-Arad, Joseph (Seffi) Naor |
| 2024 | On Classes of Bounded Tree Rank, Their Interpretations, and Efficient Sparsification. Jakub Gajarský, Rose McCarty |
| 2024 | On Homomorphism Indistinguishability and Hypertree Depth. Benjamin Scheidt |
| 2024 | On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words. Pavol Kebis, Florian Luca, Joël Ouaknine, Andrew Scoones, James Worrell |
| 2024 | On the Cut-Query Complexity of Approximating Max-Cut. Orestis Plevrakis, Seyoon Ragavan, S. Matthew Weinberg |
| 2024 | On the Length of Strongly Monotone Descending Chains over ℕ^d. Sylvain Schmitz, Lia Schütze |
| 2024 | On the Smoothed Complexity of Combinatorial Local Search. Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos |
| 2024 | On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. Tsvi Kopelowitz, Ariel Korin, Liam Roditty |
| 2024 | On the Streaming Complexity of Expander Decomposition. Yu Chen, Michael Kapralov, Mikhail Makarov, Davide Mazzali |
| 2024 | One-Way Communication Complexity of Partial XOR Functions. Vladimir V. Podolskii, Dmitrii Sluch |
| 2024 | Optimal Bounds for Distinct Quartics. Panagiotis Charalampopoulos, Pawel Gawrychowski, Samah Ghazawi |
| 2024 | Optimal Electrical Oblivious Routing on Expanders. Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva |
| 2024 | Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, Or Zamir |
| 2024 | Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration. Shuichi Hirahara, Naoto Ohsaka |
| 2024 | Oracle Separation of QMA and QCMA with Bounded Adaptivity. Shalev Ben-David, Srijita Kundu |
| 2024 | Oracle-Augmented Prophet Inequalities. Sariel Har-Peled, Elfarouk Harb, Vasilis Livanos |
| 2024 | Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan |
| 2024 | Parameterized Algorithms for Steiner Forest in Bounded Width Graphs. Andreas Emil Feldmann, Michael Lampis |
| 2024 | Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase |
| 2024 | Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. Shiri Chechik, Tianyi Zhang |
| 2024 | Polylogarithmic Approximations for Robust s-t Path. Shi Li, Chenyang Xu, Ruilong Zhang |
| 2024 | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | Problems on Group-Labeled Matroid Bases. Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz |
| 2024 | Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems. Serge Gaspers, Jerry Zirui Li |
| 2024 | Random Separating Hyperplane Theorem and Learning Polytopes. Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar |
| 2024 | Refuting Approaches to the Log-Rank Conjecture for XOR Functions. Hamed Hatami, Kaave Hosseini, Shachar Lovett, Anthony Ostuni |
| 2024 | Regular Expressions with Backreferences and Lookaheads Capture NLOG. Yuya Uezato |
| 2024 | Robot Positioning Using Torus Packing for Multisets. Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta |
| 2024 | Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche |
| 2024 | Sharp Noisy Binary Search with Monotonic Probabilities. Lucas Gretta, Eric Price |
| 2024 | Simultaneously Approximating All 𝓁 Sami Davies, Benjamin Moseley, Heather Newman |
| 2024 | Smoothed Analysis of Deterministic Discounted and Mean-Payoff Games. Bruno Loff, Mateusz Skomra |
| 2024 | Solution Discovery via Reconfiguration for Problems in P. Mario Grobler, Stephanie Maaz, Nicole Megow, Amer E. Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand, Sebastian Siebertz |
| 2024 | Solving Promise Equations over Monoids and Groups. Alberto Larrauri, Stanislav Zivný |
| 2024 | Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games. Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand, Giovanna Varricchio |
| 2024 | Splitting-Off in Hypergraphs. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni |
| 2024 | Streaming Algorithms for Connectivity Augmentation. Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian |
| 2024 | Streaming Edge Coloring with Asymptotically Optimal Colors. Mohammad Saneian, Soheil Behnezhad |
| 2024 | Streaming Edge Coloring with Subquadratic Palette Size. Shiri Chechik, Doron Mukhtar, Tianyi Zhang |
| 2024 | Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma |
| 2024 | Sublinear Algorithms for TSP via Path Covers. Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi |
| 2024 | Subquadratic Submodular Maximization with a General Matroid Constraint. Yusuke Kobayashi, Tatsuya Terao |
| 2024 | T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations. Raphael Douglas Giles, Vincent Jackson, Christine Rizkallah |
| 2024 | Testing C_k-Freeness in Bounded-Arboricity Graphs. Talya Eden, Reut Levi, Dana Ron |
| 2024 | Testing Spreading Behavior in Networks with Arbitrary Topologies. Augusto Modanese, Yuichi Yoshida |
| 2024 | The 2-Dimensional Constraint Loop Problem Is Decidable. Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine, James Worrell |
| 2024 | The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang |
| 2024 | The Complexity of Computing in Continuous Time: Space Complexity Is Precision. Manon Blanc, Olivier Bournez |
| 2024 | The Discrepancy of Shortest Paths. Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang |
| 2024 | The Group Access Bounds for Binary Search Trees. Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai |
| 2024 | The Structure of Trees in the Pushdown Hierarchy. Arnaud Carayol, Lucien Charamond |
| 2024 | The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters. George Kenison |
| 2024 | The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. Sophia Heimann, Hung P. Hoang, Stefan Hougardy |
| 2024 | Tight Bounds on Adjacency Labels for Monotone Graph Classes. Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 2024 | Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski |
| 2024 | Towards an Analysis of Quadratic Probing. William Kuszmaul, Zoe Xi |
| 2024 | Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents. Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider, Simon Weber |
| 2024 | Two-Sets Cut-Uncut on Planar Graphs. Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen |
| 2024 | Two-Source and Affine Non-Malleable Extractors for Small Entropy. Xin Li, Yan Zhong |
| 2024 | Verification of Population Protocols with Unordered Data. Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy |
| 2024 | Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems. Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, Stéphan Thomassé |
| 2024 | Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. Surender Baswana, Koustav Bhanja |
| 2024 | Õptimal Dynamic Time Warping on Run-Length Encoded Strings. Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann |