All Stories

  1. Detecting a most closeness-central clique in complex networks
  2. SNP variable selection by generalized graph domination
  3. On the chance-constrained minimum spanning k-core problem
  4. Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
  5. Approaches for finding cohesive subgroups in large-scale social networks via maximumk-plex detection
  6. On the 2-Club Polytope of Graphs
  7. Detecting large risk-averse 2-clubs in graphs with random edge failures
  8. The Minimum Spanningk-Core Problem with Bounded CVaR Under Probabilistic Edge Failures
  9. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
  10. An exact algorithm for the maximum probabilistic clique problem
  11. A Specialty Steel Bar Company Uses Analytics to Determine Available-to-Promise Dates
  12. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
  13. Graph Theoretic Clique Relaxations and Applications
  14. A branch-and-bound approach for maximum quasi-cliques
  15. Topology design for on-demand dual-path routing in wireless networks
  16. Significant Winter Weather Events and Associated Socioeconomic Impacts (Federal Aid Expenditures) across Oklahoma: 2000–10
  17. Variable objective search
  18. On characterization of maximal independent sets via quadratic optimization
  19. Gradient-Type Methods
  20. Clique Relaxations in Social Network Analysis: The Maximumk-Plex Problem
  21. Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
  22. Cohesive subgroup model for graph-based text mining
  23. On a Polynomial Fractional Formulation for Independence Number of a Graph
  24. Constructing test functions for global optimization using continuous formulations of graph problems
  25. Novel Approaches for Analyzing Biological Networks
  26. Graph Domination, Coloring and Cliques in Telecommunications
  27. Network Clustering