default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias F. Stallmann
2020 – today
- 2021
[j19]Aissa Oudjit, Matthias F. Stallmann
:
Efficient algorithms for finding 2-medians of a tree. Networks 77(3): 383-402 (2021)- 2020
- [i1]Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich:
Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver. CoRR abs/2003.06639 (2020)
2010 – 2019
- 2017
- [j18]Matthias F. Stallmann:
Algorithm Animation with Galant. IEEE Computer Graphics and Applications 37(1): 8-14 (2017) - 2016
- [j17]Wenbin Chen, Nagiza F. Samatova, Matthias F. Stallmann, William Hendrix, Weiqin Ying:
On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems. Theor. Comput. Sci. 609: 434-442 (2016) - 2014
- [c18]Suzanne Balik, Sean P. Mealin, Matthias F. Stallmann, Robert D. Rodman, Michelle L. Glatz, Veronica J. Sigler:
Including blind people in computing through access to graphs. ASSETS 2014: 91-98 - 2013
- [c17]William Eberle, John Karro, Neal Lerner, Matthias F. Stallmann:
Integrating communication skills in data structures and algorithms courses. FIE 2013: 1503-1509 - [c16]Suzanne Balik, Sean P. Mealin, Matthias F. Stallmann, Robert D. Rodman:
GSK: universally accessible graph sketching. SIGCSE 2013: 221-226 - 2012
- [j16]Matthias F. Stallmann:
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. ACM J. Exp. Algorithmics 17(1) (2012)
2000 – 2009
- 2009
- [c15]Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring. ADBIS 2009: 133-148 - 2008
- [j15]Rajeev Raman, Matthias F. Stallmann:
Preface. ACM J. Exp. Algorithmics 13 (2008) - [c14]Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
View and index selection for query-performance improvement: quality-centered algorithms and heuristics. CIKM 2008: 1329-1330 - [c13]Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi, Matthias F. Stallmann:
Exact and inexact methods for selecting views and indexes for OLAP performance improvement. EDBT 2008: 311-322 - 2007
- [j14]Laura E. Jackson, George N. Rouskas, Matthias F. M. Stallmann:
The directional p. Eur. J. Oper. Res. 179(3): 1097-1108 (2007) - [c12]Matthias F. M. Stallmann, Franc Brglez:
High-contrast algorithm behavior: observation, hypothesis, and experimental design. Experimental Computer Science 2007: 12 - [c11]Matthias F. Stallmann, Suzanne Balik, Robert D. Rodman, Sina Bahram, Michael C. Grace, Susan D. High:
ProofChecker: an accessible environment for automata theory correctness proofs. ITiCSE 2007: 48-52 - [c10]Kristy Elizabeth Boyer, Rachael S. Dwight, Carolyn S. Miller, C. Dianne Raubenheimer, Matthias F. Stallmann, Mladen A. Vouk:
A case for smaller class size with integrated lab for introductory computer science. SIGCSE 2007: 341-345 - 2006
- [e1]Rajeev Raman, Matthias F. Stallmann:
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006. SIAM 2006, ISBN 978-1-61197-286-3 [contents] - 2005
- [j13]Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann:
On SAT instance classes and a method for reliable performance experiments with SAT solvers. Ann. Math. Artif. Intell. 43(1): 1-34 (2005) - [c9]Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez:
Effective bounding techniques for solving unate and binate covering problems. DAC 2005: 385-390 - 2003
- [j12]Robert A. Hochberg, Matthias F. M. Stallmann:
Optimal one-page tree embeddings in linear time. Inf. Process. Lett. 87(2): 59-66 (2003) - [c8]Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez:
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. SAT 2003: 53-68 - 2002
- [j11]Xiao Yu Li, Matthias F. M. Stallmann:
New bounds on the barycenter heuristic for bipartite graph drawing. Inf. Process. Lett. 82(6): 293-298 (2002) - 2001
- [j10]Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh:
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. ACM J. Exp. Algorithmics 6: 8 (2001) - 2000
- [j9]Jerzy Kamburowski, David J. Michael, Matthias F. M. Stallmann:
Minimizing the complexity of an activity network. Networks 36(1): 47-52 (2000)
1990 – 1999
- 1999
- [c7]Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh:
Heuristics and Experimental Design for Bigraph Crossing Number Minimization. ALENEX 1999: 74-93 - [c6]Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh:
Evaluating iterative improvement heuristics for bigraph crossing minimization. ISCAS (6) 1999: 444-447 - 1995
- [j8]Woei-Kae Chen, Matthias F. M. Stallmann:
On Embedding Binary Trees into Hypercubes. J. Parallel Distributed Comput. 24(2): 132-138 (1995) - 1993
- [j7]Matthias F. M. Stallmann:
On counting planar embeddings. Discret. Math. 122(1-3): 385-392 (1993) - [c5]Matthias F. M. Stallmann, Thomas A. Hughes:
Fast Algorithms for One-Dimensional Compaction with Jog Insertion. WADS 1993: 589-600 - 1992
- [j6]Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann:
Optimal Reductions of Two-Terminal Directed Acyclic Graphs. SIAM J. Comput. 21(6): 1112-1129 (1992) - [c4]Matthias F. Stallmann, Rance Cleaveland, Prashant Hebbar:
GDR: A Visualization Tool for Graph Algorithms. Computational Support for Discrete Mathematics 1992: 17-28 - 1991
- [j5]Wolfgang W. Bein, Peter Brucker, Matthias F. M. Stallmann:
A characterization of network representable polymatroids. ZOR Methods Model. Oper. Res. 35(4): 267-272 (1991) - [c3]Matthias F. M. Stallmann:
A One-Way Array Algorithm for Matroid Scheduling. SPAA 1991: 349-356 - 1990
- [j4]Carla D. Savage, Matthias F. M. Stallmann, Jo Ellen Perry:
Solving Some Combinatorial Problems on Arrays with One-Way Dataflow. Algorithmica 5(2): 179-199 (1990) - [j3]Matthias F. M. Stallmann, Thomas A. Hughes, Wentai Liu:
Unconstrained via minimization for topological multilayer routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(9): 970-980 (1990)
1980 – 1989
- 1989
- [j2]Woei-Kae Chen, Matthias F. M. Stallmann, Edward F. Gehringer:
Hypercube embedding heuristics: An evaluation. Int. J. Parallel Program. 18(6): 505-549 (1989) - 1986
- [j1]Harold N. Gabow, Matthias F. M. Stallmann:
An augmenting path algorithm for linear matroid parity. Comb. 6(2): 123-150 (1986) - 1985
- [c2]Harold N. Gabow, Matthias F. M. Stallmann:
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract). ICALP 1985: 210-220 - 1984
- [c1]Matthias F. M. Stallmann, Harold N. Gabow:
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids. FOCS 1984: 217-228
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
