No. Title Author Year
1 Crossing Number is Hard for Kernelization Hlinený, Petr et al. 2016
2 Inserting Multiple Edges into a Planar Graph Chimani, Markus et al. 2016
3 Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences Gajarsky, Jakub et al. 2012
4 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
5 OASIcs, Volume 13, MEMICS'09, Complete Volume Hlineny, Petr et al. 2012
6 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
7 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
8 Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) Hlinený, Petr et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 8

DROPS-Home | Fulltext Search | Imprint Published by LZI