| Publication | Date of Publication | Type |
|---|
Finding conserved low-diameter subgraphs in social and biological networks
Networks | 2025-01-08 | Paper |
On atomic cliques in temporal graphs
Optimization Letters | 2023-05-04 | Paper |
On Fault-Tolerant Low-Diameter Clusters in Graphs
INFORMS Journal on Computing | 2023-01-11 | Paper |
Graph signatures: identification and optimization
European Journal of Operational Research | 2021-11-09 | Paper |
An ellipsoidal bounding scheme for the quasi-clique number of a graph
INFORMS Journal on Computing | 2021-01-07 | Paper |
Detecting a most closeness-central clique in complex networks
European Journal of Operational Research | 2020-01-23 | Paper |
On the chance-constrained minimum spanning \(k\)-core problem
Journal of Global Optimization | 2019-10-01 | Paper |
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Optimization Letters | 2018-12-18 | Paper |
Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Optimization Letters | 2018-12-18 | Paper |
On characterization of maximal independent sets via quadratic optimization
Journal of Heuristics | 2017-06-27 | Paper |
Detecting large risk-averse 2-clubs in graphs with random edge failures
Annals of Operations Research | 2017-03-07 | Paper |
On the 2-club polytope of graphs
Operations Research | 2017-01-26 | Paper |
The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures
INFORMS Journal on Computing | 2016-08-12 | Paper |
A branch-and-bound approach for maximum quasi-cliques
Annals of Operations Research | 2014-09-26 | Paper |
An exact algorithm for the maximum probabilistic clique problem
Journal of Combinatorial Optimization | 2014-09-05 | Paper |
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Computational Optimization and Applications | 2013-08-26 | Paper |
Topology design for on-demand dual-path routing in wireless networks
Optimization Letters | 2013-04-23 | Paper |
On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
Discrete Optimization | 2012-09-11 | Paper |
Clique relaxations in social network analysis: the maximum \(k\)-plex problem
Operations Research | 2011-07-19 | Paper |
Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
Optimization Letters | 2010-10-04 | Paper |
On a polynomial fractional formulation for independence number of a graph
Journal of Global Optimization | 2007-10-23 | Paper |
| Graph domination, coloring and cliques in telecommunications | 2007-07-23 | Paper |
Constructing test functions for global optimization using continuous formulations of graph problems
Optimization Methods & Software | 2006-01-10 | Paper |
Novel approaches for analyzing biological networks
Journal of Combinatorial Optimization | 2005-12-13 | Paper |
