{"id":"https://openalex.org/W196852542","doi":"https://doi.org/10.1007/978-3-642-21311-3_11","title":"Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry","display_name":"Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W196852542","doi":"https://doi.org/10.1007/978-3-642-21311-3_11","mag":"196852542"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21311-3_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21311-3_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5026334888","display_name":"Tim Januschowski","orcid":"https://orcid.org/0000-0002-6475-1626"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Tim Januschowski","raw_affiliation_strings":["Cork Constraint Computation Centre, Computer Science Department, University College Cork, Ireland","[Computer Science Dept, University College Cork, Ireland]"],"affiliations":[{"raw_affiliation_string":"Cork Constraint Computation Centre, Computer Science Department, University College Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]},{"raw_affiliation_string":"[Computer Science Dept, University College Cork, Ireland]","institution_ids":["https://openalex.org/I27577105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033982876","display_name":"Marc E. Pfetsch","orcid":"https://orcid.org/0000-0002-0947-7193"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc E. Pfetsch","raw_affiliation_strings":["Institute for Mathematical Optimization, TU Braunschweig, Braunschweig, Germany","Institute for Mathematical Optimization, TU Braunschweig, Braunschweig, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute for Mathematical Optimization, TU Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]},{"raw_affiliation_string":"Institute for Mathematical Optimization, TU Braunschweig, Braunschweig, Germany#TAB#","institution_ids":["https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026334888"],"corresponding_institution_ids":["https://openalex.org/I27577105"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.6759,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90119572,"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":"99","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.6352465152740479},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5887205600738525},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5420570969581604},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5287548899650574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5184104442596436},{"id":"https://openalex.org/keywords/symmetry","display_name":"Symmetry (geometry)","score":0.5175061225891113},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4969682991504669},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4905816614627838},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4821195602416992},{"id":"https://openalex.org/keywords/homogeneous-space","display_name":"Homogeneous space","score":0.4677337110042572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4671081304550171},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4544530212879181},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.438273549079895},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.408632755279541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3775714039802551},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30602699518203735},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.19229301810264587},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.19198811054229736},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15364748239517212},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.07597753405570984}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6352465152740479},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5887205600738525},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5420570969581604},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5287548899650574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5184104442596436},{"id":"https://openalex.org/C2779886137","wikidata":"https://www.wikidata.org/wiki/Q21030012","display_name":"Symmetry (geometry)","level":2,"score":0.5175061225891113},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4969682991504669},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4905816614627838},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4821195602416992},{"id":"https://openalex.org/C96469262","wikidata":"https://www.wikidata.org/wiki/Q1324364","display_name":"Homogeneous space","level":2,"score":0.4677337110042572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4671081304550171},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4544530212879181},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.438273549079895},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.408632755279541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3775714039802551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30602699518203735},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.19229301810264587},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.19198811054229736},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15364748239517212},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.07597753405570984},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-21311-3_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21311-3_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.4385","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.4385","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2011/02/2909.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W131311523","https://openalex.org/W196852542","https://openalex.org/W240203132","https://openalex.org/W1524973174","https://openalex.org/W1547410739","https://openalex.org/W1548885290","https://openalex.org/W1567586152","https://openalex.org/W1580430168","https://openalex.org/W1641347941","https://openalex.org/W1773554800","https://openalex.org/W1968143987","https://openalex.org/W1970686950","https://openalex.org/W1970944326","https://openalex.org/W1979266797","https://openalex.org/W1990267895","https://openalex.org/W1990600049","https://openalex.org/W1996082231","https://openalex.org/W2011039300","https://openalex.org/W2014328192","https://openalex.org/W2016578044","https://openalex.org/W2052435807","https://openalex.org/W2074723965","https://openalex.org/W2086628398","https://openalex.org/W2089718638","https://openalex.org/W2091804033","https://openalex.org/W2100440346","https://openalex.org/W2136660173","https://openalex.org/W2147600044","https://openalex.org/W2148043549","https://openalex.org/W2151028272","https://openalex.org/W2151352672","https://openalex.org/W2162391002","https://openalex.org/W2352490338","https://openalex.org/W2485669722","https://openalex.org/W2496185699","https://openalex.org/W2501112583","https://openalex.org/W2505968561","https://openalex.org/W2607539118","https://openalex.org/W2895284333","https://openalex.org/W2911404369","https://openalex.org/W2912269841","https://openalex.org/W2912540313","https://openalex.org/W2914080086","https://openalex.org/W2914155449","https://openalex.org/W3035851332","https://openalex.org/W3048676472","https://openalex.org/W4236067063","https://openalex.org/W4255199623","https://openalex.org/W4285719527","https://openalex.org/W4293860921","https://openalex.org/W6631722374"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W3008959778","https://openalex.org/W2789636091","https://openalex.org/W2288163449","https://openalex.org/W2007346569","https://openalex.org/W2891069083","https://openalex.org/W2789630860","https://openalex.org/W2031967239","https://openalex.org/W2367468405","https://openalex.org/W4381707488"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}