dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Qi Ge Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Daniel Stefankovic: The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica 63(3): 588-601 (2012)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Liang Xiao, Jun Zhang, Zhihui Wei: An improved region-based model with local statistical features for image segmentation. Pattern Recognition 45(4): 1578-1590 (2012)
2011
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang: Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, He Wu, Ya-feng Gong, Jia-ping Zhang: Research on the failure process and mechanism of soil slope in seasonal frozen regions based on numerical simulation. EMEIT 2011: 1424-1427
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Zhihui Wei, Liang Xiao, Jun Zhang: An improved region-based model with local statistical feature. ICIP 2011: 3341-3344
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang: Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model CoRR abs/1105.5131: (2011)
2010
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Daniel Stefankovic: A graph polynomial for independent sets of bipartite graphs. FSTTCS 2010: 240-250
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Daniel Stefankovic: The Complexity of Counting Eulerian Tours in 4-Regular Graphs. LATIN 2010: 638-649
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Daniel Stefankovic: The Complexity of Counting Eulerian Tours in 4-Regular Graphs CoRR abs/1009.5019: (2010)
2009
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Daniel Stefankovic: A graph polynomial for independent sets of bipartite graphs CoRR abs/0911.4732: (2009)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf Fleischer, Qi Ge, Jian Li, Hong Zhu: Efficient Algorithms for k -Disjoint Paths Problems on DAGs. AAIM 2007: 134-143
2006
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Ge, Haitao Wang, Hong Zhu: An Improved Algorithm for Finding the Closest Pair of Points. J. Comput. Sci. Technol. 21(1): 27-31 (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu: Approximating the minimum weight weak vertex cover. Theor. Comput. Sci. 363(1): 99-105 (2006)
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang: Approximating Spanning Trees with Inner Nodes Cost. PDCAT 2005: 660-664

Coauthor Index

1Rudolf Fleischer [1] [2] [4]
2Andreas Galanis [9] [12]
3Ya-feng Gong [11]
4Tao Jiang [2]
5Jian Li [1] [4]
6Daniel Stefankovic [5] [6] [7] [8] [9] [12] [14]
7Shijun Tian [1]
8Eric Vigoda [9] [12]
9Haitao Wang [1] [3]
10Zhihui Wei [10] [13]
11He Wu [11]
12Liang Xiao [10] [13]
13Linji Yang [9] [12]
14Jia-ping Zhang [11]
15Jun Zhang [10] [13]
16Yong Zhang [2]
17Hong Zhu [2] [3] [4]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page