Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Iyad A.
    Last name: Kanj
    DBLP: 93/86
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 122  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.
    J. Comput. Syst. Sci. 2018, Volume 92 (0) 2018
    Journal article
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu.
    Degree four plane spanners: Simpler and better.
    JoCG 2017, Volume 8 (0) 2017
    Conference paper
    Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia.
    The Complexity of Tree Partitioning.
    CoRR 2017, Volume 0 (0) 2017
    Journal article
    Thore Husfeldt, Iyad A. Kanj.
    Guest Editorial: Special Issue on Parameterized and Exact Computation.
    Algorithmica 2017, Volume 79 (0) 2017
    Conference paper
    Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia.
    The Complexity of Tree Partitioning.
    Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings 2017 (0) 2017
    Conference paper
    Iyad A. Kanj, Eric Sedgwick, Ge Xia.
    Computing the Flip Distance Between Triangulations.
    Discrete Computational Geometry 2017, Volume 58 (0) 2017
    Conference paper
    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. 2017, Volume 18 (0) 2017
    Journal article
    Iyad A. Kanj, Dimitrios M. Thilikos, Ge Xia.
    On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability.
    Inf. Comput. 2017, Volume 257 (0) 2017
    Journal article
    Eduard Eiben, Iyad A. Kanj.
    How to navigate through obstacles?
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic.
    On the Ordered List Subgraph Embedding Problems.
    Algorithmica 2016, Volume 74 (0) 2016
    Conference paper
    Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu.
    Degree Four Plane Spanners: Simpler and Better.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Iyad A. Kanj, Ljubomir Perkovic, Duru Türkoglu.
    Degree Four Plane Spanners: Simpler and Better.
    32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA 2016 (0) 2016
    Conference paper
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Conference paper
    Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider.
    On Existential MSO and its Relation to ETH.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge.
    Twins in Subdivision Drawings of Hypergraphs.
    Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers 2016 (0) 2016
    Conference paper
    Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier.
    Finding Points in General Position.
    Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada 2016 (0) 2016
    Conference paper
    Ronald de Haan, Iyad A. Kanj, Stefan Szeider.
    On the Subexponential-Time Complexity of CSP.
    J. Artif. Intell. Res. (JAIR) 2015, Volume 52 (0) 2015
    Conference paper
    Iyad A. Kanj, Ge Xia.
    Flip Distance Is in FPT Time O(n+ k * c^k).
    32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany 2015 (0) 2015
    Conference paper
    Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perkovic, Ge Xia.
    There are Plane Spanners of Degree 4 and Moderate Stretch Factor.
    Discrete Computational Geometry 2015, Volume 53 (0) 2015
    Conference paper
    Iyad A. Kanj, Fenghui Zhang.
    3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size.
    Discrete Math., Alg. and Appl. 2015, Volume 7 (0) 2015
    Conference paper
    René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge.
    Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Vincent Froese, Iyad A. Kanj, André Nichterlein, Rolf Niedermeier.
    Finding Points in General Position.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Iyad A. Kanj, Stefan Szeider.
    Parameterized and subexponential-time complexity of satisfiability problems and applications.
    Theor. Comput. Sci. 2015, Volume 607 (0) 2015
    Conference paper
    René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge.
    Twins in Subdivision Drawings of Hypergraphs.
    CoRR 2015, Volume 0 (0) 2015
    Show item 1 to 25 of 122  

    Your query returned 122 matches in the database.