Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 2009 | |
---|---|---|

27 | EE | Michal Penn, Maria Polukarov, Moshe Tennenholtz: Asynchronous Congestion Games. Graph Theory, Computational Intelligence and Thought 2009: 41-53 |

26 | EE | Michal Penn, Tal Raviv: An algorithm for the maximum revenue jobshop problem. European Journal of Operational Research 193(2): 437-450 (2009) |

2008 | ||

25 | EE | Michal Penn, Maria Polukarov, Moshe Tennenholtz: Asynchronous congestion games. AAMAS (3) 2008: 1605-1608 |

24 | EE | Hagai Glicksman, Michal Penn: Approximation algorithms for group prize-collecting and location-routing problems. Discrete Applied Mathematics 156(17): 3238-3247 (2008) |

23 | EE | Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discrete Applied Mathematics 156(4): 407-408 (2008) |

22 | EE | Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum: Editorial. Discrete Applied Mathematics 156(4): 410-411 (2008) |

21 | EE | Michal Penn, Tal Raviv: A polynomial time algorithm for solving a quality control station configuration problem. Discrete Applied Mathematics 156(4): 412-419 (2008) |

20 | EE | Asaf Levin, Michal Penn: Approximation algorithm for minimizing total latency in machine scheduling with deliveries. Discrete Optimization 5(1): 97-107 (2008) |

2007 | ||

19 | EE | Michal Penn, Maria Polukarov, Moshe Tennenholtz: Congestion games with load-dependent failures: identical resources. ACM Conference on Electronic Commerce 2007: 210-217 |

18 | EE | Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv: Creating a consensus ranking of proposals from reviewers' partial ordinal rankings. Computers & OR 34(4): 954-965 (2007) |

17 | EE | Michal Penn, Stas Rozenfeld: Approximation algorithm for the group Steiner network problem. Networks 49(2): 160-167 (2007) |

2005 | ||

16 | EE | Michal Penn, Maria Polukarov, Moshe Tennenholtz: Congestion games with failures. ACM Conference on Electronic Commerce 2005: 259-268 |

15 | EE | Michal Penn, Maria Polukarov, Moshe Tennenholtz: Congestion games with failures. Computing and Markets 2005 |

2002 | ||

14 | Opher Dubrovsky, Gregory Levitin, Michal Penn: A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem. J. Heuristics 8(6): 585-599 (2002) | |

2000 | ||

13 | Mordecai Avriel, Michal Penn, Naomi Shpirer: Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics 103(1-3): 271-279 (2000) | |

12 | EE | Michal Penn, Moshe Tennenholtz: Constrained multi-object auctions and b-matching. Inf. Process. Lett. 75(1-2): 29-34 (2000) |

11 | Zeev Nutov, Michal Penn: On Integrality, Stability and Composition of Dicycle Packings and Covers. J. Comb. Optim. 4(2): 235-251 (2000) | |

1998 | ||

10 | EE | Raanan Manor, Michal Penn: An extended planar algorithm for maximum integral two-flow. Networks 32(1): 67-76 (1998) |

1997 | ||

9 | Michal Penn, Haya Shasha-Krupnik: Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems. J. Algorithms 22(1): 187-196 (1997) | |

8 | EE | Zeev Nutov, Michal Penn: Faster approximation algorithms for weighted triconnectivity augmentation problems. Oper. Res. Lett. 21(5): 219-223 (1997) |

1996 | ||

7 | 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) |

6 | EE | Frieda Granot, Michal Penn, Maurice Queyranne: Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996) |

1995 | ||

5 | EE | Zeev Nutov, Michal Penn: on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. Discrete Applied Mathematics 60(1-3): 293-309 (1995) |

4 | EE | Frieda Granot, Michal Penn: On the integral 4-packing of T-cuts. Discrete Mathematics 142(1-3): 65-75 (1995) |

1993 | ||

3 | Frieda Granot, Michal Penn: On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 | |

2 | EE | Ephraim Korach, Michal Penn: A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discrete Applied Mathematics 47(1): 77-83 (1993) |

1992 | ||

1 | Ephraim Korach, Michal Penn: Tight integral duality gap in the Chinese Postman problem. Math. Program. 55: 183-191 (1992) |

1 | Mordecai Avriel | [13] |

2 | Wade D. Cook | [18] |

3 | Opher Dubrovsky | [14] |

4 | Hagai Glicksman | [24] |

5 | Boaz Golany | [18] |

6 | Frieda Granot | [3] [4] [6] [7] |

7 | Irith Ben-Arroyo Hartman | [22] [23] |

8 | Ephraim Korach | [1] [2] |

9 | Asaf Levin | [20] |

10 | Gregory Levitin | [14] |

11 | Raanan Manor | [10] |

12 | Joseph Naor (Seffi Naor) | [22] [23] |

13 | Zeev Nutov | [5] [8] [11] |

14 | Maria Polukarov | [15] [16] [19] [25] [27] |

15 | Maurice Queyranne | [6] |

16 | Tal Raviv | [18] [21] [26] |

17 | Uriel G. Rothblum | [22] [23] |

18 | Stas Rozenfeld | [17] |

19 | Haya Shasha-Krupnik | [9] |

20 | Naomi Shpirer | [13] |

21 | Moshe Tennenholtz | [12] [15] [16] [19] [25] [27] |