Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Ran Libeskind-Hadas
@article{DBLP:journals/bmcbi/LiuGFHJMMSSWLB23, author = {Nuo Liu and Tonatiuh A. Gonzalez and Jacob Fischer and Chan Hong and Michelle Johnson and Ross Mawhorter and Fabrizia Mugnatto and Rachael Soh and Shifa Somji and Joseph S. Wirth and Ran Libeskind{-}Hadas and Eliot C. Bush}, title = {xenoGI 3: using the {DTLOR} model to reconstruct the evolution of gene families in clades of microbes}, journal = {{BMC} Bioinform.}, volume = {24}, number = {1}, pages = {295}, year = {2023}, url = {https://doi.org/10.1186/s12859-023-05410-0}, doi = {10.1186/S12859-023-05410-0}, timestamp = {Sat, 05 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/LiuGFHJMMSSWLB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/LeMayLW22, author = {Matthew LeMay and Ran Libeskind{-}Hadas and Yi{-}Chieh Wu}, title = {A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {19}, number = {5}, pages = {2642--2653}, year = {2022}, url = {https://doi.org/10.1109/TCBB.2021.3105922}, doi = {10.1109/TCBB.2021.3105922}, timestamp = {Thu, 27 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/LeMayLW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isbra/LiuDSL22, author = {Jingyi Liu and I. Duan and Santi Santichaivekin and Ran Libeskind{-}Hadas}, editor = {Mukul S. Bansal and Zhipeng Cai and Serghei Mangul}, title = {Distance Profiles of Optimal {RNA} Foldings}, booktitle = {Bioinformatics Research and Applications - 18th International Symposium, {ISBRA} 2022, Haifa, Israel, November 14-17, 2022, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {13760}, pages = {315--329}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-23198-8\_29}, doi = {10.1007/978-3-031-23198-8\_29}, timestamp = {Mon, 09 Jan 2023 17:58:33 +0100}, biburl = {https://dblp.org/rec/conf/isbra/LiuDSL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bioinformatics/SantichaivekinY21, author = {Santi Santichaivekin and Qing Yang and Jingyi Liu and Ross Mawhorter and Justin Jiang and Trenton Wesley and Yi{-}Chieh Wu and Ran Libeskind{-}Hadas}, title = {eMPRess: a systematic cophylogeny reconciliation tool}, journal = {Bioinform.}, volume = {37}, number = {16}, pages = {2481--2482}, year = {2021}, url = {https://doi.org/10.1093/bioinformatics/btaa978}, doi = {10.1093/BIOINFORMATICS/BTAA978}, timestamp = {Wed, 16 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bioinformatics/SantichaivekinY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/LiuMLSBL21, author = {Jingyi Liu and Ross Mawhorter and Nuo Liu and Santi Santichaivekin and Eliot C. Bush and Ran Libeskind{-}Hadas}, title = {Maximum parsimony reconciliation in the {DTLOR} model}, journal = {{BMC} Bioinform.}, volume = {22}, number = {10}, pages = {394}, year = {2021}, url = {https://doi.org/10.1186/s12859-021-04290-6}, doi = {10.1186/S12859-021-04290-6}, timestamp = {Mon, 09 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/LiuMLSBL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/GrueterDRL21, author = {Melissa Grueter and Kalani Duran and Ramya Ramalingam and Ran Libeskind{-}Hadas}, title = {Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {18}, number = {6}, pages = {2136--2143}, year = {2021}, url = {https://doi.org/10.1109/TCBB.2019.2942015}, doi = {10.1109/TCBB.2019.2942015}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/GrueterDRL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/DuOKMLGTLW21, author = {Haoxing Du and Yi Sheng Ong and Marina Knittel and Ross Mawhorter and Nuo Liu and Gianluca Gross and Reiko Tojo and Ran Libeskind{-}Hadas and Yi{-}Chieh Wu}, title = {Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {18}, number = {6}, pages = {2144--2156}, year = {2021}, url = {https://doi.org/10.1109/TCBB.2019.2922337}, doi = {10.1109/TCBB.2019.2922337}, timestamp = {Thu, 27 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/DuOKMLGTLW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/DoddsMPCCZBL21, author = {Zachary Dodds and Malia Morgan and Lindsay Popowski and Henry Coxe and Caroline Coxe and Kewei Zhou and Eliot C. Bush and Ran Libeskind{-}Hadas}, editor = {Mark Sherriff and Laurence D. Merkle and Pamela A. Cutter and Alvaro E. Monge and Judithe Sheard}, title = {A Biology-based {CS1:} Results and Reflections, Ten Years In}, booktitle = {{SIGCSE} '21: The 52nd {ACM} Technical Symposium on Computer Science Education, Virtual Event, USA, March 13-20, 2021}, pages = {796--801}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3408877.3432469}, doi = {10.1145/3408877.3432469}, timestamp = {Fri, 06 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigcse/DoddsMPCCZBL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wabi/LeMayWL21, author = {Matthew LeMay and Yi{-}Chieh Wu and Ran Libeskind{-}Hadas}, editor = {Alessandra Carbone and Mohammed El{-}Kebir}, title = {The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard}, booktitle = {21st International Workshop on Algorithms in Bioinformatics, {WABI} 2021, August 2-4, 2021, Virtual Conference}, series = {LIPIcs}, volume = {201}, pages = {1:1--1:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.WABI.2021.1}, doi = {10.4230/LIPICS.WABI.2021.1}, timestamp = {Thu, 22 Jul 2021 15:39:38 +0200}, biburl = {https://dblp.org/rec/conf/wabi/LeMayWL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/SloanBBGLW20, author = {Robert H. Sloan and Valerie Barr and Heather Bort and Mark Guzdial and Ran Libeskind{-}Hadas and Richard Warner}, editor = {Jian Zhang and Mark Sherriff and Sarah Heckman and Pamela A. Cutter and Alvaro E. Monge}, title = {{CS} + {X} Meets {CS} 1: Strongly Themed Intro Courses}, booktitle = {Proceedings of the 51st {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2020, Portland, OR, USA, March 11-14, 2020}, pages = {960--961}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3328778.3366975}, doi = {10.1145/3328778.3366975}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigcse/SloanBBGLW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2007-03704, author = {Rajeev Alur and Richard G. Baraniuk and Rastislav Bod{\'{\i}}k and Ann W. Drobnis and Sumit Gulwani and Bjoern Hartmann and Yasmin B. Kafai and Jeff Karpicke and Ran Libeskind{-}Hadas and Debra J. Richardson and Armando Solar{-}Lezama and Candace Thille and Moshe Y. Vardi}, title = {Computer-Aided Personalized Education}, journal = {CoRR}, volume = {abs/2007.03704}, year = {2020}, url = {https://arxiv.org/abs/2007.03704}, eprinttype = {arXiv}, eprint = {2007.03704}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2007-03704.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/MawhorterL19, author = {Ross Mawhorter and Ran Libeskind{-}Hadas}, title = {Hierarchical clustering of maximum parsimony reconciliations}, journal = {{BMC} Bioinform.}, volume = {20}, number = {1}, pages = {612:1--612:12}, year = {2019}, url = {https://doi.org/10.1186/s12859-019-3223-5}, doi = {10.1186/S12859-019-3223-5}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/MawhorterL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/SantichaivekinM19, author = {Santi Santichaivekin and Ross Mawhorter and Ran Libeskind{-}Hadas}, title = {An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model}, journal = {{BMC} Bioinform.}, volume = {20-S}, number = {20}, pages = {636}, year = {2019}, url = {https://doi.org/10.1186/s12859-019-3203-9}, doi = {10.1186/S12859-019-3203-9}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/SantichaivekinM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/MawhorterLLW19, author = {Ross Mawhorter and Nuo Liu and Ran Libeskind{-}Hadas and Yi{-}Chieh Wu}, title = {Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model}, journal = {{BMC} Bioinform.}, volume = {20-S}, number = {20}, pages = {639}, year = {2019}, url = {https://doi.org/10.1186/s12859-019-3206-6}, doi = {10.1186/S12859-019-3206-6}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/MawhorterLLW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/HaackZRWL19, author = {Jordan Haack and Eli Zupke and Andrew Ramirez and Yi{-}Chieh Wu and Ran Libeskind{-}Hadas}, title = {Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {16}, number = {1}, pages = {14--22}, year = {2019}, url = {https://doi.org/10.1109/TCBB.2018.2849732}, doi = {10.1109/TCBB.2018.2849732}, timestamp = {Mon, 03 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/HaackZRWL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcbb/MaSFSSSL18, author = {Weiyun Ma and Dmitriy Smirnov and Juliet Forman and A. Schweickart and C. Slocum and S. Srinivasan and Ran Libeskind{-}Hadas}, title = {DTL-RnB: Algorithms and Tools for Summarizing the Space of {DTL} Reconciliations}, journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.}, volume = {15}, number = {2}, pages = {411--421}, year = {2018}, url = {https://doi.org/10.1109/TCBB.2016.2537319}, doi = {10.1109/TCBB.2016.2537319}, timestamp = {Sun, 06 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcbb/MaSFSSSL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alcob/ChengDPQWLW18, author = {Ricson Cheng and Matthew Dohlen and Chen Pekker and Gabriel Quiroz and Jincheng Wang and Ran Libeskind{-}Hadas and Yi{-}Chieh Wu}, editor = {Jesper Jansson and Carlos Mart{\'{\i}}n{-}Vide and Miguel A. Vega{-}Rodr{\'{\i}}guez}, title = {Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model}, booktitle = {Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Hong Kong, China, June 25-26, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10849}, pages = {11--23}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-91938-6\_2}, doi = {10.1007/978-3-319-91938-6\_2}, timestamp = {Tue, 17 May 2022 11:54:28 +0200}, biburl = {https://dblp.org/rec/conf/alcob/ChengDPQWLW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/almob/BorkCWSL17, author = {Daniel Bork and Ricson Cheng and Jincheng Wang and Jean Sung and Ran Libeskind{-}Hadas}, title = {On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model}, journal = {Algorithms Mol. Biol.}, volume = {12}, number = {1}, pages = {6:1--6:12}, year = {2017}, url = {https://doi.org/10.1186/s13015-017-0098-8}, doi = {10.1186/S13015-017-0098-8}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/almob/BorkCWSL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bmcbi/MaSL17, author = {Weiyun Ma and Dmitriy Smirnov and Ran Libeskind{-}Hadas}, title = {{DTL} reconciliation repair}, journal = {{BMC} Bioinform.}, volume = {18}, number = {{S-3}}, pages = {13--21}, year = {2017}, url = {https://doi.org/10.1186/s12859-017-1463-9}, doi = {10.1186/S12859-017-1463-9}, timestamp = {Sun, 06 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bmcbi/MaSL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alcob/OzdemirSBCHSWL17, author = {Alex Ozdemir and Michael Sheely and Daniel Bork and Ricson Cheng and Reyna Hulett and Jean Sung and Jincheng Wang and Ran Libeskind{-}Hadas}, editor = {Daniel Figueiredo and Carlos Mart{\'{\i}}n{-}Vide and Diogo Pratas and Miguel A. Vega{-}Rodr{\'{\i}}guez}, title = {Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model}, booktitle = {Algorithms for Computational Biology - 4th International Conference, AlCoB 2017, Aveiro, Portugal, June 5-6, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10252}, pages = {127--139}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-58163-7\_9}, doi = {10.1007/978-3-319-58163-7\_9}, timestamp = {Fri, 14 Oct 2022 12:20:24 +0200}, biburl = {https://dblp.org/rec/conf/alcob/OzdemirSBCHSWL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/HambruschLA15, author = {Susanne E. Hambrusch and Ran Libeskind{-}Hadas and Eric Aaron}, title = {Understanding the {U.S.} domestic computer science Ph.D. pipeline}, journal = {Commun. {ACM}}, volume = {58}, number = {8}, pages = {29--32}, year = {2015}, url = {https://doi.org/10.1145/2790854}, doi = {10.1145/2790854}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cacm/HambruschLA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/computer/HambruschL15, author = {Susanne E. Hambrusch and Ran Libeskind{-}Hadas}, title = {The PhD Pipeline}, journal = {Computer}, volume = {48}, number = {5}, pages = {76--79}, year = {2015}, url = {https://doi.org/10.1109/MC.2015.147}, doi = {10.1109/MC.2015.147}, timestamp = {Wed, 12 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/computer/HambruschL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cscw/AmatoLM15, author = {Nancy M. Amato and Ran Libeskind{-}Hadas and Panagiotis Takis Metaxas}, editor = {Dan Cosley and Andrea Forte and Luigina Ciolfi and David McDonald}, title = {{CRA-E} Panel on Undergraduate Research}, booktitle = {18th {ACM} Conference on Computer Supported Cooperative Work {\&} Social Computing, {CSCW} 2015, Vancouver, BC, Canada, March 14-18, 2015, Companion Volume}, pages = {113--115}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2685553.2699340}, doi = {10.1145/2685553.2699340}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cscw/AmatoLM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bioinformatics/Libeskind-HadasWBK14, author = {Ran Libeskind{-}Hadas and Yi{-}Chieh Wu and Mukul S. Bansal and Manolis Kellis}, title = {Pareto-optimal phylogenetic tree reconciliation}, journal = {Bioinform.}, volume = {30}, number = {12}, pages = {87--95}, year = {2014}, url = {https://doi.org/10.1093/bioinformatics/btu289}, doi = {10.1093/BIOINFORMATICS/BTU289}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bioinformatics/Libeskind-HadasWBK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bib/Libeskind-HadasB13, author = {Ran Libeskind{-}Hadas and Eliot C. Bush}, title = {A first course in computing with applications to biology}, journal = {Briefings Bioinform.}, volume = {14}, number = {5}, pages = {610--617}, year = {2013}, url = {https://doi.org/10.1093/bib/bbt005}, doi = {10.1093/BIB/BBT005}, timestamp = {Fri, 06 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/bib/Libeskind-HadasB13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/Libeskind-Hadas13, author = {Ran Libeskind{-}Hadas}, editor = {Tracy Camp and Paul T. Tymann and J. D. Dougherty and Kris Nagel}, title = {A derivation-first approach to teaching algorithms}, booktitle = {The 44th {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2013, Denver, CO, USA, March 6-9, 2013}, pages = {573--578}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2445196.2445366}, doi = {10.1145/2445196.2445366}, timestamp = {Tue, 23 Mar 2021 10:54:19 +0100}, biburl = {https://dblp.org/rec/conf/sigcse/Libeskind-Hadas13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/DanylukALPR13, author = {Andrea Danyluk and Nancy M. Amato and Ran Libeskind{-}Hadas and Lori L. Pollock and Susan H. Rodger}, editor = {Tracy Camp and Paul T. Tymann and J. D. Dougherty and Kris Nagel}, title = {Making the most of undergraduate research (abstract only)}, booktitle = {The 44th {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2013, Denver, CO, USA, March 6-9, 2013}, pages = {758}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2445196.2445502}, doi = {10.1145/2445196.2445502}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sigcse/DanylukALPR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/inroads/AlvaradoDL12, author = {Christine Alvarado and Zachary Dodds and Ran Libeskind{-}Hadas}, title = {Increasing women's participation in computing at Harvey Mudd College}, journal = {Inroads}, volume = {3}, number = {4}, pages = {55--64}, year = {2012}, url = {https://doi.org/10.1145/2381083.2381100}, doi = {10.1145/2381083.2381100}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/inroads/AlvaradoDL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/DoddsLB12, author = {Zachary Dodds and Ran Libeskind{-}Hadas and Eliot C. Bush}, editor = {Tami Lapidot and Judith Gal{-}Ezer and Michael E. Caspersen and Orit Hazzan}, title = {Bio1 as {CS1:} evaluating a crossdisciplinary {CS} context}, booktitle = {Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE '12, Haifa, Israel, July 3-5, 2012}, pages = {268--272}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2325296.2325360}, doi = {10.1145/2325296.2325360}, timestamp = {Fri, 06 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/DoddsLB12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcb/OvadiaFCL11, author = {Yaniv Ovadia and Daniel Fielder and Chris Conow and Ran Libeskind{-}Hadas}, title = {The Cophylogeny Reconstruction Problem Is NP-Complete}, journal = {J. Comput. Biol.}, volume = {18}, number = {1}, pages = {59--65}, year = {2011}, url = {https://doi.org/10.1089/cmb.2009.0240}, doi = {10.1089/CMB.2009.0240}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcb/OvadiaFCL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/almob/ConowFOL10, author = {Chris Conow and Daniel Fielder and Yaniv Ovadia and Ran Libeskind{-}Hadas}, title = {Jane: a new tool for the cophylogeny reconstruction problem}, journal = {Algorithms Mol. Biol.}, volume = {5}, pages = {16}, year = {2010}, url = {https://doi.org/10.1186/1748-7188-5-16}, doi = {10.1186/1748-7188-5-16}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/almob/ConowFOL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/DoddsLB10, author = {Zachary Dodds and Ran Libeskind{-}Hadas and Eliot C. Bush}, editor = {Reyyan Ayfer and John Impagliazzo and Cary Laxer}, title = {When {CS} 1 is biology 1: crossdisciplinary collaboration as {CS} context}, booktitle = {Proceedings of the 15th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2010, Bilkent, Ankara, Turkey, June 26-30, 2010}, pages = {219--223}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1822090.1822152}, doi = {10.1145/1822090.1822152}, timestamp = {Fri, 06 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/DoddsLB10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcb/Libeskind-HadasC09, author = {Ran Libeskind{-}Hadas and Michael A. Charleston}, title = {On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem}, journal = {J. Comput. Biol.}, volume = {16}, number = {1}, pages = {105--117}, year = {2009}, url = {https://doi.org/10.1089/cmb.2008.0084}, doi = {10.1089/CMB.2008.0084}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcb/Libeskind-HadasC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icc/CorcoranFNSWL09, author = {Kevin Corcoran and Seth R. Flaxman and Mark Neyer and Peter Scherpelz and Craig Weidert and Ran Libeskind{-}Hadas}, title = {Approximation Algorithms for Traffic Grooming in {WDM} Rings}, booktitle = {Proceedings of {IEEE} International Conference on Communications, {ICC} 2009, Dresden, Germany, 14-18 June 2009}, pages = {1--6}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/ICC.2009.5198761}, doi = {10.1109/ICC.2009.5198761}, timestamp = {Mon, 13 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icc/CorcoranFNSWL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ton/BensonBML08, author = {Karyn Benson and Benjamin E. Birnbaum and Esteban Molina{-}Estolano and Ran Libeskind{-}Hadas}, title = {Competitive analysis of online traffic grooming in {WDM} rings}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {16}, number = {4}, pages = {984--997}, year = {2008}, url = {http://doi.acm.org/10.1145/1453698.1453717}, doi = {10.1145/1453698.1453717}, timestamp = {Sun, 20 Sep 2009 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ton/BensonBML08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/DoddsLAK08, author = {Zachary Dodds and Ran Libeskind{-}Hadas and Christine Alvarado and Geoff Kuenning}, editor = {J. D. Dougherty and Susan H. Rodger and Sue Fitzgerald and Mark Guzdial}, title = {Evaluating a breadth-first cs 1 for scientists}, booktitle = {Proceedings of the 39th {SIGCSE} Technical Symposium on Computer Science Education, {SIGCSE} 2008, Portland, OR, USA, March 12-15, 2008}, pages = {266--270}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1352135.1352229}, doi = {10.1145/1352135.1352229}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigcse/DoddsLAK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/DoddsAKL07, author = {Zachary Dodds and Christine Alvarado and Geoff Kuenning and Ran Libeskind{-}Hadas}, editor = {Janet M. Hughes and D. Ramanee Peiris and Paul T. Tymann}, title = {Breadth-first {CS} 1 for scientists}, booktitle = {Proceedings of the 12th Annual {SIGCSE} Conference on Innovation and Technology in Computer Science Education, ITiCSE 2007, Dundee, Scotland, UK, June 25-27, 2007}, pages = {23--27}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1268784.1268794}, doi = {10.1145/1268784.1268794}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/DoddsAKL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ton/FerrelMML06, author = {Ian Ferrel and Adrian Mettler and Edward Miller and Ran Libeskind{-}Hadas}, title = {Virtual topologies for multicasting with multiple originators in {WDM} networks}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {14}, number = {1}, pages = {183--190}, year = {2006}, url = {http://doi.acm.org/10.1145/1133553.1133568}, doi = {10.1145/1133553.1133568}, timestamp = {Tue, 22 Aug 2006 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ton/FerrelMML06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icc/BuchfuhrerCTCL05, author = {David Buchfuhrer and Timothy Carnes and Brian Tagiku and Laura Celis and Ran Libeskind{-}Hadas}, title = {Traffic grooming for single-source multicast communication in {WDM} rings}, booktitle = {Proceedings of {IEEE} International Conference on Communications, {ICC} 2005, Seoul, Korea, 16-20 May 2005}, pages = {1613--1619}, publisher = {{IEEE}}, year = {2005}, url = {https://doi.org/10.1109/ICC.2005.1494616}, doi = {10.1109/ICC.2005.1494616}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/icc/BuchfuhrerCTCL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsac/MillerLBCDTH04, author = {Edward Miller and Ran Libeskind{-}Hadas and D. Barnard and W. Chang and Kurt M. Dresner and W. M. Turner and Jeffrey R. K. Hartline}, title = {On the complexity of virtual topology design for multicasting in {WDM} trees with tap-and-continue and multicast-capable switches}, journal = {{IEEE} J. Sel. Areas Commun.}, volume = {22}, number = {9}, pages = {1601--1612}, year = {2004}, url = {https://doi.org/10.1109/JSAC.2004.833853}, doi = {10.1109/JSAC.2004.833853}, timestamp = {Thu, 02 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsac/MillerLBCDTH04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ton/HartlineLDDR04, author = {Jeffrey R. K. Hartline and Ran Libeskind{-}Hadas and Kurt M. Dresner and Ethan W. Drucker and Katrina J. Ray}, title = {Optimal virtual topologies for one-to-many communication in {WDM} paths and rings}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {12}, number = {2}, pages = {375--383}, year = {2004}, url = {https://doi.org/10.1109/TNET.2004.826283}, doi = {10.1109/TNET.2004.826283}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ton/HartlineLDDR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamrev/HartlineL03, author = {Jeffrey R. K. Hartline and Ran Libeskind{-}Hadas}, title = {The Computational Complexity of Motion Planning}, journal = {{SIAM} Rev.}, volume = {45}, number = {3}, pages = {543--557}, year = {2003}, url = {https://doi.org/10.1137/S003614450139517}, doi = {10.1137/S003614450139517}, timestamp = {Tue, 29 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamrev/HartlineL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ton/Libeskind-HadasM02, author = {Ran Libeskind{-}Hadas and Rami G. Melhem}, title = {Multicast routing and wavelength assignment in multihop optical networks}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {10}, number = {5}, pages = {621--629}, year = {2002}, url = {https://doi.org/10.1109/TNET.2002.803907}, doi = {10.1109/TNET.2002.803907}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ton/Libeskind-HadasM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icccn/Libeskind-HadasHDDR02, author = {Ran Libeskind{-}Hadas and Jeffrey R. K. Hartline and Kurt M. Dresner and Ethan W. Drucker and Katrina J. Ray}, editor = {Ronald P. Luijten and W. Eric Wong and Kia Makki and E. K. Park}, title = {Multicast virtual topologies in {WDM} paths and rings with splitting loss}, booktitle = {Proceedings of the 11th International Conference on Computer Communications and Networks, {ICCCN} 2002, 14-16 October, 2002, Hyatt Regency Miami, Miami, Florida, {USA}}, pages = {318--321}, publisher = {{IEEE}}, year = {2002}, url = {https://doi.org/10.1109/ICCCN.2002.1043085}, doi = {10.1109/ICCCN.2002.1043085}, timestamp = {Wed, 16 Dec 2020 15:36:44 +0100}, biburl = {https://dblp.org/rec/conf/icccn/Libeskind-HadasHDDR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jpdc/Libeskind-HadasHBRS01, author = {Ran Libeskind{-}Hadas and Jeffrey R. K. Hartline and Peter Boothe and Greg Rae and Jascha Swisher}, title = {On Multicast Algorithms for Heterogeneous Networks of Workstations}, journal = {J. Parallel Distributed Comput.}, volume = {61}, number = {11}, pages = {1665--1679}, year = {2001}, url = {https://doi.org/10.1006/jpdc.2001.1759}, doi = {10.1006/JPDC.2001.1759}, timestamp = {Tue, 30 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jpdc/Libeskind-HadasHBRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icn/Libeskind-HadasM01, author = {Ran Libeskind{-}Hadas and Rami G. Melhem}, editor = {Pascal Lorenz}, title = {Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks}, booktitle = {Networking - {ICN} 2001, First International Conference, Colmar, France, July 9-13, 2001 Proceedings, Part 1}, series = {Lecture Notes in Computer Science}, volume = {2093}, pages = {508--519}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-47728-4\_50}, doi = {10.1007/3-540-47728-4\_50}, timestamp = {Tue, 21 Mar 2023 21:02:31 +0100}, biburl = {https://dblp.org/rec/conf/icn/Libeskind-HadasM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icccn/Libeskind-Hadas00, author = {Ran Libeskind{-}Hadas}, editor = {Ton Engbersen and E. K. Park}, title = {Efficient collective communication in {WDM} networks with a power budget}, booktitle = {Proceedings Ninth International Conference on Computer Communications and Networks, {ICCCN} 2000, 16-18 October 2000, Las Vegas, Nevada, {USA}}, pages = {612--616}, publisher = {{IEEE}}, year = {2000}, url = {https://doi.org/10.1109/ICCCN.2000.885552}, doi = {10.1109/ICCCN.2000.885552}, timestamp = {Wed, 16 Oct 2019 14:14:49 +0200}, biburl = {https://dblp.org/rec/conf/icccn/Libeskind-Hadas00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icppw/Libeskind-HadasH00, author = {Ran Libeskind{-}Hadas and Jeffrey R. K. Hartline}, title = {Efficient Multicast in Heterogeneous Networks of Workstations}, booktitle = {Proceedings of the 2000 International Workshop on Parallel Processing, {ICPPW} 2000, Toronto, Canada, August 21-24, 2000}, pages = {403--410}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/ICPPW.2000.869145}, doi = {10.1109/ICPPW.2000.869145}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icppw/Libeskind-HadasH00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BardenLDW99, author = {Benjamin Barden and Ran Libeskind{-}Hadas and Janet Davis and William Williams}, title = {On Edge-Disjoint Spanning Trees in Hypercubes}, journal = {Inf. Process. Lett.}, volume = {70}, number = {1}, pages = {13--16}, year = {1999}, url = {https://doi.org/10.1016/S0020-0190(99)00033-2}, doi = {10.1016/S0020-0190(99)00033-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BardenLDW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tc/Libeskind-Hadas98, author = {Ran Libeskind{-}Hadas}, title = {A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing}, journal = {{IEEE} Trans. Computers}, volume = {47}, number = {10}, pages = {1158--1160}, year = {1998}, url = {https://doi.org/10.1109/12.729799}, doi = {10.1109/12.729799}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tc/Libeskind-Hadas98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipps/Libeskind-HadasMR98, author = {Ran Libeskind{-}Hadas and Dominic Mazzoni and Ranjith Rajagopalan}, title = {Tree-Based Multicasting in Wormhole-Routed Irregular Topologies}, booktitle = {12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing {(IPPS/SPDP} '98), March 30 - April 3, 1998, Orlando, Florida, USA, Proceedings}, pages = {244--249}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/IPPS.1998.669919}, doi = {10.1109/IPPS.1998.669919}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipps/Libeskind-HadasMR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipps/Libeskind-HadasMR98a, author = {Ran Libeskind{-}Hadas and Dominic Mazzoni and Ranjith Rajagopalan}, title = {Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations}, booktitle = {12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing {(IPPS/SPDP} '98), March 30 - April 3, 1998, Orlando, Florida, USA, Proceedings}, pages = {358--364}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/IPPS.1998.669940}, doi = {10.1109/IPPS.1998.669940}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipps/Libeskind-HadasMR98a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hpca/Libeskind-HadasWH96, author = {Ran Libeskind{-}Hadas and Kevin Watkins and Thomas Hehre}, title = {Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels}, booktitle = {Proceedings of the Second International Symposium on High-Performance Computer Architecture, San Jose, CA, USA, February 3-7, 1996}, pages = {180--190}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/HPCA.1996.501184}, doi = {10.1109/HPCA.1996.501184}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/hpca/Libeskind-HadasWH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fgcs/Libeskind-HadasB95, author = {Ran Libeskind{-}Hadas and Eli Brandt}, title = {Origin-based fault-tolerant routing in the mesh}, journal = {Future Gener. Comput. Syst.}, volume = {11}, number = {6}, pages = {603--615}, year = {1995}, url = {https://doi.org/10.1016/0167-739X(95)00027-P}, doi = {10.1016/0167-739X(95)00027-P}, timestamp = {Wed, 19 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/fgcs/Libeskind-HadasB95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tpds/Libeskind-HadasSML95, author = {Ran Libeskind{-}Hadas and Nimish Shrivastava and Rami G. Melhem and C. L. Liu}, title = {Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays}, journal = {{IEEE} Trans. Parallel Distributed Syst.}, volume = {6}, number = {5}, pages = {498--511}, year = {1995}, url = {https://doi.org/10.1109/71.382318}, doi = {10.1109/71.382318}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tpds/Libeskind-HadasSML95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hpca/Libeskind-HadasB95, author = {Ran Libeskind{-}Hadas and Eli Brandt}, title = {Origin-Based Fault-Tolerant routing in the Mesh}, booktitle = {Proceedings of the 1st {IEEE} Symposium on High-Performance Computer Architecture {(HPCA} 1995), Raleigh, North Carolina, USA, January 22-25, 1995}, pages = {102--111}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/HPCA.1995.386551}, doi = {10.1109/HPCA.1995.386551}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/hpca/Libeskind-HadasB95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/us/LibeskindHadas93, author = {Ran Libeskind{-}Hadas}, title = {Reconfiguration of Fault-Tolerant {VLSI} Systems}, school = {University of Illinois Urbana-Champaign, {USA}}, year = {1993}, url = {https://hdl.handle.net/2142/72094}, timestamp = {Thu, 07 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/us/LibeskindHadas93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/McKinleyHLL91, author = {Philip K. McKinley and Nany Hasan and Ran Libeskind{-}Hadas and C. L. Liu}, title = {Disjoint Covers in Replicated Heterogeneous Arrays}, journal = {{SIAM} J. Discret. Math.}, volume = {4}, number = {2}, pages = {281--292}, year = {1991}, url = {https://doi.org/10.1137/0404026}, doi = {10.1137/0404026}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/McKinleyHLL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dac/Libeskind-HadasL89, author = {Ran Libeskind{-}Hadas and C. L. Liu}, editor = {Donald E. Thomas}, title = {Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks}, booktitle = {Proceedings of the 26th {ACM/IEEE} Design Automation Conference, Las Vegas, Nevada, USA, June 25-29, 1989}, pages = {400--405}, publisher = {{ACM} Press}, year = {1989}, url = {https://doi.org/10.1145/74382.74449}, doi = {10.1145/74382.74449}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/dac/Libeskind-HadasL89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.