default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIyad Kanj
Iyad A. Kanj
Person information
- affiliation: DePaul University, Chicago, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j59]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. Algorithmica 86(8): 2448-2478 (2024)- [j58]René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. 28(1): 51-79 (2024) - [j57]Dimuthu D. K. Arachchige
, Dulanjana M. Perera, Umer Huzaifa, Iyad Kanj, Isuru S. Godage:
Tumbling Locomotion of Tetrahedral Soft-Limbed Robots. IEEE Robotics Autom. Lett. 9(5): 4337-4344 (2024) - [c88]Iyad Kanj, Salman Parsa:
On the Parameterized Complexity of Motion Planning for Rectangular Robots. SoCG 2024: 65:1-65:15 - [c87]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. ICALP 2024: 53:1-53:18 - [c86]Brandon H. Meng, Dimuthu D. K. Arachchige, Isuru S. Godage, Iyad Kanj:
Path Planning for Continuum Arms in Dynamic Environments. RoboSoft 2024: 900-905 - [i32]Iyad Kanj, Salman Parsa:
On the Parameterized Complexity of Motion Planning for Rectangular Robots. CoRR abs/2402.17846 (2024) - [i31]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan:
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. CoRR abs/2404.15950 (2024) - [i30]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR abs/2407.10699 (2024) - 2023
- [j56]Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Umer Huzaifa, Iyad Kanj, Isuru S. Godage:
Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots. IEEE Access 11: 63136-63148 (2023) - [j55]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134: 1-19 (2023) - [c85]Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage:
Study on Soft Robotic Pinniped Locomotion. AIM 2023: 65-71 - [c84]Yuta Nakamura, Iyad Kanj, Tanu Malik:
Efficient Differencing of System-level Provenance Graphs. CIKM 2023: 4220-4223 - [c83]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. SoCG 2023: 28:1-28:16 - [c82]Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - [c81]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC 2023: 16:1-16:14 - [c80]Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage:
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits. RoboSoft 2023: 1-6 - [c79]Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage:
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control. RoboSoft 2023: 1-7 - [i29]Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Isuru S. Godage:
Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and Helical Rolling Gaits. CoRR abs/2303.02285 (2023) - [i28]Dimuthu D. K. Arachchige, Dulanjana M. Perera, Sanjaya Mallikarachchi, Iyad Kanj, Yue Chen, Hunter B. Gilbert, Isuru S. Godage:
Dynamic Modeling and Validation of Soft Robotic Snake Locomotion. CoRR abs/2303.02291 (2023) - [i27]Dulanjana M. Perera, Dimuthu D. K. Arachchige, Sanjaya Mallikarachchi, Talal Ghafoor, Iyad Kanj, Yue Chen, Isuru S. Godage:
Teleoperation of Soft Modular Robots: Study on Real-time Stability and Gait Control. CoRR abs/2303.05454 (2023) - [i26]Dimuthu D. K. Arachchige, Tanmay Varshney, Umer Huzaifa, Iyad Kanj, Thrishantha Nanayakkara, Yue Chen, Hunter B. Gilbert, Isuru S. Godage:
Study on Soft Robotic Pinniped Locomotion. CoRR abs/2304.06945 (2023) - [i25]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. CoRR abs/2310.10815 (2023) - [i24]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. CoRR abs/2312.07103 (2023) - [i23]Eduard Eiben, Robert Ganian, Iyad Kanj:
The Parameterized Complexity of Coordinated Motion Planning. CoRR abs/2312.07144 (2023) - [i22]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. CoRR abs/2312.07628 (2023) - 2022
- [j54]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-optimal algorithms for point-line fitting problems. J. Comput. Geom. 13(1): 226-243 (2022) - [j53]Brandon H. Meng, Isuru S. Godage, Iyad Kanj:
RRT*-Based Path Planning for Continuum Arms. IEEE Robotics Autom. Lett. 7(3): 6830-6837 (2022) - [j52]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. SIAM J. Discret. Math. 36(2): 1200-1230 (2022) - [c78]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c77]Yuta Nakamura, Tanu Malik, Iyad Kanj, Ashish Gehani:
Provenance-based Workflow Diagnostics Using Program Specification. HIPC 2022: 292-301 - [c76]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. STACS 2022: 21:1-21:18 - 2021
- [c75]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c74]Brandon H. Meng, Isuru S. Godage, Iyad Kanj:
Smooth Path Planning for Continuum Arms. ICRA 2021: 7809-7814 - [c73]Brandon H. Meng, Dimuthu D. K. Arachchige, Jiahao Deng, Isuru S. Godage, Iyad Kanj:
Anticipatory Path Planning for Continuum Arms in Dynamic Environments. ICRA 2021: 7815-7820 - [c72]Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, Ge Xia:
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. ISAAC 2021: 48:1-48:17 - [i21]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Optimal Streaming Algorithms for Graph Matching. CoRR abs/2102.06939 (2021) - 2020
- [j51]Zhao An, Qilong Feng, Iyad Kanj, Ge Xia:
The Complexity of Tree Partitioning. Algorithmica 82(9): 2606-2643 (2020) - [j50]Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34(1): 640-681 (2020) - [j49]Eduard Eiben, Iyad Kanj:
A Colored Path Problem and Its Applications. ACM Trans. Algorithms 16(4): 47:1-47:48 (2020) - [j48]Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider:
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12(4): 22:1-22:32 (2020) - [c71]Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI 2020: 3906-3913 - [c70]Eduard Eiben, Isuru S. Godage, Iyad Kanj, Ge Xia:
On the Problem of Covering a 3-D Terrain. AAAI 2020: 10361-10368 - [c69]Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. STACS 2020: 13:1-13:17 - [i20]Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. CoRR abs/2012.02363 (2020)
2010 – 2019
- 2019
- [c68]Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider:
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS 2019: 7666-7676 - [c67]Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage:
Near-optimal Smooth Path Planning for Multisection Continuum Arms. RoboSoft 2019: 416-421 - [i19]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - 2018
- [j47]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: 22-47 (2018) - [c66]Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl:
Improved Results for Minimum Constraint Removal. AAAI 2018: 6477-6484 - [c65]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA 2018: 51:1-51:14 - [c64]Eduard Eiben, Iyad A. Kanj:
How to Navigate Through Obstacles?. ICALP 2018: 48:1-48:13 - [c63]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. ICML 2018: 1642-1651 - [i18]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. CoRR abs/1804.03423 (2018) - [i17]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR abs/1808.08772 (2018) - [i16]Jiahao Deng, Brandon H. Meng, Iyad Kanj, Isuru S. Godage:
Near-optimal Smooth Path Planning for Multisection Continuum Arms. CoRR abs/1812.03615 (2018) - 2017
- [j46]Thore Husfeldt, Iyad A. Kanj:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 79(1): 1-2 (2017) - [j45]Iyad A. Kanj, Eric Sedgwick, Ge Xia:
Computing the Flip Distance Between Triangulations. Discret. Comput. Geom. 58(2): 313-344 (2017) - [j44]Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia:
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Inf. Comput. 257: 139-156 (2017) - [j43]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. Int. J. Comput. Geom. Appl. 27(4): 277-296 (2017) - [j42]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree four plane spanners: Simpler and better. J. Comput. Geom. 8(2): 3-31 (2017) - [j41]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): 21:1-21:46 (2017) - [c62]Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. WADS 2017: 37-48 - [i15]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR abs/1702.04322 (2017) - [i14]Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia:
The Complexity of Tree Partitioning. CoRR abs/1704.05896 (2017) - [i13]Eduard Eiben, Iyad A. Kanj:
How to navigate through obstacles? CoRR abs/1712.04043 (2017) - 2016
- [j40]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. Algorithmica 74(3): 992-1018 (2016) - [c61]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CCCG 2016: 7-14 - [c60]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree Four Plane Spanners: Simpler and Better. SoCG 2016: 45:1-45:15 - [c59]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c58]Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On Existential MSO and its Relation to ETH. MFCS 2016: 42:1-42:14 - [c57]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT 2016: 14:1-14:14 - [i12]Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu:
Degree Four Plane Spanners: Simpler and Better. CoRR abs/1603.03818 (2016) - 2015
- [j39]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): 514-546 (2015) - [j38]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): 1550011:1-1550011:17 (2015) - [j37]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Subexponential-Time Complexity of CSP. J. Artif. Intell. Res. 52: 203-234 (2015) - [j36]Iyad A. Kanj, Stefan Szeider:
Parameterized and subexponential-time complexity of satisfiability problems and applications. Theor. Comput. Sci. 607: 282-295 (2015) - [j35]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: 455-470 (2015) - [c56]Iyad A. Kanj, Ge Xia:
Flip Distance Is in FPT Time O(n+ k * c^k). STACS 2015: 500-512 - [e1]Thore Husfeldt, Iyad A. Kanj:
10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece. LIPIcs 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-92-7 [contents] - [i11]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i10]Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier:
Finding Points in General Position. CoRR abs/1508.01097 (2015) - [i9]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - 2014
- [j34]Iyad A. Kanj, Ge Xia:
On certain geometric properties of the Yao-Yao graphs. J. Comb. Optim. 27(1): 78-87 (2014) - [c55]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: 283-298 - [c54]Iyad A. Kanj, Stefan Szeider:
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. COCOA 2014: 637-651 - [c53]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. SoCG 2014: 20 - [c52]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Subexponential Time Complexity of CSP with Global Constraints. CP 2014: 272-288 - [c51]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Small Unsatisfiable Subsets in Constraint Satisfaction. ICTAI 2014: 429-436 - [i8]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. CoRR abs/1403.2009 (2014) - [i7]Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
There are Plane Spanners of Maximum Degree 4. CoRR abs/1403.5350 (2014) - [i6]Iyad A. Kanj, Ge Xia:
Flip Distance is in FPT time $O(n+ k \cdot c^k)$. CoRR abs/1407.1525 (2014) - 2013
- [j33]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
Parameterized top-K algorithms. Theor. Comput. Sci. 470: 105-119 (2013) - [j32]Iyad A. Kanj, Fenghui Zhang:
On the independence number of graphs with maximum degree 3. Theor. Comput. Sci. 478: 51-75 (2013) - [c50]Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. AAAI 2013: 459-465 - [c49]Iyad Kanj:
Geometric spanners: Recent results and open directions. ICCIT 2013: 78-82 - [c48]Iyad A. Kanj, Ge Xia, Binhai Zhu:
The Radiation Hybrid Map Construction Problem Is FPT. ISBRA 2013: 5-16 - [c47]Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic:
On the Ordered List Subgraph Embedding Problems. IPEC 2013: 189-201 - [c46]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. SAT 2013: 377-393 - [c45]Iyad A. Kanj, Ge Xia:
When Is Weighted Satisfiability FPT? WADS 2013: 451-462 - [i5]Iyad A. Kanj, Stefan Szeider:
On the Subexponential Time Complexity of CSP. CoRR abs/1304.1996 (2013) - [i4]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 abs/1304.3653 (2013) - [i3]Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
Local Backbones. CoRR abs/1304.5479 (2013) - 2012
- [j31]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): 1637-1650 (2012) - [j30]Iyad A. Kanj, Ge Xia:
Improved local algorithms for spanner construction. Theor. Comput. Sci. 453: 54-64 (2012) - [j29]Jonathan P. Jenkins, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Local Construction of Spanners in the 3D Space. IEEE Trans. Mob. Comput. 11(7): 1140-1150 (2012) - [c44]Jianer Chen, Iyad A. Kanj:
Parameterized Complexity and Subexponential-Time Computability. The Multivariate Algorithmic Revolution and Beyond 2012: 162-195 - [c43]Iyad A. Kanj, Ge Xia:
On Certain Geometric Properties of the Yao-Yao Graphs. COCOA 2012: 223-233 - 2011
- [j28]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011) - [j27]Shiliang Cui, Iyad A. Kanj, Ge Xia:
On the stretch factor of Delaunay triangulations of points in convex position. Comput. Geom. 44(2): 104-109 (2011) - [j26]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer, Ge Xia:
On the induced matching problem. J. Comput. Syst. Sci. 77(6): 1058-1070 (2011) - [j25]Iyad A. Kanj, Andreas Wiese, Fenghui Zhang:
Local algorithms for edge colorings in UDGs. Theor. Comput. Sci. 412(35): 4704-4714 (2011) - [j24]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and topology control of quasi unit disk graphs. Wirel. Networks 17(1): 53-67 (2011) - [c42]Jiong Guo, Iyad A. Kanj, Stefan Kratsch:
Safe Approximation and Its Relation to Kernelization. IPEC 2011: 169-180 - [c41]Iyad A. Kanj, Fenghui Zhang:
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size. TAPAS 2011: 163-174 - [c40]Jianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang:
Multicut in Trees Viewed through the Eyes of Vertex Cover. WADS 2011: 219-230 - [c39]Iyad A. Kanj, Fenghui Zhang:
On the Independence Number of Graphs with Maximum Degree 3. WG 2011: 238-249 - [i2]Iyad A. Kanj, Ge Xia:
What makes normalized weighted satisfiability tractable. CoRR abs/1112.1040 (2011) - 2010
- [j23]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The parameterized complexity of some minimum label problems. J. Comput. Syst. Sci. 76(8): 727-740 (2010) - [j22]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
On Spanners and Lightweight Spanners of Geometric Graphs. SIAM J. Comput. 39(6): 2132-2161 (2010) - [j21]Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42): 3736-3756 (2010) - [c38]Iyad A. Kanj, Ge Xia:
Improved Local Algorithms for Spanner Construction. ALGOSENSORS 2010: 1-15
2000 – 2009
- 2009
- [j20]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the pseudo-achromatic number problem. Theor. Comput. Sci. 410(8-10): 818-829 (2009) - [j19]Jianer Chen, Iyad A. Kanj, Ge Xia:
On parameterized exponential time complexity. Theor. Comput. Sci. 410(27-29): 2641-2648 (2009) - [j18]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): 460-474 (2009) - [c37]Shiliang Cui, Iyad A. Kanj, Ge Xia:
On the Dilation of Delaunay Triangulations of Points in Convex Position. CCCG 2009: 161-164 - [c36]Iyad A. Kanj, Dieter Kratsch:
Convex Recoloring Revisited: Complexity and Exact Algorithms. COCOON 2009: 388-397 - [c35]Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Local Construction of Spanners in the 3-D Space. DCOSS 2009: 315-328 - [c34]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann:
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593 - [c33]Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý:
What Makes Equitable Connected Partition Easy. IWPEC 2009: 122-133 - [c32]Iyad A. Kanj:
On Spanners of Geometric Graphs. TAMC 2009: 49-58 - [c31]Jianer Chen, Iyad A. Kanj, Ge Xia:
On Parameterized Exponential Time Complexity. TAMC 2009: 168-177 - [c30]Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99 - [c29]Iyad A. Kanj, Andreas Wiese, Fenghui Zhang:
Local Algorithms for Edge Colorings in UDGs. WG 2009: 202-213 - 2008
- [j17]Iyad A. Kanj, Luay Nakhleh, Ge Xia:
The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms. Algorithmica 51(2): 99-128 (2008) - [j16]Jianer Chen, Iyad A. Kanj:
Foreword from the Guest Editors. Algorithmica 52(2): 113 (2008) - [j15]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): 153-164 (2008) - [c28]Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer:
On the Induced Matching Problem. STACS 2008: 397-408 - [c27]Iyad A. Kanj, Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs. STACS 2008: 409-420 - [c26]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Computing Lightweight Spanners Locally. DISC 2008: 365-378 - [c25]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Pseudo-achromatic Number Problem. WG 2008: 78-89 - [i1]Iyad A. Kanj, Ljubomir Perkovic:
On Geometric Spanners of Euclidean and Unit Disk Graphs. CoRR abs/0802.2864 (2008) - 2007
- [j14]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial time approximation schemes and parameterized complexity. Discret. Appl. Math. 155(2): 180-193 (2007) - [j13]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): 892-907 (2007) - [j12]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): 1077-1106 (2007) - [c24]Iyad A. Kanj, Ljubomir Perkovic, Ge Xia:
Strictly-Localized Construction of Near-Optimal Power Spanners for Wireless Ad-Hoc Networks. DIALM-POMC 2007 - [c23]Iyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia:
Seeing the Trees and Their Branches in the Forest is Hard. ICTCS 2007: 82-93 - [c22]Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, Fenghui Zhang:
Separability and Topology Control of Quasi Unit Disk Graphs. INFOCOM 2007: 2225-2233 - 2006
- [j11]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
On the computational hardness based on linear FPT-reductions. J. Comb. Optim. 11(2): 231-247 (2006) - [j10]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Strong computational lower bounds via parameterized complexity. J. Comput. Syst. Sci. 72(8): 1346-1367 (2006) - [c21]Iyad A. Kanj, Ljubomir Perkovic:
Improved Stretch Factor for Bounded-Degree Planar Power Spanners of Wireless Ad-Hoc Networks. ALGOSENSORS 2006: 95-106 - [c20]Iyad A. Kanj, Luay Nakhleh, Ge Xia:
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms. COCOON 2006: 299-308 - [c19]Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang:
On the Effective Enumerability of NP Problems. IWPEC 2006: 215-226 - [c18]Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249 - 2005
- [j9]Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43(4): 245-273 (2005) - [j8]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. 201(2): 216-231 (2005) - [j7]Jianer Chen, Iyad A. Kanj, Guojun Wang:
Hypercube Network Fault Tolerance: A Probabilistic Approach. J. Interconnect. Networks 6(1): 17-34 (2005) - [j6]Jianer Chen, Iyad A. Kanj:
On approximating minimum vertex cover for graphs with perfect matching. Theor. Comput. Sci. 337(1-3): 305-318 (2005) - [c17]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
W-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications. COCOON 2005: 975-984 - [c16]Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia:
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size. STACS 2005: 269-280 - 2004
- [j5]Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Efficient Deterministic Algorithms. Algorithmica 40(2): 83-97 (2004) - [j4]Jianer Chen, Iyad A. Kanj:
Improved exact algorithms for MAX-SAT. Discret. Appl. Math. 142(1-3): 17-27 (2004) - [c15]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. CCC 2004: 150-160 - [c14]Iyad A. Kanj, Michael J. Pelsmajer, Marcus Schaefer:
Parameterized Algorithms for Feedback Vertex Set. IWPEC 2004: 235-247 - [c13]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Polynomial Time Approximation Schemes and Parameterized Complexity. MFCS 2004: 500-512 - [c12]Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia:
Linear FPT reductions and computational lower bounds. STOC 2004: 212-221 - 2003
- [j3]Jianer Chen, Iyad A. Kanj:
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. J. Comput. Syst. Sci. 67(4): 833-847 (2003) - [c11]Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia:
Genus Characterizes the Complexity of Graph Problems: Some Tight Results. ICALP 2003: 845-856 - [c10]Jianer Chen, Iyad A. Kanj, Ge Xia:
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. ISAAC 2003: 148-157 - 2002
- [j2]Liming Cai, David W. Juedes, Iyad A. Kanj:
The inapproximability of non-NP-hard optimization problems. Theor. Comput. Sci. 289(1): 553-571 (2002) - [c9]Eunseuk Oh, Iyad A. Kanj:
Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel Computers. HPCS 2002: 71-76 - [c8]Jianer Chen, Iyad A. Kanj, Guojun Wang:
Hypercube Network Fault Tolerance: A Probabilistic Approach. ICPP 2002: 65-72 - [c7]Jianer Chen, Iyad A. Kanj:
Improved Exact Algorithms for MAX-SAT. LATIN 2002: 341-355 - [c6]Iyad A. Kanj, Ljubomir Perkovic:
Improved Parameterized Algorithms for Planar Dominating Set. MFCS 2002: 399-410 - 2001
- [j1]Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements. J. Algorithms 41(2): 280-301 (2001) - [c5]Jianer Chen, Donald K. Friesen, Weijia Jia, Iyad A. Kanj:
Using Nondeterminism to Design Deterministic Algorithms. FSTTCS 2001: 120-131 - [c4]Jianer Chen, Iyad A. Kanj:
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. WG 2001: 55-65 - 2000
- [c3]Jianer Chen, Iyad A. Kanj:
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. ISAAC 2000: 132-143
1990 – 1999
- 1999
- [c2]Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements. WG 1999: 313-324 - 1998
- [c1]Liming Cai, David W. Juedes, Iyad A. Kanj:
The Inapproximability of Non NP-hard Optimization Problems. ISAAC 1998: 437-446
Coauthor Index
Dimuthu D. Arachchige
aka: Dimuthu D. K. Arachchige
aka: Dimuthu D. K. Arachchige
[j59] [i25] [j54] [c76] [c72] [i21] [j51] [c70] [i20] [j45] [j44] [c62] [i14] [j39] [j35] [c56] [j34] [c55] [c53] [i7] [i6] [j33] [c48] [c45] [i4] [j30] [j29] [c43] [j27] [j26] [j24] [i2] [j22] [j21] [c38] [j20] [j19] [j18] [c37] [c35] [c31] [j17] [j15] [c28] [c26] [c25] [j14] [j13] [j12] [c24] [c23] [c22] [j11] [j10] [c20] [c19] [c18] [j9] [j8] [c17] [c16] [c15] [c13] [c12] [c11] [c10]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 21:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
