A Lower Bound for the HBC Transversal Hypergraph Generation. Elbassioni, K. M., Hagen, M., & Rauf, I. Fundam. Informaticae, 130(4):409-414, 2014.
Link
Paper bibtex @article{journals/fuin/ElbassioniHR14,
added-at = {2020-09-18T00:00:00.000+0200},
author = {Elbassioni, Khaled M. and Hagen, Matthias and Rauf, Imran},
biburl = {https://www.bibsonomy.org/bibtex/228f8c324b531835c349ac4ed0ade35ea/dblp},
ee = {https://doi.org/10.3233/FI-2014-997},
interhash = {715779b196615e8767977646f17803b5},
intrahash = {28f8c324b531835c349ac4ed0ade35ea},
journal = {Fundam. Informaticae},
keywords = {dblp},
number = 4,
pages = {409-414},
timestamp = {2020-09-19T11:36:19.000+0200},
title = {A Lower Bound for the HBC Transversal Hypergraph Generation.},
url = {http://dblp.uni-trier.de/db/journals/fuin/fuin130.html#ElbassioniHR14},
volume = 130,
year = 2014
}
Downloads: 0
{"_id":"XfBR2SzhDidDYqehS","bibbaseid":"elbassioni-hagen-rauf-alowerboundforthehbctransversalhypergraphgeneration-2014","author_short":["Elbassioni, K. M.","Hagen, M.","Rauf, I."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-09-18T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Elbassioni"],"firstnames":["Khaled","M."],"suffixes":[]},{"propositions":[],"lastnames":["Hagen"],"firstnames":["Matthias"],"suffixes":[]},{"propositions":[],"lastnames":["Rauf"],"firstnames":["Imran"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/228f8c324b531835c349ac4ed0ade35ea/dblp","ee":"https://doi.org/10.3233/FI-2014-997","interhash":"715779b196615e8767977646f17803b5","intrahash":"28f8c324b531835c349ac4ed0ade35ea","journal":"Fundam. Informaticae","keywords":"dblp","number":"4","pages":"409-414","timestamp":"2020-09-19T11:36:19.000+0200","title":"A Lower Bound for the HBC Transversal Hypergraph Generation.","url":"http://dblp.uni-trier.de/db/journals/fuin/fuin130.html#ElbassioniHR14","volume":"130","year":"2014","bibtex":"@article{journals/fuin/ElbassioniHR14,\n added-at = {2020-09-18T00:00:00.000+0200},\n author = {Elbassioni, Khaled M. and Hagen, Matthias and Rauf, Imran},\n biburl = {https://www.bibsonomy.org/bibtex/228f8c324b531835c349ac4ed0ade35ea/dblp},\n ee = {https://doi.org/10.3233/FI-2014-997},\n interhash = {715779b196615e8767977646f17803b5},\n intrahash = {28f8c324b531835c349ac4ed0ade35ea},\n journal = {Fundam. Informaticae},\n keywords = {dblp},\n number = 4,\n pages = {409-414},\n timestamp = {2020-09-19T11:36:19.000+0200},\n title = {A Lower Bound for the HBC Transversal Hypergraph Generation.},\n url = {http://dblp.uni-trier.de/db/journals/fuin/fuin130.html#ElbassioniHR14},\n volume = 130,\n year = 2014\n}\n\n","author_short":["Elbassioni, K. M.","Hagen, M.","Rauf, I."],"key":"journals/fuin/ElbassioniHR14","id":"journals/fuin/ElbassioniHR14","bibbaseid":"elbassioni-hagen-rauf-alowerboundforthehbctransversalhypergraphgeneration-2014","role":"author","urls":{"Link":"https://doi.org/10.3233/FI-2014-997","Paper":"http://dblp.uni-trier.de/db/journals/fuin/fuin130.html#ElbassioniHR14"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/khaled?items=1000","dataSources":["MAPJNxQojwdH4Jit2"],"keywords":["dblp"],"search_terms":["lower","bound","hbc","transversal","hypergraph","generation","elbassioni","hagen","rauf"],"title":"A Lower Bound for the HBC Transversal Hypergraph Generation.","year":2014}