Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Improving graph partitions using submodular functions
Discrete Applied Mathematics - Submodularity
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Dynamical Systems for Discovering Protein Complexes and Functional Modules from Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms (TALG)
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Linear-time enumeration of isolated cliques
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The max quasi-independent set problem
Journal of Combinatorial Optimization
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Improved approximation algorithms for maximum graph partitioning problems extended abstract
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The max quasi-independent set problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The k-allocation problem and its variants
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A polyhedral study of the maximum edge subgraph problem
Discrete Applied Mathematics
Don't be SCAREd: use SCalable Automatic REpairing with maximal likelihood and bounded changes
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Piggybacking on social networks
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |