No. |
Title |
Author |
Year |
---|

1 |
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12 |
Bokal, Drago et al. |
2019 |

2 |
FO Model Checking of Geometric Graphs |
Hlineny, Petr et al. |
2018 |

3 |
On Colourability of Polygon Visibility Graphs |
Cagirici, Onur et al. |
2018 |

4 |
Structure and Generation of Crossing-Critical Graphs |
Dvorák, Zdenek et al. |
2018 |

5 |
Crossing Number is Hard for Kernelization |
Hlinený, Petr et al. |
2016 |

6 |
Inserting Multiple Edges into a Planar Graph |
Chimani, Markus et al. |
2016 |

7 |
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences |
Gajarsky, Jakub et al. |
2012 |

8 |
Lower Bounds on the Complexity of MSO_1 Model-Checking |
Ganian, Robert et al. |
2012 |

9 |
OASIcs, Volume 13, MEMICS'09, Complete Volume |
Hlineny, Petr et al. |
2012 |

10 |
Clique-width: When Hard Does Not Mean Impossible |
Ganian, Robert et al. |
2011 |

11 |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width |
Ganian, Robert et al. |
2010 |

12 |
Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) |
Hlinený, Petr et al. |
2009 |