🏛️ 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
On Periodicity Lemma for Partial Words
🔮
🔮
The Ethereal
Random Walk Fundamental Tensor and Its Applications to Network Analysis
🔮
🔮
The Ethereal
Convolutional neural networks on irregular domains based on approximate vertex-domain translations
🔮
🔮
The Ethereal
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
🔮
🔮
The Ethereal
Shared processor scheduling
🔮
🔮
The Ethereal
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem
🔮
🔮
The Ethereal
Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions
🔮
🔮
The Ethereal
Differentially Private Response Mechanisms on Categorical Data
🔮
🔮
The Ethereal
Ride Sharing with a Vehicle of Unlimited Capacity
🔮
🔮
The Ethereal
New Algorithms for Computing a Single Component of the Discrete Fourier Transform
🔮
🔮
The Ethereal
Finding Connected Dense $k$-Subgraphs
🔮
🔮
The Ethereal
Self-Coordinated Corona Graphs: a model for complex networks
🔮
🔮
The Ethereal
Maximum-utility popular matchings with bounded instability
🔮
🔮
The Ethereal
An unconditional lower bound for the active-set method in convex quadratic maximization
🔮
🔮
The Ethereal
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
🔮
🔮
The Ethereal
Interval H-graphs : Recognition and forbidden obstructions
🔮
🔮
The Ethereal
On the compressiveness of the Burrows-Wheeler transform
🔮
🔮
The Ethereal
Greedy Gray Codes for some Restricted Classes of Binary Words
🔮
🔮
The Ethereal
On classes of bounded tree rank, their interpretations, and efficient sparsification
🔮
🔮
The Ethereal
Solving the Graph Burning Problem for Large Graphs
🔮
🔮
The Ethereal
Lower Bounds for Leaf Rank of Leaf Powers
🔮
🔮
The Ethereal
How to Reduce Temporal Cliques to Find Sparse Spanners
🔮
🔮
The Ethereal