🏛️ The Discrete Mathematics Crypt
cs.DM: Where Discrete Mathematics papers rest without their code.
585
Total Papers
0
No Code
568
Twilight
17
Has Code
2.9%
Survival Rate
🔮
🔮
The Ethereal
🔮
🔮
The Ethereal
The Power of Local Information in PageRank
🔮
🔮
The Ethereal
Focal points and their implications for Möbius Transforms and Dempster-Shafer Theory
🔮
🔮
The Ethereal
Fair allocation of indivisible items with conflict graphs
🔮
🔮
The Ethereal
Clustering powers of sparse graphs
🔮
🔮
The Ethereal
Subgaussian Tail Bounds via Stability Arguments
🔮
🔮
The Ethereal
Loopless Gray Code Enumeration and the Tower of Bucharest
🔮
🔮
The Ethereal
Reconstruction of time-consistent species trees
🔮
🔮
The Ethereal
Evacuating Two Robots from a Disk: A Second Cut
🔮
🔮
The Ethereal
Approximation algorithms and an integer program for multi-level graph spanners
🔮
🔮
The Ethereal
On the Parallel Reconstruction from Pooled Data
🔮
🔮
The Ethereal
An improved upper bound on the integrality ratio for the $s$-$t$-path TSP
🔮
🔮
The Ethereal
On the Bias of Reed-Muller Codes over Odd Prime Fields
🔮
🔮
The Ethereal
A recognition algorithm for simple-triangle graphs
🔮
🔮
The Ethereal
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification
🔮
🔮
The Ethereal
Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
🔮
🔮
The Ethereal
Number Balancing is as hard as Minkowski's Theorem and Shortest Vector
🔮
🔮
The Ethereal
Average Shortest Path Length of Graphs of Diameter 3
🔮
🔮
The Ethereal
Random intersection graphs and their applications in security, wireless communication, and social networks
🔮
🔮
The Ethereal
Sampling Balanced Forests of Grids in Polynomial Time
🔮
🔮
The Ethereal
Faster Binary Mean Computation Under Dynamic Time Warping
🔮
🔮
The Ethereal
Improved Bounds for Track Numbers of Planar Graphs
🔮
🔮
The Ethereal
Hardness and approximation for the geodetic set problem in some graph classes
🔮
🔮
The Ethereal