The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Iyad A. Kanj Iyad Kanj ( http://dblp.L3S.de/Authors/Iyad_A._Kanj )

URL (Homepage):  http://www.cdm.depaul.edu/about/pages/people/facultyinfo.aspx?fid=272  Author page on DBLP  Author page in RDF  Community of Iyad A. Kanj in ASPL-2

Publication years (Num. hits)
1998-2004 (20) 2005-2007 (18) 2008-2009 (20) 2010-2012 (19) 2013-2014 (19) 2015-2016 (17) 2017-2018 (18) 2019 (2)
Publication types (Num. hits)
article(66) inproceedings(66) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(19) Theor. Comput. Sci.(12) Algorithmica(7) J. Comput. Syst. Sci.(7) WG(6) ISAAC(4) MFCS(4) STACS(4) COCOA(3) COCOON(3) IPEC(3) IWPEC(3) WADS(3) AAAI(2) ALGOSENSORS(2) CCCG(2) More (+10 of total 56)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 23 occurrences of 17 keywords

Results
Found 134 publication records. Showing 133 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider On Clustering Incomplete Data. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage Near-optimal Smooth Path Planning for Multisection Continuum Arms. Search on Bibsonomy RoboSoft The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Iyad A. Kanj How to Navigate Through Obstacles?. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl Improved Results for Minimum Constraint Removal. Search on Bibsonomy AAAI The full citation details ... 2018 DBLP  BibTeX  RDF
1Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider Parameterized Algorithms for the Matrix Completion Problem. Search on Bibsonomy ICML The full citation details ... 2018 DBLP  BibTeX  RDF
1Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage Near-optimal Smooth Path Planning for Multisection Continuum Arms. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thore Husfeldt, Iyad A. Kanj Guest Editorial: Special Issue on Parameterized and Exact Computation. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Iyad A. Kanj How to navigate through obstacles? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia The Complexity of Tree Partitioning. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu Degree four plane spanners: Simpler and better. Search on Bibsonomy JoCG The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier Finding Points in General Position. Search on Bibsonomy Int. J. Comput. Geometry Appl. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Eric Sedgwick, Ge Xia Computing the Flip Distance Between Triangulations. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia The Complexity of Tree Partitioning. Search on Bibsonomy WADS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic On the Ordered List Subgraph Embedding Problems. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu Degree Four Plane Spanners: Simpler and Better. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu Degree Four Plane Spanners: Simpler and Better. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider On Existential MSO and its Relation to ETH. Search on Bibsonomy MFCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy Graph Drawing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier Finding Points in General Position. Search on Bibsonomy CCCG The full citation details ... 2016 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Guohui Lin, Tian Liu 0001, Weitian Tong, Ge Xia, Jinhui Xu 0001, Boting Yang, Fenghui Zhang, Peng Zhang 0008, Binhai Zhu Improved parameterized and exact algorithms for cut problems on trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider Parameterized and subexponential-time complexity of satisfiability problems and applications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider On the Subexponential-Time Complexity of CSP. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier Finding Points in General Position. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Iyad A. Kanj, Fenghui Zhang 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size. Search on Bibsonomy Discrete Math., Alg. and Appl. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia Flip Distance Is in FPT Time O(n+ k * c^k). Search on Bibsonomy STACS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Thore Husfeldt, Iyad A. Kanj (eds.) 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  BibTeX  RDF
1Iyad A. Kanj, Ge Xia Flip Distance is in FPT time $O(n+ k \cdot c^k)$. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia There are Plane Spanners of Maximum Degree 4. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic On the Ordered List Subgraph Embedding Problems. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Iyad A. Kanj, Ge Xia On certain geometric properties of the Yao-Yao graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia There are Plane Spanners of Maximum Degree 4. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Small Unsatisfiable Subsets in Constraint Satisfaction. Search on Bibsonomy ICTAI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Subexponential Time Complexity of CSP with Global Constraints. Search on Bibsonomy CP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Guohui Lin, Tian Liu 0001, Weitian Tong, Ge Xia, Jinhui Xu 0001, Boting Yang, Fenghui Zhang, Peng Zhang 0008, Binhai Zhu Algorithms for Cut Problems on Trees. Search on Bibsonomy COCOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. Search on Bibsonomy COCOA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang Parameterized top-K algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Fenghui Zhang On the independence number of graphs with maximum degree 3. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Guohui Lin, Tian Liu 0001, Weitian Tong, Ge Xia, Jinhui Xu 0001, Boting Yang, Fenghui Zhang, Peng Zhang 0008, Binhai Zhu Algorithms for Cut Problems on Trees Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider On the Subexponential Time Complexity of CSP Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Local Backbones Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Iyad A. Kanj, Stefan Szeider On the Subexponential Time Complexity of CSP. Search on Bibsonomy AAAI The full citation details ... 2013 DBLP  BibTeX  RDF
1Ronald de Haan, Iyad A. Kanj, Stefan Szeider Local Backbones. Search on Bibsonomy SAT The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia When Is Weighted Satisfiability FPT? Search on Bibsonomy WADS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia, Binhai Zhu The Radiation Hybrid Map Construction Problem Is FPT. Search on Bibsonomy ISBRA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic On the Ordered List Subgraph Embedding Problems. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang Local Construction of Spanners in the 3D Space. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia Improved local algorithms for spanner construction. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu 0002, Fenghui Zhang Multicut in trees viewed through the eyes of vertex cover. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj Parameterized Complexity and Subexponential-Time Computability. Search on Bibsonomy The Multivariate Algorithmic Revolution and Beyond The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia On Certain Geometric Properties of the Yao-Yao Graphs. Search on Bibsonomy COCOA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Shiliang Cui, Iyad A. Kanj, Ge Xia On the stretch factor of Delaunay triangulations of points in convex position. Search on Bibsonomy Comput. Geom. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Andreas Wiese, Fenghui Zhang Local algorithms for edge colorings in UDGs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia On the induced matching problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia What makes normalized weighted satisfiability tractable Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang Separability and topology control of quasi unit disk graphs. Search on Bibsonomy Wireless Networks The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Fenghui Zhang 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. Search on Bibsonomy TAPAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Fenghui Zhang On the Independence Number of Graphs with Maximum Degree 3. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu 0002, Fenghui Zhang Multicut in Trees Viewed through the Eyes of Vertex Cover. Search on Bibsonomy WADS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Stefan Kratsch Safe Approximation and Its Relation to Kernelization. Search on Bibsonomy IPEC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Ge Xia Improved upper bounds for vertex cover. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Jiong Guo, Iyad A. Kanj The parameterized complexity of some minimum label problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Ge Xia On Spanners and Lightweight Spanners of Geometric Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia Improved Local Algorithms for Spanner Construction. Search on Bibsonomy ALGOSENSORS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Ge Xia Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. Search on Bibsonomy IEEE Trans. Mob. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Ge Xia On parameterized exponential time complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang On the pseudo-achromatic number problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj On Spanners of Geometric Graphs. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Ge Xia On Parameterized Exponential Time Complexity. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Andreas Wiese, Fenghui Zhang Local Algorithms for Edge Colorings in UDGs. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Jiong Guo, Iyad A. Kanj The Parameterized Complexity of Some Minimum Label Problems. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ge Xia, Fenghui Zhang Local Construction of Spanners in the 3-D Space. Search on Bibsonomy DCOSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Shiliang Cui, Iyad A. Kanj, Ge Xia On the Dilation of Delaunay Triangulations of Points in Convex Position. Search on Bibsonomy CCCG The full citation details ... 2009 DBLP  BibTeX  RDF
1Iyad A. Kanj, Dieter Kratsch Convex Recoloring Revisited: Complexity and Exact Algorithms. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý What Makes Equitable Connected Partition Easy. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Luay Nakhleh, Ge Xia The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Parameterized algorithms and complexity, Linguistics, Phylogenetic networks
1Jianer Chen, Iyad A. Kanj Foreword from the Guest Editors. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia Seeing the trees and their branches in the network is hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic On Geometric Spanners of Euclidean and Unit Disk Graphs Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic, Ge Xia Computing Lightweight Spanners Locally. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang On the Pseudo-achromatic Number Problem. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF pseudo-achromatic number, kernel, fixed-parameter tractability, parameterized complexity
1Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer On the Induced Matching Problem. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic On Geometric Spanners of Euclidean and Unit Disk Graphs. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia Genus characterizes the complexity of certain graph problems: Some tight results. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia Polynomial time approximation schemes and parameterized complexity. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia Seeing the Trees and Their Branches in the Forest is Hard. Search on Bibsonomy ICTCS The full citation details ... 2007 DBLP  BibTeX  RDF
1Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang Separability and Topology Control of Quasi Unit Disk Graphs. Search on Bibsonomy INFOCOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 133 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license