Matthias F. M. Stallmann

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