Pith. sign in

Title resolution pending

Crowston, Robert, Gutin, Gregory, Jones, Mark, Kim, Eun Jung, Ruzsa, Imre Z · Lecture notes in computer science · DOI 10.1007/978-3-642-13731-0_17

1 Pith paper cite this work, alongside 38 external citations. Polarity classification is still indexing.

1 Pith paper citing it
38 external citations · OpenAlex
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Exploiting Spanning Trees for Directed Acyclicity

cs.DS · 2026-07-08 · accept · novelty 7.0

MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.

citing papers explorer

Showing 1 of 1 citing paper.

  • Exploiting Spanning Trees for Directed Acyclicity cs.DS · 2026-07-08 · accept · none · ref 20

    MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.