Iyad A. Kanj

130 papers A* 10A 10B 24C 7Misc 2Journal 64Unranked 13
YearRankTypeTitle / Venue / Authors
2023 A* conf
The Computational Complexity of Concise Hypersphere Classification.
ICML
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 A* conf
How to Navigate Through Obstacles?.
ICALP
Eduard Eiben, Iyad A. Kanj
2018 A* conf
Improved Results for Minimum Constraint Removal.
AAAI
Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
2018 A* conf
Parameterized Algorithms for the Matrix Completion Problem.
ICML
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 J jnl
Parameterized Algorithms for the Matrix Completion Problem.
CoRR
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 J jnl
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
J. Comput. Syst. Sci.
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018 A conf
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
ESA
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2018 J jnl
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
CoRR
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2017 J jnl
Computing the Flip Distance Between Triangulations.
Discret. Comput. Geom.
Iyad A. Kanj, Eric Sedgwick, Ge Xia
2017 J jnl
Degree four plane spanners: Simpler and better.
J. Comput. Geom.
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
2017 J jnl
Finding Points in General Position.
Int. J. Comput. Geom. Appl.
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2017 J jnl
Guest Editorial: Special Issue on Parameterized and Exact Computation.
Algorithmica
Thore Husfeldt, Iyad A. Kanj
2017 J jnl
How to navigate through obstacles?
CoRR
Eduard Eiben, Iyad A. Kanj
2017 J jnl
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.
ACM Trans. Comput. Log.
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2017 J jnl
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.
Inf. Comput.
Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia
2017 J jnl
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
CoRR
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2017 B conf
The Complexity of Tree Partitioning.
WADS
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2017 J jnl
The Complexity of Tree Partitioning.
CoRR
Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia
2016 A* conf
Degree Four Plane Spanners: Simpler and Better.
SoCG
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
2016 J jnl
Degree Four Plane Spanners: Simpler and Better.
CoRR
Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu
2016 — conf
Finding Points in General Position.
CCCG
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2016 B conf
On Existential MSO and its Relation to ETH.
MFCS
Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2016 J jnl
On the Ordered List Subgraph Embedding Problems.
Algorithmica
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2016 — conf
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
SWAT
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
2016 A conf
Twins in Subdivision Drawings of Hypergraphs.
GD
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015 B ed.
10th International Symposium on Parameterized and Exact Computation, IPEC 2015, Patras, Greece, September 16-18, 2015
IPEC
Thore Husfeldt, Iyad A. Kanj
2015 J jnl
3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size.
Discret. Math. Algorithms Appl.
Iyad A. Kanj, Fenghui Zhang
2015 J jnl
Finding Points in General Position.
CoRR
Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier
2015 A conf
Flip Distance Is in FPT Time O(n+ k * c^k).
STACS
Iyad A. Kanj, Ge Xia
2015 J jnl
Improved parameterized and exact algorithms for cut problems on trees.
Theor. Comput. Sci.
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2015 J jnl
On the Subexponential-Time Complexity of CSP.
J. Artif. Intell. Res.
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2015 J jnl
Parameterized and subexponential-time complexity of satisfiability problems and applications.
Theor. Comput. Sci.
Iyad A. Kanj, Stefan Szeider
2015 J jnl
There are Plane Spanners of Degree 4 and Moderate Stretch Factor.
Discret. Comput. Geom.
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2015 J jnl
Twins in Subdivision Drawings of Hypergraphs.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2015 J jnl
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
CoRR
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge
2014 C conf
Algorithms for Cut Problems on Trees.
COCOA
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2014 J jnl
Flip Distance is in FPT time $O(n+ k \cdot c^k)$.
CoRR
Iyad A. Kanj, Ge Xia
2014 J jnl
On certain geometric properties of the Yao-Yao graphs.
J. Comb. Optim.
Iyad A. Kanj, Ge Xia
2014 J jnl
On the Ordered List Subgraph Embedding Problems.
CoRR
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2014 C conf
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications.
COCOA
Iyad A. Kanj, Stefan Szeider
2014 B conf
Small Unsatisfiable Subsets in Constraint Satisfaction.
ICTAI
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014 A conf
Subexponential Time Complexity of CSP with Global Constraints.
CP
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014 A* conf
There are Plane Spanners of Maximum Degree 4.
SoCG
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2014 J jnl
There are Plane Spanners of Maximum Degree 4.
CoRR
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2013 J jnl
Algorithms for Cut Problems on Trees
CoRR
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
2013 J jnl
Local Backbones
CoRR
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013 A conf
Local Backbones.
SAT
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013 B conf
On the Ordered List Subgraph Embedding Problems.
IPEC
Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic
2013 J jnl
On the Subexponential Time Complexity of CSP
CoRR
Iyad A. Kanj, Stefan Szeider
2013 A* conf
On the Subexponential Time Complexity of CSP.
AAAI
Iyad A. Kanj, Stefan Szeider
2013 J jnl
On the independence number of graphs with maximum degree 3.
Theor. Comput. Sci.
Iyad A. Kanj, Fenghui Zhang
2013 J jnl
Parameterized top-
Theor. Comput. Sci.
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2013 — conf
The Radiation Hybrid Map Construction Problem Is FPT.
ISBRA
Iyad A. Kanj, Ge Xia, Binhai Zhu
2013 B conf
When Is Weighted Satisfiability FPT?
WADS
Iyad A. Kanj, Ge Xia
2012 J jnl
Improved local algorithms for spanner construction.
Theor. Comput. Sci.
Iyad A. Kanj, Ge Xia
2012 J jnl
Local Construction of Spanners in the 3D Space.
IEEE Trans. Mob. Comput.
Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2012 J jnl
Multicut in trees viewed through the eyes of vertex cover.
J. Comput. Syst. Sci.
Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
2012 C conf
On Certain Geometric Properties of the Yao-Yao Graphs.
COCOA
Iyad A. Kanj, Ge Xia
2012 — conf
Parameterized Complexity and Subexponential-Time Computability.
The Multivariate Algorithmic Revolution and Beyond
Jianer Chen, Iyad A. Kanj
2011 — conf
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size.
TAPAS
Iyad A. Kanj, Fenghui Zhang
2011 J jnl
Editing Graphs into Disjoint Unions of Dense Clusters.
Algorithmica
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
2011 J jnl
Local algorithms for edge colorings in UDGs.
Theor. Comput. Sci.
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
2011 B conf
Multicut in Trees Viewed through the Eyes of Vertex Cover.
WADS
Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang
2011 B conf
On the Independence Number of Graphs with Maximum Degree 3.
WG
Iyad A. Kanj, Fenghui Zhang
2011 J jnl
On the induced matching problem.
J. Comput. Syst. Sci.
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia
2011 J jnl
On the stretch factor of Delaunay triangulations of points in convex position.
Comput. Geom.
Shiliang Cui, Iyad A. Kanj, Ge Xia
2011 B conf
Safe Approximation and Its Relation to Kernelization.
IPEC
Jiong Guo, Iyad A. Kanj, Stefan Kratsch
2011 J jnl
Separability and topology control of quasi unit disk graphs.
Wirel. Networks
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2011 J jnl
What makes normalized weighted satisfiability tractable
CoRR
Iyad A. Kanj, Ge Xia
2010 C conf
Improved Local Algorithms for Spanner Construction.
ALGOSENSORS
Iyad A. Kanj, Ge Xia
2010 J jnl
Improved upper bounds for vertex cover.
Theor. Comput. Sci.
Jianer Chen, Iyad A. Kanj, Ge Xia
2010 J jnl
On Spanners and Lightweight Spanners of Geometric Graphs.
SIAM J. Comput.
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2010 J jnl
The parameterized complexity of some minimum label problems.
J. Comput. Syst. Sci.
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
2009 Misc conf
Convex Recoloring Revisited: Complexity and Exact Algorithms.
COCOON
Iyad A. Kanj, Dieter Kratsch
2009 B conf
Editing Graphs into Disjoint Unions of Dense Clusters.
ISAAC
Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann
2009 B conf
Local Algorithms for Edge Colorings in UDGs.
WG
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
2009 J jnl
Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks.
IEEE Trans. Mob. Comput.
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2009 B conf
Local Construction of Spanners in the 3-D Space.
DCOSS
Iyad A. Kanj, Ge Xia, Fenghui Zhang
2009 C conf
On Parameterized Exponential Time Complexity.
TAMC
Jianer Chen, Iyad A. Kanj, Ge Xia
2009 C conf
On Spanners of Geometric Graphs.
TAMC
Iyad A. Kanj
2009 J jnl
On parameterized exponential time complexity.
Theor. Comput. Sci.
Jianer Chen, Iyad A. Kanj, Ge Xia
2009 — conf
On the Dilation of Delaunay Triangulations of Points in Convex Position.
CCCG
Shiliang Cui, Iyad A. Kanj, Ge Xia
2009 J jnl
On the pseudo-achromatic number problem.
Theor. Comput. Sci.
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2009 B conf
The Parameterized Complexity of Some Minimum Label Problems.
WG
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
2009 — conf
What Makes Equitable Connected Partition Easy.
IWPEC
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý
2008 A conf
Computing Lightweight Spanners Locally.
DISC
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2008 J jnl
Foreword from the Guest Editors.
Algorithmica
Jianer Chen, Iyad A. Kanj
2008 J jnl
On Geometric Spanners of Euclidean and Unit Disk Graphs
CoRR
Iyad A. Kanj, Ljubomir Perkovic
2008 A conf
On Geometric Spanners of Euclidean and Unit Disk Graphs.
STACS
Iyad A. Kanj, Ljubomir Perkovic
2008 A conf
On the Induced Matching Problem.
STACS
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer
2008 B conf
On the Pseudo-achromatic Number Problem.
WG
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2008 J jnl
Seeing the trees and their branches in the network is hard.
Theor. Comput. Sci.
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
2008 J jnl
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms.
Algorithmica
Iyad A. Kanj, Luay Nakhleh, Ge Xia
2007 J jnl
Genus characterizes the complexity of certain graph problems: Some tight results.
J. Comput. Syst. Sci.
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
2007 J jnl
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
SIAM J. Comput.
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2007 J jnl
Polynomial time approximation schemes and parameterized complexity.
Discret. Appl. Math.
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2007 — conf
Seeing the Trees and Their Branches in the Forest is Hard.
ICTCS
Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia
2007 A* conf
Separability and Topology Control of Quasi Unit Disk Graphs.
INFOCOM
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang
2007 — conf
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks.
DIALM-POMC
Iyad A. Kanj, Ljubomir Perkovic, Ge Xia
2006 B conf
Improved Parameterized Upper Bounds for Vertex Cover.
MFCS
Jianer Chen, Iyad A. Kanj, Ge Xia
2006 C conf
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks.
ALGOSENSORS
Iyad A. Kanj, Ljubomir Perkovic
2006 — conf
On the Effective Enumerability of NP Problems.
IWPEC
Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
2006 J jnl
On the computational hardness based on linear FPT-reductions.
J. Comb. Optim.
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2006 Misc conf
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms.
COCOON
Iyad A. Kanj, Luay Nakhleh, Ge Xia
2006 J jnl
Strong computational lower bounds via parameterized complexity.
J. Comput. Syst. Sci.
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2005 J jnl
Hypercube Network Fault Tolerance: A Probabilistic Approach.
J. Interconnect. Networks
Jianer Chen, Iyad A. Kanj, Guojun Wang
2005 J jnl
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
Algorithmica
Jianer Chen, Iyad A. Kanj, Ge Xia
2005 J jnl
On approximating minimum vertex cover for graphs with perfect matching.
Theor. Comput. Sci.
Jianer Chen, Iyad A. Kanj
2005 A conf
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size.
STACS
Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia
2005 J jnl
Tight lower bounds for certain parameterized NP-hard problems.
Inf. Comput.
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2004 J jnl
Improved exact algorithms for M
Discret. Appl. Math.
Jianer Chen, Iyad A. Kanj
2004 A* conf
Linear FPT reductions and computational lower bounds.
STOC
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2004 — conf
Parameterized Algorithms for Feedback Vertex Set.
IWPEC
Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer
2004 B conf
Polynomial Time Approximation Schemes and Parameterized Complexity.
MFCS
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
2004 A conf
Tight Lower Bounds for Certain Parameterized NP-Hard Problems.
CCC
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
2004 J jnl
Using Nondeterminism to Design Efficient Deterministic Algorithms.
Algorithmica
Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
2003 J jnl
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms.
J. Comput. Syst. Sci.
Jianer Chen, Iyad A. Kanj
2003 A* conf
Genus Characterizes the Complexity of Graph Problems: Some Tight Results.
ICALP
Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia
2003 B conf
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.
ISAAC
Jianer Chen, Iyad A. Kanj, Ge Xia
2002 — conf
Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers.
HPCS
Eunseuk Oh, Iyad A. Kanj
2002 B conf
Hypercube Network Fault Tolerance: A Probabilistic Approach.
ICPP
Jianer Chen, Iyad A. Kanj, Guojun Wang
2002 B conf
Improved Exact Algorithms for MAX-SAT.
LATIN
Jianer Chen, Iyad A. Kanj
2002 B conf
Improved Parameterized Algorithms for Planar Dominating Set.
MFCS
Iyad A. Kanj, Ljubomir Perkovic
2002 J jnl
The inapproximability of non-NP-hard optimization problems.
Theor. Comput. Sci.
Liming Cai, David W. Juedes, Iyad A. Kanj
2001 B conf
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms.
WG
Jianer Chen, Iyad A. Kanj
2001 — conf
Using Nondeterminism to Design Deterministic Algorithms.
FSTTCS
Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj
2001 J jnl
Vertex Cover: Further Observations and Further Improvements.
J. Algorithms
Jianer Chen, Iyad A. Kanj, Weijia Jia
2000 B conf
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching.
ISAAC
Jianer Chen, Iyad A. Kanj
1999 B conf
Vertex Cover: Further Observations and Further Improvements.
WG
Jianer Chen, Iyad A. Kanj, Weijia Jia
1998 B conf
The Inapproximability of Non NP-hard Optimization Problems.
ISAAC
Liming Cai, David W. Juedes, Iyad A. Kanj