Pinned Repositories
algforopt-notebooks
Jupyter notebooks associated with the Algorithms for Optimization textbook
benchmark
graph benchmark
clique-partitioning
Local search algorithm to solve clique parition problem
exactcolors
Automatically exported from code.google.com/p/exactcolors
hungarian-cpp
Automatically exported from code.google.com/p/hungarian-cpp
kplex_degen_gap
The maximum k-plex algorithm parameterized by the degeneracy gap.
ListPlex
A fast maximal k-plex listing algorithm in the WWW22 Paper.
mbbp
Effective algorithms for maximum bipartite biclique problem
relaxclq
A package for finding large clique and relaxed cliques
splex-big
Frequency driven multi-neighborhood tabu search for the maximum s-plex problem
joey001's Repositories
joey001/clique-partitioning
Local search algorithm to solve clique parition problem
joey001/kplex_degen_gap
The maximum k-plex algorithm parameterized by the degeneracy gap.
joey001/ListPlex
A fast maximal k-plex listing algorithm in the WWW22 Paper.
joey001/relaxclq
A package for finding large clique and relaxed cliques
joey001/exactcolors
Automatically exported from code.google.com/p/exactcolors
joey001/mbbp
Effective algorithms for maximum bipartite biclique problem
joey001/splex-big
Frequency driven multi-neighborhood tabu search for the maximum s-plex problem
joey001/algforopt-notebooks
Jupyter notebooks associated with the Algorithms for Optimization textbook
joey001/AlgorithmEngineeringLab
joey001/benchmark
graph benchmark
joey001/clique-problem
A collection of codes for clique problems
joey001/Cohesive_subgraph_book
joey001/hungarian-cpp
Automatically exported from code.google.com/p/hungarian-cpp
joey001/dapcstp
joey001/enu-k-bundle
joey001/faplex
joey001/format
ACM consolidated LaTeX styles
joey001/joey001.github.io
joey001/k-Vertex-Cut-Problem
This repository contains the code used for the computational experiments of: "F. Furini, I. Ljubic, E. Malaguti, P. Paronuzzi: On Integer and Bilevel Formulations for the k-Vertex Cut Problem, Mathematical Programming Computation, to appear 2019"
joey001/max-s-bundle
joey001/MaximumClique
The implementation for maximum clique enumeration algorithm
joey001/mbbp_exact
The exact algorithms for Maximum Balanced Biclique Problem
joey001/mosaic-gen
joey001/Optimization
code for learning Optimization tech
joey001/pbbs
A Copy of the Problem Based Benchmark Suite (http://www.cs.cmu.edu/~pbbs/)
joey001/quasiclq
This algorithm solves maximum quasi-clique