math.CO

Papers

• The complexity of bit retrieval (2016)
  Veit Elser
  —
• Weighted domination number of cactus graphs (2016)
  Tina Novak et al.
  —
• A Formal Definition for Configuration (2016)
  Mar\'ia Carmen Calvo Yanguas (DAE) et al.
  —
• Rounds in a combinatorial search problem (2016)
  D\'aniel Gerbner et al.
  —
• Combinatorial and Asymptotical Results on the Neighborhood Grid (2023)
  Martin Skrodzki et al.
  —
• Randomized Near Neighbor Graphs, Giant Components, and Applications in Data Science (2017)
  George C. Linderman et al.
  —
• A limit field for orthogonal range searches in two-dimensional random point search trees (2018)
  Nicolas Broutin and Henning Sulzbach
  —
• A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs (2019)
  Parinya Chalermsook et al.
  —
• Searching for dense subsets in a graph via the partition function (2018)
  Alexander Barvinok and Anthony Della Pella
  —
• Efficiently list-edge coloring multigraphs asymptotically optimally (2021)
  Fotis Iliopoulos and Alistair Sinclair
  —
• p-Adic scaled space filling curve indices for high dimensional data (2019)
  Patrick Erik Bradley et al.
  —
• Enumeration of Preferred Extensions in Almost Oriented Digraphs (2019)
  Serge Gaspers and Ray Li
  —
• Combining the Connection Scan Algorithm with Contraction Hierarchies (2019)
  Jacob Turner
  —
• Faster Parallel Multiterminal Cuts (2020)
  Monika Henzinger et al.
  —
• A Note on Generic Tangle Algorithms (2025)
  Christian Elbracht et al.
  —
• Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques (2021)
  Yishui Wang et al.
  —
• TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead (2024)
  Son Hoang Dau et al.
  —
• Fast approximation of search trees on trees with centroid trees (2022)
  Benjamin Aram Berendsohn et al.
  —
• The Bottom-Left Algorithm for the Strip Packing Problem (2024)
  Stefan Hougardy and Bart Zondervan
  —
• On multidimensional generalization of binary search (2024)
  Dariusz Dereniowski et al.
  —
• Graph Search Trees and the Intermezzo Problem (2024)
  Jesse Beisegel et al.
  —
• A bijection for the evolution of $B$-trees (2024)
  Fabian Burghart et al.
  —
• $k$-local Graphs (2025)
  Christian Beth et al.
  —
• Neural Networks and (Virtual) Extended Formulations (2026)
  Christoph Hertrich et al.
  —
• Optimal Bounds for Open Addressing Without Reordering (2025)
  Martin Farach-Colton et al.
  —
• Finding the diameter of a tree with distance queries (2025)
  D\'aniel Gerbner et al.
  —
• Fast Rational Search via Stern-Brocot Tree (2025)
  Connor Weyers and N. V. Vinodchandran
  —
• An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources (2026)
  Theodoros Anagnostopoulos et al.
  —
• An efficient recursive decomposition algorithm for undirected graphs (2026)
  Pei Heng et al.
  —
• Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations (2026)
  Siyue Liu et al.
  —
• Generating Hadamard matrices with transformers (2026)
  Geordie Williamson et al.
  —
• Faster Mixing for Triangulations via Transport Flows (2026)
  Vedat Levi Alev et al.
  —
• Mathematical Foundations for Peer-to-Peer Lattice Computation (2026)
  Danil Gorinevski (cybiont GmbH et al.
  —
• Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them (2026)
  Snir Hordan et al.
  —
• Is Dimensionality a Barrier for Retrieval Models? (2026)
  Kiril Bangachev et al.
  —
• Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization (2026)
  Khen Cohen et al.
  —
• Complement Submodular Information Measures for Balanced and Robust Data Selection (2026)
  Rishabh Iyer
  —
• Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs (2026)
  Eshwar Srinivasan et al.
  —
• Low Soundness Linearity Testing on the Half-Slice (2026)
  Haakon Larsen et al.
  —