| Tiling simply connected regions with rectangles I Pak, J Yang Journal of Combinatorial Theory, Series A 120 (7), 1804-1816, 2013 | 20 | 2013 |
| The complexity of generalized domino tilings I Pak, J Yang arXiv preprint arXiv:1305.2154, 2013 | 19 | 2013 |
| Vertex‐pancyclicity of hypertournaments J Yang Journal of Graph Theory 63 (4), 338-348, 2010 | 13 | 2010 |
| Geodesics on the regular tetrahedron and the cube D Davis, V Dods, C Traub, J Yang Discrete Mathematics 340 (1), 3183-3196, 2017 | 12 | 2017 |
| Rectangular tileability and complementary tileability are undecidable J Yang European Journal of Combinatorics 41, 20-34, 2014 | 9 | 2014 |
| Puzzles in K-homology of Grassmannians P Pylyavskyy, J Yang Pacific Journal of Mathematics 303 (2), 703-727, 2020 | 6 | 2020 |
| Antibiotics time machines are hard to build NM Tran, J Yang Notices of the AMS 64 (10), 1136-1140, 2017 | 5* | 2017 |
| Computational complexity and decidability of tileability JCC Yang University of California, Los Angeles, 2013 | 5 | 2013 |
| Scalable global power management policy based on combinatorial optimization for multiprocessors GY Pan, J Yang, JY Jou, BCC Lai ACM Transactions on Embedded Computing Systems (TECS) 14 (4), 1-24, 2015 | 4 | 2015 |
| Some NP-complete edge packing and partitioning problems in planar graphs J Yang Communications on Number Theory and Combinatorial Theory 3 (1), 2, 2022 | 2* | 2022 |
| ON COLORING CLAW-FREE GRAPHS JED YANG | | 2007 |
Igor PakDepartment of Mathematics, UCLAVerified email at math.ucla.edu
