An experimental study on algorithms for drawing binary trees.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/apvis/RusuJSC06
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/apvis/RusuJSC06
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Adrian_Rusu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christopher_Clement
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Confesor_Santiago
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Radu_Jianu
>
foaf:
homepage
<
http://dx.doi.org/10.1016%2FS0925-7721%2801%2900066-9
>
foaf:
homepage
<
https://dl.acm.org/citation.cfm?id=1151916
>
dc:
identifier
DBLP conf/apvis/RusuJSC06
(xsd:string)
dc:
identifier
DOI 10.1016%2FS0925-7721%2801%2900066-9
(xsd:string)
dcterms:
issued
2006
(xsd:gYear)
rdfs:
label
An experimental study on algorithms for drawing binary trees.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Adrian_Rusu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christopher_Clement
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Confesor_Santiago
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Radu_Jianu
>
swrc:
pages
85-88
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/apvis/2006
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/apvis/RusuJSC06/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/apvis/RusuJSC06
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/apvis/apvis2006.html#RusuJSC06
>
rdfs:
seeAlso
<
https://dl.acm.org/citation.cfm?id=1151916
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/apvis
>
dc:
subject
binary trees, drawing algorithm, experimental study, planar, straight-line
(xsd:string)
dc:
title
An experimental study on algorithms for drawing binary trees.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document