×

zbMATH — the first resource for mathematics

Saurabh, Saket

Compute Distance To:
Author ID: saurabh.saket Recent zbMATH articles by "Saurabh, Saket"
Published as: Saurabh, Saket; Saurabh
Homepage: http://www.imsc.res.in/~saket/
External Links: MGP · ResearchGate · dblp
Documents Indexed: 348 Publications since 2002, including 6 Books
all top 5

Co-Authors

0 single-authored
156 Lokshtanov, Daniel
102 Fomin, Fedor V.
68 Raman, Venkatesh
56 Zehavi, Meirav
53 Panolan, Fahad
39 Ramanujan, M. S.
28 Misra, Pranabendu
27 Misra, Neeldhara
26 Philip, Geevarghese
25 Agrawal, Akanksha
21 Golovach, Petr A.
19 Kolay, Sudeshna
15 Gaspers, Serge
14 Pilipczuk, Michał
13 Sikdar, Somnath
12 Rai, Ashutosh
11 Gupta, Sushmita
10 Gutin, Gregory Z.
10 Pilipczuk, Marcin
10 Tale, Prafullkumar
10 Thilikos, Dimitrios M.
9 Cygan, Marek
9 Sharma, Roohani
9 Suchý, Ondřej
8 Amini, Omid
8 Fellows, Michael Ralph
8 Kratsch, Dieter
8 Meesum, Syed Mohammad
8 Mouawad, Amer E.
8 Rosamond, Frances A.
8 Thomassé, Stéphan
7 Ashok, Pradeesha
7 Basavaraju, Manu
7 Marx, Dániel
7 Mnich, Matthias
7 Roy, Sanjukta
6 Banik, Aritra
6 Crowston, Robert
6 Mishra, Sounaka
6 Sau, Ignasi
6 Villanger, Yngve
5 Fernau, Henning
5 Giannopoulou, Archontia C.
5 Kanesh, Lawqueen
5 Krithika, R.
5 Majumdar, Diptapriyo
5 Sahu, Abhishek
5 Subramanian, C. R.
5 Yeo, Anders
4 Alon, Noga M.
4 Bang-Jensen, Jørgen
4 Choudhary, Pratibha
4 Grandoni, Fabrizio
4 Heggernes, Pinar
4 Jansen, Bart M. P.
4 Madathil, Jayakrishnan
4 Paul, Christophe
4 Sahlot, Vibha
4 Szeider, Stefan
3 Banerjee, Niranka
3 Bessy, Stéphane
3 Chitnis, Rajesh Hemant
3 Dom, Michael
3 Krivelevich, Michael
2 Adler, Isolde
2 Biswas, Arindam
2 Bliznets, Ivan A.
2 Bodlaender, Hans L.
2 Cohen, Nathann
2 Dorn, Frederic
2 Francis, Mathew C.
2 Goyal, Prachi
2 Jain, Pallavi
2 Joret, Gwenaël
2 Karpov, Nikolay
2 Kaski, Petteri
2 Kolliopoulos, Stavros G.
2 Krause, Philipp Klaus
2 Kulikov, Alexander S.
2 Kumar, Mrinal
2 Le, Tien-Nam
2 Liedloff, Mathieu
2 Losievskaja, Elena
2 Meister, Daniel
2 Narayanaswamy, N. S.
2 Ordyniak, Sebastian
2 Peleg, David
2 Penninkx, Eelko
2 Pérennes, Stéphane
2 Perez, Anthony
2 Rajan, Varun
2 Safina Devi, N.
2 Stepanov, Alexey A.
2 Thomassen, Carsten
2 Wahlström, Magnus
2 Wrochna, Marcin
1 Adiga, Abhijin
1 Adil, Deeksha
1 Agarwal, Akanksha
1 Akshay, S.
...and 47 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

