On the Number of Edges of Fan-Crossing Free Graphs

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 287
  • Download : 505
DC FieldValueLanguage
dc.contributor.authorCheong, Otfriedko
dc.contributor.authorHar-Peled, Sarielko
dc.contributor.authorKim, Heunako
dc.contributor.authorKim, Hyo-Silko
dc.date.accessioned2014-08-28T01:50:59Z-
dc.date.available2014-08-28T01:50:59Z-
dc.date.created2014-06-18-
dc.date.issued2013-12-16-
dc.identifier.citation24th International Symposium on Algorithms and Computation, pp.163 - 173-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10203/187617-
dc.languageEnglish-
dc.publisherISAAC Committee-
dc.titleOn the Number of Edges of Fan-Crossing Free Graphs-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage163-
dc.citation.endingpage173-
dc.citation.publicationname24th International Symposium on Algorithms and Computation-
dc.identifier.conferencecountryHK-
dc.identifier.conferencelocationThe University of Hong Kong-
dc.identifier.doi10.1007/978-3-642-45030-3_16-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorCheong, Otfried-
dc.contributor.nonIdAuthorHar-Peled, Sariel-
dc.contributor.nonIdAuthorKim, Heuna-
dc.contributor.nonIdAuthorKim, Hyo-Sil-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0