pith. sign in

Finding topological subgraphs

5 Pith papers cite this work. Polarity classification is still indexing.

5 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

years

2026 4 2023 1

verdicts

UNVERDICTED 5

roles

background 1

polarities

background 1

representative citing papers

Wavelet Forests Revisited

cs.DS · 2026-04-13 · unverdicted · novelty 4.0

Wavelet forests extended with select support incur little space overhead and outperform or match standard wavelet trees on most tested inputs.

An Overview of Universal Obstructions for Graph Parameters

cs.DM · 2023-04-27 · unverdicted · novelty 3.0

The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.

citing papers explorer

Showing 5 of 5 citing papers.

  • Tighter bounds for weighted and unweighted shortest cycle approximation cs.DS · 2026-07-01 · unverdicted · none · ref 64

    Achieves (2k/3)-approximation for girth in weighted graphs in Õ(m + n^{1+2/k}) time for every k≥2, improving prior partial results, plus new fine-grained lower bounds for unweighted girth approximation.

  • Directed Low Diameter Decomposition for Structured Digraphs cs.DS · 2026-06-30 · unverdicted · none · ref 291

    Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.

  • Differentially Private Modeling of Disease Transmission within Human Contact Networks cs.CR · 2026-04-08 · unverdicted · none · ref 88

    A differentially private pipeline using node-level DP summaries to fit ERGMs or SBMs, generate synthetic networks, and simulate SIS disease spread on ARTNet sexual contact data produces incidence, prevalence, and intervention effect sizes close to non-private versions.

  • Wavelet Forests Revisited cs.DS · 2026-04-13 · unverdicted · none · ref 9

    Wavelet forests extended with select support incur little space overhead and outperform or match standard wavelet trees on most tested inputs.

  • An Overview of Universal Obstructions for Graph Parameters cs.DM · 2023-04-27 · unverdicted · none · ref 140

    The paper overviews universal obstructions as a unifying framework for graph parameters, surveys existing results across many parameters, and offers some unifying classification results.