| 2002 |
|---|
| 11 | | Tali Eilam-Tzoreff,
Daniel Granot,
Frieda Granot,
Greys Sosic:
The vehicle routing problem with pickups and deliveries on some special graphs.
Discrete Applied Mathematics 116(3): 193-229 (2002) |
| 2000 |
|---|
| 10 | | Daniel Granot,
Frieda Granot,
W. R. Zhu:
Naturally submodular digraphs and forbidden digraph configurations.
Discrete Applied Mathematics 100(1-2): 67-84 (2000) |
| 1997 |
|---|
| 9 | | Frieda Granot,
Jadranka Skorin-Kapov,
Amir Tamir:
Using Quadratic Programming to Solve High Multiplicity Scheduling Problems on Parallel Machines.
Algorithmica 17(2): 100-110 (1997) |
| 1996 |
|---|
| 8 | EE | Frieda Granot,
Michal Penn:
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.
Discrete Applied Mathematics 70(3): 267-283 (1996) |
| 7 | EE | Frieda Granot,
Michal Penn,
Maurice Queyranne:
Disconnecting sets in single and two-terminal-pair networks.
Networks 27(2): 117-123 (1996) |
| 1995 |
|---|
| 6 | EE | Frieda Granot,
Michal Penn:
On the integral 4-packing of T-cuts.
Discrete Mathematics 142(1-3): 65-75 (1995) |
| 1994 |
|---|
| 5 | EE | Antoine Gautier,
Frieda Granot:
on the Equivalence of Constrained and Unconstrained Flows.
Discrete Applied Mathematics 55(2): 113-132 (1994) |
| 1993 |
|---|
| 4 | | Frieda Granot,
Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs.
IPCO 1993: 235-249 |
| 3 | EE | Frieda Granot,
Jadranka Skorin-Kapov:
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem.
Discrete Applied Mathematics 41(2): 139-146 (1993) |
| 1990 |
|---|
| 2 | | Frieda Granot,
Jadranka Skorin-Kapov:
Towards a Strongly Polynomial Algorithm for Strictly Convex Quadratic Programs: An Extension of Tardos' Algorithm.
Math. Program. 46: 225-236 (1990) |
| 1 | | Frieda Granot,
Jadranka Skorin-Kapov:
Some Proximity and Sensitivity Results in Quadratic Integer Programming.
Math. Program. 47: 259-268 (1990) |
