Works (66)

2017 journal article

Algorithm animation with galant

IEEE Computer Graphics and Applications, 37(1), 8–14.

By: M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2017 report

Efficient Algorithms for Finding 2-Medians of a Tree

North Carolina State University. Dept. of Computer Science.

By: M. Stallmann & A. Oudjit

Source: ORCID
Added: December 6, 2019

2016 report

A gentle introduction to matroid algorithmics

North Carolina State University. Dept. of Computer Science.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

2016 report

Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer

North Carolina State University. Dept. of Computer Science.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

2016 journal article

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems

Theoretical Computer Science, 609, 434–442.

By: W. Chen, N. Samatova, M. Stallmann, W. Hendrix & W. Ying

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2014 conference paper

Including blind people in computing through access to graphs

Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility, 91–98.

By: S. Balik, S. Mealin, M. Stallmann, R. Rodman, M. Glatz & V. Sigler

Event: ACM

Source: ORCID
Added: December 6, 2019

2013 conference paper

GSK: universally accessible graph sketching

Proceeding of the 44th ACM technical symposium on Computer science education, 221–226.

By: S. Balik, S. Mealin, M. Stallmann & R. Rodman

Event: ACM

Source: ORCID
Added: December 6, 2019

2013 conference paper

Integrating communication skills in data structures and algorithms courses

2013 IEEE Frontiers in Education Conference (FIE), 1503–1509.

By: W. Eberle, J. Karro, N. Lerner & M. Stallmann

Event: IEEE

Source: ORCID
Added: December 6, 2019

2012 journal article

A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study

Journal of Experimental Algorithmics (JEA), 17, 1–3.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

2010 report

Bottleneck crossing minimization in layered graphs

(No. TR-2010-13). Dept of Computer Science, North Carolina State University.

By: M. Stallmann & S. Gupta

Source: ORCID
Added: December 6, 2019

2010 report

High-contrast algorithm behavior: Observation, conjecture, and experimental design

North Carolina State University. Dept. of Computer Science.

By: M. Stallmann & F. Brglez

Source: ORCID
Added: December 6, 2019

2009 chapter

Systematic Exploration of Efficient Query Plans for Automated Database Restructuring

In Advances in Databases and Information Systems (pp. 133–148).

By: M. Kormilitsin, R. Chirkova, Y. Fathi & M. Stallmann

Source: Crossref
Added: March 5, 2020

2009 conference paper

Systematic exploration of efficient query plans for automated database restructuring

East European Conference on Advances in Databases and Information Systems, 133–148.

By: M. Kormilitsin, R. Chirkova, Y. Fathi & M. Stallmann

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

2008 conference paper

Exact and inexact methods for selecting views and indexes for OLAP performance improvement

Proceedings of the 11th international conference on Extending database technology: Advances in database technology, 311–322.

By: Z. Talebi, R. Chirkova, Y. Fathi & M. Stallmann

Event: ACM

Source: ORCID
Added: December 6, 2019

2008 report

Matrix depictions for large layered graphs

(No. TR-2008-17). Dept. Computer Science, North Carolina State University.

By: B. Watson, D. Brink, M. Stallmann, R. Devajaran, M. Rakow, T. Rhyne, H. Patel

Source: ORCID
Added: December 6, 2019

2008 conference paper

View and index selection for query-performance improvement: quality-centered algorithms and heuristics

Proceedings of the 17th ACM conference on Information and knowledge management, 1329–1330.

By: M. Kormilitsin, R. Chirkova, Y. Fathi & M. Stallmann

Event: ACM

Source: ORCID
Added: December 6, 2019

2008 report

Visualizing very large layered graphs with quilts

North Carolina State University. Dept. of Computer Science.

By: B. Watson, D. Brink, T. Lograsso, D. Devajaran, T. Rhyne & H. Patel

Source: ORCID
Added: December 6, 2019

2007 journal article

A case for smaller class size with integrated lab for introductory computer science

ACM SIGCSE Bulletin, 39(1), 341–345.

By: K. Boyer, R. Dwight, C. Miller, C. Raubenheimer, M. Stallmann & M. Vouk

Source: ORCID
Added: December 6, 2019

2007 conference paper

High-contrast algorithm behavior

Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07. Presented at the the 2007 workshop.

By: M. Stallmann & F. Brglez

Event: the 2007 workshop

Sources: Crossref, ORCID
Added: March 23, 2020

2007 conference paper

High-contrast algorithm behavior: observation, hypothesis, and experimental design

Proceedings of the 2007 workshop on Experimental computer science, 12.

By: M. Stallmann & F. Brglez

Event: ACM

Source: ORCID
Added: December 6, 2019

2007 conference paper

Proofchecker: an accessible environment for automata theory correctness proofs

ACM SIGCSE Bulletin, 39(3), 48–52.

By: M. Stallmann, S. Balik, R. Rodman, S. Bahram, M. Grace & S. High

Event: ACM

Source: ORCID
Added: December 6, 2019

2007 journal article

The directional p-median problem: Definition, complexity, and algorithms

European Journal of Operational Research, 179(3), 1097–1108.

By: L. Jackson, G. Rouskas & M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2007 report

View and index selection for query-performance improvement: Algorithms, heuristics and complexity

North Carolina State University. Dept. of Computer Science.

By: M. Kormilitsin, R. Chirkova, Y. Fathi & M. Stallmann

Source: ORCID
Added: December 6, 2019

2006 journal article

All-Integer Dual Simplex for Binate Cover Problems (Draft)

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

2006 report

All-Integer Dual Simplex for Binate Cover Problems (Draft)

By: M. Stallmann

Source: NC State University Libraries
Added: March 23, 2020

2005 conference paper

Effective bounding techniques for solving unate and binate covering problems

Proceedings of the 42nd annual Design Automation Conference, 385–390.

By: X. Li, M. Stallmann & F. Brglez

Event: ACM

Source: ORCID
Added: December 6, 2019

2005 journal article

On SAT instance classes and a method for reliable performance experiments with SAT solvers

Annals of Mathematics and Artificial Intelligence, 43(04-Jan), 1–34.

By: F. Brglez, X. Li & M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2004 chapter

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation

In Theory and Applications of Satisfiability Testing (Vol. 2919, pp. 53–68).

By: X. Li, M. Stallmann & F. Brglez

Sources: NC State University Libraries, Crossref
Added: August 6, 2018

2004 journal article

Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem

Information Sciences.

By: F. Brglez, X. Li, M. Stallmann & B. Militzer

Source: ORCID
Added: December 6, 2019

2004 journal article

On SAT instance classes and a method for reliable performance experiments with SAT solvers

Annals of Mathematics and Artificial Intelligence, 43(1-4), 1–34.

By: F. Brglez, X. Li & M. Stallmann

Sources: Crossref, ORCID
Added: March 5, 2020

2003 conference paper

A local search SAT solver using an effective switching strategy and an efficient unit propagation

International Conference on Theory and Applications of Satisfiability Testing, 53–68.

By: X. Li, M. Stallmann & F. Brglez

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

2003 journal article

Optimal one-page tree embeddings in linear time

Information Processing Letters, 87(2), 59–66.

By: R. Hochberg & M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2003 conference paper

QingTing: a fast SAT solver using local search and efficient unit propagation

Sixth International Conference on Theory and Applications of Satisfiability Testing, 1.

By: X. Li, M. Stallmann & F. Brglez

Source: ORCID
Added: December 6, 2019

2003 article

SATbed User Documentation

By: M. Stallmann, F. Brglez & X. Li

Source: ORCID
Added: December 6, 2019

2003 conference paper

SATbed: A Configurable Environment for Reliable Performance Experiments with SAT Instance Classes and Algorithms

Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing, 5–8.

By: F. Brglez, M. Stallmann & X. Li

Event: Citeseer

Source: ORCID
Added: December 6, 2019

2002 journal article

New bounds on the barycenter heuristic for bipartite graph drawing

Information Processing Letters, 82(6), 293–298.

By: X. Li & M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2002 conference paper

The role of a skeptic agent in testing and benchmarking of SAT algorithms

Fifth International Symposium on theTheory and Applications of Satisfiability Testing. Presented at the Citeseer.

By: F. Brglez, X. Li & M. Stallmann

Event: Citeseer

Source: ORCID
Added: December 6, 2019

2001 journal article

Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization

Journal of Experimental Algorithmics (JEA), 6, 8.

By: M. Stallmann, F. Brglez & D. Ghosh

Source: ORCID
Added: December 6, 2019

2001 article

Programming and Proofs, Teaching Logic in Computer Science

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

2000 journal article

Minimizing the complexity of an activity network

Networks, 36(1), 47–52.

By: J. Kamburowski, D. Michael & M. Stallmann

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

1999 conference paper

Evaluating iterative improvement heuristics for bigraph crossing minimization

ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349), 6, 444–447.

By: M. Stallmann, F. Brglez & D. Ghosh

Event: IEEE

Source: ORCID
Added: December 6, 2019

1999 chapter

Heuristics and experimental design for bigraph crossing number minimization

In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93).

By: M. Stallmann, F. Brglez & D. Ghosh

Sources: NC State University Libraries, ORCID
Added: August 6, 2018

1996 report

Some approximation results in multicasting

Citeseer.

By: P. Manyem & M. Stallmann

Source: ORCID
Added: December 6, 2019

1995 journal article

On embedding binary trees into hypercubes

Journal of Parallel and Distributed Computing, 24(2), 132–138.

By: W. Chen & M. Stallmann

Source: ORCID
Added: December 6, 2019

1994 chapter

