math.CO
39 papers tagged math.CO β re-sort below
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.β