{"id":"https://openalex.org/W6891578761","doi":"https://doi.org/10.4230/lipics.icalp.2024.26","title":"Another Hamiltonian Cycle in Bipartite Pfaffian Graphs","display_name":"Another Hamiltonian Cycle in Bipartite Pfaffian Graphs","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W6891578761","doi":"https://doi.org/10.4230/lipics.icalp.2024.26"},"language":"en","primary_location":{"id":"pmh:oai:pure.atira.dk:publications/73721b26-7a63-4696-aea5-2265fafd57e2","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/73721b26-7a63-4696-aea5-2265fafd57e2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, A, Kaski, P & Nederlof, J 2024, 'Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.', pp. 26:1-26:20. https://doi.org/10.4230/LIPICS.ICALP.2024.26","raw_type":"conferenceObject"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.itu.dk/portal/da/publications/73721b26-7a63-4696-aea5-2265fafd57e2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bj\u00f6rklund, Andreas","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Bj\u00f6rklund, Andreas","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0009-9303-9986","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Kaski, Petteri","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Kaski, Petteri","raw_affiliation_strings":["Aalto University, Finland"],"raw_orcid":"https://orcid.org/0009-0002-3069-7753","affiliations":[{"raw_affiliation_string":"Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":null,"display_name":"Nederlof, Jesper","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":false,"raw_author_name":"Nederlof, Jesper","raw_affiliation_strings":["Utrecht University, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29467924,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.44760000705718994,"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.44760000705718994,"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.21299999952316284,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.11110000312328339,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7297999858856201},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7124999761581421},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.6811000108718872},{"id":"https://openalex.org/keywords/foster-graph","display_name":"Foster graph","score":0.5328999757766724},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.4984999895095825},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.45100000500679016},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.42309999465942383},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.4106999933719635}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.796500027179718},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7454000115394592},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7297999858856201},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7124999761581421},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.6811000108718872},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5777000188827515},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.5328999757766724},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.4984999895095825},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.42309999465942383},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.4106999933719635},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.40709999203681946},{"id":"https://openalex.org/C2775956649","wikidata":"https://www.wikidata.org/wiki/Q1189744","display_name":"Pfaffian","level":2,"score":0.4009999930858612},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.39899998903274536},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.37529999017715454},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.36730000376701355},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.329800009727478},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.32199999690055847},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.3199999928474426},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.31459999084472656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.2606000006198883}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:pure.atira.dk:publications/73721b26-7a63-4696-aea5-2265fafd57e2","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/73721b26-7a63-4696-aea5-2265fafd57e2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, A, Kaski, P & Nederlof, J 2024, 'Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.', pp. 26:1-26:20. https://doi.org/10.4230/LIPICS.ICALP.2024.26","raw_type":"conferenceObject"},{"id":"pmh:oai:drops-oai.dagstuhl.de:20169","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.26","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol297-icalp2024/LIPIcs.ICALP.2024.26/LIPIcs.ICALP.2024.26.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"","raw_type":"InProceedings"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/130381","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/78d3a267-8213-4472-82d7-1735f2894352","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:openaire/73721b26-7a63-4696-aea5-2265fafd57e2","is_oa":true,"landing_page_url":"https://dblp.org/rec/conf/icalp/BjorklundKN24","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"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":"Bj\u00f6rklund, A, Kaski, P & Nederlof, J 2024, 'Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.', pp. 26:1-26:20. https://doi.org/10.4230/LIPICS.ICALP.2024.26","raw_type":"conferenceObject"},{"id":"doi:10.4230/lipics.icalp.2024.26","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2024.26","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/73721b26-7a63-4696-aea5-2265fafd57e2","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/73721b26-7a63-4696-aea5-2265fafd57e2","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, A, Kaski, P & Nederlof, J 2024, 'Another Hamiltonian Cycle in Bipartite Pfaffian Graphs.', pp. 26:1-26:20. https://doi.org/10.4230/LIPICS.ICALP.2024.26","raw_type":"conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Finding":[0],"a":[1,5,49,72,92,104,129,139,193,218,228],"Hamiltonian":[2,23,44,58,105,113,135,229,247,269,312],"cycle":[3,24,45,59,106,114,230],"in":[4,12,25,53,95,138,144,163,205,210,232,239,253,271,283],"given":[6,21,93],"graph":[7,27,73,94,197,221,303],"is":[8,19,60,87,98,317],"computationally":[9],"challenging,":[10],"and":[11,28,173,199,207,234,241,267],"general":[13,196,284],"remains":[14],"so":[15],"even":[16,52],"when":[17,101],"one":[18,22,51,203,208],"further":[20,258],"the":[26,54,76,96,110,178,185,188,250,314,320],"asked":[29],"to":[30,63,89],"find":[31],"another.":[32],"In":[33],"fact,":[34],"no":[35],"significantly":[36],"faster":[37],"algorithms":[38,260],"are":[39,166,279],"known":[40,167],"for":[41,47,67,132,152,261,294,319],"finding":[42,48,133,262],"another":[43,57,112,134],"than":[46],"first":[50],"setting":[55],"where":[56,85,177],"structurally":[61],"guaranteed":[62],"exist,":[64],"such":[65],"as":[66,107,215],"odd-degree":[68],"graphs.":[69,148,286],"We":[70,119,255],"identify":[71],"class":[74,97,198],"-":[75,84],"bipartite":[77,146,154,171,219,272,301],"Pfaffian":[78,147,220,302],"graphs":[79,156,172,176,274],"of":[80,109,142,168,187,223],"minimum":[81,224],"degree":[82,225],"three":[83,245],"it":[86],"NP-complete":[88],"decide":[90],"whether":[91],"Hamiltonian,":[99],"but":[100],"presented":[102],"with":[103,275],"part":[108],"input,":[111],"can":[115],"be":[116],"found":[117],"efficiently.":[118],"prove":[120],"that":[121,213,278,298],"Thomason\u2019s":[122],"lollipop":[123,179,189],"method":[124,180],"[Ann.":[125],"Discrete":[126],"Math.,":[127],"1978],":[128],"well-known":[130],"algorithm":[131],"cycle,":[136],"runs":[137],"linear":[140],"number":[141],"steps":[143],"cubic":[145,153,170,174,300],"This":[149],"was":[150],"conjectured":[151],"planar":[155,175,273,285],"by":[157],"Haddadan":[158],"[MSc":[159],"thesis,":[160],"Waterloo,":[161],"2015];":[162],"contrast,":[164],"examples":[165],"both":[169],"takes":[181],"exponential":[182],"time.":[183],"Beyond":[184],"reach":[186],"method,":[190],"we":[191,296],"address":[192],"slightly":[194],"more":[195],"present":[200,257],"two":[201],"algorithms,":[202],"running":[204,276],"linear-time":[206],"operating":[209],"logarithmic":[211],"space,":[212],"take":[214],"input":[216],"(i)":[217],"G":[222],"three,":[226],"(ii)":[227],"H":[231],"G,":[233],"(iii)":[235],"an":[236],"edge":[237,251],"e":[238,252],"H,":[240],"output":[242],"at":[243,308],"least":[244,309],"other":[246],"cycles":[248,270],"through":[249],"G.":[254],"also":[256,289],"improved":[259],"optimal":[263],"traveling":[264],"salesperson":[265],"tours":[266],"counting":[268],"times":[277],"not":[280],"achieved":[281],"yet":[282],"Our":[287],"technique":[288],"has":[290,304],"purely":[291],"graph-theoretical":[292],"consequences;":[293],"example,":[295],"show":[297],"every":[299],"either":[305],"zero":[306],"or":[307],"six":[310],"distinct":[311],"cycles;":[313],"latter":[315],"case":[316],"tight":[318],"cube":[321],"graph.":[322]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}