archive
Every paper Pith has read. Search by title, abstract, or pith.
398 papers in cs.DM · page 7
-
O(k^5)-vertex kernel for deletion to cliques or trees
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
-
Partial list CF coloring bounded by O(log² Δ)
Bounds and Hardness Results for Conflict-free Choosability
-
Bicyclic graphs have fault tolerant metric dimension exactly 4
Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management
-
Ultrafilters on connectivity systems link to graph widths
Various Properties of Various Ultrafilters, Various Graph Width Parameters, and Various Connectivity Systems (with Survey)
-
Product measures model random MSTs for quantitative study
Models of random spanning trees
-
Poly-time recognition and max independent set for Burling graphs
Polynomial-time recognition and maximum independent set in Burling graphs
-
Krenn-Gu conjecture holds for connectivity-2 graphs
Krenn-Gu conjecture for sparse graphs
-
Three methods find improved almost orthogonal arrays
Almost Orthogonal Arrays: Search Three Ways
-
Model schedules staff shifts to match fluctuating demand
Staff Scheduling for Demand-Responsive Services
-
Two sweeps solve list defective coloring from p² lists
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
-
Resistance distance linearizes Maas transport on graphs
Resistance Distance and Linearized Optimal Transport on Graphs
-
α_i-metric graphs are f(i)-hyperbolic with linear f
$\alpha_i$-Metric Graphs: Hyperbolicity
-
Extremal minimal bipartite matching graphs built from two trees
Extremal minimal bipartite matching covered graphs
-
Planar graphs are induced subgraphs of path-strong-product with tree-width 39
Hereditary Graph Product Structure and $\cal H$-clique-width
-
Exact scanwidth of rooted DAGs computed in O(k n^k m) time
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
-
Bijection equates progressive and rushed Dyck paths
Progressive and Rushed Dyck Paths
-
Bijection links progressive and rushed Dyck paths
Progressive and Rushed Dyck Paths
-
Distance recoloring is PSPACE-complete on planar graphs for d >= 3
Distance Recoloring
-
Color-preserving switches connect degree-color graphs
Irreducible Markov Chains on spaces of graphs with fixed degree-color sequences
-
Survey compiles Honkala's results on identifying codes
On Iiro Honkala's contributions to identifying codes
-
Twisted cubes admit floor(n/2) edge-independent spanning trees
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
-
Chordal graphs bound broadcast domination by 3/2 times multipacking
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
-
Deciding temporal spanning trees is NP-complete
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
-
Sequential sweep reaches spectral gap near 1 on expanders
Sequential Sweeps and High Dimensional Expansion
-
Known inequalities for the summatory function of the sum of digits follow from a…
Summing the sum of digits
-
Flower relaxation matches McCormick intersections for multilinear problems
Relaxation strength for multilinear optimization: McCormick strikes back
-
Nondeterministic walks stay algebraic when endpoints become reachable sets
Combinatorics of nondeterministic walks
-
Graph edit distance NP-hard even with equal edges
Three Hardness Results for Graph Similarity Problems
-
Closeness computed for every minimal k-connected graph
Closeness and Residual Closeness of Harary Graphs
-
Tarski fixed point enumeration requires lattice width queries
On the enumeration of Tarski fixed points
-
Linear-time algorithm finds metric dimension on tree digraphs
Algorithms and hardness for Metric Dimension on digraphs
-
Strong regulation sets ambiguous states on conflicting influences
Strong regulatory graphs
-
Survey records best approximation ratios for capacitated vehicle routing
Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
-
Formulas found for link residual closeness of Harary graphs
Link Residual Closeness of Harary Graphs
-
Walnut prover automates proofs for golden-ratio representations
Proving Properties of $\varphi$-Representations with the Walnut Theorem-Prover
-
Obstruction concepts classify graph parameters under quasi-orderings
An Overview of Universal Obstructions for Graph Parameters
-
Taxicab means bisect focal sets and reconstruct from X-rays
On taxicab distance mean functions and their geometric applications: methods, implementations and examples
-
Treewidth-k graphs contain c-clustered sets of size c n over (c+k+1)
Clustered independence and bounded treewidth
-
Weighted graphs model neighborhood effects in new resource games
Nonatomic Non-Cooperative Neighbourhood Balancing Games
-
Multiset resolving sets equal ID-colorings
Complexity and equivalency of multiset dimension and ID-colorings
-
Identifying code density bound tightened to 53/126 on hexagonal grid
Finding codes on infinite grids automatically
-
Local identifying codes match covering density in hypercubes
Optimal local identifying and local locating-dominating codes
-
"A complexity map for spotting forbidden patterns in ordered graphs"
Pattern detection in ordered graphs
-
-
7/3-power-free words bound Dyck nesting depth
Dyck Words, Pattern Avoidance, and Automatic Sequences
-
Edge removal changes monitoring number by at most 2
Perturbation results for distance-edge-monitoring numbers
-
Regularization recovers Spencer and Banaszczyk discrepancy bounds
Discrepancy Minimization via Regularization
-
Dynamic algorithm solves weighted Tower of Hanoi for minimum cost
The weighted Tower of Hanoi
-
Constant-factor guarantees hold for correlated demand matching
A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
-
Double-exp time algorithms decide graph conjectures on treewidth at most k
From Width-Based Model Checking to Width-Based Automated Theorem Proving