×
Author ID: kanj.iyad-a Recent zbMATH articles by "Kanj, Iyad A."
Published as: Kanj, Iyad A.; Kanj, Iyad
External Links: MGP

Publications by Year

Citations contained in zbMATH Open

69 Publications have been cited 940 times in 692 Documents Cited by Year
Vertex cover: Further observations and further improvements. Zbl 1017.68087
Chen, Jianer; Kanj, Iyad A.; Jia, Weijia
127
2001
Improved upper bounds for vertex cover. Zbl 1205.05217
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
125
2010
Strong computational lower bounds via parameterized complexity. Zbl 1119.68092
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
83
2006
Tight lower bounds for certain parameterized NP-hard problems. Zbl 1161.68476
Chen, Jianer; Chor, Benny; Fellows, Mike; Huang, Xiuzhen; Juedes, David; Kanj, Iyad A.; Xia, Ge
77
2005
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1141.05075
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
51
2007
Improved parameterized upper bounds for Vertex Cover. Zbl 1132.68421
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
33
2006
Linear FPT reductions and computational lower bounds. Zbl 1192.68313
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
31
2004
Seeing the trees and their branches in the network is hard. Zbl 1147.68059
Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge
28
2008
The parameterized complexity of some minimum label problems. Zbl 1214.05150
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad
18
2010
On the induced matching problem. Zbl 1235.05114
Kanj, Iyad; Pelsmajer, Michael J.; Schaefer, Marcus; Xia, Ge
17
2011
What makes equitable connected partition easy. Zbl 1273.68164
Enciso, Rosa; Fellows, Michael R.; Guo, Jiong; Kanj, Iyad; Rosamond, Frances; Suchý, Ondřej
16
2009
Parameterized algorithms for feedback vertex set. Zbl 1104.68541
Kanj, Iyad; Pelsmajer, Michael; Schaefer, Marcus
16
2004
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Zbl 1086.68099
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
16
2005
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Zbl 1091.68076
Chen, Jianer; Kanj, Iyad A.
16
2003
Improved exact algorithms for MAX-SAT. Zbl 1077.68116
Chen, Jianer; Kanj, Iyad A.
16
2004
Improved parameterized algorithms for planar dominating set. Zbl 1014.68218
Kanj, Iyad A.; Perković, Ljubomir
16
2002
Finding points in general position. Zbl 1386.68196
Froese, Vincent; Kanj, Iyad; Nichterlein, André; Niedermeier, Rolf
14
2017
Using nondeterminism to design efficient deterministic algorithms. Zbl 1088.68835
Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.
13
2004
Convex recoloring revisited: complexity and exact algorithms. Zbl 1248.05201
Kanj, Iyad A.; Kratsch, Dieter
13
2009
Computing the flip distance between triangulations. Zbl 1371.05063
Kanj, Iyad; Sedgwick, Eric; Xia, Ge
13
2017
On the computational hardness based on linear fpt-reductions. Zbl 1130.90064
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
11
2006
There are plane spanners of degree 4 and moderate stretch factor. Zbl 1314.05132
Bonichon, Nicolas; Kanj, Iyad; Perković, Ljubomir; Xia, Ge
11
2015
Vertex cover: Further observations and further improvements. Zbl 0952.68111
Chen, Jianer; Kanj, Iyad A.; Jia, Weijia
10
1999
On geometric spanners of Euclidean and unit disk graphs. Zbl 1259.68163
Perković, Ljubomir; Kanj, Iyad A.
10
2008
Genus characterizes the complexity of certain graph problems: Some tight results. Zbl 1121.68086
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
9
2007
On spanners and lightweight spanners of geometric graphs. Zbl 1221.05294
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
8
2010
On the induced matching problem. Zbl 1259.68095
Kanj, Iyad A.; Pelsmajer, Michael J.; Xia, Ge; Schaefer, Marcus
8
2008
Polynomial time approximation schemes and parameterized complexity. Zbl 1109.68135
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
7
2007
On the stretch factor of Delaunay triangulations of points in convex position. Zbl 1217.65046
Cui, Shiliang; Kanj, Iyad A.; Xia, Ge
7
2011
Multicut in trees viewed through the eyes of vertex cover. Zbl 1244.68039
Chen, Jianer; Fan, Jia-Hao; Kanj, Iyad; Liu, Yang; Zhang, Fenghui
7
2012
Flip distance is in FPT time \(O(n+ k \cdot c^k)\). Zbl 1355.68280
Kanj, Iyad; Xia, Ge
7
2015
The inapproximability of non-NP-hard optimization problems. Zbl 1061.68059
Cai, Liming; Juedes, David; Kanj, Iyad
7
2002
Editing graphs into disjoint unions of dense clusters. Zbl 1230.68091
Guo, Jiong; Kanj, Iyad A.; Komusiewicz, Christian; Uhlmann, Johannes
6
2011
Degree four plane spanners: simpler and better. Zbl 1405.68424
Kanj, Iyad; Perkovic, Ljubomir; Turkoglu, Duru
6
2017
Polynomial time approximation schemes and parameterized complexity. Zbl 1096.68166
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
5
2004
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1118.68506
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
5
2005
On the subexponential-time complexity of CSP. Zbl 1323.68325
de Haan, Ronald; Kanj, Iyad; Szeider, Stefan
5
2015
On approximating minimum vertex cover for graphs with perfect matching. Zbl 1074.05071
Chen, Jianer; Kanj, Iyad A.
4
2005
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Zbl 1380.68227
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
4
2018
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Zbl 1380.68228
Kanj, Iyad; Thilikos, Dimitrios M.; Xia, Ge
4
2017
Degree four plane spanners: simpler and better. Zbl 1387.68185
Kanj, Iyad; Perković, Ljubomir; Türkoğlu, Duru
4
2016
Parameterized complexity and subexponential-time computability. Zbl 1358.68122
Chen, Jianer; Kanj, Iyad A.
3
2012
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Zbl 1205.68530
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
3
2003
Using nondeterminism to design deterministic algorithms. Zbl 1052.68622
Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.
3
2001
Improved exact algorithms for MAX-SAT. Zbl 1059.68617
Chen, Jianer; Kanj, Iyad A.
3
2002
\(W\)-hardness under linear FPT-reductions: Structural properties and further applications. Zbl 1128.68362
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
3
2005
On the pseudo-achromatic number problem. Zbl 1162.68022
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2009
Safe approximation and its relation to kernelization. Zbl 1352.68108
Guo, Jiong; Kanj, Iyad; Kratsch, Stefan
3
2012
On parameterized exponential time complexity. Zbl 1172.68023
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
3
2009
Algorithms for cut problems on trees. Zbl 1409.05197
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
3
2014
Solving partition problems almost always requires pushing many vertices around. Zbl 1524.05240
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
3
2018
Parameterized top-\(K\) algorithms. Zbl 1259.68078
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2013
On the effective enumerability of NP problems. Zbl 1154.68423
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
2
2006
Editing graphs into disjoint unions of dense clusters. Zbl 1272.05201
Guo, Jiong; Kanj, Iyad A.; Komusiewicz, Christian; Uhlmann, Johannes
2
2009
The parameterized complexity of some minimum label problems. Zbl 1273.68166
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad A.
2
2010
Improved parameterized and exact algorithms for cut problems on trees. Zbl 1333.05293
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
2
2015
Twins in subdivision drawings of hypergraphs. Zbl 1483.68262
van Bevern, René; Kanj, Iyad; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel
2
2016
Computing lightweight spanners locally. Zbl 1161.68342
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
2
2008
Reconstructing evolution of natural languages: complexity and parameterized algorithms. Zbl 1162.91536
Kanj, Iyad A.; Nakhleh, Luay; Xia, Ge
1
2006
Local algorithms for edge colorings in UDGs. Zbl 1223.68082
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui
1
2011
Improved local algorithms for spanner construction. Zbl 1247.68019
Kanj, Iyad A.; Xia, Ge
1
2012
On the independence number of graphs with maximum degree 3. Zbl 1341.05192
Kanj, Iyad A.; Zhang, Fenghui
1
2011
Local algorithms for edge colorings in UDGs. Zbl 1273.68279
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui
1
2010
On constrained minimum vertex covers of bipartite graphs: Improved algorithms. Zbl 1042.68621
Chen, Jianer; Kanj, Iyad A.
1
2001
Genus characterizes the complexity of graph problems: Some tight results. Zbl 1039.68092
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
1
2003
On approximating minimum vertex cover for graphs with perfect matching. Zbl 1044.68694
Chen, Jianer; Kanj, Iyad A.
1
2000
The complexity of tree partitioning. Zbl 1453.68119
An, Zhao; Feng, Qilong; Kanj, Iyad; Xia, Ge
1
2017
On certain geometric properties of the Yao-Yao graphs. Zbl 1301.05240
Kanj, Iyad A.; Xia, Ge
1
2012
Solving partition problems almost always requires pushing many vertices around. Zbl 1434.05123
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
1
2020
Solving partition problems almost always requires pushing many vertices around. Zbl 1434.05123
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
1
2020
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Zbl 1380.68227
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
4
2018
Solving partition problems almost always requires pushing many vertices around. Zbl 1524.05240
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan
3
2018
Finding points in general position. Zbl 1386.68196
Froese, Vincent; Kanj, Iyad; Nichterlein, André; Niedermeier, Rolf
14
2017
Computing the flip distance between triangulations. Zbl 1371.05063
Kanj, Iyad; Sedgwick, Eric; Xia, Ge
13
2017
Degree four plane spanners: simpler and better. Zbl 1405.68424
Kanj, Iyad; Perkovic, Ljubomir; Turkoglu, Duru
6
2017
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Zbl 1380.68228
Kanj, Iyad; Thilikos, Dimitrios M.; Xia, Ge
4
2017
The complexity of tree partitioning. Zbl 1453.68119
An, Zhao; Feng, Qilong; Kanj, Iyad; Xia, Ge
1
2017
Degree four plane spanners: simpler and better. Zbl 1387.68185
Kanj, Iyad; Perković, Ljubomir; Türkoğlu, Duru
4
2016
Twins in subdivision drawings of hypergraphs. Zbl 1483.68262
van Bevern, René; Kanj, Iyad; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel
2
2016
There are plane spanners of degree 4 and moderate stretch factor. Zbl 1314.05132
Bonichon, Nicolas; Kanj, Iyad; Perković, Ljubomir; Xia, Ge
11
2015
Flip distance is in FPT time \(O(n+ k \cdot c^k)\). Zbl 1355.68280
Kanj, Iyad; Xia, Ge
7
2015
On the subexponential-time complexity of CSP. Zbl 1323.68325
de Haan, Ronald; Kanj, Iyad; Szeider, Stefan
5
2015
Improved parameterized and exact algorithms for cut problems on trees. Zbl 1333.05293
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
2
2015
Algorithms for cut problems on trees. Zbl 1409.05197
Kanj, Iyad; Lin, Guohui; Liu, Tian; Tong, Weitian; Xia, Ge; Xu, Jinhui; Yang, Boting; Zhang, Fenghui; Zhang, Peng; Zhu, Binhai
3
2014
Parameterized top-\(K\) algorithms. Zbl 1259.68078
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2013
Multicut in trees viewed through the eyes of vertex cover. Zbl 1244.68039
Chen, Jianer; Fan, Jia-Hao; Kanj, Iyad; Liu, Yang; Zhang, Fenghui
7
2012
Parameterized complexity and subexponential-time computability. Zbl 1358.68122
Chen, Jianer; Kanj, Iyad A.
3
2012
Safe approximation and its relation to kernelization. Zbl 1352.68108
Guo, Jiong; Kanj, Iyad; Kratsch, Stefan
3
2012
Improved local algorithms for spanner construction. Zbl 1247.68019
Kanj, Iyad A.; Xia, Ge
1
2012
On certain geometric properties of the Yao-Yao graphs. Zbl 1301.05240
Kanj, Iyad A.; Xia, Ge
1
2012
On the induced matching problem. Zbl 1235.05114
Kanj, Iyad; Pelsmajer, Michael J.; Schaefer, Marcus; Xia, Ge
17
2011
On the stretch factor of Delaunay triangulations of points in convex position. Zbl 1217.65046
Cui, Shiliang; Kanj, Iyad A.; Xia, Ge
7
2011
Editing graphs into disjoint unions of dense clusters. Zbl 1230.68091
Guo, Jiong; Kanj, Iyad A.; Komusiewicz, Christian; Uhlmann, Johannes
6
2011
Local algorithms for edge colorings in UDGs. Zbl 1223.68082
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui
1
2011
On the independence number of graphs with maximum degree 3. Zbl 1341.05192
Kanj, Iyad A.; Zhang, Fenghui
1
2011
Improved upper bounds for vertex cover. Zbl 1205.05217
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
125
2010
The parameterized complexity of some minimum label problems. Zbl 1214.05150
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad
18
2010
On spanners and lightweight spanners of geometric graphs. Zbl 1221.05294
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
8
2010
The parameterized complexity of some minimum label problems. Zbl 1273.68166
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad A.
2
2010
Local algorithms for edge colorings in UDGs. Zbl 1273.68279
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui
1
2010
What makes equitable connected partition easy. Zbl 1273.68164
Enciso, Rosa; Fellows, Michael R.; Guo, Jiong; Kanj, Iyad; Rosamond, Frances; Suchý, Ondřej
16
2009
Convex recoloring revisited: complexity and exact algorithms. Zbl 1248.05201
Kanj, Iyad A.; Kratsch, Dieter
13
2009
On the pseudo-achromatic number problem. Zbl 1162.68022
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
3
2009
On parameterized exponential time complexity. Zbl 1172.68023
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
3
2009
Editing graphs into disjoint unions of dense clusters. Zbl 1272.05201
Guo, Jiong; Kanj, Iyad A.; Komusiewicz, Christian; Uhlmann, Johannes
2
2009
Seeing the trees and their branches in the network is hard. Zbl 1147.68059
Kanj, Iyad A.; Nakhleh, Luay; Than, Cuong; Xia, Ge
28
2008
On geometric spanners of Euclidean and unit disk graphs. Zbl 1259.68163
Perković, Ljubomir; Kanj, Iyad A.
10
2008
On the induced matching problem. Zbl 1259.68095
Kanj, Iyad A.; Pelsmajer, Michael J.; Xia, Ge; Schaefer, Marcus
8
2008
Computing lightweight spanners locally. Zbl 1161.68342
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge
2
2008
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1141.05075
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
51
2007
Genus characterizes the complexity of certain graph problems: Some tight results. Zbl 1121.68086
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
9
2007
Polynomial time approximation schemes and parameterized complexity. Zbl 1109.68135
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
7
2007
Strong computational lower bounds via parameterized complexity. Zbl 1119.68092
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
83
2006
Improved parameterized upper bounds for Vertex Cover. Zbl 1132.68421
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
33
2006
On the computational hardness based on linear fpt-reductions. Zbl 1130.90064
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
11
2006
On the effective enumerability of NP problems. Zbl 1154.68423
Chen, Jianer; Kanj, Iyad A.; Meng, Jie; Xia, Ge; Zhang, Fenghui
2
2006
Reconstructing evolution of natural languages: complexity and parameterized algorithms. Zbl 1162.91536
Kanj, Iyad A.; Nakhleh, Luay; Xia, Ge
1
2006
Tight lower bounds for certain parameterized NP-hard problems. Zbl 1161.68476
Chen, Jianer; Chor, Benny; Fellows, Mike; Huang, Xiuzhen; Juedes, David; Kanj, Iyad A.; Xia, Ge
77
2005
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems. Zbl 1086.68099
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
16
2005
Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. Zbl 1118.68506
Chen, Jianer; Fernau, Henning; Kanj, Iyad A.; Xia, Ge
5
2005
On approximating minimum vertex cover for graphs with perfect matching. Zbl 1074.05071
Chen, Jianer; Kanj, Iyad A.
4
2005
\(W\)-hardness under linear FPT-reductions: Structural properties and further applications. Zbl 1128.68362
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
3
2005
Linear FPT reductions and computational lower bounds. Zbl 1192.68313
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
31
2004
Parameterized algorithms for feedback vertex set. Zbl 1104.68541
Kanj, Iyad; Pelsmajer, Michael; Schaefer, Marcus
16
2004
Improved exact algorithms for MAX-SAT. Zbl 1077.68116
Chen, Jianer; Kanj, Iyad A.
16
2004
Using nondeterminism to design efficient deterministic algorithms. Zbl 1088.68835
Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.
13
2004
Polynomial time approximation schemes and parameterized complexity. Zbl 1096.68166
Chen, Jianer; Huang, Xiuzhen; Kanj, Iyad A.; Xia, Ge
5
2004
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Zbl 1091.68076
Chen, Jianer; Kanj, Iyad A.
16
2003
Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems. Zbl 1205.68530
Chen, Jianer; Kanj, Iyad A.; Xia, Ge
3
2003
Genus characterizes the complexity of graph problems: Some tight results. Zbl 1039.68092
Chen, Jianer; Kanj, Iyad A.; Perković, Ljubomir; Sedgwick, Eric; Xia, Ge
1
2003
Improved parameterized algorithms for planar dominating set. Zbl 1014.68218
Kanj, Iyad A.; Perković, Ljubomir
16
2002
The inapproximability of non-NP-hard optimization problems. Zbl 1061.68059
Cai, Liming; Juedes, David; Kanj, Iyad
7
2002
Improved exact algorithms for MAX-SAT. Zbl 1059.68617
Chen, Jianer; Kanj, Iyad A.
3
2002
Vertex cover: Further observations and further improvements. Zbl 1017.68087
Chen, Jianer; Kanj, Iyad A.; Jia, Weijia
127
2001
Using nondeterminism to design deterministic algorithms. Zbl 1052.68622
Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.
3
2001
On constrained minimum vertex covers of bipartite graphs: Improved algorithms. Zbl 1042.68621
Chen, Jianer; Kanj, Iyad A.
1
2001
On approximating minimum vertex cover for graphs with perfect matching. Zbl 1044.68694
Chen, Jianer; Kanj, Iyad A.
1
2000
Vertex cover: Further observations and further improvements. Zbl 0952.68111
Chen, Jianer; Kanj, Iyad A.; Jia, Weijia
10
1999
all top 5

