| 2007 |
|---|
| 21 | EE | Matthias F. M. Stallmann,
Franc Brglez:
High-contrast algorithm behavior: observation, hypothesis, and experimental design.
Experimental Computer Science 2007: 12 |
| 20 | EE | Laura E. Jackson,
George N. Rouskas,
Matthias F. M. Stallmann:
The directional p.
European Journal of Operational Research 179(3): 1097-1108 (2007) |
| 2005 |
|---|
| 19 | EE | Xiao Yu Li,
Matthias F. M. Stallmann,
Franc Brglez:
Effective bounding techniques for solving unate and binate covering problems.
DAC 2005: 385-390 |
| 18 | EE | 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): 1-34 (2005) |
| 2003 |
|---|
| 17 | EE | 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: 53-68 |
| 16 | EE | Robert A. Hochberg,
Matthias F. M. Stallmann:
Optimal one-page tree embeddings in linear time.
Inf. Process. Lett. 87(2): 59-66 (2003) |
| 2002 |
|---|
| 15 | EE | Xiao Yu Li,
Matthias F. M. Stallmann:
New bounds on the barycenter heuristic for bipartite graph drawing.
Inf. Process. Lett. 82(6): 293-298 (2002) |
| 2001 |
|---|
| 14 | | Matthias F. M. Stallmann,
Franc Brglez,
Debabrata Ghosh:
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization.
ACM Journal of Experimental Algorithmics 6: 8 (2001) |
| 2000 |
|---|
| 13 | EE | Jerzy Kamburowski,
David J. Michael,
Matthias F. M. Stallmann:
Minimizing the complexity of an activity network.
Networks 36(1): 47-52 (2000) |
| 1999 |
|---|
| 12 | EE | Matthias F. M. Stallmann,
Franc Brglez,
Debabrata Ghosh:
Heuristics and Experimental Design for Bigraph Crossing Number Minimization.
ALENEX 1999: 74-93 |
| 11 | EE | Matthias F. M. Stallmann,
Franc Brglez,
Debabrata Ghosh:
Evaluating iterative improvement heuristics for bigraph crossing minimization.
ISCAS (6) 1999: 444-447 |
| 1995 |
|---|
| 10 | | Woei-Kae Chen,
Matthias F. M. Stallmann:
On Embedding Binary Trees into Hypercubes.
J. Parallel Distrib. Comput. 24(2): 132-138 (1995) |
| 1993 |
|---|
| 9 | | Matthias F. M. Stallmann,
Thomas A. Hughes:
Fast Algorithms for One-Dimensional Compaction with Jog Insertion.
WADS 1993: 589-600 |
| 8 | EE | Matthias F. M. Stallmann:
On counting planar embeddings.
Discrete Mathematics 122(1-3): 385-392 (1993) |
| 1992 |
|---|
| 7 | | Wolfgang W. Bein,
Jerzy Kamburowski,
Matthias F. M. Stallmann:
Optimal Reductions of Two-Terminal Directed Acyclic Graphs.
SIAM J. Comput. 21(6): 1112-1129 (1992) |
| 1991 |
|---|
| 6 | EE | Matthias F. M. Stallmann:
A One-Way Array Algorithm for Matroid Scheduling.
SPAA 1991: 349-356 |
| 1990 |
|---|
| 5 | | Carla D. Savage,
Matthias F. M. Stallmann,
Jo Ellen Perry:
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.
Algorithmica 5(2): 179-199 (1990) |
| 4 | EE | Matthias F. M. Stallmann,
Thomas A. Hughes,
Wentai Liu:
Unconstrained via minimization for topological multilayer routing.
IEEE Trans. on CAD of Integrated Circuits and Systems 9(9): 970-980 (1990) |
| 1986 |
|---|
| 3 | | Harold N. Gabow,
Matthias F. M. Stallmann:
An augmenting path algorithm for linear matroid parity.
Combinatorica 6(2): 123-150 (1986) |
| 1985 |
|---|
| 2 | | Harold N. Gabow,
Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract).
ICALP 1985: 210-220 |
| 1984 |
|---|
| 1 | | Matthias F. M. Stallmann,
Harold N. Gabow:
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids
FOCS 1984: 217-228 |
