Nested Graph Dissection and Approximation Algorithms. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/focs/Guha00>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Sudipto_Guha>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892072>
foaf:homepage	<https://doi.org/10.1109/SFCS.2000.892072>
dc:identifier	DBLP conf/focs/Guha00 (xsd:string)
dc:identifier	DOI doi.org%2F10.1109%2FSFCS.2000.892072 (xsd:string)
dcterms:issued	2000 (xsd:gYear)
rdfs:label	Nested Graph Dissection and Approximation Algorithms. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Sudipto_Guha>
swrc:pages	126-135 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/focs/Guha00/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/focs/Guha00>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/focs/focs2000.html#Guha00>
rdfs:seeAlso	<https://doi.org/10.1109/SFCS.2000.892072>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject	computational geometry; approximation theory; graph theory; polynomials; nested graph dissection; approximation algorithms; nested dissection paradigm; upper bound; chordal completion size; polynomial term; vertex ranking; planar embedding (xsd:string)
dc:title	Nested Graph Dissection and Approximation Algorithms. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document