Edit Profile (opens in new tab) Saurabh, Saket Co-Author Distance Author ID: saurabh.saket Published as: Saurabh, Saket; Saurabh Homepage: https://sites.google.com/view/sakethome External Links: MGP · ORCID · Wikidata · Google Scholar · ResearchGate · dblp · IdRef Documents Indexed: 444 Publications since 2002, including 2 Books and 1 Additional arXiv Preprint 6 Contributions as Editor Co-Authors: 184 Co-Authors with 450 Joint Publications 3,859 Co-Co-Authors all top 5 Co-Authors 0 single-authored 193 Lokshtanov, Daniel 120 Fomin, Fedor V. 92 Zehavi, Meirav 71 Panolan, Fahad 71 Raman, Venkatesh 46 Misra, Pranabendu 46 Ramanujan, M. S. 42 Agrawal, Akanksha 32 Golovach, Petr A. 28 Misra, Neeldhara 28 Philip, Geevarghese 24 Kolay, Sudeshna 20 Kanesh, Lawqueen 20 Sharma, Roohani 19 Gupta, Sushmita 18 Pilipczuk, Michał 18 Tale, Prafullkumar 15 Gaspers, Serge 15 Sahu, Abhishek 14 Pilipczuk, Marcin L. 14 Rai, Ashutosh 13 Sikdar, Somnath 12 Jain, Pallavi 12 Madathil, Jayakrishnan 12 Roy, Sanjukta 10 Cygan, Marek 10 Gutin, Gregory Z. 10 Thilikos, Dimitrios M. 9 Ashok, Pradeesha 9 Marx, Dániel 9 Suchý, Ondřej 8 Amini, Omid 8 Banik, Aritra 8 Fellows, Michael Ralph 8 Kratsch, Dieter 8 Krithika, R. 8 Meesum, Syed Mohammad 8 Mouawad, Amer E. 8 Rosamond, Frances A. 8 Thomassé, Stéphan 7 Basavaraju, Manu 7 Mnich, Matthias 7 Verma, Shaily 6 Crowston, Robert 6 Lochet, William 6 Mishra, Sounaka 6 Sau, Ignasi 6 Villanger, Yngve 5 Bang-Jensen, Jørgen 5 Fernau, Henning 5 Giannopoulou, Archontia C. 5 Majumdar, Diptapriyo 5 Subramanian, C. R. 5 Yeo, Anders 4 Alon, Noga 4 Banerjee, Niranka 4 Bessy, Stéphane 4 Bishnu, Arijit 4 Biswas, Arindam 4 Choudhary, Pratibha 4 Ghosh, Arijit 4 Grandoni, Fabrizio 4 Heggernes, Pinar 4 Jana, Satyabrata 4 Jansen, Bart M. P. 4 Mishra, Gopinath 4 Muluk, Komal 4 Paul, Christophe 4 Sahlot, Vibha 4 Szeider, Stefan 3 Chitnis, Rajesh Hemant 3 Das, Avinandan 3 Dom, Michael 3 Knudsen, Kristine V. K. 3 Krivelevich, Michael 3 Vitting Klinkby, Kristine 3 Wahlström, Magnus 2 Abhinav, Ankit 2 Adler, Isolde 2 Bandopadhyay, Susobhan 2 Bhyravarapu, Sriram 2 Björklund, Andreas 2 Bliznets, Ivan A. 2 Bodlaender, Hans L. 2 Bougeret, Marin 2 Cohen, Nathann 2 Dorn, Frederic 2 dos Santos Souza, Uéverton 2 Francis, Mathew C. 2 Goyal, Prachi 2 Gunda, Spoorthy 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 Kundu, Madhumita 2 Le, Tien-Nam ...and 84 more Co-Authors all top 5 Serials 40 Algorithmica 27 ACM Transactions on Algorithms 26 Theoretical Computer Science 26 SIAM Journal on Discrete Mathematics 18 Journal of Computer and System Sciences 11 Theory of Computing Systems 8 ACM Transactions on Computation Theory 7 SIAM Journal on Computing 6 Information Processing Letters 4 Journal of the ACM 3 Journal of Graph Theory 3 Information and Computation 2 Discrete Applied Mathematics 2 Discrete & Computational Geometry 2 Mathematical Programming. Series A. Series B 2 Bulletin of the European Association for Theoretical Computer Science EATCS 2 Discrete Optimization 1 Journal of Combinatorial Theory. Series B 1 Journal of the Ramanujan Mathematical Society 1 Computational Geometry 1 Journal of Combinatorial Optimization 1 Journal of Graph Algorithms and Applications 1 Journal of Discrete Algorithms 1 Lecture Notes in Computer Science 1 Journal of Computational Geometry 1 LIPIcs – Leibniz International Proceedings in Informatics all top 5 Fields 424 Computer science (68-XX) 276 Combinatorics (05-XX) 27 Operations research, mathematical programming (90-XX) 13 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 7 General and overarching topics; collections (00-XX) 5 Mathematical logic and foundations (03-XX) 2 Linear and multilinear algebra; matrix theory (15-XX) 2 Numerical analysis (65-XX) 2 Information and communication theory, circuits (94-XX) 1 History and biography (01-XX) 1 Algebraic geometry (14-XX) 1 Nonassociative rings and algebras (17-XX) 1 \(K\)-theory (19-XX) 1 Functional analysis (46-XX) 1 Global analysis, analysis on manifolds (58-XX) 1 Statistics (62-XX) 1 Mathematics education (97-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 348 Publications have been cited 4,442 times in 2,113 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 916 2015 Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 124 2019 Lower bounds based on the exponential time hypothesis. Zbl 1258.68068 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 120 2011 Bidimensionality and kernels. Zbl 1288.68116 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. 86 2010 (Meta) kernelization. Zbl 1292.68089 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. 82 2009 Incompressibility through colors and IDs. Zbl 1248.68243 Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket 80 2009 Efficient computation of representative families with applications in parameterized and exact algorithms. Zbl 1410.05212 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket 69 2016 Graph layout problems parameterized by vertex cover. Zbl 1183.68424 Fellows, Michael R.; Lokshtanov, Daniel; Misra, Neeldhara; Rosamond, Frances A.; Saurabh, Saket 66 2008 Faster parameterized algorithms using linear programming. Zbl 1398.68254 Lokshtanov, Daniel; Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket 65 2014 Kernelization lower bounds through colors and IDs. Zbl 1398.68226 Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket 58 2014 Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1373.68242 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 53 2011 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 50 2016 On two techniques of combining branching and treewidth. Zbl 1185.68475 Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey A. 50 2009 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 49 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 47 2008 (Meta) kernelization. Zbl 1425.68137 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. 45 2016 Kernelization – preprocessing with a guarantee. Zbl 1358.68141 Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket 40 2012 Capacitated domination and covering: A parameterized perspective. Zbl 1142.68371 Dom, Michael; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve 38 2008 Intractability of clique-width parameterizations. Zbl 1207.68161 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 38 2010 Lossy kernelization. Zbl 1370.68136 Lokshtanov, Daniel; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 37 2017 Fast FAST. Zbl 1248.68547 Alon, Noga; Lokshtanov, Daniel; Saurabh, Saket 37 2009 Parameterized algorithms for feedback set problems and their duals in tournaments. Zbl 1086.68105 Raman, Venkatesh; Saurabh, Saket 35 2006 Efficient computation of representative sets with applications in parameterized and exact algorithms. Zbl 1421.68077 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket 35 2014 Slightly superexponential parameterized problems. Zbl 1373.68273 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 35 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 32 2016 Algorithmic lower bounds for problems parameterized by clique-width. Zbl 1288.05269 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 28 2010 A near-optimal planarization algorithm. Zbl 1423.68341 Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 27 2014 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 27 2009 Bidimensionality and geometric graphs. Zbl 1421.68126 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket 26 2012 Bidimensionality and EPTAS. Zbl 1377.68324 Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket 26 2011 Minimum bisection is fixed parameter tractable. Zbl 1315.05134 Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 26 2014 \(\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 25 2009 Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. Zbl 1358.05284 Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 24 2017 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 24 2011 Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 24 2018 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 24 2010 Faster fixed parameter tractable algorithms for finding feedback vertex sets. Zbl 1321.05275 Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R. 23 2006 Hitting forbidden minors: approximation and kernelization. Zbl 1230.68107 Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket 23 2011 Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 22 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 22 2012 Efficient exact algorithms through enumerating maximal independent sets and other techniques. Zbl 1148.68054 Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath 22 2007 On parameterized independent feedback vertex set. Zbl 1253.68181 Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket 22 2012 A linear vertex kernel for maximum internal spanning tree. Zbl 1258.05117 Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket; Thomassé, Stéphan 22 2013 Slightly superexponential parameterized problems. Zbl 1393.68077 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 21 2018 Representative sets of product families. Zbl 1425.68448 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket 21 2014 Sharp separation and applications to exact and parameterized algorithms. Zbl 1236.68090 Fomin, Fedor V.; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket 21 2012 Exact algorithms via monotone local search. Zbl 1375.68185 Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket 20 2016 Algorithmic aspects of dominator colorings in graphs. Zbl 1314.68215 Arumugam, S.; Chandrasekar, K. Raja; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket 20 2011 Local search: is brute-force avoidable? Zbl 1244.68070 Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve 20 2012 Clique-width: on the price of generality. Zbl 1421.68125 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 19 2009 A polynomial kernel for proper interval vertex deletion. Zbl 1285.05160 Fomin, Fedor V.; Saurabh, Saket; Villanger, Yngve 19 2013 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. 19 2011 Subexponential algorithms for partial cover problems. Zbl 1260.05159 Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket 19 2011 FPT algorithms for connected feedback vertex set. Zbl 1258.05060 Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath 19 2012 LP can be a cure for parameterized problems. Zbl 1245.68111 Narayanaswamy, N. S.; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket 18 2012 Faster algorithms for finding and counting subgraphs. Zbl 1246.05149 Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Raghavendra Rao, B. V. 17 2012 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 17 2018 Hitting forbidden minors: approximation and kernelization. Zbl 1336.68123 Fomin, Fedor V.; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket 17 2016 Spanning directed trees with many leaves. Zbl 1215.05027 Alon, Noga; Fomin, Fedor V.; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket 17 2009 Reconfiguration on sparse graphs. Zbl 1390.68351 Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 16 2018 Parameterized algorithms to preserve connectivity. Zbl 1412.68078 Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket 16 2014 Lower bounds on kernelization. Zbl 1248.90078 Misra, Neeldhara; Raman, Venkatesh; Saurabh, Saket 16 2011 Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. Zbl 1261.05066 Gupta, Sushmita; Raman, Venkatesh; Saurabh, Saket 16 2012 Subexponential parameterized odd cycle transversal on planar graphs. Zbl 1354.68129 Lokshtanov, Daniel; Saurabh, Saket; Wahlström, Magnus 15 2012 On the hardness of eliminating small induced subgraphs by contracting edges. Zbl 1406.68034 Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket 15 2013 On the hardness of losing width. Zbl 1290.68045 Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 14 2014 Paths, flowers and vertex cover. Zbl 1346.05287 Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket 14 2011 Implicit branching and parameterized partial cover problems. Zbl 1245.05124 Amini, Omid; Fomin, Fedor V.; Saurabh, Saket 14 2011 Deterministic truncation of linear matroids. Zbl 1440.68128 Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket 14 2018 Tight bounds for linkages in planar graphs. Zbl 1333.05280 Adler, Isolde; Kolliopoulos, Stavros G.; Krause, Philipp Klaus; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios 14 2011 Reconfiguration on sparse graphs. Zbl 1451.68134 Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 13 2015 Parameterized algorithms for even cycle transversal. Zbl 1341.05248 Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket 13 2012 Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG. Zbl 1183.05084 Raman, Venkatesh; Saurabh, Saket 13 2007 Faster fixed parameter tractable algorithms for undirected feedback vertex set. Zbl 1019.68082 Raman, Venkatesh; Saurabh, Saket; Subramanian, C. R. 13 2002 Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1454.68088 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 12 2019 Linear kernels for (connected) dominating set on \(H\)-minor-free graphs. Zbl 1421.68078 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. 12 2012 Uniform kernelization complexity of hitting forbidden minors. Zbl 1440.68137 Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel; Saurabh, Saket 12 2017 Popular matching in roommates setting is NP-hard. Zbl 1432.68163 Gupta, Sushmita; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 12 2019 Parameterized complexity of directed Steiner tree on sparse graphs. Zbl 1371.68114 Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondřej 12 2013 Parameterized algorithm for eternal vertex cover. Zbl 1234.68150 Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket 12 2010 Iterative compression and exact algorithms. Zbl 1186.68187 Fomin, Fedor V.; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket 12 2010 Improved algorithms and combinatorial bounds for independent feedback vertex set. Zbl 1398.68203 Agrawal, Akanksha; Gupta, Sushmita; Saurabh, Saket; Sharma, Roohani 11 2017 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 11 2019 The parameterized complexity of unique coverage and its variants. Zbl 1290.68059 Misra, Neeldhara; Moser, Hannes; Raman, Venkatesh; Saurabh, Saket; Sikdar, Somnath 11 2013 Degree-constrained subgraph problems: Hardness and approximation results. Zbl 1209.68629 Amini, Omid; Peleg, David; Pérennes, Stéphane; Sau, Ignasi; Saurabh, Saket 11 2009 Linear kernel for planar Connected Dominating Set. Zbl 1241.68130 Lokshtanov, Daniel; Mnich, Matthias; Saurabh, Saket 11 2009 Counting subgraphs via homomorphisms. Zbl 1247.05107 Amini, Omid; Fomin, Fedor V.; Saurabh, Saket 11 2009 Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Zbl 1418.68245 Kumar, Mrinal; Mishra, Sounaka; Safina Devi, N.; Saurabh, Saket 11 2014 Simpler parameterized algorithm for OCT. Zbl 1267.05268 Lokshtanov, Daniel; Saurabh, Saket; Sikdar, Somnath 11 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 11 2016 Parameterized study of the test cover problem. Zbl 1365.68275 Crowston, Robert; Gutin, Gregory; Jones, Mark; Saurabh, Saket; Yeo, Anders 11 2012 Branching and treewidth based exact algorithms. Zbl 1135.68513 Fomin, Fedor V.; Gaspers, Serge; Saurabh, Saket 11 2006 Kernels for deletion to classes of acyclic digraphs. Zbl 1380.68207 Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav 10 2018 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. 10 2017 Kernels for structural parameterizations of vertex cover – case of small degree modulators. Zbl 1378.68089 Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket 10 2015 Interval vertex deletion admits a polynomial kernel. Zbl 1432.68185 Agrawal, Akanksha; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 10 2019 Counting subgraphs via homomorphisms. Zbl 1248.05122 Amini, Omid; Fomin, Fedor V.; Saurabh, Saket 10 2012 Distortion is fixed parameter tractable. Zbl 1248.68244 Fellows, Michael R.; Fomin, Fedor V.; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances A.; Saurabh, Saket 10 2009 Exact algorithms via monotone local search. Zbl 1427.68119 Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket 10 2019 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 10 2013 Parameterized complexity of multi-node hubs. Zbl 07601249 Saurabh, Saket; Zehavi, Meirav 1 2023 Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Zbl 1511.05222 Fomin, Fedor V.; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 6 2022 A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs. Zbl 1489.05134 Agrawal, Akanksha; Kanesh, Lawqueen; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 3 2022 On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization). Zbl 1484.91308 Gupta, Sushmita; Saurabh, Saket; Zehavi, Meirav 1 2022 Parameterized algorithms for finding highly connected solution. Zbl 07615727 Abhinav, Ankit; Bandopadhyay, Susobhan; Banik, Aritra; Saurabh, Saket 1 2022 On the parameterized complexity of maximum degree contraction problem. Zbl 1518.68277 Saurabh, Saket; Tale, Prafullkumar 1 2022 On the complexity of singly connected vertex deletion. Zbl 07597110 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2022 Gerrymandering on graphs: computational complexity and parameterized algorithms. Zbl 1491.91101 Gupta, Sushmita; Jain, Pallavi; Panolan, Fahad; Roy, Sanjukta; Saurabh, Saket 3 2021 On the parameterized approximability of contraction to classes of chordal graphs. Zbl 1495.68178 Gunda, Spoorthy; Jain, Pallavi; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar 2 2021 Multiplicative parameterization above a guarantee. Zbl 1495.68103 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 2 2021 2-approximating feedback vertex set in tournaments. Zbl 07475090 Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket 1 2021 Paths to trees and cacti. Zbl 1486.68121 Agrawal, Akanksha; Kanesh, Lawqueen; Saurabh, Saket; Tale, Prafullkumar 1 2021 Parameterized and exact algorithms for class domination coloring. Zbl 1509.68204 Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar 1 2021 Simultaneous feedback edge set: a parameterized perspective. Zbl 1512.68117 Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 1 2021 Packing arc-disjoint cycles in tournaments. Zbl 1512.68193 Bessy, Stéphane; Bougeret, Marin; Krithika, R.; Sahu, Abhishek; Saurabh, Saket; Thiebaut, Jocelyn; Zehavi, Meirav 1 2021 Popular matching in roommates setting is NP-hard. Zbl 1495.68093 Gupta, Sushmita; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 1 2021 Approximation in (poly-) logarithmic space. Zbl 1515.68379 Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket 1 2021 ETH-tight algorithms for long path and cycle on unit disk graphs. Zbl 1499.68366 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 1 2021 Balanced stable marriage: how close is close enough? Zbl 1517.68144 Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav 1 2021 A polynomial sized kernel for tracking paths problem. Zbl 1436.68142 Banik, Aritra; Choudhary, Pratibha; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket 8 2020 Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? Zbl 1445.68171 Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket 7 2020 Hitting topological minors is FPT. Zbl 07298330 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 6 2020 Path contraction faster than \(2^n\). Zbl 1455.68132 Agrawal, Akanksha; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar 6 2020 Fixed-parameter tractable algorithms for tracking shortest paths. Zbl 1464.68274 Banik, Aritra; Choudhary, Pratibha; Raman, Venkatesh; Saurabh, Saket 6 2020 On the parameterized complexity of grid contraction. Zbl 07759302 Saurabh, Saket; Souza, Uéverton Dos Santos; Tale, Prafullkumar 5 2020 Randomized contractions meet lean decompositions. Zbl 07471491 Cygan, Marek; Komosa, Paweł; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket; Wahlström, Magnus 4 2020 Fixed parameter tractability of graph deletion problems over data streams. Zbl 07336142 Bishnu, Arijit; Ghosh, Arijit; Kolay, Sudeshna; Mishra, Gopinath; Saurabh, Saket 4 2020 An exponential time parameterized algorithm for planar disjoint paths. Zbl 07298329 Lokshtanov, Daniel; Misra, Pranabendu; Pilipczuk, Michał; Saurabh, Saket; Zehavi, Meirav 4 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 4 2020 A polynomial kernel for paw-free editing. Zbl 07764101 Eiben, Eduard; Lochet, William; Saurabh, Saket 4 2020 On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components. Zbl 07559446 Neogi, Rian; Ramanujan, M. S.; Saurabh, Saket; Sharma, Roohani 3 2020 Bidimensionality and kernels. Zbl 1475.05161 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. 3 2020 2-approximating feedback vertex set in tournaments. Zbl 07304084 Lokshtanov, Daniel; Misra, Pranabendu; Mukherjee, Joydeep; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket 3 2020 Parameterized complexity of conflict-free matchings and paths. Zbl 1442.68072 Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Saurabh, Saket 3 2020 Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems. Zbl 07678783 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 3 2020 Fault tolerant subgraphs with applications in kernelization. Zbl 07650395 Lochet, William; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav 2 2020 The parameterized complexity of guarding almost convex polygons. Zbl 07760132 Agrawal, Akanksha; Knudsen, Kristine V. K.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 2 2020 On the parameterized approximability of contraction to classes of chordal graphs. Zbl 07758353 Gunda, Spoorthy; Jain, Pallavi; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar 2 2020 Parameterized complexity of maximum edge colorable subgraph. Zbl 07336139 Agrawal, Akanksha; Kundu, Madhumita; Sahu, Abhishek; Saurabh, Saket; Tale, Prafullkumar 2 2020 Approximation schemes via width/weight trade-offs on minor-free graphs. Zbl 07304165 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 2 2020 Improved FPT algorithms for deletion to forest-like structures. Zbl 07765392 Gowda, Kishen N.; Lonkar, Aditya; Panolan, Fahad; Patel, Vraj; Saurabh, Saket 2 2020 On the approximate compressibility of connected vertex cover. Zbl 1455.68144 Majumdar, Diptapriyo; Ramanujan, M. S.; Saurabh, Saket 2 2020 Going far from degeneracy. Zbl 1451.05229 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 2 2020 Linear representation of transversal matroids and gammoids parameterized by rank. Zbl 1433.68181 Misra, Pranabendu; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 1 2020 Approximation in (poly-) logarithmic space. Zbl 07559387 Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket 1 2020 On the complexity of singly connected vertex deletion. Zbl 07601011 Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket 1 2020 Parameterized complexity of geometric covering problems having conflicts. Zbl 1436.68145 Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha; Saurabh, Saket 1 2020 Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. Zbl 1434.68748 Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 1 2020 Faster graph bipartization. Zbl 1435.68241 Kolay, Sudeshna; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket 1 2020 On the parameterized complexity of maximum degree contraction problem. Zbl 07764117 Saurabh, Saket; Tale, Prafullkumar 1 2020 Kernelization. Theory of parameterized preprocessing. Zbl 1426.68003 Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 124 2019 Feedback vertex set inspired kernel for chordal vertex deletion. Zbl 1454.68088 Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 12 2019 Popular matching in roommates setting is NP-hard. Zbl 1432.68163 Gupta, Sushmita; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 12 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 11 2019 Interval vertex deletion admits a polynomial kernel. Zbl 1432.68185 Agrawal, Akanksha; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav 10 2019 Exact algorithms via monotone local search. Zbl 1427.68119 Fomin, Fedor V.; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket 10 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 8 2019 On the parameterized complexity of contraction to generalization of trees. Zbl 1435.68119 Agarwal, Akanksha; Saurabh, Saket; Tale, Prafullkumar 8 2019 Split contraction: the untold story. Zbl 1496.68260 Agrawal, Akanksha; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 7 2019 Subset feedback vertex set in chordal and split graphs. Zbl 1429.68197 Philip, Geevarghese; Rajan, Varun; Saurabh, Saket; Tale, Prafullkumar 5 2019 Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS. Zbl 07152233 Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav 5 2019 Minimum bisection is fixed-parameter tractable. Zbl 1421.68069 Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michał; Saurabh, Saket 4 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 4 2019 Parameterized streaming algorithms for Min-Ones \(d\)-SAT. Zbl 07650305 Agrawal, Akanksha; Biswas, Arindam; Bonnet, Édouard; Brettell, Nick; Curticapean, Radu; Marx, Dániel; Miltzow, Tillmann; Raman, Venkatesh; Saurabh, Saket 4 2019 Exploring the kernelization borders for hitting cycles. Zbl 1520.68043 Agrawal, Akanksha; Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu; Saurabh, Saket 4 2019 Decomposition of map graphs with applications. Zbl 07561553 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 3 2019 Packing arc-disjoint cycles in tournaments. Zbl 07561671 Bessy, Stéphane; Bougeret, Marin; Krithika, R.; Sahu, Abhishek; Saurabh, Saket; Thiebaut, Jocelyn; Zehavi, Meirav 3 2019 Balanced stable marriage: how close is close enough? Zbl 1517.68143 Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav 3 2019 Parameterized algorithms and kernels for rainbow matching. Zbl 1422.68188 Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav 2 2019 Editing to connected \(f\)-degree graph. Zbl 1429.68189 Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket 2 2019 Packing cycles faster than Erdős-Pósa. Zbl 1419.05202 Lokshtanov, Daniel; Mouawad, Amer E.; Saurabh, Saket; Zehavi, Meirav 2 2019 Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. Zbl 1431.68100 Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 2 2019 Balanced judicious bipartition is fixed-parameter tractable. Zbl 1425.05129 Lokshtanov, Daniel; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav 2 2019 On the parameterized complexity of edge-linked paths. Zbl 07121075 Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket 2 2019 Connecting the dots (with Minimum Crossings). Zbl 07559207 Agrawal, Akanksha; Guśpiel, Grzegorz; Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav 2 2019 A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. Zbl 1520.68123 Lokshtanov, Daniel; De Oliveira, Oliveira Mateus; Saurabh, Saket 2 2019 Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs. Zbl 1414.05128 Misra, Neeldhara; Panolan, Fahad; Rai, Ashutosh; Raman, Venkatesh; Saurabh, Saket 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 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 On the complexity of Mixed Dominating Set. Zbl 07121073 Madathil, Jayakrishnan; Panolan, Fahad; Sahu, Abhishek; Saurabh, Saket 1 2019 Path contraction faster than \(2^n\). Zbl 07561504 Agrawal, Akanksha; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Tale, Prafullkumar 1 2019 Covering vectors by spaces in perturbed graphic matroids and their duals. Zbl 07561552 Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 1 2019 Fully dynamic arboricity maintenance. Zbl 1441.68160 Banerjee, Niranka; Raman, Venkatesh; Saurabh, Saket 1 2019 Known algorithms on graphs of bounded treewidth are probably optimal. Zbl 1454.68110 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 24 2018 Slightly superexponential parameterized problems. Zbl 1393.68077 Lokshtanov, Daniel; Marx, Dániel; Saurabh, Saket 21 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 17 2018 Reconfiguration on sparse graphs. Zbl 1390.68351 Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket 16 2018 Deterministic truncation of linear matroids. Zbl 1440.68128 Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket 14 2018 Kernels for deletion to classes of acyclic digraphs. Zbl 1380.68207 Agrawal, Akanksha; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav 10 2018 Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164 Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 9 2018 Polynomial kernels for vertex cover parameterized by small degree modulators. Zbl 1419.05179 Majumdar, Diptapriyo; Raman, Venkatesh; Saurabh, Saket 9 2018 Reducing CMSO model checking to highly connected graphs. Zbl 1499.68203 Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav 9 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. 8 2018 Bivariate complexity analysis of Almost Forest Deletion. Zbl 1382.68122 Rai, Ashutosh; Saurabh, Saket 7 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 6 2018 Generalized pseudoforest deletion: algorithms and uniform kernel. Zbl 1384.05148 Philip, Geevarghese; Rai, Ashutosh; Saurabh, Saket 6 2018 Finding even subgraphs even faster. Zbl 1404.68050 Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket 6 2018 Long directed \((s,t)\)-path: FPT algorithm. Zbl 1478.68233 Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 6 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 5 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 5 2018 ...and 248 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,884 Authors 208 Saurabh, Saket 109 Fomin, Fedor V. 86 Lokshtanov, Daniel 83 Golovach, Petr A. 72 Zehavi, Meirav 68 Raman, Venkatesh 63 Niedermeier, Rolf 63 Sau, Ignasi 56 Thilikos, Dimitrios M. 53 Panolan, Fahad 53 Pilipczuk, Marcin L. 49 Jansen, Bart M. P. 48 Gutin, Gregory Z. 47 Pilipczuk, Michał 41 Komusiewicz, Christian 40 Kratsch, Stefan 38 Ramanujan, M. S. 37 Ganian, Robert 34 Marx, Dániel 34 Paulusma, Daniël 33 Agrawal, Akanksha 32 Misra, Neeldhara 32 Otachi, Yota 31 Bodlaender, Hans L. 30 Lampis, Michael 29 Fernau, Henning 28 Eiben, Eduard 27 Cygan, Marek 27 van Bevern, René 26 Knop, Dušan 26 Wahlström, Magnus 25 Ordyniak, Sebastian 25 Philip, Geevarghese 25 Tale, Prafullkumar 24 Nichterlein, André 24 Sorge, Manuel 24 Suchý, Ondřej 23 Kratsch, Dieter 23 Villanger, Yngve 23 Yeo, Anders 22 Bonnet, Edouard 22 Misra, Pranabendu 22 Mouawad, Amer E. 22 Wang, Jianxin 21 Chen, Jian-er 21 Fellows, Michael Ralph 21 Hanaka, Tesshu 21 Kolay, Sudeshna 20 Mnich, Matthias 20 Ono, Hirotaka 20 Paul, Christophe 20 Szeider, Stefan 20 Van Leeuwen, Erik Jan 19 Baste, Julien 19 Gaspers, Serge 19 Sharma, Roohani 19 Xiao, Mingyu 18 Heggernes, Pinar 18 Majumdar, Diptapriyo 18 Molter, Hendrik 18 Rzążewski, Paweł 17 Bredereck, Robert 17 Dabrowski, Konrad Kazimierz 17 Kanesh, Lawqueen 17 Kim, Eun Jung 17 Rosamond, Frances A. 17 Sikora, Florian 16 Feng, Qilong 16 Fluschnik, Till 16 Guo, Jiong 16 Hermelin, Danny 16 Reidl, Felix 16 Souza, Uéverton S. 15 Bang-Jensen, Jørgen 15 Belmonte, Rémy 15 Nederlof, Jesper 15 Paschos, Vangelis Th. 15 Rossmanith, Peter 15 Siebertz, Sebastian 15 Sommer, Frank 15 Weller, Mathias 14 Gupta, Sushmita 14 Jain, Pallavi 14 Koutecký, Martin 14 Krithika, R. 14 Lima, Paloma T. 14 Mertzios, George B. 14 Sikdar, Somnath 14 Subramani, Krishnan 14 van ’t Hof, Pim 13 Cao, Yixin 13 Jaffke, Lars 13 Johnson, Matthew 13 Kanj, Iyad A. 13 Liedloff, Mathieu 13 Rai, Ashutosh 13 Sahu, Abhishek 13 Wojciechowski, Piotr J. 13 Zschoche, Philipp 12 Ito, Takehiro ...and 1,784 more Authors all top 5 Cited in 111 Serials 263 Theoretical Computer Science 256 Algorithmica 129 Discrete Applied Mathematics 126 Journal of Computer and System Sciences 90 SIAM Journal on Discrete Mathematics 73 Theory of Computing Systems 61 Information Processing Letters 49 Journal of Combinatorial Optimization 31 SIAM Journal on Computing 27 Information and Computation 21 Artificial Intelligence 20 Discrete Mathematics 17 Journal of Graph Algorithms and Applications 17 Discrete Optimization 16 European Journal of Combinatorics 16 Mathematical Programming. Series A. Series B 14 Journal of Combinatorial Theory. Series B 11 Journal of Discrete Algorithms 8 Acta Informatica 8 Journal of Graph Theory 8 Networks 8 Annals of Operations Research 8 Journal of Scheduling 8 Discrete Mathematics, Algorithms and Applications 7 Graphs and Combinatorics 7 The Electronic Journal of Combinatorics 6 Computer Science Review 6 ACM Transactions on Computation Theory 5 Discrete & Computational Geometry 5 Computational Geometry 5 ACM Journal of Experimental Algorithmics 5 Algorithms 5 ACM Transactions on Algorithms 4 Operations Research Letters 4 International Journal of Foundations of Computer Science 4 The Journal of Artificial Intelligence Research (JAIR) 4 Annals of Mathematics and Artificial Intelligence 4 Fundamenta Informaticae 4 Optimization Letters 3 Mathematics of Operations Research 3 Discrete Mathematics and Theoretical Computer Science. DMTCS 3 Logical Methods in Computer Science 2 Applied Mathematics and Computation 2 Information Sciences 2 International Journal of Game Theory 2 Operations Research 2 Mathematical Social Sciences 2 Computers & Operations Research 2 Journal of Automated Reasoning 2 European Journal of Operational Research 2 Distributed Computing 2 The Journal of Analysis 2 Combinatorics, Probability and Computing 2 International Transactions in Operational Research 2 ACM Transactions on Computational Logic 2 4OR 2 RAIRO. Theoretical Informatics and Applications 1 Computer Methods in Applied Mechanics and Engineering 1 International Journal of Theoretical Physics 1 Israel Journal of Mathematics 1 Bulletin of Mathematical Biology 1 Chaos, Solitons and Fractals 1 Canadian Journal of Mathematics 1 Illinois Journal of Mathematics 1 Journal of Optimization Theory and Applications 1 Proceedings of the Japan Academy. Series A 1 Moscow University Computational Mathematics and Cybernetics 1 Social Choice and Welfare 1 Acta Mathematicae Applicatae Sinica. English Series 1 Journal of Symbolic Computation 1 Applied Mathematics Letters 1 MSCS. Mathematical Structures in 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 Computational Complexity 1 Computational and Applied Mathematics 1 Constraints 1 INFORMS Journal on Computing 1 Mathematical Problems in Engineering 1 Vietnam Journal of Mathematics 1 Journal of the ACM 1 Annals of Combinatorics 1 Data Mining and Knowledge Discovery 1 Journal of Discrete Mathematical Sciences & Cryptography 1 International Journal of Applied Mathematics and Computer Science 1 CEJOR. Central European Journal of Operations Research 1 RAIRO. Operations Research 1 Algebraic & Geometric Topology 1 Journal of Systems Science and Complexity 1 Theory and Practice of Logic Programming 1 JMMA. Journal of Mathematical Modelling and Algorithms 1 Quantum Information Processing 1 AKCE International Journal of Graphs and Combinatorics 1 Sibirskie Èlektronnye Matematicheskie Izvestiya 1 Proceedings of the Steklov Institute of Mathematics 1 Journal of Satisfiability, Boolean Modeling and Computation 1 Involve ...and 11 more Serials all top 5 Cited in 32 Fields 1,768 Computer science (68-XX) 1,190 Combinatorics (05-XX) 291 Operations research, mathematical programming (90-XX) 90 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 27 Mathematical logic and foundations (03-XX) 21 Biology and other natural sciences (92-XX) 14 Information and communication theory, circuits (94-XX) 11 Linear and multilinear algebra; matrix theory (15-XX) 8 Statistics (62-XX) 8 Numerical analysis (65-XX) 5 Number theory (11-XX) 5 Group theory and generalizations (20-XX) 5 Convex and discrete geometry (52-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 3 General algebraic systems (08-XX) 3 Manifolds and cell complexes (57-XX) 2 History and biography (01-XX) 2 Commutative algebra (13-XX) 2 Category theory; homological algebra (18-XX) 2 Algebraic topology (55-XX) 2 Probability theory and stochastic processes (60-XX) 2 Quantum theory (81-XX) 1 Functional analysis (46-XX) 1 Geometry (51-XX) 1 General topology (54-XX) 1 Mechanics of deformable solids (74-XX) 1 Fluid mechanics (76-XX) 1 Classical thermodynamics, heat transfer (80-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Relativity and gravitational theory (83-XX) 1 Systems theory; control (93-XX) 1 Mathematics education (97-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.