{"id":"https://openalex.org/W2136595209","doi":"https://doi.org/10.1007/s00453-013-9759-2","title":"Inclusion/Exclusion Meets Measure and Conquer","display_name":"Inclusion/Exclusion Meets Measure and Conquer","publication_year":2013,"publication_date":"2013-02-26","ids":{"openalex":"https://openalex.org/W2136595209","doi":"https://doi.org/10.1007/s00453-013-9759-2","mag":"2136595209"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-013-9759-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9759-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The Netherlands","Utrecht university >  >  >  >"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, Princetonplein 5, 3584 CC, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055143803","display_name":"Johan M. M. van Rooij","orcid":"https://orcid.org/0000-0001-9149-4162"},"institutions":[{"id":"https://openalex.org/I4210119692","display_name":"Numerical Method (China)","ror":"https://ror.org/02ns8zp42","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210119692"]},{"id":"https://openalex.org/I4210128000","display_name":"DTV Consultants (Netherlands)","ror":"https://ror.org/02tga4733","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210128000"]}],"countries":["CN","NL"],"is_corresponding":false,"raw_author_name":"Johan M. M. van Rooij","raw_affiliation_strings":["Consultants in Quantitative Methods, Vonderweg 16, 5616 RM, Eindhoven, The Netherlands","Consultants in Quantitative Methods"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Consultants in Quantitative Methods, Vonderweg 16, 5616 RM, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I4210128000"]},{"raw_affiliation_string":"Consultants in Quantitative Methods","institution_ids":["https://openalex.org/I4210119692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090955861","display_name":"Thomas C. van Dijk","orcid":"https://orcid.org/0000-0001-6553-7317"},"institutions":[{"id":"https://openalex.org/I25974101","display_name":"University of W\u00fcrzburg","ror":"https://ror.org/00fbnyb24","country_code":"DE","type":"education","lineage":["https://openalex.org/I25974101"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas C. van Dijk","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informatik I, Universit\u00e4t W\u00fcrzburg, Am Hubland, 97074, W\u00fcrzburg, Germany","Universit\u00e4t W\u00fcrzburg#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informatik I, Universit\u00e4t W\u00fcrzburg, Am Hubland, 97074, W\u00fcrzburg, Germany","institution_ids":["https://openalex.org/I25974101"]},{"raw_affiliation_string":"Universit\u00e4t W\u00fcrzburg#TAB#","institution_ids":["https://openalex.org/I25974101"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068357631"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":3.2081,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.92293734,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7259524464607239},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6753741502761841},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5531858801841736},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5368326902389526},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5206936597824097},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4697100520133972},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4694136083126068},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44502967596054077},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4342747926712036},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.41928961873054504},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4132838249206543},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34934282302856445},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.23571965098381042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2095303237438202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17281121015548706}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7259524464607239},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6753741502761841},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5531858801841736},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5368326902389526},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5206936597824097},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4697100520133972},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4694136083126068},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44502967596054077},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4342747926712036},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.41928961873054504},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4132838249206543},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34934282302856445},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.23571965098381042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2095303237438202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17281121015548706},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-013-9759-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-013-9759-2","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/a721d59f-c6a2-49b9-896b-073501277643","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/a721d59f-c6a2-49b9-896b-073501277643","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nederlof, J, Van Rooij, J M M & Van Dijk, T C 2014, 'Inclusion/exclusion meets measure and conquer', Algorithmica, vol. 69, no. 3, pp. 685-740. https://doi.org/10.1007/s00453-013-9759-2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:782946","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=782946","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:782946","is_oa":false,"landing_page_url":"http://repository.tue.nl/782946","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":88,"referenced_works":["https://openalex.org/W66071877","https://openalex.org/W111776391","https://openalex.org/W176103388","https://openalex.org/W1439548790","https://openalex.org/W1489932425","https://openalex.org/W1499244302","https://openalex.org/W1506916381","https://openalex.org/W1512871835","https://openalex.org/W1556665380","https://openalex.org/W1570370412","https://openalex.org/W1579510955","https://openalex.org/W1581812120","https://openalex.org/W1584978552","https://openalex.org/W1666834859","https://openalex.org/W1691921959","https://openalex.org/W1796559407","https://openalex.org/W1799048485","https://openalex.org/W1808823193","https://openalex.org/W1856729396","https://openalex.org/W1975286948","https://openalex.org/W1975587904","https://openalex.org/W1978452004","https://openalex.org/W1981360277","https://openalex.org/W1988642505","https://openalex.org/W1991477862","https://openalex.org/W1993301031","https://openalex.org/W1999216089","https://openalex.org/W2001868457","https://openalex.org/W2008289509","https://openalex.org/W2011039300","https://openalex.org/W2014430206","https://openalex.org/W2015963099","https://openalex.org/W2019800388","https://openalex.org/W2021156120","https://openalex.org/W2021180976","https://openalex.org/W2025756084","https://openalex.org/W2026416569","https://openalex.org/W2026820987","https://openalex.org/W2034597127","https://openalex.org/W2039241885","https://openalex.org/W2040813792","https://openalex.org/W2044104853","https://openalex.org/W2045326192","https://openalex.org/W2047470084","https://openalex.org/W2047916710","https://openalex.org/W2048060811","https://openalex.org/W2053308793","https://openalex.org/W2061513598","https://openalex.org/W2070684734","https://openalex.org/W2074359677","https://openalex.org/W2081438146","https://openalex.org/W2085870956","https://openalex.org/W2087083200","https://openalex.org/W2089718638","https://openalex.org/W2094077034","https://openalex.org/W2096495231","https://openalex.org/W2097782835","https://openalex.org/W2099474653","https://openalex.org/W2100239335","https://openalex.org/W2103164681","https://openalex.org/W2108524515","https://openalex.org/W2115147103","https://openalex.org/W2116671197","https://openalex.org/W2126436716","https://openalex.org/W2127390687","https://openalex.org/W2130108851","https://openalex.org/W2134046427","https://openalex.org/W2134754301","https://openalex.org/W2139087151","https://openalex.org/W2141946535","https://openalex.org/W2151423246","https://openalex.org/W2151732151","https://openalex.org/W2154399201","https://openalex.org/W2170702810","https://openalex.org/W2180968341","https://openalex.org/W2408491755","https://openalex.org/W2503837195","https://openalex.org/W2535182880","https://openalex.org/W2561675875","https://openalex.org/W2569523145","https://openalex.org/W2570469658","https://openalex.org/W2592570088","https://openalex.org/W2895952552","https://openalex.org/W2913012475","https://openalex.org/W2986773320","https://openalex.org/W3125684764","https://openalex.org/W4246010551","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1968954131","https://openalex.org/W2082636129","https://openalex.org/W1521364045","https://openalex.org/W2982557863","https://openalex.org/W2925112333","https://openalex.org/W2075449032","https://openalex.org/W2583998759","https://openalex.org/W2337498233","https://openalex.org/W3190027049","https://openalex.org/W4388963202"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}