| Computational Recognition Of Rna Splice Sites By Exact Algorithms For The Quadratic Traveling Salesman Problem | 2 | 0.37 | 2015 |
| An Optimized Platform For Capturing Metadata Of Historical Correspondence | 0 | 0.34 | 2015 |
| Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. | 10 | 0.53 | 2014 |
| A backbone based TSP heuristic for large instances | 4 | 0.40 | 2014 |
| User-friendly lemmatization and morphological annotation of Early New High German manuscripts. | 0 | 0.34 | 2014 |
| Model Checking for PLC based Railway Interlocking Systems. | 0 | 0.34 | 2013 |
| Optimized platform for capturing metadata of historical correspondences. | 0 | 0.34 | 2013 |
| BDD-based Analysis of Test Cases for PLC-based Railway Interlocking Systems. | 0 | 0.34 | 2011 |
| Finding good tours for huge Euclidean TSP instances by iterative backbone contraction | 2 | 0.37 | 2010 |
| Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones | 2 | 0.38 | 2009 |
| Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges | 5 | 0.46 | 2009 |
| Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order | 12 | 0.60 | 2008 |
| Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP | 10 | 0.65 | 2007 |
| What Graphs can be Efficiently Represented by BDDs? | 0 | 0.34 | 2007 |
| Tolerance based contract-or-patch heuristic for the asymmetric TSP | 10 | 0.55 | 2006 |
| Polynomial Formal Verification of Multipliers | 16 | 0.92 | 2003 |
| What are the samples for learning efficient routing heuristics? [MCM routing] | 0 | 0.34 | 2002 |
| Limits of Using Signatures for Permutation Independent Boolean Comparison | 28 | 1.49 | 2002 |
| Application of BDDs in Boolean matching techniques for formal logic combinational verification | 2 | 0.38 | 2001 |
| A pipelined architecture for partitioned DWT based lossy image compression using FPGA's | 16 | 1.25 | 2001 |
| Least Upper Bounds for the Size of OBDDs Using Symmetry Properties | 10 | 0.69 | 2000 |
| Prove that a faulty multiplier is faulty!? | 3 | 0.42 | 2000 |
| k-Layer Straightline Crossing Minimization by Speeding Up Sifting | 3 | 0.44 | 2000 |
| Using Sifting for k -Layer Straightline Crossing Minimization | 34 | 1.67 | 1999 |
| Establishing latch correspondence for sequential circuits using distinguishing signatures | 5 | 0.57 | 1999 |
| Modeling the Communication Behavior of Distributed Memory Machines by Genetic Programming | 1 | 0.36 | 1998 |
| Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetries | 15 | 0.89 | 1997 |
| On the generation of area-time optimal testable adders | 8 | 0.63 | 1995 |
| On the implementation of an efficient performance driven generator for conditional-sum-adders | 1 | 0.36 | 1993 |
| A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization | 5 | 0.49 | 1993 |
| Performance Driven k-Layer Wiring | 2 | 0.43 | 1992 |
| Constrained via minimization for systolic arrays | 2 | 0.40 | 1990 |
| A note on hierarchical layer-assignment | 3 | 0.45 | 1989 |
