@article{oudjit_stallmann_2021, title={Efficient algorithms for finding2-mediansof a tree}, volume={77}, ISSN={["1097-0037"]}, url={https://doi.org/10.1002/net.21978}, DOI={10.1002/net.21978}, abstractNote={AbstractThe p‐median problem for networks is NP‐hard, but polynomial time algorithms exist for trees (n is the number of nodes): O(pn2) by Tamir, and O(n lgp + 2 n) by Benkoczi and Bhattacharya. Goldman gave an O(n) algorithm for the 1‐median problem on trees. Mirchandani and Oudjit proved localization properties for 2‐medians on trees; these were later used to obtain an O(nlg n) bound, and, in special cases, O(n) . We present a framework that unifies all efficient algorithms for the 2‐median problem on trees. Our framework isolates the nonlinear part of the computation so that future time‐bound improvements are easily incorporated. We also introduce a method for reducing the search space, improving all known runtimes in many instances. Finally, we give a new algorithm for the case where edge lengths are positive integers. The associated time bound is O(n  +  D) , where D is the sum of the logarithms of edge lengths. This is O(n) if edge lengths are bounded by a constant and O(n lglg n) if they are O(lg n) . The algorithm is flexible enough to extend to noninteger edge lengths, preserving the time bound in some circumstances.}, number={3}, journal={NETWORKS}, publisher={Wiley}, author={Oudjit, Aissa and Stallmann, Matthias F.}, year={2021}, month={Apr}, pages={383–402} }
 @article{stallmann_2017, title={Algorithm Animation with Galant}, volume={37}, ISSN={["1558-1756"]}, DOI={10.1109/mcg.2017.2}, abstractNote={Although surveys suggest positive student attitudes toward the use of algorithm animations, it is not clear that they improve learning outcomes. The Graph Algorithm Animation Tool, or Galant, challenges and motivates students to engage more deeply with algorithm concepts, without distracting them with programming language details or GUIs. Even though Galant is specifically designed for graph algorithms, it has also been used to animate other algorithms, most notably sorting algorithms.}, number={1}, journal={IEEE COMPUTER GRAPHICS AND APPLICATIONS}, publisher={IEEE}, author={Stallmann, Matthias F.}, year={2017}, pages={8–14} }
 @book{stallmann_oudjit_2017, title={Efficient Algorithms for Finding 2-Medians of a Tree}, institution={North Carolina State University. Dept. of Computer Science}, author={Stallmann, Matthias and Oudjit, Aissa}, year={2017} }
 @book{stallmann_2016, title={A gentle introduction to matroid algorithmics}, institution={North Carolina State University. Dept. of Computer Science}, author={Stallmann, Matthias}, year={2016} }
 @book{stallmann_2016, title={Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer}, institution={North Carolina State University. Dept. of Computer Science}, author={Stallmann, Matthias}, year={2016} }
 @article{chen_samatova_stallmann_hendrix_ying_2016, title={On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems}, volume={609}, ISSN={["1879-2294"]}, DOI={10.1016/j.tcs.2015.10.031}, abstractNote={In some application cases, the solutions of combinatorial optimization problems on graphs should satisfy an additional vertex size constraint. In this paper, we consider size-constrained minimum s–t cut problems and size-constrained dense subgraph problems. We introduce the minimum s–t cut with at-least-k vertices problem, the minimum s–t cut with at-most-k vertices problem, and the minimum s–t cut with exactly k vertices problem. We prove that they are NP-complete. Thus, they are not polynomially solvable unless P=NP. On the other hand, we also study the densest at-least-k-subgraph problem (DalkS) and the densest at-most-k-subgraph problem (DamkS) introduced by Andersen and Chellapilla [1]. We present a polynomial time algorithm for DalkS when k is bounded by some constant c. We also present two approximation algorithms for DamkS. The first approximation algorithm for DamkS has an approximation ratio of n−1k−1, where n is the number of vertices in the input graph. The second approximation algorithm for DamkS has an approximation ratio of O(nδ), for some δ<1/3.}, journal={THEORETICAL COMPUTER SCIENCE}, author={Chen, Wenbin and Samatova, Nagiza F. and Stallmann, Matthias F. and Hendrix, William and Ying, Weiqin}, year={2016}, month={Jan}, pages={434–442} }
 @inproceedings{balik_mealin_stallmann_rodman_glatz_sigler_2014, title={Including blind people in computing through access to graphs}, booktitle={Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility}, author={Balik, Suzanne P and Mealin, Sean P and Stallmann, Matthias F and Rodman, Robert D and Glatz, Michelle L and Sigler, Veronica J}, year={2014}, pages={91–98} }
 @inproceedings{balik_mealin_stallmann_rodman_2013, title={GSK: universally accessible graph sketching}, booktitle={Proceeding of the 44th ACM technical symposium on Computer science education}, author={Balik, Suzanne P and Mealin, Sean P and Stallmann, Matthias F and Rodman, Robert D}, year={2013}, pages={221–226} }
 @inproceedings{eberle_karro_lerner_stallmann_2013, title={Integrating communication skills in data structures and algorithms courses}, booktitle={2013 IEEE Frontiers in Education Conference (FIE)}, author={Eberle, William and Karro, John and Lerner, Neal and Stallmann, Matthias}, year={2013}, pages={1503–1509} }
 @article{stallmann_2012, title={A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study}, volume={17}, journal={Journal of Experimental Algorithmics (JEA)}, publisher={ACM}, author={Stallmann, Matthias F}, year={2012}, pages={1–3} }
 @book{stallmann_gupta_2010, title={Bottleneck crossing minimization in layered graphs}, number={TR-2010-13}, institution={Dept of Computer Science, North Carolina State University}, author={Stallmann, Matthias F and Gupta, Saurabh}, year={2010} }
 @book{stallmann_brglez_2010, title={High-contrast algorithm behavior: Observation, conjecture, and experimental design}, institution={North Carolina State University. Dept. of Computer Science}, author={Stallmann, Matthias F and Brglez, Franc}, year={2010} }
 @inbook{kormilitsin_chirkova_fathi_stallmann_2009, title={Systematic Exploration of Efficient Query Plans for Automated Database Restructuring}, ISBN={9783642039720 9783642039737}, ISSN={0302-9743 1611-3349}, url={http://dx.doi.org/10.1007/978-3-642-03973-7_11}, DOI={10.1007/978-3-642-03973-7_11}, abstractNote={We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the views/indexes selected to be materialized. We propose a novel end-to-end approach that focuses on systematic exploration of plans for evaluating the queries. Specifically, we propose a framework (architecture) and algorithms that enable selection of views/indexes that contribute to the most efficient plans for the input queries, subject to the space bound. We present strong optimality guarantees on our architecture. Our algorithms search for sets of competitive plans for queries expressed in the language of conjunctive queries with arithmetic comparisons. This language captures the full expressive power of SQL select-project-join queries, which are common in practical database systems. Our experimental results demonstrate the competitiveness and scalability of our approach.}, booktitle={Advances in Databases and Information Systems}, publisher={Springer Berlin Heidelberg}, author={Kormilitsin, Maxim and Chirkova, Rada and Fathi, Yahya and Stallmann, Matthias}, year={2009}, pages={133–148} }
 @inproceedings{kormilitsin_chirkova_fathi_stallmann_2009, title={Systematic exploration of efficient query plans for automated database restructuring}, booktitle={East European Conference on Advances in Databases and Information Systems}, author={Kormilitsin, Maxim and Chirkova, Rada and Fathi, Yahya and Stallmann, Matthias}, year={2009}, pages={133–148} }
 @inproceedings{talebi_chirkova_fathi_stallmann_2008, title={Exact and inexact methods for selecting views and indexes for OLAP performance improvement}, booktitle={Proceedings of the 11th international conference on Extending database technology: Advances in database technology}, author={Talebi, Zohreh Asgharzadeh and Chirkova, Rada and Fathi, Yahya and Stallmann, Matthias}, year={2008}, pages={311–322} }
 @book{watson_brink_stallmann_devajaran_rakow_rhyne_patel_2008, title={Matrix depictions for large layered graphs}, number={TR-2008-17}, institution={Dept. Computer Science, North Carolina State University}, author={Watson, BA and Brink, David and Stallmann, Matthias and Devajaran, Ravinder and Rakow, Matt and Rhyne, Theresa-Marie and Patel, Himesh}, year={2008} }
 @inproceedings{kormilitsin_chirkova_fathi_stallmann_2008, title={View and index selection for query-performance improvement: quality-centered algorithms and heuristics}, booktitle={Proceedings of the 17th ACM conference on Information and knowledge management}, author={Kormilitsin, Maxim and Chirkova, Rada and Fathi, Yahya and Stallmann, Matthias}, year={2008}, pages={1329–1330} }
 @book{watson_brink_lograsso_devajaran_rhyne_patel_2008, title={Visualizing very large layered graphs with quilts}, institution={North Carolina State University. Dept. of Computer Science}, author={Watson, Benjamin and Brink, David and Lograsso, Thomas A and Devajaran, D and Rhyne, Theresa-Marie and Patel, Himesh}, year={2008} }
 @article{boyer_dwight_miller_raubenheimer_stallmann_vouk_2007, title={A case for smaller class size with integrated lab for introductory computer science}, volume={39}, number={1}, journal={ACM SIGCSE Bulletin}, publisher={ACM}, author={Boyer, Kristy Elizabeth and Dwight, Rachael S and Miller, Carolyn S and Raubenheimer, C Dianne and Stallmann, Matthias F and Vouk, Mladen A}, year={2007}, pages={341–345} }
 @inproceedings{stallmann_brglez_2007, title={High-contrast algorithm behavior}, ISBN={9781595937513}, url={http://dx.doi.org/10.1145/1281700.1281712}, DOI={10.1145/1281700.1281712}, abstractNote={After extensive experiments with two algorithms, CPLEX and our implementation of all-integer dual simplex, we observed extreme differences between the two on a set of design automation benchmarks. In many cases one of the two would find an optimal solution within seconds while the other timed out at one hour.}, booktitle={Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07}, publisher={ACM Press}, author={Stallmann, Matthias F. and Brglez, Franc}, year={2007} }
 @inproceedings{stallmann_brglez_2007, title={High-contrast algorithm behavior: observation, hypothesis, and experimental design}, booktitle={Proceedings of the 2007 workshop on Experimental computer science}, author={Stallmann, Matthias F and Brglez, Franc}, year={2007}, pages={12} }
 @inproceedings{stallmann_balik_rodman_bahram_grace_high_2007, title={Proofchecker: an accessible environment for automata theory correctness proofs}, volume={39}, number={3}, booktitle={ACM SIGCSE Bulletin}, author={Stallmann, Matthias F and Balik, Suzanne P and Rodman, Robert D and Bahram, Sina and Grace, Michael C and High, Susan D}, year={2007}, pages={48–52} }
 @book{kormilitsin_chirkova_fathi_stallmann_2007, title={View and index selection for query-performance improvement: Algorithms, heuristics and complexity}, institution={North Carolina State University. Dept. of Computer Science}, author={Kormilitsin, Maxim and Chirkova, Rada Y and Fathi, Yahya and Stallmann, Matthias F}, year={2007} }
 @article{stallmann_2006, title={All-Integer Dual Simplex for Binate Cover Problems (Draft)}, url={https://people.engr.ncsu.edu/mfms/Publications/int-dual.pdf}, author={Stallmann, Matthias}, year={2006} }
 @book{stallmann_2006, title={All-Integer Dual Simplex for Binate Cover Problems (Draft)}, author={Stallmann, M.}, year={2006} }
 @article{jackson_rouskas_stallmann_2007, title={The directional p-median problem: Definition, complexity, and algorithms}, volume={179}, ISSN={["0377-2217"]}, DOI={10.1016/j.ejor.2005.06.080}, abstractNote={An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. p-Median is polynomially solvable in one dimension but NP-hard in two or more dimensions, when either the Euclidean or the rectilinear distance measure is used. In this paper, we treat the p-median problem under a new distance measure, the directional rectilinear distance, which requires the assigned supply point for a given demand point to lie above and to the right of it. In a previous work, we showed that the directional p-median problem is polynomially solvable in one dimension; we give here an improved solution through reformulating the problem as a special case of the constrained shortest path problem. We have previously proven that the problem is NP-complete in two or more dimensions; we present here an efficient heuristic to solve it. Compared to the robust Teitz and Bart heuristic, our heuristic enjoys substantial speedup while sacrificing little in terms of solution quality, making it an ideal choice for real-world applications with thousands of demand points.}, number={3}, journal={EUROPEAN JOURNAL OF OPERATIONAL RESEARCH}, author={Jackson, Laura E. and Rouskas, George N. and Stallmann, Matthias F. M.}, year={2007}, month={Jun}, pages={1097–1108} }
 @inproceedings{li_stallmann_brglez_2005, title={Effective bounding techniques for solving unate and binate covering problems}, booktitle={Proceedings of the 42nd annual Design Automation Conference}, author={Li, Xiao Yu and Stallmann, Matthias F and Brglez, Franc}, year={2005}, pages={385–390} }
 @inbook{li_stallmann_brglez_2004, title={A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation}, volume={2919}, ISBN={9783540208518 9783540246053}, ISSN={0302-9743 1611-3349}, url={http://dx.doi.org/10.1007/978-3-540-24605-3_5}, DOI={10.1007/978-3-540-24605-3_5}, abstractNote={Advances in local-search SAT solvers have traditionally been presented in the context of local search solvers only. The most recent and rather comprehensive comparisons between UnitWalk and several versions of WalkSAT demonstrate that neither solver dominates on all benchmarks. QingTing2 (a ‘dragonfly’ in Mandarin) is a SAT solver script that relies on a novel switching strategy to invoke one of the two local search solvers: WalkSAT or QingTing1. The local search solver QingTing1 implements the UnitWalk algorithm with a new unit-propagation technique. The experimental methodology we use not only demonstrates the effectiveness of the switching strategy and the efficiency of the new unit-propagation implementation – it also supports, on the very same instances, statistically significant performance evaluation between local search and other state-of-the-art DPLL-based SAT solvers. The resulting comparisons show a surprising pattern of solver dominance, completely unanticipated when we began this work.}, booktitle={Theory and Applications of Satisfiability Testing}, publisher={Springer Berlin Heidelberg}, author={Li, Xiao Yu and Stallmann, Matthias F. and Brglez, Franc}, year={2004}, pages={53–68} }
 @article{brglez_li_stallmann_militzer_2004, title={Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem}, journal={Information Sciences}, author={Brglez, Franc and Li, Xiao Y and Stallmann, Matthias F and Militzer, Burkhard}, year={2004} }
 @article{brglez_li_stallmann_2005, title={On SAT instance classes and a method for reliable performance experiments with SAT solvers}, volume={43}, ISSN={["1573-7470"]}, DOI={10.1007/s10472-005-0417-5}, number={1-4}, journal={ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE}, author={Brglez, F and Li, XY and Stallmann, MF}, year={2005}, month={Jan}, pages={1–34} }
 @article{brglez_li_stallmann_2004, title={On SAT instance classes and a method for reliable performance experiments with SAT solvers}, volume={43}, ISSN={1012-2443 1573-7470}, url={http://dx.doi.org/10.1007/s10472-005-0417-5}, DOI={10.1007/s10472-004-9417-0}, number={1-4}, journal={Annals of Mathematics and Artificial Intelligence}, publisher={Springer Science and Business Media LLC}, author={Brglez, Franc and Li, Xiao Yu and Stallmann, Matthias F.}, year={2004}, month={Dec}, pages={1–34} }
 @inproceedings{li_stallmann_brglez_2003, title={A local search SAT solver using an effective switching strategy and an efficient unit propagation}, booktitle={International Conference on Theory and Applications of Satisfiability Testing}, author={Li, Xiao Yu and Stallmann, Matthias F and Brglez, Franc}, year={2003}, pages={53–68} }
 @article{hochberg_stallmann_2003, title={Optimal one-page tree embeddings in linear time}, volume={87}, ISSN={["1872-6119"]}, DOI={10.1016/S0020-0190(03)00261-8}, abstractNote={In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for trees algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach [SIAM J. Comput. 8 (1979) 15-32] and Chung [Comput. Math. Appl. 10 (1984) 43-60], respectively. We present a linear-time algorithm for finding the optimal embedding (arrangement) in a restricted but important class of embeddings called one-page embeddings.}, number={2}, journal={INFORMATION PROCESSING LETTERS}, author={Hochberg, RA and Stallmann, MF}, year={2003}, month={Jul}, pages={59–66} }
 @inproceedings{li_stallmann_brglez_2003, title={QingTing: a fast SAT solver using local search and efficient unit propagation}, volume={1}, booktitle={Sixth International Conference on Theory and Applications of Satisfiability Testing}, author={Li, Xiao Yu and Stallmann, Matthias F and Brglez, Franc}, year={2003} }
 @article{stallmann_brglez_li_2003, title={SATbed User Documentation}, url={https://people.engr.ncsu.edu/mfms/Publications/2003-SATbed-home-guide.pdf}, author={Stallmann, Matthias F and Brglez, Franc and Li, Xiao Yu}, year={2003} }
 @inproceedings{brglez_stallmann_li_2003, title={SATbed: A Configurable Environment for Reliable Performance Experiments with SAT Instance Classes and Algorithms}, booktitle={Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing}, author={Brglez, Franc and Stallmann, Matthias F and Li, Xiao Yu}, year={2003}, pages={5–8} }
 @article{li_stallmann_2002, title={New bounds on the barycenter heuristic for bipartite graph drawing}, volume={82}, ISSN={["0020-0190"]}, DOI={10.1016/S0020-0190(01)00297-6}, abstractNote={The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well known that the barycenter heuristic can give solutions as bad as Ω(n) times the optimum, where n is the number of nodes in the graph. However, the example used in the proof has many isolated nodes. Mäkinen [EATCS Bull. 70 (2000) 156–158] conjectured that a better performance ratio is possible if isolated nodes are not present. We show that the performance ratio for the barycenter heuristic is still Ω(n) even for connected bipartite graphs. We also prove a tight constant ratio for the barycenter heuristic on bounded-degree graphs. The performance ratio is d−1, where d is the maximum degree of a node in the layer that can be permuted.}, number={6}, journal={INFORMATION PROCESSING LETTERS}, author={Li, XY and Stallmann, MF}, year={2002}, month={Jun}, pages={293–298} }
 @inproceedings{brglez_li_stallmann_2002, title={The role of a skeptic agent in testing and benchmarking of SAT algorithms}, booktitle={Fifth International Symposium on theTheory and Applications of Satisfiability Testing}, author={Brglez, Franc and Li, X and Stallmann, M}, year={2002} }
 @article{stallmann_brglez_ghosh_2001, title={Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization}, volume={6}, journal={Journal of Experimental Algorithmics (JEA)}, publisher={ACM}, author={Stallmann, Matthias and Brglez, Franc and Ghosh, Debabrata}, year={2001}, pages={8} }
 @article{stallmann_2001, title={Programming and Proofs, Teaching Logic in Computer Science}, url={https://people.engr.ncsu.edu/mfms/ProofChecker/2001-concept.pdf}, author={Stallmann, Matthias F}, year={2001} }
 @article{kamburowski_michael_stallmann_2000, title={Minimizing the complexity of an activity network}, volume={36}, ISSN={["0028-3045"]}, DOI={10.1002/1097-0037(200008)36:1<47::AID-NET5>3.0.CO;2-Q}, abstractNote={When an activity-on-arc (AoA) project network is to be constructed, one typically seeks to minimize the number of dummy arcs. Recent investigations have shown, however, that the computational effort of many network-oriented project management techniques depends strongly on the so-called complexity index (CI) of a network. We show other justifications for minimizing the CI rather than the number of dummy arcs. We also present a polynomial time algorithm for constructing an AoA network with the minimum CI in the class of all AoA networks having the minimum number of nodes. © 2000 John Wiley & Sons, Inc.}, number={1}, journal={NETWORKS}, author={Kamburowski, J and Michael, DJ and Stallmann, MFM}, year={2000}, month={Aug}, pages={47–52} }
 @inproceedings{stallmann_brglez_ghosh_1999, title={Evaluating iterative improvement heuristics for bigraph crossing minimization}, volume={6}, booktitle={ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349)}, author={Stallmann, Matthias and Brglez, Franc and Ghosh, Debabrata}, year={1999}, pages={444–447} }
 @inbook{stallmann_brglez_ghosh_1999, title={Heuristics and experimental design for bigraph crossing number minimization}, volume={1619}, ISBN={3540662278}, DOI={10.1007/3-540-48518-x_5}, abstractNote={The bigraph crossing problem, embedding the two vertex sets of a bipartite graph G = (V 0; V 1; E) along two parallel lines so that edge crossings are minimized, has application to circuit layout and graph drawing. We consider the case where both V 0 and V 1 can be permuted arbitrarily — both this and the case where the order of one vertex set is fixed are NP-hard. Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented. The new heuristics outperform existing heuristics on graph classes that range from application-specific to random. Our experimental design methodology ensures that differences in performance are statistically significant and not the result of minor variations in graph structure or input order.}, booktitle={Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999.}, publisher={Berlin; New York: Springer}, author={Stallmann, Matthias and Brglez, F. and Ghosh, D.}, year={1999}, pages={74–93} }
 @book{manyem_stallmann_1996, title={Some approximation results in multicasting}, institution={Citeseer}, author={Manyem, Prabhu and Stallmann, M}, year={1996} }
 @article{chen_stallmann_1995, title={On embedding binary trees into hypercubes}, volume={24}, number={2}, journal={Journal of Parallel and Distributed Computing}, publisher={Academic Press}, author={Chen, Woei-Kae and Stallmann, Matthias FM}, year={1995}, pages={132–138} }
 @inbook{stallmann_cleaveland_hebbar_1994, title={GDR: A visualization tool for graph algorithms}, booktitle={Computational Support for Discrete Mathematics}, publisher={American Mathematical Society}, author={Stallmann, Matthias and Cleaveland, Rance and Hebbar, Prashant}, year={1994}, pages={17–28} }
 @inproceedings{stallmann_hughes_1993, title={Fast algorithms for one-dimensionsal compaction with jog insertion}, booktitle={Workshop on Algorithms and Data Structures}, author={Stallmann, Matthias FM and Hughes, Thomas A}, year={1993}, pages={589–600} }
 @article{stallmann_1993, title={On counting planar embeddings}, volume={122}, number={1-3}, journal={Discrete mathematics}, publisher={Elsevier}, author={Stallmann, Matthias FM}, year={1993}, pages={385–392} }
 @article{michael_kamburowski_stallmann_1993, title={On the minimum dummy-arc problem}, volume={27}, journal={RAIRO-Operations Research}, author={Michael, David J. and Kamburowski, Jerzy and Stallmann, Matthias F.}, year={1993}, pages={153–168} }
 @inproceedings{kamburowski_michael_stallmann_1992, title={Optimal construction of project activity networks}, booktitle={Proceedings of the 1992 Annual Meeting of the Decision Sciences Institute, San Francisco}, author={Kamburowski, J and Michael, DJ and Stallmann, MFM}, year={1992}, pages={1424–1426} }
 @article{bein_kamburowski_stallmann_1992, title={Optimal reduction of two-terminal directed acyclic graphs}, volume={21}, number={6}, journal={SIAM Journal on Computing}, publisher={SIAM}, author={Bein, Wolfgang W and Kamburowski, Jerzy and Stallmann, Matthias FM}, year={1992}, pages={1112–1129} }
 @inproceedings{stallmann_1991, title={A One-way Array Algorithm for Matroid Scheduling}, volume={21}, number={24}, booktitle={Proceedings of the third annual ACM Symposium on Parallel Algorithms and Architectures}, author={Stallmann, Matthias FM}, year={1991}, pages={349–356} }
 @article{bein_brucker_stallmann_1991, title={A characterization of network representable polymatroids}, volume={35}, number={4}, journal={Zeitschrift für Operations Research}, publisher={Physica-Verlag}, author={Bein, Wolfgang W and Brucker, Peter and Stallmann, Matthias FM}, year={1991}, pages={267–272} }
 @book{bein_kamburowski_stallmann_1991, title={Alternate characterizations of the complexity graph}, institution={Dept of Computer Science, North Carolina State University}, author={Bein, Wolfgang W and Kamburowski, Jerzy and Stallmann, Matthias FM}, year={1991} }
 @inproceedings{chen_stallmann_1990, title={Local search variants for hypercube embedding}, volume={2}, booktitle={Proceedings of the Fifth Distributed Memory Computing Conference, 1990.}, author={Chen, Woei-Kae and Stallmann, Matthias FM}, year={1990}, pages={1375–1383} }
 @article{savage_stallmann_perry_1990, title={Solving some combinatorial problems on arrays with one-way dataflow}, volume={5}, number={1-4}, journal={Algorithmica}, publisher={Springer-Verlag}, author={Savage, Carla D and Stallmann, Matthias and Perry, Jo Ellen}, year={1990}, pages={179–199} }
 @article{stallmann_hughes_liu_1990, title={Unconstrained via minimization for topological multilayer routing}, volume={9}, number={9}, journal={IEEE transactions on computer-aided design of integrated circuits and systems}, publisher={IEEE}, author={Stallmann, Matthias and Hughes, Thomas and Liu, Wentai}, year={1990}, pages={970–980} }
 @inproceedings{stallmann_1989, title={Constrained planar embedding problems}, booktitle={Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing}, author={Stallmann, Matthias F.}, year={1989}, pages={58–67} }
 @article{stallmann_1989, place={New York, NY, USA}, title={Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability}, volume={20}, url={http://doi.acm.org/10.1145/74074.74086}, DOI={10.1145/74074.74086}, abstractNote={article Free Access Share on Course outline: course announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability Author: M. Stallman View Profile Authors Info & Claims ACM SIGACT NewsVolume 20Issue 4Nov. 1989 pp 74–77https://doi.org/10.1145/74074.74086Online:01 November 1989Publication History 0citation89DownloadsMetricsTotal Citations0Total Downloads89Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF}, number={4}, journal={SIGACT News}, publisher={ACM}, author={Stallmann, M.}, year={1989}, month={Nov}, pages={74–77} }
 @article{chen_stallmann_gehringer_1989, title={Hypercube embedding heuristics: An evaluation}, volume={18}, number={6}, journal={International Journal of Parallel Programming}, publisher={Kluwer Academic Publishers-Plenum Publishers}, author={Chen, Woei-Kae and Stallmann, Matthias FM and Gehringer, Edward F}, year={1989}, pages={505–549} }
 @book{stallmann_1988, title={A one-way linear array algorithm for the median filter}, institution={North Carolina State University. Center for Communications and Signal Processing}, author={Stallmann, Matthias F}, year={1988} }
 @article{gabow_stallmann_1986, title={An augmenting path algorithm for linear matroid parity}, volume={6}, number={2}, journal={Combinatorica}, publisher={Springer-Verlag}, author={Gabow, Harold N and Stallmann, Matthias}, year={1986}, pages={123–150} }
 @inproceedings{gabow_stallmann_1985, title={Efficient algorithms for graphic matroid intersection and parity}, booktitle={International Colloquium on Automata, Languages, and Programming}, author={Gabow, Harold N and Stallmann, Matthias}, year={1985}, pages={210–220} }
 @book{stallmann_1985, title={Using PQ-trees for planar embedding problems}, institution={North Carolina State University. Dept. of Computer Science}, author={Stallmann, Matthias}, year={1985} }
 @inproceedings{stallmann_gabow_1984, title={An augmenting path algorithm for the parity problem on linear matroids}, booktitle={25th Annual Symposium on Foundations of Computer Science}, author={Stallmann, Matthias and Gabow, Harold N}, year={1984}, pages={217–228} }
 @article{gabow_stallmann_1984, title={An augmenting path algorithm for the parity problem on linear matroids}, volume={6}, journal={Combinatorica}, author={Gabow, Harold N and Stallmann, M}, year={1984} }
 @phdthesis{stallmann_1983, title={AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS.}, school={University of Colorado, Boulder}, author={Stallmann, Matthias Friedemann Martin}, year={1983} }