- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j16 |      | Daniel Granot, Frieda Granot: On graphs which can or cannot induce Chinese Postman games with a non-empty core. Discrete Applied Mathematics 160(13-14): 2054-2059 (2012) |
| j15 | | Frieda Granot, S. Thomas McCormick, Maurice Queyranne, Fabio Tardella: Structural and algorithmic properties for parametric minimum cuts. Math. Program. 135(1-2): 337-367 (2012) |
| 2010 | ||
| j14 | | Daniel Granot, Frieda Granot, Tal Raviv: On competitive sequential location in a network with a decreasing demand intensity. European Journal of Operational Research 205(2): 301-312 (2010) |
| 2002 | ||
| j13 | | 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 | ||
| j12 | | Daniel Granot, Frieda Granot, Weiping R. Zhu: Naturally submodular digraphs and forbidden digraph configurations. Discrete Applied Mathematics 100(1-2): 67-84 (2000) |
| 1998 | ||
| j11 | | Daniel Granot, Frieda Granot, Weiping R. Zhu: Characterization sets for the nucleolus. Int. J. Game Theory 27(3): 359-374 (1998) |
| 1997 | ||
| j10 | | 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) |
| j9 | | Daniel Granot, Frieda Granot, Weiping R. Zhu: The reactive bargaining set of some flow games and of superadditive simple games. Int. J. Game Theory 26(2): 207-214 (1997) |
| 1996 | ||
| j8 | | 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) |
| j7 | | Frieda Granot, Michal Penn, Maurice Queyranne: Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996) |
| 1995 | ||
| j6 | | Frieda Granot, Michal Penn: On the integral 4-packing of T-cuts. Discrete Mathematics 142(1-3): 65-75 (1995) |
| 1994 | ||
| j5 | | Antoine Gautier, Frieda Granot: on the Equivalence of Constrained and Unconstrained Flows. Discrete Applied Mathematics 55(2): 113-132 (1994) |
| j4 | | Antoine Gautier, Frieda Granot: Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems. Networks 24(5): 285-296 (1994) |
| 1993 | ||
| j3 | | Frieda Granot, Jadranka Skorin-Kapov: On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. Discrete Applied Mathematics 41(2): 139-146 (1993) |
| c1 |  | Frieda Granot, Michal Penn: On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 |
| 1990 | ||
| j2 | | 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) |
| j1 | | Frieda Granot, Jadranka Skorin-Kapov: Some Proximity and Sensitivity Results in Quadratic Integer Programming. Math. Program. 47: 259-268 (1990) |
| 1 | Tali Eilam-Tzoreff | |
| 2 | Antoine Gautier | |
| 3 | Daniel Granot | |
| 4 | S. Thomas McCormick | |
| 5 | Michal Penn | |
| 6 | Maurice Queyranne | |
| 7 | Tal Raviv | |
| 8 | Jadranka Skorin-Kapov | |
| 9 | Greys Sosic | |
| 10 | Amir Tamir | |
| 11 | Fabio Tardella | |
| 12 | Weiping R. Zhu |
Colors in the list of coauthors
Last update Thu May 23 16:19:21 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page