 | 2011 |
| 19 |  | Matthias Hagen,
Benno Stein,
Tino Rüb:
Query session detection as a cascade.
CIKM 2011: 147-152 |
| 18 |  | Benno Stein,
Matthias Hagen:
Introducing the User-over-Ranking Hypothesis.
ECIR 2011: 503-509 |
| 17 |  | Matthias Hagen,
Benno Stein:
Applying the User-over-Ranking Hypothesis to Query Formulation.
ICTIR 2011: 225-237 |
| 16 |  | Matthias Hagen,
Benno Stein:
Candidate Document Retrieval for Web-Scale Text Reuse Detection.
SPIRE 2011: 356-367 |
| 15 |  | Matthias Hagen,
Martin Potthast,
Benno Stein,
Christof Bräutigam:
Query segmentation revisited.
WWW 2011: 97-106 |
| 2010 |
| 14 |  | Eric Berberich,
Matthias Hagen,
Benjamin Hiller,
Hannes Moser:
Experiments.
Algorithm Engineering 2010: 325-388 |
| 13 |  | Matthias Hagen,
Benno Stein:
Search Strategies for Keyword-based Queries.
DEXA Workshops 2010: 37-41 |
| 12 |  | Matthias Hagen,
Benno Stein:
Capacity-Constrained Query Formulation.
ECDL 2010: 384-388 |
| 11 |  | Matthias Hagen,
Martin Potthast,
Benno Stein,
Christof Bräutigam:
The power of naive query segmentation.
SIGIR 2010: 797-798 |
| 10 |  | Matthias Hagen,
Benno Stein,
Michael Völske:
Webis at the TREC 2010 Sessions Track.
TREC 2010 |
| 9 |  | Benno Stein,
Matthias Hagen:
Making the Most of a Web Search Session.
Web Intelligence 2010: 90-97 |
| 2009 |
| 8 |  | Matthias Hagen,
Peter Horatschek,
Martin Mundhenk:
Experimental comparison of the two Fredman-Khachiyan-algorithms.
ALENEX 2009: 154-161 |
| 7 |  | Matthias Hagen:
Lower bounds for three algorithms for transversal hypergraph generation.
Discrete Applied Mathematics 157(7): 1460-1469 (2009) |
| 2008 |
| 6 |  | Matthias Hagen:
Algorithmic and Computational Complexity Issues of MONET.
Cuvillier 2008: I-XI, 1-141 |
| 5 |  | Khaled M. Elbassioni,
Matthias Hagen,
Imran Rauf:
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems.
IWPEC 2008: 91-102 |
| 4 |  | 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 |  | Matthias Hagen:
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation.
WG 2007: 316-327 |
| 2 |  | 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 |  | Judy Goldsmith,
Matthias Hagen,
Martin Mundhenk:
Complexity of DNF and Isomorphism of Monotone Formulas.
MFCS 2005: 410-421 |