×
Compute Distance To:
Author ID: fomin.fedor-v Recent zbMATH articles by "Fomin, Fedor V."
Published as: Fomin, Fedor V.; Fomin, F. V.; Fomin, Fedor
Homepage: http://www.ii.uib.no/~fomin/fedor/
External Links: MGP · dblp
Documents Indexed: 340 Publications since 1990, including 3 Books
14 Contributions as Editor
Reviewing Activity: 61 Reviews
Co-Authors: 164 Co-Authors with 343 Joint Publications
4,757 Co-Co-Authors
all top 5

Co-Authors

10 single-authored
112 Saurabh, Saket
91 Golovach, Petr A.
84 Lokshtanov, Daniel
56 Thilikos, Dimitrios M.
31 Kratsch, Dieter
29 Villanger, Yngve
25 Pilipczuk, Michał
24 Panolan, Fahad
20 Zehavi, Meirav
18 Bodlaender, Hans L.
15 Gaspers, Serge
14 Broersma, Hajo J.
13 Dorn, Frederic
13 Grandoni, Fabrizio
11 Woeginger, Gerhard Johannes
10 Heggernes, Pinar
10 Todinca, Ioan
8 Bliznets, Ivan A.
8 Kratochvíl, Jan
8 Philip, Geevarghese
8 Pilipczuk, Marcin L.
7 Kulikov, Alexander S.
7 Liedloff, Mathieu
7 Pyatkin, Artëm Valer’evich
7 Ramanujan, M. S.
7 Van Leeuwen, Erik Jan
6 Demaine, Erik D.
6 Fellows, Michael Ralph
6 Fraigniaud, Pierre
6 Hajiaghayi, Mohammad Taghi
6 Nisse, Nicolas
6 Raman, Venkatesh
5 Cygan, Marek
5 Fernau, Henning
5 Gutin, Gregory Z.
5 Petrov, Nikolai Nikolaevich
5 Rosamond, Frances A.
5 Stepanov, Alexey A.
5 Thomassé, Stéphan
4 Adler, Isolde
4 Amini, Omid
4 Chitnis, Rajesh Hemant
4 Curticapean, Radu
4 Dell, Holger
4 Dragan, Feodor F.
4 Drange, Pål Grønås
4 Karpov, Nikolay
4 Kolay, Sudeshna
4 Matamala, Martín
4 Mihajlin, Ivan
4 Misra, Neeldhara
4 Misra, Pranabendu
4 Paulusma, Daniël
4 Penninkx, Eelko
4 Rapaport, Ivan
4 Sau, Ignasi
4 Telle, Jan Arne
3 Alon, Noga M.
3 Chen, Jian-er
3 Giannopoulou, Archontia C.
3 Golovnev, Alexander
3 Kaski, Petteri
3 Koster, Arie M. C. A.
3 Kratsch, Stefan
3 Krivelevich, Michael
3 Kwiatkowska, Marta Z.
3 Marx, Dániel
3 Müller, Haiko
3 Peleg, David
3 Strømme, Torstein J. F.
3 Szeider, Stefan
2 Agrawal, Akanksha
2 Ashok, Pradeesha
2 Basavaraju, Manu
2 Belmonte, Rémy
2 Bessy, Stéphane
2 Bezáková, Ivona
2 Chaplick, Steven
2 Cohen, Nathann
2 Fiala, Jiří
2 Fishkin, Aleksei V.
2 Freivalds, Rūsiņš Mārtiņš
2 Goldberg, Leslie Ann
2 Jansen, Bart M. P.
2 Knop, Dušan
2 Kreutzer, Stephan
2 Lapinskas, John
2 Lingas, Andrzej
2 Liu, Yang
2 Losievskaja, Elena
2 Lu, Songjian
2 Mancini, Federico
2 Mazoit, Frédéric
2 Meesum, Syed Mohammad
2 Mihai, Rodica
2 Mihalák, Matúš
2 Montealegre, Pedro
2 Mouawad, Amer E.
2 Nederlof, Jesper
2 Nešetřil, Jaroslav
...and 65 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

