No. Title Author Year
1 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
2 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
3 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
4 The Parameterized Complexity of Oriented Colouring Ganian, Robert 2009
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint Published by LZI