The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |