Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Marina Lipshteyn
@inproceedings{DBLP:conf/nsdi/BaiAAABBBBCCCCE23,
author = {Wei Bai and
Shanim Sainul Abdeen and
Ankit Agrawal and
Krishan Kumar Attre and
Paramvir Bahl and
Ameya Bhagat and
Gowri Bhaskara and
Tanya Brokhman and
Lei Cao and
Ahmad Cheema and
Rebecca Chow and
Jeff Cohen and
Mahmoud Elhaddad and
Vivek Ette and
Igal Figlin and
Daniel Firestone and
Mathew George and
Ilya German and
Lakhmeet Ghai and
Eric Green and
Albert G. Greenberg and
Manish Gupta and
Randy Haagens and
Matthew Hendel and
Ridwan Howlader and
Neetha John and
Julia Johnstone and
Tom Jolly and
Greg Kramer and
David Kruse and
Ankit Kumar and
Erica Lan and
Ivan Lee and
Avi Levy and
Marina Lipshteyn and
Xin Liu and
Chen Liu and
Guohan Lu and
Yuemin Lu and
Xiakun Lu and
Vadim Makhervaks and
Ulad Malashanka and
David A. Maltz and
Ilias Marinos and
Rohan Mehta and
Sharda Murthi and
Anup Namdhari and
Aaron Ogus and
Jitendra Padhye and
Madhav Pandya and
Douglas Phillips and
Adrian Power and
Suraj Puri and
Shachar Raindel and
Jordan Rhee and
Anthony Russo and
Maneesh Sah and
Ali Sheriff and
Chris Sparacino and
Ashutosh Srivastava and
Weixiang Sun and
Nick Swanson and
Fuhou Tian and
Lukasz Tomczyk and
Vamsi Vadlamuri and
Alec Wolman and
Ying Xie and
Joyce Yom and
Lihua Yuan and
Yanzhao Zhang and
Brian Zill},
editor = {Mahesh Balakrishnan and
Manya Ghobadi},
title = {Empowering Azure Storage with {RDMA}},
booktitle = {20th {USENIX} Symposium on Networked Systems Design and Implementation,
{NSDI} 2023, Boston, MA, April 17-19, 2023},
pages = {49--67},
publisher = {{USENIX} Association},
year = {2023},
url = {https://www.usenix.org/conference/nsdi23/presentation/bai},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nsdi/BaiAAABBBBCCCCE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CohenGLS17,
author = {Elad Cohen and
Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Tolerance intersection graphs of degree bounded subtrees of a tree
with constant tolerance 2},
journal = {Discret. Math.},
volume = {340},
number = {2},
pages = {209--222},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.08.015},
doi = {10.1016/J.DISC.2016.08.015},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CohenGLS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/GuoWDSYPL16,
author = {Chuanxiong Guo and
Haitao Wu and
Zhong Deng and
Gaurav Soni and
Jianxi Ye and
Jitu Padhye and
Marina Lipshteyn},
editor = {Marinho P. Barcellos and
Jon Crowcroft and
Amin Vahdat and
Sachin Katti},
title = {{RDMA} over Commodity Ethernet at Scale},
booktitle = {Proceedings of the {ACM} {SIGCOMM} 2016 Conference, Florianopolis,
Brazil, August 22-26, 2016},
pages = {202--215},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2934872.2934908},
doi = {10.1145/2934872.2934908},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/GuoWDSYPL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/ZhuEFGLLPRYZ15,
author = {Yibo Zhu and
Haggai Eran and
Daniel Firestone and
Chuanxiong Guo and
Marina Lipshteyn and
Yehonatan Liron and
Jitendra Padhye and
Shachar Raindel and
Mohamad Haj Yahia and
Ming Zhang},
editor = {Steve Uhlig and
Olaf Maennel and
Brad Karp and
Jitendra Padhye},
title = {Congestion Control for Large-Scale {RDMA} Deployments},
booktitle = {Proceedings of the 2015 {ACM} Conference on Special Interest Group
on Data Communication, {SIGCOMM} 2015, London, United Kingdom, August
17-21, 2015},
pages = {523--536},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2785956.2787484},
doi = {10.1145/2785956.2787484},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/ZhuEFGLLPRYZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GolumbicLS13,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Single bend paths on a grid have strong helly number 4: \emph{errata
atque emendationes ad} "edge intersection graphs of single bend
paths on a grid"},
journal = {Networks},
volume = {62},
number = {2},
pages = {161--163},
year = {2013},
url = {https://doi.org/10.1002/net.21509},
doi = {10.1002/NET.21509},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GolumbicLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/AsinowskiCGLLS12,
author = {Andrei Asinowski and
Elad Cohen and
Martin Charles Golumbic and
Vincent Limouzy and
Marina Lipshteyn and
Michal Stern},
title = {Vertex Intersection Graphs of Paths on a Grid},
journal = {J. Graph Algorithms Appl.},
volume = {16},
number = {2},
pages = {129--150},
year = {2012},
url = {https://doi.org/10.7155/jgaa.00253},
doi = {10.7155/JGAA.00253},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/AsinowskiCGLLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LipshteynMKL11,
author = {Marina Lipshteyn and
Ross M. McConnell and
Haim Kaplan and
Vadim E. Levit},
title = {Foreword},
journal = {Discret. Appl. Math.},
volume = {159},
number = {7},
pages = {497},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.01.007},
doi = {10.1016/J.DAM.2011.01.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LipshteynMKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AsinowskiCGLLS11,
author = {Andrei Asinowski and
Elad Cohen and
Martin Charles Golumbic and
Vincent Limouzy and
Marina Lipshteyn and
Michal Stern},
title = {String graphs of k-bend paths on a grid},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {141--146},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.025},
doi = {10.1016/J.ENDM.2011.05.025},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AsinowskiCGLLS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrandstadtGLL11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
title = {Path-Bicolorable Graphs},
journal = {Graphs Comb.},
volume = {27},
number = {6},
pages = {799--819},
year = {2011},
url = {https://doi.org/10.1007/s00373-010-1007-9},
doi = {10.1007/S00373-010-1007-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrandstadtGLL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CohenGLS10,
author = {Elad Cohen and
Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {On the bi-enhancement of chordal-bipartite probe graphs},
journal = {Inf. Process. Lett.},
volume = {110},
number = {5},
pages = {193--197},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2009.12.003},
doi = {10.1016/J.IPL.2009.12.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/CohenGLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolumbicLS09,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Intersection models of weakly chordal graphs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {2031--2047},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.11.017},
doi = {10.1016/J.DAM.2008.11.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolumbicLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GolumbicLS09,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Edge intersection graphs of single bend paths on a grid},
journal = {Networks},
volume = {54},
number = {3},
pages = {130--138},
year = {2009},
url = {https://doi.org/10.1002/net.20305},
doi = {10.1002/NET.20305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GolumbicLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BrandstadtGLL09,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Van Bang Le and
Marina Lipshteyn},
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Path-Bicolorable Graphs},
booktitle = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
pages = {172--182},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2\_17},
doi = {10.1007/978-3-642-02029-2\_17},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BrandstadtGLL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2009golumbic,
editor = {Marina Lipshteyn and
Vadim E. Levit and
Ross M. McConnell},
title = {Graph Theory, Computational Intelligence and Thought, Essays Dedicated
to Martin Charles Golumbic on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {5420},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02029-2},
doi = {10.1007/978-3-642-02029-2},
isbn = {978-3-642-02028-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2009golumbic.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolumbicLS08,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {The k-edge intersection graphs of paths in a tree},
journal = {Discret. Appl. Math.},
volume = {156},
number = {4},
pages = {451--461},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2006.06.019},
doi = {10.1016/J.DAM.2006.06.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolumbicLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolumbicLS08a,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Equivalences and the complete hierarchy of intersection graphs of
paths in a tree},
journal = {Discret. Appl. Math.},
volume = {156},
number = {17},
pages = {3203--3215},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2008.05.019},
doi = {10.1016/J.DAM.2008.05.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolumbicLS08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GolumbicLS08,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {Representing edge intersection graphs of paths on degree 4 trees},
journal = {Discret. Math.},
volume = {308},
number = {8},
pages = {1381--1387},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.064},
doi = {10.1016/J.DISC.2007.07.064},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GolumbicLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/CohenGLS08,
author = {Elad Cohen and
Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
title = {On the Bi-enhancement of Chordal-bipartite Probe Graphs},
booktitle = {Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization,
gargano, Italy, 13-15 May, 2008},
pages = {152--156},
publisher = {University of Milan},
year = {2008},
timestamp = {Fri, 28 Nov 2008 12:43:29 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/CohenGLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CohenGLS08,
author = {Elad Cohen and
Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {What Is between Chordal and Weakly Chordal Graphs?},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {275--286},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_25},
doi = {10.1007/978-3-540-92248-3\_25},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/CohenGLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BerryGL07,
author = {Anne Berry and
Martin Charles Golumbic and
Marina Lipshteyn},
title = {Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {3},
pages = {573--591},
year = {2007},
url = {https://doi.org/10.1137/050637091},
doi = {10.1137/050637091},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BerryGL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/GolumbicLS07,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
editor = {Johann L. Hurink and
Walter Kern and
Gerhard F. Post and
Georg Still},
title = {Edge intersection graphs of single bend paths on a grid},
booktitle = {Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente, Enschede, The Netherlands, 29-31 May, 2007},
pages = {53--55},
publisher = {University of Twente},
year = {2007},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/GolumbicLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolumbicLS06,
author = {Martin Charles Golumbic and
Marina Lipshteyn and
Michal Stern},
editor = {Fedor V. Fomin},
title = {Finding Intersection Models of Weakly Chordal Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {241--255},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_22},
doi = {10.1007/11917496\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolumbicLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolumbicL04,
author = {Martin Charles Golumbic and
Marina Lipshteyn},
title = {Chordal probe graphs},
journal = {Discret. Appl. Math.},
volume = {143},
number = {1-3},
pages = {221--237},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2003.12.009},
doi = {10.1016/J.DAM.2003.12.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolumbicL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BerryGL04,
author = {Anne Berry and
Martin Charles Golumbic and
Marina Lipshteyn},
editor = {J. Ian Munro},
title = {Two tricks to triangulate chordal probe graphs in polynomial time},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {962--969},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982936},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BerryGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolumbicL03,
author = {Martin Charles Golumbic and
Marina Lipshteyn},
editor = {Hans L. Bodlaender},
title = {Chordal Probe Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {249--260},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_22},
doi = {10.1007/978-3-540-39890-5\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolumbicL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-10-02 00:58 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:
