Solutions to the Module Orientation and Rotation Problems by Neural Computation Networks. - Ran Libeskind-Hadas; C. L. Liu 001 (DAC, 1989)

Disjoint Covers in Replicated Heterogeneous Arrays. - Philip K. McKinley; Nany Hasan; Ran Libeskind-Hadas; C. L. Liu 001 (SIAM J. Discret. Math., 1991)

Reconfiguration of Fault-Tolerant VLSI Systems - Ran Libeskind-Hadas (1993)

Origin-based fault-tolerant routing in the mesh. - Ran Libeskind-Hadas; Eli Brandt (Future Gener. Comput. Syst., 1995)

Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays. - Ran Libeskind-Hadas; Nimish Shrivastava; Rami G. Melhem; C. L. Liu 001 (IEEE Trans. Parallel Distributed Syst., 1995)

Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels. - Ran Libeskind-Hadas; Kevin Watkins; Thomas Hehre (HPCA, 1996)

Tree-Based Multicasting in Wormhole-Routed Irregular Topologies. - Ran Libeskind-Hadas; Dominic Mazzoni; Ranjith Rajagopalan (IPPS/SPDP, 1998)

Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations. - Ran Libeskind-Hadas; Dominic Mazzoni; Ranjith Rajagopalan (IPPS/SPDP, 1998)

A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing. - Ran Libeskind-Hadas (IEEE Trans. Computers, 1998)

On Edge-Disjoint Spanning Trees in Hypercubes. - Benjamin Barden; Ran Libeskind-Hadas; Janet Davis; William Williams (Inf. Process. Lett., 1999)

Efficient collective communication in WDM networks with a power budget. - Ran Libeskind-Hadas (ICCCN, 2000)

Efficient Multicast in Heterogeneous Networks of Workstations. - Ran Libeskind-Hadas; Jeffrey R. K. Hartline (ICPP Workshops, 2000)

Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks. - Ran Libeskind-Hadas; Rami G. Melhem (ICN (1), 2001)

On Multicast Algorithms for Heterogeneous Networks of Workstations. - Ran Libeskind-Hadas; Jeffrey R. K. Hartline; Peter Boothe; Greg Rae; Jascha Swisher (J. Parallel Distributed Comput., 2001)

Multicast virtual topologies in WDM paths and rings with splitting loss. - Ran Libeskind-Hadas; Jeffrey R. K. Hartline; Kurt M. Dresner; Ethan W. Drucker; Katrina J. Ray (ICCCN, 2002)

Multicast routing and wavelength assignment in multihop optical networks. - Ran Libeskind-Hadas; Rami G. Melhem (IEEE/ACM Trans. Netw., 2002)

The Computational Complexity of Motion Planning. - Jeffrey R. K. Hartline; Ran Libeskind-Hadas (SIAM Rev., 2003)

On the complexity of virtual topology design for multicasting in WDM trees with tap-and-continue and multicast-capable switches. - Edward Miller; Ran Libeskind-Hadas; D. Barnard; W. Chang; Kurt M. Dresner; W. M. Turner; Jeffrey R. K. Hartline (IEEE J. Sel. Areas Commun., 2004)

Optimal virtual topologies for one-to-many communication in WDM paths and rings. - Jeffrey R. K. Hartline; Ran Libeskind-Hadas; Kurt M. Dresner; Ethan W. Drucker; Katrina J. Ray (IEEE/ACM Trans. Netw., 2004)

Traffic grooming for single-source multicast communication in WDM rings. - David Buchfuhrer; Timothy Carnes; Brian Tagiku; Laura Celis; Ran Libeskind-Hadas (ICC, 2005)

Virtual topologies for multicasting with multiple originators in WDM networks. - Ian Ferrel; Adrian Mettler; Edward Miller; Ran Libeskind-Hadas (IEEE/ACM Trans. Netw., 2006)

Breadth-first CS 1 for scientists. - Zachary Dodds; Christine Alvarado; Geoff Kuenning; Ran Libeskind-Hadas (ITiCSE, 2007)

Evaluating a breadth-first cs 1 for scientists. - Zachary Dodds; Ran Libeskind-Hadas; Christine Alvarado; Geoff Kuenning (SIGCSE, 2008)

Competitive analysis of online traffic grooming in WDM rings. - Karyn Benson; Benjamin E. Birnbaum; Esteban Molina-Estolano; Ran Libeskind-Hadas (IEEE/ACM Trans. Netw., 2008)

Approximation Algorithms for Traffic Grooming in WDM Rings. - Kevin Corcoran; Seth R. Flaxman; Mark Neyer; Peter Scherpelz; Craig Weidert; Ran Libeskind-Hadas (ICC, 2009)

On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem. - Ran Libeskind-Hadas; Michael A. Charleston (J. Comput. Biol., 2009)

When CS 1 is biology 1: crossdisciplinary collaboration as CS context. - Zachary Dodds; Ran Libeskind-Hadas; Eliot C. Bush (ITiCSE, 2010)

Jane: a new tool for the cophylogeny reconstruction problem. - Chris Conow; Daniel Fielder; Yaniv Ovadia; Ran Libeskind-Hadas (Algorithms Mol. Biol., 2010)

The Cophylogeny Reconstruction Problem Is NP-Complete. - Yaniv Ovadia; Daniel Fielder; Chris Conow; Ran Libeskind-Hadas (J. Comput. Biol., 2011)

Pixels as polymers: unifying introductory biology and computer science through visual computation. - Zachary Dodds; Ran Libeskind-Hadas; Eliot C. Bush (J. Comput. Sci. Coll., 2011)

Bio1 as CS1: evaluating a crossdisciplinary CS context. - Zachary Dodds; Ran Libeskind-Hadas; Eliot C. Bush (ITiCSE, 2012)

