The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mira Lee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na
    A note on maximally repeated sub-patterns of a point set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1965-1968 [Journal]
  2. Otfried Cheong, Hazel Everett, Marc Glisse, Joachim Gudmundsson, Samuel Hornus, Sylvain Lazard, Mira Lee, Hyeon-Suk Na
    Farthest-Polygon Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:407-418 [Conf]
  3. Otfried Cheong, Mira Lee
    The Hadwiger Number of Jordan Regions is Unbounded [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  4. Otfried Cheong, Herman J. Haverkort, Mira Lee
    Computing a Minimum-Dilation Spanning Tree is NP-hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  5. Otfried Cheong, Mira Lee
    The Hadwiger Number of Jordan Regions Is Unbounded. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:4, pp:497-501 [Journal]

  6. Computing a Minimum-Dilation Spanning Tree is NP-hard. [Citation Graph (, )][DBLP]


  7. Computing a minimum-dilation spanning tree is NP-hard. [Citation Graph (, )][DBLP]


  8. Farthest-Polygon Voronoi Diagrams [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002