Ran Libeskind-Hadas

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 21

Top Topics

Maximum Parsimony

Hierarchical Clustering

Computer Science

Top Venues

IEEE ACM Trans. Comput. Biol. Bioinform.

Publications

Ran Libeskind-Hadas
Pairwise Distances and the Problem of Multiple Optima. J. Comput. Biol. 31 (7) (2024)
Nuo Liu, Tonatiuh A. Gonzalez, Jacob Fischer, Chan Hong, Michelle Johnson, Ross Mawhorter, Fabrizia Mugnatto, Rachael Soh, Shifa Somji, Joseph S. Wirth, Ran Libeskind-Hadas, Eliot C. Bush
xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes. BMC Bioinform. 24 (1) (2023)
Jingyi Liu, I. Duan, Santi Santichaivekin, Ran Libeskind-Hadas
Distance Profiles of Optimal RNA Foldings. ISBRA (2022)
Matthew LeMay, Ran Libeskind-Hadas, Yi-Chieh Wu
A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 19 (5) (2022)
Santi Santichaivekin, Qing Yang, Jingyi Liu, Ross Mawhorter, Justin Jiang, Trenton Wesley, Yi-Chieh Wu, Ran Libeskind-Hadas
eMPRess: a systematic cophylogeny reconciliation tool. Bioinform. 37 (16) (2021)
Haoxing Du, Yi Sheng Ong, Marina Knittel, Ross Mawhorter, Nuo Liu, Gianluca Gross, Reiko Tojo, Ran Libeskind-Hadas, Yi-Chieh Wu
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (6) (2021)
Zachary Dodds, Malia Morgan, Lindsay Popowski, Henry Coxe, Caroline Coxe, Kewei Zhou, Eliot C. Bush, Ran Libeskind-Hadas
A Biology-based CS1: Results and Reflections, Ten Years In. SIGCSE (2021)
Jingyi Liu, Ross Mawhorter, Nuo Liu, Santi Santichaivekin, Eliot C. Bush, Ran Libeskind-Hadas
Maximum parsimony reconciliation in the DTLOR model. BMC Bioinform. 22 (10) (2021)
Melissa Grueter, Kalani Duran, Ramya Ramalingam, Ran Libeskind-Hadas
Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (6) (2021)
Matthew LeMay, Yi-Chieh Wu, Ran Libeskind-Hadas
The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. WABI (2021)
Rajeev Alur, Richard G. Baraniuk, Rastislav Bodík, Ann W. Drobnis, Sumit Gulwani, Bjoern Hartmann, Yasmin B. Kafai, Jeff Karpicke, Ran Libeskind-Hadas, Debra J. Richardson, Armando Solar-Lezama, Candace Thille, Moshe Y. Vardi
Computer-Aided Personalized Education. CoRR (2020)
Robert H. Sloan, Valerie Barr, Heather Bort, Mark Guzdial, Ran Libeskind-Hadas, Richard Warner
CS + X Meets CS 1: Strongly Themed Intro Courses. SIGCSE (2020)
Santi Santichaivekin, Ross Mawhorter, Ran Libeskind-Hadas
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. BMC Bioinform. (20) (2019)
Ross Mawhorter, Nuo Liu, Ran Libeskind-Hadas, Yi-Chieh Wu
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model. BMC Bioinform. (20) (2019)
Ross Mawhorter, Ran Libeskind-Hadas
Hierarchical clustering of maximum parsimony reconciliations. BMC Bioinform. 20 (1) (2019)
Jordan Haack, Eli Zupke, Andrew Ramirez, Yi-Chieh Wu, Ran Libeskind-Hadas
Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. IEEE ACM Trans. Comput. Biol. Bioinform. 16 (1) (2019)
Ricson Cheng, Matthew Dohlen, Chen Pekker, Gabriel Quiroz, Jincheng Wang, Ran Libeskind-Hadas, Yi-Chieh Wu
Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model. AlCoB (2018)
Weiyun Ma, Dmitriy Smirnov, Juliet Forman, A. Schweickart, C. Slocum, S. Srinivasan, Ran Libeskind-Hadas
DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (2) (2018)
Alex Ozdemir, Michael Sheely, Daniel Bork, Ricson Cheng, Reyna Hulett, Jean Sung, Jincheng Wang, Ran Libeskind-Hadas
Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. AlCoB (2017)
Weiyun Ma, Dmitriy Smirnov, Ran Libeskind-Hadas
DTL reconciliation repair. BMC Bioinform. 18 (S-3) (2017)
Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, Ran Libeskind-Hadas
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithms Mol. Biol. 12 (1) (2017)
Nancy M. Amato, Ran Libeskind-Hadas, Panagiotis Takis Metaxas
CRA-E Panel on Undergraduate Research. CSCW Companion (2015)
Susanne E. Hambrusch, Ran Libeskind-Hadas
The PhD Pipeline. Computer 48 (5) (2015)
Susanne E. Hambrusch, Ran Libeskind-Hadas, Eric Aaron
Understanding the U.S. domestic computer science Ph.D. pipeline. Commun. ACM 58 (8) (2015)
Ran Libeskind-Hadas, Yi-Chieh Wu, Mukul S. Bansal, Manolis Kellis
Pareto-optimal phylogenetic tree reconciliation. Bioinform. 30 (12) (2014)
Ran Libeskind-Hadas, Eliot C. Bush
A first course in computing with applications to biology. Briefings Bioinform. 14 (5) (2013)
Ran Libeskind-Hadas
A derivation-first approach to teaching algorithms. SIGCSE (2013)
Andrea Danyluk, Nancy M. Amato, Ran Libeskind-Hadas, Lori L. Pollock, Susan H. Rodger
Making the most of undergraduate research (abstract only). SIGCSE (2013)
Christine Alvarado, Zachary Dodds, Ran Libeskind-Hadas
Increasing women's participation in computing at Harvey Mudd College. Inroads 3 (4) (2012)
Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush
Bio1 as CS1: evaluating a crossdisciplinary CS context. ITiCSE (2012)
Yaniv Ovadia, Daniel Fielder, Chris Conow, Ran Libeskind-Hadas
The Cophylogeny Reconstruction Problem Is NP-Complete. J. Comput. Biol. 18 (1) (2011)
Zachary Dodds, Ran Libeskind-Hadas, Eliot C. Bush
When CS 1 is biology 1: crossdisciplinary collaboration as CS context. ITiCSE (2010)
Chris Conow, Daniel Fielder, Yaniv Ovadia, Ran Libeskind-Hadas
Jane: a new tool for the cophylogeny reconstruction problem. Algorithms Mol. Biol. 5 (2010)
Kevin Corcoran, Seth R. Flaxman, Mark Neyer, Peter Scherpelz, Craig Weidert, Ran Libeskind-Hadas
Approximation Algorithms for Traffic Grooming in WDM Rings. ICC (2009)
Ran Libeskind-Hadas, Michael A. Charleston
On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem. J. Comput. Biol. 16 (1) (2009)
Karyn Benson, Benjamin E. Birnbaum, Esteban Molina-Estolano, Ran Libeskind-Hadas
Competitive analysis of online traffic grooming in WDM rings. IEEE/ACM Trans. Netw. 16 (4) (2008)
Zachary Dodds, Ran Libeskind-Hadas, Christine Alvarado, Geoff Kuenning
Evaluating a breadth-first cs 1 for scientists. SIGCSE (2008)
Zachary Dodds, Christine Alvarado, Geoff Kuenning, Ran Libeskind-Hadas
Breadth-first CS 1 for scientists. ITiCSE (2007)
Ian Ferrel, Adrian Mettler, Edward Miller, Ran Libeskind-Hadas
Virtual topologies for multicasting with multiple originators in WDM networks. IEEE/ACM Trans. Netw. 14 (1) (2006)
David Buchfuhrer, Timothy Carnes, Brian Tagiku, Laura Celis, Ran Libeskind-Hadas
Traffic grooming for single-source multicast communication in WDM rings. ICC (2005)
Edward Miller, Ran Libeskind-Hadas, D. Barnard, W. Chang, Kurt M. Dresner, W. M. Turner, Jeffrey R. K. Hartline
On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches. IEEE J. Sel. Areas Commun. 22 (9) (2004)
Jeffrey R. K. Hartline, Ran Libeskind-Hadas, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray
Optimal virtual topologies for one-to-many communication in WDM paths and rings. IEEE/ACM Trans. Netw. 12 (2) (2004)
Jeffrey R. K. Hartline, Ran Libeskind-Hadas
The Computational Complexity of Motion Planning. SIAM Rev. 45 (3) (2003)
Ran Libeskind-Hadas, Rami G. Melhem
Multicast routing and wavelength assignment in multihop optical networks. IEEE/ACM Trans. Netw. 10 (5) (2002)
Ran Libeskind-Hadas, Jeffrey R. K. Hartline, Kurt M. Dresner, Ethan W. Drucker, Katrina J. Ray
Multicast virtual topologies in WDM paths and rings with splitting loss. ICCCN (2002)
Ran Libeskind-Hadas, Jeffrey R. K. Hartline, P. Boothe, G. Rae, J. Swisher
On Multicast Algorithms for Heterogeneous Networks of Workstations. J. Parallel Distributed Comput. 61 (11) (2001)
Ran Libeskind-Hadas, Rami G. Melhem
Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks. ICN (1) (2001)
Ran Libeskind-Hadas
Efficient collective communication in WDM networks with a power budget. ICCCN (2000)
Ran Libeskind-Hadas, Jeffrey R. K. Hartline
Efficient Multicast in Heterogeneous Networks of Workstations. ICPP Workshops (2000)
Benjamin Barden, Ran Libeskind-Hadas, Janet Davis, William Williams
On Edge-Disjoint Spanning Trees in Hypercubes. Inf. Process. Lett. 70 (1) (1999)
Ran Libeskind-Hadas
A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. IEEE Trans. Computers 47 (10) (1998)
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies. IPPS/SPDP (1998)
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations. IPPS/SPDP (1998)
Ran Libeskind-Hadas, Kevin Watkins, Thomas Hehre
Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels. HPCA (1996)
Ran Libeskind-Hadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays. IEEE Trans. Parallel Distributed Syst. 6 (5) (1995)
Ran Libeskind-Hadas, Eli Brandt
Origin-Based Fault-Tolerant routing in the Mesh. HPCA (1995)
Ran Libeskind-Hadas, Eli Brandt
Origin-based fault-tolerant routing in the mesh. Future Gener. Comput. Syst. 11 (6) (1995)
Philip K. McKinley, Nany Hasan, Ran Libeskind-Hadas, C. L. Liu
Disjoint Covers in Replicated Heterogeneous Arrays. SIAM J. Discret. Math. 4 (2) (1991)
Ran Libeskind-Hadas, C. L. Liu
Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks. DAC (1989)