Boolean-width of graphs

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

Computing, Computer Science, Mathematics +12

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width

B. Courcelle, Johann A. Makowsky, Udi Rotics · Theory of Computing Systems · 2000 · 788 citations

Computing, Computer Science, Mathematics +14

Graph minors. X. Obstructions to tree-decomposition

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1991 · 670 citations

Natural Sciences, Computer Science, Mathematics +11

Approximating clique-width and branch-width

Sang‐il Oum, Paul Seymour · Journal of Combinatorial Theory Series B · 2006 · 500 citations

Natural Sciences, Computer Science, Mathematics +7

Handle-rewriting hypergraph grammars

Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg · Journal of Computer and System Sciences · 1993 · 326 citations