![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Michel J. Mizrahi
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j6]Jinsung Yoon
, Michel J. Mizrahi, Nahid Farhady Ghalaty, Thomas Jarvinen, Ashwin S. Ravi, Peter Brune, Fanyu Kong, Dave Anderson, George Lee, Arie Meir, Farhana Bandukwala, Elli Kanal, Sercan Ö. Arik
, Tomas Pfister:
EHR-Safe: generating high-fidelity and privacy-preserving synthetic electronic health records. npj Digit. Medicine 6 (2023) - 2017
- [j5]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact Algorithms for Minimum Weighted Dominating Induced Matching. Algorithmica 77(3): 642-660 (2017) - 2015
- [j4]Min Chih Lin, Michel J. Mizrahi:
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size. Discret. Appl. Math. 197: 53-58 (2015) - [j3]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. Electron. Notes Discret. Math. 50: 307-312 (2015) - 2014
- [j2]Min Chih Lin
, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Fast algorithms for some dominating induced matching problems. Inf. Process. Lett. 114(10): 524-528 (2014) - [j1]Min Chih Lin, Michel J. Mizrahi:
Domination problems on P5-free graphs. RAIRO Theor. Informatics Appl. 48(5): 541-549 (2014)
Conference and Workshop Papers
- 2014
- [c4]Min Chih Lin
, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
O(n) Time Algorithms for Dominating Induced Matching Problems. LATIN 2014: 399-408 - 2013
- [c3]Min Chih Lin
, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. ISAAC 2013: 558-567 - 2010
- [c2]Esteban Feuerstein, Veronica Gil-Costa
, Michel J. Mizrahi, Mauricio Marín
:
Performance Evaluation of Improved Web Search Algorithms. VECPAR 2010: 236-250 - 2009
- [c1]Esteban Feuerstein, Mauricio Marín
, Michel J. Mizrahi, Veronica Gil-Costa
, Ricardo Baeza-Yates
:
Two-Dimensional Distributed Inverted Files. SPIRE 2009: 206-213
Informal and Other Publications
- 2015
- [i3]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. CoRR abs/1502.01523 (2015) - 2013
- [i2]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact algorithms for dominating induced matchings. CoRR abs/1301.7602 (2013) - [i1]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching. CoRR abs/1303.0035 (2013)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint