{"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","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%2Fs00453-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,"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"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0189-9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059882142","display_name":"Bart Jansen","orcid":"https://orcid.org/0000-0001-8042-6834"},"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":"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"],"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"},"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":"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"],"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":2,"corresponding_author_ids":["https://openalex.org/A5059882142"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.4376,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.82510119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"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.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9751999974250793,"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/combinatorics","display_name":"Combinatorics","score":0.8105679750442505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7920809984207153},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5658938884735107},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.488386332988739},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45530739426612854},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.44628801941871643},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4390513002872467},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4193490743637085},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4114251434803009},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3721276819705963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1298064887523651}],"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":5,"locations":[{"id":"doi: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%2Fs00453-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,"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","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,"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/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/1793c189-7dda-474d-912f-c6754288e829","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/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"pmh:oai:pure.tue.nl:publications/1793c189-7dda-474d-912f-c6754288e829","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84983503849&partnerID=8YFLogxK","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"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/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:studenttheses/fea85513-44a4-4bdd-b403-6d30bcdc7245","is_oa":false,"landing_page_url":"https://research.tue.nl/en/studentTheses/fea85513-44a4-4bdd-b403-6d30bcdc7245","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":"","raw_type":""}],"best_oa_location":{"id":"doi: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%2Fs00453-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,"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":[],"awards":[{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1909439116.pdf","grobid_xml":"https://content.openalex.org/works/W1909439116.grobid-xml"},"referenced_works_count":32,"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/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/W2750749068","https://openalex.org/W2988908508","https://openalex.org/W3098486139","https://openalex.org/W6631662886"],"related_works":["https://openalex.org/W3020640542","https://openalex.org/W2292973071","https://openalex.org/W2476602023","https://openalex.org/W2381408042","https://openalex.org/W4245720151","https://openalex.org/W1606657688","https://openalex.org/W4301454895","https://openalex.org/W2909144890","https://openalex.org/W4211121212","https://openalex.org/W4318567365"],"abstract_inverted_index":{"We":[0,97,111,166],"present":[1,99],"several":[2],"sparsification":[3,107],"lower":[4],"and":[5,14,23,59,73,103],"upper":[6],"bounds":[7,151],"for":[8,53,71,109,136],"classic":[9],"problems":[10,18],"in":[11,156],"graph":[12],"theory":[13],"logic.":[15],"For":[16],"the":[17,60,152,174],"4-Coloring,":[19],"(Directed)":[20],"Hamiltonian":[21],"Cycle,":[22],"(Connected)":[24,82],"Dominating":[25,83],"Set,":[26],"we":[27],"prove":[28],"that":[29,35,67,115,150,168,176],"there":[30],"is":[31,142,171],"no":[32],"polynomial-time":[33,61],"algorithm":[34,108,114,141],"reduces":[36,116],"any":[37,137],"n-vertex":[38,160],"input":[39,119,130],"to":[40,88,127],"an":[41,45,113,117,128],"equivalent":[42,129],"instance,":[43],"of":[44,81,122,148,154],"arbitrary":[46],"problem,":[47],"with":[48,120,131],"bitsize":[49],"O(n":[50,132],"2-":[51,91],")":[52,92,134],">":[54],"0,":[55],"unless":[56,94],"NP":[57,95,177],"coNP/poly":[58],"hierarchy":[62],"collapses.":[63],"These":[64],"results":[65],"imply":[66],"existing":[68],"linearvertex":[69],"kernels":[70],"k-Nonblocker":[72],"k-Max":[74],"Leaf":[75],"Spanning":[76],"Tree":[77],"(the":[78],"parametric":[79],"duals":[80],"Set)":[84],"cannot":[85],"be":[86],"improved":[87],"have":[89],"O(k":[90],"edges,":[93],"coNP/poly.":[96,178],"also":[98],"a":[100,105,145],"positive":[101],"result":[102],"exhibit":[104],"nontrivial":[106],"d-Not-All-Equal-SAT.":[110],"give":[112],"n-variable":[118],"clauses":[121],"size":[123],"at":[124],"most":[125],"d":[126],"d-1":[133,164],"clauses,":[135],"fixed":[138],"d.":[139],"Our":[140],"based":[143],"on":[144],"linear-algebraic":[146],"proof":[147],"Lovsz":[149],"number":[153],"hyperedges":[155],"critically":[157],"3-chromatic":[158],"duniform":[159],"hypergraphs":[161],"by":[162],"n":[163],".":[165],"show":[167],"our":[169],"kernel":[170],"tight":[172],"under":[173],"assumption":[175]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}