|
Search the dblp DataBase
José Miguel Díaz-Báñez:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
Reverse facility location problems. [Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:68-71 [Conf]
- José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado
Some problems on approximation of set of points by polygonal curves. [Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf]
- José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (3), 2002, pp:46-54 [Conf]
- José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura
The Anchored Voronoi Diagram. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:207-216 [Conf]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
Computing Largest Empty Slabs. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:99-108 [Conf]
- José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
Optimal Point Set Projections onto Regular Grids. [Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:270-279 [Conf]
- José Miguel Díaz-Báñez, Ferran Hurtado
Computing obnoxious 1-corner polygonal chains. [Citation Graph (0, 0)][DBLP] Computers & OR, 2006, v:33, n:, pp:1117-1128 [Journal]
- José Miguel Díaz-Báñez, Ferran Hurtado, Henk Meijer, David Rappaport, Joan Antoni Sellarès
The Largest Empty Annulus Problem. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2003, v:13, n:4, pp:317-325 [Journal]
- José Miguel Díaz-Báñez, Francisco Gómez, Inmaculada Ventura
The Anchored Voronoi Diagram: Static, Dynamic Versions and Applications. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2006, v:16, n:4, pp:315-332 [Journal]
- José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado
Approximation of Point Sets by 1-Corner Polygonal Chains. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2000, v:12, n:4, pp:317-323 [Journal]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
On finding a widest empty 1-corner corridor. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:98, n:5, pp:199-205 [Journal]
- Jose Antonio Barcia Gomez, José Miguel Díaz-Báñez, Antonio Jose Lozano, Inmaculada Ventura
Computing an obnoxious anchored segment. [Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:293-300 [Journal]
- José Miguel Díaz-Báñez, Ferran Hurtado, Mario Alberto López, Joan Antoni Sellarès
Optimal projections onto grids and finite resolution images. [Citation Graph (0, 0)][DBLP] J. Visual Communication and Image Representation, 2005, v:16, n:3, pp:233-249 [Journal]
- José Miguel Díaz-Báñez, Mario Alberto López, Joan Antoni Sellarès
Locating an obnoxious plane. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:173, n:2, pp:556-564 [Journal]
- José Miguel Díaz-Báñez, P. A. Ramos, P. Sabariego
The maximin line problem with regional demand. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:181, n:1, pp:20-29 [Journal]
- José Miguel Díaz-Báñez, Juan A. Mesa, Anita Schöbel
Continuous location of dimensional structures. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2004, v:152, n:1, pp:22-44 [Journal]
- Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura
On finding widest empty curved corridors. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2007, v:38, n:3, pp:154-169 [Journal]
Covering point sets with two convex objects. [Citation Graph (, )][DBLP]
Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|