Matthias F. M. Stallmann

Available identifiers

zbMath Open stallmann.matthias-f-mMaRDI QIDQ864029

List of research outcomes

Publication	Date of Publication	Type
Efficient algorithms for finding <scp>2‐medians</scp> of a tree	2023-12-11	Paper
Fast algorithms for one-dimensionsal compaction with jog insertion	2023-01-18	Paper
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization	2017-06-15	Paper
On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems	2015-12-08	Paper
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization	2014-04-01	Paper
Theory and Applications of Satisfiability Testing	2009-07-24	Paper
Optimal one-page tree embeddings in linear time	2009-04-28	Paper
The directional \(p\)-median problem: definition, complexity, and algorithms	2007-02-12	Paper
On SAT instance classes and a method for reliable performance experiments with SAT solvers	2005-05-13	Paper
New bounds on the barycenter heuristic for bipartite graph drawing.	2003-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q4509382	2001-10-07	Paper
https://portal.mardi4nfdi.de/entity/Q4763314	1995-04-11	Paper
On counting planar embeddings	1994-03-10	Paper
On the minimum dummy-arc problem	1993-08-29	Paper
Optimal Reduction of Two-Terminal Directed Acyclic Graphs	1993-03-09	Paper
A characterization of network representable polymatroids	1991-01-01	Paper
Hypercube embedding heuristics: An evaluation	1990-01-01	Paper
Solving some combinatorial problems on arrays with one-way dataflow	1990-01-01	Paper
An augmenting path algorithm for linear matroid parity	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3682487	1985-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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