{"id":"https://openalex.org/W7163921576","doi":"https://doi.org/10.4230/lipics.swat.2026.32","title":"Semirandom Planted Bipartite Subgraphs","display_name":"Semirandom Planted Bipartite Subgraphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163921576","doi":"https://doi.org/10.4230/lipics.swat.2026.32"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26068","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.32","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.32/LIPIcs.SWAT.2026.32.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.32/LIPIcs.SWAT.2026.32.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059653613","display_name":"Anand Louis","orcid":"https://orcid.org/0000-0002-4727-9219"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Louis, Anand","raw_affiliation_strings":["Indian Institute of Science, Bengaluru, India"],"raw_orcid":"https://orcid.org/0000-0002-4727-9219","affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bengaluru, India","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138154534","display_name":"Kirtan Vora","orcid":"https://orcid.org/0009-0008-5154-1639"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vora, Kirtan","raw_affiliation_strings":["Indian Institute of Science, Bengaluru, India"],"raw_orcid":"https://orcid.org/0009-0008-5154-1639","affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bengaluru, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.94616997,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.583299994468689,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.583299994468689,"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":0.12919999659061432,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.10239999741315842,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8849999904632568},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5873000025749207},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5346999764442444},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5065000057220459},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.44530001282691956},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4106000065803528},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.40849998593330383}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8849999904632568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8158000111579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7573000192642212},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5873000025749207},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5346999764442444},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5065000057220459},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.44530001282691956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44339999556541443},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4106000065803528},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.40849998593330383},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3521000146865845},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.3278000056743622},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.25780001282691956},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26068","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.32","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.32/LIPIcs.SWAT.2026.32.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.32","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.32","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26068","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.32","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.32/LIPIcs.SWAT.2026.32.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163921576.pdf","grobid_xml":"https://content.openalex.org/works/W7163921576.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"There":[0],"have":[1],"been":[2,88],"many":[3],"recent":[4,104],"works":[5],"studying":[6],"planted":[7,12,79,135],"subgraphs":[8],"problems.":[9],"The":[10,76],"semirandom":[11,78,134],"bipartite":[13,40,136,182],"subgraph":[14,137],"problem":[15,122,138],"is":[16,35,42,61,71,190],"defined":[17],"as":[18,159],"follows.":[19],"Starting":[20],"with":[21,64,91],"a":[22,85],"vertex":[23],"set":[24],"V,":[25],"an":[26,38,59,68,118,131],"arbitrary":[27,39,69,178],"subset":[28],"S":[29,54,83],"\u2282":[30],"V":[31],"of":[32,51,94,164,180],"size":[33],"k":[34,124,140],"chosen,":[36],"then":[37,67],"graph":[41,70,183],"added":[43,62,72],"on":[44,73],"S.":[45,75],"After":[46],"this":[47,121],"between":[48],"each":[49],"pair":[50],"vertices":[52],"in":[53],"\u00d7":[55],"(V":[56],"\u29f5":[57],"S)":[58],"edge":[60],"independently":[63],"probability":[65],"p,":[66],"V\u29f5":[74],"analogous":[77],"clique":[80],"problem,":[81],"where":[82],"forms":[84],"clique,":[86],"has":[87],"studied":[89],"starting":[90],"the":[92,146,157,160,177,181],"work":[93,105],"Fiege":[95],"and":[96,100,113,145,189],"Kilian":[97],"[Uriel":[98],"Feige":[99],"Joe":[101],"Kilian,":[102],"2001];":[103],"by":[106],"[Blasiok":[107,165],"et":[108,166],"al.,":[109,167],"2024;":[110],"Venkatesan":[111],"Guruswami":[112],"Hsin-Po":[114],"Wang,":[115],"2025]":[116],"gave":[117],"algorithm":[119,132,163],"for":[120,133],"when":[123,139],"=":[125,141],"\u03a9(\u221a{n":[126,142],"log":[127,143],"n}).":[128],"We":[129,169],"give":[130],"n})":[144],"two":[147],"color":[148],"classes":[149],"are":[150,155],"roughly":[151],"balanced.":[152],"Our":[153],"algorithms":[154],"essentially":[156],"same":[158],"elegant":[161],"greedy":[162],"2024].":[168],"generalize":[170],"their":[171],"idea":[172],"to":[173],"our":[174,191],"setting.":[175],"Handling":[176],"nature":[179],"requires":[184],"some":[185],"new":[186],"technical":[187,193],"ideas":[188],"main":[192],"contribution.":[194]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}