Abstract is missing.
- A Unified Framework of Quantum Walk SearchSimon Apers, András Gilyén, Stacey Jeffery. [doi]
- Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and CutwidthMarta Piecyk, Pawel Rzazewski. [doi]
- A Ramsey Theorem for Finite MonoidsIsmaël Jecker. [doi]
- Parameterised Counting in LogspaceAnselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao. [doi]
- Diverse Collections in Matroids and GraphsFedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. [doi]
- Geometric Cover with Outliers RemovalZhengyang Guo, Yi Li 0002. [doi]
- Inference and Mutual Information on Random Factor GraphsAmin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch. [doi]
- Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-CompleteStefan Göller, Mathieu Hilaire. [doi]
- Good r-Divisions Imply Optimal Amortized Decremental BiconnectivityJacob Holm, Eva Rotenberg. [doi]
- Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut EnumerationPetr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le. [doi]
- The Edit Distance to k-Subsequence UniversalityJoel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer. [doi]
- The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman ProblemUlrich A. Brodowsky, Stefan Hougardy. [doi]
- Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register AutomataCorentin Barloy, Lorenzo Clemente. [doi]
- Quantum Approximate Counting with Nonadaptive Grover IterationsRamgopal Venkateswaran, Ryan O'Donnell. [doi]
- Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme PointsTimothy M. Chan, Saladi Rahul. [doi]
- 6-Uniform Maker-Breaker Game Is PSPACE-CompleteMd Lutfar Rahman, Thomas Watson 0001. [doi]
- An Improved Sketching Algorithm for Edit DistanceCe Jin, Jelani Nelson, Kewen Wu 0001. [doi]
- Tight Approximation Guarantees for Concave Coverage ProblemsSiddharth Barman, Omar Fawzi, Paul Fermé. [doi]
- Subgroup Membership in GL(2, Z)Markus Lohrey. [doi]
- Cluster Editing Parameterized Above Modification-Disjoint P₃-PackingsShaohua Li, Marcin Pilipczuk, Manuel Sorge. [doi]
- Barrington Plays Cards: The Complexity of Card-Based ProtocolsPavel Dvorák, Michal Koucký 0001. [doi]
- Resolution with Symmetry Rule Applied to Linear EquationsPascal Schweitzer, Constantin Seebach. [doi]
- Optimization, Complexity and Invariant Theory (Invited Talk)Peter Bürgisser. [doi]
- Spectrum Preserving Short Cycle Removal on Regular GraphsPedro Paredes 0002. [doi]
- Synchronizing Strongly Connected Partial DFAsMikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula. [doi]
- Absorbing Patterns in BST-Like Expression-TreesFlorent Koechlin, Pablo Rotondo. [doi]
- Rice-Like Theorems for Automata NetworksGuilhem Gamard, Pierre Guillon 0001, Kévin Perrot, Guillaume Theyssier. [doi]
- Digraph Coloring and Distance to AcyclicityArarat Harutyunyan, Michael Lampis, Nikolaos Melissinos. [doi]
- Church Synthesis on Register Automata over Linearly Ordered Data DomainsLéo Exibard, Emmanuel Filiot, Ayrat Khalimov. [doi]
- Complexity of the List Homomorphism Problem in Hereditary Graph ClassesKarolina Okrasa, Pawel Rzazewski. [doi]
- First-Order Transductions of Graphs (Invited Talk)Patrice Ossona de Mendez. [doi]
- Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-MeansAnna Arutyunova, Melanie Schmidt 0001. [doi]
- Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 RatioÉdouard Bonnet. [doi]
- An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free GraphsMeike Neuwohner. [doi]
- Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance DecodingDivesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen. [doi]
- An FPT Algorithm for Elimination Distance to Bounded Degree GraphsAkanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001. [doi]
- On Euclidean Steiner (1+ε)-SpannersSujoy Bhore, Csaba D. Tóth. [doi]
- Solving One Variable Word Equations in the Free Group in Cubic TimeRobert Ferens, Artur Jez. [doi]
- A Framework of Quantum Strong Exponential-Time HypothesesHarry Buhrman, Subhasree Patro, Florian Speelman. [doi]
- Exploiting Dense Structures in Parameterized ComplexityWilliam Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. [doi]
- A Characterization of Wreath Products Where Knapsack Is DecidablePascal Bergsträßer, Moses Ganardi, Georg Zetzsche. [doi]
- Efficiently Testing Simon's CongruencePawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer. [doi]
- The Complexity of the Distributed Constraint Satisfaction ProblemSilvia Butti, Victor Dalmau. [doi]
- Finding an Optimal Alphabet Ordering for Lyndon Factorization Is HardDaniel Gibney, Sharma V. Thankachan. [doi]
- Locality Sensitive Hashing for Efficient Similar Polygon RetrievalHaim Kaplan, Jay Tenenbaum. [doi]
- One-Tape Turing Machine and Branching Program Lower Bounds for MCSPMahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida. [doi]
- Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean CaseLibor Barto, Diego Battistelli, Kevin M. Berg. [doi]
- Round-Competitive Algorithms for Uncertainty Problems with Parallel QueriesThomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima. [doi]
- On the Fluted Fragment (Invited Talk)Lidia Tendera. [doi]
- Distance Computations in the Hybrid Network Model via Oracle SimulationsKeren Censor Hillel, Dean Leitersdorf, Volodymyr Polosukhin. [doi]
- Lower Bounds for Graph-Walking AutomataOlga Martynova 0001, Alexander Okhotin. [doi]
- An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed GraphsAndreas Björklund. [doi]
- A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility LocationMarcin Bienkowski, Björn Feldkord, Pawel Schmidt. [doi]
- Online Simple Knapsack with Reservation CostsHans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith. [doi]
- Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear FormsJoshua A. Grochow, Youming Qiao, Gang Tang. [doi]
- b-Coloring Parameterized by Clique-WidthLars Jaffke, Paloma T. Lima, Daniel Lokshtanov. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Binary Matrix Completion Under Diameter ConstraintsTomohiro Koana, Vincent Froese, Rolf Niedermeier. [doi]
- A Faster Algorithm for Finding Tarski Fixed PointsJohn Fearnley, Rahul Savani. [doi]
- Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their ApplicationsJugal Garg, Edin Husic, László A. Végh. [doi]