|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 17 occurrences of 15 keywords
|
|
|
|
|
Results
Found 45 publication records. Showing 45 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ge Xia, Yong Zhang |
Kernelization for cycle transversal problems.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Yong Zhang |
On the small cycle transversal of planar graphs. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang |
Separability and topology control of quasi unit disk graphs. |
Wireless Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ge Xia |
What makes normalized weighted satisfiability tractable |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ge Xia |
The Stretch Factor of the Delaunay Triangulation Is Less Than 1.998 |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shiliang Cui, Iyad A. Kanj, Ge Xia |
On the stretch factor of Delaunay triangulations of points in convex position. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia |
On the induced matching problem. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia |
Improved upper bound on the stretch factor of delaunay triangulations. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Liang Zhang |
Toward the Tight Bound of the Stretch Factor of Delaunay Triangulations. |
CCCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
Improved upper bounds for vertex cover. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
On Spanners and Lightweight Spanners of Geometric Graphs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Yong Zhang |
On the Small Cycle Transversal of Planar Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Yong Zhang |
Kernelization for Cycle Transversal Problems. |
AAIM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ge Xia |
Improved Local Algorithms for Spanner Construction. |
ALGOSENSORS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
On the pseudo-achromatic number problem. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
On parameterized exponential time complexity. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. |
IEEE Trans. Mob. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
On Parameterized Exponential Time Complexity. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ge Xia, Fenghui Zhang |
Local Construction of Spanners in the 3-D Space. |
DCOSS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiliang Cui, Iyad A. Kanj, Ge Xia |
On the Dilation of Delaunay Triangulations of Points in Convex Position. |
CCCG |
2009 |
DBLP BibTeX RDF |
|
| 1 | Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia |
Seeing the trees and their branches in the network is hard. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Luay Nakhleh, Ge Xia |
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Parameterized algorithms and complexity, Linguistics, Phylogenetic networks |
| 1 | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
On the Pseudo-achromatic Number Problem. |
WG |
2008 |
DBLP DOI BibTeX RDF |
pseudo-achromatic number, kernel, fixed-parameter tractability, parameterized complexity |
| 1 | Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer |
On the Induced Matching Problem. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
Computing Lightweight Spanners Locally. |
DISC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Polynomial time approximation schemes and parameterized complexity. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia |
Genus characterizes the complexity of certain graph problems: Some tight results. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia |
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia |
Seeing the Trees and Their Branches in the Forest is Hard. |
ICTCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang |
Separability and Topology Control of Quasi Unit Disk Graphs. |
INFOCOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. |
DIALM-POMC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
On the computational hardness based on linear FPT-reductions. |
J. Comb. Optim. |
2006 |
DBLP DOI BibTeX RDF |
FPT-reduction, Complexity, Linear, Hardness |
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Strong computational lower bounds via parameterized complexity. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
Improved Parameterized Upper Bounds for Vertex Cover. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
On the Effective Enumerability of NP Problems. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Luay Nakhleh, Ge Xia |
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Exact algorithm, Independent set, Vertex cover, Parameterized algorithm |
| 1 | Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia |
Tight lower bounds for certain parameterized NP-hard problems. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia |
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
Kernelization, parameterized complexity |
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Polynomial Time Approximation Schemes and Parameterized Complexity. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia |
Tight Lower Bounds for Certain Parameterized NP-Hard Problems. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia |
Linear FPT reductions and computational lower bounds. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
lower bound, complexity theory, NP-hard problems |
| 1 | Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia |
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Ge Xia |
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #45 of 45 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")