Author of the publication

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.

, , , and . AAAI, page 12453-12460. AAAI Press, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Swap-vertex based neighborhood for Steiner tree problems., and . Math. Program. Comput., 9 (2): 297-320 (2017)A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem., and . CoRR, (2014)Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem., , , and . Expert Syst. Appl., (2020)Intensification-driven local search for the traveling repairman problem with profits., , , and . Expert Syst. Appl., (2022)Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints., and . INFORMS J. Comput., 27 (2): 221-237 (2015)Breakout local search for the Steiner tree problem with revenue, budget and hop constraints., and . Eur. J. Oper. Res., 232 (1): 209-220 (2014)TSingNet: Scale-aware and context-rich feature learning for traffic sign detection and recognition in the wild., , , , and . Neurocomputing, (2021)Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping., , , and . Eur. J. Oper. Res., 289 (3): 1067-1086 (2021)A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem., , , and . ICCS (2), volume 10861 of Lecture Notes in Computer Science, page 553-560. Springer, (2018)Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search., , , and . ICNSC, page 1-6. IEEE, (2021)