Matthias Stallmann
Cited by
Cited by
Optimal reduction of two-terminal directed acyclic graphs
WW Bein, J Kamburowski, MFM Stallmann
SIAM Journal on Computing 21 (6), 1112-1129, 1992
An augmenting path algorithm for linear matroid parity
HN Gabow, M Stallmann
Combinatorica 6 (2), 123-150, 1986
Efficient algorithms for graphic matroid intersection and parity
HN Gabow, M Stallmann
Automata, Languages and Programming: 12th Colloquium Nafplion, Greece, July …, 1985
Exact and inexact methods for selecting views and indexes for olap performance improvement
ZA Talebi, R Chirkova, Y Fathi, M Stallmann
Proceedings of the 11th international conference on Extending database …, 2008
On embedding binary trees into hypercubes
WK Chen, MFM Stallmann
Journal of Parallel and Distributed Computing 24 (2), 132-138, 1995
The directional p-median problem: Definition, complexity, and algorithms
LE Jackson, GN Rouskas, MFM Stallmann
European Journal of Operational Research 179 (3), 1097-1108, 2007
Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization
M Stallmann, F Brglez, D Ghosh
Journal of Experimental Algorithmics (JEA) 6, 8-es, 2001
Some approximation results in multicasting
P Manyem, M Stallmann
North Carolina State University, 1996
Hypercube embedding heuristics: An evaluation
WK Chen, MFM Stallmann, EF Gehringer
International Journal of Parallel Programming 18 (6), 505-549, 1989
Effective bounding techniques for solving unate and binate covering problems
XY Li, MF Stallmann, F Brglez
Proceedings of the 42nd annual Design Automation Conference, 385-390, 2005
On SAT instance classes and a method for reliable performance experiments with SAT solvers
F Brglez, XY Li, MF Stallmann
Annals of Mathematics and Artificial Intelligence 43 (1), 1-34, 2005
A local search SAT solver using an effective switching strategy and an efficient unit propagation
XY Li, MF Stallmann, F Brglez
Theory and Applications of Satisfiability Testing: 6th International …, 2004
Minimizing the complexity of an activity network
J Kamburowski, DJ Michael, MFM Stallmann
Networks: An International Journal 36 (1), 47-52, 2000
Including blind people in computing through access to graphs
SP Balik, SP Mealin, MF Stallmann, RD Rodman, ML Glatz, VJ Sigler
Proceedings of the 16th international ACM SIGACCESS conference on Computers …, 2014
Optimal one-page tree embeddings in linear time
RA Hochberg, MF Stallmann
Information Processing Letters 87 (2), 59-66, 2003
A case for smaller class size with integrated lab for introductory computer science
KE Boyer, RS Dwight, CS Miller, CD Raubenheimer, MF Stallmann, ...
ACM SIGCSE Bulletin 39 (1), 341-345, 2007
Unconstrained via minimization for topological multilayer routing
M Stallmann, T Hughes, W Liu
IEEE transactions on computer-aided design of integrated circuits and …, 1990
Heuristics and experimental design for bigraph crossing number minimization
M Stallmann, F Brglez, D Ghosh
Workshop on Algorithm Engineering and Experimentation, 74-93, 1999
New bounds on the barycenter heuristic for bipartite graph drawing
XY Li, MF Stallmann
Information Processing Letters 82 (6), 293-298, 2002
Visualizing very large layered graphs with quilts
B Watson, D Brink, TA Lograsso, D Devajaran, TM Rhyne, H Patel
North Carolina State University. Dept. of Computer Science, 2008
The system can't perform the operation now. Try again later.
Articles 1–20