Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Iyad Kanj
@article{DBLP:journals/corr/abs-2402-17846,
author = {Iyad Kanj and
Salman Parsa},
title = {On the Parameterized Complexity of Motion Planning for Rectangular
Robots},
journal = {CoRR},
volume = {abs/2402.17846},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17846},
doi = {10.48550/ARXIV.2402.17846},
eprinttype = {arXiv},
eprint = {2402.17846},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17846.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/ArachchigePMHKG23,
author = {Dimuthu D. K. Arachchige and
Dulanjana M. Perera and
Sanjaya Mallikarachchi and
Umer Huzaifa and
Iyad Kanj and
Isuru S. Godage},
title = {Soft Steps: Exploring Quadrupedal Locomotion With Modular Soft Robots},
journal = {{IEEE} Access},
volume = {11},
pages = {63136--63148},
year = {2023},
url = {https://doi.org/10.1109/ACCESS.2023.3289156},
doi = {10.1109/ACCESS.2023.3289156},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/ArachchigePMHKG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On the parameterized complexity of clustering problems for incomplete
data},
journal = {J. Comput. Syst. Sci.},
volume = {134},
pages = {1--19},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.12.001},
doi = {10.1016/J.JCSS.2022.12.001},
timestamp = {Fri, 17 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aimech/ArachchigeVHKNCGG23,
author = {Dimuthu D. K. Arachchige and
Tanmay Varshney and
Umer Huzaifa and
Iyad Kanj and
Thrishantha Nanayakkara and
Yue Chen and
Hunter B. Gilbert and
Isuru S. Godage},
title = {Study on Soft Robotic Pinniped Locomotion},
booktitle = {{IEEE/ASME} International Conference on Advanced Intelligent Mechatronics,
{AIM} 2023, Seattle, WA, USA, June 28-30, 2023},
pages = {65--71},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/AIM46323.2023.10196209},
doi = {10.1109/AIM46323.2023.10196209},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aimech/ArachchigeVHKNCGG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/NakamuraKM23,
author = {Yuta Nakamura and
Iyad Kanj and
Tanu Malik},
editor = {Ingo Frommholz and
Frank Hopfgartner and
Mark Lee and
Michael Oakes and
Mounia Lalmas and
Min Zhang and
Rodrygo L. T. Santos},
title = {Efficient Differencing of System-level Provenance Graphs},
booktitle = {Proceedings of the 32nd {ACM} International Conference on Information
and Knowledge Management, {CIKM} 2023, Birmingham, United Kingdom,
October 21-25, 2023},
pages = {4220--4223},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583780.3615171},
doi = {10.1145/3583780.3615171},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/NakamuraKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/EibenGK23,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj},
editor = {Erin W. Chambers and
Joachim Gudmundsson},
title = {The Parameterized Complexity of Coordinated Motion Planning},
booktitle = {39th International Symposium on Computational Geometry, SoCG 2023,
June 12-15, 2023, Dallas, Texas, {USA}},
series = {LIPIcs},
volume = {258},
pages = {28:1--28:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2023.28},
doi = {10.4230/LIPICS.SOCG.2023.28},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/EibenGK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {The Computational Complexity of Concise Hypersphere Classification},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {9060--9070},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/eiben23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EibenGKOS23,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {From Data Completion to Problems on Hypercubes: {A} Parameterized
Analysis of the Independent Set Problem},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.16},
doi = {10.4230/LIPICS.IPEC.2023.16},
timestamp = {Wed, 13 Dec 2023 14:08:59 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EibenGKOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/robosoft/ArachchigePMKCG23,
author = {Dimuthu D. K. Arachchige and
Dulanjana M. Perera and
Sanjaya Mallikarachchi and
Iyad Kanj and
Yue Chen and
Isuru S. Godage},
title = {Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and
Helical Rolling Gaits},
booktitle = {{IEEE} International Conference on Soft Robotics, RoboSoft 2023, Singapore,
April 3-7, 2023},
pages = {1--6},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/RoboSoft55895.2023.10121918},
doi = {10.1109/ROBOSOFT55895.2023.10121918},
timestamp = {Mon, 22 May 2023 21:13:41 +0200},
biburl = {https://dblp.org/rec/conf/robosoft/ArachchigePMKCG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/robosoft/PereraAMGKCG23,
author = {Dulanjana M. Perera and
Dimuthu D. K. Arachchige and
Sanjaya Mallikarachchi and
Talal Ghafoor and
Iyad Kanj and
Yue Chen and
Isuru S. Godage},
title = {Teleoperation of Soft Modular Robots: Study on Real-time Stability
and Gait Control},
booktitle = {{IEEE} International Conference on Soft Robotics, RoboSoft 2023, Singapore,
April 3-7, 2023},
pages = {1--7},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/RoboSoft55895.2023.10122121},
doi = {10.1109/ROBOSOFT55895.2023.10122121},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/robosoft/PereraAMGKCG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-02285,
author = {Dimuthu D. K. Arachchige and
Dulanjana M. Perera and
Sanjaya Mallikarachchi and
Iyad Kanj and
Yue Chen and
Isuru S. Godage},
title = {Wheelless Soft Robotic Snake Locomotion: Study on Sidewinding and
Helical Rolling Gaits},
journal = {CoRR},
volume = {abs/2303.02285},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.02285},
doi = {10.48550/ARXIV.2303.02285},
eprinttype = {arXiv},
eprint = {2303.02285},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-02285.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-02291,
author = {Dimuthu D. K. Arachchige and
Dulanjana M. Perera and
Sanjaya Mallikarachchi and
Iyad Kanj and
Yue Chen and
Hunter B. Gilbert and
Isuru S. Godage},
title = {Dynamic Modeling and Validation of Soft Robotic Snake Locomotion},
journal = {CoRR},
volume = {abs/2303.02291},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.02291},
doi = {10.48550/ARXIV.2303.02291},
eprinttype = {arXiv},
eprint = {2303.02291},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-02291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-05454,
author = {Dulanjana M. Perera and
Dimuthu D. K. Arachchige and
Sanjaya Mallikarachchi and
Talal Ghafoor and
Iyad Kanj and
Yue Chen and
Isuru S. Godage},
title = {Teleoperation of Soft Modular Robots: Study on Real-time Stability
and Gait Control},
journal = {CoRR},
volume = {abs/2303.05454},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.05454},
doi = {10.48550/ARXIV.2303.05454},
eprinttype = {arXiv},
eprint = {2303.05454},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-05454.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06945,
author = {Dimuthu D. K. Arachchige and
Tanmay Varshney and
Umer Huzaifa and
Iyad Kanj and
Thrishantha Nanayakkara and
Yue Chen and
Hunter B. Gilbert and
Isuru S. Godage},
title = {Study on Soft Robotic Pinniped Locomotion},
journal = {CoRR},
volume = {abs/2304.06945},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06945},
doi = {10.48550/ARXIV.2304.06945},
eprinttype = {arXiv},
eprint = {2304.06945},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06945.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-10815,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Qian Li and
Ge Xia},
title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal
Update Time},
journal = {CoRR},
volume = {abs/2310.10815},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.10815},
doi = {10.48550/ARXIV.2310.10815},
eprinttype = {arXiv},
eprint = {2310.10815},
timestamp = {Sat, 03 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-10815.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07103,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Computational Complexity of Concise Hypersphere Classification},
journal = {CoRR},
volume = {abs/2312.07103},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07103},
doi = {10.48550/ARXIV.2312.07103},
eprinttype = {arXiv},
eprint = {2312.07103},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07144,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj},
title = {The Parameterized Complexity of Coordinated Motion Planning},
journal = {CoRR},
volume = {abs/2312.07144},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07144},
doi = {10.48550/ARXIV.2312.07144},
eprinttype = {arXiv},
eprint = {2312.07144},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07628,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {Finding a Cluster in Incomplete Data},
journal = {CoRR},
volume = {abs/2312.07628},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07628},
doi = {10.48550/ARXIV.2312.07628},
eprinttype = {arXiv},
eprint = {2312.07628},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ChenHKX22,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Ge Xia},
title = {Near-optimal algorithms for point-line fitting problems},
journal = {J. Comput. Geom.},
volume = {13},
number = {1},
year = {2022},
url = {https://doi.org/10.20382/jocg.v13i1a9},
doi = {10.20382/JOCG.V13I1A9},
timestamp = {Tue, 11 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ChenHKX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ral/MengGK22,
author = {Brandon H. Meng and
Isuru S. Godage and
Iyad Kanj},
title = {RRT*-Based Path Planning for Continuum Arms},
journal = {{IEEE} Robotics Autom. Lett.},
volume = {7},
number = {3},
pages = {6830--6837},
year = {2022},
url = {https://doi.org/10.1109/LRA.2022.3174257},
doi = {10.1109/LRA.2022.3174257},
timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ral/MengGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BergrenEGK22,
author = {Dan Bergren and
Eduard Eiben and
Robert Ganian and
Iyad Kanj},
title = {On Covering Segments with Unit Intervals},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {2},
pages = {1200--1230},
year = {2022},
url = {https://doi.org/10.1137/20m1336412},
doi = {10.1137/20M1336412},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BergrenEGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EibenGKOS22,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Finding a Cluster in Incomplete Data},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {47:1--47:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.47},
doi = {10.4230/LIPICS.ESA.2022.47},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/EibenGKOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/NakamuraMKG22,
author = {Yuta Nakamura and
Tanu Malik and
Iyad Kanj and
Ashish Gehani},
title = {Provenance-based Workflow Diagnostics Using Program Specification},
booktitle = {29th {IEEE} International Conference on High Performance Computing,
Data, and Analytics, HiPC 2022, Bengaluru, India, December 18-21,
2022},
pages = {292--301},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/HiPC56025.2022.00046},
doi = {10.1109/HIPC56025.2022.00046},
timestamp = {Wed, 03 May 2023 17:27:40 +0200},
biburl = {https://dblp.org/rec/conf/hipc/NakamuraMKG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChenHKX22,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Ge Xia},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Near-Optimal Algorithms for Point-Line Covering Problems},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {21:1--21:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.21},
doi = {10.4230/LIPICS.STACS.2022.21},
timestamp = {Sat, 12 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChenHKX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGKOS21,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {The Parameterized Complexity of Clustering Incomplete Data},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {7296--7304},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i8.16896},
doi = {10.1609/AAAI.V35I8.16896},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGKOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/MengGK21,
author = {Brandon H. Meng and
Isuru S. Godage and
Iyad Kanj},
title = {Smooth Path Planning for Continuum Arms},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2021, Xi'an, China, May 30 - June 5, 2021},
pages = {7809--7814},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICRA48506.2021.9560982},
doi = {10.1109/ICRA48506.2021.9560982},
timestamp = {Fri, 22 Oct 2021 19:54:31 +0200},
biburl = {https://dblp.org/rec/conf/icra/MengGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icra/MengADGK21,
author = {Brandon H. Meng and
Dimuthu D. K. Arachchige and
Jiahao Deng and
Isuru S. Godage and
Iyad Kanj},
title = {Anticipatory Path Planning for Continuum Arms in Dynamic Environments},
booktitle = {{IEEE} International Conference on Robotics and Automation, {ICRA}
2021, Xi'an, China, May 30 - June 5, 2021},
pages = {7815--7820},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICRA48506.2021.9560952},
doi = {10.1109/ICRA48506.2021.9560952},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icra/MengADGK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenHK0X21,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Qian Li and
Ge Xia},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal
Update Time},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {48:1--48:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.48},
doi = {10.4230/LIPICS.ISAAC.2021.48},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChenHK0X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-06939,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Ge Xia},
title = {Optimal Streaming Algorithms for Graph Matching},
journal = {CoRR},
volume = {abs/2102.06939},
year = {2021},
url = {https://arxiv.org/abs/2102.06939},
eprinttype = {arXiv},
eprint = {2102.06939},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-06939.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AnFKX20,
author = {Zhao An and
Qilong Feng and
Iyad Kanj and
Ge Xia},
title = {The Complexity of Tree Partitioning},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2606--2643},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00701-x},
doi = {10.1007/S00453-020-00701-X},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AnFKX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KanjKSL20,
author = {Iyad Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {640--681},
year = {2020},
url = {https://doi.org/10.1137/19M1239362},
doi = {10.1137/19M1239362},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KanjKSL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EibenK20,
author = {Eduard Eiben and
Iyad Kanj},
title = {A Colored Path Problem and Its Applications},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {47:1--47:48},
year = {2020},
url = {https://doi.org/10.1145/3396573},
doi = {10.1145/3396573},
timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/EibenK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GanianHKS20,
author = {Robert Ganian and
Ronald de Haan and
Iyad Kanj and
Stefan Szeider},
title = {On Existential {MSO} and Its Relation to {ETH}},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {4},
pages = {22:1--22:32},
year = {2020},
url = {https://doi.org/10.1145/3417759},
doi = {10.1145/3417759},
timestamp = {Tue, 08 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/GanianHKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/GanianKOS20,
author = {Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On the Parameterized Complexity of Clustering Incomplete Data into
Subspaces of Small Rank},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {3906--3913},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i04.5804},
doi = {10.1609/AAAI.V34I04.5804},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/GanianKOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGKX20,
author = {Eduard Eiben and
Isuru S. Godage and
Iyad Kanj and
Ge Xia},
title = {On the Problem of Covering a 3-D Terrain},
booktitle = {The Thirty-Fourth {AAAI} Conference on Artificial Intelligence, {AAAI}
2020, The Thirty-Second Innovative Applications of Artificial Intelligence
Conference, {IAAI} 2020, The Tenth {AAAI} Symposium on Educational
Advances in Artificial Intelligence, {EAAI} 2020, New York, NY, USA,
February 7-12, 2020},
pages = {10361--10368},
publisher = {{AAAI} Press},
year = {2020},
url = {https://doi.org/10.1609/aaai.v34i06.6603},
doi = {10.1609/AAAI.V34I06.6603},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGKX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BergrenEGK20,
author = {Dan Bergren and
Eduard Eiben and
Robert Ganian and
Iyad Kanj},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {On Covering Segments with Unit Intervals},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {13:1--13:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.13},
doi = {10.4230/LIPICS.STACS.2020.13},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BergrenEGK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-02363,
author = {Jianer Chen and
Qin Huang and
Iyad Kanj and
Ge Xia},
title = {Near-Optimal Algorithms for Point-Line Covering Problems},
journal = {CoRR},
volume = {abs/2012.02363},
year = {2020},
url = {https://arxiv.org/abs/2012.02363},
eprinttype = {arXiv},
eprint = {2012.02363},
timestamp = {Wed, 09 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-02363.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/EibenGKS19,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Stefan Szeider},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {The Parameterized Complexity of Cascading Portfolio Scheduling},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {7666--7676},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/8ce1a43fb75e779c6b794ba4d255cf6d-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/EibenGKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/robosoft/DengMKG19,
author = {Jiahao Deng and
Brandon H. Meng and
Iyad Kanj and
Isuru S. Godage},
title = {Near-optimal Smooth Path Planning for Multisection Continuum Arms},
booktitle = {{IEEE} International Conference on Soft Robotics, RoboSoft 2019, Seoul,
South Korea, April 14-18, 2019},
pages = {416--421},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/ROBOSOFT.2019.8722778},
doi = {10.1109/ROBOSOFT.2019.8722778},
timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
biburl = {https://dblp.org/rec/conf/robosoft/DengMKG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01465,
author = {Eduard Eiben and
Robert Ganian and
Iyad Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {On Clustering Incomplete Data},
journal = {CoRR},
volume = {abs/1911.01465},
year = {2019},
url = {http://arxiv.org/abs/1911.01465},
eprinttype = {arXiv},
eprint = {1911.01465},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KanjKSL18,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Parameterized algorithms for recognizing monopolar and 2-subcolorable
graphs},
journal = {J. Comput. Syst. Sci.},
volume = {92},
pages = {22--47},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.08.002},
doi = {10.1016/J.JCSS.2017.08.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KanjKSL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/EibenGKY18,
author = {Eduard Eiben and
Jonathan Gemmell and
Iyad A. Kanj and
Andrew Youngdahl},
editor = {Sheila A. McIlraith and
Kilian Q. Weinberger},
title = {Improved Results for Minimum Constraint Removal},
booktitle = {Proceedings of the Thirty-Second {AAAI} Conference on Artificial Intelligence,
(AAAI-18), the 30th innovative Applications of Artificial Intelligence
(IAAI-18), and the 8th {AAAI} Symposium on Educational Advances in
Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February
2-7, 2018},
pages = {6477--6484},
publisher = {{AAAI} Press},
year = {2018},
url = {https://doi.org/10.1609/aaai.v32i1.12100},
doi = {10.1609/AAAI.V32I1.12100},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/EibenGKY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KanjKSL18,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.51},
doi = {10.4230/LIPICS.ESA.2018.51},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/KanjKSL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EibenK18,
author = {Eduard Eiben and
Iyad A. Kanj},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {How to Navigate Through Obstacles?},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {48:1--48:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.48},
doi = {10.4230/LIPICS.ICALP.2018.48},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EibenK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/GanianKOS18,
author = {Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Parameterized Algorithms for the Matrix Completion Problem},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {1642--1651},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/ganian18a.html},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/GanianKOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03423,
author = {Robert Ganian and
Iyad A. Kanj and
Sebastian Ordyniak and
Stefan Szeider},
title = {Parameterized Algorithms for the Matrix Completion Problem},
journal = {CoRR},
volume = {abs/1804.03423},
year = {2018},
url = {http://arxiv.org/abs/1804.03423},
eprinttype = {arXiv},
eprint = {1804.03423},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-08772,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Solving Partition Problems Almost Always Requires Pushing Many Vertices
Around},
journal = {CoRR},
volume = {abs/1808.08772},
year = {2018},
url = {http://arxiv.org/abs/1808.08772},
eprinttype = {arXiv},
eprint = {1808.08772},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-08772.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-03615,
author = {Jiahao Deng and
Brandon H. Meng and
Iyad Kanj and
Isuru S. Godage},
title = {Near-optimal Smooth Path Planning for Multisection Continuum Arms},
journal = {CoRR},
volume = {abs/1812.03615},
year = {2018},
url = {http://arxiv.org/abs/1812.03615},
eprinttype = {arXiv},
eprint = {1812.03615},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-03615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HusfeldtK17,
author = {Thore Husfeldt and
Iyad A. Kanj},
title = {Guest Editorial: Special Issue on Parameterized and Exact Computation},
journal = {Algorithmica},
volume = {79},
number = {1},
pages = {1--2},
year = {2017},
url = {https://doi.org/10.1007/s00453-017-0339-8},
doi = {10.1007/S00453-017-0339-8},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HusfeldtK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KanjSX17,
author = {Iyad A. Kanj and
Eric Sedgwick and
Ge Xia},
title = {Computing the Flip Distance Between Triangulations},
journal = {Discret. Comput. Geom.},
volume = {58},
number = {2},
pages = {313--344},
year = {2017},
url = {https://doi.org/10.1007/s00454-017-9867-x},
doi = {10.1007/S00454-017-9867-X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/KanjSX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KanjTX17,
author = {Iyad A. Kanj and
Dimitrios M. Thilikos and
Ge Xia},
title = {On the parameterized complexity of monotone and antimonotone weighted
circuit satisfiability},
journal = {Inf. Comput.},
volume = {257},
pages = {139--156},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.11.002},
doi = {10.1016/J.IC.2017.11.002},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KanjTX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/FroeseKNN17,
author = {Vincent Froese and
Iyad A. Kanj and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Finding Points in General Position},
journal = {Int. J. Comput. Geom. Appl.},
volume = {27},
number = {4},
pages = {277--296},
year = {2017},
url = {https://doi.org/10.1142/S021819591750008X},
doi = {10.1142/S021819591750008X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/FroeseKNN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KanjPT17,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Duru T{\"{u}}rkoglu},
title = {Degree four plane spanners: Simpler and better},
journal = {J. Comput. Geom.},
volume = {8},
number = {2},
pages = {3--31},
year = {2017},
url = {https://doi.org/10.20382/jocg.v8i2a2},
doi = {10.20382/JOCG.V8I2A2},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KanjPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/HaanKS17,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {On the Parameterized Complexity of Finding Small Unsatisfiable Subsets
of {CNF} Formulas and {CSP} Instances},
journal = {{ACM} Trans. Comput. Log.},
volume = {18},
number = {3},
pages = {21:1--21:46},
year = {2017},
url = {https://doi.org/10.1145/3091528},
doi = {10.1145/3091528},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/HaanKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AnFKX17,
author = {Zhao An and
Qilong Feng and
Iyad A. Kanj and
Ge Xia},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {The Complexity of Tree Partitioning},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {37--48},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_4},
doi = {10.1007/978-3-319-62127-2\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AnFKX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanjKSL17,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
title = {Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable
Graphs},
journal = {CoRR},
volume = {abs/1702.04322},
year = {2017},
url = {http://arxiv.org/abs/1702.04322},
eprinttype = {arXiv},
eprint = {1702.04322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanjKSL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnFKX17,
author = {Zhao An and
Qilong Feng and
Iyad A. Kanj and
Ge Xia},
title = {The Complexity of Tree Partitioning},
journal = {CoRR},
volume = {abs/1704.05896},
year = {2017},
url = {http://arxiv.org/abs/1704.05896},
eprinttype = {arXiv},
eprint = {1704.05896},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AnFKX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-04043,
author = {Eduard Eiben and
Iyad A. Kanj},
title = {How to navigate through obstacles?},
journal = {CoRR},
volume = {abs/1712.04043},
year = {2017},
url = {http://arxiv.org/abs/1712.04043},
eprinttype = {arXiv},
eprint = {1712.04043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-04043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HassanKLP16,
author = {Olawale Hassan and
Iyad A. Kanj and
Daniel Lokshtanov and
Ljubomir Perkovic},
title = {On the Ordered List Subgraph Embedding Problems},
journal = {Algorithmica},
volume = {74},
number = {3},
pages = {992--1018},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9980-2},
doi = {10.1007/S00453-015-9980-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HassanKLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/FroeseKNN16,
author = {Vincent Froese and
Iyad A. Kanj and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {Thomas C. Shermer},
title = {Finding Points in General Position},
booktitle = {Proceedings of the 28th Canadian Conference on Computational Geometry,
{CCCG} 2016, August 3-5, 2016, Simon Fraser University, Vancouver,
British Columbia, Canada},
pages = {7--14},
publisher = {Simon Fraser University, Vancouver, British Columbia, Canada},
year = {2016},
timestamp = {Thu, 12 Mar 2020 11:28:28 +0100},
biburl = {https://dblp.org/rec/conf/cccg/FroeseKNN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KanjPT16,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Duru T{\"{u}}rkoglu},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Degree Four Plane Spanners: Simpler and Better},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {45:1--45:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.45},
doi = {10.4230/LIPICS.SOCG.2016.45},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KanjPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BevernKKNS16,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
editor = {Yifan Hu and
Martin N{\"{o}}llenburg},
title = {Twins in Subdivision Drawings of Hypergraphs},
booktitle = {Graph Drawing and Network Visualization - 24th International Symposium,
{GD} 2016, Athens, Greece, September 19-21, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9801},
pages = {67--80},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-50106-2\_6},
doi = {10.1007/978-3-319-50106-2\_6},
timestamp = {Sat, 17 Dec 2022 21:30:20 +0100},
biburl = {https://dblp.org/rec/conf/gd/BevernKKNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GanianHKS16,
author = {Robert Ganian and
Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {On Existential {MSO} and its Relation to {ETH}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {42:1--42:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.42},
doi = {10.4230/LIPICS.MFCS.2016.42},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/GanianHKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KanjKSL16,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
editor = {Rasmus Pagh},
title = {Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable
Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.14},
doi = {10.4230/LIPICS.SWAT.2016.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/KanjKSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanjPT16,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Duru T{\"{u}}rkoglu},
title = {Degree Four Plane Spanners: Simpler and Better},
journal = {CoRR},
volume = {abs/1603.03818},
year = {2016},
url = {http://arxiv.org/abs/1603.03818},
eprinttype = {arXiv},
eprint = {1603.03818},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanjPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BonichonKPX15,
author = {Nicolas Bonichon and
Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
title = {There are Plane Spanners of Degree 4 and Moderate Stretch Factor},
journal = {Discret. Comput. Geom.},
volume = {53},
number = {3},
pages = {514--546},
year = {2015},
url = {https://doi.org/10.1007/s00454-015-9676-z},
doi = {10.1007/S00454-015-9676-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BonichonKPX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/KanjZ15,
author = {Iyad A. Kanj and
Fenghui Zhang},
title = {3-Hitting set on bounded degree hypergraphs: Upper and lower bounds
on the kernel size},
journal = {Discret. Math. Algorithms Appl.},
volume = {7},
number = {2},
pages = {1550011:1--1550011:17},
year = {2015},
url = {https://doi.org/10.1142/S1793830915500111},
doi = {10.1142/S1793830915500111},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/KanjZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/HaanKS15,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {On the Subexponential-Time Complexity of {CSP}},
journal = {J. Artif. Intell. Res.},
volume = {52},
pages = {203--234},
year = {2015},
url = {https://doi.org/10.1613/jair.4540},
doi = {10.1613/JAIR.4540},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/HaanKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjS15,
author = {Iyad A. Kanj and
Stefan Szeider},
title = {Parameterized and subexponential-time complexity of satisfiability
problems and applications},
journal = {Theor. Comput. Sci.},
volume = {607},
pages = {282--295},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.08.029},
doi = {10.1016/J.TCS.2015.08.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanjS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjLLTXXYZZZ15,
author = {Iyad A. Kanj and
Guohui Lin and
Tian Liu and
Weitian Tong and
Ge Xia and
Jinhui Xu and
Boting Yang and
Fenghui Zhang and
Peng Zhang and
Binhai Zhu},
title = {Improved parameterized and exact algorithms for cut problems on trees},
journal = {Theor. Comput. Sci.},
volume = {607},
pages = {455--470},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.010},
doi = {10.1016/J.TCS.2015.06.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanjLLTXXYZZZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KanjX15,
author = {Iyad A. Kanj and
Ge Xia},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Flip Distance Is in {FPT} Time O(n+ k * c{\^{}}k)},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {500--512},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.500},
doi = {10.4230/LIPICS.STACS.2015.500},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KanjX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2015,
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {http://www.dagstuhl.de/dagpub/978-3-939897-92-7},
isbn = {978-3-939897-92-7},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKKNS15,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
title = {Well-Formed Separator Sequences, with an Application to Hypergraph
Drawing},
journal = {CoRR},
volume = {abs/1507.02350},
year = {2015},
url = {http://arxiv.org/abs/1507.02350},
eprinttype = {arXiv},
eprint = {1507.02350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FroeseKNN15,
author = {Vincent Froese and
Iyad A. Kanj and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
title = {Finding Points in General Position},
journal = {CoRR},
volume = {abs/1508.01097},
year = {2015},
url = {http://arxiv.org/abs/1508.01097},
eprinttype = {arXiv},
eprint = {1508.01097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FroeseKNN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BevernKKNS15a,
author = {Ren{\'{e}} van Bevern and
Iyad A. Kanj and
Christian Komusiewicz and
Rolf Niedermeier and
Manuel Sorge},
title = {Twins in Subdivision Drawings of Hypergraphs},
journal = {CoRR},
volume = {abs/1511.09389},
year = {2015},
url = {http://arxiv.org/abs/1511.09389},
eprinttype = {arXiv},
eprint = {1511.09389},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BevernKKNS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/KanjX14,
author = {Iyad A. Kanj and
Ge Xia},
title = {On certain geometric properties of the Yao-Yao graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {78--87},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9570-z},
doi = {10.1007/S10878-012-9570-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/KanjX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KanjLLTXXYZZZ14,
author = {Iyad A. Kanj and
Guohui Lin and
Tian Liu and
Weitian Tong and
Ge Xia and
Jinhui Xu and
Boting Yang and
Fenghui Zhang and
Peng Zhang and
Binhai Zhu},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {Algorithms for Cut Problems on Trees},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {283--298},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_22},
doi = {10.1007/978-3-319-12691-3\_22},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/KanjLLTXXYZZZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KanjS14,
author = {Iyad A. Kanj and
Stefan Szeider},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {Parameterized and Subexponential-Time Complexity of Satisfiability
Problems and Applications},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {637--651},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_48},
doi = {10.1007/978-3-319-12691-3\_48},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/KanjS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BonichonKPX14,
author = {Nicolas Bonichon and
Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
editor = {Siu{-}Wing Cheng and
Olivier Devillers},
title = {There are Plane Spanners of Maximum Degree 4},
booktitle = {30th Annual Symposium on Computational Geometry, SoCG'14, Kyoto, Japan,
June 08 - 11, 2014},
pages = {20},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2582112.2582141},
doi = {10.1145/2582112.2582141},
timestamp = {Mon, 14 Jun 2021 16:39:30 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BonichonKPX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/HaanKS14,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Barry O'Sullivan},
title = {Subexponential Time Complexity of {CSP} with Global Constraints},
booktitle = {Principles and Practice of Constraint Programming - 20th International
Conference, {CP} 2014, Lyon, France, September 8-12, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8656},
pages = {272--288},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-10428-7\_21},
doi = {10.1007/978-3-319-10428-7\_21},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/cp/HaanKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/HaanKS14,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {Small Unsatisfiable Subsets in Constraint Satisfaction},
booktitle = {26th {IEEE} International Conference on Tools with Artificial Intelligence,
{ICTAI} 2014, Limassol, Cyprus, November 10-12, 2014},
pages = {429--436},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/ICTAI.2014.72},
doi = {10.1109/ICTAI.2014.72},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ictai/HaanKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HassanKLP14,
author = {Olawale Hassan and
Iyad A. Kanj and
Daniel Lokshtanov and
Ljubomir Perkovic},
title = {On the Ordered List Subgraph Embedding Problems},
journal = {CoRR},
volume = {abs/1403.2009},
year = {2014},
url = {http://arxiv.org/abs/1403.2009},
eprinttype = {arXiv},
eprint = {1403.2009},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HassanKLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonichonKPX14,
author = {Nicolas Bonichon and
Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
title = {There are Plane Spanners of Maximum Degree 4},
journal = {CoRR},
volume = {abs/1403.5350},
year = {2014},
url = {http://arxiv.org/abs/1403.5350},
eprinttype = {arXiv},
eprint = {1403.5350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonichonKPX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanjX14,
author = {Iyad A. Kanj and
Ge Xia},
title = {Flip Distance is in {FPT} time {\textdollar}O(n+ k {\textbackslash}cdot
c{\^{}}k){\textdollar}},
journal = {CoRR},
volume = {abs/1407.1525},
year = {2014},
url = {http://arxiv.org/abs/1407.1525},
eprinttype = {arXiv},
eprint = {1407.1525},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KanjX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKMXZ13,
author = {Jianer Chen and
Iyad A. Kanj and
Jie Meng and
Ge Xia and
Fenghui Zhang},
title = {Parameterized top-\emph{K} algorithms},
journal = {Theor. Comput. Sci.},
volume = {470},
pages = {105--119},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.10.052},
doi = {10.1016/J.TCS.2012.10.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKMXZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjZ13,
author = {Iyad A. Kanj and
Fenghui Zhang},
title = {On the independence number of graphs with maximum degree 3},
journal = {Theor. Comput. Sci.},
volume = {478},
pages = {51--75},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.031},
doi = {10.1016/J.TCS.2013.01.031},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanjZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/KanjS13,
author = {Iyad A. Kanj and
Stefan Szeider},
editor = {Marie desJardins and
Michael L. Littman},
title = {On the Subexponential Time Complexity of {CSP}},
booktitle = {Proceedings of the Twenty-Seventh {AAAI} Conference on Artificial
Intelligence, July 14-18, 2013, Bellevue, Washington, {USA}},
pages = {459--465},
publisher = {{AAAI} Press},
year = {2013},
url = {https://doi.org/10.1609/aaai.v27i1.8609},
doi = {10.1609/AAAI.V27I1.8609},
timestamp = {Mon, 04 Sep 2023 15:56:33 +0200},
biburl = {https://dblp.org/rec/conf/aaai/KanjS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iccit/Kanj13,
author = {Iyad Kanj},
title = {Geometric spanners: Recent results and open directions},
booktitle = {Third International Conference on Communications and Information Technology,
{ICCIT} 2013, Beirut, Lebanon, June 19-21, 2013},
pages = {78--82},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/ICCITechnology.2013.6579526},
doi = {10.1109/ICCITECHNOLOGY.2013.6579526},
timestamp = {Wed, 04 May 2022 13:59:20 +0200},
biburl = {https://dblp.org/rec/conf/iccit/Kanj13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/KanjXZ13,
author = {Iyad A. Kanj and
Ge Xia and
Binhai Zhu},
editor = {Zhipeng Cai and
Oliver Eulenstein and
Daniel Janies and
Daniel Schwartz},
title = {The Radiation Hybrid Map Construction Problem Is {FPT}},
booktitle = {Bioinformatics Research and Applications, 9th International Symposium,
{ISBRA} 2013, Charlotte, NC, USA, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7875},
pages = {5--16},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38036-5\_5},
doi = {10.1007/978-3-642-38036-5\_5},
timestamp = {Thu, 20 Aug 2020 15:56:19 +0200},
biburl = {https://dblp.org/rec/conf/isbra/KanjXZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HassanKLP13,
author = {Olawale Hassan and
Iyad A. Kanj and
Daniel Lokshtanov and
Ljubomir Perkovic},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {On the Ordered List Subgraph Embedding Problems},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {189--201},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_17},
doi = {10.1007/978-3-319-03898-8\_17},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HassanKLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/HaanKS13,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {Local Backbones},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {377--393},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_28},
doi = {10.1007/978-3-642-39071-5\_28},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/HaanKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KanjX13,
author = {Iyad A. Kanj and
Ge Xia},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {When Is Weighted Satisfiability FPT?},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {451--462},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_39},
doi = {10.1007/978-3-642-40104-6\_39},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/KanjX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-1996,
author = {Iyad A. Kanj and
Stefan Szeider},
title = {On the Subexponential Time Complexity of {CSP}},
journal = {CoRR},
volume = {abs/1304.1996},
year = {2013},
url = {http://arxiv.org/abs/1304.1996},
eprinttype = {arXiv},
eprint = {1304.1996},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-3653,
author = {Iyad A. Kanj and
Guohui Lin and
Tian Liu and
Weitian Tong and
Ge Xia and
Jinhui Xu and
Boting Yang and
Fenghui Zhang and
Peng Zhang and
Binhai Zhu},
title = {Algorithms for Cut Problems on Trees},
journal = {CoRR},
volume = {abs/1304.3653},
year = {2013},
url = {http://arxiv.org/abs/1304.3653},
eprinttype = {arXiv},
eprint = {1304.3653},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-3653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5479,
author = {Ronald de Haan and
Iyad A. Kanj and
Stefan Szeider},
title = {Local Backbones},
journal = {CoRR},
volume = {abs/1304.5479},
year = {2013},
url = {http://arxiv.org/abs/1304.5479},
eprinttype = {arXiv},
eprint = {1304.5479},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenFKLZ12,
author = {Jianer Chen and
Jia{-}Hao Fan and
Iyad A. Kanj and
Yang Liu and
Fenghui Zhang},
title = {Multicut in trees viewed through the eyes of vertex cover},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {5},
pages = {1637--1650},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2012.03.001},
doi = {10.1016/J.JCSS.2012.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenFKLZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjX12,
author = {Iyad A. Kanj and
Ge Xia},
title = {Improved local algorithms for spanner construction},
journal = {Theor. Comput. Sci.},
volume = {453},
pages = {54--64},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.05.027},
doi = {10.1016/J.TCS.2011.05.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanjX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmc/JenkinsKXZ12,
author = {Jonathan P. Jenkins and
Iyad A. Kanj and
Ge Xia and
Fenghui Zhang},
title = {Local Construction of Spanners in the 3D Space},
journal = {{IEEE} Trans. Mob. Comput.},
volume = {11},
number = {7},
pages = {1140--1150},
year = {2012},
url = {https://doi.org/10.1109/TMC.2011.142},
doi = {10.1109/TMC.2011.142},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tmc/JenkinsKXZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/ChenK12,
author = {Jianer Chen and
Iyad A. Kanj},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {Parameterized Complexity and Subexponential-Time Computability},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {162--195},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_11},
doi = {10.1007/978-3-642-30891-8\_11},
timestamp = {Mon, 03 Jan 2022 22:35:50 +0100},
biburl = {https://dblp.org/rec/conf/birthday/ChenK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KanjX12,
author = {Iyad A. Kanj and
Ge Xia},
editor = {Guohui Lin},
title = {On Certain Geometric Properties of the Yao-Yao Graphs},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {223--233},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_20},
doi = {10.1007/978-3-642-31770-5\_20},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/KanjX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GuoKKU11,
author = {Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann},
title = {Editing Graphs into Disjoint Unions of Dense Clusters},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {949--970},
year = {2011},
url = {https://doi.org/10.1007/s00453-011-9487-4},
doi = {10.1007/S00453-011-9487-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GuoKKU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CuiKX11,
author = {Shiliang Cui and
Iyad A. Kanj and
Ge Xia},
title = {On the stretch factor of Delaunay triangulations of points in convex
position},
journal = {Comput. Geom.},
volume = {44},
number = {2},
pages = {104--109},
year = {2011},
url = {https://doi.org/10.1016/j.comgeo.2010.09.007},
doi = {10.1016/J.COMGEO.2010.09.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CuiKX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KanjPSX11,
author = {Iyad A. Kanj and
Michael J. Pelsmajer and
Marcus Schaefer and
Ge Xia},
title = {On the induced matching problem},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {6},
pages = {1058--1070},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.09.001},
doi = {10.1016/J.JCSS.2010.09.001},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/KanjPSX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjWZ11,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
title = {Local algorithms for edge colorings in UDGs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4704--4714},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.005},
doi = {10.1016/J.TCS.2011.05.005},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KanjWZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/ChenJKXZ11,
author = {Jianer Chen and
Anxiao Jiang and
Iyad A. Kanj and
Ge Xia and
Fenghui Zhang},
title = {Separability and topology control of quasi unit disk graphs},
journal = {Wirel. Networks},
volume = {17},
number = {1},
pages = {53--67},
year = {2011},
url = {https://doi.org/10.1007/s11276-010-0264-0},
doi = {10.1007/S11276-010-0264-0},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/winet/ChenJKXZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GuoKK11,
author = {Jiong Guo and
Iyad A. Kanj and
Stefan Kratsch},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Safe Approximation and Its Relation to Kernelization},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {169--180},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_14},
doi = {10.1007/978-3-642-28050-4\_14},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GuoKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/KanjZ11,
author = {Iyad A. Kanj and
Fenghui Zhang},
editor = {Alberto Marchetti{-}Spaccamela and
Michael Segal},
title = {3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds
on the Kernel Size},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
{ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6595},
pages = {163--174},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19754-3\_17},
doi = {10.1007/978-3-642-19754-3\_17},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/tapas/KanjZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChenFKLZ11,
author = {Jianer Chen and
Jia{-}Hao Fan and
Iyad A. Kanj and
Yang Liu and
Fenghui Zhang},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Multicut in Trees Viewed through the Eyes of Vertex Cover},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {219--230},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_19},
doi = {10.1007/978-3-642-22300-6\_19},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChenFKLZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KanjZ11,
author = {Iyad A. Kanj and
Fenghui Zhang},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {On the Independence Number of Graphs with Maximum Degree 3},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {238--249},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_22},
doi = {10.1007/978-3-642-25870-1\_22},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/KanjZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-1040,
author = {Iyad A. Kanj and
Ge Xia},
title = {What makes normalized weighted satisfiability tractable},
journal = {CoRR},
volume = {abs/1112.1040},
year = {2011},
url = {http://arxiv.org/abs/1112.1040},
eprinttype = {arXiv},
eprint = {1112.1040},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-1040.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FellowsGK10,
author = {Michael R. Fellows and
Jiong Guo and
Iyad A. Kanj},
title = {The parameterized complexity of some minimum label problems},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {8},
pages = {727--740},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2010.02.012},
doi = {10.1016/J.JCSS.2010.02.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FellowsGK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KanjPX10,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
title = {On Spanners and Lightweight Spanners of Geometric Graphs},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2132--2161},
year = {2010},
url = {https://doi.org/10.1137/080737708},
doi = {10.1137/080737708},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KanjPX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKX10,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
title = {Improved upper bounds for vertex cover},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {40-42},
pages = {3736--3756},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.06.026},
doi = {10.1016/J.TCS.2010.06.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/KanjX10,
author = {Iyad A. Kanj and
Ge Xia},
editor = {Christian Scheideler},
title = {Improved Local Algorithms for Spanner Construction},
booktitle = {Algorithms for Sensor Systems - 6th International Workshop on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, {ALGOSENSORS} 2010, Bordeaux, France, July 5, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6451},
pages = {1--15},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16988-5\_1},
doi = {10.1007/978-3-642-16988-5\_1},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/KanjX10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKMXZ09,
author = {Jianer Chen and
Iyad A. Kanj and
Jie Meng and
Ge Xia and
Fenghui Zhang},
title = {On the pseudo-achromatic number problem},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {818--829},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.010},
doi = {10.1016/J.TCS.2008.11.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKMXZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenKX09,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
title = {On parameterized exponential time complexity},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {27-29},
pages = {2641--2648},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.03.006},
doi = {10.1016/J.TCS.2009.03.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenKX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmc/KanjPX09,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
title = {Local Construction of Near-Optimal Power Spanners for Wireless Ad
Hoc Networks},
journal = {{IEEE} Trans. Mob. Comput.},
volume = {8},
number = {4},
pages = {460--474},
year = {2009},
url = {https://doi.org/10.1109/TMC.2008.132},
doi = {10.1109/TMC.2008.132},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tmc/KanjPX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/CuiKX09,
author = {Shiliang Cui and
Iyad A. Kanj and
Ge Xia},
title = {On the Dilation of Delaunay Triangulations of Points in Convex Position},
booktitle = {Proceedings of the 21st Annual Canadian Conference on Computational
Geometry, Vancouver, British Columbia, Canada, August 17-19, 2009},
pages = {161--164},
year = {2009},
url = {http://cccg.ca/proceedings/2009/cccg09\_42.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/CuiKX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KanjK09,
author = {Iyad A. Kanj and
Dieter Kratsch},
editor = {Hung Q. Ngo},
title = {Convex Recoloring Revisited: Complexity and Exact Algorithms},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5609},
pages = {388--397},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02882-3\_39},
doi = {10.1007/978-3-642-02882-3\_39},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KanjK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcoss/KanjXZ09,
author = {Iyad A. Kanj and
Ge Xia and
Fenghui Zhang},
editor = {Bhaskar Krishnamachari and
Subhash Suri and
Wendi Rabiner Heinzelman and
Urbashi Mitra},
title = {Local Construction of Spanners in the 3-D Space},
booktitle = {Distributed Computing in Sensor Systems, 5th {IEEE} International
Conference, {DCOSS} 2009, Marina del Rey, CA, USA, June 8-10, 2009.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5516},
pages = {315--328},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02085-8\_23},
doi = {10.1007/978-3-642-02085-8\_23},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/dcoss/KanjXZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GuoKKU09,
author = {Jiong Guo and
Iyad A. Kanj and
Christian Komusiewicz and
Johannes Uhlmann},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Editing Graphs into Disjoint Unions of Dense Clusters},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {583--593},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_60},
doi = {10.1007/978-3-642-10631-6\_60},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GuoKKU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EncisoFGKRS09,
author = {Rosa Enciso and
Michael R. Fellows and
Jiong Guo and
Iyad A. Kanj and
Frances A. Rosamond and
Ondrej Such{\'{y}}},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {What Makes Equitable Connected Partition Easy},
booktitle = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {5917},
pages = {122--133},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_10},
doi = {10.1007/978-3-642-11269-0\_10},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EncisoFGKRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Kanj09,
author = {Iyad A. Kanj},
editor = {Jianer Chen and
S. Barry Cooper},
title = {On Spanners of Geometric Graphs},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {49--58},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_8},
doi = {10.1007/978-3-642-02017-9\_8},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Kanj09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ChenKX09,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
editor = {Jianer Chen and
S. Barry Cooper},
title = {On Parameterized Exponential Time Complexity},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {168--177},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_20},
doi = {10.1007/978-3-642-02017-9\_20},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/ChenKX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FellowsGK09,
author = {Michael R. Fellows and
Jiong Guo and
Iyad A. Kanj},
editor = {Christophe Paul and
Michel Habib},
title = {The Parameterized Complexity of Some Minimum Label Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {88--99},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_8},
doi = {10.1007/978-3-642-11409-0\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FellowsGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KanjWZ09,
author = {Iyad A. Kanj and
Andreas Wiese and
Fenghui Zhang},
editor = {Christophe Paul and
Michel Habib},
title = {Local Algorithms for Edge Colorings in UDGs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {202--213},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_18},
doi = {10.1007/978-3-642-11409-0\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/KanjWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KanjNX08,
author = {Iyad A. Kanj and
Luay Nakhleh and
Ge Xia},
title = {The Compatibility of Binary Characters on Phylogenetic Networks: Complexity
and Parameterized Algorithms},
journal = {Algorithmica},
volume = {51},
number = {2},
pages = {99--128},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9046-1},
doi = {10.1007/S00453-007-9046-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KanjNX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenK08,
author = {Jianer Chen and
Iyad A. Kanj},
title = {Foreword from the Guest Editors},
journal = {Algorithmica},
volume = {52},
number = {2},
pages = {113},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9153-z},
doi = {10.1007/S00453-007-9153-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanjNTX08,
author = {Iyad A. Kanj and
Luay Nakhleh and
Cuong Than and
Ge Xia},
title = {Seeing the trees and their branches in the network is hard},
journal = {Theor. Comput. Sci.},
volume = {401},
number = {1-3},
pages = {153--164},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.04.019},
doi = {10.1016/J.TCS.2008.04.019},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanjNTX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KanjPXS08,
author = {Iyad A. Kanj and
Michael J. Pelsmajer and
Ge Xia and
Marcus Schaefer},
editor = {Susanne Albers and
Pascal Weil},
title = {On the Induced Matching Problem},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {397--408},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1361},
doi = {10.4230/LIPICS.STACS.2008.1361},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KanjPXS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PerkovicK08,
author = {Iyad A. Kanj and
Ljubomir Perkovic},
editor = {Susanne Albers and
Pascal Weil},
title = {On Geometric Spanners of Euclidean and Unit Disk Graphs},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {409--420},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1320},
doi = {10.4230/LIPICS.STACS.2008.1320},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PerkovicK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/KanjPX08,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
editor = {Gadi Taubenfeld},
title = {Computing Lightweight Spanners Locally},
booktitle = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
Arcachon, France, September 22-24, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5218},
pages = {365--378},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87779-0\_25},
doi = {10.1007/978-3-540-87779-0\_25},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/KanjPX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChenKMXZ08,
author = {Jianer Chen and
Iyad A. Kanj and
Jie Meng and
Ge Xia and
Fenghui Zhang},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {On the Pseudo-achromatic Number Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {78--89},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_8},
doi = {10.1007/978-3-540-92248-3\_8},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/ChenKMXZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2864,
author = {Iyad A. Kanj and
Ljubomir Perkovic},
title = {On Geometric Spanners of Euclidean and Unit Disk Graphs},
journal = {CoRR},
volume = {abs/0802.2864},
year = {2008},
url = {http://arxiv.org/abs/0802.2864},
eprinttype = {arXiv},
eprint = {0802.2864},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2864.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenHKX07,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
title = {Polynomial time approximation schemes and parameterized complexity},
journal = {Discret. Appl. Math.},
volume = {155},
number = {2},
pages = {180--193},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.04.040},
doi = {10.1016/J.DAM.2006.04.040},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenHKX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenKPSX07,
author = {Jianer Chen and
Iyad A. Kanj and
Ljubomir Perkovic and
Eric Sedgwick and
Ge Xia},
title = {Genus characterizes the complexity of certain graph problems: Some
tight results},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {6},
pages = {892--907},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2006.11.001},
doi = {10.1016/J.JCSS.2006.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenKPSX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenFKX07,
author = {Jianer Chen and
Henning Fernau and
Iyad A. Kanj and
Ge Xia},
title = {Parametric Duality and Kernelization: Lower Bounds and Upper Bounds
on Kernel Size},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {4},
pages = {1077--1106},
year = {2007},
url = {https://doi.org/10.1137/050646354},
doi = {10.1137/050646354},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenFKX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dialm/KanjPX07,
author = {Iyad A. Kanj and
Ljubomir Perkovic and
Ge Xia},
title = {Strictly-Localized Construction of Near-Optimal Power Spanners for
Wireless Ad-Hoc Networks},
booktitle = {Proceedings of the {DIALM-POMC} International Workshop on Foundations
of Mobile Computing, Portland, Oregon, USA, August 16, 2007, {CD-ROM}},
publisher = {{ACM}},
year = {2007},
timestamp = {Thu, 21 Jun 2018 07:29:27 +0200},
biburl = {https://dblp.org/rec/conf/dialm/KanjPX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/KanjNTX07,
author = {Iyad A. Kanj and
Luay Nakhleh and
Cuong Than and
Ge Xia},
editor = {Giuseppe F. Italiano and
Eugenio Moggi and
Luigi Laura},
title = {Seeing the Trees and Their Branches in the Forest is Hard},
booktitle = {Theoretical Computer Science, 10th Italian Conference, {ICTCS} 2007,
Rome, Italy, October 3-5, 2007, Proceedings},
pages = {82--93},
publisher = {World Scientific},
year = {2007},
timestamp = {Wed, 11 Jun 2008 08:55:26 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/KanjNTX07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/ChenJKXZ07,
author = {Jianer Chen and
Anxiao Jiang and
Iyad A. Kanj and
Ge Xia and
Fenghui Zhang},
title = {Separability and Topology Control of Quasi Unit Disk Graphs},
booktitle = {{INFOCOM} 2007. 26th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
6-12 May 2007, Anchorage, Alaska, {USA}},
pages = {2225--2233},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/INFCOM.2007.257},
doi = {10.1109/INFCOM.2007.257},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/ChenJKXZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenHKX06,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
title = {On the computational hardness based on linear FPT-reductions},
journal = {J. Comb. Optim.},
volume = {11},
number = {2},
pages = {231--247},
year = {2006},
url = {https://doi.org/10.1007/s10878-006-7137-6},
doi = {10.1007/S10878-006-7137-6},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenHKX06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenHKX06,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
title = {Strong computational lower bounds via parameterized complexity},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {8},
pages = {1346--1367},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2006.04.007},
doi = {10.1016/J.JCSS.2006.04.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenHKX06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/KanjP06,
author = {Iyad A. Kanj and
Ljubomir Perkovic},
editor = {Sotiris E. Nikoletseas and
Jos{\'{e}} D. P. Rolim},
title = {Improved Stretch Factor for Bounded-Degree Planar Power Spanners of
Wireless Ad-Hoc Networks},
booktitle = {Algorithmic Aspects of Wireless Sensor Networks, Second International
Workshop, {ALGOSENSORS} 2006, Venice, Italy, July 15, 2006, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4240},
pages = {95--106},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11963271\_9},
doi = {10.1007/11963271\_9},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/KanjP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KanjNX06,
author = {Iyad A. Kanj and
Luay Nakhleh and
Ge Xia},
editor = {Danny Z. Chen and
D. T. Lee},
title = {Reconstructing Evolution of Natural Languages: Complexity and Parameterized
Algorithms},
booktitle = {Computing and Combinatorics, 12th Annual International Conference,
{COCOON} 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4112},
pages = {299--308},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11809678\_32},
doi = {10.1007/11809678\_32},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KanjNX06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ChenKMXZ06,
author = {Jianer Chen and
Iyad A. Kanj and
Jie Meng and
Ge Xia and
Fenghui Zhang},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {On the Effective Enumerability of {NP} Problems},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {215--226},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_20},
doi = {10.1007/11847250\_20},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ChenKMXZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChenKX06,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Improved Parameterized Upper Bounds for Vertex Cover},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {238--249},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_21},
doi = {10.1007/11821069\_21},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChenKX06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenKX05,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
title = {Labeled Search Trees and Amortized Analysis: Improved Upper Bounds
for NP-Hard Problems},
journal = {Algorithmica},
volume = {43},
number = {4},
pages = {245--273},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1145-7},
doi = {10.1007/S00453-004-1145-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenKX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChenCFHJKX05,
author = {Jianer Chen and
Benny Chor and
Mike Fellows and
Xiuzhen Huang and
David W. Juedes and
Iyad A. Kanj and
Ge Xia},
title = {Tight lower bounds for certain parameterized NP-hard problems},
journal = {Inf. Comput.},
volume = {201},
number = {2},
pages = {216--231},
year = {2005},
url = {https://doi.org/10.1016/j.ic.2005.05.001},
doi = {10.1016/J.IC.2005.05.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/ChenCFHJKX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/ChenKW05,
author = {Jianer Chen and
Iyad A. Kanj and
Guojun Wang},
title = {Hypercube Network Fault Tolerance: {A} Probabilistic Approach},
journal = {J. Interconnect. Networks},
volume = {6},
number = {1},
pages = {17--34},
year = {2005},
url = {https://doi.org/10.1142/S0219265905001290},
doi = {10.1142/S0219265905001290},
timestamp = {Fri, 05 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/join/ChenKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenK05,
author = {Jianer Chen and
Iyad A. Kanj},
title = {On approximating minimum vertex cover for graphs with perfect matching},
journal = {Theor. Comput. Sci.},
volume = {337},
number = {1-3},
pages = {305--318},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.12.034},
doi = {10.1016/J.TCS.2004.12.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChenHKX05,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
editor = {Lusheng Wang},
title = {\emph{W}-Hardness Under Linear FPT-Reductions: Structural Properties
and Further Applications},
booktitle = {Computing and Combinatorics, 11th Annual International Conference,
{COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3595},
pages = {975--984},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11533719\_98},
doi = {10.1007/11533719\_98},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ChenHKX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChenFKX05,
author = {Jianer Chen and
Henning Fernau and
Iyad A. Kanj and
Ge Xia},
editor = {Volker Diekert and
Bruno Durand},
title = {Parametric Duality and Kernelization: Lower Bounds and Upper Bounds
on Kernel Size},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {269--280},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_22},
doi = {10.1007/978-3-540-31856-9\_22},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChenFKX05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenFJK04,
author = {Jianer Chen and
Donald K. Friesen and
Weijia Jia and
Iyad A. Kanj},
title = {Using Nondeterminism to Design Efficient Deterministic Algorithms},
journal = {Algorithmica},
volume = {40},
number = {2},
pages = {83--97},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1096-z},
doi = {10.1007/S00453-004-1096-Z},
timestamp = {Mon, 23 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenFJK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenK04,
author = {Jianer Chen and
Iyad A. Kanj},
title = {Improved exact algorithms for M\({}_{\mbox{AX}}\)-S\({}_{\mbox{AT}}\)},
journal = {Discret. Appl. Math.},
volume = {142},
number = {1-3},
pages = {17--27},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2003.03.002},
doi = {10.1016/J.DAM.2003.03.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenCFHJKX04,
author = {Jianer Chen and
Benny Chor and
Mike Fellows and
Xiuzhen Huang and
David W. Juedes and
Iyad A. Kanj and
Ge Xia},
title = {Tight Lower Bounds for Certain Parameterized NP-Hard Problems},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {150--160},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313826},
doi = {10.1109/CCC.2004.1313826},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenCFHJKX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KanjPS04,
author = {Iyad A. Kanj and
Michael J. Pelsmajer and
Marcus Schaefer},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Parameterized Algorithms for Feedback Vertex Set},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {235--247},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_21},
doi = {10.1007/978-3-540-28639-4\_21},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KanjPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChenHKX04,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Polynomial Time Approximation Schemes and Parameterized Complexity},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {500--512},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_38},
doi = {10.1007/978-3-540-28629-5\_38},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChenHKX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenHKX04,
author = {Jianer Chen and
Xiuzhen Huang and
Iyad A. Kanj and
Ge Xia},
editor = {L{\'{a}}szl{\'{o}} Babai},
title = {Linear {FPT} reductions and computational lower bounds},
booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
pages = {212--221},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007352.1007391},
doi = {10.1145/1007352.1007391},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenHKX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenK03,
author = {Jianer Chen and
Iyad A. Kanj},
title = {Constrained minimum vertex cover in bipartite graphs: complexity and
parameterized algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {4},
pages = {833--847},
year = {2003},
url = {https://doi.org/10.1016/j.jcss.2003.09.003},
doi = {10.1016/J.JCSS.2003.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChenKPSX03,
author = {Jianer Chen and
Iyad A. Kanj and
Ljubomir Perkovic and
Eric Sedgwick and
Ge Xia},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Genus Characterizes the Complexity of Graph Problems: Some Tight Results},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {845--856},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_66},
doi = {10.1007/3-540-45061-0\_66},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChenKPSX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenKX03,
author = {Jianer Chen and
Iyad A. Kanj and
Ge Xia},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Labeled Search Trees and Amortized Analysis: Improved Upper Bounds
for NP-Hard Problems},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {148--157},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_17},
doi = {10.1007/978-3-540-24587-2\_17},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ChenKX03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaiJK02,
author = {Liming Cai and
David W. Juedes and
Iyad A. Kanj},
title = {The inapproximability of non-NP-hard optimization problems},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {553--571},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00343-7},
doi = {10.1016/S0304-3975(01)00343-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CaiJK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpcs/OhK02,
author = {Eunseuk Oh and
Iyad A. Kanj},
title = {Efficient All-to-All Broadcast Schemes in Distributed-Memory Parallel
Computers},
booktitle = {16th Annual International Symposium on High Performance Computing
Systems and Applications, {HPCS} 2002, June 16-19, 2002, Moncton,
NB, Canada},
pages = {71--76},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/HPCSA.2002.1019136},
doi = {10.1109/HPCSA.2002.1019136},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hpcs/OhK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/ChenKW02,
author = {Jianer Chen and
Iyad A. Kanj and
Guojun Wang},
title = {Hypercube Network Fault Tolerance: {A} Probabilistic Approach},
booktitle = {31st International Conference on Parallel Processing {(ICPP} 2002),
20-23 August 2002, Vancouver, BC, Canada},
pages = {65--72},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/ICPP.2002.1040860},
doi = {10.1109/ICPP.2002.1040860},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icpp/ChenKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ChenK02,
author = {Jianer Chen and
Iyad A. Kanj},
editor = {Sergio Rajsbaum},
title = {Improved Exact Algorithms for {MAX-SAT}},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {341--355},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_32},
doi = {10.1007/3-540-45995-2\_32},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ChenK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KanjP02,
author = {Iyad A. Kanj and
Ljubomir Perkovic},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Improved Parameterized Algorithms for Planar Dominating Set},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {399--410},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_33},
doi = {10.1007/3-540-45687-2\_33},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KanjP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChenKJ01,
author = {Jianer Chen and
Iyad A. Kanj and
Weijia Jia},
title = {Vertex Cover: Further Observations and Further Improvements},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {280--301},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1186},
doi = {10.1006/JAGM.2001.1186},
timestamp = {Mon, 23 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ChenKJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChenFJK01,
author = {Jianer Chen and
Donald K. Friesen and
Weijia Jia and
Iyad A. Kanj},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Using Nondeterminism to Design Deterministic Algorithms},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {120--131},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_11},
doi = {10.1007/3-540-45294-X\_11},
timestamp = {Mon, 23 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/ChenFJK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChenK01,
author = {Jianer Chen and
Iyad A. Kanj},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved
Algorithms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {55--65},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_7},
doi = {10.1007/3-540-45477-2\_7},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChenK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenK00,
author = {Jianer Chen and
Iyad A. Kanj},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {On Approximating Minimum Vertex Cover for Graphs with Perfect Matching},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {132--143},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_12},
doi = {10.1007/3-540-40996-3\_12},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChenKJ99,
author = {Jianer Chen and
Iyad A. Kanj and
Weijia Jia},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {Vertex Cover: Further Observations and Further Improvements},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {313--324},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_30},
doi = {10.1007/3-540-46784-X\_30},
timestamp = {Mon, 23 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/ChenKJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CaiJK98,
author = {Liming Cai and
David W. Juedes and
Iyad A. Kanj},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {The Inapproximability of Non NP-hard Optimization Problems},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {437--446},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_46},
doi = {10.1007/3-540-49381-6\_46},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CaiJK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-26 21:43 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:
