• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

personal communication (1997)

Cached

  • Download as a PDF

Download Links

  • [www.bioelectromagnetics.org]
  • [jgaa.info]
  • [www.cs.brown.edu]
  • [www.cs.brown.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Co-chairs James Lin , Bruce Mcleod
Citations:21 - 1 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Lin97personalcommunication,
    author = {Co-chairs James Lin and Bruce Mcleod},
    title = {personal communication},
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

these abstracts from the Eighteenth Annual Scientific Meeting may not present completed work nor were they formally peer-reviewed for technical content. Individuals wishing to reference or quote from these abstracts in whole or part should obtain the author's permission. Abstracts were optically scanned and then edited for entry into this compilation. But since the process is not perfect, errors may have been introduced, for which we apologize.

Citations

864 An Efficient Heuristic Procedure for Partitioning Graphs - Kernighan, Lin - 1970
89 A packing problem with applications to lettering of maps - Formann, Wagner - 1991
79 N.C.: Edge crossings in drawings of bipartite graphs - Eades, Wormald - 1994
64 A polylogarithmic approximation of the minimum bisection - Feige, Krauthgamer - 2002
52 Positioning names on maps - Imhof - 1975
50 Geometry helps in Matching - Vaidya - 1989
41 Jonsson Computers and Interactability, A Guide to the Theory of NP-Completeness - Garey, David - 1979
30 A 0.699-approximation algorithm for max-bisection - Ye - 2001
24 Wol . Map labeling heuristics: Provably good and practically useful - Wagner, Alexander - 1995
18 Boundary labeling: Models and efficient algorithms for rectangular maps - Bekos, Kaufmann, et al.
17 The map-labeling bibliography - Wolff
12 NP-hardness of some map labeling problems - Iturriaga, Lubiw - 1997
10 One sided crossing minimization is np-hard for sparse graphs - Munoz, Unger, et al. - 2002
9 Chazelle and 36 co-authors. The computational geometry impact task force report - unknown authors - 1999
6 Map Labeling with Application to Graph Drawing - Neyer
4 Boundary labelling of optimal total leader length - Bekos, Kaufmann, et al. - 2005
4 Polygons Labelling of Minimum Leader Length - Bekos, Kaufmann, et al. - 2006
3 Algorithms for Multi-criteria One-Sided Boundary Labeling - Benkert, Haverkort, et al. - 2007
2 Bler: A boundary labeller for technical drawings - Bekos, Symvonis - 2005
2 On the complexity of finding balanced oneway cuts - Feige, Yahalom - 2003
1 Approximate map labeling is in ω(n logn - Wagner - 1994
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University