Neal E. Young

Cited by

	All	Since 2019
Citations	6501	1420
h-index	42	20
i10-index	61	38

340

170

255

1993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202427 36 42 57 78 79 110 113 128 146 169 254 241 275 283 276 257 248 230 222 236 245 307 262 297 330 268 273 255 259 218 147

Public access

View all

9 articles

0 articles

available

not available

Based on funding mandates

Co-authors

samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityVerified email at northwestern.edu
Marek ChrobakUniversity of California at RiversideVerified email at cs.ucr.edu
Philip KleinProfessor of Computer Science, Brown UniversityVerified email at brown.edu
Mordecai GolinProfessor: Department of Computer Science & Engineering, HKUSTVerified email at cse.ust.hk
Daniel SleatorProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Eamonn KeoghDistinguished Professor of Computer Science, University of California - RiversideVerified email at cs.ucr.edu
Abdullah MueenProfessor, Department of Computer Science, University of New MexicoVerified email at cs.unm.edu
Amos FiatProfessor of Computer Science, Tel Aviv UniversityVerified email at tau.ac.il
Michael LubyBitRipple and ICSIVerified email at bitripple.com
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Stavros KolliopoulosNational and Kapodistrian University of AthensVerified email at di.uoa.gr
Yossi MatiasGoogleVerified email at tau.ac.il
Srikanth KrishnamurthyUC RiversideVerified email at cs.ucr.edu
Gentian JakllariProfessor of Computer Science, Toulouse INP-ENSEEIHT, FranceVerified email at enseeiht.fr
Ece Gelal SoyakBahcesehir UniversityVerified email at bau.edu.tr
James B. OrlinProfessor, Massachusetts Institute of TechnologyVerified email at mit.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityVerified email at cs.princeton.edu
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
David KargerProfessor of Computer Science, MITVerified email at mit.edu
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk

Neal E. Young

University of California, Riverside

Verified email at ucr.edu - Homepage

approximation algorithms online algorithms algorithms combinatorial optimization theory of computation


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An efficient targeting strategy for multiobject spectrograph surveys: the Sloan Digital Sky Survey MR Blanton, H Lin, RH Lupton, FM Maley, NE Young, I Zehavi, J Loveday The Astronomical Journal 125, 2276, 2003	729	2003
Competitive paging algorithms A Fiat, RM Karp, M Luby, LA McGeoch, DD Sleator, NE Young Journal of Algorithms 12 (4), 685-699, 1991	604	1991
Logical-shapelets: an expressive primitive for time series classification A Mueen, E Keogh, NE Young Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011	441	2011
Balancing minimum spanning trees and shortest-path trees S Khuller, B Raghavachari, NE Young Algorithmica 14 (4), 305--321, 1995	409	1995
The k-server dual and loose competitiveness for paging NE Young Algorithmica 11 (6), 525-541, 1994	322	1994
Randomized rounding without solving the linear program NE Young Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms …, 1995	268*	1995
On-line file caching NE Young Algorithmica 33 (3), 371-383, 2002	261	2002
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjan, JB Orlin Networks 21 (2), 205-221, 1991	247	1991
Sequential and parallel algorithms for mixed packing and covering NE Young Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science …, 2001	241	2001
Rounding algorithms for a geometric embedding of minimum multiway cut DR Karger, P Klein, C Stein, M Thorup, NE Young Mathematics of Operations Research 29 (3), 436-461, 2004	205*	2004
On-line caching as cache size varies NE Young Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms …, 1991	155	1991
Approximating the minimum equivalent digraph S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 24 (4), 859-872, 1995	126	1995
A nearly linear-time PTAS for explicit fractional packing and covering linear programs C Koufogiannakis, NE Young Algorithmica 70 (4), 648–674, 2014	122	2014
Low degree spanning trees of small weight S Khuller, B Raghavachari, NE Young SIAM Journal on Computing 25 (2), 355-368, 1998	115*	1998
Simple strategies for large zero-sum games with applications to complexity theory RJ Lipton, NE Young Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994	111	1994
On the number of iterations for Dantzig--Wolfe optimization and packing-covering approximation algorithms P Klein, NE Young SIAM Journal on Computing 44 (4), 1154-1172, 2015	97*	2015
Approximation algorithms for covering/packing integer programs SG Kolliopoulos, NE Young Journal of Computer and System Sciences 71 (4), 495-505, 2005	95	2005
Polynomial-time approximation scheme for data broadcast C Kenyon, N Schabanel, NE Young Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000	84	2000
A primal-dual parallel approximation technique applied to weighted set and vertex covers S Khuller, U Vishkin, NE Young J. Algorithms 17 (2), 280-289, 1994	82	1994
The reverse greedy algorithm for the metric k-median problem M Chrobak, C Kenyon, NE Young Information Processing Letters 97 (2), 68-72, 2006	75	2006

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors