13 citations · 48 across the 11 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.LO2011★ 3 cited
Lower Bounds on the Complexity of MSO1 Model-Checking
Robert Ganian, Petr Hliněný, Alexander Langer +3
One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quant…
cs.DS2011★ 5 cited
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
Alexander Langer, Peter Rossmanith, Somnath Sikdar
We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankw…