{"_id":"9oWfvwkcvLDYmwTXQ","bibbaseid":"jiang-ontheparameterizedcomplexityofsomeoptimizationproblemsrelatedtomultipleintervalgraphs-2010","authorIDs":[],"author_short":["Jiang, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Minghui"],"propositions":[],"lastnames":["Jiang"],"suffixes":[]}],"title":"On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs","booktitle":"Proc. of Combinatorial Pattern Matching (CPM 2010)","year":"2010","volume":"6129","series":"Lect Notes Comput Sci","pages":"125–137","publisher":"Springer, Berlin","keywords":"fpt","opteditor":"Amihood Amir and Laxmi Parida","owner":"florian","timestamp":"2012.02.07","bibtex":"@InProceedings{jiang10parameterized,\n author = {Minghui Jiang},\n title = {On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs},\n booktitle = {Proc. of Combinatorial Pattern Matching (CPM 2010)},\n year = {2010},\n volume = {6129},\n series = lncs,\n pages = {125--137},\n publisher = Springer,\n keywords = {fpt},\n opteditor = {Amihood Amir and Laxmi Parida},\n owner = {florian},\n timestamp = {2012.02.07},\n}\n\n","author_short":["Jiang, M."],"key":"jiang10parameterized","id":"jiang10parameterized","bibbaseid":"jiang-ontheparameterizedcomplexityofsomeoptimizationproblemsrelatedtomultipleintervalgraphs-2010","role":"author","urls":{},"keyword":["fpt"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.163Z","downloads":0,"keywords":["fpt"],"search_terms":["parameterized","complexity","optimization","problems","related","multiple","interval","graphs","jiang"],"title":"On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs","year":2010,"dataSources":["C5FtkvWWggFfMJTFX"]}