286 Publications have been cited 3,632 times in 1,962 Documents Cited by Year
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
528
2015
Exact exponential algorithms. Zbl 1370.68002
Fomin, Fedor V.; Kratsch, Dieter
149
2010
An annotated bibliography on guaranteed graph searching. Zbl 1160.68007
Fomin, Fedor V.; Thilikos, Dimitrios M.
107
2008
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282
Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał
82
2016
Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs. Zbl 1326.05152
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammadtaghi; Thilikos, Dimitrios M.
81
2005
(Meta) kernelization. Zbl 1292.68089
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
72
2009
Bidimensionality and kernels. Zbl 1288.68116
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
69
2010
A measure & conquer approach for the analysis of exact algorithms. Zbl 1325.68311
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
67
2009
Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
57
2019
Improved algorithms for feedback vertex set problems. Zbl 1152.68055
Chen, Jianer; Fomin, Fedor V.; Liu, Yang; Lu, Songjian; Villanger, Yngve
52
2008
Efficient computation of representative families with applications in parameterized and exact algorithms. Zbl 1410.05212
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
48
2016
Fixed-parameter algorithms for \((k, r)\)-center in planar graphs and map graphs. Zbl 1321.05256
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammadtaghi; Thilikos, Dimitrios M.
44
2005
On two techniques of combining branching and treewidth. Zbl 1185.68475
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
43
2009
On the minimum feedback vertex set problem: Exact and enumeration algorithms. Zbl 1170.68029
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.; Razgon, Igor
39
2008
Finding induced subgraphs via minimal triangulations. Zbl 1230.68108
Fomin, Fedor V.; Villanger, Yngve
37
2010
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
34
2011
Solving connected dominating set faster than \(2^n\). Zbl 1170.68030
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
34
2008
Dominating sets in planar graphs: branch-width and exponential speed-up. Zbl 1114.05072
Fomin, Fedor V.; Thilikos, Dimitrios M.
34
2006
Measure and conquer: Domination – a case study. Zbl 1082.68866
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
33
2005
Pursuing a fast robber on a graph. Zbl 1192.91027
Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Nisse, Nicolas; Suchan, Karol
32
2010
Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. Zbl 1445.05101
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
32
2008
Exact (exponential) algorithms for the dominating set problem. Zbl 1112.68420
Fomin, Fedor V.; Kratsch, Dieter; Woeginger, Gerhard J.
31
2004
Measure and conquer: a simple \(O(2^{0.288n})\) independent set algorithm. Zbl 1192.68960
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
30
2006
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.
30
2010
Exact algorithms for treewidth and minimum fill-in. Zbl 1163.05320
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve
30
2008
Intractability of clique-width parameterizations. Zbl 1207.68161
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
29
2010
Pathwidth of cubic graphs and exact algorithms. Zbl 1191.68826
Fomin, Fedor V.; Høie, Kjartan
27
2006
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
27
2015
Bidimensional parameters and local treewidth. Zbl 1069.05070
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M.
26
2004
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
26
2016
Subexponential parameterized algorithm for minimum fill-in. Zbl 1285.68055
Fomin, Fedor V.; Villanger, Yngve
24
2013
Kernelization and sparseness: the case of dominating set. Zbl 1388.68110
Drange, Pål Grønås; Dregi, Markus; Fomin, Fedor V.; Kreutzer, Stephan; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Reidl, Felix; Sánchez Villaamil, Fernando; Saurabh, Saket; Siebertz, Sebastian; Sikdar, Somnath
24
2016
\(\text{Kernel}(s)\) for problems with no kernel: on out-trees with many leaves. Zbl 1236.68087
Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve
23
2009
Contraction obstructions for treewidth. Zbl 1223.05022
Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M.
22
2011
Kernels for feedback arc set in tournaments. Zbl 1235.05134
Bessy, Stéphane; Fomin, Fedor V.; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomassé, Stéphan
22
2011
New upper bounds on the decomposability of planar graphs. Zbl 1085.05049
Fomin, Fedor V.; Thilikos, Dimitrios M.
22
2005
Algorithmic lower bounds for problems parameterized by clique-width. Zbl 1288.05269
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
22
2010
Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
22
2014
Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Zbl 1162.05354
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.
21
2005
Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem. Zbl 1210.05022
Cohen, Nathann; Fomin, Fedor V.; Gutin, Gregory; Kim, Eun Jung; Saurabh, Saket; Yeo, Anders
21
2010
Subexponential parameterized algorithms. Zbl 1302.68340
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M.
21
2008
Representative sets of product families. Zbl 1425.68448
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
21
2014
Some new techniques in design and analysis of exact (exponential) algorithms. Zbl 1169.68669
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
21
2005
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
20
2011
Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
20
2013
Catalan structures and dynamic programming in \(H\)-minor-free graphs. Zbl 1192.05155
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M.
20
2008
Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J.
19
2007
A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
19
2013
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
19
2016
Bidimensionality and EPTAS. Zbl 1377.68324
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
19
2011
Treewidth computation and extremal combinatorics. Zbl 1289.05447
Fomin, Fedor V.; Villanger, Yngve
18
2012
Connected graph searching. Zbl 1252.91026
Barrière, Lali; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos, Dimitrios M.
18
2012
Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090
Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket
18
2012
Kernel(s) for problems with no kernel, on out-trees with many leaves. Zbl 1295.68120
Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
18
2012
Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket
17
2014
Equitable colorings of bounded treewidth graphs. Zbl 1086.68096
Bodlaender, Hans L.; Fomin, Fedor V.
16
2005
A note on exact algorithms for vertex ordering problems on graphs. Zbl 1253.68164
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
16
2012
A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
16
2013
Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
16
2014
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
16
2012
Graph searching and interval completion. Zbl 0972.05047
Fomin, Fedor V.; Golovach, Petr A.
15
2000
On exact algorithms for treewidth. Zbl 1131.68481
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
15
2006
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
15
2014
Faster algorithms for finding and counting subgraphs. Zbl 1246.05149
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V.
15
2012
Approximation algorithms for time-dependent orienteering. Zbl 1043.90076
Fomin, Fedor V.; Lingas, Andrzej
14
2002
On exact algorithms for Treewidth. Zbl 1301.05328
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
14
2012
Dominating sets in planar graphs: Branch-width and exponential speed-up. Zbl 1094.68610
Fomin, Fedor V.; Thilikos, Dimitrios M.
13
2003
Fast subexponential algorithm for non-local problems on graphs of bounded genus. Zbl 1141.05338
Dorn, Frederic; Fomin, Fedor V.; Thilikos, Dimitrios M.
13
2006
Exact (exponential) algorithms for treewidth and minimum fill-in. Zbl 1099.68076
Fomin, Fedor V.; Kratsch, Dieter; Todinca, Ioan
13
2004
Spanning directed trees with many leaves. Zbl 1215.05027
Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket
13
2009
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
13
2016
Rank-width and tree-width of \(H\)-minor-free graphs. Zbl 1215.05171
Fomin, Fedor V.; Oum, Sang-il; Thilikos, Dimitrios M.
13
2010
On the monotonicity of games generated by symmetric submodular functions. Zbl 1069.91019
Fomin, Fedor V.; Thilikos, Dimitrios M.
12
2003
Exact algorithms for graph homomorphisms. Zbl 1119.68133
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter
12
2007
Graph searching, elimination trees, and a generalization of bandwidth. Zbl 1082.68082
Fomin, Fedor V.; Heggernes, Pinar; Telle, Jan Arne
12
2005
Tree decompositions with small cost. Zbl 1084.05057
Bodlaender, Hans L.; Fomin, Fedor V.
12
2005
Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
12
2014
Subexponential algorithms for partial cover problems. Zbl 1260.05159
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
12
2011
Contraction bidimensionality: the accurate picture. Zbl 1256.05202
Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M.
12
2009
Complexity of approximating the oriented diameter of chordal graphs. Zbl 1050.05114
Fomin, Fedor V.; Matamala, Martín; Rapaport, Ivan
11
2004
Optimal linear arrangement of interval graphs. Zbl 1132.68501
Cohen, Johanne; Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Kucherov, Gregory
11
2006
Approximating minimum cocolorings. Zbl 1042.68091
Fomin, Fedor V.; Kratsch, Dieter; Novelli, Jean-Christophe
11
2002
Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
11
2009
Vertex cover structural parameterization revisited. Zbl 1417.05206
Fomin, Fedor V.; Strømme, Torstein J. F.
11
2016
Approximation of pathwidth of outerplanar graphs. Zbl 1005.68113
Bodlaender, Hans L.; Fomin, Fedor V.
10
2002
Bounding the number of minimal dominating sets: A measure and conquer approach. Zbl 1175.05100
Fomin, Fedor V.; Grandoni, Fabrizio; Pyatkin, Artem V.; Stepanov, Alexey A.
10
2005
Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. Zbl 1099.68077
Fomin, Fedor V.; Thilikos, Dimitrios M.
10
2004
Finding a minimum feedback vertex set in time \(\mathcal{O} (1.7548^n)\). Zbl 1154.05327
Fomin, Fedor V.; Gaspers, Serge; Pyatkin, Artem V.
10
2006
Pursuit-evasion and search problems on graphs. Zbl 0897.05079
Fomin, F. V.; Petrov, N. N.
10
1996
Parameterized algorithms to preserve connectivity. Zbl 1412.68078
Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
10
2014
Iterative compression and exact algorithms. Zbl 1186.68187
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
10
2010
More about subcolorings. Zbl 1239.05060
Broersma, Hajo; Fomin, Fedor V.; Nešetřil, Jaroslav; Woeginger, Gerhard J.
10
2002
AT-free graphs: Linear bounds for the oriented diameter. Zbl 1046.05025
Fomin, Fedor V.; Matamala, Martín; Prisner, Erich; Rapaport, Ivan
9
2004
Faster Steiner tree computation in polynomial-space. Zbl 1158.68429
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter
9
2008
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Zbl 1095.68075
Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J.
9
2006
A simple and fast approach for solving problems on planar graphs. Zbl 1122.68480
Fomin, Fedor V.; Thilikos, Dimtirios M.
9
2004
On the parameterized complexity of cutting a few vertices from a graph. Zbl 1398.68231
Fomin, Fedor V.; Golovach, Petr A.; Korhonen, Janne H.
9
2013
Counting subgraphs via homomorphisms. Zbl 1248.05122
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket
9
2012
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Zbl 1395.68359
Fomin, Fedor V.; Pilipczuk, Michał
9
2013
Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs. Zbl 1318.05076
Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M.
9
2004
Parameterized complexity of elimination distance to first-order logic properties. Zbl 07516330
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M.
1
2022
Parameterized \(k\)-clustering: tractability island. Zbl 1477.68132
Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill
1
2021
Subexponential parameterized algorithms and kernelization on almost chordal graphs. Zbl 1467.05254
Fomin, Fedor V.; Golovach, Petr A.
1
2021
On the tractability of optimization problems on \(H\)-graphs. Zbl 1447.05142
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent
7
2020
Path contraction faster than \(2^n\). Zbl 1455.68132
Agrawal, Akanksha; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar
3
2020
Approximation schemes for low-rank binary matrix approximation problems. Zbl 1454.68180
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
2
2020
On the parameterized complexity of graph modification to first-order logic properties. Zbl 1434.68208
Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M.
1
2020
On the parameterized complexity of \([1,j]\)-domination problems. Zbl 1436.68147
Meybodi, Mohsen Alambardar; Fomin, Fedor V.; Mouawad, Amer E.; Panolan, Fahad
1
2020
Parameterized low-rank binary matrix approximation. Zbl 1458.68075
Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad
1
2020
Hitting topological minors is FPT. Zbl 07298330
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2020
Subgraph complementation. Zbl 1439.05212
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M.
1
2020
Approximation schemes via width/weight trade-offs on minor-free graphs. Zbl 07304165
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
1
2020
Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
57
2019
Clique-width. III: Hamiltonian cycle and the odd case of graph coloring. Zbl 1458.05245
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
5
2019
Exact algorithms via monotone local search. Zbl 1427.68119
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
4
2019
Subquadratic kernels for implicit 3-{Hitting Set} and 3-{Set Packing} problems. Zbl 1454.68101
Fomin, Fedor V.; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
3
2019
On width measures and topological problems on semi-complete digraphs. Zbl 1415.05063
Fomin, Fedor V.; Pilipczuk, Michał
3
2019
Finding detours is fixed-parameter tractable. Zbl 1428.05161
BezáKová, Ivona; Curticapean, Radu; Dell, Holger; Fomin, Fedor V.
2
2019
A fixed-parameter perspective on #BIS. Zbl 1430.68185
Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John
1
2019
Finding, hitting and packing cycles in subexponential time on unit disk graphs. Zbl 1441.68178
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2019
Kernelization of graph Hamiltonicity: proper \(H\)-graphs. Zbl 1476.68197
Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter
1
2019
Parameterized single-exponential time polynomial space algorithm for Steiner tree. Zbl 1404.05208
Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
1
2019
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1457.05110
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Pilipczuk, Michał; Wrochna, Marcin
6
2018
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1390.68344
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
5
2018
Long directed \((s,t)\)-path: FPT algorithm. Zbl 1478.68233
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
4
2018
Kernels for (connected) dominating set on graphs with excluded topological minors. Zbl 1455.68072
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
3
2018
Exact algorithms for terrain guarding. Zbl 1454.68153
Ashok, Pradeesha; Fomin, Fedor V.; Kolay, Sudeshna; Saurabh, Saket; Zehavi, Meirav
2
2018
Subexponential parameterized algorithm for {Interval Completion}. Zbl 1454.68094
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał
2
2018
On the tractability of optimization problems on \(H\)-graphs. Zbl 07378700
Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent
2
2018
On the optimality of pseudo-polynomial algorithms for integer programming. Zbl 07378701
Fomin, Fedor V.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
2
2018
Matrix rigidity from the viewpoint of parameterized complexity. Zbl 1394.68177
Fomin, Fedor V.; Lokshtanov, Daniel; Meesum, S. M.; Saurabh, Saket; Zehavi, Meirav
1
2018
Covering vectors by spaces: regular matroids. Zbl 1400.05045
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
1
2018
Metric dimension of bounded tree-length graphs. Zbl 1371.68103
Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S.
8
2017
Faster exact algorithms for some terminal set problems. Zbl 1371.05283
Chitnis, Rajesh; Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
5
2017
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Zbl 1410.05201
Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket; Wrochna, Marcin
5
2017
Parameterized complexity of secluded connectivity problems. Zbl 1378.68075
Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S.
4
2017
Tight lower bounds on graph embedding problems. Zbl 1426.68099
Cygan, Marek; Fomin, Fedor V.; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan; Pachocki, Jakub; Socała, Arkadiusz
4
2017
Representative families of product families. Zbl 1445.68330
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
3
2017
Spanning circuits in regular matroids. Zbl 1410.68164
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
2
2017
Finding detours is fixed-parameter tractable. Zbl 1441.68104
Bezáková, Ivona; Curticapean, Radu; Dell, Holger; Fomin, Fedor V.
1
2017
Covering vectors by spaces: regular matroids. Zbl 1441.68106
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
1
2017
Finding, hitting and packing cycles in subexponential time on unit disk graphs. Zbl 1441.68179
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2017
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282
Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał
82
2016
Efficient computation of representative families with applications in parameterized and exact algorithms. Zbl 1410.05212
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
48
2016
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
26
2016
Kernelization and sparseness: the case of dominating set. Zbl 1388.68110
Drange, Pål Grønås; Dregi, Markus; Fomin, Fedor V.; Kreutzer, Stephan; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Reidl, Felix; Sánchez Villaamil, Fernando; Saurabh, Saket; Siebertz, Sebastian; Sikdar, Somnath
24
2016
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
19
2016
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
13
2016
Vertex cover structural parameterization revisited. Zbl 1417.05206
Fomin, Fedor V.; Strømme, Torstein J. F.
11
2016
Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Zbl 1387.68180
Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
7
2016
Subexponential parameterized algorithm for interval completion. Zbl 1410.68282
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał
5
2016
Tight bounds for graph homomorphism and subgraph isomorphism. Zbl 1409.68209
Cygan, Marek; Fomin, Fedor V.; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan; Pachocki, Jakub; Socała, Arkadiusz
5
2016
How to hunt an invisible rabbit on a graph. Zbl 1327.05233
Abramovskaya, Tatjana V.; Fomin, Fedor V.; Golovach, Petr A.; Pilipczuk, Michał
4
2016
The firefighter problem on graph classes. Zbl 1333.05290
Fomin, Fedor V.; Heggernes, Pinar; van Leeuwen, Erik Jan
4
2016
Editing to connected \(f\)-degree graph. Zbl 1388.68229
Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket
4
2016
Parameterized complexity of the anchored \(k\)-core problem for directed graphs. Zbl 1336.68119
Chitnis, Rajesh; Fomin, Fedor V.; Golovach, Petr A.
3
2016
Largest chordal and interval subgraphs faster than \(2^n\). Zbl 1347.05236
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
2
2016
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
528
2015
Large induced subgraphs via triangulations and CMSO. Zbl 1357.05144
Fomin, Fedor V.; Todinca, Ioan; Villanger, Yngve
27
2015
Exploring the subexponential complexity of completion problems. Zbl 1347.68180
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2015
A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68102
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał
8
2015
Metric dimension of bounded width graphs. Zbl 1466.68054
Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S.
6
2015
Parameterized single-exponential time polynomial space algorithm for Steiner tree. Zbl 1433.05299
Fomin, Fedor V.; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
4
2015
Computing tree-depth faster than \(2^n\). Zbl 1337.68129
Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał
3
2015
On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Zbl 1315.68150
Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket
3
2015
Minimum fill-in of sparse graphs: kernelization and approximation. Zbl 1310.68106
Fomin, Fedor V.; Philip, Geevarghese; Villanger, Yngve
3
2015
Solving \(d\)-SAT via backdoors to small treewidth. Zbl 1372.68122
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Ramanujan, M. S.; Saurabh, Saket
3
2015
Parameterized complexity of secluded connectivity problems. Zbl 1366.68091
Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S.
1
2015
Tight bounds for parameterized complexity of cluster editing with a small number of clusters. Zbl 1311.68076
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
22
2014
Representative sets of product families. Zbl 1425.68448
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
21
2014
Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket
17
2014
Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
16
2014
Enumerating minimal subset feedback vertex sets. Zbl 1303.05189
Fomin, Fedor V.; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve
15
2014
Preprocessing subgraph and minor problems: when does a small vertex cover help? Zbl 1277.68095
Fomin, Fedor V.; Jansen, Bart M. P.; Pilipczuk, Michał
12
2014
Parameterized algorithms to preserve connectivity. Zbl 1412.68078
Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
10
2014
To satisfy impatient web surfers is hard. Zbl 1282.68082
Fomin, Fedor V.; Giroire, Frédéric; Jean-Marie, Alain; Mazauric, Dorian; Nisse, Nicolas
8
2014
Exploring subexponential parameterized complexity of completion problems. Zbl 1359.68126
Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
8
2014
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
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Zbl 1386.68068
Fomin, Fedor V.; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan
5
2014
A subexponential parameterized algorithm for proper interval completion. Zbl 1330.68101
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Marcin; Pilipczuk, Michał
4
2014
Parameterized complexity of connected even/odd subgraph problems. Zbl 1311.68075
Fomin, Fedor V.; Golovach, Petr A.
2
2014
Long circuits and large Euler subgraphs. Zbl 1298.05300
Fomin, Fedor V.; Golovach, Petr A.
1
2014
Subexponential parameterized algorithm for minimum fill-in. Zbl 1285.68055
Fomin, Fedor V.; Villanger, Yngve
24
2013
Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
20
2013
A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
19
2013
A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
16
2013
On the parameterized complexity of cutting a few vertices from a graph. Zbl 1398.68231
Fomin, Fedor V.; Golovach, Petr A.; Korhonen, Janne H.
9
2013
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Zbl 1395.68359
Fomin, Fedor V.; Pilipczuk, Michał
9
2013
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. Zbl 1354.68120
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
8
2013
Computing optimal Steiner trees in polynomial space. Zbl 1269.05049
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket
6
2013
Tight bounds for parameterized complexity of cluster editing. Zbl 1354.68119
Fomin, Fedor V.; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michał; Villanger, Yngve
5
2013
Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. Zbl 1276.05091
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
4
2013
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1433.68290
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
4
2013
Distortion is fixed parameter tractable. Zbl 1322.68102
Fellows, Michael; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances; Saurabh, Saket
4
2013
Exact algorithms for finding longest cycles in claw-free graphs. Zbl 1259.05162
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël
4
2013
Largest chordal and interval subgraphs faster than \(2^{n }\). Zbl 1394.68164
Bliznets, Ivan; Fomin, Fedor V.; Pilipczuk, Michał; Villanger, Yngve
3
2013
Computing tree-depth faster than \(2^{n }\). Zbl 1406.68039
Fomin, Fedor V.; Giannopoulou, Archontia C.; Pilipczuk, Michał
2
2013
Long circuits and large Euler subgraphs. Zbl 1395.68149
Fomin, Fedor V.; Golovach, Petr A.
2
2013
Parameterized complexity of the anchored \(k\)-core problem for directed graphs. Zbl 1359.68124
Chitnis, Rajesh; Fomin, Fedor V.; Golovach, Petr A.
2
2013
Jungles, bundles, and fixed-parameter tractability. Zbl 1421.68221
Fomin, Fedor V.; Pilipczuk, Michal
2
2013
...and 186 more Documents
all top 5

Cited by 2,097 Authors

129 Saurabh, Saket
117 Fomin, Fedor V.
83 Golovach, Petr A.
70 Lokshtanov, Daniel
66 Thilikos, Dimitrios M.
49 Kratsch, Dieter
48 Sau, Ignasi
47 Zehavi, Meirav
44 Pilipczuk, Marcin L.
41 Paulusma, Daniël
40 Niedermeier, Rolf
40 Pilipczuk, Michał
38 Raman, Venkatesh
35 Bodlaender, Hans L.
35 Heggernes, Pinar
34 Liedloff, Mathieu
34 Panolan, Fahad
32 Komusiewicz, Christian
31 Kratsch, Stefan
30 Fernau, Henning
30 Gutin, Gregory Z.
30 Jansen, Bart M. P.
30 Xiao, Mingyu
29 Nisse, Nicolas
25 Ganian, Robert
24 Cygan, Marek
24 Paschos, Vangelis Th.
24 Ramanujan, M. S.
24 Villanger, Yngve
23 Agrawal, Akanksha
22 Misra, Neeldhara
22 Otachi, Yota
22 Paul, Christophe
22 Van Leeuwen, Erik Jan
21 Chen, Jian-er
21 van Bevern, René
20 Eiben, Eduard
20 Gaspers, Serge
20 Kwon, Ojoung
20 Marx, Dániel
20 Wang, Jianxin
19 Ordyniak, Sebastian
19 Philip, Geevarghese
19 Sorge, Manuel
17 Dereniowski, Dariusz
17 Knop, Dušan
17 Lampis, Michael
17 Rossmanith, Peter
17 Suchý, Ondřej
16 Hanaka, Tesshu
16 Mnich, Matthias
16 Ono, Hirotaka
16 van ’t Hof, Pim
16 Wahlström, Magnus
15 Fellows, Michael Ralph
15 Rzążewski, Paweł
15 Tale, Prafullkumar
14 Baste, Julien
14 Feng, Qilong
14 Kowalik, Łukasz
14 Kratochvíl, Jan
14 Molter, Hendrik
14 Nagamochi, Hiroshi
14 Nichterlein, André
14 Szeider, Stefan
14 Telle, Jan Arne
13 Hermelin, Danny
13 Kobayashi, Yasuaki
13 Kolay, Sudeshna
13 Reidl, Felix
13 Todinca, Ioan
13 Yeo, Anders
12 Lima, Paloma T.
12 Masařík, Tomáš
12 Misra, Pranabendu
12 Papadopoulos, Charis
12 Yang, Boting
11 Couturier, Jean-Francois
11 Della Croce, Federico
11 Escoffier, Bruno
11 Kanj, Iyad A.
11 Kobayashi, Yusuke
11 Krithika, R.
11 Lê Văn Băng
11 Nederlof, Jesper
11 Raymond, Jean-Florent
11 Wood, David Ronald
10 Belmonte, Rémy
10 Björklund, Andreas
10 Bonnet, Edouard
10 Bredereck, Robert
10 Broersma, Hajo J.
10 Cao, Yixin
10 Guo, Jiong
10 Gupta, Sushmita
10 Kanté, Mamadou Moustapha
10 Kawarabayashi, Ken-ichi
10 Kreutzer, Stephan
10 Li, Wenjun
10 Mertzios, George B.
...and 1,997 more Authors
all top 5

