I see that this package is no longer maintained and has therefore been removed from CRAN.
Would you be interested in contributing an implementation of your algorithm to the igraph C library? This way it would eventually be included in igraph's R interface, and it could be maintained in the long term. The documentation would refer to your papers on the topic.
Note that the code needs a bit of refactoring to meet igraph's requirements: It needs error handling, interruptibility, better documentation, and needs to be at least partially adapted to use igraph's standard data types (e.g. for 64-bit support). These are not too difficult. It needs to be adapted to work with igraph's native graph data structure, or we need to convert the graph to the data structure this package uses. This is also not too hard. Finally, the recursion depth needs to be limited (if it is not already), or recursion needs to be eliminated, which is probably not easy. However, as the author of the code, you are in the best position to be able to do it.
Additionally to this, we'd need unit tests, ideally by comparing the results produced by this code to do those produced by a (less efficient) transformation of the biclique problem to a standard clique problem.
We, the igraph developers, do not have the capacity to carry out this work at the moment, but we would welcome your contribution, if you are interested. Let me know.
I see that this package is no longer maintained and has therefore been removed from CRAN.
Would you be interested in contributing an implementation of your algorithm to the igraph C library? This way it would eventually be included in igraph's R interface, and it could be maintained in the long term. The documentation would refer to your papers on the topic.
Note that the code needs a bit of refactoring to meet igraph's requirements: It needs error handling, interruptibility, better documentation, and needs to be at least partially adapted to use igraph's standard data types (e.g. for 64-bit support). These are not too difficult. It needs to be adapted to work with igraph's native graph data structure, or we need to convert the graph to the data structure this package uses. This is also not too hard. Finally, the recursion depth needs to be limited (if it is not already), or recursion needs to be eliminated, which is probably not easy. However, as the author of the code, you are in the best position to be able to do it.
Additionally to this, we'd need unit tests, ideally by comparing the results produced by this code to do those produced by a (less efficient) transformation of the biclique problem to a standard clique problem.
We, the igraph developers, do not have the capacity to carry out this work at the moment, but we would welcome your contribution, if you are interested. Let me know.