Edge-disjoint odd cycles in planar graphs
Journal of Combinatorial Theory Series B
Deterministic pivoting algorithms for constrained ranking and clustering problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Maximum Subgraphs without Short Cycles
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Approximating Maximum Subgraphs without Short Cycles
SIAM Journal on Discrete Mathematics
A stability theorem on fractional covering of triangles by edges
European Journal of Combinatorics
Kernelization for cycle transversal problems
Discrete Applied Mathematics
Packing and covering tetrahedra
Discrete Applied Mathematics
Hi-index | 0.05 |