h1

h2

h3

h4

h5
h6


001     47970
005     20220802120010.0
024 7 _ |2 ISSN
|a 0935-3232
024 7 _ |2 HSB
|a 999910023703
037 _ _ |a RWTH-CONV-008351
041 _ _ |a English
088 _ _ |2 Other
|a AIB-2008-15
100 1 _ |0 P:(DE-82)017973
|a Kneis, Joachim
|b 0
|e Author
245 _ _ |a A New Algorithm for Finding Trees with Many Leaves
|c Joachium Kneis ...
|h online, print
260 _ _ |a Aachen
|b RWTH Aachen, Department of Computer Science
|c 2008
300 _ _ |a 19 S.
336 7 _ |0 PUB:(DE-HGF)29
|2 PUB:(DE-HGF)
|a Report
|b report
|m report
336 7 _ |2 DataCite
|a Output Types/Report
336 7 _ |2 BibTeX
|a TECHREPORT
336 7 _ |2 ORCID
|a REPORT
336 7 _ |0 10
|2 EndNote
|a Report
336 7 _ |2 DRIVER
|a report
490 0 _ |a Aachener Informatik Berichte
|v 2008,15
591 _ _ |a Germany
653 _ 7 |2 eng
|a Exact Algorithms
653 _ 7 |2 eng
|a Parameterized Complexity
653 _ 7 |2 eng
|a Maximum Leaf Trees
700 1 _ |0 P:(DE-82)070868
|a Langer, Alexander Johannes
|b 1
|e Author
700 1 _ |0 P:(DE-82)IDM00088
|a Rossmanith, Peter
|b 2
|e Author
856 4 _ |u http://sunsite.informatik.rwth-aachen.de/Publications/AIB/2008/2008-15.pdf
|y Fulltext
909 C O |o oai:publications.rwth-aachen.de:47970
|p VDB
920 1 _ |0 I:(DE-82)121220_20140620
|k 121220
|l Lehr- und Forschungsgebiet Theoretische Informatik
|x 0
920 1 _ |0 I:(DE-82)120000_20140620
|k 120000
|l Fachgruppe Informatik
|x 1
970 _ _ |a hsb999910023703
980 _ _ |a report
980 _ _ |a I:(DE-82)121220_20140620
980 _ _ |a I:(DE-82)120000_20140620
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a ConvertedRecord


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21