Linear-time algorithms for geometric graphs with sublinearly many crossings.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/soda/EppsteinGS09
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/soda/EppsteinGS09
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Darren_Strash
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_Eppstein
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_T._Goodrich
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F1.9781611973068.18
>
foaf:
homepage
<
https://doi.org/10.1137/1.9781611973068.18
>
dc:
identifier
DBLP conf/soda/EppsteinGS09
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F1.9781611973068.18
(xsd:string)
dcterms:
issued
2009
(xsd:gYear)
rdfs:
label
Linear-time algorithms for geometric graphs with sublinearly many crossings.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Darren_Strash
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_Eppstein
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_T._Goodrich
>
swrc:
pages
150-159
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/soda/2009
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/soda/EppsteinGS09/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/soda/EppsteinGS09
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/soda/soda2009.html#EppsteinGS09
>
rdfs:
seeAlso
<
https://doi.org/10.1137/1.9781611973068.18
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/soda
>
dc:
title
Linear-time algorithms for geometric graphs with sublinearly many crossings.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document