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

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

2 |
Stronger ILPs for the Graph Genus Problem |
Chimani, Markus et al. |
2019 |

3 |
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast |
Chimani, Markus et al. |
2018 |

4 |
Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments |
Chimani, Markus et al. |
2018 |

5 |
An ILP-based Proof System for the Crossing Number Problem |
Chimani, Markus et al. |
2016 |