{"id":"https://openalex.org/W1909439116","doi":"https://doi.org/10.1007/s00453-016-0189-9","title":"Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT","display_name":"Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT","publication_year":2016,"publication_date":"2016-08-22","ids":{"openalex":"https://openalex.org/W1909439116","doi":"https://doi.org/10.1007/s00453-016-0189-9","mag":"1909439116"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0189-9","doi":"https://doi.org/10.1007/s00453-016-0189-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0189-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0189-9.pdf","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,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0189-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268","observed_orcids":["https://orcid.org/0000-0001-8204-1268"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","Eindhoven University of Technology , Eindhoven , The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology , Eindhoven , The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721","observed_orcids":["https://orcid.org/0000-0003-3721-6721"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","Eindhoven University of Technology , Eindhoven , The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3721-6721","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P. O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology , Eindhoven , The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047711767"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":2.2862,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87416417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":"79","issue":"1","first_page":"3","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9926999807357788,"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.9926999807357788,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.006899999920278788,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"kernelization","score":0.6940000057220459},{"id":"https://openalex.org/keywords/4-coloring","display_name":"4-coloring","score":0.6589999794960022},{"id":"https://openalex.org/keywords/hamiltonian-cycles","display_name":"Hamiltonian cycles","score":0.9269999861717224},{"id":"https://openalex.org/keywords/dominating-sets","display_name":"dominating sets","score":0.8420000076293945},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"polynomial hierarchy","score":0.8320000171661377},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.4740000069141388}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8105679750442505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7920809984207153},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5658938884735107},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.488386332988739},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45530739426612854},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.44628801941871643},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4390513002872467},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4193490743637085},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4114251434803009},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3721276819705963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1298064887523651},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":20,"locations":[{"id":"doi:10.1007/s00453-016-0189-9","doi":"https://doi.org/10.1007/s00453-016-0189-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0189-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0189-9.pdf","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,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/1793c189-7dda-474d-912f-c6754288e829","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/1793c189-7dda-474d-912f-c6754288e829","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,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & Pieterse, A 2017, 'Sparsification upper and lower bounds for graph problems and not-all-equal SAT', Algorithmica, vol. 79, no. 1, pp. 3-28. https://doi.org/10.1007/s00453-016-0189-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1509.07437","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1509.07437","pdf_url":"https://arxiv.org/pdf/1509.07437","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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:tue:oai:pure.tue.nl:publications/1793c189-7dda-474d-912f-c6754288e829","doi":null,"is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/1793c189-7dda-474d-912f-c6754288e829","pdf_url":"https://research.tue.nl/nl/publications/1793c189-7dda-474d-912f-c6754288e829","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,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Algorithmica, 79(1), 3 - 28. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:2951838648","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1509.07437","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:802706","doi":null,"is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=802706","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,"listed_in":[],"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":"","raw_type":"External research report"},{"id":"pmh:856802","doi":null,"is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=856802","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,"listed_in":[],"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:884506","doi":null,"is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=884506","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,"listed_in":[],"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:891090","doi":null,"is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=891090","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,"listed_in":[],"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":"","raw_type":"External research report"},{"id":"pmh:oai:library.tue.nl:802706","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/802706","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,"listed_in":[],"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":"","raw_type":"External research report"},{"id":"pmh:oai:library.tue.nl:856802","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/856802","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,"listed_in":[],"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:884506","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/884506","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,"listed_in":[],"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:891090","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/891090","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,"listed_in":[],"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":"","raw_type":"External research report"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/060c5466-b80c-4230-8115-7e8380d2e6a5","doi":null,"is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/060c5466-b80c-4230-8115-7e8380d2e6a5","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,"listed_in":[],"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":"Jansen, B M P & Pieterse, A 2015, Sparsification upper and lower bounds for graph problems and Not-All-Equal SAT. arXiv, vol. 1509.07437 [cs.CC], s.n.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:library.tue.nl:802706","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/802706","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,"listed_in":[],"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":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:library.tue.nl:856802","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/856802","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,"listed_in":[],"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":"Algorithmica, 79(1), 1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:884506","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/884506","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,"listed_in":[],"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":"Algorithmica, 79(1), 3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:891090","doi":null,"is_oa":false,"landing_page_url":"http://repository.tue.nl/891090","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,"listed_in":[],"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":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/060c5466-b80c-4230-8115-7e8380d2e6a5","doi":null,"is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/060c5466-b80c-4230-8115-7e8380d2e6a5","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,"listed_in":[],"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":"","raw_type":"info:eu-repo/semantics/report"},{"id":"doi:10.48550/arxiv.1509.07437","doi":"https://doi.org/10.48550/arxiv.1509.07437","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1509.07437","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1007/s00453-016-0189-9","doi":"https://doi.org/10.1007/s00453-016-0189-9","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-016-0189-9","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-016-0189-9.pdf","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,"listed_in":["anvur-scientific","ccf-b","cwts-core","dongbi-b","jufo-2","norway-2","poland-70","russia-white-list-2","vabb-shw"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1909439116.pdf","grobid_xml":"https://content.openalex.org/works/W1909439116.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W184144034","https://openalex.org/W285041758","https://openalex.org/W631645519","https://openalex.org/W1556665380","https://openalex.org/W1581222813","https://openalex.org/W1606657688","https://openalex.org/W1779781738","https://openalex.org/W1796863810","https://openalex.org/W1821538950","https://openalex.org/W1975442866","https://openalex.org/W1976430052","https://openalex.org/W1995725694","https://openalex.org/W1998964055","https://openalex.org/W2005475011","https://openalex.org/W2009695707","https://openalex.org/W2013415302","https://openalex.org/W2022841964","https://openalex.org/W2034437384","https://openalex.org/W2034472295","https://openalex.org/W2039100365","https://openalex.org/W2051856222","https://openalex.org/W2052712469","https://openalex.org/W2061513598","https://openalex.org/W2107284348","https://openalex.org/W2116087731","https://openalex.org/W2117427564","https://openalex.org/W2133839241","https://openalex.org/W2135418030","https://openalex.org/W2401610261","https://openalex.org/W2418282370","https://openalex.org/W2750749068","https://openalex.org/W3098486139","https://openalex.org/W6631662886"],"related_works":["https://openalex.org/W2540110070","https://openalex.org/W2568676844","https://openalex.org/W2394551153","https://openalex.org/W1821538950","https://openalex.org/W2785423886","https://openalex.org/W2052712469","https://openalex.org/W2418282370","https://openalex.org/W4229577492","https://openalex.org/W3020027665","https://openalex.org/W2153676433"],"abstract_inverted_index":{"We":[0,102,116,171],"present":[1,104],"several":[2],"sparsification":[3,112],"lower":[4],"and":[5,14,23,62,76,108],"upper":[6],"bounds":[7,154],"for":[8,52,74,114,139],"classic":[9],"problems":[10,18],"in":[11,159],"graph":[12],"theory":[13],"logic.":[15],"For":[16],"the":[17,63,155,179],"4-Coloring,":[19],"(Directed)":[20],"Hamiltonian":[21],"Cycle,":[22],"(Connected)":[24,85],"Dominating":[25,86],"Set,":[26],"we":[27],"prove":[28],"that":[29,35,70,120,153,173,181],"there":[30],"is":[31,145,176],"no":[32],"polynomial-time":[33,64],"algorithm":[34,113,119,144],"reduces":[36,121],"any":[37,140],"n-vertex":[38,163],"input":[39,124,135],"to":[40,91,132],"an":[41,45,118,122,133],"equivalent":[42,134],"instance,":[43],"of":[44,84,127,151,157],"arbitrary":[46],"problem,":[47],"with":[48,125,136],"bitsize":[49],"$$O(n^{2-\\varepsilon":[50],"})$$":[51,94],"$$\\varepsilon":[53],">":[54],"0$$":[55],",":[56],"unless":[57,96],"$$\\mathsf":[58,97,182],"{NP":[59,98],"\\subseteq":[60,99],"coNP/poly}$$":[61,100],"hierarchy":[65],"collapses.":[66],"These":[67],"results":[68],"imply":[69],"existing":[71],"linear-vertex":[72],"kernels":[73],"k-Nonblocker":[75],"k-Max":[77],"Leaf":[78],"Spanning":[79],"Tree":[80],"(the":[81],"parametric":[82],"duals":[83],"Set)":[87],"cannot":[88],"be":[89],"improved":[90],"have":[92],"$$O(k^{2-\\varepsilon":[93],"edges,":[95],".":[101,170,188],"also":[103],"a":[105,110,148],"positive":[106],"result":[107],"exhibit":[109],"non-trivial":[111],"d-Not-All-Equal-SAT.":[115],"give":[117],"n-variable":[123],"clauses":[126],"size":[128],"at":[129],"most":[130],"d":[131],"$$O(n^{d-1})$$":[137],"clauses,":[138],"fixed":[141],"d.":[142],"Our":[143],"based":[146],"on":[147],"linear-algebraic":[149],"proof":[150],"Lov\u00e1sz":[152],"number":[156],"hyperedges":[158],"critically":[160],"3-chromatic":[161],"d-uniform":[162],"hypergraphs":[164],"by":[165],"$$\\left(":[166],"{\\begin{array}{c}n\\\\":[167],"d-1\\end{array}}\\right)":[168],"$$":[169],"show":[172],"our":[174],"kernel":[175],"tight":[177],"under":[178],"assumption":[180],"{NP}":[183],"\\nsubseteq":[184],"\\mathsf":[185],"{coNP}/\\mathsf":[186],"{poly}$$":[187]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}
