{"payload":{"header_redesign_enabled":false,"results":[{"id":"44529731","archived":false,"color":"#f34b7d","followers":63,"has_funding_file":false,"hl_name":"KarlsruheMIS/KaMIS","hl_trunc_description":"Maximum independent sets and vertex covers of large sparse graphs.","language":"C++","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":44529731,"name":"KaMIS","owner_id":66692179,"owner_login":"KarlsruheMIS","updated_at":"2024-02-12T19:59:45.277Z","has_issues":true}},"sponsorable":false,"topics":["algorithm","graph","reductions","datareduction","sparse-graphs","maximum-independent-sets","kernelization"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":86,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253AKarlsruheMIS%252FKaMIS%2B%2Blanguage%253AC%252B%252B","metadata":null,"csrf_tokens":{"/KarlsruheMIS/KaMIS/star":{"post":"BvpDxQJ6-w7GhlfdqUfMTZ-wYiSwoSZkC2pLs-v0iwIlrT8jK9XERFYqWCAe6Iu4-k00wSQsxiCx58Ze21x8tg"},"/KarlsruheMIS/KaMIS/unstar":{"post":"AquauPQgd0t0Bhjgf_40-V0jnFLn0Dori8ymfcEvluot1dc8b81eosN-t7jUCiaal9PCOR8LqkhTHFlQN36qlw"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"dC7RvXciP5XRwICGnz_RDzOsc865Onfr6c8G2DmlHOnlLOBUBFe6kgEcxxC6snJM5znXU8hsOcE4idydZh72BA"}}},"title":"Repository search results"}