@inproceedings{stallmann_brglez_2007, title={High-contrast algorithm behavior}, ISBN={9781595937513}, url={http://dx.doi.org/10.1145/1281700.1281712}, DOI={10.1145/1281700.1281712}, abstractNote={After extensive experiments with two algorithms, CPLEX and our implementation of all-integer dual simplex, we observed extreme differences between the two on a set of design automation benchmarks. In many cases one of the two would find an optimal solution within seconds while the other timed out at one hour.}, booktitle={Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07}, publisher={ACM Press}, author={Stallmann, Matthias F. and Brglez, Franc}, year={2007} }
 @article{brglez_li_stallmann_2005, title={On SAT instance classes and a method for reliable performance experiments with SAT solvers}, volume={43}, ISSN={["1573-7470"]}, DOI={10.1007/s10472-005-0417-5}, number={1-4}, journal={ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE}, author={Brglez, F and Li, XY and Stallmann, MF}, year={2005}, month={Jan}, pages={1–34} }
 @inbook{li_stallmann_brglez_2004, title={A Local search sat solver using an effective switching strategy and an efficient unit propagation}, volume={2919}, ISBN={3540208518}, booktitle={Theory and applications of satisfiability testing: 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003, Selected revised papers}, publisher={Berlin; New York: Springer}, author={Li, X. Y. and Stallmann, M. F. and Brglez, F.}, year={2004}, pages={53–68} }
 @inproceedings{brglez_drechsler_1999, title={Design of experiments in CAD: context and new data sets for ISCAS'99}, volume={6}, DOI={10.1109/iscas.1999.780185}, abstractNote={This paper introduces the background and motivation for the two special sessions at ISCAS'99. The sessions bring together eight papers, each rooted in the methodology of experimental design, and contributed by collaborating teams of distributed participants. The paper briefly outlines the premises of the companion papers that follow, provides a brief description of a typical experimental design, and introduces a design for archival of data sets and results that are to be readily accessible on the Web.}, booktitle={Proceedings of the 1999 IEEE International Symposium on Circuits and systems}, author={Brglez, F. and Drechsler, R.}, year={1999}, pages={424–427} }
 @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} }
 @article{lavana_khetawat_brglez_kozminski_1997, title={Executable workflows: a paradigm for collaborative design on the Internet}, volume={34}, DOI={10.1109/dac.1997.597208}, number={June 1997}, journal={ACM IEEE Design Automation Conference. Proceedings}, author={Lavana, H. and Khetawat, A. and Brglez, F. and Kozminski, K.}, year={1997}, pages={553–558} }