default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarina Lipshteyn
Person information
- affiliation: Caesarea Rothschild Institute, University of Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Wei Bai, Shanim Sainul Abdeen, Ankit Agrawal, Krishan Kumar Attre, Paramvir Bahl, Ameya Bhagat, Gowri Bhaskara, Tanya Brokhman, Lei Cao, Ahmad Cheema, Rebecca Chow, Jeff Cohen, Mahmoud Elhaddad, Vivek Ette, Igal Figlin, Daniel Firestone, Mathew George, Ilya German, Lakhmeet Ghai, Eric Green, Albert G. Greenberg, Manish Gupta, Randy Haagens, Matthew Hendel, Ridwan Howlader, Neetha John, Julia Johnstone, Tom Jolly, Greg Kramer, David Kruse, Ankit Kumar, Erica Lan, Ivan Lee, Avi Levy, Marina Lipshteyn, Xin Liu, Chen Liu, Guohan Lu, Yuemin Lu, Xiakun Lu, Vadim Makhervaks, Ulad Malashanka, David A. Maltz, Ilias Marinos, Rohan Mehta, Sharda Murthi, Anup Namdhari, Aaron Ogus, Jitendra Padhye, Madhav Pandya, Douglas Phillips, Adrian Power, Suraj Puri, Shachar Raindel, Jordan Rhee, Anthony Russo, Maneesh Sah, Ali Sheriff, Chris Sparacino, Ashutosh Srivastava, Weixiang Sun, Nick Swanson, Fuhou Tian, Lukasz Tomczyk, Vamsi Vadlamuri, Alec Wolman, Ying Xie, Joyce Yom, Lihua Yuan, Yanzhao Zhang, Brian Zill:
Empowering Azure Storage with RDMA. NSDI 2023: 49-67
2010 – 2019
- 2017
- [j14]Elad Cohen
, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. Discret. Math. 340(2): 209-222 (2017) - 2016
- [c9]Chuanxiong Guo, Haitao Wu, Zhong Deng, Gaurav Soni, Jianxi Ye, Jitu Padhye, Marina Lipshteyn:
RDMA over Commodity Ethernet at Scale. SIGCOMM 2016: 202-215 - 2015
- [c8]Yibo Zhu, Haggai Eran, Daniel Firestone, Chuanxiong Guo, Marina Lipshteyn, Yehonatan Liron, Jitendra Padhye, Shachar Raindel, Mohamad Haj Yahia, Ming Zhang:
Congestion Control for Large-Scale RDMA Deployments. SIGCOMM 2015: 523-536 - 2013
- [j13]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid". Networks 62(2): 161-163 (2013) - 2012
- [j12]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. 16(2): 129-150 (2012) - 2011
- [j11]Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit:
Foreword. Discret. Appl. Math. 159(7): 497 (2011) - [j10]Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern:
String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. 37: 141-146 (2011) - [j9]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graphs Comb. 27(6): 799-819 (2011) - 2010
- [j8]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. 110(5): 193-197 (2010)
2000 – 2009
- 2009
- [j7]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Intersection models of weakly chordal graphs. Discret. Appl. Math. 157(9): 2031-2047 (2009) - [j6]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. Networks 54(3): 130-138 (2009) - [c7]Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn:
Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought 2009: 172-182 - [e1]Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell:
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5420, Springer 2009, ISBN 978-3-642-02028-5 [contents] - 2008
- [j5]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. 156(4): 451-461 (2008) - [j4]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discret. Appl. Math. 156(17): 3203-3215 (2008) - [j3]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. 308(8): 1381-1387 (2008) - [c6]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156 - [c5]Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
What Is between Chordal and Weakly Chordal Graphs?. WG 2008: 275-286 - 2007
- [j2]Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. 21(3): 573-591 (2007) - [c4]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55 - 2006
- [c3]Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255 - 2004
- [j1]Martin Charles Golumbic, Marina Lipshteyn:
Chordal probe graphs. Discret. Appl. Math. 143(1-3): 221-237 (2004) - [c2]Anne Berry, Martin Charles Golumbic, Marina Lipshteyn:
Two tricks to triangulate chordal probe graphs in polynomial time. SODA 2004: 962-969 - 2003
- [c1]Martin Charles Golumbic, Marina Lipshteyn:
Chordal Probe Graphs. WG 2003: 249-260
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 2025-01-20 22:58 CET 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:
