Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A review on algorithms for maximum clique problems | European Journal of Operational Research |
| 142 | 2015 |
Critical nodes for distance‐based connectivity and related problems in graphs | Networks |
| 55 | 2015 |
An analytical comparison of the LP relaxations of integer models for the k-club problem | European Journal of Operational Research |
| 10 | 2014 |
On clique relaxation models in network analysis | European Journal of Operational Research |
| 79 | 2013 |
On the maximum quasi-clique problem | Discrete Applied Mathematics |
| 58 | 2013 |
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 the maximum small-world subgraph problem | European Journal of Operational Research |
| 3 | 2020 |
The maximum l-triangle k-club problem: Complexity, properties, and algorithms | Computers & Operations Research |
| 3 | 2019 |
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments | European Journal of Operational Research |
| 4 | 2019 |