Neal E. Young

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
93On a linear program for minimum-weight triangulation. Arman Yousefi, Neal E. Young. SODA 2012, 811-823. Web SearchBibTeXDownload
2011
92On a Linear Program for Minimum-Weight Triangulation. Arman Yousefi, Neal E. Young. CoRR (abs/1111.5305) (2011). Web SearchBibTeXDownload
91Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young. Dagstuhl Reports (1): 67-93 (2011). Web SearchBibTeXDownload
90Distributed algorithms for covering, packing and maximum weighted matching. Christos Koufogiannakis, Neal E. Young. Distributed Computing (24): 45-63 (2011). Web SearchBibTeXDownload
2010
89A Bound on the Sum of Weighted Pairwise Distances of Points Constrained to Balls. Neal E. Young. CoRR (abs/1007.0217) (2010). Web SearchBibTeXDownload
2009
88Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. Christos Koufogiannakis, Neal E. Young. DISC 2009, 221-238. Web SearchBibTeXDownload
87Greedy D{\\ensuremath{\\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Christos Koufogiannakis, Neal E. Young. ICALP (1) 2009, 634-652. Web SearchBibTeXDownload
86Topology Management in Directional Antenna-Equipped Ad Hoc Networks. Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, Neal E. Young. IEEE Trans. Mob. Comput. (8): 590-605 (2009). Cited by 1Web SearchBibTeXDownload
85Distributed and parallel algorithms for weighted vertex cover and other covering problems. Christos Koufogiannakis, Neal E. Young. PODC 2009, 171-179. Web SearchBibTeXDownload
2008
84Incremental Medians via Online Bidding. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young. Algorithmica (50): 455-478 (2008). Web SearchBibTeXDownload
83Flooding Overcomes Small Covering Constraints. Christos Koufogiannakis, Neal E. Young. CoRR (abs/0807.0644) (2008). Web SearchBibTeXDownload
82Beating Simplex for Fractional Packing and Covering Linear Programs. Christos Koufogiannakis, Neal E. Young. CoRR (abs/0801.1987) (2008). Web SearchBibTeXDownload
81Greedy Set-Cover Algorithms. Neal E. Young. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
80Online Paging and Caching. Neal E. Young. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
2007
79Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. Qi Fu, Elizabeth Bent, James Borneman, Marek Chrobak, Neal E. Young. APBC 2007, 17-26. Web SearchBibTeXDownload
78Beating Simplex for Fractional Packing and Covering Linear Programs. Christos Koufogiannakis, Neal E. Young. FOCS 2007, 494-504. Web SearchBibTeXDownload
77Parsimonious Explanations of Change in Hierarchical Data. Dhiman Barman, Flip Korn, Divesh Srivastava, Dimitrios Gunopulos, Neal E. Young, Deepak Agarwal. ICDE 2007, 1273-1275. Web SearchBibTeXDownload
76Efficient and effective explanation of change in hierarchical summaries. Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos, Neal E. Young, Flip Korn, Divesh Srivastava. KDD 2007, 6-15. Cited by 7Web SearchBibTeXDownload
2006
75The reverse greedy algorithm for the metric k-median problem. Marek Chrobak, Claire Kenyon, Neal E. Young. Inf. Process. Lett. (97): 68-72 (2006). Web SearchBibTeXDownload
74Oblivious Medians Via Online Bidding. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young. LATIN 2006, 311-322. Web SearchBibTeXDownload
73An 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. MASS 2006, 139-149. Web SearchBibTeXDownload
2005
72The Reverse Greedy Algorithm for the Metric K-Median Problem. Marek Chrobak, Claire Kenyon, Neal E. Young. COCOON 2005, 654-660. Web SearchBibTeXDownload
71The reverse greedy algorithm for the metric k-median problem. Marek Chrobak, Claire Kenyon, Neal E. Young. CoRR (abs/cs/0504104) (2005). Web SearchBibTeXDownload
70Oblivious Medians via Online Bidding. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young. CoRR (abs/cs/0504103) (2005). Web SearchBibTeXDownload
69Approximation algorithms for covering/packing integer programs. Stavros G. Kolliopoulos, Neal E. Young. J. Comput. Syst. Sci. (71): 495-505 (2005). Web SearchBibTeXDownload
2004
68Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. Math. Oper. Res. (29): 436-461 (2004). Web SearchBibTeXDownload
2002
67On-Line File Caching. Neal E. Young. Algorithmica (33): 371-383 (2002). Web SearchBibTeXDownload
66A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover. Samir Khuller, Uzi Vishkin, Neal E. Young. CoRR (cs.DS/0205037) (2002). Web SearchBibTeXDownload
65Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. CoRR (cs.DS/0205051) (2002). Web SearchBibTeXDownload
64Simple Strategies for Large Zero-Sum Games with Applications to Complexity Theory. Richard J. Lipton, Neal E. Young. CoRR (cs.CC/0205035) (2002). Web SearchBibTeXDownload
63Lecture Notes on Evasiveness of Graph Properties. László Lovász, Neal E. Young. CoRR (cs.CC/0205031) (2002). Web SearchBibTeXDownload
62Prefix Codes: Equiprobable Words, Unequal Letter Costs. Mordecai J. Golin, Neal E. Young. CoRR (cs.DS/0205049) (2002). Web SearchBibTeXDownload
61Randomized Rounding without Solving the Linear Program. Neal E. Young. CoRR (cs.DS/0205036) (2002). Web SearchBibTeXDownload
60Designing Multi-Commodity Flow Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. CoRR (cs.DS/0205077) (2002). Web SearchBibTeXDownload
59A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. CoRR (cs.DS/0205050) (2002). Web SearchBibTeXDownload
58Sequential and Parallel Algorithms for Mixed Packing and Covering. Neal E. Young. CoRR (cs.DS/0205039) (2002). Web SearchBibTeXDownload
57On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. Philip N. Klein, Neal E. Young. CoRR (cs.DS/0205046) (2002). Web SearchBibTeXDownload
56Competitive Paging Algorithms. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. CoRR (cs.DS/0205038) (2002). Web SearchBibTeXDownload
55On Strongly Connected Digraphs with Bounded Cycle Length. Samir Khuller, Balaji Raghavachari, Neal E. Young. CoRR (cs.DS/0205011) (2002). Web SearchBibTeXDownload
54Low-Degree Spanning Trees of Small Weight. Samir Khuller, Balaji Raghavachari, Neal E. Young. CoRR (cs.DS/0205043) (2002). Web SearchBibTeXDownload
53The K-Server Dual and Loose Competitiveness for Paging. Neal E. Young. CoRR (cs.DS/0205044) (2002). Web SearchBibTeXDownload
52Balancing Minimum Spanning and Shortest Path Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. CoRR (cs.DS/0205045) (2002). Web SearchBibTeXDownload
51Faster Parametric Shortest Path and Minimum Balance Algorithms. Neal E. Young, Robert Endre Tarjan, James B. Orlin. CoRR (cs.DS/0205041) (2002). Web SearchBibTeXDownload
50Improved Bicriteria Existence Theorems for Scheduling. Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young. CoRR (cs.DS/0205008) (2002). Web SearchBibTeXDownload
49Approximating the Minimum Equivalent Digraph. Samir Khuller, Balaji Raghavachari, Michael R. Fellows. CoRR (cs.DS/0205040) (2002). Web SearchBibTeXDownload
48Polynomial-Time Approximation Scheme for Data Broadcast. Claire Kenyon, Nicolas Schabanel, Neal E. Young. CoRR (cs.DS/0205012) (2002). Web SearchBibTeXDownload
47Tight Approximation Results for General Covering Integer Programs. Stavros G. Kolliopoulos, Neal E. Young. CoRR (cs.DS/0205030) (2002). Web SearchBibTeXDownload
46A Codebook Generation Algorithm for Document Image Compression. Qin Zhang, John M. Danskin, Neal E. Young. CoRR (cs.DS/0205029) (2002). Web SearchBibTeXDownload
45On-Line Paging against Adversarially Biased Random Inputs. Neal E. Young. CoRR (cs.DS/0205007) (2002). Web SearchBibTeXDownload
44Orienting Graphs to Optimize Reachability. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young. CoRR (cs.DS/0205042) (2002). Web SearchBibTeXDownload
43K-Medians, Facility Location, and the Chernoff-Wald Bound. Neal E. Young. CoRR (cs.DS/0205047) (2002). Web SearchBibTeXDownload
42Huffman Coding with Unequal Letter Costs. Mordecai J. Golin, Claire Kenyon, Neal E. Young. CoRR (cs.DS/0205048) (2002). Web SearchBibTeXDownload
41Data-Collection for the Sloan Digital Sky Survey: a Network-Flow Heuristic. Robert Lupton, F. Miller Maley, Neal E. Young. CoRR (cs.DS/0205034) (2002). Web SearchBibTeXDownload
40Approximate Data Structures with Applications. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young. CoRR (cs.DS/0205010) (2002). Cited by 20Web SearchBibTeXDownload
39On-Line End-to-End Congestion Control. Naveen Garg, Neal E. Young. FOCS 2002, 303-312. Web SearchBibTeXDownload
38Huffman coding with unequal letter costs. Mordecai J. Golin, Claire Kenyon, Neal E. Young. STOC 2002, 785-791. Web SearchBibTeXDownload
2001
37Tight Approximation Results for General Covering Integer Programs. Stavros G. Kolliopoulos, Neal E. Young. FOCS 2001, 522-528. Web SearchBibTeXDownload
36Sequential and Parallel Algorithms for Mixed Packing and Covering. Neal E. Young. FOCS 2001, 538-546. Web SearchBibTeXDownload
2000
35On-Line Paging Against Adversarially Biased Random Inputs. Neal E. Young. J. Algorithms (37): 218-235 (2000). Web SearchBibTeXDownload
34K-medians, facility location, and the Chernoff-Wald bound. Neal E. Young. SODA 2000, 86-95. Web SearchBibTeXDownload
33Polynomial-time approximation scheme for data broadcast. Claire Kenyon, Nicolas Schabanel, Neal E. Young. STOC 2000, 659-666. Web SearchBibTeXDownload
1999
32On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms. Philip N. Klein, Neal E. Young. IPCO 1999, 320-327. Web SearchBibTeXDownload
31Review of Online Computation and Competitive Analysis by Allan Borodin and Ran EI-Yaniv. Neal E. Young. SIGACT News (30): 13-17 (1999). Web SearchBibTeXDownload
30Improved Bicriteria Existence Theorems for Scheduling. Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young. SODA 1999, 846-847. Web SearchBibTeXDownload
29Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. STOC 1999, 668-678. Web SearchBibTeXDownload
1998
28Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. Robert Lupton, F. Miller Maley, Neal E. Young. J. Algorithms (27): 339-356 (1998). Web SearchBibTeXDownload
27On-Line File Caching. Neal E. Young. SODA 1998, 82-86. Web SearchBibTeXDownload
26Bounding the Diffuse Adversary. Neal E. Young. SODA 1998, 420-425. Web SearchBibTeXDownload
1997
25A Codebook Generation Algorithm for Document Image Compression. Qin Zhang, John M. Danskin, Neal E. Young. Data Compression Conference 1997, 300-309. Web SearchBibTeXDownload
24Orienting Graphs to Optimize Reachability. S. Louis Hakimi, Edward F. Schmeichel, Neal E. Young. Inf. Process. Lett. (63): 229-235 (1997). Web SearchBibTeXDownload
23A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. J. Algorithms (24): 310-324 (1997). Web SearchBibTeXDownload
1996
22On Strongly Connected Digraphs with Bounded Cycle Length. Samir Khuller, Balaji Raghavachari, Neal E. Young. Discrete Applied Mathematics (69): 281-289 (1996). Web SearchBibTeXDownload
21A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. IPCO 1996, 105-117. Web SearchBibTeXDownload
20A New Operation on Sequences: The Boustrophedon Transform. Jessica Millar, N. J. A. Sloane, Neal E. Young. J. Comb. Theory, Ser. A (76): 44-54 (1996). Web SearchBibTeXDownload
19Low-Degree Spanning Trees of Small Weight. Samir Khuller, Balaji Raghavachari, Neal E. Young. SIAM J. Comput. (25): 355-368 (1996). Web SearchBibTeXDownload
18Prefix Codes: Equiprobable Words, Unequal Letter Costs. Mordecai J. Golin, Neal E. Young. SIAM J. Comput. (25): 1281-1292 (1996). Web SearchBibTeXDownload
17Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. Robert Lupton, F. Miller Maley, Neal E. Young. SODA 1996, 296-303. Web SearchBibTeXDownload
1995
16Balancing Minimum Spanning Trees and Shortest-Path Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. Algorithmica (14): 305-321 (1995). Web SearchBibTeXDownload
15Approximating the Minimum Equivalent Digraph. Samir Khuller, Balaji Raghavachari, Michael R. Fellows. SIAM J. Comput. (24): 859-872 (1995). Web SearchBibTeXDownload
14Randomized Rounding Without Solving the Linear Program. Neal E. Young. SODA 1995, 170-178. Web SearchBibTeXDownload
1994
13The k-Server Dual and Loose Competitiveness for Paging. Neal E. Young. Algorithmica (11): 525-541 (1994). Web SearchBibTeXDownload
12Prefix Codes: Equiprobable Words, Unequal Letter Costs. Mordecai J. Golin, Neal E. Young. ICALP 1994, 605-617. Web SearchBibTeXDownload
11Designing Multi-Commodity Flow Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. Inf. Process. Lett. (50): 49-55 (1994). Web SearchBibTeXDownload
10A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. Samir Khuller, Uzi Vishkin, Neal E. Young. J. Algorithms (17): 280-289 (1994). Web SearchBibTeXDownload
9Approximate Data Structures with Applications. Yossi Matias, Jeffrey Scott Vitter, Neal E. Young. SODA 1994, 187-194. Cited by 20Web SearchBibTeXDownload
8Approximating the Minimum Equivalent Diagraph. Samir Khuller, Balaji Raghavachari, Neal E. Young. SODA 1994, 177-186. Web SearchBibTeXDownload
7Simple strategies for large zero-sum games with applications to complexity theory. Richard J. Lipton, Neal E. Young. STOC 1994, 734-740. Web SearchBibTeXDownload
6Low degree spanning trees of small weight. Samir Khuller, Balaji Raghavachari, Neal E. Young. STOC 1994, 412-421. Web SearchBibTeXDownload
1993
5A primal-dual parallel approximation technique applied to weighted set and vertex cover. Samir Khuller, Uzi Vishkin, Neal E. Young. IPCO 1993, 333-341. Web SearchBibTeX
4Balancing Minimum Spanning and Shortest Path Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. SODA 1993, 243-250. Web SearchBibTeXDownload
3Designing Multi-Commodity Flow Trees. Samir Khuller, Balaji Raghavachari, Neal E. Young. WADS 1993, 433-441. Web SearchBibTeXDownload
1991
2Competitive Paging Algorithms. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young. J. Algorithms (12): 685-699 (1991). Web SearchBibTeXDownload
1On-Line Caching as Cache Size Varies. Neal E. Young. SODA 1991, 241-250. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research