Skip to content
cs-conference-ranking.org

Matthias F. M. Stallmann

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

8

Venues

8

Active years

1984–2005

Best venue rank

A*

Where they publish

Papers

8 indexed papers, newest first.

YearVenueTitleAuthors
2005DACEffective bounding techniques for solving unate and binate covering problems.Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
2003SATA Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation.Xiao Yu Li, Matthias F. M. Stallmann, Franc Brglez
1999ALENEXHeuristics and Experimental Design for Bigraph Crossing Number Minimization.Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
1999ISCASEvaluating iterative improvement heuristics for bigraph crossing minimization.Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
1993WADSFast Algorithms for One-Dimensional Compaction with Jog Insertion.Matthias F. M. Stallmann, Thomas A. Hughes
1991SPAAA One-Way Array Algorithm for Matroid Scheduling.Matthias F. M. Stallmann
1985ICALPEfficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract).Harold N. Gabow, Matthias F. M. Stallmann
1984FOCSAn Augmenting Path Algorithm for the Parity Problem on Linear MatroidsMatthias F. M. Stallmann, Harold N. Gabow