无 杰 韩 的照片

查看 Scopus 资料

韩 杰

根据储存在 Pure 的刊物以及来自 Scopus 的引用文献数量计算
20132024

每年的科研成果

过滤
会议稿件

搜索结果

  • 2022

    The Decision Problem for Perfect Matchings in Dense Hypergraphs

    Gan, L. & Han, J., 1 7月 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (编辑). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 64. (Leibniz International Proceedings in Informatics, LIPIcs; 卷 229).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

  • 2021

    Non-linear Hamilton cycles in linear quasi-random hypergraphs

    Han, J., Shu, X. & Wang, G., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (编辑). Association for Computing Machinery, 页码 74-88 15 页码 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

    2 引用 （Scopus）
  • 2020

    Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs

    Hàn, H., Han, J. & Morris, P., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (编辑). Association for Computing Machinery, 页码 702-717 16 页码 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; 卷 2020-January).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

    5 引用 （Scopus）

  • Finding perfect matchings in dense hypergraphs

    Han, J. & Keevash, P., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (编辑). Association for Computing Machinery, 页码 2366-2377 12 页码 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; 卷 2020-January).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

    4 引用 （Scopus）
  • 2018

    Property testing for point sets on the plane

    Han, J., Kohayakawa, Y., Sales, M. T. & Stagni, H., 2018, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Mosteiro, M. A., Bender, M. A. & Farach-Colton, M. (编辑). Springer Verlag, 页码 584-596 13 页码 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 10807 LNCS).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

    2 引用 （Scopus）
  • 2017

    The complexity of perfect packings in dense graphs

    Han, J., 2017, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. Jager, G., Steila, S. & Gopal, T. V. (编辑). Springer Verlag, 页码 289-303 15 页码 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 10185 LNCS).

    科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

    2 引用 （Scopus）