- Woei-Kae Chen Department of Electrical and Computer Engineering
- Minimizing the Complexity of an Activity Network Jerzy Kamburowski
- High-Contrast Algorithm Behavior: Observation, Hypothesis, and Experimental Design
- 1Stallmann/Brglez, High contrast... ExpCS, 2007/06/14, San Diego High-Contrast Algorithm Behavior
- All-Integer Dual Simplex for Binate Cover Problems Matthias Stallmann
- Effective Bounding Techniques For Solving Unate and Binate Covering Problems
- Annals of Mathematics and Artificial Intelligence (2005) 43: 134 Springer 2004 On SAT instance classes and a method for reliable
- Li, Xiao Yu. Optimization Algorithms for the Minimum-Cost Satisfiability Problem. (Under the direction of Dr. Matthias F. Stallmann and Dr. Franc Brglez)
- 25 July 2003 A revised version of the paper published at
- Information Processing Letters 87 (2003) 5966 www.elsevier.com/locate/ipl
- GDR: A VISUALIZATION TOOL FOR GRAPH ALGORITHMS MATTHIAS STALLMANN , RANCE CLEAVELAND AND PRASHANT HEBBAR
- GDR User Documentation last modi cation: 19 March 1992
- Recherche o@rationnelle/OperationsResearch (vol. 27, no 2, 1993, p. 153 2 168)
- Matthias F.M. Stallmann Department of Computer Science
- A ONE-WAY ARRAY ALGORITHM FOR MATROID SCHEDULING MATTHIAS F.M. STALLMANNy
- Matthias F.M. Stallmann Department of Computer Science
- An efficient data structure for representing the set of all distinct planar embeddings of a biconnected graph is given (This data stucture is based on PQ-
- 15 July 2003 Accepted for SAT'2003 LNAI Issue to be published by Springer-Verlag
- On Embedding Binary Trees into Hypercubes Woei-Kae Chen
- GDR: A VISUALIZATION TOOL FOR GRAPH MATTHIAS STALLMANN , RANGE CLEAVELAND AND
- GDR Programmer Documentation last modi cation: 19 March 1992
- Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
- SATbed User Documentation (Version 0.70, to be released 31 July 2003)
- NEW BOUNDS ON THE BARYCENTER HEURISTIC FOR BIPARTITE GRAPH DRAWING
- , verifying Concurrent Processes Using 18 pages.1982,
- PQ-trees and the Set of All Distinct Planar Embeddings of a Graph
