Partitioning VLSI Floorplans by Staircase Channels for Global Routing.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/vlsid/MajumderNB98
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/vlsid/MajumderNB98
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bhargab_B._Bhattacharya
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Subhas_C._Nandy
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Subhashis_Majumder
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FICVD.1998.646579
>
foaf:
homepage
<
https://doi.org/10.1109/ICVD.1998.646579
>
dc:
identifier
DBLP conf/vlsid/MajumderNB98
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FICVD.1998.646579
(xsd:string)
dcterms:
issued
1998
(xsd:gYear)
rdfs:
label
Partitioning VLSI Floorplans by Staircase Channels for Global Routing.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bhargab_B._Bhattacharya
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Subhas_C._Nandy
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Subhashis_Majumder
>
swrc:
pages
59-64
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/vlsid/1998
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/vlsid/MajumderNB98/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/vlsid/MajumderNB98
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/vlsid/vlsid1998.html#MajumderNB98
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ICVD.1998.646579
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/vlsid
>
dc:
subject
Global routing, partitioning, maxflow-mincut, algorithms, complexity, NP-completeness.
(xsd:string)
dc:
title
Partitioning VLSI Floorplans by Staircase Channels for Global Routing.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document