{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"practical-oct","owner":"TheoryInPractice","isFork":false,"description":"Suite of pre-processing routines, heuristic solvers, and harnesses for comparing algorithms for Odd Cycle Transversal (graph bipartization).","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":5,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-07-10T14:15:21.359Z"}},{"type":"Public","name":"DeCAF","owner":"TheoryInPractice","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-03T23:28:56.961Z"}},{"type":"Public","name":"mandoline","owner":"TheoryInPractice","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-03-27T21:39:57.362Z"}},{"type":"Public","name":"cricca","owner":"TheoryInPractice","isFork":false,"description":"Edge-Weighted Clique Decompositions for CoExpression Modules","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-07-31T20:53:37.640Z"}},{"type":"Public","name":"CONCUSS","owner":"TheoryInPractice","isFork":false,"description":"Combatting Network Complexity Using Structural Sparsity","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":1,"issueCount":4,"starsCount":8,"forksCount":5,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-10-28T22:46:24.780Z"}},{"type":"Public","name":"BEAVr","owner":"TheoryInPractice","isFork":false,"description":"Bounded Expansion Algorithm Visualizer","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-29T19:46:18.112Z"}},{"type":"Public","name":"toboggan","owner":"TheoryInPractice","isFork":false,"description":"A practical fpt algorithm for Flow Decomposition and transcript assembly","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-29T19:43:30.094Z"}},{"type":"Public","name":"spiderdonuts","owner":"TheoryInPractice","isFork":false,"description":"Code for generating deceptive graphs and checking whether graphs are deceptive","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-04-18T13:38:22.345Z"}}],"repositoryCount":8,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"mirror","text":"Mirrors"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}