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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size von Chen, Jianer, Fernau, Henning, Kanj, Iyad A., Xia, Ge

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

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

Volltext

Improved Parameterized Upper Bounds for Vertex Cover von Chen, Jianer, Kanj, Iyad A., Xia, Ge

Volltext

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

Volltext

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

Volltext

Guest Editorial： Special Issue on Parameterized Complexity von Cai, Liming, Kanj, Iyad, Rosamond, Frances A.

Volltext

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

Volltext

A Colored Path Problem and Its Applications von Eiben, Eduard, Kanj, Iyad

Volltext

ON SPANNERS AND LIGHTWEIGHT SPANNERS OF GEOMETRIC GRAPHS von KANJ, Iyad A, PERKOVIC, Ljubomir, GE XIA

Volltext

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

Volltext

Computing the Flip Distance Between Triangulations von Kanj, Iyad, Sedgwick, Eric, Xia, Ge

Volltext