The Largest Empty Annulus Problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès. The Largest Empty Annulus Problem. In Peter M. A. Sloot, Chih Jeng Kenneth Tan, Jack Dongarra, Alfons G. Hoekstra, editors, Computational Science - ICCS 2002, International Conference, Amsterdam, The Netherlands, April 21-24, 2002. Proceedings, Part III. Volume 2331 of Lecture Notes in Computer Science, pages 46-54, Springer, 2002. [doi]

The following publications are possibly variants of this publication:

The Largest Empty Annulus ProblemJosé Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès. ijcga, 13(4):317-325, 2003. [doi]

Computing Largest Empty SlabsJosé Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès. iccsa 2004: 99-108 [doi]

runs on WebDSL