|
Search the dblp DataBase
Matthias F. M. Stallmann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Heuristics and Experimental Design for Bigraph Crossing Number Minimization. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:74-93 [Conf]
- Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
Effective bounding techniques for solving unate and binate covering problems. [Citation Graph (0, 0)][DBLP] DAC, 2005, pp:385-390 [Conf]
- Matthias F. M. Stallmann, Harold N. Gabow
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids [Citation Graph (0, 0)][DBLP] FOCS, 1984, pp:217-228 [Conf]
- Harold N. Gabow, Matthias F. M. Stallmann
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). [Citation Graph (0, 0)][DBLP] ICALP, 1985, pp:210-220 [Conf]
- Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Evaluating iterative improvement heuristics for bigraph crossing minimization. [Citation Graph (0, 0)][DBLP] ISCAS (6), 1999, pp:444-447 [Conf]
- Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. [Citation Graph (0, 0)][DBLP] SAT, 2003, pp:53-68 [Conf]
- Matthias F. M. Stallmann
A One-Way Array Algorithm for Matroid Scheduling. [Citation Graph (0, 0)][DBLP] SPAA, 1991, pp:349-356 [Conf]
- Matthias F. M. Stallmann, Thomas A. Hughes
Fast Algorithms for One-Dimensional Compaction with Jog Insertion. [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:589-600 [Conf]
- Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. [Citation Graph (0, 0)][DBLP] Algorithmica, 1990, v:5, n:2, pp:179-199 [Journal]
- Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann
On SAT instance classes and a method for reliable performance experiments with SAT solvers. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:1-34 [Journal]
- Harold N. Gabow, Matthias F. M. Stallmann
An augmenting path algorithm for linear matroid parity. [Citation Graph (0, 0)][DBLP] Combinatorica, 1986, v:6, n:2, pp:123-150 [Journal]
- Robert A. Hochberg, Matthias F. M. Stallmann
Optimal one-page tree embeddings in linear time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:87, n:2, pp:59-66 [Journal]
- Xiao Yu Li, Matthias F. M. Stallmann
New bounds on the barycenter heuristic for bipartite graph drawing. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:6, pp:293-298 [Journal]
- Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:8- [Journal]
- Woei-Kae Chen, Matthias F. M. Stallmann
On Embedding Binary Trees into Hypercubes. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1995, v:24, n:2, pp:132-138 [Journal]
- Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann
Minimizing the complexity of an activity network. [Citation Graph (0, 0)][DBLP] Networks, 2000, v:36, n:1, pp:47-52 [Journal]
- Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:6, pp:1112-1129 [Journal]
- Matthias F. M. Stallmann, Thomas A. Hughes, Wentai Liu
Unconstrained via minimization for topological multilayer routing. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:9, pp:970-980 [Journal]
- Laura E. Jackson, George N. Rouskas, Matthias F. M. Stallmann
The directional p. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2007, v:179, n:3, pp:1097-1108 [Journal]
- Matthias F. M. Stallmann
On counting planar embeddings. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:122, n:1-3, pp:385-392 [Journal]
High-contrast algorithm behavior: observation, hypothesis, and experimental design. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|