×
Compute Distance To:
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

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

Cited by 746 Authors

33 Chen, Jian-er
27 Kanj, Iyad A.
23 Saurabh, Saket
22 Fernau, Henning
21 Fomin, Fedor V.
20 Wang, Jianxin
19 Niedermeier, Rolf
17 Xia, Ge
16 Lokshtanov, Daniel
15 Paschos, Vangelis Th.
14 Fellows, Michael Ralph
13 Kratsch, Stefan
13 Thilikos, Dimitrios M.
12 Guo, Jiong
11 Feng, Qilong
11 Pilipczuk, Marcin L.
10 Komusiewicz, Christian
10 Raman, Venkatesh
10 Szeider, Stefan
10 Xiao, Mingyu
9 Escoffier, Bruno
9 Villanger, Yngve
9 Zehavi, Meirav
8 Cygan, Marek
8 Gaspers, Serge
8 Golovach, Petr A.
8 Sorge, Manuel
8 Wahlström, Magnus
7 Abu-Khzam, Faisal N.
7 Bazgan, Cristina
7 Bonnet, Edouard
7 Bose, Prosenjit K.
7 Hermelin, Danny
7 Jansen, Bart M. P.
7 Lampis, Michael
7 Marx, Dániel
7 Sau, Ignasi
7 Semple, Charles
7 van Iersel, Leo
7 Zhang, Fenghui
6 Knauer, Christian
6 Li, Shaohua
6 Liedloff, Mathieu
6 Meeks, Kitty
6 Misra, Neeldhara
6 Panolan, Fahad
6 Pilipczuk, Michał
6 Roth, Marc
6 Sikora, Florian
6 Song, Yinglei
6 Tale, Prafullkumar
6 Wakabayashi, Yoshiko
5 Branković, Ljiljana
5 Casel, Katrin
5 Damaschke, Peter
5 Dumitrescu, Adrian
5 Ghosh, Anirban
5 Hajiaghayi, Mohammad Taghi
5 Jonsson, Peter A.
5 Kelk, Steven
5 Kowalik, Łukasz
5 Krithika, R.
5 Li, Wenjun
5 Linz, Simone
5 Mnich, Matthias
5 Nishimura, Naomi
5 Rosamond, Frances A.
5 Suchý, Ondřej
5 Van Leeuwen, Erik Jan
5 Xu, Chao
5 Zhu, Binhai
4 Alber, Jochen
4 Bliznets, Ivan A.
4 Bodlaender, Hans L.
4 Bourgeois, Nicolas
4 Chitnis, Rajesh Hemant
4 Downey, Rodney Graham
4 Fu, Bin
4 Gambette, Philippe
4 Ganian, Robert
4 Giannopoulos, Panos
4 Gutin, Gregory Z.
4 Hartung, Sepp
4 Huang, Xiuzhen
4 Hüffner, Falk
4 Jansen, Klaus
4 Klavžar, Sandi
4 Lagerkvist, Victor
4 Liu, Yang
4 Majumdar, Diptapriyo
4 Monnot, Jérôme
4 Moser, Hannes
4 Paulusma, Daniël
4 Philip, Geevarghese
4 Ragde, Prabhakar L.
4 Schmitt, Johannes
4 Shachnai, Hadas
4 Stege, Ulrike
4 Yang, Yongjie
4 Yeo, Anders
...and 646 more Authors
all top 5

Cited in 78 Serials

90 Theoretical Computer Science
60 Algorithmica
39 Discrete Applied Mathematics
37 Journal of Computer and System Sciences
25 Information Processing Letters
19 Theory of Computing Systems
17 Journal of Combinatorial Optimization
13 SIAM Journal on Computing
13 SIAM Journal on Discrete Mathematics
10 Computational Geometry
10 Journal of Discrete Algorithms
9 Information and Computation
5 Artificial Intelligence
5 Discrete Mathematics
5 Discrete & Computational Geometry
5 Discrete Optimization
4 Bulletin of Mathematical Biology
4 International Journal of Computational Geometry & Applications
4 Algorithms
4 Computer Science Review
3 Journal of Mathematical Biology
3 Operations Research Letters
3 Journal of Graph Algorithms and Applications
3 Discrete Mathematics, Algorithms and Applications
2 Acta Informatica
2 Automatica
2 Networks
2 Annals of Operations Research
2 European Journal of Operational Research
2 Mathematical Programming. Series A. Series B
2 ACM Transactions on Computational Logic
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 Graph Theory
1 Journal of Optimization Theory and Applications
1 Operations Research
1 European Journal of Combinatorics
1 Advances in Applied Mathematics
1 Combinatorica
1 Annals of Pure and Applied Logic
1 Optimization
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 Discussiones Mathematicae. Graph Theory
1 Sbornik: Mathematics
1 Constraints
1 Doklady Mathematics
1 Data Mining and Knowledge Discovery
1 Fundamenta Informaticae
1 Journal of Applied Mathematics
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 AKCE International Journal of Graphs and Combinatorics
1 Proyecciones
1 Optimization Letters
1 Logical Methods in Computer Science
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 Bulletin of the Hellenic Mathematical Society

Citations by Year