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

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