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)
A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
Information Processing Letters
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 max quasi-independent set problem
Journal of Combinatorial Optimization
The max quasi-independent set problem
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
| Hi-index | 0.04 |