Marina Lipshteyn

25 papers A* 3B 3C 2Misc 1Journal 14Unranked 1

Year	Rank	Type	Title / Venue / Authors
2023	Misc	`conf`	Empowering Azure Storage with RDMA. NSDI 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
2017	J	`jnl`	Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. Discret. Math. Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2016	A*	`conf`	RDMA over Commodity Ethernet at Scale. SIGCOMM Chuanxiong Guo, Haitao Wu, Zhong Deng, Gaurav Soni, Jianxi Ye, Jitu Padhye, Marina Lipshteyn
2015	A*	`conf`	Congestion Control for Large-Scale RDMA Deployments. SIGCOMM Yibo Zhu, Haggai Eran, Daniel Firestone, Chuanxiong Guo, Marina Lipshteyn, Yehonatan Liron, Jitendra Padhye, Shachar Raindel, Mohamad Haj Yahia, Ming Zhang
2013	J	`jnl`	Single bend paths on a grid have strong helly number 4: Networks Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2012	J	`jnl`	Vertex Intersection Graphs of Paths on a Grid. J. Graph Algorithms Appl. Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
2011	J	`jnl`	Foreword. Discret. Appl. Math. Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit
2011	J	`jnl`	Path-Bicolorable Graphs. Graphs Comb. Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2011	J	`jnl`	String graphs of k-bend paths on a grid. Electron. Notes Discret. Math. Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern
2010	J	`jnl`	On the bi-enhancement of chordal-bipartite probe graphs. Inf. Process. Lett. Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009	J	`jnl`	Edge intersection graphs of single bend paths on a grid. Networks Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009	—	`ed.`	Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday Graph Theory, Computational Intelligence and Thought Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell
2009	J	`jnl`	Intersection models of weakly chordal graphs. Discret. Appl. Math. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2009	—	`conf`	Path-Bicolorable Graphs. Graph Theory, Computational Intelligence and Thought Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn
2008	J	`jnl`	Equivalences and the complete hierarchy of intersection graphs of paths in a tree. Discret. Appl. Math. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008	C	`conf`	On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008	J	`jnl`	Representing edge intersection graphs of paths on degree 4 trees. Discret. Math. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008	J	`jnl`	The k-edge intersection graphs of paths in a tree. Discret. Appl. Math. Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2008	B	`conf`	What Is between Chordal and Weakly Chordal Graphs?. WG Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2007	C	`conf`	Edge intersection graphs of single bend paths on a grid. CTW Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2007	J	`jnl`	Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs. SIAM J. Discret. Math. Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
2006	B	`conf`	Finding Intersection Models of Weakly Chordal Graphs. WG Martin Charles Golumbic, Marina Lipshteyn, Michal Stern
2004	J	`jnl`	Chordal probe graphs. Discret. Appl. Math. Martin Charles Golumbic, Marina Lipshteyn
2004	A*	`conf`	Two tricks to triangulate chordal probe graphs in polynomial time. SODA Anne Berry, Martin Charles Golumbic, Marina Lipshteyn
2003	B	`conf`	Chordal Probe Graphs. WG Martin Charles Golumbic, Marina Lipshteyn