×

Fellows, Michael Ralph

Compute Distance To:
Author ID: fellows.michael-r Recent zbMATH articles by "Fellows, Michael Ralph"
Published as: Fellows, Michael R.; Fellows, Michael; Fellows, M.; Fellows, Mike; Fellows, M. R.
Homepage: http://www.mrfellows.net/
External Links: MGP · ORCID · Wikidata · Google Scholar · ResearchGate · dblp · GND · IdRef
Documents Indexed: 190 Publications since 1987, including 2 Books
3 Contributions as Editor
Biographic References: 4 Publications
Co-Authors: 169 Co-Authors with 180 Joint Publications
4,589 Co-Co-Authors
all top 5

Co-Authors

13 single-authored
63 Rosamond, Frances A.
35 Downey, Rodney Graham
18 Langston, Michael A.
15 Niedermeier, Rolf
13 Hermelin, Danny
12 Bodlaender, Hans L.
11 Guo, Jiong
10 Stege, Ulrike
9 Hallett, Michael T.
8 Lokshtanov, Daniel
8 McCartin, Catherine
8 Saurabh, Saket
7 Whitesides, Sue H.
6 Dehne, Frank
6 Fomin, Fedor V.
6 Nishimura, Naomi
6 Ragde, Prabhakar L.
6 Szeider, Stefan
5 Cai, Liming
5 Chen, Jian-er
5 Fernau, Henning
5 Gaspers, Serge
5 Koblitz, Neal I.
4 Abrahamson, Karl A.
4 Alber, Jochen
4 Dinneen, Michael J.
4 Dujmović, Vida
4 Fan, Hongbing
4 Jansen, Bart M. P.
4 Kanj, Iyad A.
4 Kitching, Matthew
4 Liotta, Giuseppe
4 Moser, Hannes
4 Shachnai, Hadas
4 Thilikos, Dimitrios M.
4 Wood, David Ronald
3 Abu-Khzam, Faisal N.
3 Betzler, Nadja
3 Cattell, Kevin
3 Chor, Benny
3 Dantas da Silva, Maise
3 Egan, Judith
3 Heggernes, Pinar
3 Juedes, David W.
3 Knauer, Christian
3 Komusiewicz, Christian
3 Protti, Fábio
3 Ragan, Mark A.
3 Rosamond, Fran
3 Suderman, Matthew
3 Vialette, Stéphane
2 Bazgan, Cristina
2 Chopin, Morgan
2 Clark, Lane H.
2 Crowston, Robert
2 Dom, Michael
2 dos Santos Souza, Uéverton
2 Entringer, Roger Charles
2 Erdélyi, Gábor
2 Estivill-Castro, Vladimir
2 Fertin, Guillaume
2 Gramm, Jens
2 Gutin, Gregory Z.
2 Hell, Pavol
2 Kratochvíl, Jan
2 Kulik, Ariel
2 Losievskaja, Elena
2 Mancini, Federico
2 Middendorf, Matthias
2 Misra, Neeldhara
2 Müller, Moritz
2 Papadopoulos, Charis
2 Pfeiffer, Frank
2 Prieto, Elena
2 Raman, Venkatesh
2 Regan, Kenneth W.
2 Rothe, Jörg-Matthias
2 Rotics, Udi
2 Schend, Lena
2 Seyffarth, Karen
2 Stevens, Kim
2 Telle, Jan Arne
2 Thomassé, Stéphan
2 Thomassen, Carsten
2 Uhlmann, Johannes
2 van Bevern, René
2 Wareham, H. Todd
2 Weyer, Mark
2 Wrightson, Graham
2 Yeo, Anders
2 Zhu, Binhai
1 Abello, James M.
1 Alon, Noga M.
1 Balasubramanian, Ramachandran
1 Barefoot, Curtiss A.
1 Baste, Julien
1 Brown, Donna J.
1 Burrage, Kevin
1 Cesati, Marco
1 Chen, Zhizhong
...and 69 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

175 Publications have been cited 3,768 times in 2,061 Documents Cited by Year
Parameterized complexity. Zbl 0914.68076
Downey, R. G.; Fellows, M. R.
481
1998
Fundamentals of parameterized complexity. Zbl 1358.68006
Downey, Rodney G.; Fellows, Michael R.
425
2013
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
179
2009
Fixed-parameter tractability and completeness II: On completeness for W[1]. Zbl 0873.68059
Downey, Rod G.; Fellows, Michael R.
130
1995
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane
118
2009
Parameterized complexity after (almost) ten years: Review and open questions. Zbl 0961.68533
Downey, Rodney G.; Fellows, Michael R.
108
1999
Fixed-parameter tractability and completeness. I: Basic results. Zbl 0830.68063
Downey, Rod G.; Fellows, Michael R.
107
1995
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
Polynomial-time data reduction for dominating set. Zbl 1192.68337
Alber, Jochen; Fellows, Michael R.; Niedermeier, Rolf
62
2004
Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues. Zbl 0828.68077
Abrahamson, Karl A.; Downey, Rodney G.; Fellows, Michael R.
53
1995
Parametrized complexity: A framework for systematically confronting computational intractability. Zbl 0935.68046
Downey, Rodney G.; Fellows, Michael R.; Stege, Ulrike
52
1999
Fixed-parameter tractability and completeness. Zbl 0768.68136
Downey, Rod G.; Fellows, Michael R.
50
1992
Nonconstructive tools for proving polynomial-time decidability. Zbl 0652.68049
Fellows, Michael R.; Langston, Michael A.
48
1988
Clique-width is NP-complete. Zbl 1207.68159
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan
45
2009
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
44
2008
Parameterized computational feasibility. Zbl 0834.68046
Downey, Rodney G.; Fellows, Michael R.
43
1995
Linear kernels in linear time, or how to save \(k\) colors in \(O(n^{2})\) steps. Zbl 1112.68412
Chor, Benny; Fellows, Mike; Juedes, David
38
2004
Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465
Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances
38
2013
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract). Zbl 1345.68152
Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.
35
1994
Fixed-parameter tractability and completeness. III: Some structural aspects of the \(W\) hierarchy. Zbl 0799.68087
Downey, Rod; Fellows, Michael
32
1993
Perfect domination. Zbl 0761.05091
Fellows, Michael R.; Hoover, Mark N.
31
1991
On the complexity of some colorful problems parameterized by treewidth. Zbl 1223.05070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten
31
2011
Crown structures for vertex cover kernelization. Zbl 1148.68035
Abu-Khzam, Faisal N.; Fellows, Michael R.; Langston, Michael A.; Suters, W. Henry
29
2007
The parametrized complexity of some fundamental problems in coding theory. Zbl 0943.68079
Downey, Rod G.; Fellows, Michael R.; Vardy, Alexander; Whittle, Geoff
29
1999
Advice classes of parametrized tractability. Zbl 0873.68071
Cai, Liming; Chen, Jianer; Downey, Rodney G.; Fellows, Michael R.
27
1997
Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems. Zbl 1270.68112
Downey, Rodney G.; Estivill-Castro, Vladimir; Fellows, Michael; Prieto, Elena; Rosamund, Frances A.
27
2003
On the complexity and combinatorics of covering finite complexes. Zbl 0763.05035
Abello, James; Fellows, Michael R.; Stillwell, John C.
26
1991
Finite automata, bounded treewidth and well-quasiordering. Zbl 0791.05094
Abrahamson, Karl; Fellows, Michael
26
1993
A generalization of Nemhauser and Trotter’s local optimization theorem. Zbl 1235.68081
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf
26
2011
The complexity of induced minors and related problems. Zbl 0816.68070
Fellows, M. R.; Kratochvíl, J.; Middendorf, M.; Pfeiffer, F.
26
1995
Parameterized approximation problems. Zbl 1154.68572
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine
26
2006
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
25
2011
Finding \(k\) disjoint triangles in an arbitrary graph. Zbl 1112.68418
Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne
25
2004
Blow-ups, win/win’s, and crown rules: some new directions in FPT. Zbl 1255.68113
Fellows, Michael R.
25
2003
An improved fixed-parameter algorithm for vertex cover. Zbl 1337.05095
Balasubramanian, R.; Fellows, Michael R.; Raman, Venkatesh
25
1998
On the parameterized complexity of short computation and factorization. Zbl 0944.68069
Cai, Liming; Chen, Jianer; Downey, Rodney G.; Fellows, Michael R.
24
1997
On search, decision, and the efficiency of polynomial-time algorithms. Zbl 0938.68599
Fellows, Michael R.; Langston, Michael A.
23
1994
Efficient parameterized preprocessing for cluster editing. Zbl 1135.68511
Fellows, Michael; Langston, Michael; Rosamond, Frances; Shaw, Peter
23
2007
The undirected feedback vertex set problem has a Poly\((k)\) kernel. Zbl 1154.68421
Burrage, Kevin; Estivill-Castro, Vladimir; Fellows, Michael; Langston, Michael; Mac, Shev; Rosamond, Frances
23
2006
Towards fully multivariate algorithmics: some new results and directions in parameter ecology. Zbl 1267.68302
Fellows, Michael
22
2009
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
Algebraic constructions of efficient broadcast networks. Zbl 0767.94028
Dinneen, Michael J.; Fellows, Michael R.; Faber, Vance
21
1991
Clique-width minimization is NP-hard. Zbl 1301.68145
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan
21
2006
The complexity ecology of parameters: An illustration using bounded max leaf number. Zbl 1184.05123
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket
21
2009
Nonconstructive advances in polynomial-time complexity. Zbl 0637.68053
Fellows, Michael R.; Langston, Michael A.
21
1987
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1170.68047
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S.
21
2008
On well-partial-order theory and its application to combinatorial problems of VLSI design. Zbl 0739.68042
Fellows, Michael R.; Langston, Michael A.
20
1992
The parameterized complexity of some problems in logic and linguistics. Zbl 0946.03046
Downey, Rodney G.; Fellows, Michael R.; Kapron, Bruce M.; Hallett, Michael T.; Wareham, H. Todd
19
1994
The parameterized complexity of sequence alignment and consensus. Zbl 0888.68060
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Wareham, Harold T.
19
1995
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. Zbl 1148.68037
Dehne, Frank; Fellows, Michael; Langston, Michael; Rosamond, Frances; Stevens, Kim
18
2007
Graph-based data clustering with overlaps. Zbl 1248.90070
Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes
18
2011
The private neighbor cube. Zbl 0795.05078
Fellows, Michael; Fricke, Gerd; Hedetniemi, Stephen; Jacobs, David
18
1994
The parameterized complexity of relational database queries and an improved characterization of \(W[1]\). Zbl 0918.68018
Downey, Rod G.; Fellows, Michael R.; Taylor, Udayan
16
1997
On complexity of lobbying in multiple referenda. Zbl 1136.91376
Christian, Robin; Fellows, Mike; Rosamond, Frances; Slinko, Arkadii
16
2007
A refined search tree technique for dominating set on planar graphs. Zbl 1101.68712
Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf; Rosamond, Fran; Stege, Ulrike
16
2005
Fixed-parameter complexity and cryptography. Zbl 0801.68088
Fellows, Michael R.; Koblitz, Neal
16
1993
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
15
2007
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
15
2012
Parameterized approximation of dominating set problems. Zbl 1191.68862
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine; Rosamond, Frances
15
2009
The parameterized complexity of some minimum label problems. Zbl 1214.05150
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad
15
2010
Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel \(2k\) kernelization for vertex cover. Zbl 1104.68516
Dehne, Frank; Fellows, Mike; Rosamond, Frances; Shaw, Peter
15
2004
Fixed-parameter algorithms for Kemeny rankings. Zbl 1179.91062
Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A.
15
2009
Large planar graphs with given diameter and maximum degree. Zbl 0832.05060
Fellows, M.; Hell, P.; Seyffarth, K.
15
1995
nonblocker: Parameterized algorithmics for minimum dominating set. Zbl 1175.68543
Dehne, Frank; Fellows, Michael; Fernau, Henning; Prieto, Elena; Rosamond, Frances
15
2006
Threshold dominating sets and an improved characterization of \(W[2]\). Zbl 0912.68075
Downey, Rodney G.; Fellows, Michael R.
14
1998
The lost continent of polynomial time: Preprocessing and kernelization. Zbl 1154.68560
Fellows, Michael R.
14
2006
Connected coloring completion for general graphs: algorithms and complexity. Zbl 1206.05040
Chor, Benny; Fellows, Michael; Ragan, Mark A.; Razgon, Igor; Rosamond, Frances; Snir, Sagi
14
2007
On the parameterized complexity of layered graph drawing. Zbl 1170.68028
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R.
14
2008
Transversals of vertex partitions in graphs. Zbl 0735.05057
Fellows, Michael R.
13
1990
Control complexity in Bucklin and fallback voting: a theoretical analysis. Zbl 1320.91055
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena
13
2015
An \(O (2^{ O (k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. Zbl 1128.68400
Dehne, Frank; Fellows, Michael; Langston, Michael A.; Rosamond, Frances; Stevens, Kim
13
2005
On the structure of parameterized problems in NP. Zbl 1096.68626
Cai, Liming; Chen, Jianer; Downey, Rodney; Fellows, Michael
13
1995
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling. Zbl 0857.90056
Bodlaender, Hans L.; Fellows, Michael R.
13
1995
Parameterized circuit complexity and the \(W\) hierarchy. Zbl 0896.68057
Downey, Rodney G.; Fellows, Michael R.; Regan, Kenneth W.
12
1998
The complexity of irredundant sets parameterized by size. Zbl 0948.68133
Downey, Rodney G.; Fellows, Michael R.; Raman, Venkatesh
12
2000
A linear kernel for co-path/cycle packing. Zbl 1286.05131
Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai
12
2010
The immersion order, forbidden subgraphs and the complexity of network integrity. Zbl 0691.05026
Fellows, Michael R.; Stueckle, Sam
12
1989
The Robertson-Seymour theorems: A survey of applications. Zbl 0692.68030
Fellows, Michael R.
12
1989
Fixed-parameter intractability. II. (Extended abstract). Zbl 0799.68086
Abrahamson, Karl A.; Downey, Rodney G.; Fellows, Michael R.
12
1993
Parameterized algorithms and hardness results for some graph motif problems. Zbl 1143.68501
Betzler, Nadja; Fellows, Michael R.; Komusiewicz, Christian; Niedermeier, Rolf
12
2008
On the parameterized intractability of motif search problems. Zbl 1109.68049
Fellows, Michael R.; Gramm, Jens; Niedermeier, Rolf
11
2006
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Zbl 0945.68145
Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.; Wareham, H. Todd; Warnow, Tandy J.
11
2000
Computational tractability: The view from Mars. Zbl 0941.68577
Downey, Rodney G.; Fellows, Michael R.; Stege, Ulrike
11
1999
On the parametric complexity of schedules to minimize tardy tasks. Zbl 1038.68049
Fellows, Michael R.; McCartin, Catherine
11
2003
Coordinatized kernels and catalytic reductions: An improved FPT algorithm for Max Leaf Spanning Tree and other problems. Zbl 1044.68697
Fellows, Michael R.; McCartin, Catherine; Rosamond, Frances A.; Stege, Ulrike
11
2000
Self-witnessing polynomial-time complexity and prime factorization. Zbl 0756.11042
Fellows, Michael R.; Koblitz, Neal
10
1992
On computing graph minor obstruction sets. Zbl 0952.68116
Cattell, Kevin; Dinneen, Michael J.; Downey, Rodney G.; Fellows, Michael R.; Langston, Michael A.
10
2000
Parameterized complexity: the main ideas and some research frontiers. Zbl 1077.68651
Fellows, Michael R.
10
2001
Analogs & duals of the MAST problem for sequences & trees. Zbl 1064.68044
Fellows, Michael; Hallett, Michael; Stege, Ulrike
10
2003
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
A fixed-parameter approach to 2-layer planarization. Zbl 1095.68081
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R.
10
2006
Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average. Zbl 1246.68129
Crowston, Robert; Fellows, Michael; Gutin, Gregory; Jones, Mark; Rosamond, Frances; Thomassé, Stéphan; Yeo, Anders
10
2011
Parameterized approximation via fidelity preserving transformations. Zbl 1272.68459
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas
10
2012
The complexity of polynomial-time approximation. Zbl 1202.68481
Cai, Liming; Fellows, Michael; Juedes, David; Rosamond, Frances
9
2007
Combinatorial cryptosystems galore! Zbl 0806.94013
Fellows, Michael; Koblitz, Neal
9
1994
Computational complexity of integrity. Zbl 0636.05033
Clark, Lane H.; Entringer, Roger C.; Fellows, Michael R.
9
1987
Parameterized complexity of firefighting. Zbl 1411.68046
Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor V.; van Leeuwen, Erik Jan
8
2014
Control complexity in Bucklin and fallback voting: an experimental analysis. Zbl 1320.91056
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena
8
2015
Parameterizing by the number of numbers. Zbl 1253.68173
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
8
2012
Forbidden minors to graphs with small feedback sets. Zbl 0964.05064
Dinneen, Michael J.; Cattell, Kevin; Fellows, Michael R.
8
2001
Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number. Zbl 1387.05197
Fellows, Michael; Protti, Fábio; Rosamond, Frances; da Silva, Maise Dantas; Souza, Uéverton S.
1
2018
Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Zbl 1352.03004
3
2017
Tractable parameterizations for the minimum linear arrangement problem. Zbl 1427.68118
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Shachnai, Hadas
1
2016
Control complexity in Bucklin and fallback voting: a theoretical analysis. Zbl 1320.91055
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena
13
2015
Control complexity in Bucklin and fallback voting: an experimental analysis. Zbl 1320.91056
Erdélyi, Gábor; Fellows, Michael R.; Rothe, Jörg; Schend, Lena
8
2015
On the parameterized complexity of dynamic problems. Zbl 1333.68130
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter
7
2015
Tractability and hardness of flood-filling games on trees. Zbl 1312.68090
Fellows, Michael R.; dos Santos Souza, Uéverton; Protti, Fábio; Dantas da Silva, Maise
3
2015
Myhill-Nerode methods for hypergraphs. Zbl 1335.68098
van Bevern, René; Downey, Rodney G.; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
3
2015
Parameterized complexity of firefighting. Zbl 1411.68046
Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor V.; van Leeuwen, Erik Jan
8
2014
Satisfying more than half of a system of linear equations over GF(2): a multivariate approach. Zbl 1285.68053
Crowston, R.; Fellows, M.; Gutin, G.; Jones, M.; Kim, E. J.; Rosamond, F.; Ruzsa, I. Z.; Thomassé, S.; Yeo, A.
6
2014
FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders. Zbl 1347.68167
Fellows, Michael R.; Jansen, Bart M. P.
3
2014
On the parameterized complexity of dynamic problems with connectivity constraints. Zbl 1434.68204
Abu-Khzam, Faisal N.; Egan, Judith; Fellows, Michael R.; Rosamond, Frances A.; Shaw, Peter
1
2014
Fundamentals of parameterized complexity. Zbl 1358.68006
Downey, Rodney G.; Fellows, Michael R.
425
2013
Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Zbl 1448.68465
Fellows, Michael R.; Jansen, Bart M. P.; Rosamond, Frances
38
2013
Distortion is fixed parameter tractable. Zbl 1322.68102
Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances; Saurabh, Saket
4
2013
FPT is characterized by useful obstruction sets. Zbl 1417.68051
Fellows, Michael R.; Jansen, Bart M. P.
2
2013
Myhill-Nerode methods for hypergraphs. Zbl 1329.68129
van Bevern, René; Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
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
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
15
2012
Parameterized approximation via fidelity preserving transformations. Zbl 1272.68459
Fellows, Michael R.; Kulik, Ariel; Rosamond, Frances; Shachnai, Hadas
10
2012
Parameterizing by the number of numbers. Zbl 1253.68173
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
8
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
On the complexity of some colorful problems parameterized by treewidth. Zbl 1223.05070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten
31
2011
A generalization of Nemhauser and Trotter’s local optimization theorem. Zbl 1235.68081
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf
26
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
25
2011
Graph-based data clustering with overlaps. Zbl 1248.90070
Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes
18
2011
Simultaneously satisfying linear equations over \(\mathbb {F}_2\): MaxLin2 and Max-\(r\)-Lin2 parameterized above average. Zbl 1246.68129
Crowston, Robert; Fellows, Michael; Gutin, Gregory; Jones, Mark; Rosamond, Frances; Thomassé, Stéphan; Yeo, Anders
10
2011
A complexity dichotomy for finding disjoint solutions of vertex deletion problems. Zbl 1322.68101
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf
6
2011
Facility location problems: a parameterized view. Zbl 1218.90100
Fellows, Michael R.; Fernau, Henning
5
2011
Quadratic kernelization for convex recoloring of trees. Zbl 1234.68146
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark
5
2011
Parameterized complexity of the firefighter problem. Zbl 1350.68128
Bazgan, Cristina; Chopin, Morgan; Fellows, Michael R.
3
2011
Multivariate complexity theory. Zbl 1281.68123
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances
2
2011
The parameterized complexity of some minimum label problems. Zbl 1214.05150
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad
15
2010
A linear kernel for co-path/cycle packing. Zbl 1286.05131
Chen, Zhi-Zhong; Fellows, Michael; Fu, Bin; Jiang, Haitao; Liu, Yang; Wang, Lusheng; Zhu, Binhai
12
2010
Parameterizing by the number of numbers. Zbl 1309.68092
Fellows, Michael R.; Gaspers, Serge; Rosamond, Frances A.
5
2010
Milling a graph with turn costs: a parameterized complexity perspective. Zbl 1309.68093
Fellows, Mike; Giannopoulos, Panos; Knauer, Christian; Paul, Christophe; Rosamond, Frances; Whitesides, Sue; Yu, Nathan
3
2010
Clustering with partial information. Zbl 1213.05222
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
2
2010
W-hierarchies defined by symmetric gates. Zbl 1211.68217
Fellows, Michael; Flum, Jörg; Hermelin, Danny; Müller, Moritz; Rosamond, Frances
2
2010
Determining the winner of a Dodgson election is hard. Zbl 1245.68091
Fellows, Michael; Jansen, Bart M. P.; Lokshtanov, Daniel; Rosamond, Frances A.; Saurabh, Saket
2
2010
The parameterized complexity of some minimum label problems. Zbl 1273.68166
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad A.
1
2010
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
179
2009
On the parameterized complexity of multiple-interval graph problems. Zbl 1161.68038
Fellows, Michael R.; Hermelin, Danny; Rosamond, Frances; Vialette, Stéphane
118
2009
Clique-width is NP-complete. Zbl 1207.68159
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan
45
2009
Towards fully multivariate algorithmics: some new results and directions in parameter ecology. Zbl 1267.68302
Fellows, Michael
22
2009
The complexity ecology of parameters: An illustration using bounded max leaf number. Zbl 1184.05123
Fellows, Michael; Lokshtanov, Daniel; Misra, Neeldhara; Mnich, Matthias; Rosamond, Frances; Saurabh, Saket
21
2009
Parameterized approximation of dominating set problems. Zbl 1191.68862
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine; Rosamond, Frances
15
2009
Fixed-parameter algorithms for Kemeny rankings. Zbl 1179.91062
Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A.
15
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
Distortion is fixed parameter tractable. Zbl 1248.68244
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances A.; Saurabh, Saket
6
2009
Parameterized complexity of stabbing rectangles and squares in the plane. Zbl 1211.68465
Dom, Michael; Fellows, Michael R.; Rosamond, Frances A.
6
2009
A generalization of Nemhauser and Trotter’s local optimization theorem. Zbl 1236.68086
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf
5
2009
Derivation of algorithms for cutwidth and related graph layout parameters. Zbl 1165.68523
Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M.
5
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
Graph-based data clustering with overlaps. Zbl 1248.68377
Fellows, Michael R.; Guo, Jiong; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes
2
2009
A complexity dichotomy for finding disjoint solutions of vertex deletion problems. Zbl 1250.68125
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf
1
2009
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
44
2008
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1170.68047
Fellows, M. R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, D. M.; Whitesides, S.
21
2008
On the parameterized complexity of layered graph drawing. Zbl 1170.68028
Dujmović, Vida; Fellows, Michael R.; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Frances; Whitesides, Sue; Wood, David R.
14
2008
Parameterized algorithms and hardness results for some graph motif problems. Zbl 1143.68501
Betzler, Nadja; Fellows, Michael R.; Komusiewicz, Christian; Niedermeier, Rolf
12
2008
Fixed-parameter algorithms for Kemeny scores. Zbl 1143.91319
Betzler, Nadja; Fellows, Michael R.; Guo, Jiong; Niedermeier, Rolf; Rosamond, Frances A.
5
2008
Leaf powers and their properties: Using the trees. Zbl 1183.68425
Fellows, Michael R.; Meister, Daniel; Rosamond, Frances A.; Sritharan, R.; Telle, Jan Arne
5
2008
Clustering with partial information. Zbl 1173.68596
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
3
2008
Facility location problems: A parameterized view. Zbl 1143.90354
Fellows, Michael; Fernau, Henning
1
2008
Crown structures for vertex cover kernelization. Zbl 1148.68035
Abu-Khzam, Faisal N.; Fellows, Michael R.; Langston, Michael A.; Suters, W. Henry
29
2007
Efficient parameterized preprocessing for cluster editing. Zbl 1135.68511
Fellows, Michael; Langston, Michael; Rosamond, Frances; Shaw, Peter
23
2007
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. Zbl 1148.68037
Dehne, Frank; Fellows, Michael; Langston, Michael; Rosamond, Frances; Stevens, Kim
18
2007
On complexity of lobbying in multiple referenda. Zbl 1136.91376
Christian, Robin; Fellows, Mike; Rosamond, Frances; Slinko, Arkadii
16
2007
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. Zbl 1171.68497
Fellows, Michael R.; Fertin, Guillaume; Hermelin, Danny; Vialette, Stéphane
15
2007
Connected coloring completion for general graphs: algorithms and complexity. Zbl 1206.05040
Chor, Benny; Fellows, Michael; Ragan, Mark A.; Razgon, Igor; Rosamond, Frances; Snir, Sagi
14
2007
The complexity of polynomial-time approximation. Zbl 1202.68481
Cai, Liming; Fellows, Michael; Juedes, David; Rosamond, Frances
9
2007
On the complexity of some colorful problems parameterized by treewidth. Zbl 1175.68292
Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten
7
2007
Quadratic kernelization for convex recoloring of trees. Zbl 1206.68141
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark
5
2007
The complexity ecology of parameters: an illustration using bounded max leaf number. Zbl 1151.68426
Fellows, Michael; Rosamond, Frances
1
2007
Parameterized approximation problems. Zbl 1154.68572
Downey, Rodney G.; Fellows, Michael R.; McCartin, Catherine
26
2006
The undirected feedback vertex set problem has a Poly\((k)\) kernel. Zbl 1154.68421
Burrage, Kevin; Estivill-Castro, Vladimir; Fellows, Michael; Langston, Michael; Mac, Shev; Rosamond, Frances
23
2006
Clique-width minimization is NP-hard. Zbl 1301.68145
Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan
21
2006
nonblocker: Parameterized algorithmics for minimum dominating set. Zbl 1175.68543
Dehne, Frank; Fellows, Michael; Fernau, Henning; Prieto, Elena; Rosamond, Frances
15
2006
The lost continent of polynomial time: Preprocessing and kernelization. Zbl 1154.68560
Fellows, Michael R.
14
2006
On the parameterized intractability of motif search problems. Zbl 1109.68049
Fellows, Michael R.; Gramm, Jens; Niedermeier, Rolf
11
2006
A fixed-parameter approach to 2-layer planarization. Zbl 1095.68081
Dujmović, Vida; Fellows, Michael; Hallett, Michael; Kitching, Matthew; Liotta, Giuseppe; McCartin, Catherine; Nishimura, Naomi; Ragde, Prabhakar; Rosamond, Fran; Suderman, Matthew; Whitesides, Sue; Wood, David R.
10
2006
On finding short resolution refutations and small unsatisfiable subsets. Zbl 1087.03035
Fellows, Michael R.; Szeider, Stefan; Wrightson, Graham
3
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
A refined search tree technique for dominating set on planar graphs. Zbl 1101.68712
Alber, Jochen; Fan, Hongbing; Fellows, Michael R.; Fernau, Henning; Niedermeier, Rolf; Rosamond, Fran; Stege, Ulrike
16
2005
An \(O (2^{ O (k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem. Zbl 1128.68400
Dehne, Frank; Fellows, Michael; Langston, Michael A.; Rosamond, Frances; Stevens, Kim
13
2005
Polynomial-time data reduction for dominating set. Zbl 1192.68337
Alber, Jochen; Fellows, Michael R.; Niedermeier, Rolf
62
2004
Linear kernels in linear time, or how to save \(k\) colors in \(O(n^{2})\) steps. Zbl 1112.68412
Chor, Benny; Fellows, Mike; Juedes, David
38
2004
Finding \(k\) disjoint triangles in an arbitrary graph. Zbl 1112.68418
Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne
25
2004
Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel \(2k\) kernelization for vertex cover. Zbl 1104.68516
Dehne, Frank; Fellows, Mike; Rosamond, Frances; Shaw, Peter
15
2004
The dominating set problem is fixed parameter tractable for graphs of bounded genus. Zbl 1072.68079
Ellis, J.; Fan, H.; Fellows, M.
8
2004
Faster fixed-parameter tractable algorithms for matching and packing problems. Zbl 1111.68794
Fellows, Michael R.; Knauer, C.; Nishimura, N.; Ragde, P.; Rosamond, F.; Stege, U.; Thilikos, Dimitrios M.; Whitesides, S.
6
2004
Parametrized and exact computation. First international workshop, IWPEC 2004, Bergen, Norway, September 14–17, 2004. Proceedings. Zbl 1058.68004
1
2004
A survey of FPT algorithm design techniques with an emphasis on recent advances and connections to practical computing. Zbl 1111.68764
Fellows, Michael R.
1
2004
Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems. Zbl 1270.68112
Downey, Rodney G.; Estivill-Castro, Vladimir; Fellows, Michael; Prieto, Elena; Rosamund, Frances A.
27
2003
Blow-ups, win/win’s, and crown rules: some new directions in FPT. Zbl 1255.68113
Fellows, Michael R.
25
2003
On the parametric complexity of schedules to minimize tardy tasks. Zbl 1038.68049
Fellows, Michael R.; McCartin, Catherine
11
2003
Analogs & duals of the MAST problem for sequences & trees. Zbl 1064.68044
Fellows, Michael; Hallett, Michael; Stege, Ulrike
10
2003
New directions and new challenges in algorithm design and complexity, parameterized. Zbl 1278.68107
Fellows, Michael R.
8
2003
An FPT algorithm for set splitting. Zbl 1255.68080
Dehne, Frank; Fellows, Michael R.; Rosamond, Frances A.
5
2003
...and 75 more Documents
all top 5

Cited by 2,093 Authors

93 Saurabh, Saket
89 Niedermeier, Rolf
66 Fellows, Michael Ralph
60 Fomin, Fedor V.
59 Golovach, Petr A.
52 Chen, Jian-er
49 Thilikos, Dimitrios M.
47 Gutin, Gregory Z.
45 Lokshtanov, Daniel
44 Fernau, Henning
43 Komusiewicz, Christian
41 Guo, Jiong
38 Paulusma, Daniël
37 Kratsch, Stefan
35 Raman, Venkatesh
35 Wang, Jianxin
34 Sau, Ignasi
34 Zehavi, Meirav
33 Szeider, Stefan
30 Kanj, Iyad A.
30 Pilipczuk, Marcin L.
29 Heggernes, Pinar
29 Hermelin, Danny
29 Pilipczuk, Michał
28 Bodlaender, Hans L.
27 Jansen, Bart M. P.
25 Cygan, Marek
25 Ganian, Robert
25 Mnich, Matthias
25 Rosamond, Frances A.
25 Yeo, Anders
24 Nichterlein, André
23 Dondi, Riccardo
23 Feng, Qilong
23 Kratsch, Dieter
23 Misra, Neeldhara
23 Ordyniak, Sebastian
23 Paul, Christophe
22 Bredereck, Robert
22 Paschos, Vangelis Th.
22 Van Leeuwen, Erik Jan
22 Wahlström, Magnus
21 Marx, Dániel
21 van Bevern, René
20 Gaspers, Serge
19 Downey, Rodney Graham
19 Kratochvíl, Jan
19 Lampis, Michael
19 Liedloff, Mathieu
19 Sorge, Manuel
19 Xia, Ge
18 Philip, Geevarghese
18 Ramanujan, M. S.
17 Courcelle, Bruno
17 Panolan, Fahad
17 Rossmanith, Peter
17 van ’t Hof, Pim
17 Villanger, Yngve
16 Abu-Khzam, Faisal N.
16 Fiala, Jiří
16 Kamiński, Marcin Marek
16 Sikora, Florian
16 Uhlmann, Johannes
15 Fertin, Guillaume
15 Moser, Hannes
15 Weller, Mathias
14 Hüffner, Falk
14 Langston, Michael A.
14 Otachi, Yota
14 Suchý, Ondřej
14 Telle, Jan Arne
13 Bazgan, Cristina
13 Betzler, Nadja
13 Bonnet, Edouard
13 Eiben, Eduard
13 Escoffier, Bruno
13 Gurski, Frank
13 Knop, Dušan
13 Li, Wenjun
13 Lozin, Vadim Vladislavovich
13 Meeks, Kitty
13 Meister, Daniel
12 Dabrowski, Konrad Kazimierz
12 Kim, Eun Jung
12 Milanič, Martin
12 Vialette, Stéphane
12 Xiao, Mingyu
12 Zhu, Binhai
11 Agrawal, Akanksha
11 Arvind, Vikraman
11 Flum, Jörg
11 Fluschnik, Till
11 Froese, Vincent
11 Hartung, Sepp
11 Schlotter, Ildikó
11 Sikdar, Somnath
11 Woeginger, Gerhard Johannes
10 Belmonte, Rémy
10 Cao, Yixin
10 Chen, Jiehua
...and 1,993 more Authors
all top 5

Cited in 142 Serials

349 Theoretical Computer Science
219 Discrete Applied Mathematics
202 Algorithmica
148 Journal of Computer and System Sciences
93 Information Processing Letters
62 Theory of Computing Systems
50 SIAM Journal on Discrete Mathematics
50 Journal of Discrete Algorithms
41 Information and Computation
40 Journal of Combinatorial Optimization
37 Discrete Mathematics
32 Discrete Optimization
31 Artificial Intelligence
19 Journal of Combinatorial Theory. Series B
19 SIAM Journal on Computing
15 Annals of Mathematics and Artificial Intelligence
14 European Journal of Combinatorics
14 European Journal of Operational Research
13 Operations Research Letters
11 Annals of Pure and Applied Logic
10 Journal of Graph Algorithms and Applications
9 Networks
9 Mathematical Programming. Series A. Series B
9 Algorithms
8 Computational Geometry
8 Journal of Scheduling
8 Computer Science Review
7 Annals of Operations Research
6 Discrete & Computational Geometry
6 Computers & Operations Research
6 International Journal of Foundations of Computer Science
6 ACM Transactions on Computation Theory
5 Acta Informatica
5 Mathematical Social Sciences
5 International Journal of Computer Mathematics
5 The Electronic Journal of Combinatorics
5 Discrete Mathematics, Algorithms and Applications
4 Mathematics of Computation
4 Combinatorica
4 Graphs and Combinatorics
4 Journal of Automated Reasoning
4 Applicable Algebra in Engineering, Communication and Computing
4 The Journal of Artificial Intelligence Research (JAIR)
4 Discussiones Mathematicae. Graph Theory
4 Constraints
4 Logical Methods in Computer Science
4 Prikladnaya Diskretnaya Matematika
3 Applied Mathematics and Computation
3 Journal of Graph Theory
3 Journal of Mathematical Psychology
3 The Journal of Symbolic Logic
3 International Journal of Approximate Reasoning
3 Computational Complexity
3 RAIRO. Theoretical Informatics and Applications
3 ACM Transactions on Computational Logic
3 RAIRO. Theoretical Informatics and Applications
2 Computers & Mathematics with Applications
2 Journal of Mathematical Biology
2 Information Sciences
2 Operations Research
2 Social Choice and Welfare
2 Journal of Computer Science and Technology
2 International Journal of Computational Geometry & Applications
2 MSCS. Mathematical Structures in Computer Science
2 Designs, Codes and Cryptography
2 The Australasian Journal of Combinatorics
2 Formal Methods in System Design
2 Combinatorics, Probability and Computing
2 Mathematical Logic Quarterly (MLQ)
2 Journal of the ACM
2 Annals of Combinatorics
2 Data Mining and Knowledge Discovery
2 RAIRO. Operations Research
2 Trudy Instituta Matematiki
2 ACM Journal of Experimental Algorithmics
1 Communications in Mathematical Physics
1 Computer Methods in Applied Mechanics and Engineering
1 International Journal of Systems Science
1 Israel Journal of Mathematics
1 Journal of the Franklin Institute
1 Journal of Mathematical Physics
1 Mathematical Biosciences
1 Physics Reports
1 Bulletin of Mathematical Biology
1 Chaos, Solitons and Fractals
1 ACM Transactions on Mathematical Software
1 Advances in Mathematics
1 Computing
1 Fuzzy Sets and Systems
1 Journal of Combinatorial Theory. Series A
1 Journal of Computational and Applied Mathematics
1 Journal of Optimization Theory and Applications
1 Kyungpook Mathematical Journal
1 Mathematica Slovaca
1 Mathematical Systems Theory
1 Quaestiones Mathematicae
1 Semigroup Forum
1 Transactions of the American Mathematical Society
1 Moscow University Computational Mathematics and Cybernetics
1 Advances in Applied Mathematics
...and 42 more Serials

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.