| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local algorithms for edge colorings in UDGs.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann |
Editing Graphs into Disjoint Unions of Dense Clusters. |
Algorithmica |
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 | 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 | Iyad A. Kanj, Fenghui Zhang |
On the Independence Number of Graphs with Maximum Degree 3. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Iyad A. Kanj, Stefan Kratsch |
Safe Approximation and Its Relation to Kernelization. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang |
Multicut in Trees Viewed through the Eyes of Vertex Cover. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Fenghui Zhang |
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. |
TAPAS |
2011 |
DBLP DOI 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 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
The parameterized complexity of some minimum label problems. |
J. Comput. Syst. 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 | 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 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local Algorithms for Edge Colorings in UDGs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
The Parameterized Complexity of Some Minimum Label Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj |
On Spanners of Geometric Graphs. |
TAMC |
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 | Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý |
What Makes Equitable Connected Partition Easy. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Dieter Kratsch |
Convex Recoloring Revisited: Complexity and Exact Algorithms. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann |
Editing Graphs into Disjoint Unions of Dense Clusters. |
ISAAC |
2009 |
DBLP DOI 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 | Jianer Chen, Iyad A. Kanj |
Foreword from the Guest Editors. |
Algorithmica |
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 | Iyad A. Kanj, Ljubomir Perkovic |
On Geometric Spanners of Euclidean and Unit Disk Graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 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 |
On Geometric Spanners of Euclidean and Unit Disk Graphs. |
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, Ljubomir Perkovic |
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. |
ALGOSENSORS |
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 |
On approximating minimum vertex cover for graphs with perfect matching. |
Theor. Comput. Sci. |
2005 |
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, Iyad A. Kanj, Guojun Wang |
Hypercube Network Fault Tolerance: A Probabilistic Approach. |
Journal of Interconnection Networks |
2005 |
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. |
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, Donald K. Friesen, Weijia Jia, Iyad A. Kanj |
Using Nondeterminism to Design Efficient Deterministic Algorithms. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Three-dimensional matching, Nondeterministic algorithms, Parameterized algorithms |
| 1 | Jianer Chen, Iyad A. Kanj |
Improved exact algorithms for MAX-SAT. |
Discrete Applied Mathematics |
2004 |
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 | Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer |
Parameterized Algorithms for Feedback Vertex Set. |
IWPEC |
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 |
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 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 |
|
| 1 | Liming Cai, David W. Juedes, Iyad A. Kanj |
The inapproximability of non-NP-hard optimization problems. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eunseuk Oh, Iyad A. Kanj |
Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. |
HPCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Ljubomir Perkovic |
Improved Parameterized Algorithms for Planar Dominating Set. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
planar dominating set, NP-complete problems, parameterized algorithms |
| 1 | Jianer Chen, Iyad A. Kanj |
Improved Exact Algorithms for MAX-SAT. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
exact algorithms, parameterized algorithms, maximum satisfiability |
| 1 | Jianer Chen, Iyad A. Kanj, Guojun Wang |
Hypercube Network Fault Tolerance: A Probabilistic Approach. (PDF / PS) |
ICPP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Weijia Jia |
Vertex Cover: Further Observations and Further Improvements. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj |
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj |
Using Nondeterminism to Design Deterministic Algorithms. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj |
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Iyad A. Kanj, Weijia Jia |
Vertex Cover: Further Observations and Further Improvements. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Cai, David W. Juedes, Iyad A. Kanj |
The Inapproximability of Non NP-hard Optimization Problems. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")