Cited by 919 Authors

37 Chen, Jian-er
31 Saurabh, Saket
29 Kanj, Iyad A.
24 Fernau, Henning
24 Fomin, Fedor V.
23 Niedermeier, Rolf
22 Wang, Jianxin
18 Lokshtanov, Daniel
18 Paschos, Vangelis Th.
18 Xia, Ge
16 Komusiewicz, Christian
15 Fellows, Michael Ralph
15 Thilikos, Dimitrios M.
15 Xiao, Mingyu
14 Kratsch, Stefan
13 Raman, Venkatesh
12 Feng, Qilong
12 Guo, Jiong
12 Jansen, Bart M. P.
12 Marx, Dániel
11 Golovach, Petr A.
11 Lampis, Michael
11 Pilipczuk, Marcin L.
11 Szeider, Stefan
11 Zehavi, Meirav
10 Bonnet, Edouard
10 Escoffier, Bruno
10 Sau, Ignasi
10 Tale, Prafullkumar
10 Villanger, Yngve
10 Wahlström, Magnus
9 Gaspers, Serge
8 Abu-Khzam, Faisal N.
8 Cygan, Marek
8 Panolan, Fahad
8 Roth, Marc
8 Sikora, Florian
8 Sorge, Manuel
7 Bazgan, Cristina
7 Bodlaender, Hans L.
7 Bose, Prosenjit K.
7 Klavžar, Sandi
7 Montecchiani, Fabrizio
7 Nöllenburg, Martin
7 Otachi, Yota
7 Rosamond, Frances A.
7 Semple, Charles
7 van Iersel, Leo
7 Wakabayashi, Yoshiko
7 Zhang, Fenghui
6 Bhore, Sujoy Kumar
6 Dumitrescu, Adrian
6 Fu, Bin
6 Ganian, Robert
6 Ghosh, Anirban
6 Hajiaghayi, Mohammad Taghi
6 Hanaka, Tesshu
6 Kelk, Steven
6 Kim, Eun Jung
6 Knauer, Christian
6 Kowalik, Łukasz
6 Li, Shaohua
6 Liedloff, Mathieu
6 Linz, Simone
6 Majumdar, Diptapriyo
6 Meeks, Kitty
6 Misra, Neeldhara
6 Paulusma, Daniël
6 Pilipczuk, Michał
6 Schmitt, Johannes
6 Sommer, Frank
6 Song, Yinglei
6 Suchý, Ondřej
6 Zhu, Binhai
5 Bourgeois, Nicolas
5 Branković, Ljiljana
5 Casel, Katrin
5 Chitnis, Rajesh Hemant
5 Damaschke, Peter
5 Gambette, Philippe
5 Gutin, Gregory Z.
5 Hermelin, Danny
5 Hüffner, Falk
5 Jonsson, Peter
5 Krithika, R.
5 Lagerkvist, Victor
5 Li, Wenjun
5 Moser, Hannes
5 Moura, Phablo F. S.
5 Nishimura, Naomi
5 Sahu, Abhishek
5 Van Leeuwen, Erik Jan
5 Weller, Mathias
5 Xu, Chao
5 Yeo, Anders
5 Zhang, Peng
4 Agrawal, Akanksha
4 Alber, Jochen
4 Araújo, Júlio César Silva
4 Bentert, Matthias
...and 819 more Authors
all top 5

Cited in 85 Serials

106 Theoretical Computer Science
71 Algorithmica
44 Discrete Applied Mathematics
42 Journal of Computer and System Sciences
26 Information Processing Letters
23 Journal of Combinatorial Optimization
22 Theory of Computing Systems
18 SIAM Journal on Discrete Mathematics
13 SIAM Journal on Computing
12 Information and Computation
11 Computational Geometry
10 Journal of Discrete Algorithms
8 Journal of Graph Algorithms and Applications
6 Discrete & Computational Geometry
6 Computer Science Review
5 Artificial Intelligence
5 Discrete Mathematics
5 Discrete Optimization
4 Bulletin of Mathematical Biology
4 International Journal of Computational Geometry & Applications
4 Discrete Mathematics, Algorithms and Applications
4 Algorithms
3 Journal of Mathematical Biology
3 Operations Research Letters
3 European Journal of Operational Research
3 Mathematical Programming. Series A. Series B
2 Acta Informatica
2 Automatica
2 Journal of Graph Theory
2 Networks
2 European Journal of Combinatorics
2 Annals of Operations Research
2 Discussiones Mathematicae. Graph Theory
2 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2 ACM Transactions on Computational Logic
2 Logical Methods in Computer Science
2 RAIRO. Theoretical Informatics and Applications
1 Bulletin of the Australian Mathematical Society
1 Applied Mathematics and Computation
1 Computing
1 Journal of Combinatorial Theory. Series A
1 Journal of Combinatorial Theory. Series B
1 Journal of Optimization Theory and Applications
1 Operations Research
1 Advances in Applied Mathematics
1 Combinatorica
1 Annals of Pure and Applied Logic
1 Optimization
1 Graphs and Combinatorics
1 Journal of Complexity
1 Journal of Computer Science and Technology
1 Computers & Operations Research
1 Journal of Automated Reasoning
1 MSCS. Mathematical Structures in Computer Science
1 Journal of Global Optimization
1 International Journal of Computer Mathematics
1 Proceedings of the National Academy of Sciences of the United States of America
1 Computational Complexity
1 Computational Optimization and Applications
1 Journal of Mathematical Sciences (New York)
1 Georgian Mathematical Journal
1 The Electronic Journal of Combinatorics
1 The Journal of Artificial Intelligence Research (JAIR)
1 Annals of Mathematics and Artificial Intelligence
1 Sbornik: Mathematics
1 International Transactions in Operational Research
1 Constraints
1 INFORMS Journal on Computing
1 Doklady Mathematics
1 Data Mining and Knowledge Discovery
1 Fundamenta Informaticae
1 Journal of Applied Mathematics
1 Quantum Information Processing
1 Journal of Multiple-Valued Logic and Soft Computing
1 AKCE International Journal of Graphs and Combinatorics
1 Proyecciones
1 Optimization Letters
1 Applicable Analysis and Discrete Mathematics
1 Operational Research. An International Journal
1 Ars Mathematica Contemporanea
1 Science China. Information Sciences
1 Journal of Theoretical Biology
1 ACM Transactions on Computation Theory
1 Open Mathematics
1 Bulletin of the Hellenic Mathematical Society

Citations by Year