🔮
🔮
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
On Distance Preserving and Sequentially Distance Preserving Graphs
🔮
🔮
The Ethereal
Bin Packing Problem: A Linear Constant-Space 3/2-Approximation Algorithm
🔮
🔮
The Ethereal
Fast counting of medium-sized rooted subgraphs
🔮
🔮
The Ethereal
Dappled tiling
🔮
🔮
The Ethereal
A linear algorithm for Brick Wang tiling
🔮
🔮
The Ethereal
The RED-BLUE SEPARATION problem on graphs
🔮
🔮
The Ethereal
Convergence of the number of period sets in strings
🔮
🔮
The Ethereal
Recognizing Geometric Intersection Graphs Stabbed by a Line
🔮
🔮
The Ethereal
The Power of Filling in Balanced Allocations
🔮
🔮
The Ethereal
Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics
🔮
🔮
The Ethereal
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
🔮
🔮
The Ethereal
Measuring Ransomware Lateral Movement Susceptibility via Privilege-Weighted Adjacency Matrix Exponentiation
🔮
🔮
The Ethereal
Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
🔮
🔮
The Ethereal
Degree Realization by Bipartite Cactus Graphs
🔮
🔮
The Ethereal
Continuous Petri Nets for Fast Yield Computation: Polynomial-Time and MILP Approaches
🔮
🔮
The Ethereal
Combination generators with optimal cache utilization and communication free parallel execution
🔮
🔮
The Ethereal
On constrained intersection representations of graphs and digraphs
🔮
🔮
The Ethereal
A Customized SAT-based Solver for Graph Coloring
🔮
🔮
The Ethereal
On a tree-based variant of bandwidth and forbidding simple topological minors
🔮
🔮
The Ethereal
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
🔮
🔮
The Ethereal
Galled Perfect Transfer Networks
🔮
🔮
The Ethereal
Finding the Center and Centroid of a Graph with Multiple Sources
🔮
🔮
The Ethereal