Projects per year

Original language | German |
---|---|

Title of host publication | Algorithms, 21st Annual European Symposium |

Publisher | Springer |

Pages | 13-24 |

Publication status | Published - 2013 |

Event | Annual European Symposium on Algorithms - Sophia Antipolis, France Duration: 2 Sep 2013 → 4 Sep 2013 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

### Conference

Conference | Annual European Symposium on Algorithms |
---|---|

Country | France |

City | Sophia Antipolis |

Period | 2/09/13 → 4/09/13 |

### Fields of Expertise

- Information, Communication & Computing

### Treatment code (Nähere Zuordnung)

- Basic - Fundamental (Grundlagenforschung)
- Theoretical

## Projects

- 1 Finished

### FWF - ComPoSe - EuroGIAG_Erdös-Szekeres type problems for colored point sets and compatible graphs

1/10/11 → 31/12/15

Project: Research project

## Cite this

Aichholzer, O., Mulzer, W., & Pilz, A. (2013). Flip distance between triangulations of a simple polygon is NP-complete. In

*Algorithms, 21st Annual European Symposium*(pp. 13-24). (Lecture Notes in Computer Science). Springer.