Cited in 129 Serials

296 Theoretical Computer Science
227 Algorithmica
184 Discrete Applied Mathematics
97 Journal of Computer and System Sciences
70 SIAM Journal on Discrete Mathematics
67 Information Processing Letters
56 Theory of Computing Systems
43 Journal of Combinatorial Optimization
36 Discrete Mathematics
29 Information and Computation
21 Journal of Discrete Algorithms
19 European Journal of Combinatorics
17 Artificial Intelligence
17 SIAM Journal on Computing
17 Discrete Optimization
15 Journal of Combinatorial Theory. Series B
15 European Journal of Operational Research
14 Journal of Graph Theory
13 Computers & Operations Research
13 The Electronic Journal of Combinatorics
10 Journal of Graph Algorithms and Applications
9 Annals of Operations Research
8 Discussiones Mathematicae. Graph Theory
7 Journal of Scheduling
6 Operations Research Letters
6 Graphs and Combinatorics
6 Computational Geometry
6 Algorithms
6 Computer Science Review
5 Information Sciences
5 RAIRO. Operations Research
5 Discrete Mathematics, Algorithms and Applications
4 Distributed Computing
4 The Journal of Artificial Intelligence Research (JAIR)
4 Annals of Mathematics and Artificial Intelligence
4 INFORMS Journal on Computing
4 Quantum Information Processing
4 ACM Journal of Experimental Algorithmics
4 Optimization Letters
3 Applied Mathematics and Computation
3 Networks
3 Operations Research
3 Combinatorica
3 Acta Mathematicae Applicatae Sinica. English Series
3 Discrete & Computational Geometry
3 International Journal of Foundations of Computer Science
3 Journal of Global Optimization
3 Vestnik St. Petersburg University. Mathematics
3 Combinatorics, Probability and Computing
3 Logical Methods in Computer Science
3 ACM Transactions on Computation Theory
3 Prikladnaya Diskretnaya Matematika
2 Acta Informatica
2 SIAM Journal on Control and Optimization
2 Mathematical Social Sciences
2 Bulletin of the Korean Mathematical Society
2 Journal of Automated Reasoning
2 International Journal of Approximate Reasoning
2 Random Structures & Algorithms
2 International Journal of Computer Mathematics
2 Computational Optimization and Applications
2 Journal of Heuristics
2 Annals of Combinatorics
2 Fundamenta Informaticae
2 SN Operations Research Forum
1 ACM Computing Surveys
1 American Mathematical Monthly
1 Computer Methods in Applied Mechanics and Engineering
1 Israel Journal of Mathematics
1 Journal of Mathematical Biology
1 Physica A
1 Rocky Mountain Journal of Mathematics
1 Computing
1 International Journal of Mathematics and Mathematical Sciences
1 International Journal of Game Theory
1 Journal of the American Statistical Association
1 Journal of Combinatorial Theory. Series A
1 Moscow University Computational Mathematics and Cybernetics
1 Annals of Pure and Applied Logic
1 Social Choice and Welfare
1 Optimization
1 Journal of Computer Science and Technology
1 Applied Mathematics Letters
1 Mathematical and Computer Modelling
1 International Journal of Computational Geometry & Applications
1 Discrete Mathematics and Applications
1 Numerical Algorithms
1 Aequationes Mathematicae
1 Automation and Remote Control
1 Communications in Statistics. Theory and Methods
1 Historia Mathematica
1 Mathematical Programming. Series A. Series B
1 Cybernetics and Systems Analysis
1 Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI
1 Computational Complexity
1 Archives of Control Sciences
1 Journal of Mathematical Sciences (New York)
1 Constraints
1 Mathematical Problems in Engineering
1 Vietnam Journal of Mathematics
...and 29 more Serials

Citations by Year