Page heading
Languages and Services
  
    You are here menu
    Subpage heading
    Web Technology · Information Systems · Prof. Dr. Benno Stein
    Navigation
    Additional Content
    Main Content

    Matthias Hagen

    Bauhaus-Universität Weimar
    Bauhausstraße 11 · Room 109
    99423 Weimar, Germany

    Email: matthias.hagen@uni-weimar.de
    Phone: +49 (0)3643 - 58 3720
    Fax: +49 (0)3643 - 58 3709

    Short Curriculum Vitae

    Matthias Hagen studied computer science at the Friedrich Schiller University (FSU) Jena. After completing his diploma thesis in June 2004 he joined the research group of Prof. Martin Mundhenk at FSU Jena and worked on problems concerning the equivalence test of monotone Boolean formulas and transversal hypergraph generation. In February 2007 he also joined the research group Programming Languages / Methodologies of Prof. Claudia Fohry at the University of Kassel and worked in the OBA project (optimization of the wiring harness in cars). In November 2008 Matthias Hagen defended his PhD thesis on "Algorithmic and Computational Complexity Issues of MONET" at FSU Jena and joined the working group Web Technology and Information Systems at the Bauhaus-Universität Weimar. There he is head of the junior research group "Intelligentes Lernen" (intelligent learning) funded by the German Federal Department for Science and Education (BMBF) within the InnoProfile program.

    Matthias Hagen's current research interests include web search, query formulation, query segmentation, and query sessions.

    Publications

    Andre Schmidt, Michael Rzanny, Astrid Schmidt, Matthias Hagen, Eileen Schütze, and Erika Kothe. GC content-independent amino acid patterns in Bacteria and Archaea. Journal of Basic Microbiology (to appear), 2012. [doi] [bib]
    Matthias Hagen, Jakob Gomoll, and Benno Stein. Improved Cascade for Search Mission Detection. In Ben Carterette, Evangelos Kanoulas, Paul D. Clough, and Mark Sanderson, editors, ECIR 12 Workshop on Information Retrieval over Query Sessions (SIR 12), 2012. [paper] [bib] [slides]
    Matthias Hagen, Jan Grassegger, Maximilian Michel, and Benno Stein. Webis at the TREC 2011 Sessions Track. In Ellen M. Voorhees and Lori P. Buckland, editors, 20th International Text Retrieval Conference (TREC 11). National Institute of Standards and Technology (NIST). [paper] [bib]
    Matthias Hagen, Benno Stein, and Tino Rüb. Query Session Detection as a Cascade. In Bettina Berendt, Arjen de Vries, Wenfei Fan, Craig Macdonald, Iadh Ounis, and Ian Ruthven, editors, 20th ACM International Conference on Information and Knowledge Management (CIKM 11), pages 147-152, 2011. ACM. ISBN 978-1-4503-0717-8. [doi] [paper] [bib] [slides]
    Matthias Hagen and Benno Stein. Candidate Document Retrieval for Web-Scale Text Reuse Detection. In Roberto Grossi, Fabrizio Sebastiani, and Fabrizio Silvestri, editors, 18th International Symposium on String Processing and Information Retrieval (SPIRE 11), volume 7024 of Lecture Notes in Computer Science, pages 356-367, 2011. [doi] [paper] [bib] [slides]
    Matthias Hagen and Benno Stein. Applying the User-over-Ranking Hypothesis to Query Formulation. In Giambattista Amati and Fabio Crestani, editors, Advances in Information Retrieval Theory. 3rd International Conference on the Theory of Information Retrieval (ICTIR 11), volume 6931 of Lecture Notes in Computer Science, pages 225-237, 2011. [doi] [paper] [bib] [slides]
    Benno Stein and Matthias Hagen. Introducing the User-over-Ranking Hypothesis. In Paul Clough, Colum Foley, Cathal Gurrin, Gareth J. F. Jones, Wessel Kraaij, Hyowon Lee, and Vanessa Murdock, editors, Advances in Information Retrieval. 33rd European Conference on IR Resarch (ECIR 11), volume 6611 of Lecture Notes in Computer Science, pages 503-509, 2011. [doi] [paper] [bib] [slides]
    Matthias Hagen, Benno Stein, and Tino Rüb. Query Session Detection as a Cascade. In Ben Carterette, Paul D. Clough, Evangelos Kanoulas, and Mark Sanderson, editors, ECIR 11 Workshop on Information Retrieval over Query Sessions (SIR 11), 2011. [publisher] [paper] [bib] [slides]
    Matthias Hagen, Martin Potthast, Benno Stein, and Christof Bräutigam. Query Segmentation Revisited. In Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar, editors, 20th International Conference on World Wide Web (WWW 11), pages 97-106, 2011. [doi] [paper] [bib] [slides]
    Andre Schmidt, Matthias Hagen, Eileen Schütze, Astrid Schmidt, and Erika Kothe. In silico prediction of potential metallothioneins and metallohistins in actinobacteria. Journal of Basic Microbiology, 50 (6) : 562-569, 2010. [doi] [bib]
    Matthias Hagen, Benno Stein, and Michael Völske. Webis at the TREC 2010 Sessions Track. In Ellen M. Voorhees and Lori P. Buckland, editors, 19th International Text Retrieval Conference (TREC 10). National Institute of Standards and Technology (NIST). [paper] [bib]
    Matthias Hagen and Benno Stein. Capacity-constrained Query Formulation. In Mounia Lalmas, Joemon M. Jose, Andreas Rauber, Fabrizio Sebastiani, and Ingo Frommholz, editors, Research and Advanced Technology for Digital Libraries. 14th European Conference (ECDL 10), volume 6273 of Lecture Notes in Computer Science, pages 384-388, 2010. Springer. ISBN 978-3-642-15463-8. [doi] [paper] [bib]
    Matthias Hagen and Benno Stein. Search Strategies for Keyword-based Queries. In A Min Tjoa and Roland Wagner, editors, 7th International Workshop on Text-Based Information Retrieval (TIR 10) at DEXA, pages 37-41, 2010. IEEE. ISBN 978-0-7695-4174-7. [doi] [paper] [bib]
    Benno Stein and Matthias Hagen. Making the Most of a Web Search Session. In IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 10), pages 90-97, August 2010. [doi] [paper] [bib]
    Matthias Hagen, Martin Potthast, Benno Stein, and Christof Bräutigam. The Power of Naïve Query Segmentation. In Hsin-Hsi Chen, Efthimis N. Efthimiadis, Jaques Savoy, Fabio Crestani, and Stéphane Marchand-Maillet, editors, 33rd International ACM Conference on Research and Development in Information Retrieval (SIGIR 10), pages 797-798, July 2010. ACM. ISBN 978-1-4503-0153-4. [doi] [paper] [bib] [poster]
    Eric Berberich, Matthias Hagen, Benjamin Hiller, and Hannes Moser. Experiments. In Matthias Müller-Hannemann and Stefan Schirra, editors, Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], volume 5971 of Lecture Notes in Computer Science, pages 325-388, 2010. Springer. ISBN 978-3-642-14865-1. [doi] [paper] [bib]
    Matthias Hagen. Lower bounds for three algorithms for transversal hypergraph generation. Discrete Applied Mathematics, 157 (7) : 1460-1469, 2009. [doi] [paper] [bib]
    Matthias Hagen, Peter Horatschek, and Martin Mundhenk. Experimental comparison of the two Fredman-Khachiyan-algorithms. In Irene Finocchi and John Hershberger, editors, Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009, pages 154-161, 2009. SIAM. [doi] [paper] [bib]
    Matthias Hagen. Algorithmic and Computational Complexity Issues of MONET. Dissertation, Institut für Informatik, Friedrich-Schiller-Universität Jena, December 2008. [paper] [bib]
    Judy Goldsmith, Matthias Hagen, and Martin Mundhenk. Complexity of DNF minimization and isomorphism testing for monotone formulas. Information and Computation, 206 (6) : 760-775, 2008. ISBN . [doi] [paper] [bib]
    Khaled M. Elbassioni, Matthias Hagen, and Imran Rauf. Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. In Martin Grohe and Rolf Niedermeier, editors, Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, volume 5018 of Lecture Notes in Computer Science, pages 91-102, 2008. Springer. ISBN 978-3-540-79722-7. [doi] [paper] [bib]
    Matthias Hagen. On the fixed-parameter tractability of the equivalence test of monotone normal forms. Information Processing Letters, 103 (4) : 163-167, 2007. [doi] [paper] [bib]
    Matthias Hagen. Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. In Andreas Brandstädt, Dieter Kratsch, and Haiko Müller, editors, Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, volume 4769 of Lecture Notes in Computer Science, pages 316-327, 2007. Springer. ISBN 978-3-540-74838-0. [doi] [paper] [bib]
    Matthias Hagen. Logarithmic Space Instances of Monotone Normal Form Equivalence Testing. Reports on Computer Science 06-10, Institut für Informatik, Friedrich-Schiller-Universität Jena, June 2006. [doi] [paper] [bib]
    Judy Goldsmith, Matthias Hagen, and Martin Mundhenk. Complexity of DNF and Isomorphism of Monotone Formulas. In Joanna Jedrzejowicz and Andrzej Szepietowski, editors, Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, volume 3618 of Lecture Notes in Computer Science, pages 410-421, 2005. Springer. ISBN 3-540-28702-7. [doi] [paper] [bib]

    Content signature