Breadcrumbs

neal young / bibtex

  • @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},
    booktitle = {Proceedings of ICALP '13}
    }
  • @article{Sheldon13Hamming,
    title = {Hamming Approximation of NP Witnesses},
    author = {Daniel Sheldon and Neal E. Young},
    journal = {accepted to Theory of Computing},
    year = {2013},
    pages = {},
    note = {First draft appeared in 2008.},
    }
  • @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},
    year = {2013},
    pages = {},
    note = {Journal version of [2007].},
    }
  • @inproceedings{Young13Approximating,
    title = {Approximating 1-Dimensional TSP Requires Omega(N Log N) Comparisons},
    author = {Neal E. Young},
    year = {2013},
    booktitle = {Proceedings of arxiv.org}
    }
  • @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].},
    }
  • @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].},
    }
  • @inproceedings{Yousefi12Linear,
    title = {On a Linear Program for Minimum-Weight Triangulation},
    author = {Arman Yousefi and Neal E. Young},
    year = {2012},
    pages = {811--823},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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},
    booktitle = {Proceedings of ACM SIGKDD: International Conference on Knowledge Discovery and Data Mining}
    }
  • @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].},
    }
  • @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].},
    }
  • @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},
    booktitle = {Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP'09) (LNCS 5555)}
    }
  • @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},
    booktitle = {Proceedings of ACM Symposium on Principles of Distributed Computing (PODC'09)}
    }
  • @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},
    booktitle = {Proceedings of The 23rd International Symposium on Distributed Computing (DISC'09)}
    }
  • @article{Young08Paging,
    title = {Online Paging and Caching (Part 14 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2008},
    }
  • @article{Young08SetCover,
    title = {Greedy Set-Cover Algorithms (Part 7 of Encyclopedia of Algorithms)},
    author = {Neal E. Young},
    journal = {Springer Encyclopedia of Algorithms},
    year = {2008},
    }
  • @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},
    year = {2008},
    pages = {455-478},
    note = {Journal version of [2006].},
    }
  • @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},
    booktitle = {Proceedings of Poster in Proceedings of the IEEE International Conference on Database Engineering (ICDE),}
    }
  • @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},
    booktitle = {Proceedings of ACM SIGKDD: International Conference on Knowledge Discovery and Data Mining}
    }
  • @inproceedings{Koufogiannakis07Beating,
    title = {Beating Simplex for Fractional Packing and Covering Linear Programs},
    author = {Christos Koufogiannakis and Neal E. Young},
    year = {2007},
    pages = {494-506},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @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},
    booktitle = {Proceedings of APBC: Asia-Pacific Bioinformatics Conference}
    }
  • @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].},
    }
  • @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].},
    }
  • @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},
    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},
    booktitle = {Proceedings of Latin American Theoretical Informatics (LATIN; LNCS 3887)}
    }
  • @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},
    booktitle = {Proceedings of SECON: IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks}
    }
  • @inbook{Khuller06Greedy,
    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 = {Taylor and Francis Books (CRC Press)},
    pages = {4-1--4-14},
    }
  • @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.},
    }
  • @inproceedings{Chrobak05Reverse_conference,
    title = {The Reverse Greedy Algorithm for the Metric K-Median Problem},
    author = {Marek Chrobak and Claire Kenyon and Neal E. Young},
    year = {2005},
    booktitle = {Proceedings of The Computing and Combinatorics Conference 2005 (COCOON)}
    }
  • @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].},
    }
  • @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},
    }
  • @inproceedings{Garg02Online,
    title = {On-Line, End-to-End Congestion Control},
    author = {Naveen Garg and Neal E. Young},
    year = {2002},
    pages = {303-312},
    booktitle = {Proceedings of IEEE Symposium on Foundations of Computer Science}
    }
  • @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].},
    }
  • @inproceedings{Golin02Huffman,
    title = {Huffman Coding with Unequal Letter Costs},
    author = {Mordecai Golin and Claire Kenyon and Neal E. Young},
    year = {2002},
    pages = {785-791},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @inproceedings{Young01Sequential,
    title = {Sequential and Parallel Algorithms for Mixed Packing and Covering},
    author = {Neal E. Young},
    year = {2001},
    pages = {538-546},
    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},
    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.},
    }
  • @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},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @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},
    booktitle = {Proceedings of Integer Programming and Combinatorial Optimization (IPCO'99) (LNCS 1610:320-327)}
    }
  • @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}
    }
  • @inbook{Klein99Approximation,
    authors = {Philip Klein and Neal E. Young},
    editor = {Mikhail J. Atallah},
    title = {Approximation Algorithms for NP-Hard Optimization Problems},
    booktitle = {CRC Handbook on Theory of Computation},
    chapter = {34},
    year = {1999},
    publisher = {CRC Press},
    pages = {34-1},
    }
  • @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},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @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].},
    }
  • @inproceedings{Young98Online,
    title = {On-Line File Caching},
    author = {Neal E. Young},
    year = {1998},
    pages = {82-86},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @inproceedings{Young98Bounding,
    title = {Bounding the Diffuse Adversary},
    author = {Neal E. Young},
    year = {1998},
    pages = {420-425},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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},
    }
  • @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},
    }
  • @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},
    booktitle = {Proceedings of IEEE Data Compression Conference}
    }
  • @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},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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{Millar96New,
    title = {A New Operation on Sequences: the Boustrophedon Transform},
    author = {Jessica Millar Young and N.J.A. Sloane and Neal E. Young},
    journal = {J. Combinatorial Theory, Series A},
    volume = {76},
    number = {1},
    year = {1996},
    pages = {44-54},
    }
  • @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].},
    }
  • @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].},
    }
  • @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},
    }
  • @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].},
    }
  • @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].},
    }
  • @inproceedings{Young95Randomized,
    title = {Randomized Rounding without Solving the Linear Program},
    author = {Neal E. Young},
    year = {1995},
    pages = {170-178},
    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},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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{Khuller94Low,
    title = {Low Degree Spanning Trees of Small Weight},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1994},
    pages = {412-421},
    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].},
    }
  • @article{Young94Bound,
    title = {A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls},
    author = {Neal E. Young},
    journal = {Cornell University School of ORIE Technical Report},
    volume = {1103},
    year = {1994},
    }
  • @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].},
    }
  • @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},
    booktitle = {Proceedings of ACM Symposium on Theory of Computing}
    }
  • @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].},
    }
  • @inproceedings{Golin94Prefix,
    title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
    author = {Mordecai Golin and Neal E. Young},
    year = {1994},
    pages = {605-617},
    booktitle = {Proceedings of International Colloquium on Automata, Languages, and Programming}
    }
  • @inproceedings{Khuller93Designing,
    title = {Designing Multi-Commodity Flow Trees},
    author = {Samir Khuller and Balaji Raghavachari and Neal E. Young},
    year = {1993},
    pages = {433-441},
    booktitle = {Proceedings of Workshop on Algorithms and Data Structures}
    }
  • @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},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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},
    booktitle = {Proceedings of Integer Programming and Combinatorial Optimization}
    }
  • @inproceedings{Young91Online,
    title = {On-Line Caching as Cache Size Varies},
    author = {Neal E. Young},
    year = {1991},
    pages = {241-250},
    booktitle = {Proceedings of ACM-SIAM Symposium on Discrete Algorithms}
    }
  • @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},
    }
  • @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{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},
    }