66 citations · 206 across the 36 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2012★ 10 cited
Myhill-Nerode methods for hypergraphs
René van Bevern, Rodney G. Downey, Michael R. Fellows +2
We give an analog of the Myhill-Nerode methods from formal language theory for hypergraphs and use it to derive the following results for two NP-hard hypergraph problems: * We prov…
cs.DM2009
Feedback Vertex Sets in Tournaments
Serge Gaspers, Matthias Mnich
We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the…