Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Polyhedral results for the bipartite induced subgraph problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
Discrete Applied Mathematics
Theoretical Computer Science
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Solving VLSI design and DNA sequencing problems using bipartization of graphs
Computational Optimization and Applications
The maximum k-colorable subgraph problem and orbitopes
Discrete Optimization
| Hi-index | 0.00 |