×
Compute Distance To:
Author ID: lokshtanov.daniel Recent zbMATH articles by "Lokshtanov, Daniel"
Published as: Lokshtanov, Daniel; Lokshtanov, D.
Homepage: https://sites.cs.ucsb.edu/~daniello/
External Links: MGP · Google Scholar · dblp
all top 5

Co-Authors

4 single-authored
169 Saurabh, Saket
80 Fomin, Fedor V.
36 Zehavi, Meirav
28 Panolan, Fahad
23 Ramanujan, M. S.
19 Golovach, Petr A.
17 Pilipczuk, Michał
15 Agrawal, Akanksha
15 Heggernes, Pinar
15 Mouawad, Amer E.
14 Pilipczuk, Marcin L.
13 Misra, Pranabendu
13 Raman, Venkatesh
11 Misra, Neeldhara
10 Cygan, Marek
10 Marx, Dániel
9 Thilikos, Dimitrios M.
8 Fellows, Michael Ralph
8 Rosamond, Frances A.
7 Philip, Geevarghese
6 Sharma, Roohani
6 van ’t Hof, Pim
5 Bodlaender, Hans L.
5 Kolay, Sudeshna
5 Kratsch, Dieter
5 Mnich, Matthias
5 Nederlof, Jesper
5 Paul, Christophe
5 Suchý, Ondřej
4 Drange, Pål Grønås
4 Giannopoulou, Archontia C.
4 Jansen, Bart M. P.
4 Mancini, Federico
4 Papadopoulos, Charis
4 Sikdar, Somnath
4 Villanger, Yngve
3 Dom, Michael
3 Dregi, Markus Sortland
3 Fernau, Henning
3 Grandoni, Fabrizio
3 Kumar, Mithilesh
3 Paturi, Ramamohan
3 Penninkx, Eelko
3 Telle, Jan Arne
3 Van Leeuwen, Erik Jan
3 Wahlström, Magnus
2 Adler, Isolde
2 Banik, Aritra
2 Bonsma, Paul S.
2 Chitnis, Rajesh Hemant
2 Choudhary, Pratibha
2 Crespelle, Christophe
2 Dorn, Frederic
2 Eiben, Eduard
2 Gajarský, Jakub
2 Gaspers, Serge
2 Hassan, Olawale
2 Hliněný, Petr
2 Jain, Pallavi
2 Kanj, Iyad A.
2 Kaski, Petteri
2 Kolliopoulos, Stavros G.
2 Kratochvíl, Jan
2 Krause, Philipp Klaus
2 Le, Tien-Nam
2 Lévêque, Benjamin
2 Losievskaja, Elena
2 Majumdar, Diptapriyo
2 Meesum, Syed Mohammad
2 Meister, Daniel
2 Mihai, Rodica
2 Mukherjee, Joydeep
2 Nishimura, Naomi
2 Obdržálek, Jan
2 Perković, Ljubomir
2 Phan, Thi Ha Duong
2 Siebertz, Sebastian
2 Sullivan, Blair D.
2 Szeider, Stefan
2 Tale, Prafullkumar
2 Thierry, Eric
2 Thomassé, Stéphan
2 Thomassen, Carsten
2 Wrochna, Marcin
1 Alon, Noga M.
1 Bacsó, Gábor
1 Ben-Zwi, Oren
1 Binkele-Raible, Daniel
1 Björklund, Andreas
1 Carpenter, Timothy
1 De Oliveira, Oliveira Mateus
1 Dell, Holger
1 Dregi, Markus Fanebust
1 Duarte, Gabriel L.
1 Eppstein, David Arthur
1 Eto, Hiroshi
1 Fomin, Fedorr V.
1 Gabizon, Ariel
1 Gunda, Spoorthy
1 Hanaka, Tesshu
...and 27 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

188 Publications have been cited 2,326 times in 1,298 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
439
2015
Lower bounds based on the exponential time hypothesis. Zbl 1258.68068
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
95
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
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ł
72
2016
Bidimensionality and kernels. Zbl 1288.68116
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M.
67
2010
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
46
2011
Graph layout problems parameterized by vertex cover. Zbl 1183.68424
Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket
44
2008
Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
42
2019
Efficient computation of representative families with applications in parameterized and exact algorithms. Zbl 1410.05212
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
41
2016
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
36
2014
Treewidth governs the complexity of target set selection. Zbl 1248.90068
Ben-Zwi, Oren; Hermelin, Danny; Lokshtanov, Daniel; Newman, Ilan
36
2011
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
Kernelization – preprocessing with a guarantee. Zbl 1358.68141
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
30
2012
Fast FAST. Zbl 1248.68547
Alon, Noga; Lokshtanov, Daniel; Saurabh, Saket
30
2009
Slightly superexponential parameterized problems. Zbl 1373.68273
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
29
2011
Kernelization lower bounds through colors and IDs. Zbl 1398.68226
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket
28
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
27
2016
Intractability of clique-width parameterizations. Zbl 1207.68161
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
27
2010
Capacitated domination and covering: A parameterized perspective. Zbl 1142.68371
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve
25
2008
\(\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
Optimal broadcast domination in polynomial time. Zbl 1115.68115
Heggernes, Pinar; Lokshtanov, Daniel
22
2006
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
21
2016
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
Minimum bisection is fixed parameter tractable. Zbl 1315.05134
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
21
2014
Algorithmic lower bounds for problems parameterized by clique-width. Zbl 1288.05269
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
21
2010
Representative sets of product families. Zbl 1425.68448
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
21
2014
Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
20
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
19
2016
Independence and efficient domination on \(P_6\)-free graphs. Zbl 1409.68145
Lokshtanov, Daniel; Pilipczuk, Marcin; van Leeuwen, Erik Jan
18
2016
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
18
2016
Bidimensionality and EPTAS. Zbl 1377.68324
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
18
2011
Saving space by algebraization. Zbl 1293.68148
Lokshtanov, Daniel; Nederlof, Jesper
18
2010
Lossy kernelization. Zbl 1370.68136
Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
18
2017
Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090
Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket
17
2012
Contracting graphs to paths and trees. Zbl 1310.68229
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
17
2014
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
17
2012
Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077
Fomin, Fedor V.; 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
15
2012
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
14
2018
On the threshold of intractability. Zbl 1466.68042
Drange, Pål Grønås; Dregi, Markus Sortland; Lokshtanov, Daniel; Sullivan, Blair D.
14
2015
On the complexity of computing treelength. Zbl 1201.68058
Lokshtanov, Daniel
14
2010
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
Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167
Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
13
2013
The complexity of independent set reconfiguration on bipartite graphs. Zbl 1403.68169
Lokshtanov, Daniel; Mouawad, Amer E.
13
2018
Subexponential algorithms for partial cover problems. Zbl 1260.05159
Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
12
2011
Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
12
2014
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
12
2016
A near-optimal planarization algorithm. Zbl 1423.68341
Jansen, Bart M. P.; Lokshtanov, Daniel; 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.
11
2012
On the hardness of losing width. Zbl 1290.68045
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
11
2014
Wheel-free deletion is W[2]-hard. Zbl 1142.68366
Lokshtanov, Daniel
11
2008
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
Reconfiguration on sparse graphs. Zbl 1451.68134
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
10
2015
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145
Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko
10
2009
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs. Zbl 1428.05291
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan
9
2019
Obtaining a bipartite graph by contracting few edges. Zbl 1246.68132
Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
9
2011
Simpler parameterized algorithm for OCT. Zbl 1267.05268
Lokshtanov, Daniel; Saurabh, Saket; Sikdar, Somnath
9
2009
Subexponential parameterized odd cycle transversal on planar graphs. Zbl 1354.68129
Lokshtanov, Daniel; Saurabh, Saket; Wahlström, Magnus
9
2012
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
On the hardness of eliminating small induced subgraphs by contracting edges. Zbl 1406.68034
Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket
9
2013
Beating brute force for systems of polynomial equations over finite fields. Zbl 1433.11135
Lokshtanov, Daniel; Paturi, Ramamohan; Tamaki, Suguru; Williams, Ryan; Yu, Huacheng
8
2017
Deterministic truncation of linear matroids. Zbl 1440.68128
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
8
2018
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
8
2018
Finding the longest isometric cycle in a graph. Zbl 1211.05063
Lokshtanov, Daniel
8
2009
Linear kernel for planar Connected Dominating Set. Zbl 1241.68130
Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
8
2009
Bidimensionality and geometric graphs. Zbl 1421.68126
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket
8
2012
Parameterized tractability of multiway cut with parity constraints. Zbl 1272.68146
Lokshtanov, Daniel; Ramanujan, M. S.
8
2012
A linear kernel for a planar connected dominating set. Zbl 1216.68131
Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket
8
2011
Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
7
2017
Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Zbl 1387.68180
Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
7
2016
Linear time parameterized algorithms for subset feedback vertex set. Zbl 1440.68138
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
7
2015
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
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067
Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel
7
2013
Reconfiguration on sparse graphs. Zbl 1390.68351
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; 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
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs. Zbl 1309.68153
Heggernes, Pinar; Lokshtanov, Daniel; Nederlof, Jesper; Paul, Christophe; Telle, Jan Arne
6
2010
Characterizing and computing minimal cograph completions. Zbl 1216.05158
Lokshtanov, Daniel; Mancini, Federico; Papadopoulos, Charis
6
2010
Cutwidth of split graphs and threshold graphs. Zbl 1237.05089
Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis
6
2011
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
Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. Zbl 1230.68104
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
6
2010
Clustering with local restrictions. Zbl 1266.05122
Lokshtanov, Daniel; Marx, Dániel
6
2013
Computing optimal Steiner trees in polynomial space. Zbl 1269.05049
Fomin, Fedor V.; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket
6
2013
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
A faster FPT algorithm and a smaller kernel for Block Graph Vertex Deletion. Zbl 1417.68145
Agrawal, Akanksha; Kolay, Sudeshna; Lokshtanov, Daniel; Saurabh, Saket
6
2016
Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1410.68270
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
5
2017
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
5
2018
Deterministic truncation of linear matroids. Zbl 1440.68127
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
5
2015
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing. Zbl 1285.68207
Heggernes, Pinar; Kratsch, Dieter; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
5
2010
Fast algorithms for parameterized problems with relaxed disjointness constraints. Zbl 1432.68193
Gabizon, Ariel; Lokshtanov, Daniel; Pilipczuk, Michał
5
2015
Even faster algorithm for set splitting! Zbl 1273.68272
Lokshtanov, Daniel; Saurabh, Saket
5
2009
Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\). Zbl 1406.68042
Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Ramanujan, M. S.; Saurabh, Saket
5
2013
Feedback vertex set in mixed graphs. Zbl 1342.05180
Bonsma, Paul; Lokshtanov, Daniel
5
2011
Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164
Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
5
2018
Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68115
Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej
5
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
Long directed \((s,t)\)-path: FPT algorithm. Zbl 1478.68233
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
4
2018
Linear time parameterized algorithms for Subset Feedback Vertex Set. Zbl 1440.68139
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket
4
2018
Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1454.68088
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
4
2019
Clique-width: on the price of generality. Zbl 1421.68125
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
4
2009
Bisection of bounded treewidth graphs by convolutions. Zbl 1477.68220
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E.
1
2021
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
Parameterized complexity and approximability of directed odd cycle transversal. Zbl 07304158
Lokshtanov, Daniel; Ramanujan, M. S.; Saurab, Saket; Zehavi, Meirav
2
2020
A polynomial sized kernel for tracking paths problem. Zbl 1436.68142
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
1
2020
2-approximating feedback vertex set in tournaments. Zbl 07304084
Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
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
42
2019
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs. Zbl 1428.05291
Bacsó, Gábor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Tuza, Zsolt; van Leeuwen, Erik Jan
9
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
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
3
2019
The complexity of independent set reconfiguration on bipartite graphs. Zbl 1454.68111
Lokshtanov, Daniel; Mouawad, Amer E.
2
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
2
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
2
2019
Split contraction: the untold story. Zbl 07143734
Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
1
2019
Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. Zbl 07152233
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
1
2019
A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. Zbl 07378611
Lokshtanov, Daniel; De Oliveira, Oliveira Mateus; Saurabh, Saket
1
2019
Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
14
2018
The complexity of independent set reconfiguration on bipartite graphs. Zbl 1403.68169
Lokshtanov, Daniel; Mouawad, Amer E.
13
2018
Deterministic truncation of linear matroids. Zbl 1440.68128
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
8
2018
Slightly superexponential parameterized problems. Zbl 1393.68077
Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket
8
2018
Reconfiguration on sparse graphs. Zbl 1390.68351
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
6
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
5
2018
Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164
Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
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
Linear time parameterized algorithms for Subset Feedback Vertex Set. Zbl 1440.68139
Lokshtanov, Daniel; 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
Covering small independent sets and separators with applications to parameterized algorithms. Zbl 1403.68337
Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Sharma, Roohani; 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
Independence and efficient domination on \(P_6\)-free graphs. Zbl 1431.68049
Lokshtanov, Daniel; Pilipczuk, Marcin; Leeuwen, Erik Jan Van
2
2018
Excluded grid minors and efficient polynomial-time approximation schemes. Zbl 1426.68303
Fomin, Fedorr V.; Lokshtanov, Daniel; Saurabh, Saket
2
2018
Simultaneous feedback vertex set: a parameterized perspective. Zbl 07143721
Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E.; 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
Below all subsets for minimal connected dominating set. Zbl 1396.05052
Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket
1
2018
A polynomial sized kernel for tracking paths problem. Zbl 1436.68143
Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket
1
2018
Quasipolynomial representation of transversal matroids with applications in parameterized complexity. Zbl 1462.68081
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav
1
2018
Reducing CMSO model checking to highly connected graphs. Zbl 07376062
Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav
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
Balanced judicious bipartition is fixed-parameter tractable. Zbl 07278112
Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav
1
2018
Lossy kernelization. Zbl 1370.68136
Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
18
2017
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
Beating brute force for systems of polynomial equations over finite fields. Zbl 1433.11135
Lokshtanov, Daniel; Paturi, Ramamohan; Tamaki, Suguru; Williams, Ryan; Yu, Huacheng
8
2017
Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137
Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
7
2017
Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1410.68270
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav
5
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
5
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
Split contraction: the untold story. Zbl 1402.68136
Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
4
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
3
2017
Representative families of product families. Zbl 1445.68330
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
3
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
Spanning circuits in regular matroids. Zbl 1410.68164
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
2
2017
Quick but odd growth of cacti. Zbl 1372.68136
Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
2
2017
Faster and enhanced inclusion-minimal cograph completion. Zbl 1470.05155
Crespelle, Christophe; Lokshtanov, Daniel; Phan, Thi Ha Duong; Thierry, Eric
2
2017
A \(2\ell k\) kernel for \(\ell\)-component order connectivity. Zbl 1398.68251
Kumar, Mithilesh; Lokshtanov, Daniel
2
2017
Hitting selected (odd) cycles. Zbl 1368.05147
Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket
2
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
Packing cycles faster than Erdős-Pósa. Zbl 1441.05210
Lokshtanov, Daniel; Mouawad, Amer E.; 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ł
72
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
41
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
27
2016
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
21
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
19
2016
Independence and efficient domination on \(P_6\)-free graphs. Zbl 1409.68145
Lokshtanov, Daniel; Pilipczuk, Marcin; van Leeuwen, Erik Jan
18
2016
Exact algorithms via monotone local search. Zbl 1375.68185
Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket
18
2016
Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123
Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket
12
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
6
2016
Simultaneous feedback vertex set: a parameterized perspective. Zbl 1388.68205
Agrawal, Akanksha; Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket
3
2016
Faster exact and parameterized algorithm for feedback vertex set in tournaments. Zbl 1388.68324
Kumar, Mithilesh; Lokshtanov, Daniel
3
2016
Lower bounds for approximation schemes for Closest String. Zbl 1378.68203
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal; Saurabh, Saket
3
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
A new perspective on FO model checking of dense graph classes. Zbl 1401.68196
Gajarský, J.; Hliněný, P.; Obdržálek, J.; Lokshtanov, D.; Ramanujan, M. S.
2
2016
Faster exact and parameterized algorithm for feedback vertex set in bipartite tournaments. Zbl 1391.68132
Kumar, Mithilesh; Lokshtanov, Daniel
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. Zbl 1334.90001
Cygan, Marek; Fomin, Fedor V.; Kowalik, Łukasz; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
439
2015
On the threshold of intractability. Zbl 1466.68042
Drange, Pål Grønås; Dregi, Markus Sortland; Lokshtanov, Daniel; Sullivan, Blair D.
14
2015
Reconfiguration on sparse graphs. Zbl 1451.68134
Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket
10
2015
Linear time parameterized algorithms for subset feedback vertex set. Zbl 1440.68138
Lokshtanov, Daniel; Ramanujan, M. S.; 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
Deterministic truncation of linear matroids. Zbl 1440.68127
Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket
5
2015
Fast algorithms for parameterized problems with relaxed disjointness constraints. Zbl 1432.68193
Gabizon, Ariel; Lokshtanov, Daniel; Pilipczuk, Michał
5
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
Faster parameterized algorithms using linear programming. Zbl 1398.68254
Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket
36
2014
Kernelization lower bounds through colors and IDs. Zbl 1398.68226
Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket
28
2014
Minimum bisection is fixed parameter tractable. Zbl 1315.05134
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
21
2014
Representative sets of product families. Zbl 1425.68448
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket
21
2014
Contracting graphs to paths and trees. Zbl 1310.68229
Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christophe
17
2014
Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077
Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket
16
2014
Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket
12
2014
A near-optimal planarization algorithm. Zbl 1423.68341
Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket
11
2014
On the hardness of losing width. Zbl 1290.68045
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
11
2014
On cutwidth parameterized by vertex cover. Zbl 1303.05185
Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket
4
2014
Tree deletion set has a polynomial kernel (but no \(\mathrm {OPT}^{\mathcal O(1)}\) approximation). Zbl 1360.68510
Giannopoulou, Archontia C.; Lokshtanov, Daniel; Saurabh, Saket; Suchy, Ondrej
2
2014
Parameterized complexity of bandwidth on trees. Zbl 1412.68080
Dregi, Markus Sortland; Lokshtanov, Daniel
1
2014
Solving multicut faster than \(2^{n }\). Zbl 1425.05154
Lokshtanov, Daniel; Saurabh, Saket; Suchý, Ondřej
1
2014
Obtaining a bipartite graph by contracting few edges. Zbl 1285.05167
Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe
13
2013
...and 88 more Documents
all top 5

Cited by 1,326 Authors

114 Saurabh, Saket
69 Lokshtanov, Daniel
65 Fomin, Fedor V.
48 Golovach, Petr A.
42 Sau, Ignasi
42 Zehavi, Meirav
40 Niedermeier, Rolf
40 Pilipczuk, Marcin L.
40 Thilikos, Dimitrios M.
39 Pilipczuk, Michał
35 Jansen, Bart M. P.
35 Raman, Venkatesh
34 Kratsch, Stefan
30 Marx, Dániel
30 Panolan, Fahad
28 Gutin, Gregory Z.
24 Misra, Neeldhara
24 Ramanujan, M. S.
23 Ganian, Robert
23 Komusiewicz, Christian
22 Fernau, Henning
21 Bodlaender, Hans L.
21 Heggernes, Pinar
20 Agrawal, Akanksha
20 Cygan, Marek
20 Otachi, Yota
20 Paulusma, Daniël
20 van Bevern, René
19 Lampis, Michael
19 Villanger, Yngve
18 Fellows, Michael Ralph
18 Mnich, Matthias
18 Wahlström, Magnus
17 Hanaka, Tesshu
17 Paul, Christophe
17 Sorge, Manuel
17 Wang, Jianxin
16 Bonnet, Edouard
16 Ono, Hirotaka
16 Philip, Geevarghese
15 Baste, Julien
15 Knop, Dušan
14 Eiben, Eduard
14 Feng, Qilong
14 Hermelin, Danny
14 Kratsch, Dieter
14 Nichterlein, André
14 Ordyniak, Sebastian
14 Sikora, Florian
14 Tale, Prafullkumar
13 Bredereck, Robert
13 Chen, Jian-er
13 Guo, Jiong
13 Kwon, Ojoung
13 Suchý, Ondřej
13 Szeider, Stefan
13 Van Leeuwen, Erik Jan
13 van ’t Hof, Pim
13 Yeo, Anders
12 Belmonte, Rémy
12 Kolay, Sudeshna
12 Nederlof, Jesper
12 Rosamond, Frances A.
12 Weller, Mathias
11 Krithika, R.
11 Majumdar, Diptapriyo
11 Misra, Pranabendu
11 Molter, Hendrik
11 Mouawad, Amer E.
11 Papadopoulos, Charis
11 Reidl, Felix
11 Rzążewski, Paweł
10 Brandstädt, Andreas
10 Gargano, Luisa
10 Gaspers, Serge
10 Mertzios, George B.
9 Fluschnik, Till
9 Kanj, Iyad A.
9 Kobayashi, Yasuaki
9 Koutecký, Martin
9 Kowalik, Łukasz
9 Li, Wenjun
9 Paschos, Vangelis Th.
9 Rautenbach, Dieter
9 Raymond, Jean-Florent
9 Sikdar, Somnath
9 Telle, Jan Arne
9 Thomassé, Stéphan
9 Vaccaro, Ugo
8 Araújo, Júlio César Silva
8 Cordasco, Gennaro
8 Feldmann, Andreas Emil
8 Kanesh, Lawqueen
8 Kim, Eunjung
8 Liedloff, Mathieu
8 Nisse, Nicolas
8 Rossmanith, Peter
8 Shachnai, Hadas
8 Sullivan, Blair D.
8 Todinca, Ioan
...and 1,226 more Authors
all top 5

