Huiwen Yu

ScholarGPS® ID: 91029582619667

Affiliation

Pennsylvania State University, University Park, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Combinatorial Optimization

Metrics Summary

Publication Count

Predicted Citations

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Space Saving by Dynamic Algebraization Based on Tree-Depth (journal article) Fürer, Martin \| Yu, Huiwen Theory of Computing Systems, volume 61, issue 2, pages 283-304 (2017). 10.1007/s00224-017-9751-3 Cited by (5) \| Cite \| Source
Updating Graph Indices with a One-Pass Algorithm (conference) Yuan, Dayu \| Mitra, Prasenjit \| Yu, Huiwen \| Giles, C. Lee SIGMOD/PODS'15: International Conference on Management of Data (2015) Melbourne Victoria Australia 10.1145/2723372.2746482 Cited by (12) \| Cite \| Source
Approximating the $$k$$-Set Packing Problem by Local Improvements (book chapter) In Combinatorial Optimization Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-09174-7_35 Cited by (18) \| Cite \| Source
Space Saving by Dynamic Algebraization (book chapter) In Computer Science - Theory and Applications Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-06686-8_29 Cited by (1) \| Cite \| Source \| Open Access
Approximating the $$k$$ -Set Packing Problem by Local Improvements (book chapter) In Combinatorial Optimization Fürer, Martin \| Yu, Huiwen Springer International Publishing (2014) 10.1007/978-3-319-14115-2_35 Cited by (4) \| Cite \| Source
Iterative Graph Feature Mining for Graph Indexing (conference) Yuan, Dayu \| Mitra, Prasenjit \| Yu, Huiwen \| Giles, C. Lee 2012 IEEE International Conference on Data Engineering (ICDE 2012) (2012) Arlington, VA, USA 10.1109/ICDE.2012.11 Cited by (12) \| Cite \| Source \| Open Access
Packing-Based Approximation Algorithm for the k-Set Cover Problem (book chapter) In Algorithms and Computation Fürer, Martin \| Yu, Huiwen Springer Berlin Heidelberg (2011) 10.1007/978-3-642-25591-5_50 Cited by (3) \| Cite \| Source \| Open Access