Your search returned the following 4 documents:

4. Computing Locally Coherent Discourses.
   Ernst Althaus, Nikiforos Karamanis, and Alexander Koller
   In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, Barcelona, Spain, 2004, 399-406
   
3. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
   Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
   Journal of Algorithms 48: 194-219, 2003
   
   
2. A Polynomial-Time Fragment of Dominance Constraints
   Alexander Koller, Kurt Mehlhorn, and Joachim Niehren
   In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), Hong-Kong, October, 3-6, 2000, 368-375
   [PDF: Download: 151.pdf] [PDF: Download: Mehlhorn151.pdf]
   
1. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
   Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel
   In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington DC, USA, January, 7 - January, 9, 2001, 815-824