Iyad A. Kanj

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 25

Top Venues

CoRR

Theor. Comput. Sci.

Algorithmica

COCOA

Publications

Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. ICML (2023)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR (2018)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92 (2018)
Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
Improved Results for Minimum Constraint Removal. AAAI (2018)
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
Parameterized Algorithms for the Matrix Completion Problem. CoRR (2018)
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
Parameterized Algorithms for the Matrix Completion Problem. ICML (2018)
Eduard Eiben, Iyad A. Kanj
How to Navigate Through Obstacles?. ICALP (2018)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27 (4) (2017)
Iyad A. Kanj, Eric Sedgwick, Ge Xia
Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. 58 (2) (2017)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ACM Trans. Comput. Log. 18 (3) (2017)
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
The Complexity of Tree Partitioning. WADS (2017)
Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257 (2017)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR (2017)
Thore Husfeldt, Iyad A. Kanj
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 79 (1) (2017)
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
The Complexity of Tree Partitioning. CoRR (2017)
Eduard Eiben, Iyad A. Kanj
How to navigate through obstacles? CoRR (2017)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree four plane spanners: Simpler and better. J. Comput. Geom. 8 (2) (2017)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CCCG (2016)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree Four Plane Spanners: Simpler and Better. CoRR (2016)
Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On Existential MSO and its Relation to ETH. MFCS (2016)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Twins in Subdivision Drawings of Hypergraphs. Graph Drawing (2016)
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT (2016)
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
Degree Four Plane Spanners: Simpler and Better. SoCG (2016)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. Algorithmica 74 (3) (2016)
Iyad A. Kanj, Stefan Szeider
Parameterized and subexponential-time complexity of satisfiability problems and applications. Theor. Comput. Sci. 607 (2015)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR (2015)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Degree 4 and Moderate Stretch Factor. Discret. Comput. Geom. 53 (3) (2015)
Iyad A. Kanj, Fenghui Zhang
3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size. Discret. Math. Algorithms Appl. 7 (2) (2015)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52 (2015)
Iyad A. Kanj, Ge Xia
Flip Distance Is in FPT Time O(n+ k * c^k). STACS (2015)
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
Twins in Subdivision Drawings of Hypergraphs. CoRR (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607 (2015)
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
Finding Points in General Position. CoRR (2015)
Iyad A. Kanj, Ge Xia
Flip Distance is in FPT time $O(n+ k \cdot c^k)$. CoRR (2014)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees. COCOA (2014)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. CoRR (2014)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Subexponential Time Complexity of CSP with Global Constraints. CP (2014)
Iyad A. Kanj, Ge Xia
On certain geometric properties of the Yao-Yao graphs. J. Comb. Optim. 27 (1) (2014)
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
There are Plane Spanners of Maximum Degree 4. SoCG (2014)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI (2014)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. CoRR (2014)
Iyad A. Kanj, Stefan Szeider
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. COCOA (2014)
Iyad A. Kanj, Stefan Szeider
On the Subexponential Time Complexity of CSP. AAAI (2013)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Algorithms for Cut Problems on Trees CoRR (2013)
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
On the Ordered List Subgraph Embedding Problems. IPEC (2013)
Iyad A. Kanj, Stefan Szeider
On the Subexponential Time Complexity of CSP CoRR (2013)
Iyad A. Kanj, Ge Xia
When Is Weighted Satisfiability FPT? WADS (2013)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Local Backbones CoRR (2013)
Iyad A. Kanj, Fenghui Zhang
On the independence number of graphs with maximum degree 3. Theor. Comput. Sci. 478 (2013)
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
Local Backbones. SAT (2013)
Iyad A. Kanj, Ge Xia, Binhai Zhu
The Radiation Hybrid Map Construction Problem Is FPT. ISBRA (2013)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
algorithms. Theor. Comput. Sci. 470 (2013)
Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
Multicut in trees viewed through the eyes of vertex cover. J. Comput. Syst. Sci. 78 (5) (2012)
Iyad A. Kanj, Ge Xia
Improved local algorithms for spanner construction. Theor. Comput. Sci. 453 (2012)
Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. 11 (7) (2012)
Jianer Chen, Iyad A. Kanj
Parameterized Complexity and Subexponential-Time Computability. The Multivariate Algorithmic Revolution and Beyond (2012)
Iyad A. Kanj, Ge Xia
On Certain Geometric Properties of the Yao-Yao Graphs. COCOA (2012)
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia
On the induced matching problem. J. Comput. Syst. Sci. 77 (6) (2011)
Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
Multicut in Trees Viewed through the Eyes of Vertex Cover. WADS (2011)
Shiliang Cui, Iyad A. Kanj, Ge Xia
On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44 (2) (2011)
Iyad A. Kanj, Fenghui Zhang
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. TAPAS (2011)
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61 (4) (2011)
Iyad A. Kanj, Ge Xia
What makes normalized weighted satisfiability tractable CoRR (2011)
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Separability and topology control of quasi unit disk graphs. Wirel. Networks 17 (1) (2011)
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412 (35) (2011)
Jiong Guo, Iyad A. Kanj, Stefan Kratsch
Safe Approximation and Its Relation to Kernelization. IPEC (2011)
Iyad A. Kanj, Fenghui Zhang
On the Independence Number of Graphs with Maximum Degree 3. WG (2011)
Jianer Chen, Iyad A. Kanj, Ge Xia
Improved upper bounds for vertex cover. Theor. Comput. Sci. 411 (40-42) (2010)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39 (6) (2010)
Iyad A. Kanj, Ge Xia
Improved Local Algorithms for Spanner Construction. ALGOSENSORS (2010)
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76 (8) (2010)
Iyad A. Kanj
On Spanners of Geometric Graphs. TAMC (2009)
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
Local Algorithms for Edge Colorings in UDGs. WG (2009)
Iyad A. Kanj, Dieter Kratsch
Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON (2009)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
On the pseudo-achromatic number problem. Theor. Comput. Sci. 410 (8-10) (2009)
Jianer Chen, Iyad A. Kanj, Ge Xia
On Parameterized Exponential Time Complexity. TAMC (2009)
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC (2009)
Iyad A. Kanj, Ge Xia, Fenghui Zhang
Local Construction of Spanners in the 3-D Space. DCOSS (2009)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks. IEEE Trans. Mob. Comput. 8 (4) (2009)
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
The Parameterized Complexity of Some Minimum Label Problems. WG (2009)
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
What Makes Equitable Connected Partition Easy. IWPEC (2009)
Jianer Chen, Iyad A. Kanj, Ge Xia
On parameterized exponential time complexity. Theor. Comput. Sci. 410 (27-29) (2009)
Shiliang Cui, Iyad A. Kanj, Ge Xia
On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG (2009)
Iyad A. Kanj, Ljubomir Perkovic
On Geometric Spanners of Euclidean and Unit Disk Graphs CoRR (2008)
Jianer Chen, Iyad A. Kanj
Foreword from the Guest Editors. Algorithmica 52 (2) (2008)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the trees and their branches in the network is hard. Theor. Comput. Sci. 401 (1-3) (2008)
Iyad A. Kanj, Luay Nakhleh, Ge Xia
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51 (2) (2008)
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
On the Induced Matching Problem. STACS (2008)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Computing Lightweight Spanners Locally. DISC (2008)
Iyad A. Kanj, Ljubomir Perkovic
On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS (2008)
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
On the Pseudo-achromatic Number Problem. WG (2008)
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM (2007)
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC (2007)
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS (2007)
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. 73 (6) (2007)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. 155 (2) (2007)
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. SIAM J. Comput. 37 (4) (2007)
Iyad A. Kanj, Luay Nakhleh, Ge Xia
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON (2006)
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11 (2) (2006)

Iyad A. Kanj.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Iyad A. Kanj