Increasing women's participation in computing at Harvey Mudd College. - Christine Alvarado; Zachary Dodds; Ran Libeskind-Hadas (Inroads, 2012)

Making the most of undergraduate research (abstract only). - Andrea Danyluk; Nancy M. Amato; Ran Libeskind-Hadas; Lori L. Pollock; Susan H. Rodger (SIGCSE, 2013)

A derivation-first approach to teaching algorithms. - Ran Libeskind-Hadas (SIGCSE, 2013)

A first course in computing with applications to biology. - Ran Libeskind-Hadas; Eliot C. Bush (Briefings Bioinform., 2013)

Pareto-optimal phylogenetic tree reconciliation. - Ran Libeskind-Hadas; Yi-Chieh Wu; Mukul S. Bansal; Manolis Kellis (Bioinform., 2014)

CRA-E Panel on Undergraduate Research. - Nancy M. Amato; Ran Libeskind-Hadas; Panagiotis Takis Metaxas (CSCW Companion, 2015)

Understanding the U.S. domestic computer science Ph.D. pipeline. - Susanne E. Hambrusch; Ran Libeskind-Hadas; Eric Aaron (Commun. ACM, 2015)

The PhD Pipeline. - Susanne E. Hambrusch; Ran Libeskind-Hadas (Computer, 2015)

Biologically motivated problems for introductory computer science: conference tutorial. - Eliot C. Bush; Ran Libeskind-Hadas (J. Comput. Sci. Coll., 2015)

Clustering the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. - Alex Ozdemir; Michael Sheely; Daniel Bork; Ricson Cheng; Reyna Hulett; Jean Sung; Jincheng Wang; Ran Libeskind-Hadas (AlCoB, 2017)

On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. - Daniel Bork; Ricson Cheng; Jincheng Wang; Jean Sung; Ran Libeskind-Hadas (Algorithms Mol. Biol., 2017)

DTL reconciliation repair. - Weiyun Ma; Dmitriy Smirnov 001; Ran Libeskind-Hadas (BMC Bioinform., 2017)

Reconciliation Feasibility of Non-binary Gene Trees Under a Duplication-Loss-Coalescence Model. - Ricson Cheng; Matthew Dohlen; Chen Pekker; Gabriel Quiroz; Jincheng Wang; Ran Libeskind-Hadas; Yi-Chieh Wu (AlCoB, 2018)

DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations. - Weiyun Ma; Dmitriy Smirnov 001; Juliet Forman; A. Schweickart; C. Slocum; S. Srinivasan; Ran Libeskind-Hadas (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Hierarchical clustering of maximum parsimony reconciliations. - Ross Mawhorter; Ran Libeskind-Hadas (BMC Bioinform., 2019)

Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model. - Ross Mawhorter; Nuo Liu; Ran Libeskind-Hadas; Yi-Chieh Wu (BMC Bioinform., 2019)

An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model. - Santi Santichaivekin; Ross Mawhorter; Ran Libeskind-Hadas (BMC Bioinform., 2019)

Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model. - Jordan Haack; Eli Zupke; Andrew Ramirez; Yi-Chieh Wu; Ran Libeskind-Hadas (IEEE ACM Trans. Comput. Biol. Bioinform., 2019)

CS + X Meets CS 1: Strongly Themed Intro Courses. - Robert H. Sloan; Valerie Barr; Heather Bort; Mark Guzdial; Ran Libeskind-Hadas; Richard Warner (SIGCSE, 2020)

Computer-Aided Personalized Education. - 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; et al. (CoRR, 2020)

A Biology-based CS1: Results and Reflections, Ten Years In. - Zachary Dodds; Malia Morgan; Lindsay Popowski; Henry Coxe; Caroline Coxe; Kewei Zhou; Eliot C. Bush; Ran Libeskind-Hadas (SIGCSE, 2021)

The Most Parsimonious Reconciliation Problem in the Presence of Incomplete Lineage Sorting and Hybridization Is NP-Hard. - Matthew LeMay; Yi-Chieh Wu; Ran Libeskind-Hadas (WABI, 2021)

eMPRess: a systematic cophylogeny reconciliation tool. - Santi Santichaivekin; Qing Yang; Jingyi Liu; Ross Mawhorter; Justin Jiang; Trenton Wesley; Yi-Chieh Wu; Ran Libeskind-Hadas (Bioinform., 2021)

Maximum parsimony reconciliation in the DTLOR model. - Jingyi Liu; Ross Mawhorter; Nuo Liu; Santi Santichaivekin; Eliot C. Bush; Ran Libeskind-Hadas (BMC Bioinform., 2021)

Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model. - Haoxing Du; Yi Sheng Ong; Marina Knittel; Ross Mawhorter; Nuo Liu; Gianluca Gross; Reiko Tojo; Ran Libeskind-Hadas; Yi-Chieh Wu (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model. - Melissa Grueter; Kalani Duran; Ramya Ramalingam; Ran Libeskind-Hadas (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

Distance Profiles of Optimal RNA Foldings. - Jingyi Liu; I. Duan; Santi Santichaivekin; Ran Libeskind-Hadas (ISBRA, 2022)

A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks. - Matthew LeMay; Ran Libeskind-Hadas; Yi-Chieh Wu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes. - 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 (BMC Bioinform., 2023)

Pairwise Distances and the Problem of Multiple Optima. - Ran Libeskind-Hadas (J. Comput. Biol., 2024)

ACM 2023: CS + X - Challenges and Opportunities in Developing Interdisciplinary-Computing Curricula. - Carla E. Brodley; Valerie Barr; Elsa Gunter; Mark Guzdial; Ran Libeskind-Hadas; Bill Z. Manaris (Inroads, 2024)