248 Publications have been cited 2,266 times in 1,136 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
314
2015
Lower bounds based on the exponential time hypothesis. Zbl 1258.68068
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
81
2011
Incompressibility through colors and IDs. Zbl 1248.68243
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket
75
2009
(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.
62
2010
On two techniques of combining branching and treewidth. Zbl 1185.68475
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A.
40
2009
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
39
2011
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
39
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
32
2016
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
32
2014
Parameterized algorithms for feedback set problems and their duals in tournaments. Zbl 1086.68105
Raman, Venkatesh; Saurabh, Saket
32
2006
Slightly superexponential parameterized problems. Zbl 1373.68273
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
28
2011
Fast FAST. Zbl 1248.68547
Alon, Noga; Lokshtanov, Daniel; Saurabh, Saket
28
2009
Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
28
2019
Kernelization – preprocessing with a guarantee. Zbl 1358.68141
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
27
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
26
2011
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles. Zbl 1170.68019
Raman, Venkatesh; Saurabh, Saket
24
2008
Capacitated domination and covering: A parameterized perspective. Zbl 1142.68371
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
22
2008
Kernelization lower bounds through colors and IDs. Zbl 1398.68226
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket
22
2014
On problems as hard as CNF-SAT. Zbl 1442.68064
Cygan, Marek; Dell, Holger; Lokshtanov, Daniel; Marx, Dániel; Nederlof, Jesper; Okamoto, Yoshio; Paturi, Ramamohan; Saurabh, Saket; Wahlström, Magnus
22
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
22
2009
Intractability of clique-width parameterizations. Zbl 1207.68161
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
21
2010
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
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
20
2011
Minimum bisection is fixed parameter tractable. Zbl 1315.05134
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
20
2014
Faster fixed parameter tractable algorithms for finding feedback vertex sets. Zbl 1321.05275
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R.
20
2006
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
19
2010
Representative sets of product families. Zbl 1425.68448
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
19
2014
Algorithmic lower bounds for problems parameterized by clique-width. Zbl 1288.05269
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
19
2010
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
19
2011
Efficient exact algorithms through enumerating maximal independent sets and other techniques. Zbl 1148.68054
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
18
2007
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
18
2016
The complexity of König subgraph problems and above-guarantee vertex cover. Zbl 1243.05203
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
16
2011
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
16
2012
Bidimensionality and EPTAS. Zbl 1377.68324
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
15
2011
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
15
2016
Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090
Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket
15
2012
A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
15
2013
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
14
2016
Local search: is brute-force avoidable? Zbl 1244.68070
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve
14
2012
A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160
Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve
14
2013
On parameterized independent feedback vertex set. Zbl 1253.68181
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket
14
2012
Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket
14
2014
Spanning directed trees with many leaves. Zbl 1215.05027
Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket
13
2009
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Zbl 1358.05284
Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
13
2017
FPT algorithms for connected feedback vertex set. Zbl 1258.05060
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
13
2012
Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. Zbl 1261.05066
Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket
13
2012
Lossy kernelization. Zbl 1370.68136
Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
12
2017
Lower bounds on kernelization. Zbl 1248.90078
Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket
12
2011
Subexponential algorithms for partial cover problems. Zbl 1260.05159
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
11
2011
Faster fixed parameter tractable algorithms for undirected feedback vertex set. Zbl 1019.68082
Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R.
11
2002
Tight bounds for linkages in planar graphs. Zbl 1333.05280
Adler, Isolde; Kolliopoulos, Stavros G.; Krause, Philipp Klaus; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios
11
2011
On the hardness of losing width. Zbl 1290.68045
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
11
2014
Faster algorithms for finding and counting subgraphs. Zbl 1246.05149
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V.
10
2012
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
10
2016
LP can be a cure for parameterized problems. Zbl 1245.68111
Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
10
2012
Parameterized study of the test cover problem. Zbl 1365.68275
Crowston, Robert; Gutin, Gregory; Jones, Mark; Saurabh, Saket; Yeo, Anders
10
2012
Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215
Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
10
2011
Simpler parameterized algorithm for OCT. Zbl 1267.05268
Lokshtanov, Daniel; Saurabh, Saket; Sikdar, Somnath
9
2009
Iterative compression and exact algorithms. Zbl 1186.68187
Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket
9
2010
Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629
Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket
9
2009
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
9
2018
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68114
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
9
2013
Paths, flowers and vertex cover. Zbl 1346.05287
Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
9
2011
Linear kernel for planar Connected Dominating Set. Zbl 1241.68130
Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
8
2009
Counting subgraphs via homomorphisms. Zbl 1247.05107
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket
8
2009
A linear kernel for a planar connected dominating set. Zbl 1216.68131
Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
8
2011
Reconfiguration on sparse graphs. Zbl 1451.68134
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
8
2015
Counting subgraphs via homomorphisms. Zbl 1248.05122
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket
8
2012
The parameterized complexity of unique coverage and its variants. Zbl 1290.68059
Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
8
2013
On the hardness of eliminating small induced subgraphs by contracting edges. Zbl 1406.68034
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
8
2013
Kernels for structural parameterizations of vertex cover – case of small degree modulators. Zbl 1378.68089
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
7
2015
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. Zbl 1183.05084
Raman, Venkatesh; Saurabh, Saket
7
2007
Improved exact exponential algorithms for vertex bipartization and other problems. Zbl 1171.68646
Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath
7
2005
Branching and treewidth based exact algorithms. Zbl 1135.68513
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket
7
2006
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
Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Zbl 1387.68180
Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
7
2016
Strengthening Erdős – Pósa property for minor-closed graph classes. Zbl 1216.05148
Fomin, Fedor V.; Saurabh, Saket; Thilikos, Dimitrios M.
7
2011
Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
7
2014
Improved algorithms and combinatorial bounds for independent feedback vertex set. Zbl 1398.68203
Agrawal, Akanksha; Gupta, Sushmita; Saurabh, Saket; Sharma, Roohani
7
2017
A near-optimal planarization algorithm. Zbl 1423.68341
Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
7
2014
Hitting and harvesting pumpkins. Zbl 1305.05221
Joret, Gwenaël; Paul, Christophe; Sau, Ignasi; Saurabh, Saket; Thomassé, Stéphan
6
2014
The complexity of finding subgraphs whose matching number equals the vertex cover number. Zbl 1193.05133
Mishra, Sounaka; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath; Subramanian, C. R.
6
2007
Parameterized complexity of the smallest degree-constrained subgraph problem. Zbl 1142.68450
Amini, Omid; Sau, Ignasi; Saurabh, Saket
6
2008
Deterministic truncation of linear matroids. Zbl 1440.68128
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
6
2018
Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
6
2015
Linear time parameterized algorithms for subset feedback vertex set. Zbl 1440.68138
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
6
2015
Subexponential parameterized odd cycle transversal on planar graphs. Zbl 1354.68129
Lokshtanov, Daniel; Saurabh, Saket; Wahlström, Magnus
6
2012
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.
6
2013
Parameterized algorithms to preserve connectivity. Zbl 1412.68078
Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
6
2014
Parameterized complexity of finding small degree-constrained subgraphs. Zbl 1242.68119
Amini, Omid; Sau, Ignasi; Saurabh, Saket
6
2012
Parameterized complexity of MaxSat above average. Zbl 1353.68116
Crowston, Robert; Gutin, Gregory; Jones, Mark; Raman, Venkatesh; Saurabh, Saket
6
2012
Computing optimal Steiner trees in polynomial space. Zbl 1269.05049
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket
6
2013
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1230.68104
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
6
2010
Implicit branching and parameterized partial cover problems. Zbl 1245.05124
Amini, Omid; Fomin, Fedor V.; Saurabh, Saket
5
2011
B-chromatic number: beyond NP-hardness. Zbl 1378.68090
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
5
2015
Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound. Zbl 1312.68105
Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket; Suchý, Ondřej
5
2014
Triangles, 4-cycles and parameterized (in-)tractability. Zbl 1142.68374
Raman, Venkatesh; Saurabh, Saket
5
2006
Distortion is fixed parameter tractable. Zbl 1248.68244
Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances A.; Saurabh, Saket
5
2009
A linear vertex kernel for Maximum Internal Spanning Tree. Zbl 1272.05197
Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan
5
2009
Approximation schemes for low-rank binary matrix approximation problems. Zbl 1454.68180
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
1
2020
Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
28
2019
Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1454.68088
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
4
2019
Popular matching in roommates setting is NP-hard. Zbl 1432.68163
Gupta, Sushmita; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
3
2019
Minimum bisection is fixed-parameter tractable. Zbl 1421.68069
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
2
2019
Exact algorithms via monotone local search. Zbl 1427.68119
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
1
2019
Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. Zbl 1431.68100
Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2019
Interval vertex deletion admits a polynomial kernel. Zbl 1432.68185
Agrawal, Akanksha; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
1
2019
The parameterized complexity landscape of finding 2-partitions of digraphs. Zbl 1434.68205
Bang-Jensen, J.; Knudsen, Kristine V. K.; Saurabh, Saket; Zehavi, Meirav
1
2019
Fully dynamic arboricity maintenance. Zbl 1441.68160
Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket
1
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
1
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
1
2019
Parameterized algorithms and kernels for rainbow matching. Zbl 1422.68188
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav
1
2019
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
9
2018
Deterministic truncation of linear matroids. Zbl 1440.68128
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
6
2018
Reconfiguration on sparse graphs. Zbl 1390.68351
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
4
2018
Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. Zbl 1403.68167
Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomassé, Stéphan; Zehavi, Meirav
4
2018
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
4
2018
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
3
2018
Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164
Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
3
2018
Linear time parameterized algorithms for Subset Feedback Vertex Set. Zbl 1440.68139
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
3
2018
Kernels for deletion to classes of acyclic digraphs. Zbl 1380.68207
Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
2
2018
Covering small independent sets and separators with applications to parameterized algorithms. Zbl 1403.68337
Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
2
2018
Parameterized algorithms for survivable network design with uniform demands. Zbl 1403.90559
Bang-Jensen, Jørgen; Basavaraju, Manu; Vitting Klinkby, Kristine; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav
2
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.
2
2018
Polynomial kernels for vertex cover parameterized by small degree modulators. Zbl 1419.05179
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
2
2018
A polynomial sized kernel for tracking paths problem. Zbl 1436.68143
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
1
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
On the kernelization complexity of string problems. Zbl 1390.68330
Basavaraju, Manu; Panolan, Fahad; Rai, Ashutosh; Ramanujan, M. S.; Saurabh, Saket
1
2018
Bivariate complexity analysis of Almost Forest Deletion. Zbl 1382.68122
Rai, Ashutosh; Saurabh, Saket
1
2018
When recursion is better than iteration: a linear-time algorithm for acyclicity with few error vertices. Zbl 1403.68170
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
1
2018
Parameterized algorithms for stable matching with ties and incomplete lists. Zbl 1392.68196
Adil, Deeksha; Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav
1
2018
Parameterised algorithms for deletion to classes of DAGs. Zbl 1430.68170
Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
1
2018
Max-Cut Above Spanning Tree is fixed-parameter tractable. Zbl 1434.68747
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav
1
2018
Excluded grid minors and efficient polynomial-time approximation schemes. Zbl 1426.68303
Fomin, Fedorr V.; Lokshtanov, Daniel; Saurabh, Saket
1
2018
Finding even subgraphs even faster. Zbl 1404.68050
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
1
2018
Below all subsets for minimal connected dominating set. Zbl 1396.05052
Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket
1
2018
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1384.05148
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
1
2018
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Zbl 1358.05284
Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
13
2017
Lossy kernelization. Zbl 1370.68136
Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
12
2017
Improved algorithms and combinatorial bounds for independent feedback vertex set. Zbl 1398.68203
Agrawal, Akanksha; Gupta, Sushmita; Saurabh, Saket; Sharma, Roohani
7
2017
Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1410.68270
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
4
2017
Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
4
2017
Irrelevant vertices for the planar disjoint paths problem. Zbl 1350.05068
Adler, Isolde; Kolliopoulos, Stavros G.; Krause, Philipp Klaus; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
3
2017
Parameterized and exact algorithms for class domination coloring. Zbl 1444.68147
Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar
3
2017
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68115
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
3
2017
Split contraction: the untold story. Zbl 1402.68136
Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
3
2017
Group activity selection on graphs: parameterized analysis. Zbl 1403.91068
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav
2
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
2
2017
Representative families of product families. Zbl 1445.68330
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
2
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
2
2017
On the parameterized complexity of b-chromatic number. Zbl 1353.68136
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
1
2017
Multivariate complexity analysis of geometric Red Blue Set Cover. Zbl 1380.68212
Ashok, Pradeesha; Kolay, Sudeshna; Saurabh, Saket
1
2017
Spanning circuits in regular matroids. Zbl 1410.68164
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
1
2017
Linear-time parameterized algorithms via skew-symmetric multicuts. Zbl 1422.68137
Ramanujan, M. S.; Saurabh, Saket
1
2017
Hitting selected (odd) cycles. Zbl 1368.05147
Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
1
2017
Parameterized complexity of geometric covering problems having conflicts. Zbl 1436.68144
Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket
1
2017
Quick but odd growth of cacti. Zbl 1372.68136
Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
1
2017
Linear representation of transversal matroids and gammoids parameterized by rank. Zbl 1433.68180
Misra, Pranabendu; Panolan, Fahad; Ramanujan, M. S.; 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
Packing cycles faster than Erdős-Pósa. Zbl 1441.05210
Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket; Zehavi, Meirav
1
2017
Efficient computation of representative families with applications in parameterized and exact algorithms. Zbl 1410.05212
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
32
2016
On problems as hard as CNF-SAT. Zbl 1442.68064
Cygan, Marek; Dell, Holger; Lokshtanov, Daniel; Marx, Dániel; Nederlof, Jesper; Okamoto, Yoshio; Paturi, Ramamohan; Saurabh, Saket; Wahlström, Magnus
22
2016
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
18
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
15
2016
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
14
2016
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
10
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
A faster FPT algorithm and a smaller kernel for Block Graph Vertex Deletion. Zbl 1417.68145
Agrawal, Akanksha; Kolay, Sudeshna; Lokshtanov, Daniel; Saurabh, Saket
5
2016
Partially polynomial kernels for set cover and test cover. Zbl 1344.68270
Basavaraju, Manu; Francis, Mathew C.; Ramanujan, M. S.; Saurabh, Saket
5
2016
Editing to connected \(f\)-degree graph. Zbl 1388.68229
Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket
3
2016
Parameterized algorithms on perfect graphs for deletion to \((r,\ell)\)-graphs. Zbl 1398.68248
Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket
3
2016
Algorithms and kernels for Feedback Set problems in generalizations of tournaments. Zbl 1350.68126
Bang-Jensen, Jørgen; Maddaloni, Alessandro; Saurabh, Saket
3
2016
Reducing rank of the adjacency matrix by graph modification. Zbl 1353.05117
Meesum, S. M.; Misra, Pranabendu; Saurabh, Saket
2
2016
Kernelization of cycle packing with relaxed disjointness constraints. Zbl 1388.68097
Agrawal, Akanksha; Lokshtanov, Daniel; Majumdar, Diptapriyo; Mouawad, Amer E.; Saurabh, Saket
2
2016
Simultaneous feedback vertex set: a parameterized perspective. Zbl 1388.68205
Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket
2
2016
Backdoors to q-Horn. Zbl 1336.68126
Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan
2
2016
Rank reduction of directed graphs by vertex and edge deletions. Zbl 1392.68329
Meesum, Syed Mohammad; Saurabh, Saket
2
2016
Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation). Zbl 1341.05239
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2016
Parameterized algorithms for non-separating trees and branchings in digraphs. Zbl 1353.68106
Bang-Jensen, Jørgen; Saurabh, Saket; Simonsen, Sven
1
2016
Lower bounds for approximation schemes for Closest String. Zbl 1378.68203
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket
1
2016
Simultaneous feedback edge set: a parameterized perspective. Zbl 1398.68204
Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2016
Parameterized algorithms. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
314
2015
Reconfiguration on sparse graphs. Zbl 1451.68134
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
8
2015
Kernels for structural parameterizations of vertex cover – case of small degree modulators. Zbl 1378.68089
Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket
7
2015
Uniform kernelization complexity of hitting forbidden minors. Zbl 1441.68107
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
6
2015
Linear time parameterized algorithms for subset feedback vertex set. Zbl 1440.68138
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
6
2015
B-chromatic number: beyond NP-hardness. Zbl 1378.68090
Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
5
2015
Deterministic truncation of linear matroids. Zbl 1440.68127
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
5
2015
Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1400.05242
Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket
4
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
Finding even subgraphs even faster. Zbl 1366.68093
Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
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
Quick but odd growth of cacti. Zbl 1372.68135
Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
2
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
2
2015
Unique covering problems with geometric sets. Zbl 1391.68103
Ashok, Pradeesha; Kolay, Sudeshna; Misra, Neeldhara; Saurabh, Saket
2
2015
Reducing rank of the adjacency matrix by graph modification. Zbl 1394.68268
Meesum, S. M.; Misra, Pranabendu; Saurabh, Saket
1
2015
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
32
2014
Kernelization lower bounds through colors and IDs. Zbl 1398.68226
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket
22
2014
Minimum bisection is fixed parameter tractable. Zbl 1315.05134
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
20
2014
...and 148 more Documents
all top 5

Cited by 1,134 Authors

125 Saurabh, Saket
71 Fomin, Fedor V.
59 Lokshtanov, Daniel
49 Golovach, Petr A.
47 Raman, Venkatesh
43 Pilipczuk, Marcin
43 Sau, Ignasi
41 Niedermeier, Rolf
41 Zehavi, Meirav
38 Thilikos, Dimitrios M.
37 Pilipczuk, Michał
36 Gutin, Gregory Z.
31 Kratsch, Stefan
29 Jansen, Bart M. P.
27 Cygan, Marek
27 Panolan, Fahad
24 Misra, Neeldhara
24 Ramanujan, M. S.
22 Bodlaender, Hans L.
22 Fernau, Henning
22 Komusiewicz, Christian
22 Marx, Dániel
22 Paulusma, Daniël
21 Mnich, Matthias
21 Villanger, Yngve
19 Ganian, Robert
19 Kratsch, Dieter
19 Paul, Christophe
18 Otachi, Yota
18 Wahlström, Magnus
17 Fellows, Michael Ralph
17 Heggernes, Pinar
17 Philip, Geevarghese
17 van Bevern, René
17 Wang, Jianxin
16 Chen, Jian-er
16 Kwon, Ojoung
16 Sorge, Manuel
16 Yeo, Anders
15 Guo, Jiong
14 Feng, Qilong
13 Agrawal, Akanksha
13 Bredereck, Robert
13 Gaspers, Serge
13 Hermelin, Danny
13 Lampis, Michael
13 Nichterlein, André
13 Ono, Hirotaka
13 Ordyniak, Sebastian
13 Xiao, Mingyu
12 Bang-Jensen, Jørgen
12 Dabrowski, Konrad Kazimierz
12 Eiben, Eduard
12 Rosamond, Frances A.
12 Sikdar, Somnath
12 Tale, Prafullkumar
12 van ’t Hof, Pim
12 Weller, Mathias
11 Baste, Julien
11 Bonnet, Edouard
11 Krithika, R.
11 Mertzios, George B.
11 Reidl, Felix
11 Suchý, Ondřej
11 Szeider, Stefan
11 Van Leeuwen, Erik Jan
10 Cao, Yixin
10 Knop, Dušan
10 Li, Wenjun
10 Liedloff, Mathieu
10 Paschos, Vangelis Th.
10 Rossmanith, Peter
9 Bonamy, Marthe
9 Hanaka, Tesshu
9 Johnson, Matthew
9 Kanj, Iyad A.
9 Kim, Eunjung
9 Kolay, Sudeshna
9 Kowalik, Łukasz
9 Majumdar, Diptapriyo
9 Misra, Pranabendu
9 Mouawad, Amer E.
9 Raymond, Jean-Florent
9 Sikora, Florian
8 Crowston, Robert
8 Fluschnik, Till
8 Kaski, Petteri
8 Nederlof, Jesper
8 Telle, Jan Arne
8 Wojtaszczyk, Jakub Onufry
7 Abu-Khzam, Faisal N.
7 Bazgan, Cristina
7 Belmonte, Rémy
7 Björklund, Andreas
7 Damaschke, Peter
7 Feldmann, Andreas Emil
7 Giannopoulou, Archontia C.
7 Havet, Frédéric
7 Molter, Hendrik
7 Rai, Ashutosh
...and 1,034 more Authors
all top 5

Cited in 79 Serials

178 Theoretical Computer Science
173 Algorithmica
91 Discrete Applied Mathematics
86 Journal of Computer and System Sciences
52 SIAM Journal on Discrete Mathematics
47 Theory of Computing Systems
42 Information Processing Letters
28 Journal of Combinatorial Optimization
20 Information and Computation
16 SIAM Journal on Computing
14 Discrete Mathematics
12 Discrete Optimization
11 Journal of Discrete Algorithms
10 European Journal of Combinatorics
9 Journal of Graph Algorithms and Applications
8 Artificial Intelligence
7 Journal of Combinatorial Theory. Series B
7 Mathematical Programming. Series A. Series B
6 Discrete Mathematics, Algorithms and Applications
6 ACM Transactions on Computation Theory
5 Acta Informatica
5 Journal of Graph Theory
5 Annals of Operations Research
5 Algorithms
4 Computational Geometry
4 Journal of Scheduling
3 Discrete & Computational Geometry
3 Computer Science Review
2 Information Sciences
2 Mathematics of Operations Research
2 Operations Research
2 Graphs and Combinatorics
2 European Journal of Operational Research
2 Distributed Computing
2 The Electronic Journal of Combinatorics
2 Annals of Mathematics and Artificial Intelligence
2 Optimization Letters
1 International Journal of Theoretical Physics
1 Israel Journal of Mathematics
1 Bulletin of Mathematical Biology
1 Chaos, Solitons and Fractals
1 Applied Mathematics and Computation
1 International Journal of Game Theory
1 Journal of Optimization Theory and Applications
1 Networks
1 Moscow University Computational Mathematics and Cybernetics
1 Mathematical Social Sciences
1 Social Choice and Welfare
1 Acta Mathematicae Applicatae Sinica. English Series
1 Journal of Symbolic Computation
1 Computers & Operations Research
1 Journal of Automated Reasoning
1 Applied Mathematics Letters
1 MSCS. Mathematical Structures in Computer Science
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 Historia Mathematica
1 International Journal of Computer Mathematics
1 Linear Algebra and its Applications
1 Proceedings of the Indian Academy of Sciences. Mathematical Sciences
1 Combinatorics, Probability and Computing
1 The Journal of Artificial Intelligence Research (JAIR)
1 Mathematical Problems in Engineering
1 Journal of the ACM
1 Annals of Combinatorics
1 Data Mining and Knowledge Discovery
1 Fundamenta Informaticae
1 Journal of Systems Science and Complexity
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 Quantum Information Processing
1 4OR
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Science China. Information Sciences
1 ACM Transactions on Algorithms
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Annales de l’Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD)
1 Computational Visual Media
1 Bulletin of the Hellenic Mathematical Society
1 Journal of Applied and Computational Topology

Citations by Year