- The Subspace Flatness Conjecture and Faster Integer Programming Victor Reis Thomas Rothvoss Thu 01 August 2024
- Treewidth Inapproximability and Tight ETH Lower Bound Édouard Bonnet Sun 23 June 2024
- Measuring well quasi-ordered finitary powersets Sergio Abriola Simon Halfon Aliaume Lopez Sylvain Schmitz Philippe Schnoebelen Isa Vialard Wed 27 December 2023
- NP-hard problems are not in BQP Reiner Czerwinski Thu 16 November 2023
- Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system Joshua A. Grochow Tue 11 July 2023
- Logarithmic Weisfeiler--Leman Identifies All Graphs of Bounded Rank Width Michael Levet Nicholas Sieger Tue 11 July 2023
- Higher-dimensional subdiagram matching Amar Hadzihasanovic Diana Kessler Fri 28 April 2023
- An aperiodic monotile David Smith Joseph Samuel Myers Craig S. Kaplan Chaim Goodman-Strauss Sun 26 March 2023
- Flip-width: Cops and Robber on dense graphs Szymon Toruńczyk Tue 07 February 2023
- Twin-width V: linear minors, modular counting, and matrix multiplication Édouard Bonnet Ugo Giocanti Patrice Ossona de Mendez Stéphan Thomassé Mon 03 October 2022
- Towards a more efficient approach for the satisfiability of two-variable logic Ting-Wei Lin Chia-Hsuan Lu Tony Tan Fri 30 April 2021
- Resolution with Symmetry Rule applied to Linear Equations Pascal Schweitzer Constantin Seebach Sun 14 February 2021
- Word equations in linear space Artur Jeż Mon 19 October 2020
- Twin-width I: tractable FO model checking Édouard Bonnet Eun Jung Kim Stéphan Thomassé Rémi Watrigant Wed 14 October 2020
- Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games Kristoffer Arnsfelt Hansen Steffan Christ Sølvsten Mon 22 June 2020
- Elements of Scheduling Jan Karel Lenstra David B. Shmoys Mon 27 January 2020
- Aggregate Queries on Sparse Databases Szymon Toruńczyk Wed 01 January 2020
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity Dušan Knop Martin Koutecký Tomáš Masařík Tomáš Toufar Wed 11 December 2019
- Recompression: a simple and powerful technique for word equations Artur Jeż Thu 08 August 2019
- Presburger arithmetic, rational generating functions, and quasi-polynomials K. Woods Mon 10 September 2018
- The Weisfeiler-Leman Dimension of Planar Graphs is at most 3 S. Kiefer I. Ponomarenko P. Schweitzer Thu 06 September 2018
- Logarithmic Weisfeiler--Leman and Treewidth Michael Levet Puck Rombach Nicholas Sieger Fri 02 March 2012
Library Size: 13G (22 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
