Matthias Hagen Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Hagen, Peter Horatschek, Martin Mundhenk: Experimental comparison of the two Fredman-Khachiyan-algorithms. ALENEX 2009: 154-161
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Hagen: Lower bounds for three algorithms for transversal hypergraph generation. Discrete Applied Mathematics 157(7): 1460-1469 (2009)
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKhaled M. Elbassioni, Matthias Hagen, Imran Rauf: Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. IWPEC 2008: 91-102
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)
2007
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Hagen: Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. WG 2007: 316-327
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatthias Hagen: On the fixed-parameter tractability of the equivalence test of monotone normal forms. Inf. Process. Lett. 103(4): 163-167 (2007)
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJudy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421

Coauthor Index

1Khaled M. Elbassioni [5]
2Judy Goldsmith [1] [4]
3Peter Horatschek [7]
4Martin Mundhenk [1] [4] [7]
5Imran Rauf [5]

Colors in the list of coauthors

Copyright © Tue Dec 1 12:01:14 2009 by Michael Ley (ley@uni-trier.de)