Matthias Stallmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Matthias Stallmann has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
Franc Brglez
North Carolina State University
4 shared publicationsHarold N. Gabow
University of Colorado
2 shared publicationsWoei-Kae Chen
Department of Electrical and Computer Engineering North Carolina State University
2 shared publicationsXiao Yu Li
NC State Univ
2 shared publicationsAissa Oudjit
North Carolina State University Raleigh North Carolina USA
1 shared publicationC. Dianne Raubenheimer
North Carolina State University
1 shared publication
Latest Publications
Efficient algorithms for finding 2‐medians of a tree
The 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.
Efficient algorithms for finding 2‐medians of a tree
The 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.
- 16 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 37 (1) , 8-14
Algorithm Animation with Galant
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.
- 16 January 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 37 (1) , 8-14
Algorithm Animation with Galant
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.
- 1 January 2016
- Published by Elsevier in Theoretical Computer Science
- Vol. 609, 434-442
On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems
- 1 January 2016
- Published by Elsevier in Theoretical Computer Science
- Vol. 609, 434-442
On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems
- Open Access
- 1 January 2014
- Published by Association for Computing Machinery (ACM)
- p. 91-98
Including blind people in computing through access to graphs
- 1 January 2014
- Published by Association for Computing Machinery (ACM)
- p. 91-98
Open AccessIncluding blind people in computing through access to graphs
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1503-1509
Integrating communication skills in data structures and algorithms courses
While the improvement of computer science students' communication skills has frequently been called for in the literature, employers continue to feel that recent graduates are not equipped with the writing, speaking, and teaming skills essential in the 21st century workplace. One problem with previous approaches is that they often teach communication skills in dedicated courses rather than integrating them into technical classes across the curriculum. In this paper, we report on a multi-institutional faculty team's efforts to integrate communication skills into mid-level data structures and algorithms courses as part of a larger NSF-funded project to enact integrated reform throughout computer science/software engineering curricula. We present an outline of assignments designed to develop communication skills (writing, speaking, reading, listening, and teaming) intertwined with technical skills, and discuss our preliminary efforts to assess these efforts. Our work reflects a general approach to incorporate communication activities within the computer science curricula and to help students learn and communicate technical content in academic and professional settings.
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1503-1509
Integrating communication skills in data structures and algorithms courses
While the improvement of computer science students' communication skills has frequently been called for in the literature, employers continue to feel that recent graduates are not equipped with the writing, speaking, and teaming skills essential in the 21st century workplace. One problem with previous approaches is that they often teach communication skills in dedicated courses rather than integrating them into technical classes across the curriculum. In this paper, we report on a multi-institutional faculty team's efforts to integrate communication skills into mid-level data structures and algorithms courses as part of a larger NSF-funded project to enact integrated reform throughout computer science/software engineering curricula. We present an outline of assignments designed to develop communication skills (writing, speaking, reading, listening, and teaming) intertwined with technical skills, and discuss our preliminary efforts to assess these efforts. Our work reflects a general approach to incorporate communication activities within the computer science curricula and to help students learn and communicate technical content in academic and professional settings.
- 1 January 2009
- Published by Springer Nature
- p. 133-148
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
- 1 January 2009
- Published by Springer Nature
- p. 133-148
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
- Open Access
- 13 June 2007
- Published by Association for Computing Machinery (ACM)
- p. 12
High-contrast algorithm behavior
- 13 June 2007
- Published by Association for Computing Machinery (ACM)
- p. 12
Open AccessHigh-contrast algorithm behavior
- 1 June 2007
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (3) , 1097-1108
The directional p-median problem: Definition, complexity, and algorithms
- 1 June 2007
- Published by Elsevier in European Journal of Operational Research
- Vol. 179 (3) , 1097-1108
The directional p-median problem: Definition, complexity, and algorithms
- Open Access
- 7 March 2007
- Published by Association for Computing Machinery (ACM) in ACM SIGCSE Bulletin
- Vol. 39 (1) , 341-345
A case for smaller class size with integrated lab for introductory computer science
Prompted by changes in the numbers and demographics of students enrolled and being retained in computer science, the Department of Computer Science at NC State University is revising its undergraduate curriculum to better meet the needs of its students, and increase student attraction and retention. One set of changes concerns introductory computer science courses (CS1). This paper reports on a study conducted to assess the impact of class size and active learning in our CS1 courses. We find that smaller classes with integrated laboratories improve both learning and retention, as well as satisfaction of the students. Among other benefits, we found retention rates in small classes to be about 20% better than large classes.
- 7 March 2007
- Published by Association for Computing Machinery (ACM) in ACM SIGCSE Bulletin
- Vol. 39 (1) , 341-345
Open AccessA case for smaller class size with integrated lab for introductory computer science
Prompted by changes in the numbers and demographics of students enrolled and being retained in computer science, the Department of Computer Science at NC State University is revising its undergraduate curriculum to better meet the needs of its students, and increase student attraction and retention. One set of changes concerns introductory computer science courses (CS1). This paper reports on a study conducted to assess the impact of class size and active learning in our CS1 courses. We find that smaller classes with integrated laboratories improve both learning and retention, as well as satisfaction of the students. Among other benefits, we found retention rates in small classes to be about 20% better than large classes.
- 23 November 2005
- Published by Springer Nature
- p. 210-220
Efficient algorithms for graphic matroid intersection and parity
- 23 November 2005
- Published by Springer Nature
- p. 210-220
Efficient algorithms for graphic matroid intersection and parity