| 2023 | STACS | Online Paging with Heterogeneous Cache Slots. | Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young |
| 2023 | WADS | Classification via Two-Way Comparisons (Extended Abstract). | Marek Chrobak, Neal E. Young |
| 2021 | SODA | Competitive Data-Structure Dynamization. | Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi |
| 2019 | WISE | Unsupervised Ontology- and Sentiment-Aware Review Summarization. | Nhat X. T. Le, Neal E. Young, Vagelis Hristidis |
| 2018 | CVPR | Exploiting Transitivity for Learning Person Re-Identification Models on a Budget. | Sourya Roy, Sujoy Paul, Neal E. Young, Amit K. Roy-Chowdhury |
| 2017 | ICDE | Ontology- and Sentiment-Aware Review Summarization. | Nhat X. T. Le, Vagelis Hristidis, Neal E. Young |
| 2015 | ISAAC | Optimal Search Trees with 2-Way Comparisons. | Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young |
| 2014 | SODA | First Come First Served for Online Slot Allocation and Huffman Coding. | Monik Khare, Claire Mathieu, Neal E. Young |
| 2013 | ICALP | Approximation Algorithms for the Joint Replenishment Problem with Deadlines. | Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil B. Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young |
| 2012 | SODA | On a linear program for minimum-weight triangulation. | Arman Yousefi, Neal E. Young |
| 2011 | KDD | Logical-shapelets: an expressive primitive for time series classification. | Abdullah Mueen, Eamonn J. Keogh, Neal E. Young |
| 2009 | ICALP | Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. | Christos Koufogiannakis, Neal E. Young |
| 2009 | PODC | Distributed and parallel algorithms for weighted vertex cover and other covering problems. | Christos Koufogiannakis, Neal E. Young |
| 2007 | APBC | Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. | Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young |
| 2007 | FOCS | Beating Simplex for Fractional Packing and Covering Linear Programs. | Christos Koufogiannakis, Neal E. Young |
| 2007 | ICDE | Parsimonious Explanations of Change in Hierarchical Data. | Dhiman Barman, Flip Korn, Divesh Srivastava, Dimitrios Gunopulos, Neal E. Young, Deepak Agarwal |
| 2007 | KDD | Efficient and effective explanation of change in hierarchical summaries. | Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos, Neal E. Young, Flip Korn, Divesh Srivastava |
| 2006 | LATIN | Oblivious Medians Via Online Bidding. | Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young |
| 2006 | MASS | An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad hoc Networks. | Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young |
| 2006 | SECON | Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad hoc Networks. | Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young |
| 2005 | COCOON | The Reverse Greedy Algorithm for the Metric | Marek Chrobak, Claire Kenyon, Neal E. Young |
| 2002 | FOCS | On-Line End-to-End Congestion Control. | Naveen Garg, Neal E. Young |
| 2002 | STOC | Huffman coding with unequal letter costs. | Mordecai J. Golin, Claire Kenyon, Neal E. Young |
| 2001 | FOCS | Tight Approximation Results for General Covering Integer Programs. | Stavros G. Kolliopoulos, Neal E. Young |
| 2001 | FOCS | Sequential and Parallel Algorithms for Mixed Packing and Covering. | Neal E. Young |
| 2000 | SODA | Untitled record | Neal E. Young |
| 2000 | STOC | Polynomial-time approximation scheme for data broadcast. | Claire Kenyon, Nicolas Schabanel, Neal E. Young |
| 1999 | IPCO | On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. | Philip N. Klein, Neal E. Young |
| 1999 | SODA | Improved Bicriteria Existence Theorems for Scheduling. | Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young |
| 1999 | STOC | Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. | David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young |
| 1998 | SODA | On-Line File Caching. | Neal E. Young |
| 1998 | SODA | Bounding the Diffuse Adversary. | Neal E. Young |
| 1997 | DCC | A Codebook Generation Algorithm for Document Image Compression. | Qin Zhang, John M. Danskin, Neal E. Young |
| 1996 | IPCO | A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. | Sndor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young |
| 1996 | SODA | Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. | Robert Lupton, F. Miller Maley, Neal E. Young |
| 1995 | SODA | Randomized Rounding Without Solving the Linear Program. | Neal E. Young |
| 1994 | ICALP | Prefix Codes: Equiprobable Words, Unequal Letter Costs. | Mordecai J. Golin, Neal E. Young |
| 1994 | SODA | Approximating the Minimum Equivalent Diagraph. | Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1994 | SODA | Approximate Data Structures with Applications. | Yossi Matias, Jeffrey Scott Vitter, Neal E. Young |
| 1994 | STOC | Low degree spanning trees of small weight. | Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1994 | STOC | Simple strategies for large zero-sum games with applications to complexity theory. | Richard J. Lipton, Neal E. Young |
| 1993 | IPCO | A primal-dual parallel approximation technique applied to weighted set and vertex cover. | Samir Khuller, Uzi Vishkin, Neal E. Young |
| 1993 | SODA | Balancing Minimum Spanning and Shortest Path Trees. | Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1993 | WADS | Designing Multi-Commodity Flow Trees. | Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1991 | SODA | On-Line Caching as Cache Size Varies. | Neal E. Young |