Finding independent sets in a graph using continuous multivariable polynomial formulations
Journal of Global Optimization
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
A framework of filtering, clustering and dynamic layout graphs for visualization
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
An effective local search for the maximum clique problem
Information Processing Letters
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
Mining market data: a network approach
Computers and Operations Research
Experimental analysis of approximation algorithms for the vertex cover and set covering problems
Computers and Operations Research
On the structural properties of massive telecom call graphs: findings and implications
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Metaheuristics for optimization problems in computer communications
Computer Communications
A greedy randomized adaptive search procedure for the point-feature cartographic label placement
Computers & Geosciences
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Why organizational networks in reality do not show scale-free distributions
Computational & Mathematical Organization Theory
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Operations Research
An adaptive and composite spatio-temporal data compression approach for wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An improved simulated annealing algorithm for the maximum independent set problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Computational challenges with cliques, quasi-cliques and clique partitions in graphs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
User modeling for telecommunication applications: experiences and practical implications
UMAP'10 Proceedings of the 18th international conference on User Modeling, Adaptation, and Personalization
Bipartite graphs as models of complex networks
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Using critical sets to solve the maximum independent set problem
Operations Research Letters
Implementation and comparison of heuristics for the vertex cover problem on huge graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
A polyhedral study of the maximum edge subgraph problem
Discrete Applied Mathematics
On the maximum quasi-clique problem
Discrete Applied Mathematics
Analyzing Communication Interaction Networks (CINs) in enterprises and inferring hierarchies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational Optimization and Applications
| Hi-index | 0.00 |