Search the dblp DataBase
Michal Penn :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Michal Penn , Maria Polukarov , Moshe Tennenholtz Congestion games with failures. [Citation Graph (0, 0)][DBLP ] Computing and Markets, 2005, pp:- [Conf ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Asynchronous congestion games. [Citation Graph (, )][DBLP ] Asynchronous Congestion Games. [Citation Graph (, )][DBLP ] Taxed congestion games with failures. [Citation Graph (, )][DBLP ] Editorial. [Citation Graph (, )][DBLP ] A polynomial time algorithm for solving a quality control station configuration problem. [Citation Graph (, )][DBLP ] The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. [Citation Graph (, )][DBLP ] Approximation algorithms for group prize-collecting and location-routing problems. [Citation Graph (, )][DBLP ] Search in 0.026secs, Finished in 0.027secs