Algorithms for VLSI Physical Design Automation
Chapter 2: Business Efficiency Lesson Plan Business Efficiency Visiting Vertices-Graph Theory Problem Hamiltonian Circuits Vacation Planning Problem Minimum.
22nd European Workshop on Computational Geometry Institute of Software Technology 4th FSP-Seminar Industrial Geometry, March 2007 Maximizing Maximal Angles.
Hybrid Evolutionary Algorithms on Minimum Vertex Cover for Random Graphs
Impact on current processes Acknowledgments Literature Cited Abstract Minimum Pots for the Usual Suspects Recent exciting advances in DNA self-assembly.
Formal Engineering Research with Models Abstractions and Transformations FERMAT Low Power Hardware Synthesis from Concurrent Action Oriented Specifications.
Fixed parameter tractability and kernelization for the Maximum Leaf Weight Spanning Tree problem
Compact Representations of Separable Graphs
Discharging Fire-Works!
vlsi doc
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and (Local) Treewidth MohammadTaghi Hajiaghayi CS & AI Lab M.I.T. Joint work mainly.
