No. Title Author Year
1 Isomorphism Problem for S_d-Graphs Ağaoğlu, Deniz et al. 2020
2 Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12 Bokal, Drago et al. 2019
3 FO Model Checking of Geometric Graphs Hlineny, Petr et al. 2018
4 On Colourability of Polygon Visibility Graphs Cagirici, Onur et al. 2018
5 Structure and Generation of Crossing-Critical Graphs Dvorák, Zdenek et al. 2018
6 Crossing Number is Hard for Kernelization Hlinený, Petr et al. 2016
7 Inserting Multiple Edges into a Planar Graph Chimani, Markus et al. 2016
8 Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences Gajarsky, Jakub et al. 2012
9 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
10 OASIcs, Volume 13, MEMICS'09, Complete Volume Hlineny, Petr et al. 2012
11 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
12 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
13 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: 13


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