| Minimal graphs for 2-factor extension | 0 | 0.34 | 2020 |
| Formulations for designing robust networks. An application to wind power collection. | 0 | 0.34 | 2018 |
| Robust capacitated trees and networks with uniform demands. | 0 | 0.34 | 2018 |
| On the edge capacitated Steiner tree problem | 1 | 0.40 | 2016 |
| Robust optimal sizing of a hybrid energy stand-alone system. | 2 | 0.43 | 2016 |
| 2-stage robust MILP with continuous recourse variables. | 9 | 0.57 | 2014 |
| Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. | 6 | 0.53 | 2013 |
| Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. | 0 | 0.34 | 2011 |
| Minimum d-blockers and d-transversals in graphs | 10 | 0.71 | 2011 |
| Multicuts and integral multiflows in rings | 5 | 0.42 | 2009 |
| Degree-constrained edge partitioning in graphs arising from discrete tomography | 1 | 0.38 | 2009 |
| On the use of graphs in discrete tomography | 8 | 0.65 | 2008 |
| Approximating hv-convex binary matrices and images from discrete projections | 3 | 0.47 | 2008 |
| Complexity results for the horizontal bar packing problem | 1 | 0.38 | 2008 |
| The shortest multipaths problem in a capacitated dense channel | 1 | 0.36 | 2007 |
| Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69] | 0 | 0.34 | 2007 |
| Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs | 4 | 0.42 | 2007 |
| An acyclic days-off scheduling problem | 6 | 0.67 | 2006 |
| Erratum to “A greedy algorithm for multicut and integral multiflow in rooted tress” [Oper. Res. Lett. 31(1) (2003) 21–27] | 0 | 0.34 | 2006 |
| Minimal multicut and maximal integer multiflow: A survey | 54 | 2.27 | 2005 |
| Reconstructing an alternate periodical binary matrix from its orthogonal projections | 1 | 0.38 | 2005 |
| Multiway cut and integer flow problems in trees | 5 | 0.43 | 2004 |
| A greedy algorithm for multicut and integral multiflow in rooted trees | 8 | 0.85 | 2003 |
| Bounds and Heuristics for the Shortest Capacitated Paths Problem | 3 | 0.51 | 2002 |
| Solving The Dynamic Facility Location Problem | 20 | 2.00 | 1996 |
| Persistency in maximum cardinality bipartite matchings | 17 | 1.68 | 1994 |
| Solving the uncapacited plant location problem on trees | 5 | 0.84 | 1994 |
