引用次数
引用: 3,710
H-指数: 35
I10-指数 : 84
出版物: 150
Signature Theory in Holographic Algorithms
CaiJin-Yi , LuPinyan
Algorithmica
2011
Worst-Case Nash Equilibria in Restricted Routing
Pin-Yan Lu , Chang-Yuan Yu
Journal of Computer Science and Technology 27 ( 4) 710 -717
8
2012
Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers
Sungjin Im , Pin-Yan Lu , Ya-Jun Wang
Journal of Computer Science and Technology 27 ( 4) 702 -709
6
2012
3.18 Holant Problems: CSPs Where Each Variable Appears Exactly Twice
Pin-Yan Lu
The Constraint Satisfaction Problem: Complexity and Approximability 14 -14
2013
受限路由中的最坏均衡
Pin-Yan Lu
计算机科学技术学报 27 ( 4) 710 -717
2012
普适供应限制下的对于单元消费者的非羡慕定价策略
Sungjin Im , Pin-Yan Lu
计算机科学技术学报 27 ( 4) 702 -709
2012
PACE Solver Description: Hust-Solver-A Heuristic Algorithm of Directed Feedback Vertex Set Problem
YuMing Du , QingYun Zhang , JunZhou Xu , ShunGen Zhang
Smpte Journal
2022
PACE Solver Description: Hust-Solver-A Heuristic Algorithm of Directed Feedback Vertex Set Problem
YuMing Du , QingYun Zhang , JunZhou Xu , ShunGen Zhang
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
2022
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Akanksha Agrawal , Saket Saurabh , Meirav Zehavi , Sutanay Bhattacharjee
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH
2022
A simple FPTAS for counting edge covers
Pinyan Lu , Jingcheng Liu , Chengyu Lin
symposium on discrete algorithms 341 -348
28
2014
Approximate counting via correlation decay in spin systems
Pinyan Lu , Yitong Yin , Liang Li
symposium on discrete algorithms 922 -940
62
2012
Dichotomy for holant* problems with a function on domain size 3
Pinyan Lu , Jin-Yi Cai , Mingji Xia
symposium on discrete algorithms 1278 -1295
4
2013
Holographic algorithms with unsymmetric signatures
Pinyan Lu , Jin-Yi Cai
symposium on discrete algorithms 54 -63
9
2008
Dichotomy for Holant problems of Boolean domain
Pinyan Lu , Jin-Yi Cai , Mingji Xia
symposium on discrete algorithms 1714 -1728
42
2011
On the approximability of budget feasible mechanisms
Nick Gravin , Pinyan Lu , Ning Chen
symposium on discrete algorithms 685 -699
84
2011
Canonical paths for MCMC: from art to science
Pinyan Lu , Lingxiao Huang , Chihao Zhang
symposium on discrete algorithms 514 -527
7
2016
FPTAS for counting monotone CNF
Pinyan Lu , Jingcheng Liu
symposium on discrete algorithms 1531 -1548
22
2015
Computing the nucleolus of matching, cover and clique games
Pinyan Lu , Ning Chen , Hongyang Zhang
national conference on artificial intelligence 1319 -1325
20
2012
The Complexity of Weighted Boolean #CSP Modulo $k$
Pinyan Lu , Mingji Xia , Heng Guo , Sangxia Huang
symposium on theoretical aspects of computer science 9 249 -260
26
2011
The complexity of approximating conservative counting CSPs.
Colin McQuillan , Mark Jerrum , Pinyan Lu , Martin E. Dyer
symposium on theoretical aspects of computer science 159
3
2013