Jisu Jeong

Orcid: 0000-0003-3614-4199

According to our database1, Jisu Jeong authored at least 30 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Deformable Graph Transformer.
IEEE Trans. Pattern Anal. Mach. Intell., July, 2025

2024
Batch Transformer: Look for Attention in Batch.
CoRR, 2024

HyperCLOVA X Technical Report.
CoRR, 2024

Passive Clutch System for the Selection of Concentric and Eccentric Exercises.
IEEE Access, 2024

2023
Computing pivot-minors.
CoRR, 2023

Pivotal Role of Language Modeling in Recommender Systems: Enriching Task-specific and Task-agnostic Representation Learning.
Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2023

Scaling Law for Recommendation Models: Towards General-Purpose User Representations.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Relation-Aware Language-Graph Transformer for Question Answering.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Pivotal Role of Language Modeling in Recommender Systems: Enriching Task-specific and Task-agnostic Representation Learning.
CoRR, 2022

Meta-node: A Concise Approach to Effectively Learn Complex Relationships in Heterogeneous Graphs.
CoRR, 2022

A portable passive clutch system for selective upper extremity movements.
Proceedings of the 9th IEEE RAS/EMBS International Conference for Biomedical Robotics and Biomechatronics, 2022

2021
Tree Pivot-Minors and Linear Rank-Width.
SIAM J. Discret. Math., 2021

One4all User Representation for Recommender Systems in E-commerce.
CoRR, 2021

Learning Augmentation for GNNs With Consistency Regularization.
IEEE Access, 2021

Global-Local Item Embedding for Temporal Set Prediction.
Proceedings of the RecSys '21: Fifteenth ACM Conference on Recommender Systems, Amsterdam, The Netherlands, 27 September 2021, 2021

Metropolis-Hastings Data Augmentation for Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Intent-based Product Collections for E-commerce using Pretrained Language Models.
Proceedings of the 2021 International Conference on Data Mining, 2021

What Changes Can Large-scale Language Models Bring? Intensive Study on HyperCLOVA: Billions-scale Korean Generative Pretrained Transformers.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

2020
div2vec: Diversity-Emphasized Node Embedding.
Proceedings of the Workshops on Recommendation in Complex Scenarios and the Impact of Recommender Systems co-located with 14th ACM Conference on Recommender Systems (RecSys 2020), 2020

2019
Online Ramsey theory for a triangle on -free graphs.
J. Graph Theory, 2019

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs.
Discret. Appl. Math., 2019

2018
Characterizing graphs of maximum matching width at most 2.
Discret. Appl. Math., 2018

Computing Small Pivot-Minors.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Finding Branch-Decompositions of Matroids, Hypergraphs, and More.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable.
IEEE Trans. Inf. Theory, 2017

(1, <i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface.
J. Graph Theory, 2017

Computing the maximum matching width is NP-hard.
CoRR, 2017

2016
Constructive algorithm for path-width of matroids.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2013
Excluded vertex-minors for graphs of linear rank-width at most k.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013


  Loading...