Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
On provably best construction heuristics for hard combinatorial optimization problems | Networks |
| 6 | 2016 |
On the 2-Club Polytope of Graphs | Operations Research |
| 9 | 2016 |
On clique relaxation models in network analysis | European Journal of Operational Research |
| 79 | 2013 |
Algorithms for the maximum k-club problem in graphs | Journal of Combinatorial Optimization |
| 15 | 2013 |
Identifying large robust network clusters via new compact formulations of maximum k-club problems | European Journal of Operational Research |
| 48 | 2012 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
The Parameterized Complexity of s-Club with Triangle and Seed Constraints | Theory of Computing Systems |
| 2023 | |
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs | European Journal of Operational Research |
| 2 | 2022 |
On Fault-Tolerant Low-Diameter Clusters in Graphs | INFORMS Journal on Computing |
| 1 | 2022 |
Finding influential groups in networked systems: The most degree-central clique problem | Omega |
| 11 | 2021 |
On the maximum small-world subgraph problem | European Journal of Operational Research |
| 3 | 2020 |