Search Results - "Kanj, Iyad"

Improved upper bounds for vertex cover by JIANER CHEN, KANJ, Iyad A, GE XIA

“…This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time…”
Get full text

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data by Chen, Jianer, Huang, Qin, Kanj, Iyad, Xia, Ge

“…Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line- Cover problem produces a kernel of size Ω…”
Get full text

The Complexity of Tree Partitioning by An, Zhao, Feng, Qilong, Kanj, Iyad, Xia, Ge

“…Given a tree T on n vertices, and k , b , s 1 , … , s b ∈ N , the Tree Partitioning  problem asks if at most k edges can be removed from T so that the…”
Get full text

Seeing the trees and their branches in the network is hard by Kanj, Iyad A., Nakhleh, Luay, Than, Cuong, Xia, Ge

“…Phylogenetic networks are a restricted class of directed acyclic graphs that model evolutionary histories in the presence of reticulate evolutionary events,…”
Get full text

There are Plane Spanners of Degree 4 and Moderate Stretch Factor by Bonichon, Nicolas, Kanj, Iyad, Perković, Ljubomir, Xia, Ge

“…Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t ≥ 1 , a spanning subgraph G of E is said to be a t - spanner…”
Get full text

New enumeration algorithm for protein structure comparison and classification by Ashby, Cody, Johnson, Daniel, Walker, Karl, Kanj, Iyad A, Xia, Ge, Huang, Xiuzhen

“…Protein structure comparison and classification is an effective method for exploring protein structure-function relations. This problem is computationally…”
Get full text

Soft Steps: Exploring Quadrupedal Locomotion with Modular Soft Robots by Arachchige, Dimuthu D. K., Perera, Dulanjana M., Mallikarachchi, Sanjaya, Huzaifa, Umer, Kanj, Iyad, Godage, Isuru S.

“…Soft robots have emerged as a novel approach to legged locomotion, demonstrating strong potential for navigating unstructured terrains. The omnidirectional…”
Get full text

The parameterized complexity of some minimum label problems by Fellows, Michael R., Guo, Jiong, Kanj, Iyad

“…We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a…”
Get full text

Strong computational lower bounds via parameterized complexity by Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge

“…We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class includes weighted…”
Get full text

Tight lower bounds for certain parameterized NP-hard problems by Chen, Jianer, Chor, Benny, Fellows, Mike, Huang, Xiuzhen, Juedes, David, Kanj, Iyad A., Xia, Ge

“…Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard…”
Get full text

Editing Graphs into Disjoint Unions of Dense Clusters by Guo, Jiong, Kanj, Iyad A., Komusiewicz, Christian, Uhlmann, Johannes

“…In the Π- Cluster Editing problem, one is given an undirected graph  G , a density measure Π, and an integer  k ≥0, and needs to decide whether it is possible…”
Get full text

Local algorithms for edge colorings in UDGs by Kanj, Iyad A., Wiese, Andreas, Zhang, Fenghui

“…In this paper, we consider two problems: the edge coloring and the strong edge coloring problems on unit disk graphs (UDGs). Both problems have important…”
Get full text

Separability and topology control of quasi unit disk graphs by Chen, Jianer, (Andrew) Jiang, Anxiao, Kanj, Iyad A., Xia, Ge, Zhang, Fenghui

“…A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their…”
Get full text

Improved exact algorithms for MAX-SAT by Chen, Jianer, Kanj, Iyad A

Get full text

On parameterized exponential time complexity by Chen, Jianer, Kanj, Iyad A., Xia, Ge

“…In this paper we study the notion of parameterized exponential time complexity. We show that a parameterized problem can be solved in parameterized 2 o ( f ( k…”
Get full text

Labeled search trees and amortized analysis : Improved upper bounds for NP-hard problems by CHEN, Jianer, KANJ, Iyad A, GE XIA

“…A sequence of exact algorithms to solve the Vertex Cover and Maximum Independent Set problems have been proposed in the literature. All these algorithms appeal…”
Get full text

Polynomial time approximation schemes and parameterized complexity by Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge

“…In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of…”
Get full text

The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms by Kanj, Iyad A., Nakhleh, Luay, Xia, Ge

“…In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks —a model of language evolution where languages do not evolve via clean…”
Get full text

On the pseudo-achromatic number problem by Chen, Jianer, Kanj, Iyad A., Meng, Jie, Xia, Ge, Zhang, Fenghui

“…We study the parameterized complexity of the pseudo-achromatic number problem: Given an undirected graph and a parameter k , determine if the graph can be…”
Get full text

On the stretch factor of Delaunay triangulations of points in convex position by Cui, Shiliang, Kanj, Iyad A., Xia, Ge

“…Let S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the plane whose point set is S. The stretch factor of G is the maximum…”
Get full text