Cited in 84 Serials

187 Theoretical Computer Science
183 Algorithmica
115 Discrete Applied Mathematics
89 Journal of Computer and System Sciences
59 SIAM Journal on Discrete Mathematics
44 Theory of Computing Systems
40 Information Processing Letters
29 Journal of Combinatorial Optimization
21 SIAM Journal on Computing
20 Information and Computation
15 Artificial Intelligence
14 Discrete Mathematics
14 Discrete Optimization
10 European Journal of Combinatorics
10 Journal of Discrete Algorithms
9 Journal of Combinatorial Theory. Series B
9 Journal of Graph Algorithms and Applications
7 Mathematical Programming. Series A. Series B
7 Algorithms
6 The Electronic Journal of Combinatorics
6 ACM Transactions on Computation Theory
5 Acta Informatica
5 Annals of Operations Research
5 Journal of Scheduling
3 Journal of Graph Theory
3 Graphs and Combinatorics
3 Computers & Operations Research
3 Computational Geometry
3 European Journal of Operational Research
3 Annals of Mathematics and Artificial Intelligence
3 Discrete Mathematics, Algorithms and Applications
3 Computer Science Review
2 Operations Research Letters
2 Discrete & Computational Geometry
2 The Journal of Artificial Intelligence Research (JAIR)
2 Fundamenta Informaticae
2 Quantum Information Processing
2 Logical Methods in Computer Science
2 Journal of Applied and Computational Topology
1 Computer Methods in Applied Mechanics and Engineering
1 International Journal of Theoretical Physics
1 Bulletin of Mathematical Biology
1 Chaos, Solitons and Fractals
1 Applied Mathematics and Computation
1 Information Sciences
1 Networks
1 Operations Research
1 Moscow University Computational Mathematics and Cybernetics
1 Mathematical Social Sciences
1 Combinatorica
1 Social Choice and Welfare
1 Journal of Symbolic Computation
1 Journal of Automated Reasoning
1 Journal of Cryptology
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 Distributed Computing
1 Applicable Algebra in Engineering, Communication and Computing
1 The Australasian Journal of Combinatorics
1 Computational Complexity
1 Discussiones Mathematicae. Graph Theory
1 Journal of the ACM
1 Annals of Combinatorics
1 Data Mining and Knowledge Discovery
1 Journal of the European Mathematical Society (JEMS)
1 Trudy Instituta Matematiki
1 Central European Journal of Mathematics
1 Internet Mathematics
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Contributions to Discrete Mathematics
1 Proceedings of the Steklov Institute of Mathematics
1 Optimization Letters
1 Applicable Analysis and Discrete Mathematics
1 RAIRO. Theoretical Informatics and Applications
1 ACM Transactions on Algorithms
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Electronic Journal of Graph Theory and Applications
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 Communications on Applied Mathematics and Computation

Citations by Year