neal young / bibtex

  • @inproceedings{Chrobak23Classification,
    title = {Classification via Two-Way Comparisons (Extended Abstract)},
    author = {Marek Chrobak and Neal E. Young},
    year = {2023},
    pages = {16},
    note = {Published in Lecture Notes in Computer Science (LNCS Volume 14079, July 2023).},
    doi = {10.1007/978-3-031-38906-1_19},
    booktitle = {Proceedings of Workshop on Algorithms and Data Structure (WADS)}
    }
  • @inproceedings{Chrobak23Online,
    title = {Online Paging with Heterogeneous Cache Slots},
    author = {Marek Chrobak and Samuel Haney and Mehraneh Liaee and Debmalya Panigrahi and Rajmohan Rajaraman and Ravi Sundaram and Neal E. Young},
    year = {2023},
    pages = {23},
    doi = {10.4230/LIPIcs.STACS.2023.23},
    booktitle = {Proceedings of International Symposium on Theoretical Aspects of Computer Science (STACS)}
    }
  • @article{Chrobak22Simple,
    title = {A Simple Algorithm for Optimal Search Trees with 2-Way Comparisons},
    author = {Marek Chrobak and Mordecai Golin and J. Ian Munro and Neal E. Young},
    journal = {ACM Transactions on Algorithms},
    volume = {18},
    number = {1},
    year = {2022},
    pages = {1-11},
    note = {See also [Chrobak21Cost, Chrobak22Huang, Chrobak15Optimal.]},
    doi = {10.1145/3477910},
    }
  • @article{Chrobak22Huang,
    title = {On Huang and Wong'S Algorithm for Generalized Binary Split Trees},
    author = {Marek Chrobak and Mordecai Golin and J. Ian Munro and Neal E. Young},
    journal = {Acta Informatica},
    year = {2022},
    pages = {21 pages},
    note = {See also [Chrobak21Cost, Chrobak22Simple, Chrobak15Optimal.]},
    doi = {10.1007/s00236-021-00411-z},
    }
  • @article{Mao21Comparison,
    title = {Comparison and Evaluation of State-of-the-Art LSM Merge Policies},
    author = {Qizhong Mao and Steven Jacobs and Waleed Amjad and Vagelis Hristidis and Vassilis J. Tsotras and Neal E. Young},
    journal = {The VLDB Journal},
    volume = {30},
    year = {2021},
    pages = {361-378},
    note = {Journal version of Mao19Experimental.},
    doi = {10.1007/s00778-020-00638-1},
    }
  • @inproceedings{Mathieu21Competitive,
    title = {Competitive Data-Structure Dynamization},
    author = {Claire Mathieu and Rajmohan Rajaraman and Neal E. Young and Arman Yousefi},
    year = {2021},
    pages = {2269-2287},
    doi = {10.1137/1.9781611976465.135},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Chrobak21Cost,
    title = {On the Cost of Unsuccessful Searches in Search Trees with Two-Way Comparisons},
    author = {Marek Chrobak and Mordecai Golin and J. Ian Munro and Neal E. Young},
    journal = {Information and Computation},
    volume = {218},
    year = {2021},
    pages = {11 pages},
    note = {See also [Chrobak22Simple, Chrobak22Huang, Chrobak15Optimal]},
    doi = {10.1016/j.ic.2021.104707},
    }
  • @inproceedings{Mao19Experimental,
    title = {Experimental Evaluation of Bounded-Depth LSM Merge Policies},
    author = {Qizhong Mao and Steven Jacobs and Waleed Amjad and Vagelis Hristidis and Vassilis J. Tsotras and Neal E. Young},
    year = {2019},
    pages = {523-532},
    note = {Conference version of Mao21Comparison.},
    doi = {10.1109/BigData47090.2019.9006240},
    booktitle = {Proceedings of IEEE International Conference on Big Data}
    }
  • @inproceedings{Le19Unsupervised,
    title = {Unsupervised Ontology- and Sentiment-Aware Review Summarization},
    author = {Nhat X.T. Le and Neal Young and Vagelis Hristidis},
    year = {2019},
    pages = {747-762},
    doi = {10.1007/978-3-030-34223-4_47},
    booktitle = {Proceedings of International Conference on Web Information Systems Engineering}
    }
  • @inproceedings{Cohen18Balanced,
    title = {Balanced Centroidal Power Diagrams for Redistricting},
    author = {Vincent Cohen-Addad and Philip N. Klein and Neal E. Young},
    year = {2018},
    pages = {389-396},
    doi = {10.1145/3274895.3274979},
    booktitle = {Proceedings of ACM International Conference on Advances in Geographic Information Systems}
    }
  • @inproceedings{Roy18Exploiting,
    title = {Exploiting Transitivity for Learning Person Re-Identification Models on a Budget},
    author = {Sourya Roy and Sujoy Paul and Neal E. Young and Amit K Roy-Chowdhury},
    year = {2018},
    pages = {7064--7072},
    doi = {10.1109/CVPR.2018.00738},
    booktitle = {Proceedings of IEEE Conference on Computer Vision and Pattern Recognition}
    }
  • @inbook{Khuller18Greedy,
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    editor = {Teo Gonzales},
    title = {Greedy Methods},
    booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
    chapter = {4},
    year = {2018},
    publisher = {Chapman and Hall/CRC},
    pages = {4-1--4-14},
    }
  • @inproceedings{Le17Ontology,
    title = {Ontology- and Sentiment-Aware Review Summarization},
    author = {Nhat Le and Vagelis Hristidis and Neal Young},
    year = {2017},
    pages = {171-174},
    note = {Poster.},
    doi = {10.1109/ICDE.2017.67},
    booktitle = {Proceedings of IEEE International Conference on Data Engineering}
    }
  • @article{Zakaria15Accelerating,
    title = {Accelerating the Discovery of Unsupervised-Shapelets},
    author = {Jesin Zakaria and Abdullah Mueen and Eamonn Keogh and Neal E. Young},
    journal = {Data Mining and Knowledge Discovery},
    volume = {30},
    number = {1},
    year = {2016},
    pages = {243-281},
    doi = {10.1007/s10618-015-0411-4},
    }
  • @article{Young16SetCover,
    title = {Greedy Set-Cover Algorithms (Part 7 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2016},
    pages = {886-889},
    doi = {10.1007/978-3-642-27848-8_175-2},
    }
  • @article{Young15Nearly,
    title = {Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs},
    author = {Neal E. Young},
    journal = {working paper},
    year = {2016},
    }
  • @article{Young16Paging,
    title = {Online Paging and Caching (Part 14 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2016},
    pages = {1457-1461},
    doi = {10.1007/978-1-4939-2864-4_267},
    }
  • @article{Bienkowski15Approximation,
    title = {Approximation Algorithms for the Joint Replenishment Problem with Deadlines},
    author = {Marcin Bienkowski and Jaroslaw Byrka and Marek Chrobak and Neil Dobbs and Tomasz Nowicki and Maxim Sviridenko and Grzegorz Swirszcz and Neal E. Young},
    journal = {Journal of Scheduling},
    volume = {18},
    number = {6},
    year = {2015},
    pages = {545-560},
    note = {Journal version of [2013].},
    doi = {10.1007/s10951-014-0392-y},
    }
  • @article{Klein15Number,
    title = {On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms},
    author = {Philip Klein and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {44},
    number = {4},
    year = {2015},
    pages = {1154-1172},
    note = {Journal version of [1999]. Published online Aug. 2015.},
    doi = {10.1137/12087222X},
    }
  • @inproceedings{Chrobak15Optimal,
    title = {Optimal Search Trees with 2-Way Comparisons},
    author = {Marek Chrobak and Mordecai Golin and J. Ian Munro and Neal E. Young},
    year = {2015},
    pages = {71-82},
    note = {Conference version of [Chrobak22Simple, Chrobak21Cost, Chrobak22Huang]},
    doi = {10.1007/978-3-662-48971-0_7},
    booktitle = {Proceedings of International Symposium on Algorithms and Computation (LNCS 9472)}
    }
  • @article{Young15SetCover,
    title = {Set-Cover Approximation (Chapter 40)},
    author = {Neal E. Young},
    journal = {Handbook of Graph Theory, Combinatorial Optimization, and Algorithms},
    year = {2015},
    }
  • @article{Koufogiannakis13Nearly,
    title = {A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs},
    author = {Christos Koufogiannakis and Neal E. Young},
    journal = {Algorithmica},
    volume = {70},
    number = {4},
    year = {2014},
    pages = {648-674},
    note = {Journal version of [2007].},
    doi = {10.1007/s00453-013-9771-6},
    }
  • @inproceedings{Khare13First,
    title = {First-Come-First-Served for Online Slot Allocation and Huffman Coding},
    author = {Monik Khare and Claire Mathieu and Neal E. Young},
    year = {2014},
    pages = {445-454},
    doi = {10.1137/1.9781611973402.33},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Yousefi13Linear,
    title = {On a Linear Program for Minimum-Weight Triangulation},
    author = {Arman Yousefi and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {43},
    number = {1},
    year = {2014},
    pages = {25-51},
    note = {Journal version of [2012].},
    doi = {10.1137/120887928},
    }
  • @inproceedings{Bienkowski13Approximation,
    title = {Approximation Algorithms for the Joint Replenishment Problem with Deadlines},
    author = {Marcin Bienkowski and Jaroslaw Byrka and Marek Chrobak and Neil Dobbs and Tomasz Nowicki and Maxim Sviridenko and Grzegorz Swirszcz and Neal E. Young},
    year = {2013},
    pages = {135-147},
    note = {Conference version of [2014].},
    doi = {10.1007/978-3-642-39206-1_12},
    booktitle = {Proceedings of Automata, Languages, and Programming (ICALP '13); Lecture Notes in Computer Science Volume 7965}
    }
  • @article{Koufogiannakis13Greedy,
    title = {Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost},
    author = {Christos Koufogiannakis and Neal E. Young},
    journal = {Algorithmica},
    volume = {66},
    number = {1},
    year = {2013},
    pages = {113-152},
    note = {Journal version of [2009].},
    doi = {10.1007/s00453-012-9629-3},
    }
  • @article{Sheldon13Hamming,
    title = {Hamming Approximation of NP Witnesses},
    author = {Daniel Sheldon and Neal E. Young},
    journal = {Theory of Computing},
    volume = {9},
    number = {22},
    year = {2013},
    pages = {685-702},
    note = {First draft circulated in 2003.},
    doi = {10.4086/toc.2013.v009a022},
    }
  • @article{Golin12Huffman,
    title = {Huffman Coding with Unequal Letter Costs: a Linear-Time Approximation Scheme},
    author = {Mordecai Golin and Claire Mathieu and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {41},
    number = {3},
    year = {2012},
    pages = {684-713},
    note = {Journal version of [2002].},
    doi = {10.1137/100794092},
    }
  • @inproceedings{Yousefi12Linear,
    title = {On a Linear Program for Minimum-Weight Triangulation},
    author = {Arman Yousefi and Neal E. Young},
    year = {2012},
    pages = {811--823},
    note = {Conference version of [2013].},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Koufogiannakis11Distributed,
    title = {Distributed Algorithms for Covering, Packing and Maximum Weighted Matching},
    author = {Christos Koufogiannakis and Neal E. Young},
    journal = {Distributed Computing},
    volume = {24},
    number = {1},
    year = {2011},
    pages = {45-63},
    note = {Journal version of two conference papers, on
    [covering]
    and
    [packing].},
    doi = {10.1007/s00446-011-0127-7},
    }
  • @inproceedings{Mueen11Logical,
    title = {Logical-Shapelets: an Expressive Primitive for Time Series Classification},
    author = {Abdullah Mueen and Eamonn Keogh and Neal E. Young},
    year = {2011},
    pages = {1154-1162},
    doi = {10.1145/2020408.2020587},
    booktitle = {Proceedings of ACM International Conference on Knowledge Discovery and Data Mining}
    }
  • @inbook{Klein10Approximation,
    authors = {Philip Klein and Neal E. Young},
    editor = {Mikhail J. Atallah and Marina Blanton},
    title = {Approximation algorithms for NP-Hard optimization problems},
    booktitle = {Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques},
    chapter = {34},
    year = {2010},
    publisher = {Chapman & Hall/CRC},
    pages = {40},
    }
  • @inproceedings{Koufogiannakis09Distributed,
    title = {Distributed and Parallel Algorithms for Weighted Vertex Cover and Other Covering Problems},
    author = {Christos Koufogiannakis and Neal E. Young},
    year = {2009},
    pages = {171-179},
    note = {Conference version of part of Distributed algorithms for covering, packing and maximum weighted matching.},
    doi = {10.1145/1582716.1582746},
    booktitle = {Proceedings of ACM Symposium on Principles of Distributed Computing}
    }
  • @inproceedings{Koufogiannakis09DistributedPacking,
    title = {Distributed Fractional Packing and Maximum Weighted B-Matching via Tail-Recursive Duality},
    author = {Christos Koufogiannakis and Neal E. Young},
    year = {2009},
    pages = {221--238},
    note = {Conference version of part of Distributed Algorithms for Covering, Packing and Maximum Weighted Matching.},
    doi = {10.1007/978-3-642-04355-0_23},
    booktitle = {Proceedings of International Symposium on Distributed Computing}
    }
  • @inproceedings{Koufogiannakis09Greedy,
    title = {Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost},
    author = {Christos Koufogiannakis and Neal E. Young},
    year = {2009},
    pages = {634-652},
    note = {Conference version of [2013].},
    doi = {10.1007/978-3-642-02927-1_53},
    booktitle = {Proceedings of International Colloquium on Automata, Languages, and Programming (LNCS 5555)}
    }
  • @article{Gelal09Topology,
    title = {Topology Management in Directional Antenna-Equipped Ad Hoc Networks},
    author = {Ece Gelal and Gentian Jakllari and Srikanth V. Krishnamurthy and Neal E. Young},
    journal = {IEEE Transactions on Mobile Computing},
    volume = {8},
    number = {5},
    year = {2009},
    pages = {590-605},
    note = {Journal version of [2006].},
    doi = {10.1109/TMC.2008.158},
    }
  • @article{Young08SetCover,
    title = {Greedy Set-Cover Algorithms (Part 7 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2008},
    doi = {10.1007/978-0-387-30162-4_175},
    }
  • @article{Chrobak08Online,
    title = {Incremental Medians via Online Bidding},
    author = {Marek Chrobak and Claire Kenyon and John Noga and Neal E. Young},
    journal = {Algorithmica},
    volume = {50},
    number = {4},
    year = {2008},
    pages = {455-478},
    note = {Journal version of [2006].},
    doi = {10.1007/s00453-007-9005-x},
    }
  • @article{Young08Paging,
    title = {Online Paging and Caching (Part 14 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2008},
    doi = {10.1007/978-0-387-30162-4_267},
    }
  • @article{Fu07Algorithmic,
    title = {Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments},
    author = {Q. Fu and E. Bent and J. Borneman and M. Chrobak and N. E. Young},
    journal = {Journal of Bioinformatics and Computational Biology},
    volume = {5},
    number = {4},
    year = {2007},
    pages = {937-961},
    note = {Journal version of [2007].},
    doi = {10.1142/S0219720007002977},
    }
  • @inproceedings{Fu07Algorithmic_conference,
    title = {Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments},
    author = {Q. Fu and E. Bent and J. Borneman and M. Chrobak and N. E. Young},
    year = {2007},
    pages = {17},
    note = {Conference version of [2007].},
    booktitle = {Proceedings of Asia-Pacific Bioinformatics Conference}
    }
  • @inproceedings{Koufogiannakis07Beating,
    title = {Beating Simplex for Fractional Packing and Covering Linear Programs},
    author = {Christos Koufogiannakis and Neal E. Young},
    year = {2007},
    pages = {494-506},
    note = {Conference version of [2013].},
    doi = {10.1109/FOCS.2007.62},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @inproceedings{Agarwal07Efficient,
    title = {Efficient and Effective Explanation of Change in Hierarchical Summaries},
    author = {D. Agarwal and D. Barman and D. Gunopulos and F. Korn and D. Srivastava and N. Young},
    year = {2007},
    pages = {6-15},
    doi = {10.1145/1281192.1281197},
    booktitle = {Proceedings of ACM International Conference on Knowledge Discovery and Data Mining}
    }
  • @inbook{Khuller07Greedy,
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    editor = {Teo Gonzales},
    title = {Greedy Methods},
    booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
    chapter = {4},
    year = {2007},
    publisher = {Chapman and Hall/CRC},
    pages = {4-1--4-14},
    }
  • @inproceedings{Agarwal07Parsimonious,
    title = {Parsimonious Explanations of Change in Hierarchical Data},
    author = {Dhiman Barman and Flip Korn and Divesh Srivastava and Dimitrios Gunopulos and Neal E. Young and Deepak Agarwal.},
    year = {2007},
    pages = {1273-1275},
    note = {Poster presentation of [2007].},
    booktitle = {Proceedings of IEEE International Conference on Database Engineering}
    }
  • @inproceedings{Gelal06Integrated,
    title = {An Integrated Scheme for Fully-Directional Neighbor Discovery and Topology Management in Mobile Ad Hoc Networks},
    author = {Ece Gelal and Gentian Jakllari and Srikanth V. Krishnamurthy and Neal E. Young},
    year = {2006},
    pages = {139-149},
    doi = {10.1109/MOBHOC.2006.278551},
    booktitle = {Proceedings of MASS: IEEE International Conference on Mobile Ad-hoc and Sensor Systems}
    }
  • @inproceedings{Chrobak06Online,
    title = {Oblivious Medians via Online Bidding},
    author = {Marek Chrobak and Claire Kenyon and John Noga and Neal E. Young},
    year = {2006},
    pages = {311-322},
    note = {Conference version of [2008].},
    doi = {10.1007/11682462_31},
    booktitle = {Proceedings of Latin American Theoretical Informatics (LATIN; LNCS 3887)}
    }
  • @article{Chrobak06Reverse,
    title = {The Reverse Greedy Algorithm for the Metric K-Median Problem},
    author = {Marek Chrobak and Claire Kenyon and Neal E. Young},
    journal = {Information Processing Letters},
    volume = {97},
    year = {2006},
    pages = {68-72},
    note = {Journal version of [2005].},
    doi = {10.1016/j.ipl.2005.09.009},
    }
  • @inproceedings{Gelal06Topology,
    title = {Topology Control to Simultaneously Achieve Near-Optimal Node Degree and Low Path Stretch in Ad Hoc Networks},
    author = {Ece Gelal and Gentian Jakllari and Srikanth V. Krishnamurthy and Neal E. Young},
    year = {2006},
    pages = {431-439},
    note = {Conference version of [2009].},
    doi = {10.1109/SAHCN.2006.288499},
    booktitle = {Proceedings of IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks}
    }
  • @article{Kolliopoulos05Approximation,
    title = {Approximation Algorithms for Covering/Packing Integer Programs},
    author = {Stavros G. Kolliopoulos and Neal E. Young},
    journal = {Journal of Computer and System Sciences},
    volume = {71},
    number = {4},
    year = {2005},
    pages = {495-505},
    note = {Journal version of Tight approximation results for general covering integer programs.},
    doi = {10.1016/j.jcss.2005.05.002},
    }
  • @inproceedings{Chrobak05Reverse,
    title = {The Reverse Greedy Algorithm for the Metric K-Median Problem},
    author = {Marek Chrobak and Claire Kenyon and Neal E. Young},
    year = {2005},
    note = {Conference version of [2006].},
    booktitle = {Proceedings of International Computing and Combinatorics Conference}
    }
  • @article{Karger04Rounding,
    title = {Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut},
    author = {David Karger and Philip Klein and Cliff Stein and Mikkel Thorup and Neal E. Young},
    journal = {Mathematics of Operations Research},
    volume = {29},
    number = {3},
    year = {2004},
    pages = {0436-0461},
    note = {Journal version of [1999].},
    doi = {10.1287/moor.1030.0086},
    }
  • @article{Blanton03Efficient,
    title = {An Efficient Targeting Strategy for Multiobject Spectrograph Surveys: the Sloan Digital Sky Survey "Tiling" Algorithm},
    author = {Michael R. Blanton and Huan Lin and Robert H. Lupton and F. Miller Maley and Neal E. Young},
    journal = {The Astronomical Journal},
    volume = {125},
    year = {2003},
    pages = {2276-2286},
    doi = {10.1086/344761},
    }
  • @inproceedings{Golin02Huffman,
    title = {Huffman Coding with Unequal Letter Costs},
    author = {Mordecai Golin and Claire Kenyon and Neal E. Young},
    year = {2002},
    pages = {785-791},
    note = {Conference version of [2012].},
    doi = {10.1145/509907.510020},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @article{Young02Online,
    title = {On-Line File Caching},
    author = {Neal E. Young},
    journal = {Algorithmica},
    volume = {33},
    number = {3},
    year = {2002},
    pages = {371-383},
    note = {Journal version of [1998].},
    doi = {10.1007/s00453-001-0124-5},
    }
  • @inproceedings{Garg02Online,
    title = {On-Line, End-to-End Congestion Control},
    author = {Naveen Garg and Neal E. Young},
    year = {2002},
    pages = {303-312},
    doi = {10.1109/SFCS.2002.1181953},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @inproceedings{Young01Sequential,
    title = {Sequential and Parallel Algorithms for Mixed Packing and Covering},
    author = {Neal E. Young},
    year = {2001},
    pages = {538-546},
    doi = {10.1109/SFCS.2001.959930},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @inproceedings{Kolliopoulos01Tight,
    title = {Tight Approximation Results for General Covering Integer Programs},
    author = {Stavros G. Kolliopoulos and Neal E. Young},
    year = {2001},
    pages = {522-528},
    note = {Conference version of Approximation algorithms for covering/packing integer programs.},
    doi = {10.1109/SFCS.2001.959928},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @inproceedings{Young00Kmedians,
    title = {K-Medians, Facility Location, and the Chernoff-Wald Bound},
    author = {Neal E. Young},
    year = {2000},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Young00Online,
    title = {On-Line Paging Against Adversarially Biased Random Inputs},
    author = {Neal E. Young},
    journal = {Journal of Algorithms},
    volume = {37},
    number = {1},
    year = {2000},
    pages = {218-235},
    note = {Journal version of Bounding the diffuse adversary.},
    doi = {10.1006/jagm.2000.1099},
    }
  • @inproceedings{Kenyon00Polynomial,
    title = {Polynomial-Time Approximation Scheme for Data Broadcast},
    author = {Claire Kenyon and Nicolas Schabanel and Neal E. Young},
    year = {2000},
    pages = {659-666},
    doi = {10.1145/335305.335398},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @inbook{Klein99Approximation,
    authors = {Philip Klein and Neal E. Young},
    editor = {Mikhail J. Atallah},
    title = {Approximation Algorithms for NP-Hard Optimization Problems},
    booktitle = {Algorithms and Theory of Computation Handbook, First Edition},
    chapter = {34},
    year = {1999},
    publisher = {CRC Press},
    pages = {34-1},
    }
  • @inproceedings{Aslam99Improved,
    title = {Improved Bicriteria Existence Theorems for Scheduling},
    author = {Jay Aslam and April Rasala and Cliff Stein and Neal E. Young},
    year = {1999},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @inproceedings{Klein99Number,
    title = {On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms},
    author = {Philip Klein and Neal E. Young},
    year = {1999},
    note = {Conference version of [2015].},
    doi = {10.1007/3-540-48777-8_24},
    booktitle = {Proceedings of Integer Programming and Combinatorial Optimization (LNCS 1610)}
    }
  • @inproceedings{Karger99Rounding,
    title = {Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut},
    author = {David Karger and Philip Klein and Cliff Stein and Mikkel Thorup and Neal E. Young},
    year = {1999},
    pages = {668-678},
    note = {Conference version of [2004].},
    doi = {10.1145/301250.301430},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @inproceedings{Young98Bounding,
    title = {Bounding the Diffuse Adversary},
    author = {Neal E. Young},
    year = {1998},
    pages = {420-425},
    note = {Conference version of On-line paging against adversarially biased random inputs.},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Lupton98Data,
    title = {Data Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic},
    author = {Robert Lupton and Miller Maley and Neal E. Young},
    journal = {Journal of Algorithms},
    volume = {27},
    number = {2},
    year = {1998},
    pages = {339-356},
    note = {Journal version of [1996].},
    doi = {10.1006/jagm.1997.0922},
    }
  • @inproceedings{Young98Online,
    title = {On-Line File Caching},
    author = {Neal E. Young},
    year = {1998},
    pages = {82-86},
    note = {Conference version of [2002].},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @inproceedings{Zhang97Codebook,
    title = {A Codebook Generation Algorithm for Document Image Compression},
    author = {Qin Zhang and John Danskin and Neal E. Young},
    year = {1997},
    pages = {300-309},
    doi = {10.1109/DCC.1997.582053},
    booktitle = {Proceedings of IEEE Data Compression Conference}
    }
  • @article{Fekete97Network,
    title = {A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees},
    author = {S. Fekete and S. Khuller and M. Klemmstein and B. Raghavachari and Neal E. Young},
    journal = {Journal of Algorithms},
    volume = {24},
    number = {2},
    year = {1997},
    pages = {310-324},
    doi = {10.1007/3-540-61310-2_9},
    }
  • @article{Hakimi97Orienting,
    title = {Orienting Graphs to Optimize Reachability},
    author = {S. L. Hakimi and E. Schmeichel and Neal E. Young},
    journal = {Information Processing Letters},
    volume = {63},
    number = {5},
    year = {1997},
    pages = {229-235},
    doi = {10.1016/S0020-0190(97)00129-4},
    }
  • @article{Millar96New,
    title = {A New Operation on Sequences: the Boustrophedon Transform},
    author = {Jessica Millar Young and N.J.A. Sloane and Neal E. Young},
    journal = {Journal of Combinatorial Theory, Series A},
    volume = {a76},
    number = {1},
    year = {1996},
    pages = {44-54},
    doi = {10.1006/jcta.1996.0087},
    }
  • @inproceedings{Lupton96Data,
    title = {Data Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic},
    author = {Robert Lupton and Miller Maley and Neal E. Young},
    year = {1996},
    pages = {296-303},
    note = {Conference version of [1998].},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Khuller96Low,
    title = {Low Degree Spanning Trees of Small Weight},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {25},
    number = {2},
    year = {1996},
    pages = {355-368},
    note = {Journal version of [1994].},
    doi = {10.1137/S0097539794264585},
    }
  • @article{Khuller96Strongly,
    title = {On Strongly Connected Digraphs with Bounded Cycle Length},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    journal = {Discrete Applied Mathematics},
    volume = {69},
    number = {3},
    year = {1996},
    pages = {281-289},
    }
  • @inproceedings{Matias96Implementation,
    title = {Performance Evaluation of Approximate Priority Queues},
    author = {Yossi Matias and S. Cenk Sahinalp and Neal E. Young},
    year = {1996},
    booktitle = {Proceedings of Fifth DIMACS Implementation Challenge}
    }
  • @article{Golin96Prefix,
    title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
    author = {Mordecai Golin and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {25},
    number = {6},
    year = {1996},
    pages = {1281-1304},
    note = {Journal version of [1994].},
    doi = {10.1137/S0097539794268388},
    }
  • @article{Khuller95Approximating,
    title = {Approximating the Minimum Equivalent Digraph},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    journal = {SIAM Journal on Computing},
    volume = {24},
    number = {4},
    year = {1995},
    pages = {859-872},
    note = {Journal version of [1994].},
    doi = {10.1137/S0097539793256685},
    }
  • @article{Khuller95Balancing,
    title = {Balancing Minimum Spanning Trees and Shortest-Path Trees},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    journal = {Algorithmica},
    volume = {14},
    number = {4},
    year = {1995},
    pages = {305-322},
    note = {Journal version of [1993].},
    doi = {10.1007/BF01294129},
    }
  • @inproceedings{Young95Randomized,
    title = {Randomized Rounding without Solving the Linear Program},
    author = {Neal E. Young},
    year = {1995},
    pages = {170-178},
    note = {Lecture notes on this topic are here.},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Young94Bound,
    title = {A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls},
    author = {Neal E. Young},
    journal = {Technical Report, School of ORIE, Cornell University},
    volume = {1103},
    year = {1994},
    }
  • @article{Khuller94Primal,
    title = {A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover},
    author = {Samir Khuller and Uzi Vishkin and Neal E. Young},
    journal = {Journal of Algorithms},
    volume = {17},
    number = {2},
    year = {1994},
    pages = {280-289},
    note = {Journal version of [1993].},
    doi = {10.1006/jagm.1994.1036},
    }
  • @inproceedings{Matias94Approximate,
    title = {Approximate Data Structures with Applications},
    author = {Yossi Matias and Jeff Vitter and Neal E. Young},
    year = {1994},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @inproceedings{Khuller94Approximating,
    title = {Approximating the Minimum Equivalent Digraph},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1994},
    pages = {177-186},
    note = {Conference version of [1995].},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @article{Khuller94Designing,
    title = {Designing Multi-Commodity Flow Trees},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    journal = {Information Processing Letters},
    volume = {50},
    number = {1},
    year = {1994},
    pages = {49-55},
    note = {Journal version of [1993].},
    doi = {10.1016/0020-0190(94)90044-2},
    }
  • @inproceedings{Khuller94Low,
    title = {Low Degree Spanning Trees of Small Weight},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1994},
    pages = {412-421},
    note = {Conference version of [1996].},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @inproceedings{Golin94Prefix,
    title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
    author = {Mordecai Golin and Neal E. Young},
    year = {1994},
    pages = {605-617},
    note = {Conference version of [Golin96Prefix].},
    doi = {10.1007/3-540-58201-0_102},
    booktitle = {Proceedings of International Colloquium on Automata, Languages, and Programming}
    }
  • @inproceedings{Lipton94Simple,
    title = {Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory},
    author = {Richard Lipton and Neal E. Young},
    year = {1994},
    pages = {734-740},
    doi = {10.1145/195058.195447},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @article{Young94KServer,
    title = {The K-Server Dual and Loose Competitiveness for Paging},
    author = {Neal E. Young},
    journal = {Algorithmica},
    volume = {11},
    number = {6},
    year = {1994},
    pages = {525-541},
    note = {Journal version of [1991].},
    doi = {10.1007/BF01189992},
    }
  • @inproceedings{Khuller93Primal,
    title = {A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover},
    author = {Samir Khuller and Uzi Vishkin and Neal E. Young},
    year = {1993},
    pages = {333-341},
    note = {Conference version of [1994].},
    booktitle = {Proceedings of Integer Programming and Combinatorial Optimization}
    }
  • @inproceedings{Khuller93Balancing,
    title = {Balancing Minimum Spanning Trees and Shortest-Path Trees},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1993},
    pages = {243-250},
    note = {Conference version of [1995].},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @inproceedings{Khuller93Designing,
    title = {Designing Multi-Commodity Flow Trees},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1993},
    pages = {433-441},
    note = {Conference version of [1994].},
    doi = {10.1007/3-540-57155-8_268},
    booktitle = {Proceedings of Workshop on Algorithms and Data Structures}
    }
  • @article{Fiat91Competitive,
    title = {Competitive Paging Algorithms},
    author = {Amos Fiat and Richard Karp and Micheal Luby and Lyle McGeoch and Daniel Sleator and Neal E. Young},
    journal = {Journal of Algorithms},
    volume = {12},
    number = {4},
    year = {1991},
    pages = {685-699},
    doi = {10.1016/0196-6774(91)90041-V},
    }
  • @phdthesis{Young91Competitive,
    author = {Neal E. Young},
    year = {1991},
    school = {Princeton University, Department of Computer Science},
    title = {Competitive Paging and Dual-Guided Algorithms for Weighted Caching and Matching},
    }
  • @article{Tarjan91Faster,
    title = {Faster Parametric Shortest Path and Minimum Balance Algorithms},
    author = {Robert Tarjan and James Orlin and Neal E. Young},
    journal = {Networks},
    volume = {21},
    number = {2},
    year = {1991},
    pages = {205-221},
    doi = {10.1002/net.3230210206},
    }
  • @article{Lovasz91Lecture,
    title = {Lecture Notes on Evasiveness of Graph Properties},
    author = {Laszlo Lovasz and Neal E. Young},
    journal = {Technical Report, Computer Science Department, Princeton University},
    volume = {CS-TR-317-91},
    year = {1991},
    }
  • @inproceedings{Young91Online,
    title = {On-Line Caching as Cache Size Varies},
    author = {Neal E. Young},
    year = {1991},
    pages = {241-250},
    note = {Conference version of
    The K-Server Dual and Loose Competitiveness for Paging.},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }