{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"theoryinpractice.github.io","owner":"TheoryInPractice","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"CSS","color":"#563d7c"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-30T23:43:31.139Z"}},{"type":"Public","name":"hydraprime","owner":"TheoryInPractice","isFork":false,"description":"Twinwidth Solver for 2023 PACE Challenge","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-07T02:58:59.558Z"}},{"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":"overlapping-ecc","owner":"TheoryInPractice","isFork":true,"description":"Code and data for overlapping clustering of hypergraphs with categorical edge labels.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"Julia","color":"#a270ba"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-05-26T18:41:30.651Z"}},{"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":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-04-03T23:28:56.961Z"}},{"type":"Public","name":"ConSequences","owner":"TheoryInPractice","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"F#","color":"#b845fc"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-13T15:42:04.061Z"}},{"type":"Public","name":"sparsedomsets","owner":"TheoryInPractice","isFork":false,"description":"Code repository for KDD22 submission.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-22T16:43:14.317Z"}},{"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":"structural-rounding","owner":"TheoryInPractice","isFork":false,"description":"","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":1,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-06T20:35:24.291Z"}},{"type":"Public","name":"MI-bicliques","owner":"TheoryInPractice","isFork":false,"description":"Algorithms for enumerating maximal induced bicliques. OCT-MIB is designed for graphs which are \"near bipartite\" described in Kloster et al. 2018+; LexMIB is an improved version of the algorithm described in Dias et al. 2005.","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-10-08T23:29:39.610Z"}},{"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":"aqc-virtual-embedding","owner":"TheoryInPractice","isFork":false,"description":"Adiabatic Quantum Computing -- embedding your problems into quantum computers","topicNames":[],"topicsNotShown":0,"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":3,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-10-26T21:19:22.922Z"}},{"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":16,"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"}