Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kanj, Iyad"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Flip distance is in FPT time
\mathcal O(n+ k\cdot c^k)
Iyad Kanj
,
Ge Xia
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 500-512
Parameterized top-
K
algorithms
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
470
, 2013, pp. 105-119
When is weighted satisfiability FPT?
Iyad A. Kanj
,
Ge Xia
Lecture Notes in Computer Science
8037
, 2013, pp. 451-462
On the independence number of graphs with maximum degree 3
Iyad Kanj
,
Fenghui Zhang
Theoretical Computer Science
478
, 2013, pp. 51-75
Multicut in trees viewed through the eyes of vertex cover
Jianer Chen
,
Jia-Hao Fan
,
Iyad Kanj
,
Yang Liu
,
Fenghui Zhang
Journal of Computer and System Sciences
78
(5), 2012, pp. 1637-1650
Improved local algorithms for spanner construction
Iyad A. Kanj
,
Ge Xia
Theoretical Computer Science
453
, 2012, pp. 54-64
Multicut in trees viewed through the eyes of vertex cover
Jianer Chen
,
Jia-Hao Fan
,
Iyad A. Kanj
,
Yang Liu
,
Fenghui Zhang
Lecture Notes in Computer Science
6844
, 2011, pp. 219-230
Editing graphs into disjoint unions of dense clusters
Jiong Guo
,
Iyad A. Kanj
,
Christian Komusiewicz
,
Johannes Uhlmann
Algorithmica
61
(4), 2011, pp. 949-970
On the induced matching problem
Iyad Kanj
,
Michael J. Pelsmajer
,
Marcus Schaefer
,
Ge Xia
Journal of Computer and System Sciences
77
(6), 2011, pp. 1058-1070
Local algorithms for edge colorings in UDGs
Iyad A. Kanj
,
Andreas Wiese
,
Fenghui Zhang
Theoretical Computer Science
412
(35), 2011, pp. 4704-4714
On the independence number of graphs with maximum degree 3
Iyad A. Kanj
,
Fenghui Zhang
Lecture Notes in Computer Science
6986
, 2011, pp. 238-249
Improved upper bounds for vertex cover
Jianer Chen
,
Iyad A. Kanj
,
Ge Xia
Theoretical Computer Science
411
(40-42), 2010, pp. 3736-3756
The parameterized complexity of some minimum label problems
Michael R. Fellows
,
Jiong Guo
,
Iyad Kanj
Journal of Computer and System Sciences
76
(8), 2010, pp. 727-740
The parameterized complexity of some minimum label problems
Michael R. Fellows
,
Jiong Guo
,
Iyad A. Kanj
Lecture Notes in Computer Science
5911
, 2010, pp. 88-99
On spanners and lightweight spanners of geometric graphs
Iyad A. Kanj
,
Ljubomir Perković
,
Ge Xia
SIAM Journal on Computing
39
(6), 2010, pp. 2132-2161
Local algorithms for edge colorings in UDGs
Iyad A. Kanj
,
Andreas Wiese
,
Fenghui Zhang
Lecture Notes in Computer Science
5911
, 2010, pp. 202-213
On the pseudo-achromatic number problem
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
410
(8-10), 2009, pp. 818-829
On parameterized exponential time complexity
Jianer Chen
,
Iyad A. Kanj
,
Ge Xia
Theoretical Computer Science
410
(27-29), 2009, pp. 2641-2648
Editing graphs into disjoint unions of dense clusters
Jiong Guo
,
Iyad A. Kanj
,
Christian Komusiewicz
,
Johannes Uhlmann
Lecture Notes in Computer Science
5878
, 2009, pp. 583-593
Convex recoloring revisited: Complexity and exact algorithms
Iyad A. Kanj
,
Dieter Kratsch
Lecture Notes in Computer Science
5609
, 2009, pp. 388-397
On the pseudo-achromatic number problem
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Lecture Notes in Computer Science
5344
, 2008, pp. 78-89
Seeing the trees and their branches in the network is hard
Iyad A. Kanj
,
Luay Nakhleh
,
Cuong Than
,
Ge Xia
Theoretical Computer Science
401
(1-3), 2008, pp. 153-164
The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
Iyad A. Kanj
,
Luay Nakhleh
,
Ge Xia
Algorithmica
51
(2), 2008, pp. 99-128
On the induced matching problem
Iyad A. Kanj
,
Michael J. Pelsmajer
,
Marcus Schaefer
,
Ge Xia
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 397-408
On geometric spanners of Euclidean and unit disk graphs
Iyad A. Kanj
,
Ljubomir Perković
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 409-420
Seiten 1
2
>