:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Shen, Alexander
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Information Theory Combinatorics 68Q87 F.1.2
Online Access:	https://arxiv.org/abs/2405.09304
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)

Complexity of learning matchings and half graphs via edge queries
by: Mande, Nikhil S., et al.
Published: (2025)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
by: Zhong, Xianghui
Published: (2018)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

Algorithms for Generating Small Random Samples
by: Cicirello, Vincent A.
Published: (2024)

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
by: Bonnet, Édouard, et al.
Published: (2026)

Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
by: Coregliano, Leonardo Nagami, et al.
Published: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
by: Bonnet, Édouard
Published: (2024)

Mim-Width is paraNP-complete
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Answering Related Questions
by: Bonnet, Édouard
Published: (2025)

Coloring Hardness on Low Twin-Width Graphs
by: Bonnet, Édouard
Published: (2025)

Practical implementation of geometric quasi-cyclic LDPC codes
by: Ball, Simeon, et al.
Published: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
by: Cicerone, Serafino, et al.
Published: (2025)

Fast Gaussian Distributed Pseudorandom Number Generation in Java via the Ziggurat Algorithm
by: Cicirello, Vincent A.
Published: (2024)

Walking on Words
by: Pratt-Hartmann, Ian
Published: (2022)

Preliminaries on the Accurate Estimation of the Hurst Exponent Using Time Series
by: Millán, Ginno, et al.
Published: (2021)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
by: Cicirello, Vincent A.
Published: (2024)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)

Average Case Analysis of Leaf-Centric Binary Tree Sources
by: Benkner, Louisa Seelbach, et al.
Published: (2018)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
by: Hintze, Lukas, et al.
Published: (2024)

Noisy group testing via spatial coupling
by: Coja-Oghlan, Amin, et al.
Published: (2024)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Sublinear-Time Computation in the Presence of Online Erasures
by: Kalemaj, Iden, et al.
Published: (2021)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Algebras of Information. An Axiomatic Foundation
by: Kohlas, Juerg
Published: (2017)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Edge open packing: complexity, algorithmic aspects, and bounds
by: Brešar, Boštjan, et al.
Published: (2024)