| 2009 |
|---|
| 6 | EE | Matthias Hagen,
Peter Horatschek,
Martin Mundhenk:
Experimental comparison of the two Fredman-Khachiyan-algorithms.
ALENEX 2009: 154-161 |
| 2008 |
|---|
| 5 | EE | Khaled M. Elbassioni,
Matthias Hagen,
Imran Rauf:
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems.
IWPEC 2008: 91-102 |
| 4 | EE | Judy Goldsmith,
Matthias Hagen,
Martin Mundhenk:
Complexity of DNF minimization and isomorphism testing for monotone formulas.
Inf. Comput. 206(6): 760-775 (2008) |
| 2007 |
|---|
| 3 | EE | Matthias Hagen:
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation.
WG 2007: 316-327 |
| 2 | EE | Matthias Hagen:
On the fixed-parameter tractability of the equivalence test of monotone normal forms.
Inf. Process. Lett. 103(4): 163-167 (2007) |
| 2005 |
|---|
| 1 | EE | Judy Goldsmith,
Matthias Hagen,
Martin Mundhenk:
Complexity of DNF and Isomorphism of Monotone Formulas.
MFCS 2005: 410-421 |