GDR: A visualization tool for graph algorithms

In Computational Support for Discrete Mathematics (pp. 17–28). American Mathematical Society.

By: M. Stallmann, R. Cleaveland & P. Hebbar

Source: ORCID
Added: December 6, 2019

1993 conference paper

Fast algorithms for one-dimensionsal compaction with jog insertion

Workshop on Algorithms and Data Structures, 589–600.

By: M. Stallmann & T. Hughes

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

1993 journal article

On counting planar embeddings

Discrete Mathematics, 122(1-3), 385–392.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

1993 journal article

On the minimum dummy-arc problem

RAIRO-Operations Research, 27, 153–168.

By: D. Michael, J. Kamburowski & M. Stallmann

Source: ORCID
Added: December 6, 2019

1992 conference paper

Optimal construction of project activity networks

Proceedings of the 1992 Annual Meeting of the Decision Sciences Institute, San Francisco, 1424–1426.

By: J. Kamburowski, D. Michael & M. Stallmann

Source: ORCID
Added: December 6, 2019

1992 journal article

Optimal reduction of two-terminal directed acyclic graphs

SIAM Journal on Computing, 21(6), 1112–1129.

By: W. Bein, J. Kamburowski & M. Stallmann

Source: ORCID
Added: December 6, 2019

1991 conference paper

A One-way Array Algorithm for Matroid Scheduling

Proceedings of the third annual ACM Symposium on Parallel Algorithms and Architectures, 21(24), 349–356.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

1991 journal article

A characterization of network representable polymatroids

Zeitschrift Für Operations Research, 35(4), 267–272.

By: W. Bein, P. Brucker & M. Stallmann

Source: ORCID
Added: December 6, 2019

1991 report

Alternate characterizations of the complexity graph

Dept of Computer Science, North Carolina State University.

By: W. Bein, J. Kamburowski & M. Stallmann

Source: ORCID
Added: December 6, 2019

1990 conference paper

Local search variants for hypercube embedding

Proceedings of the Fifth Distributed Memory Computing Conference, 1990., 2, 1375–1383.

By: W. Chen & M. Stallmann

Event: IEEE

Source: ORCID
Added: December 6, 2019

1990 journal article

Solving some combinatorial problems on arrays with one-way dataflow

Algorithmica, 5(1-4), 179–199.

By: C. Savage, M. Stallmann & J. Perry

Source: ORCID
Added: December 6, 2019

1990 journal article

Unconstrained via minimization for topological multilayer routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(9), 970–980.

By: M. Stallmann, T. Hughes & W. Liu

Source: ORCID
Added: December 6, 2019

1989 conference paper

Constrained planar embedding problems

Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing, 58–67.

By: M. Stallmann

Source: ORCID
Added: December 7, 2019

1989 journal article

Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability

SIGACT News, 20(4), 74–77.

By: M. Stallmann

Event: at New York, NY, USA

Source: ORCID
Added: December 7, 2019

1989 journal article

Hypercube embedding heuristics: An evaluation

International Journal of Parallel Programming, 18(6), 505–549.

By: W. Chen, M. Stallmann & E. Gehringer

Source: ORCID
Added: December 6, 2019

1988 report

A one-way linear array algorithm for the median filter

North Carolina State University. Center for Communications and Signal Processing.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

1986 journal article

An augmenting path algorithm for linear matroid parity

Combinatorica, 6(2), 123–150.

By: H. Gabow & M. Stallmann

Source: ORCID
Added: December 6, 2019

1985 conference paper

Efficient algorithms for graphic matroid intersection and parity

International Colloquium on Automata, Languages, and Programming, 210–220.

By: H. Gabow & M. Stallmann

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

1985 report

Using PQ-trees for planar embedding problems

North Carolina State University. Dept. of Computer Science.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

1984 conference paper

An augmenting path algorithm for the parity problem on linear matroids

25th Annual Symposium on Foundations of Computer Science, 217–228.

By: M. Stallmann & H. Gabow

Event: IEEE

Source: ORCID
Added: December 6, 2019

1984 journal article

An augmenting path algorithm for the parity problem on linear matroids

Combinatorica, 6.

By: H. Gabow & M. Stallmann

Source: ORCID
Added: December 6, 2019

1983 thesis

AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS.

University of Colorado, Boulder.

By: M. Stallmann

Source: ORCID
Added: December 6, 2019

Employment

1984 - present

North Carolina State University Raleigh, NC, US
Professor Computer Science

1983 - 1984

University of Denver Denver, Colorado, US
Visiting Assistant Professor Mathematics and Computer Science

Education

1979 - 1982

University of Colorado Boulder Boulder, CO, US
PhD Computer Science

1977 - 1978

Yale University New Haven, Connecticut, US
MS Computer Science

1971 - 1974

Yale University New Haven, Connecticut, US
BA Mathematics and Computer Science