Matthias F. M. Stallmann

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Efficient algorithms for finding <scp>2‐medians</scp> of a tree Networks	2023-12-11	Paper
Fast algorithms for one-dimensionsal compaction with jog insertion Lecture Notes in Computer Science	2023-01-18	Paper
Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization ACM Journal of Experimental Algorithmics	2017-06-15	Paper
On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems Theoretical Computer Science	2015-12-08	Paper
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization, hypothesis and experimental study ACM Journal of Experimental Algorithmics	2014-04-01	Paper
Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science	2009-07-24	Paper
Optimal one-page tree embeddings in linear time Information Processing Letters	2009-04-28	Paper
The directional \(p\)-median problem: definition, complexity, and algorithms European Journal of Operational Research	2007-02-12	Paper
On SAT instance classes and a method for reliable performance experiments with SAT solvers Annals of Mathematics and Artificial Intelligence	2005-05-13	Paper
New bounds on the barycenter heuristic for bipartite graph drawing. Information Processing Letters	2003-01-21	Paper
scientific article; zbMATH DE number 1517143 (Why is no real title available?)	2001-10-07	Paper
scientific article; zbMATH DE number 742883 (Why is no real title available?)	1995-04-11	Paper
On counting planar embeddings Discrete Mathematics	1994-03-10	Paper
On the minimum dummy-arc problem RAIRO - Operations Research	1993-08-29	Paper
Optimal Reduction of Two-Terminal Directed Acyclic Graphs SIAM Journal on Computing	1993-03-09	Paper
A characterization of network representable polymatroids ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research	1991-01-01	Paper
Solving some combinatorial problems on arrays with one-way dataflow Algorithmica	1990-01-01	Paper
Hypercube embedding heuristics: An evaluation International Journal of Parallel Programming	1990-01-01	Paper
An augmenting path algorithm for linear matroid parity Combinatorica	1986-01-01	Paper
scientific article; zbMATH DE number 3904590 (Why is no real title available?)	1985-01-01	Paper

Research outcomes over time

This page was built for person: Matthias F. M. Stallmann