| 2008 |
|---|
| 35 | EE | Mathieu Liedloff,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Efficient algorithms for Roman domination on some classes of graphs.
Discrete Applied Mathematics 156(18): 3400-3415 (2008) |
| 34 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Partitioned probe comparability graphs.
Theor. Comput. Sci. 396(1-3): 212-222 (2008) |
| 2007 |
|---|
| 33 | EE | Yong Liang,
Jiping Liu,
Yanling Li,
Chengming Zhang,
Mingwen Ma:
Study on the Application of Digital Irrigation Area System.
CCTA 2007: 205-214 |
| 32 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu,
Chak-Chung Cheung:
The exact channel density and compound design for generic universal switch blocks.
ACM Trans. Design Autom. Electr. Syst. 12(2): (2007) |
| 31 | EE | Jiping Liu,
Yuejian Peng,
Cheng Zhao:
Characterization of P6-free graphs.
Discrete Applied Mathematics 155(8): 1038-1043 (2007) |
| 2006 |
|---|
| 30 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
AAIM 2006: 267-278 |
| 29 | EE | David B. Chandler,
Maw-Shang Chang,
Antonius J. J. Kloks,
Jiping Liu,
Sheng-Lung Peng:
On Probe Permutation Graphs.
TAMC 2006: 494-504 |
| 28 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Partitioned Probe Comparability Graphs.
WG 2006: 179-190 |
| 27 | EE | Ton Kloks,
Dieter Kratsch,
Chuan-Min Lee,
Jiping Liu:
Improved bottleneck domination algorithms.
Discrete Applied Mathematics 154(11): 1578-1592 (2006) |
| 26 | EE | Hongbing Fan,
Yu-Liang Wu,
Ray Chak-Chung Cheung,
Jiping Liu:
Decomposition Design Theory and Methodology for Arbitrary-Shaped Switch Boxes.
IEEE Trans. Computers 55(4): 373-384 (2006) |
| 2005 |
|---|
| 25 | EE | Maw-Shang Chang,
Ton Kloks,
Dieter Kratsch,
Jiping Liu,
Sheng-Lung Peng:
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
COCOON 2005: 808-817 |
| 24 | EE | Gerard Jennhwa Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
The PIGs Full Monty - A Floor Show of Minimal Separators.
STACS 2005: 521-532 |
| 23 | EE | Mathieu Liedloff,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Roman Domination over Some Graph Classes.
WG 2005: 103-114 |
| 22 | EE | Jiping Liu:
A characterization of pancyclic complements of line graphs.
Discrete Mathematics 299(1-3): 172-179 (2005) |
| 2004 |
|---|
| 21 | EE | Min Peng,
Yanxiang He,
Jiping Liu:
The Application of Multi-Agent and CORBA in Mobile-GPS System.
CIT 2004: 503-508 |
| 20 | EE | Jiping Liu,
Yanxiang He,
Min Peng:
NewsBR: A Content-Based News Video Browsing and Retrieval System.
CIT 2004: 857-862 |
| 19 | EE | Hongbing Fan,
Yu-Liang Wu,
Chak-Chung Cheung,
Jiping Liu:
On Optimal Irregular Switch Box Designs.
FPL 2004: 189-199 |
| 18 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu:
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.
J. Inf. Sci. Eng. 20(2): 207-217 (2004) |
| 2003 |
|---|
| 17 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu,
Haiko Müller:
On the Recognition of General Partition Graphs.
WG 2003: 273-283 |
| 16 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu:
General Models and a Reduction Design Technique for FPGA Switch Box Designs.
IEEE Trans. Computers 52(1): 21-30 (2003) |
| 15 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu,
Chak-Chung Cheung:
On optimal hyperuniversal and rearrangeable switch box designs.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(12): 1637-1649 (2003) |
| 2002 |
|---|
| 14 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu,
Chak-Chung Cheung:
On Optimum Designs of Universal Switch Blocks.
FPL 2002: 142-151 |
| 13 | EE | Ton Kloks,
Chuan-Min Lee,
Jiping Liu:
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.
WG 2002: 282-295 |
| 12 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu,
C. K. Wong:
Reduction design for generic universal switch blocks.
ACM Trans. Design Autom. Electr. Syst. 7(4): 526-546 (2002) |
| 11 | | Dave Cowan,
Jiping Liu:
Subgraphs orthogonal to a 1-factorization of complete bipartite graphs.
Ars Comb. 62: (2002) |
| 2001 |
|---|
| 10 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu:
Combinatorial routing analysis and design of universal switch blocks.
ASP-DAC 2001: 641-644 |
| 9 | EE | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu,
Chak-Chung Cheung:
On Optimum Switch Box Designs for 2-D FPGAs.
DAC 2001: 203-208 |
| 2000 |
|---|
| 8 | | Hongbing Fan,
Jiping Liu,
Yu-Liang Wu:
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs.
ICCAD 2000: 93-98 |
| 7 | EE | George He,
Jiping Liu,
Cheng Zhao:
Approximation Algorithms for Some Graph Partitioning Problems.
J. Graph Algorithms Appl. 4(2): (2000) |
| 1998 |
|---|
| 6 | | Jiping Liu,
Huishan Zhou:
Edge k-to-1 Homomorphisms.
Ars Comb. 48: (1998) |
| 5 | EE | Katherine Heinrich,
Jiping Liu,
Cun-Quan Zhang:
Triangle-Free Circuit Decompositions and Petersen Minor.
J. Comb. Theory, Ser. B 72(2): 197-207 (1998) |
| 1997 |
|---|
| 4 | EE | Jiping Liu,
Huishan Zhou:
Maximum induced matchings in graphs.
Discrete Mathematics 170(1-3): 277-281 (1997) |
| 1996 |
|---|
| 3 | EE | Jiping Liu,
Cheng Zhao:
A new bound on the feedback vertex sets in cubic graphs.
Discrete Mathematics 148(1-3): 119-131 (1996) |
| 1994 |
|---|
| 2 | EE | Jiping Liu,
Huishan Zhou:
Graphs and digraphs with given girth and connectivity.
Discrete Mathematics 132(1-3): 387-390 (1994) |
| 1 | EE | Jiping Liu,
Huishan Zhou:
Dominating subgraphs in graphs with some forbidden structures.
Discrete Mathematics 135(1-3): 163-168 (1994) |
