🔮
🔮
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
Better $s$-$t$-Tours by Gao Trees
🔮
🔮
The Ethereal
Kendall Tau Sequence Distance: Extending Kendall Tau from Ranks to Sequences
🔮
🔮
The Ethereal
Improved bounds for the excluded-minor approximation of treedepth
🔮
🔮
The Ethereal
An efficient tree decomposition method for permanents and mixed discriminants
🔮
🔮
The Ethereal
Hidden Hamiltonian Cycle Recovery via Linear Programming
🔮
🔮
The Ethereal
Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP
🔮
🔮
The Ethereal
New Bounds on Optimal Sorting Networks
🔮
🔮
The Ethereal
Graph Tikhonov Regularization and Interpolation via Random Spanning Forests
🔮
🔮
The Ethereal
Separating hash families: A Johnson-type bound and new constructions
🔮
🔮
The Ethereal
Parallel algorithms and concentration bounds for the Lovasz Local Lemma via witness DAGs
🔮
🔮
The Ethereal
Reassembling trees for the traveling salesman
🔮
🔮
The Ethereal
Forman's Ricci curvature - From networks to hypernetworks
🔮
🔮
The Ethereal
Conflict-Free Coloring of Planar Graphs
🔮
🔮
The Ethereal
Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs
🔮
🔮
The Ethereal
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
🔮
🔮
The Ethereal
A SAT-based Resolution of Lam's Problem
🔮
🔮
The Ethereal
An improved approximation algorithm for ATSP
🔮
🔮
The Ethereal
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
🔮
🔮
The Ethereal
Feedback Edge Sets in Temporal Graphs
🔮
🔮
The Ethereal
Weighted Additive Spanners
🔮
🔮
The Ethereal
Medians in median graphs and their cube complexes in linear time
🔮
🔮
The Ethereal
Discovering the hidden community structure of public transportation networks
🔮
🔮
The Ethereal