×

zbMATH — the first resource for mathematics

Hermelin, Danny

Compute Distance To:
Author ID: hermelin.danny Recent zbMATH articles by "Hermelin, Danny"
Published as: Hermelin, Danny
External Links: ORCID
Documents Indexed: 78 Publications since 2005, including 1 Book

Publications by Year

Citations contained in zbMATH

56 Publications have been cited 545 times in 468 Documents Cited by Year
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
168
2009
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane
100
2009
Treewidth governs the complexity of target set selection. Zbl 1248.90068
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan
30
2011
Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
22
2011
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
A unified algorithm for accelerating edit-distance computation via text-compression. Zbl 1236.68308
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren
14
2009
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
14
2007
Optimization problems in multiple-interval graphs. Zbl 1300.05295
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror
10
2010
A completeness theory for polynomial (Turing) kernelization. Zbl 1312.68102
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi
9
2015
Domination when the stars are out. Zbl 1334.68160
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard J.
9
2011
Constrained LCS: Hardness and approximation. Zbl 1143.68637
Gotthilf, Zvi; Hermelin, Danny; Lewenstein, Moshe
9
2008
Optimization problems in multiple-interval graphs. Zbl 1302.05179
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror
8
2007
Parameterized complexity of induced graph matching on claw-free graphs. Zbl 1306.05163
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
7
2014
Scheduling two competing agents when one agent has significantly fewer jobs. Zbl 1378.68021
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; Talmon, Nimrod; Woeginger, Gerhard
6
2015
Weak compositions and their applications to polynomial lower bounds for kernelization. Zbl 1421.68086
Hermelin, Danny; Wu, Xi
6
2012
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Zbl 1264.05131
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.
6
2012
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. Zbl 1207.68442
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
6
2010
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1330.68358
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren
5
2015
Parameterized two-player Nash equilibrium. Zbl 1272.68142
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus
5
2013
Approximating the 2-interval pattern problem. Zbl 1142.68070
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane
5
2008
Approximating the 2-interval pattern problem. Zbl 1123.68143
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane
5
2005
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny
4
2013
Parameterized complexity of induced \(H\)-matching on claw-free graphs. Zbl 1365.68282
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
4
2012
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael
4
2011
Well-quasi-orders in subclasses of bounded treewidth graphs. Zbl 1264.68120
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.
4
2009
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
2008
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
2005
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2018
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2016
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1342.68155
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
3
2016
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1355.68113
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
3
2015
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1329.68143
Hermelin, Danny; Rozenberg, Liat
3
2015
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1323.68634
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren
3
2013
Unified compression-based acceleration of edit-distance computation. Zbl 1259.68048
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren
3
2013
Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. Zbl 1284.68653
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
3
2010
The minimum substring cover problem. Zbl 1162.90592
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane
3
2008
Parameterized complexity of critical node cuts. Zbl 1359.68135
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak
2
2016
On the average-case complexity of parameterized clique. Zbl 1312.68100
Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny
2
2015
A completeness theory for polynomial (Turing) kernelization. Zbl 1407.68224
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi
2
2013
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. Zbl 1257.68079
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances
2
2013
Mod/Resc parsimony inference: theory and application. Zbl 1237.92041
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France
2
2012
Minimum vertex cover in rectangle graphs. Zbl 1225.05199
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
2
2011
W-hierarchies defined by symmetric gates. Zbl 1211.68217
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances
2
2010
Haplotype inference constrained by plausible haplotype data. Zbl 1247.92017
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat
2
2009
Domination when the stars are out. Zbl 1454.68104
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard
1
2019
On the parameterized tractability of single machine scheduling with rejection. Zbl 1403.90332
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; Talmon, Nimrod
1
2019
The clever shopper problem. Zbl 1434.68193
Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane
1
2018
Diminishable parameterized problems and strict polynomial kernelization. Zbl 06932469
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf
1
2018
Optimization problems in dotted interval graphs. Zbl 1298.05172
Hermelin, Danny; Mestre, Julián; Rawitz, Dror
1
2014
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1407.68225
Hermelin, Danny; Rozenberg, Liat
1
2014
Algorithmic aspects of the intersection and overlap numbers of a graph. Zbl 1260.68177
Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane
1
2012
Parameterized two-player Nash equilibrium. Zbl 1341.05160
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus
1
2011
Optimization problems in multiple subtree graphs. Zbl 1213.05247
Hermelin, Danny; Rawitz, Dror
1
2011
Minimum vertex cover in rectangle graphs. Zbl 1287.05143
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
1
2010
The minimum substring cover problem. Zbl 1130.68100
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane
1
2008
Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane
1
2007
Domination when the stars are out. Zbl 1454.68104
Hermelin, Danny; Mnich, Matthias; Van Leeuwen, Erik Jan; Woeginger, Gerhard
1
2019
On the parameterized tractability of single machine scheduling with rejection. Zbl 1403.90332
Hermelin, Danny; Pinedo, Michael; Shabtay, Dvir; Talmon, Nimrod
1
2019
Fractals for kernelization lower bounds. Zbl 1388.68112
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2018
The clever shopper problem. Zbl 1434.68193
Bulteau, Laurent; Hermelin, Danny; Labarre, Anthony; Vialette, Stéphane
1
2018
Diminishable parameterized problems and strict polynomial kernelization. Zbl 06932469
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf
1
2018
Fractals for kernelization lower bounds, with an application to length-bounded cut problems. Zbl 1388.68111
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf
3
2016
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1342.68155
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
3
2016
Parameterized complexity of critical node cuts. Zbl 1359.68135
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak
2
2016
A completeness theory for polynomial (Turing) kernelization. Zbl 1312.68102
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi
9
2015
Scheduling two competing agents when one agent has significantly fewer jobs. Zbl 1378.68021
Hermelin, Danny; Kubitza, Judith-Madeleine; Shabtay, Dvir; Talmon, Nimrod; Woeginger, Gerhard
6
2015
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1330.68358
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren
5
2015
Parameterized complexity dichotomy for Steiner Multicut. Zbl 1355.68113
Bringmann, Karl; Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
3
2015
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1329.68143
Hermelin, Danny; Rozenberg, Liat
3
2015
On the average-case complexity of parameterized clique. Zbl 1312.68100
Fountoulakis, Nikolaos; Friedrich, Tobias; Hermelin, Danny
2
2015
Parameterized complexity of induced graph matching on claw-free graphs. Zbl 1306.05163
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
7
2014
Optimization problems in dotted interval graphs. Zbl 1298.05172
Hermelin, Danny; Mestre, Julián; Rawitz, Dror
1
2014
Parameterized complexity analysis for the closest string with wildcards problem. Zbl 1407.68225
Hermelin, Danny; Rozenberg, Liat
1
2014
Parameterized two-player Nash equilibrium. Zbl 1272.68142
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus
5
2013
Tight kernel bounds for problems on graphs with small degeneracy (extended abstract). Zbl 1394.68173
Cygan, Marek; Grandoni, Fabrizio; Hermelin, Danny
4
2013
Binary jumbled pattern matching on trees and tree-like structures. Zbl 1323.68634
Gagie, Travis; Hermelin, Danny; Landau, Gad M.; Weimann, Oren
3
2013
Unified compression-based acceleration of edit-distance computation. Zbl 1259.68048
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren
3
2013
A completeness theory for polynomial (Turing) kernelization. Zbl 1407.68224
Hermelin, Danny; Kratsch, Stefan; Sołtys, Karolina; Wahlström, Magnus; Wu, Xi
2
2013
Constraint satisfaction problems: convexity makes AllDifferent constraints tractable. Zbl 1257.68079
Fellows, Michael; Friedrich, Tobias; Hermelin, Danny; Narodytska, Nina; Rosamond, Frances
2
2013
Weak compositions and their applications to polynomial lower bounds for kernelization. Zbl 1421.68086
Hermelin, Danny; Wu, Xi
6
2012
Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications. Zbl 1264.05131
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.
6
2012
Parameterized complexity of induced \(H\)-matching on claw-free graphs. Zbl 1365.68282
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan
4
2012
Mod/Resc parsimony inference: theory and application. Zbl 1237.92041
Nor, Igor; Hermelin, Danny; Charlat, Sylvain; Engelstadter, Jan; Reuter, Max; Duron, Olivier; Sagot, Marie-France
2
2012
Algorithmic aspects of the intersection and overlap numbers of a graph. Zbl 1260.68177
Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane
1
2012
Treewidth governs the complexity of target set selection. Zbl 1248.90068
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan
30
2011
Upper and lower bounds for finding connected motifs in vertex-colored graphs. Zbl 1210.68060
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
22
2011
Domination when the stars are out. Zbl 1334.68160
Hermelin, Danny; Mnich, Matthias; van Leeuwen, Erik Jan; Woeginger, Gerhard J.
9
2011
Distance oracles for vertex-labeled graphs. Zbl 1333.68212
Hermelin, Danny; Levy, Avivit; Weimann, Oren; Yuster, Raphael
4
2011
Minimum vertex cover in rectangle graphs. Zbl 1225.05199
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
2
2011
Parameterized two-player Nash equilibrium. Zbl 1341.05160
Hermelin, Danny; Huang, Chien-Chung; Kratsch, Stefan; Wahlström, Magnus
1
2011
Optimization problems in multiple subtree graphs. Zbl 1213.05247
Hermelin, Danny; Rawitz, Dror
1
2011
Optimization problems in multiple-interval graphs. Zbl 1300.05295
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror
10
2010
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications. Zbl 1207.68442
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
6
2010
Extension of the Nemhauser and Trotter theorem to generalized vertex cover with applications. Zbl 1284.68653
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
3
2010
W-hierarchies defined by symmetric gates. Zbl 1211.68217
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances
2
2010
Minimum vertex cover in rectangle graphs. Zbl 1287.05143
Bar-Yehuda, Reuven; Hermelin, Danny; Rawitz, Dror
1
2010
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
168
2009
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane
100
2009
A unified algorithm for accelerating edit-distance computation via text-compression. Zbl 1236.68308
Hermelin, Danny; Landau, Gad M.; Landau, Shir; Weimann, Oren
14
2009
Well-quasi-orders in subclasses of bounded treewidth graphs. Zbl 1264.68120
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances A.
4
2009
Haplotype inference constrained by plausible haplotype data. Zbl 1247.92017
Fellows, Michael R.; Hartman, Tzvika; Hermelin, Danny; Landau, Gad M.; Rosamond, Frances; Rozenberg, Liat
2
2009
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
Constrained LCS: Hardness and approximation. Zbl 1143.68637
Gotthilf, Zvi; Hermelin, Danny; Lewenstein, Moshe
9
2008
Approximating the 2-interval pattern problem. Zbl 1142.68070
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane
5
2008
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1154.05326
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
2008
The minimum substring cover problem. Zbl 1162.90592
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane
3
2008
The minimum substring cover problem. Zbl 1130.68100
Hermelin, Danny; Rawitz, Dror; Rizzi, Romeo; Vialette, Stéphane
1
2008
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
14
2007
Optimization problems in multiple-interval graphs. Zbl 1302.05179
Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror
8
2007
Common structured patterns in linear graphs: Approximation and combinatorics. Zbl 1138.68476
Fertin, Guillaume; Hermelin, Danny; Rizzi, Romeo; Vialette, Stéphane
1
2007
Approximating the 2-interval pattern problem. Zbl 1123.68143
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane
5
2005
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Zbl 1171.92316
Blin, Guillaume; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
4
2005
all top 5

Cited by 621 Authors

27 Saurabh, Saket
26 Kratsch, Stefan
22 Niedermeier, Rolf
21 Hermelin, Danny
20 Jansen, Bart M. P.
18 Gutin, Gregory Z.
17 Cygan, Marek
17 Fellows, Michael Ralph
17 Pilipczuk, Marcin
17 Pilipczuk, Michał
16 Lokshtanov, Daniel
15 Fomin, Fedor V.
14 Mnich, Matthias
13 Golovach, Petr A.
12 Komusiewicz, Christian
12 Vialette, Stéphane
12 Yeo, Anders
11 Dondi, Riccardo
11 Fertin, Guillaume
11 Heggernes, Pinar
11 Misra, Neeldhara
11 Paul, Christophe
11 Van Leeuwen, Erik Jan
10 Gargano, Luisa
10 Guo, Jiong
10 Sau, Ignasi
10 Szeider, Stefan
10 Wahlström, Magnus
9 Bodlaender, Hans L.
9 Jiang, Minghui
9 Rosamond, Frances A.
9 Sorge, Manuel
9 Vaccaro, Ugo
9 van Bevern, René
9 van ’t Hof, Pim
8 Cordasco, Gennaro
8 Knop, Dušan
8 Nichterlein, André
8 Perez, Anthony
8 Raman, Venkatesh
7 Fluschnik, Till
7 Marx, Dániel
7 Paulusma, Daniël
7 Schlotter, Ildikó
7 Suchý, Ondřej
7 Thilikos, Dimitrios M.
7 Thomassé, Stéphan
7 Zehavi, Meirav
6 Bazgan, Cristina
6 Bessy, Stéphane
6 Fernau, Henning
6 Gaspers, Serge
6 Panolan, Fahad
6 Philip, Geevarghese
6 Ramanujan, M. S.
6 Rautenbach, Dieter
6 Rescigno, Adele Anna
6 Sikora, Florian
6 Zhu, Binhai
5 Betzler, Nadja
5 Cai, Leizhen
5 Chopin, Morgan
5 Crowston, Robert
5 Kamiński, Marcin Marek
5 Kanj, Iyad A.
5 Kim, Eun Jung
5 Landau, Gad M.
5 Meeks, Kitty
5 Talmon, Nimrod
4 Bonizzoni, Paola
4 Bredereck, Robert
4 Bulteau, Laurent
4 Cicalese, Ferdinando
4 Dabrowski, Konrad Kazimierz
4 Dorn, Britta
4 Ehard, Stefan
4 Feng, Qilong
4 Guillemot, Sylvain
4 Hartung, Sepp
4 Jones, Mark W.
4 Koutecký, Martin
4 Lampis, Michael
4 Lipták, Zsuzsanna
4 Molter, Hendrik
4 Moser, Hannes
4 Pinter, Ron Yair
4 Raymond, Jean-Florent
4 Rizzi, Romeo
4 Shachnai, Hadas
4 Villanger, Yngve
4 Wang, Jianxin
4 Wang, Wencheng
4 Weimann, Oren
4 Woeginger, Gerhard Johannes
4 Wojtaszczyk, Jakub Onufry
4 Wrochna, Marcin
4 Yang, Yongjie
4 Zhang, Yong
3 Bannai, Hideo
3 Belmonte, Rémy
...and 521 more Authors
all top 5

Cited in 48 Serials

69 Theoretical Computer Science
68 Algorithmica
39 Journal of Computer and System Sciences
26 Discrete Applied Mathematics
22 Theory of Computing Systems
19 Information Processing Letters
12 Journal of Combinatorial Optimization
11 SIAM Journal on Discrete Mathematics
11 Journal of Discrete Algorithms
11 Discrete Optimization
9 Information and Computation
6 Journal of Graph Algorithms and Applications
6 Algorithms
5 Artificial Intelligence
5 ACM Transactions on Computation Theory
4 Discrete Mathematics
4 SIAM Journal on Computing
4 Journal of Scheduling
3 European Journal of Operational Research
3 Mathematical Programming. Series A. Series B
3 Optimization Letters
2 Discrete & Computational Geometry
2 Computers & Operations Research
2 Computational Geometry
2 Journal of the ACM
2 Trudy Instituta Matematiki
2 Discrete Mathematics, Algorithms and Applications
2 Computer Science Review
1 Acta Informatica
1 Applied Mathematics and Computation
1 Information Sciences
1 Journal of Combinatorial Theory. Series B
1 Mathematics of Operations Research
1 Networks
1 Journal of Automated Reasoning
1 Asia-Pacific Journal of Operational Research
1 International Journal of Foundations of Computer Science
1 Computational Complexity
1 Journal of Logic, Language and Information
1 The Journal of Artificial Intelligence Research (JAIR)
1 Complexity
1 International Transactions in Operational Research
1 Constraints
1 ACM Journal of Experimental Algorithmics
1 Contributions to Discrete Mathematics
1 Logical Methods in Computer Science
1 RAIRO. Theoretical Informatics and Applications
1 Prikladnaya Diskretnaya Matematika

Citations by Year