|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 14 publication records. Showing 14 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Qi Ge, Daniel Stefankovic |
The Complexity of Counting Eulerian Tours in 4-regular Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Liang Xiao, Jun Zhang, Zhihui Wei |
An improved region-based model with local statistical features for image segmentation. |
Pattern Recognition |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang |
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Qi Ge, Zhihui Wei, Liang Xiao, Jun Zhang |
An improved region-based model with local statistical feature. |
ICIP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang |
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Daniel Stefankovic |
The Complexity of Counting Eulerian Tours in 4-Regular Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Qi Ge, Daniel Stefankovic |
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Daniel Stefankovic |
A graph polynomial for independent sets of bipartite graphs. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Daniel Stefankovic |
A graph polynomial for independent sets of bipartite graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu |
Efficient Algorithms for k -Disjoint Paths Problems on DAGs. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu |
Approximating the minimum weight weak vertex cover. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Haitao Wang, Hong Zhu |
An Improved Algorithm for Finding the Closest Pair of Points. |
J. Comput. Sci. Technol. |
2006 |
DBLP DOI BibTeX RDF |
Shamos and Hoey algorithm, closest pair of points, complexity, divide and conquer |
| 1 | Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang |
Approximating Spanning Trees with Inner Nodes Cost. |
PDCAT |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #14 of 14 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")