🔮
🔮
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
Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
🔮
🔮
The Ethereal
Irreducibility of Recombination Markov Chains in the Triangular Lattice
🔮
🔮
The Ethereal
Balanced Allocations with Heterogeneous Bins: The Power of Memory
🔮
🔮
The Ethereal
Perturbation results for distance-edge-monitoring numbers
🔮
🔮
The Ethereal
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
🔮
🔮
The Ethereal
The Weisfeiler-Leman Dimension of Conjunctive Queries
🔮
🔮
The Ethereal
A 3/2-Approximation for the Metric Many-visits Path TSP
🔮
🔮
The Ethereal
An Algorithm for the Exact Treedepth Problem
🔮
🔮
The Ethereal
Enumeration of Irredundant Forests
🔮
🔮
The Ethereal
Eccentricity terrain of $δ$-hyperbolic graphs
🔮
🔮
The Ethereal
Directed Graph Hashing
🔮
🔮
The Ethereal
Pliability and Approximating Max-CSPs
🔮
🔮
The Ethereal
Improved Approximation for Maximum Edge Colouring Problem
🔮
🔮
The Ethereal
On the Parameterized Complexity of $k$-Edge Colouring
🔮
🔮
The Ethereal
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem
🔮
🔮
The Ethereal
Efficiently list-edge coloring multigraphs asymptotically optimally
🔮
🔮
The Ethereal
Level Planarity: Transitivity vs. Even Crossings
🔮
🔮
The Ethereal
On the complexity of color-avoiding site and bond percolation
🔮
🔮
The Ethereal
On the Integrality Gap of the Prize-Collecting Steiner Forest LP
🔮
🔮
The Ethereal
Rerouting flows when links fail
🔮
🔮
The Ethereal
Quantitative aspects of linear and affine closed lambda terms
🔮
🔮
The Ethereal
A heuristic approach for dividing graphs into bi-connected components with a size constraint
🔮
🔮
The Ethereal