文章名稱引用次數

• On ve-degree and ev-degree of graphs10
• Global optimization of multilevel electricity market models including network design and graph partitioning4
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem4
• Robust combinatorial optimization with knapsack uncertainty4
• The quadratic minimum spanning tree problem and its variations3
• Two-level lot-sizing with inventory bounds3
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs3
• The vertex k-cut problem3
• Total dominating sequences in trees, split graphs, and under modular decomposition3
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty3