@inproceedings{ghosh_brglez_1999, title={Equivalence classes of circuit mutants for experimental design}, volume={6}, DOI={10.1109/iscas.1999.780187}, abstractNote={Experimental Design, as defined in science and manufacturing, relies on data sets that belong to well-defined equivalence classes. This paper introduces a method to generate tightly controlled equivalence classes of circuit mutants, given the graph-based characterization of a reference netlist, which an general may contain cycles. A set of experiments that measure the performance for a number of core algorithms in CAD demonstrates merits of the method.}, booktitle={Proceedings of the 1999 IEEE International Symposium on Circuits and systems}, author={Ghosh, D. and Brglez, F.}, year={1999}, pages={432–435} }
 @inbook{stallmann_brglez_ghosh_1999, title={Heuristics and experimental design for bigraph crossing number minimization}, volume={1619}, ISBN={3540662278}, DOI={10.1007/3-540-48518-x_5}, abstractNote={The bigraph crossing problem, embedding the two vertex sets of a bipartite graph G = (V 0; V 1; E) along two parallel lines so that edge crossings are minimized, has application to circuit layout and graph drawing. We consider the case where both V 0 and V 1 can be permuted arbitrarily — both this and the case where the order of one vertex set is fixed are NP-hard. Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented. The new heuristics outperform existing heuristics on graph classes that range from application-specific to random. Our experimental design methodology ensures that differences in performance are statistically significant and not the result of minor variations in graph structure or input order.}, booktitle={Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999.}, publisher={Berlin; New York: Springer}, author={Stallmann, Matthias and Brglez, F. and Ghosh, D.}, year={1999}, pages={74–93} }