Pith. sign in

IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) , pages =

Crowston, Robert, Gutin, Gregory, Jones, Mark , title = · 2012 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · DOI 10.4230/lipics.fsttcs.2012.400

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

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

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 2

    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.