Abstract is missing.
- Property Testing of LP-Type ProblemsRogers Epstein, Sandeep Silwal. [doi]
- Conditionally Optimal Approximation Algorithms for the Girth of a Directed GraphMina Dalirrooyfard, Virginia Vassilevska Williams. [doi]
- Counting Perfect Matchings and the Eight-Vertex ModelJin-yi Cai, Tianyu Liu. [doi]
- On Higher-Order CryptographyBoaz Barak, Raphaëlle Crubillé, Ugo Dal Lago. [doi]
- Succinct Filters for Sets of Unknown SizesMingmou Liu, Yitong Yin, Huacheng Yu. [doi]
- Timed Games and Deterministic SeparabilityLorenzo Clemente, Slawomir Lasota 0001, Radoslaw Piórkowski. [doi]
- Optimal Streaming Algorithms for Submodular Maximization with Cardinality ConstraintsNaor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, Andrew Suh. [doi]
- The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid MorphismsLaura Ciobanu, Alan D. Logan. [doi]
- The Complexity of Bounded Context Switching with Dynamic Thread CreationPascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche. [doi]
- Faster Minimization of Tardy Processing Time on a Single MachineKarl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz. [doi]
- Hard Problems on Random GraphsJan Dreier, Henri Lotze, Peter Rossmanith. [doi]
- Hitting Long Directed Cycles Is Fixed-Parameter TractableAlexander Göke, Dániel Marx, Matthias Mnich. [doi]
- On Packing Low-Diameter Spanning TreesJulia Chuzhoy, Merav Parter, Zihan Tan. [doi]
- Sparse Recovery for Orthogonal Polynomial TransformsAnna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters. [doi]
- Near Optimal Algorithm for the Directed Single Source Replacement Paths ProblemShiri Chechik, Ofer Magen. [doi]
- A Scaling Algorithm for Weighted f-Factors in General GraphsRan Duan, Haoqing He, Tianyi Zhang 0008. [doi]
- Rational Subsets of Baumslag-Solitar GroupsMichaël Cadilhac, Dmitry Chistikov, Georg Zetzsche. [doi]
- Hardness Results for Constant-Free Pattern Languages and Word EquationsAleksi Saarela. [doi]
- Can Verifiable Delay Functions Be Based on Random Oracles?Mohammad Mahmoody, Caleb Smith, David J. Wu. [doi]
- An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk)Andrew Chi-Chih Yao. [doi]
- Improved Black-Box Constructions of Composable Secure ComputationRohit Chatterjee, Xiao Liang, Omkant Pandey. [doi]
- Obviously Strategyproof Single-Minded Combinatorial AuctionsBart de Keijzer, Maria Kyropoulou, Carmine Ventre. [doi]
- Decision Problems in Information TheoryMahmoud Abo Khamis, Phokion G. Kolaitis, Hung Q. Ngo 0001, Dan Suciu. [doi]
- Counting Solutions to Random CNF FormulasAndreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang. [doi]
- Cryptographic Reverse Firewalls for Interactive Proof SystemsChaya Ganesh, Bernardo Magri, Daniele Venturi 0001. [doi]
- An Optimal Algorithm for Online Multiple KnapsackMarcin Bienkowski, Maciej Pacut, Krzysztof Piecuch. [doi]
- A Spectral Bound on Hypergraph DiscrepancyAditya Potukuchi. [doi]
- On Decidability of Time-Bounded Reachability in CTMDPsRupak Majumdar, Mahmoud Salamati, Sadegh Soudjani. [doi]
- Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small TreewidthMartin Fürer, Carlos Hoppen, Vilmar Trevisan. [doi]
- Computation of Hadwiger Number and Related Contraction Problems: Tight Lower BoundsFedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh 0001, Meirav Zehavi. [doi]
- On Polynomial Recursive SequencesMichaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues. [doi]
- Popular Matchings with One-Sided BiasTelikepalli Kavitha. [doi]
- Graph Isomorphism in Quasipolynomial Time Parameterized by TreewidthDaniel Wiebking. [doi]
- Proportionally Fair Clustering RevisitedEvi Micha, Nisarg Shah 0001. [doi]
- On the Power of Ordering in Linear Arithmetic TheoriesDmitry Chistikov, Christoph Haase. [doi]
- Medians in Median Graphs and Their Cube Complexes in Linear TimeLaurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès. [doi]
- Spectral Sparsification via Bounded-Independence SamplingDean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman. [doi]
- On Solving (Non)commutative Weighted Edmonds' ProblemTaihei Oki. [doi]
- Space Efficient Construction of Lyndon Arrays in Linear TimePhilip Bille, Jonas Ellert, Johannes Fischer 0001, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg. [doi]
- Active Learning a Convex Body in Low DimensionsSariel Har-Peled, Mitchell Jones, Saladi Rahul. [doi]
- On the Central Levels ProblemPetr Gregor, Ondrej Micka, Torsten Mütze. [doi]
- A Simple Dynamization of Trapezoidal Point Location in Planar SubdivisionsMilutin Brankovic, Nikola Grujic, André van Renssen, Martin P. Seybold. [doi]
- On the Two-Dimensional Knapsack Problem for Convex PolygonsArturo I. Merino, Andreas Wiese. [doi]
- On Skolem-Hardness and Saturation Points in Markov Decision ProcessesJakob Piribauer, Christel Baier. [doi]
- Towards Optimal Set-Disjointness and Set-Intersection Data StructuresTsvi Kopelowitz, Virginia Vassilevska Williams. [doi]
- Robust Algorithms for TSP and Steiner TreeArun Ganesh, Bruce M. Maggs, Debmalya Panigrahi. [doi]
- Asynchronous Majority Dynamics in Preferential Attachment TreesMaryam Bahrani, Nicole Immorlica, Divyarthi Mohan, S. Matthew Weinberg. [doi]
- The Adversarial Stackelberg Value in Quantitative GamesEmmanuel Filiot, Raffaella Gentilini, Jean-François Raskin. [doi]
- On the Complexity of Zero Gap MIPHamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen. [doi]
- How to Play in Infinite MDPs (Invited Talk)Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak. [doi]
- Roundtrip Spanners with (2k-1) StretchRuoxu Cen, Ran Duan, Yong Gu. [doi]
- A General Stabilization Bound for Influence Propagation in GraphsPál András Papp, Roger Wattenhofer. [doi]
- Network-Aware Strategies in Financial SystemsPál András Papp, Roger Wattenhofer. [doi]
- Online Algorithms for Weighted Paging with PredictionsZhihao Jiang, Debmalya Panigrahi, Kevin Sun 0001. [doi]
- An Efficient PTAS for Stochastic Load Balancing with Poisson JobsAnindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey. [doi]
- Robust Algorithms Under Adversarial InjectionsParitosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson. [doi]
- Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar GraphsTaisuke Izumi, Yota Otachi. [doi]
- Logical Characterisation of Hybrid ConformanceMaciej Gazda, Mohammad Reza Mousavi. [doi]
- Computational Complexity of the α-Ham-Sandwich ProblemMan-Kwun Chiu, Aruni Choudhary, Wolfgang Mulzer. [doi]
- A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative WeightsArtem Govorov, Jin-yi Cai, Martin Dyer. [doi]
- Computing Measures of Weak-MSO Definable Sets of TreesDamian Niwinski, Marcin Przybylko, Michal Skrzypczak. [doi]
- The Complexity of Promise SAT on Non-Boolean DomainsAlex Brandts, Marcin Wrochna, Stanislav Zivny. [doi]
- Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed GraphsShiri Chechik, Moran Nechushtan. [doi]
- Nondeterministic and Randomized Boolean Hierarchies in Communication ComplexityToniann Pitassi, Morgan Shirley, Thomas Watson 0001. [doi]
- Knapsack Secretary with Bursty AdversaryThomas Kesselheim, Marco Molinaro. [doi]
- Minimum Cut in O(m log² n) TimePawel Gawrychowski, Shay Mozes, Oren Weimann. [doi]
- The Complexity of Knapsack Problems in Wreath ProductsMichael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche. [doi]
- Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer ProgrammingTimothy F. N. Chan, Jacob W. Cooper, Martin Koutecký, Daniel Král', Kristýna Pekárková. [doi]
- Scattering and Sparse Partitions, and Their ApplicationsArnold Filtser. [doi]
- The Online Min-Sum Set Cover ProblemDimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas. [doi]
- ∞ GuaranteeYi Li 0002, Vasileios Nakos. [doi]
- Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial KernelMarin Bougeret, Bart M. P. Jansen, Ignasi Sau. [doi]
- A Recipe for Quantum Graphical LanguagesTitouan Carette, Emmanuel Jeandel. [doi]
- The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary ProblemShaddin Dughmi. [doi]
- Kinetic Geodesic Voronoi Diagrams in a Simple PolygonMatias Korman, André van Renssen, Marcel Roeloffzen, Frank Staals. [doi]
- Dynamic Averaging Load Balancing on CyclesDan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour. [doi]
- Parameterized Inapproximability for Steiner Orientation by Gap AmplificationMichal Wlodarczyk 0001. [doi]
- Tree Polymatrix Games Are PPAD-HardArgyrios Deligkas, John Fearnley, Rahul Savani. [doi]
- Breaking the Barrier of 2 for the Storage Allocation ProblemTobias Mömke, Andreas Wiese. [doi]
- Finite Sequentiality of Finitely Ambiguous Max-Plus Tree AutomataErik Paul. [doi]
- Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion GamesDimitris Fotakis, Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis. [doi]
- The Power of Many Samples in Query ComplexityAndrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, Weiyun Ma, Li-Yang Tan. [doi]
- Hypergraph Isomorphism for Groups with Restricted Composition FactorsDaniel Neuen. [doi]
- On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut ProblemsMagnus Wahlström. [doi]
- A (2 + ε)-Factor Approximation Algorithm for Split Vertex DeletionDaniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. [doi]
- Symmetric Arithmetic CircuitsAnuj Dawar, Gregory Wilsenach. [doi]
- Faster Dynamic Range ModeBryce Sandlund, Yinzhan Xu. [doi]
- Descriptive Complexity on Non-Polish Spaces IIMathieu Hoyrup. [doi]
- Hrushovski's Encoding and ω-Categorical CSP MonstersPierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker. [doi]
- Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin SystemsShuai Shao 0001, Yuxin Sun. [doi]
- From Linear to Additive Cellular AutomataAlberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara. [doi]
- The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word ProblemZachary Remscrim. [doi]
- New Fault Tolerant Subset PreserversGreg Bodwin, Keerti Choudhary, Merav Parter, Noa Shahar. [doi]
- The Topology of Local Computing in NetworksPierre Fraigniaud, Ami Paz. [doi]
- Counting Homomorphisms in Plain Exponential TimeAndrei A. Bulatov, Amineh Dadsetan. [doi]
- A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering ProblemsAndrés Fielbaum, Ignacio Morales, José Verschae. [doi]
- Faster Random k-CNF SatisfiabilityAndrea Lincoln, Adam Yedidia. [doi]
- Sensitive Instances of the Constraint Satisfaction ProblemLibor Barto, Marcin Kozik, Johnson Tan, Matt Valeriote. [doi]
- On the Size of Finite Rational Matrix SemigroupsGeorgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner. [doi]
- Dynamic Longest Common Substring in Polylogarithmic TimePanagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski. [doi]
- Graph Coloring via Degeneracy in Streaming and Other Space-Conscious ModelsSuman K. Bera, Amit Chakrabarti, Prantar Ghosh. [doi]
- Two Variable Logic with Ultimately Periodic CountingMichael Benedikt, Egor V. Kostylev, Tony Tan. [doi]
- Approximate Nearest Neighbor for Curves - Simple, Efficient, and DeterministicArnold Filtser, Omrit Filtser, Matthew J. Katz. [doi]
- Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete ConvexityHiroshi Hirai 0001, Motoki Ikeda. [doi]
- Scheduling in the Random-Order ModelSusanne Albers, Maximilian Janke. [doi]
- Invariants for Continuous Linear Dynamical SystemsShaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell 0001. [doi]
- Scheduling Lower Bounds via AND Subset SumAmir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay. [doi]
- On the Fine-Grained Complexity of Parity ProblemsAmir Abboud, Shon Feller, Oren Weimann. [doi]
- Hardness of Equations over Finite Solvable Groups Under the Exponential Time HypothesisArmin Weiß. [doi]
- Near-Optimal Algorithm for Constructing Greedy Consensus TreeHongxun Wu. [doi]
- Sketching Graphs and Combinatorial Optimization (Invited Talk)Robert Krauthgamer. [doi]
- Quantum Distributed Complexity of Set Disjointness on a LineFrédéric Magniez, Ashwin Nayak. [doi]
- Online Two-Dimensional Load BalancingIlan Reuven Cohen, Sungjin Im, Debmalya Panigrahi. [doi]
- Extending Partial 1-Planar DrawingsEduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nöllenburg. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Single-Use Automata and Transducers for Infinite AlphabetsMikolaj Bojanczyk, Rafal Stefanski. [doi]
- Sublinear Algorithms and Lower Bounds for Metric TSP Cost EstimationYu Chen, Sampath Kannan, Sanjeev Khanna. [doi]
- Weakly-Unambiguous Parikh Automata and Their Link to Holonomic SeriesAlin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud. [doi]
- An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph ClassesIgnasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. [doi]
- From Holant to Quantum Entanglement and BackJin-yi Cai, Zhiguo Fu, Shuai Shao 0001. [doi]
- Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor ProblemThijs Laarhoven. [doi]
- On the Structure of Solution Sets to Regular Word EquationsJoel D. Day, Florin Manea. [doi]
- When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?Sebastian Maneth, Helmut Seidl. [doi]
- Feasible Interpolation for Polynomial Calculus and Sums-Of-SquaresTuomas Hakoniemi. [doi]
- The Iteration Number of Colour RefinementSandra Kiefer, Brendan D. McKay. [doi]
- The Complexity of Verifying Loop-Free Programs as Differentially PrivateMarco Gaboardi, Kobbi Nissim, David Purser. [doi]
- Existence and Complexity of Approximate Equilibria in Weighted Congestion GamesGeorge Christodoulou 0001, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann. [doi]
- Linearly Representable Submodular Functions: An Algebraic Algorithm for MinimizationRohit Gurjar, Rajat Rathi. [doi]
- d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) ColorsVenkatesan Guruswami, Sai Sandeep. [doi]
- Dynamic Complexity of Reachability: How Many Changes Can We Handle?Samir Datta, Pankaj Kumar, Anish Mukherjee 0001, Anuj Tawari, Nils Vortmeier, Thomas Zeume. [doi]
- New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under FailuresDiptarka Chakraborty, Keerti Choudhary. [doi]
- Bisimulation Equivalence of Pushdown Automata Is Ackermann-CompleteWenbo Zhang 0004, Qiang Yin, Huan Long, Xian Xu 0001. [doi]
- Lower Bounds for Dynamic Distributed Task AllocationHsin-Hao Su, Nicole Wein. [doi]
- The Strahler Number of a Parity GameLaure Daviaud, Marcin Jurdzinski, K. S. Thejaswini. [doi]
- mXiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu 0001, Zhiyu Xia, Yufan Zheng. [doi]
- Cost Automata, Safe Schemes, and Downward ClosuresDavid Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys. [doi]
- Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear TimeHendrik Fichtenberger, Mingze Gao, Pan Peng 0001. [doi]
- Quasi-Majority Functional Voting on Expander GraphsNobutaka Shimizu, Takeharu Shiraga. [doi]
- How to Hide a Clique?Uriel Feige, Vadim Grinberg. [doi]
- Improved Bounds for Matching in Random-Order StreamsAaron Bernstein. [doi]
- Fréchet Distance for Uncertain CurvesKevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen. [doi]
- Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative LogicLê Thành Dung Nguyên, Pierre Pradic. [doi]