Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Integer and combinatorial optimization
Integer and combinatorial optimization
Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
A new viewpoint on two-level logic minimization
DAC '93 Proceedings of the 30th international Design Automation Conference
Two-level logic minimization: an overview
Integration, the VLSI Journal
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Solving covering problems using LPR-based lower bounds
DAC '97 Proceedings of the 34th annual Design Automation Conference
Negative thinking by incremental problem solving: application to unate covering
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A Lagrangian-based heuristic for large-scale set covering problems
Mathematical Programming: Series A and B - Special issue on computational integer programming
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
A Heuristic Algorithm for the Set Covering Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Explicit and implicit algorithms for binate covering problems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the 40th annual Design Automation Conference
Effective bounding techniques for solving unate and binate covering problems
Proceedings of the 42nd annual Design Automation Conference
Scalable subgraph mapping for acyclic computation accelerators
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
| Hi-index | 0.00 |