| No. |
Title |
Author |
Year |
| 1 |
Graph Product Structure for h-Framed Graphs |
Bekos, Michael A. et al. |
2022 |
| 2 |
Parameterised Partially-Predrawn Crossing Number |
Hamm, Thekla et al. |
2022 |
| 3 |
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases |
Bok, Jan et al. |
2021 |
| 4 |
Twin-Width Is Linear in the Poset Width |
Balabán, Jakub et al. |
2021 |
| 5 |
Isomorphism Problem for S_d-Graphs |
Ağaoğlu, Deniz et al. |
2020 |
| 6 |
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12 |
Bokal, Drago et al. |
2019 |
| 7 |
FO Model Checking of Geometric Graphs |
Hlineny, Petr et al. |
2018 |
| 8 |
On Colourability of Polygon Visibility Graphs |
Cagirici, Onur et al. |
2018 |
| 9 |
Structure and Generation of Crossing-Critical Graphs |
Dvorák, Zdenek et al. |
2018 |
| 10 |
Crossing Number is Hard for Kernelization |
Hlinený, Petr et al. |
2016 |
| 11 |
Inserting Multiple Edges into a Planar Graph |
Chimani, Markus et al. |
2016 |
| 12 |
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences |
Gajarsky, Jakub et al. |
2012 |
| 13 |
Lower Bounds on the Complexity of MSO_1 Model-Checking |
Ganian, Robert et al. |
2012 |
| 14 |
OASIcs, Volume 13, MEMICS'09, Complete Volume |
Hlineny, Petr et al. |
2012 |
| 15 |
Clique-width: When Hard Does Not Mean Impossible |
Ganian, Robert et al. |
2011 |
| 16 |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width |
Ganian, Robert et al. |
2010 |
| 17 |
Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) |
Hlinený, Petr et al. |
2009 |
