archive
Every paper Pith has read. Search by title, abstract, or pith.
398 papers in cs.DM · page 9
-
Poly-time algorithm for directed 2-linkage with fixed excesses
The directed 2-linkage problem with length constraints
-
Generation theorem bounds minimal bricks to 5n-7 edges
Minimal bricks
-
Exact [1,2]-domination sizes fixed for all P(n,2)
[1,2]-Domination in Generalized Petersen Graphs
-
Strategies shroud their identities until n-1 actions revealed
Deception, Delay, and Detection of Strategies
-
Polycube growth rate bounded above by (2d-2)e + o(1)
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
-
Random sieve reaches 4.282-approx for non-monotone submodular streams
Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint
-
Coupon collector conditioned on fast finish follows new curve
The impatient collector
-
Optimal colorings stay hard to recover from deleted neighbors
Finding Optimal Solutions With Neighborly Help
-
Cographs admit hierarchical colorings with χ(G) colors
Hierarchical Colorings of Cographs
-
Bounded degree and treewidth yield linear-edge Ramsey graphs
The size Ramsey number of graphs with bounded treewidth
-
Extra-factorial sum gives mean cycle length per edge
Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs
-
Strong digraph compositions with parts of size >=2 always have good pairs at every vertex
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs