Minimum feedback vertex set and acyclic coloring
Information Processing Letters
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
New upper bounds on feedback vertex numbers in butterflies
Information Processing Letters
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Feedback vertex sets in mesh-based networks
Theoretical Computer Science
Feedback vertex set on AT-free graphs
Discrete Applied Mathematics
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics
On column generation formulations for the RWA problem
Discrete Applied Mathematics
On the complexity of the regenerator placement problem in optical networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A Tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
INOC'11 Proceedings of the 5th international conference on Network optimization
On the complexity of the regenerator placement problem in optical networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks
Computer Communications
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
Hi-index | 0.00 |