Concepedia
Lecture notes in computer science · 2013 · 25 citations · 14 references
Open access
ComputingComputer ScienceAlgorithmsTheory Of ComputationNumber-theoretic AlgorithmsParameterized AlgorithmsModular Arithmetic AlgorithmsModular Complexity ClassesParameterized Complexity
14
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
Modular decomposition and transitive orientation
Ross M. McConnell, Jeremy Spinrad · Discrete Mathematics · 1999 · 432 citations
Computing, Computer Science, Representation Theory +6
Set Partitioning via Inclusion-Exclusion
Andreas Björklund, Thore Husfeldt, Mikko Koivisto · SIAM Journal on Computing · 2009 · 374 citations
Natural Sciences, Computer Science, Mathematics +17
Combinatorial Optimization on Graphs of Bounded Treewidth
Hans L. Bodlaender, Arie M. C. A. Koster · The Computer Journal · 2007 · 296 citations
Natural Sciences, Computer Science, Mathematics +10
Rank-width and vertex-minors
Sang‐il Oum · Journal of Combinatorial Theory Series B · 2005 · 230 citations