{"id":"https://openalex.org/W2984849941","doi":"https://doi.org/10.3390/a12120254","title":"FPT Algorithms for Diverse Collections of Hitting Sets","display_name":"FPT Algorithms for Diverse Collections of Hitting Sets","publication_year":2019,"publication_date":"2019-11-27","ids":{"openalex":"https://openalex.org/W2984849941","doi":"https://doi.org/10.3390/a12120254","mag":"2984849941"},"language":"en","primary_location":{"id":"doi:10.3390/a12120254","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12120254","pdf_url":"https://www.mdpi.com/1999-4893/12/12/254/pdf?version=1575890415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/12/254/pdf?version=1575890415","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Julien Baste","orcid":"https://orcid.org/0000-0002-7869-0959"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Julien Baste","raw_affiliation_strings":["Institute of Optimization and Operations Research, Ulm University, 89081 Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Optimization and Operations Research, Ulm University, 89081 Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Lars Jaffke","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Lars Jaffke","raw_affiliation_strings":["Department of Informatics, University of Bergen, 5008 Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, 5008 Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","orcid":"https://orcid.org/0000-0001-8524-4036"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["CZ","PL"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Masa\u0159\u00edk","raw_affiliation_strings":["Department of Applied Mathematics of the Faculty of Mathematics and Physics, Charles University, 11800 Prague, Czech Republic","Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, 02-097 Warszawa, Poland"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics of the Faculty of Mathematics and Physics, Charles University, 11800 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, 02-097 Warszawa, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Geevarghese Philip","orcid":"https://orcid.org/0000-0003-0717-7303"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Geevarghese Philip","raw_affiliation_strings":["Chennai Mathematical Institute, Chennai 603103, India","International Joint Unit Research Lab in Computer Science (UMI ReLaX), Chennai 603103, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, Chennai 603103, India","institution_ids":["https://openalex.org/I19149307"]},{"raw_affiliation_string":"International Joint Unit Research Lab in Computer Science (UMI ReLaX), Chennai 603103, India","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"G\u00fcnter Rote","orcid":"https://orcid.org/0000-0002-0351-5945"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G\u00fcnter Rote","raw_affiliation_strings":["Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, D-14195 Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, D-14195 Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7999,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.7629791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"12","issue":"12","first_page":"254","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6377999782562256,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6377999782562256,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.22619999945163727,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.01119999960064888,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.8015999794006348},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7409999966621399},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7002999782562256},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5389000177383423},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.529699981212616},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.45739999413490295},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.41819998621940613}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.8015999794006348},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7409999966621399},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7002999782562256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5924000144004822},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5389000177383423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5385000109672546},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.529699981212616},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.45739999413490295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4478999972343445},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.41819998621940613},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4047999978065491},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3278999924659729},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.2980000078678131},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C114928208","wikidata":"https://www.wikidata.org/wiki/Q17104952","display_name":"Pairwise independence","level":5,"score":0.26969999074935913},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26570001244544983},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2639000117778778}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a12120254","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12120254","pdf_url":"https://www.mdpi.com/1999-4893/12/12/254/pdf?version=1575890415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1911.05032","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.05032","pdf_url":"https://arxiv.org/pdf/1911.05032","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-03470343v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03470343","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, 2019, 12 (12), pp.254. ⟨10.3390/a12120254⟩","raw_type":"Journal articles"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/12/254/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12120254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a12120254","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12120254","pdf_url":"https://www.mdpi.com/1999-4893/12/12/254/pdf?version=1575890415","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2710479047","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G3427116399","display_name":null,"funder_award_id":"274526d","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G4110314010","display_name":null,"funder_award_id":"---","funder_id":"https://openalex.org/F4320323898","funder_display_name":"Bergens Forskningsstiftelse"},{"id":"https://openalex.org/G5946919559","display_name":null,"funder_award_id":"810564","funder_id":"https://openalex.org/F4320323898","funder_display_name":"Bergens Forskningsstiftelse"}],"funders":[{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2984849941.pdf","grobid_xml":"https://content.openalex.org/works/W2984849941.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W124852706","https://openalex.org/W154884867","https://openalex.org/W189719929","https://openalex.org/W1495732641","https://openalex.org/W1513400187","https://openalex.org/W1572096292","https://openalex.org/W1605224640","https://openalex.org/W1625417988","https://openalex.org/W2019325004","https://openalex.org/W2039570968","https://openalex.org/W2051856222","https://openalex.org/W2051947720","https://openalex.org/W2052729468","https://openalex.org/W2056991815","https://openalex.org/W2069986075","https://openalex.org/W2084595628","https://openalex.org/W2114267503","https://openalex.org/W2117068724","https://openalex.org/W2121869744","https://openalex.org/W2153353823","https://openalex.org/W2163600218","https://openalex.org/W2275934786","https://openalex.org/W2401610261","https://openalex.org/W2616737215","https://openalex.org/W2624826130","https://openalex.org/W2895824045","https://openalex.org/W2914414140","https://openalex.org/W2962961217","https://openalex.org/W6628937947","https://openalex.org/W6635289253","https://openalex.org/W6640638419"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,136],"work,":[2],"we":[3],"study":[4],"the":[5,14,35,46,56,71,77,85],"d-Hitting":[6],"Set":[7,11],"and":[8,84],"Feedback":[9],"Vertex":[10],"problems":[12,62,94],"through":[13],"paradigm":[15,41],"of":[16,20,23,37,48,73,79,123,131,139],"finding":[17],"diverse":[18,129],"collections":[19],"r":[21,101],"solutions":[22],"size":[24],"at":[25,44],"most":[26],"k":[27,99],"each,":[28],"which":[29,52],"has":[30],"recently":[31],"been":[32],"introduced":[33],"to":[34],"field":[36],"parameterized":[38],"complexity.":[39],"This":[40],"is":[42,112],"aimed":[43],"addressing":[45],"loss":[47],"important":[49],"side":[50],"information":[51],"typically":[53],"occurs":[54],"during":[55],"abstraction":[57],"process":[58],"that":[59,92,135],"models":[60],"real-world":[61],"as":[63],"computational":[64],"problems.":[65],"We":[66,90,133],"use":[67],"two":[68],"measures":[69],"for":[70,102],"diversity":[72,104],"such":[74],"a":[75,113,121,127],"collection:":[76],"sum":[78],"all":[80],"pairwise":[81,87],"Hamming":[82,88],"distances,":[83],"minimum":[86],"distance.":[89],"show":[91],"both":[93,103],"are":[95],"fixed-parameter":[96],"tractable":[97],"in":[98,109],"+":[100],"measures.":[105],"A":[106],"key":[107],"ingredient":[108],"our":[110],"algorithms":[111],"(problem":[114],"independent)":[115],"network":[116],"flow":[117],"formulation":[118],"that,":[119],"given":[120],"set":[122],"\u2018base\u2019":[124],"solutions,":[125],"computes":[126],"maximally":[128],"collection":[130],"solutions.":[132],"believe":[134],"could":[137],"be":[138],"independent":[140],"interest.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2019-11-22T00:00:00"}