Jorge Urrutia
TitoloCitata daAnno
Routing with guaranteed delivery in ad hoc wireless networks
P Bose, P Morin, I Stojmenović, J Urrutia
Wireless networks 7 (6), 609-616, 2001
23392001
Compass routing on geometric networks
E Kranakis, H Singh, J Urrutia
in Proc. 11 th Canadian Conference on Computational Geometry, 1999
11741999
Art gallery and illumination problems
J Urrutia
Handbook of computational geometry, 973-1027, 2000
5152000
Handbook of computational geometry
JR Sack, J Urrutia
Elsevier, 1999
4391999
Flipping edges in triangulations
F Hurtado, M Noy, J Urrutia
Discrete & Computational Geometry 22 (3), 333-346, 1999
1551999
Comparability graphs and intersection graphs
MC Golumbic, D Rotem, J Urrutia
Discrete Mathematics 43 (1), 37-46, 1983
1481983
Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters
M Atkinson, N Santoro, J Urrutia
IEEE Transactions on Communications 34 (6), 614-617, 1986
781986
On minimizing the sum of sensor movements for barrier coverage of a line segment
J Czyzowicz, E Kranakis, D Krizanc, I Lambadaris, L Narayanan, ...
International Conference on Ad-Hoc Networks and Wireless, 29-42, 2010
682010
Art gallery and illumination problems. Handbook on computational geometry
J Urrutia
Elsevier, 973-1027, 2000
642000
The floodlight problem
P Bose, L Guibas, A Lubiw, M Overmars, D Souvaine, J Urrutia
International Journal of Computational Geometry & Applications 7 (01n02 …, 1997
641997
On minimizing the maximum sensor movement for barrier coverage of a line segment
J Czyzowicz, E Kranakis, D Krizanc, I Lambadaris, L Narayanan, ...
International Conference on Ad-Hoc Networks and Wireless, 194-212, 2009
632009
Immobilizing a polytope
J Czyzowicz, I Stojmenovic, J Urrutia
Workshop on Algorithms and Data Structures, 214-227, 1991
621991
Simultaneous edge flipping in triangulations
J Galtier, F Hurtado, M Noy, S Pérennes, J Urrutia
International Journal of Computational Geometry & Applications 13 (02), 113-133, 2003
542003
Routing with guaranteed delivery in geometric and wireless networks
J Urrutia
Handbook of wireless networks and mobile computing 18, 393-406, 2002
522002
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
512009
Augmenting the connectivity of geometric graphs
M Abellanas, A García, F Hurtado, J Tejel, J Urrutia
Computational Geometry 40 (3), 220-230, 2008
512008
Immobilizing a shape
J Czyzowicz, I Stojmenovic, J Urrutia
International Journal of Computational Geometry & Applications 9 (02), 181-206, 1999
511999
Complexity of barrier coverage with relocatable sensors in the plane
S Dobrev, S Durocher, M Eftekhari, K Georgiou, E Kranakis, D Krizanc, ...
Theoretical Computer Science 579, 64-73, 2015
502015
Finding maximum cliques in circle graphs
D Rotem, J Urrutia
Networks 11 (3), 269-278, 1981
501981
Simple alternating path problem.
J Akiyama, J Urrutia
Discrete Mathematics 84 (1), 101-103, 1990
491990
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20