An Augmenting Path Algorithm for the Parity Problem on Linear Matroids - Matthias F. M. Stallmann; Harold N. Gabow (FOCS, 1984)

Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). - Harold N. Gabow; Matthias F. M. Stallmann (ICALP, 1985)

An augmenting path algorithm for linear matroid parity. - Harold N. Gabow; Matthias F. M. Stallmann (Comb., 1986)

Hypercube embedding heuristics: An evaluation. - Woei-Kae Chen; Matthias F. M. Stallmann; Edward F. Gehringer (Int. J. Parallel Program., 1989)

Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. - Carla D. Savage; Matthias F. M. Stallmann; Jo Ellen Perry (Algorithmica, 1990)

Unconstrained via minimization for topological multilayer routing. - Matthias F. M. Stallmann; Thomas A. Hughes; Wentai Liu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

A One-Way Array Algorithm for Matroid Scheduling. - Matthias F. M. Stallmann (SPAA, 1991)

A characterization of network representable polymatroids. - Wolfgang W. Bein; Peter Brucker; Matthias F. M. Stallmann (ZOR Methods Model. Oper. Res., 1991)

GDR: A Visualization Tool for Graph Algorithms. - Matthias F. Stallmann; Rance Cleaveland; Prashant Hebbar (Computational Support for Discrete Mathematics, 1992)

Optimal Reductions of Two-Terminal Directed Acyclic Graphs. - Wolfgang W. Bein; Jerzy Kamburowski; Matthias F. M. Stallmann (SIAM J. Comput., 1992)

Fast Algorithms for One-Dimensional Compaction with Jog Insertion. - Matthias F. M. Stallmann; Thomas A. Hughes (WADS, 1993)

On counting planar embeddings. - Matthias F. M. Stallmann (Discret. Math., 1993)

On Embedding Binary Trees into Hypercubes. - Woei-Kae Chen; Matthias F. M. Stallmann (J. Parallel Distributed Comput., 1995)

Heuristics and Experimental Design for Bigraph Crossing Number Minimization. - Matthias F. M. Stallmann; Franc Brglez; Debabrata Ghosh (ALENEX, 1999)

Evaluating iterative improvement heuristics for bigraph crossing minimization. - Matthias F. M. Stallmann; Franc Brglez; Debabrata Ghosh (ISCAS (6), 1999)

Minimizing the complexity of an activity network. - Jerzy Kamburowski; David J. Michael; Matthias F. M. Stallmann (Networks, 2000)

Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. - Matthias F. M. Stallmann; Franc Brglez; Debabrata Ghosh (ACM J. Exp. Algorithmics, 2001)

New bounds on the barycenter heuristic for bipartite graph drawing. - Xiao Yu Li; Matthias F. M. Stallmann (Inf. Process. Lett., 2002)

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. - Xiao Yu Li; Matthias F. M. Stallmann; Franc Brglez (SAT, 2003)

Optimal one-page tree embeddings in linear time. - Robert A. Hochberg; Matthias F. M. Stallmann (Inf. Process. Lett., 2003)

Effective bounding techniques for solving unate and binate covering problems. - Xiao Yu Li; Matthias F. M. Stallmann; Franc Brglez (DAC, 2005)

On SAT instance classes and a method for reliable performance experiments with SAT solvers. - Franc Brglez; Xiao Yu Li; Matthias F. M. Stallmann (Ann. Math. Artif. Intell., 2005)

High-contrast algorithm behavior: observation, hypothesis, and experimental design. - Matthias F. M. Stallmann; Franc Brglez (Experimental Computer Science, 2007)

ProofChecker: an accessible environment for automata theory correctness proofs. - Matthias F. Stallmann; Suzanne Balik; Robert D. Rodman; Sina Bahram; Michael C. Grace; Susan D. High (ITiCSE, 2007)

A case for smaller class size with integrated lab for introductory computer science. - Kristy Elizabeth Boyer; Rachael S. Dwight; Carolyn S. Miller; C. Dianne Raubenheimer; Matthias F. Stallmann; Mladen A. Vouk (SIGCSE, 2007)

The directional p. - Laura E. Jackson; George N. Rouskas; Matthias F. M. Stallmann (Eur. J. Oper. Res., 2007)

View and index selection for query-performance improvement: quality-centered algorithms and heuristics. - Maxim Kormilitsin; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (CIKM, 2008)

Exact and inexact methods for selecting views and indexes for OLAP performance improvement. - Zohreh Asgharzadeh Talebi; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (EDBT, 2008)

Preface. - Rajeev Raman; Matthias F. Stallmann (ACM J. Exp. Algorithmics, 2008)

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring. - Maxim Kormilitsin; Rada Chirkova; Yahya Fathi; Matthias F. Stallmann (ADBIS, 2009)

A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. - Matthias F. Stallmann (ACM J. Exp. Algorithmics, 2012)

Integrating communication skills in data structures and algorithms courses. - William Eberle; John Karro; Neal Lerner; Matthias F. Stallmann (FIE, 2013)

GSK: universally accessible graph sketching. - Suzanne Balik; Sean P. Mealin; Matthias F. Stallmann; Robert D. Rodman (SIGCSE, 2013)

Including blind people in computing through access to graphs. - Suzanne Balik; Sean P. Mealin; Matthias F. Stallmann; Robert D. Rodman; Michelle L. Glatz; Veronica J. Sigler (ASSETS, 2014)

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems. - Wenbin Chen 003; Nagiza F. Samatova; Matthias F. Stallmann; William Hendrix; Weiqin Ying (Theor. Comput. Sci., 2016)

Algorithm Animation with Galant. - Matthias F. Stallmann (IEEE Computer Graphics and Applications, 2017)

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver. - Matthias F. Stallmann; Yang Ho; Timothy D. Goodrich (CoRR, 2020)

Efficient algorithms for finding 2-medians of a tree. - Aissa Oudjit; Matthias F. Stallmann (Networks, 2021)