# Publications

(2021). Graph signatures: Identification and optimization. European Journal of Operational Research.

(2021). A Bayesian framework for functional calibration of expensive computational models through non-isometric matching. IISE Transactions.

(2020). An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS Journal on Computing.

(2020). Detecting a most closeness-central clique in complex networks. European Journal of Operational Research.

(2019). On the chance-constrained minimum spanning $k$-core problem. Journal of Global Optimization.

(2019). SNP variable selection by generalized graph domination. PLoS ONE.

(2018). Finding a maximum $k$-club using the $k$-clique formulation and canonical hypercube cuts. Optimization Letters.

(2018). Correction to: Finding a maximum $k$-club using the $k$-clique formulation and canonical hypercube cuts. Optimization Letters.

(2017). Detecting large risk-averse 2-clubs in graphs with random edge failures. Annals of Operations Research.

(2016). On the 2-club polytope of graphs. Operations Research.

(2016). The minimum spanning $k$-core problem with bounded CVaR under probabilistic edge failures. INFORMS Journal on Computing.

(2014). An exact algorithm for the maximum probabilistic clique problem. Journal of Combinatorial Optimization.

(2014). A branch-and-bound approach for maximum quasi-cliques. Annals of Operations Research.

(2013). Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications.

(2013). Variable objective search. Journal of Heuristics.

(2013). On characterization of maximal independent sets via quadratic optimization. Journal of Heuristics.

(2013). Topology design for on-demand dual-path routing in wireless networks. Optimization Letters.

(2013). Solving chance-constrained spanning $k$-core problem via decomposition and integer programming. Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC 2013).

(2013). Graph theoretic clique relaxations and applications. Handbook of Combinatorial Optimization.

(2013). A specialty steel bar company uses analytics to determine available-to-promise dates. INFORMS Journal on Applied Analytics.

(2012). On inclusionwise maximal and maximum cardinality $k$-clubs in graphs. Discrete Optimization.

(2012). Significant winter weather events and associated socioeconomic impacts (federal aid expenditures) across Oklahoma: 2000-2010. Weather, Climate, and Society.

(2012). Cluster detection in large-scale social networks using $k$-plexes. Proceedings of the 2012 Industrial and Systems Engineering Research Conference (ISERC 2012).

(2011). Gradient-type methods. Wiley Encyclopedia of Operations Research and Management Science.

(2011). Clique relaxations in social network analysis: The maximum $k$-plex problem. Operations Research.

(2010). Approximation algorithms for finding and partitioning unit-disk graphs into co-$k$-plexes. Optimization Letters.

(2009). Optimization problems in unit-disk graphs. Encyclopedia of Optimization.

(2009). Models for clustering commodities into logistical families. Proceedings of the 2009 International Conference on Value Chain Sustainability (ICOVACS 2009).

(2008). Cohesive subgroup model for graph-based text mining. Proceedings of the 2008 IEEE International Conference on Automation Science and Engineering (CASE 2008).

(2008). Network clustering. Analysis of Biological Networks.

(2006). On a polynomial fractional formulation for independence number of a graph. Journal of Global Optimization.

(2006). Graph domination, coloring and cliques in telecommunications. Handbook of Optimization in Telecommunications.

(2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization.

(2005). Constructing test functions for global optimization using continuous formulations of graph problems. Journal of Optimization Methods and Software.

(2001). Minimizing squared deviation of completion times about a common due date - algorithms and heuristics. Proceedings of the Ist International Conference on Logistics and Supply Chain Management.