The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michal Penn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michal Penn, Maria Polukarov, Moshe Tennenholtz
    Congestion games with failures. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  2. 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]
  3. Michal Penn, Maria Polukarov, Moshe Tennenholtz
    Congestion games with failures. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:259-268 [Conf]
  4. Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv
    Creating a consensus ranking of proposals from reviewers' partial ordinal rankings. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:954-965 [Journal]
  5. Mordecai Avriel, Michal Penn, Naomi Shpirer
    Container ship stowage problem: complexity and connection to the coloring of circle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:271-279 [Journal]
  6. 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]
  7. Ephraim Korach, Michal Penn
    A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:1, pp:77-83 [Journal]
  8. Zeev Nutov, Michal Penn
    on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:293-309 [Journal]
  9. Opher Dubrovsky, Gregory Levitin, Michal Penn
    A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:6, pp:585-599 [Journal]
  10. Michal Penn, Moshe Tennenholtz
    Constrained multi-object auctions and b-matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:29-34 [Journal]
  11. Michal Penn, Haya Shasha-Krupnik
    Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:187-196 [Journal]
  12. Zeev Nutov, Michal Penn
    On Integrality, Stability and Composition of Dicycle Packings and Covers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:2, pp:235-251 [Journal]
  13. Ephraim Korach, Michal Penn
    Tight integral duality gap in the Chinese Postman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:183-191 [Journal]
  14. 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]
  15. Raanan Manor, Michal Penn
    An extended planar algorithm for maximum integral two-flow. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:1, pp:67-76 [Journal]
  16. Zeev Nutov, Michal Penn
    Faster approximation algorithms for weighted triconnectivity augmentation problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:5, pp:219-223 [Journal]
  17. Michal Penn, Maria Polukarov, Moshe Tennenholtz
    Congestion games with load-dependent failures: identical resources. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:210-217 [Conf]
  18. 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]

  19. Asynchronous congestion games. [Citation Graph (, )][DBLP]


  20. Asynchronous Congestion Games. [Citation Graph (, )][DBLP]


  21. Taxed congestion games with failures. [Citation Graph (, )][DBLP]


  22. Editorial. [Citation Graph (, )][DBLP]


  23. A polynomial time algorithm for solving a quality control station configuration problem. [Citation Graph (, )][DBLP]


  24. The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. [Citation Graph (, )][DBLP]


  25. Approximation algorithms for group prize-collecting and location-routing problems. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002