Matthias F. M. Stallmann

Publication Activity (10 Years)

Years Active: 1984-2007
Publications (10 Years): 0

Publications

Matthias F. M. Stallmann, Franc Brglez
High-contrast algorithm behavior: observation, hypothesis, and experimental design. Experimental Computer Science (2007)
Laura E. Jackson, George N. Rouskas, Matthias F. M. Stallmann
The directional p. Eur. J. Oper. Res. 179 (3) (2007)
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
Effective bounding techniques for solving unate and binate covering problems. DAC (2005)
Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann
On SAT instance classes and a method for reliable performance experiments with SAT solvers. Ann. Math. Artif. Intell. 43 (1) (2005)
Robert A. Hochberg, Matthias F. M. Stallmann
Optimal one-page tree embeddings in linear time. Inf. Process. Lett. 87 (2) (2003)
Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. SAT (2003)
Xiao Yu Li, Matthias F. M. Stallmann
New bounds on the barycenter heuristic for bipartite graph drawing. Inf. Process. Lett. 82 (6) (2002)
Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. ACM J. Exp. Algorithmics 6 (2001)
Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
Minimizing the complexity of an activity network. Networks 36 (1) (2000)
Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Heuristics and Experimental Design for Bigraph Crossing Number Minimization. ALENEX (1999)
Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Evaluating iterative improvement heuristics for bigraph crossing minimization. ISCAS (6) (1999)
Woei-Kae Chen, Matthias F. M. Stallmann
On Embedding Binary Trees into Hypercubes. J. Parallel Distributed Comput. 24 (2) (1995)
Matthias F. M. Stallmann, Thomas A. Hughes
Fast Algorithms for One-Dimensional Compaction with Jog Insertion. WADS (1993)
Matthias F. M. Stallmann
On counting planar embeddings. Discret. Math. 122 (1-3) (1993)
Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21 (6) (1992)
Matthias F. M. Stallmann
A One-Way Array Algorithm for Matroid Scheduling. SPAA (1991)
Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann
A characterization of network representable polymatroids. ZOR Methods Model. Oper. Res. 35 (4) (1991)
Matthias F. M. Stallmann, Thomas A. Hughes, Wentai Liu
Unconstrained via minimization for topological multilayer routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (9) (1990)
Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. Algorithmica 5 (2) (1990)
Woei-Kae Chen, Matthias F. M. Stallmann, Edward F. Gehringer
Hypercube embedding heuristics: An evaluation. Int. J. Parallel Program. 18 (6) (1989)
Harold N. Gabow, Matthias F. M. Stallmann
An augmenting path algorithm for linear matroid parity. Comb. 6 (2) (1986)
Harold N. Gabow, Matthias F. M. Stallmann
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ICALP (1985)
Matthias F. M. Stallmann, Harold N. Gabow
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids FOCS (1984)