On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A note on the minimum label spanning tree
Information Processing Letters
Wavelength rerouting in optical networks, or the Venetian routing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On Minimum Diameter Spanning Trees under Reload Costs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Wavelength rerouting in optical networks, or the Venetian Routing problem
Journal of Algorithms
The labeled perfect matching in bipartite graphs
Information Processing Letters
An effective genetic algorithm for the minimum-label spanning tree problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Discrete Applied Mathematics
The labeled maximum matching problem
Computers and Operations Research
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
A mixed integer linear formulation for the minimum label spanning tree problem
Computers and Operations Research
The labeled perfect matching in bipartite graphs
Information Processing Letters
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem
Natural Computing: an international journal
Computers and Operations Research
The parameterized complexity of some minimum label problems
Journal of Computer and System Sciences
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Reliable routings in networks with generalized link failure events
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximating minimum label s-t cut via linear programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Labeled Traveling Salesman Problems: Complexity and approximation
Discrete Optimization
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
Operations Research Letters
Comparison of heuristics for the colourful travelling salesman problem
International Journal of Metaheuristics
| Hi-index | 0.89 |