Skip to content

add icml article #40

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
buchuitoudegou merged 1 commit into from
Jun 11, 2026
Merged

add icml article #40

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
80 changes: 53 additions & 27 deletions src/components/Publication/pub_data.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2156,12 +2156,14 @@
"isJournal": false
},
{
"title": "Modality-free Graph In-context Alignment.",
"title": "Near-Optimality for Single-Source Personalized PageRank.",
"authors": [
"Wei Zhuo",
"Siqiang Luo"
"Xinpeng Jiang*",
"Haoyu Liu*",
"Siqiang Luo*",
"Xiaokui Xiao* (* Order Alphabetically)"
],
"conference": "ICLR (Oral)",
"conference": "PODS",
"year": 2026,
"video": "",
"href": "",
Expand All @@ -2182,24 +2184,23 @@
"isJournal": false
},
{
"title": "Near-Optimality for Single-Source Personalized PageRank.",
"title": "Are Learned DBMS Components Robust to Workload Drift?",
"authors": [
"Xinpeng Jiang*",
"Haoyu Liu*",
"Siqiang Luo*",
"Xiaokui Xiao* (* Order Alphabetically)"
"Zizhong Meng",
"Gao Cong",
"Siqiang Luo"
],
"conference": "PODS",
"conference": "SIGMOD",
"year": 2026,
"video": "",
"href": "",
"description": "",
"imgSrc": "",
"keywords": [
"Graph Algorithms"
"Data Systems"
],
"subKeywords": [
"Graph Theory"
"Application Specialized"
],
"id": 76,
"isExtension": false,
Expand All @@ -2210,23 +2211,25 @@
"isJournal": false
},
{
"title": "Are Learned DBMS Components Robust to Workload Drift?",
"title": "DIFFCOM: Conditional Discrete Diffusion Model for Community Search.",
"authors": [
"Zizhong Meng",
"Gao Cong",
"Siqiang Luo"
"Ling Li",
"Liang Bai",
"Siqiang Luo",
"Yejiang Wang",
"Yuhai Zhao"
],
"conference": "SIGMOD",
"conference": "ICDE",
"year": 2026,
"video": "",
"href": "",
"description": "",
"imgSrc": "",
"keywords": [
"Data Systems"
"Graph Algorithms"
],
"subKeywords": [
"Application Specialized"
"Graph Data Analytics"
],
"id": 77,
"isExtension": false,
Expand All @@ -2237,15 +2240,12 @@
"isJournal": false
},
{
"title": "DIFFCOM: Conditional Discrete Diffusion Model for Community Search.",
"title": "Modality-free Graph In-context Alignment.",
"authors": [
"Ling Li",
"Liang Bai",
"Siqiang Luo",
"Yejiang Wang",
"Yuhai Zhao"
"Wei Zhuo",
"Siqiang Luo"
],
"conference": "ICDE",
"conference": "ICLR (Oral)",
"year": 2026,
"video": "",
"href": "",
Expand All @@ -2255,7 +2255,7 @@
"Graph Algorithms"
],
"subKeywords": [
"Graph Data Analytics"
"Graph Theory"
],
"id": 78,
"isExtension": false,
Expand All @@ -2264,5 +2264,31 @@
"code": "",
"confExtra": "",
"isJournal": false
},
{
"title": "What Makes a Desired Graph for Relational Deep Learning?",
"authors": [
"Cheng Yao",
"Siqiang Luo"
],
"conference": "ICML",
"year": 2026,
"video": "",
"href": "",
"description": "",
"imgSrc": "",
"keywords": [
"Graph Algorithms"
],
"subKeywords": [
"Graph Data Analytics"
],
"id": 79,
"isExtension": false,
"hasExtension": -1,
"isVisible": true,
"code": "",
"confExtra": "",
"isJournal": false
}
]
Loading