Pith. sign in

Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages =

Guruswami, Venkatesan, Manokaran, Rajsekar, Raghavendra, Prasad , title = · 2008 · DOI 10.1109/focs.2008.51

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

1 Pith paper citing it
106 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 18

    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.