No. Title Author Year
1 FO Model Checking of Geometric Graphs Hlineny, Petr et al. 2018
2 On Colourability of Polygon Visibility Graphs Cagirici, Onur et al. 2018
3 Structure and Generation of Crossing-Critical Graphs Dvorák, Zdenek et al. 2018
4 Crossing Number is Hard for Kernelization Hlinený, Petr et al. 2016
5 Inserting Multiple Edges into a Planar Graph Chimani, Markus et al. 2016
6 Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences Gajarsky, Jakub et al. 2012
7 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
8 OASIcs, Volume 13, MEMICS'09, Complete Volume Hlineny, Petr et al. 2012
9 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
10 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI