🔮
🔮
The Ethereal
🏛️ 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
Local Graph Stability in Exponential Family Random Graph Models
🔮
🔮
The Ethereal
On multifold packings of radius-1 balls in Hamming graphs
🔮
🔮
The Ethereal
Embedding a $θ$-invariant code into a complete one
🔮
🔮
The Ethereal
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
🔮
🔮
The Ethereal
The $b$-bibranching Problem: TDI System, Packing, and Discrete Convexity
🔮
🔮
The Ethereal
Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
🔮
🔮
The Ethereal
Average Case Analysis of Leaf-Centric Binary Tree Sources
🔮
🔮
The Ethereal
Probabilistic Pursuits on Graphs
🔮
🔮
The Ethereal
Power domination in maximal planar graphs
🔮
🔮
The Ethereal
On 1-factorizations of Bipartite Kneser Graphs
🔮
🔮
The Ethereal
Edge-Orders
🔮
🔮
The Ethereal
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio
🔮
🔮
The Ethereal
New Integrality Gap Results for the Firefighters Problem on Trees
🔮
🔮
The Ethereal
Multi-Clique-Width
🔮
🔮
The Ethereal
An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials
🔮
🔮
The Ethereal
On the readability of overlap digraphs
🔮
🔮
The Ethereal
Control hubs of complex networks and a polynomial-time identification algorithm
🔮
🔮
The Ethereal
Tight Bounds for Repeated Balls-into-Bins
🔮
🔮
The Ethereal
Algorithmic Results for Weak Roman Domination Problem in Graphs
🔮
🔮
The Ethereal
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
🔮
🔮
The Ethereal
Reconstruction of multiple strings of constant weight from prefix-suffix compositions
🔮
🔮
The Ethereal
Solution discovery via reconfiguration for problems in P
🔮
🔮
The Ethereal