default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Penn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j31]Michal Penn, Tal Raviv
:
Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. J. Sched. 24(1): 83-102 (2021)
2010 – 2019
- 2019
- [j30]Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman:
Cyclic-routing of Unmanned Aerial Vehicles. J. Comput. Syst. Sci. 103: 18-45 (2019) - 2016
- [c7]Nir Drucker, Michal Penn, Ofer Strichman:
Cyclic Routing of Unmanned Aerial Vehicles. CPAIOR 2016: 125-141 - 2012
- [j29]Boaz Golany, Moshe Kress, Michal Penn, Uriel G. Rothblum:
Network Optimization Models for Resource Allocation in Developing Military Countermeasures. Oper. Res. 60(1): 48-63 (2012) - 2011
- [j28]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with failures. Discret. Appl. Math. 159(15): 1508-1525 (2011) - [c6]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking:
Considerate Equilibrium. IJCAI 2011: 234-239 - 2010
- [i2]Martin Hoefer, Michal Penn, Maria Polukarov, Alexander Skopalik, Berthold Vöcking:
Considerate Equilibrium. CoRR abs/1012.1547 (2010)
2000 – 2009
- 2009
- [j27]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Taxed congestion games with failures. Ann. Math. Artif. Intell. 56(2): 133-151 (2009) - [j26]Michal Penn, Tal Raviv:
An algorithm for the maximum revenue jobshop problem. Eur. J. Oper. Res. 193(2): 437-450 (2009) - [j25]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with load-dependent failures: Identical resources. Games Econ. Behav. 67(1): 156-173 (2009) - [j24]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Random Order Congestion Games. Math. Oper. Res. 34(3): 706-725 (2009) - [c5]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Asynchronous Congestion Games. Graph Theory, Computational Intelligence and Thought 2009: 41-53 - 2008
- [j23]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156(4): 407-408 (2008) - [j22]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial. Discret. Appl. Math. 156(4): 410-411 (2008) - [j21]Michal Penn, Tal Raviv:
A polynomial time algorithm for solving a quality control station configuration problem. Discret. Appl. Math. 156(4): 412-419 (2008) - [j20]Hagai Glicksman, Michal Penn:
Approximation algorithms for group prize-collecting and location-routing problems. Discret. Appl. Math. 156(17): 3238-3247 (2008) - [j19]Asaf Levin, Michal Penn:
Approximation algorithm for minimizing total latency in machine scheduling with deliveries. Discret. Optim. 5(1): 97-107 (2008) - [c4]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Asynchronous congestion games. AAMAS (3) 2008: 1605-1608 - 2007
- [j18]Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv:
Creating a consensus ranking of proposals from reviewers' partial ordinal rankings. Comput. Oper. Res. 34(4): 954-965 (2007) - [j17]Michal Penn, Stas Rozenfeld:
Approximation algorithm for the group Steiner network problem. Networks 49(2): 160-167 (2007) - [c3]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with load-dependent failures: identical resources. EC 2007: 210-217 - 2005
- [j16]Wade D. Cook, Boaz Golany, Moshe Kress, Michal Penn, Tal Raviv:
Optimal Allocation of Proposals to Reviewers to Facilitate Effective Ranking. Manag. Sci. 51(4): 655-661 (2005) - [c2]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with failures. EC 2005: 259-268 - [i1]Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Congestion games with failures. Computing and Markets 2005 - 2002
- [j15]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
- [j14]Mordecai Avriel, Michal Penn, Naomi Shpirer:
Container ship stowage problem: complexity and connection to the coloring of circle graphs. Discret. Appl. Math. 103(1-3): 271-279 (2000) - [j13]Michal Penn, Moshe Tennenholtz:
Constrained multi-object auctions and b-matching. Inf. Process. Lett. 75(1-2): 29-34 (2000) - [j12]Zeev Nutov, Michal Penn:
On Integrality, Stability and Composition of Dicycle Packings and Covers. J. Comb. Optim. 4(2): 235-251 (2000)
1990 – 1999
- 1998
- [j11]Mordecai Avriel, Michal Penn, Naomi Shpirer, Smadar Witteboon:
Stowage planning for container ships to reduce the number of shifts. Ann. Oper. Res. 76: 55-71 (1998) - [j10]Raanan Manor, Michal Penn:
An extended planar algorithm for maximum integral two-flow. Networks 32(1): 67-76 (1998) - 1997
- [j9]Michal Penn, Haya Shasha-Krupnik:
Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems. J. Algorithms 22(1): 187-196 (1997) - [j8]Zeev Nutov, Michal Penn:
Faster approximation algorithms for weighted triconnectivity augmentation problems. Oper. Res. Lett. 21(5): 219-223 (1997) - 1996
- [j7]Frieda Granot, Michal Penn:
Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs. Discret. Appl. Math. 70(3): 267-283 (1996) - [j6]Frieda Granot, Michal Penn, Maurice Queyranne:
Disconnecting sets in single and two-terminal-pair networks. Networks 27(2): 117-123 (1996) - 1995
- [j5]Zeev Nutov, Michal Penn:
on the Integral Dicycle Packings and Covers and the Linear ordering Polytope. Discret. Appl. Math. 60(1-3): 293-309 (1995) - [j4]Frieda Granot, Michal Penn:
On the integral 4-packing of T-cuts. Discret. Math. 142(1-3): 65-75 (1995) - 1993
- [j3]Ephraim Korach, Michal Penn:
A Fast Algorithm for Maximum Integral Two-Commodity Flow in Planar Graphs. Discret. Appl. Math. 47(1): 77-83 (1993) - [c1]Frieda Granot, Michal Penn:
On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. IPCO 1993: 235-249 - 1992
- [j2]Ephraim Korach, Michal Penn:
Tight integral duality gap in the Chinese Postman problem. Math. Program. 55: 183-191 (1992) - [j1]Frieda Granot, Michal Penn:
On the integral plane two-commodity flow problem. Oper. Res. Lett. 11(3): 135-139 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
