Complexity of finding dense subgraphs
Discrete Applied Mathematics
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
DS '99 Proceedings of the Second International Conference on Discovery Science
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximation algorithms for maximum dispersion
Operations Research Letters
| Hi-index | 0.00 |