Efficient algorithms for finding 2‐medians of a tree von Oudjit, Aissa, Stallmann, Matthias F.

Volltext

On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems von Chen, Wenbin, Samatova, Nagiza F., Stallmann, Matthias F., Hendrix, William, Ying, Weiqin

Volltext

The directional p-median problem: Definition, complexity, and algorithms von Jackson, Laura E., Rouskas, George N., Stallmann, Matthias F.M.

Volltext

A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study von Stallmann, Matthias F.

Volltext

Optimal one-page tree embeddings in linear time von Hochberg, Robert A., Stallmann, Matthias F.

Volltext

On SAT instance classes and a method for reliable performance experiments with SAT solvers von Brglez, Franc, Li, Xiao Yu, Stallmann, Matthias F.

Volltext

On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems von Chen, Wenbin, Samatova, Nagiza F., Stallmann, Matthias F., Hendrix, William, Ying, Weiqin

Volltext

New bounds on the barycenter heuristic for bipartite graph drawing von Li, Xiao Yu, Stallmann, Matthias F.

Volltext

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation von Li, Xiao Yu, Stallmann, Matthias F., Brglez, Franc

Volltext

Effective bounding techniques for solving unate and binate covering problems von Li, Xiao Yu, Stallmann, Matthias F., Brglez, Franc

Volltext

Fast algorithms for one-dimensionsal compaction with jog insertion von Stallmann, Matthias F. M., Hughes, Thomas A.

Volltext

Integrating communication skills in data structures and algorithms courses von Eberle, William, Karro, John, Lerner, Neal, Stallmann, Matthias

Volltext

The directional p-median problem : Definition, complexity, and algorithms : Advances in location analysis von JACKSON, Laura E, ROUSKAS, George N, STALLMANN, Matthias F. M

Volltext

Efficient algorithms for graphic matroid intersection and parity von Gabow, Harold N., Stallmann, Matthias

Volltext

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver von Stallmann, Matthias F, Ho, Yang, Goodrich, Timothy D

Volltext bestellen

Optimal reduction of two terminal directed acyclic graphs von BEIN, W. W, KAMBUROWSKI, J, STALLMANN, M. F. M

Volltext

Algorithm Animation with Galant von Stallmann, Matthias F.

Volltext

Hypercube embedding heuristics: an evaluation von WOEI-KAE CHEN, STALLMANN, M. F. M, GEHRINGER, E. F

Volltext

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization von Stallmann, Matthias, Brglez, Franc, Ghosh, Debabrata

Volltext

ProofChecker: an accessible environment for automata theory correctness proofs von Stallmann, Matthias F., Balik, Suzanne P., Rodman, Robert D., Bahram, Sina, Grace, Michael C., High, Susan D.

Volltext