Edit Profile (opens in new tab) Golovach, Petr A. Compute Distance To: Compute Author ID: golovach.petr-a Published as: Golovach, Petr A.; Golovach, P. A.; Golovach, Petr; Golovach, P. more...less Homepage: https://folk.uib.no/pgo041/ External Links: Math-Net.Ru · dblp · IdRef · theses.fr Documents Indexed: 268 Publications since 1986 2 Contributions as Editor Co-Authors: 109 Co-Authors with 247 Joint Publications 2,751 Co-Co-Authors all top 5 Co-Authors 23 single-authored 98 Fomin, Fedor V. 78 Paulusma, Daniël 44 Kratsch, Dieter 34 Heggernes, Pinar 30 Thilikos, Dimitrios M. 28 Saurabh, Saket 22 Lokshtanov, Daniel 16 Kratochvíl, Jan 15 van ’t Hof, Pim 13 Song, Jian 12 Broersma, Hajo J. 12 Kamiński, Marcin Marek 11 Fiala, Jiří 10 Panolan, Fahad 10 Zehavi, Meirav 9 Van Leeuwen, Erik Jan 8 Couturier, Jean-Francois 8 Lima, Paloma T. 8 Stewart, Anthony 8 Villanger, Yngve 7 Liedloff, Mathieu 7 Martin, Barnaby D. 7 Petrov, Nikolai Nikolaevich 6 Belmonte, Rémy 6 Dabrowski, Konrad Kazimierz 5 Pilipczuk, Michał 5 Sayadi, Mohamed Yosri 4 Dragan, Feodor F. 4 Kanté, Mamadou Moustapha 4 Karpov, Nikolay 4 Kulikov, Alexander S. 4 Lidický, Bernard 4 Papadopoulos, Charis 4 Ramanujan, M. S. 3 Brause, Christoph 3 Cochefert, Manfred 3 Johnson, Matthew 3 Misra, Pranabendu 3 Saei, Reza 3 Smith, Siani 2 Basavaraju, Manu 2 Biró, Peter 2 Bliznets, Ivan A. 2 Bomhoff, Matthijs 2 Chaplick, Steven 2 Chitnis, Rajesh Hemant 2 Crespelle, Christophe 2 dos Santos, Vinícius Fernandes 2 Gaspers, Serge 2 Kaiser, Tomáš 2 Kern, Walter 2 Knop, Dušan 2 Konstantinidis, Athanasios L. 2 Lindzey, Nathan 2 Maniatis, Spyridon 2 Manne, Fredrik 2 McConnell, Ross M. 2 Meister, Daniel 2 Mertzios, George B. 2 Mihalák, Matúš 2 Montealegre, Pedro 2 Nederlof, Jesper 2 Patel, Viresh 2 Paul, Christophe 2 Proskurowski, Andrzej 2 Purohit, Nidhi 2 Rafiey, Arash 2 Raymond, Jean-Florent 2 Ries, Bernard 2 Sæther, Sigve Hortemo 2 Simonov, Kirill 2 Spinrad, Jeremy P. 2 Stamoulis, Giannos 2 Stewart, Iain A. 2 Strømme, Torstein J. F. 2 Suchan, Karol 2 Suchý, Ondřej 2 Vicari, Elias 2 Widmayer, Peter 2 Woeginger, Gerhard 2 Zeman, Peter 1 Abramovskaya, Tat’yana Viktorovna 1 Bandyapadhyay, Sayan 1 Bodlaender, Hans L. 1 Bonato, Anthony 1 Feghali, Carl 1 Fraigniaud, Pierre 1 Hahn, Gena 1 Hall, Alex 1 Hall, Alexander 1 Komusiewicz, Christian 1 Korhonen, Janne H. 1 Krithika, R. 1 Lê Văn Băng 1 Lochet, William 1 Mihai, Rodica 1 Nisse, Nicolas 1 Ochem, Pascal 1 Otachi, Yota 1 Prałat, Paweł ...and 9 more Co-Authors all top 5 Serials 23 Theoretical Computer Science 19 Discrete Applied Mathematics 17 Algorithmica 14 SIAM Journal on Discrete Mathematics 8 Journal of Computer and System Sciences 7 Theory of Computing Systems 5 Vestnik Leningrad University. Mathematics 5 Vestnik Syktyvkarskogo Universiteta. Seriya 1. Matematika, Mekhanika, Informatika 4 Information Processing Letters 4 European Journal of Combinatorics 4 Vestnik Leningradskogo Universiteta. Seriya 1. Matematika, Mekhanika, Astronomiya 4 Discrete Mathematics and Applications 3 Journal of Graph Theory 3 Information and Computation 3 Vestnik St. Petersburg University. Mathematics 3 ACM Transactions on Algorithms 2 Acta Informatica 2 SIAM Journal on Computing 2 Cybernetics and Systems Analysis 2 Journal of Discrete Algorithms 1 Discrete Mathematics 1 Differential Equations 1 Journal of Combinatorial Theory. Series B 1 Mathematical Social Sciences 1 Diskretnaya Matematika 1 Journal of Mathematical Sciences (New York) 1 The Electronic Journal of Combinatorics 1 International Journal of Mathematics, Game Theory and Algebra 1 Data Mining and Knowledge Discovery 1 ACM Transactions on Computational Logic 1 Discrete Optimization 1 LIPIcs – Leibniz International Proceedings in Informatics 1 Computability 1 ACM Transactions on Computation Theory all top 5 Fields 216 Computer science (68-XX) 212 Combinatorics (05-XX) 22 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 12 Operations research, mathematical programming (90-XX) 3 Linear and multilinear algebra; matrix theory (15-XX) 3 Statistics (62-XX) 2 General and overarching topics; collections (00-XX) 1 Mathematical logic and foundations (03-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 212 Publications have been cited 1,337 times in 822 Documents Cited by ▼ Year ▼ A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian 69 2017 Complexity of the packing coloring problem for trees. Zbl 1219.05185Fiala, Jiří; Golovach, Petr A. 41 2010 Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 35 2012 Pursuing a fast robber on a graph. Zbl 1192.91027Fomin, Fedor V.; Golovach, Petr A.; Kratochvíl, Jan; Nisse, Nicolas; Suchan, Karol 34 2010 The capture time of a graph. Zbl 1177.91056Bonato, A.; Golovach, P.; Hahn, G.; Kratochvíl, J. 34 2009 Intractability of clique-width parameterizations. Zbl 1207.68161Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 34 2010 Parameterized complexity of coloring problems: treewidth versus vertex cover. Zbl 1216.68127Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan 32 2011 Contraction obstructions for treewidth. Zbl 1223.05022Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M. 26 2011 Closing complexity gaps for coloring problems on \(H\)-free graphs. Zbl 1295.05105Golovach, Petr A.; Paulusma, Daniël; Song, Jian 23 2014 Algorithmic lower bounds for problems parameterized by clique-width. Zbl 1288.05269Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 23 2010 Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 22 2013 Distance constrained labelings of graphs of bounded treewidth. Zbl 1082.68080Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan 20 2005 4-coloring \(H\)-free graphs when \(H\) is small. Zbl 1259.05061Golovach, Petr A.; Paulusma, Daniël; Song, Jian 20 2013 Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J. 20 2007 Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 20 2014 Coloring graphs without short cycles and long induced paths. Zbl 1284.05098Golovach, Petr A.; Paulusma, Daniël; Song, Jian 18 2014 Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 17 2012 Paths of bounded length and their cuts: parameterized complexity and algorithms. Zbl 1248.90071Golovach, Petr A.; Thilikos, Dimitrios M. 16 2011 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel 16 2014 Obtaining planarity by contracting few edges. Zbl 1260.68156Golovach, Petr A.; Van ’t Hof, Pim; Paulusma, Daniël 15 2013 Graph searching and interval completion. Zbl 0972.05047Fomin, Fedor V.; Golovach, Petr A. 15 2000 Parameterized complexity for domination problems on degenerate graphs. Zbl 1202.68278Golovach, Petr A.; Villanger, Yngve 15 2008 Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël 14 2014 Contraction bidimensionality: the accurate picture. Zbl 1256.05202Fomin, Fedor V.; Golovach, Petr; Thilikos, Dimitrios M. 13 2009 Computational complexity of the distance constrained labeling problem for trees (extended abstract). Zbl 1153.68390Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan 13 2008 Parameterized algorithms to preserve connectivity. Zbl 1412.68078Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket 13 2014 An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve 13 2015 Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve 12 2016 Solutions for the stable roommates problem with payments. Zbl 1341.05106Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël 12 2012 List coloring in the absence of a linear forest. Zbl 1307.05068Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 12 2015 Subset feedback vertex sets in chordal graphs. Zbl 1298.05302Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza 12 2014 Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 11 2009 Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve 11 2018 List coloring in the absence of two subgraphs. Zbl 1283.05096Golovach, Petr A.; Paulusma, Daniël 11 2014 Solutions for the stable roommates problem with payments. Zbl 1422.91546Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël 11 2014 Parameterized algorithms for finding square roots. Zbl 1332.05136Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 10 2016 Metric dimension of bounded tree-length graphs. Zbl 1371.68103Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. 10 2017 On the parameterized complexity of cutting a few vertices from a graph. Zbl 1398.68231Fomin, Fedor V.; Golovach, Petr A.; Korhonen, Janne H. 10 2013 Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej 10 2015 Coloring graphs characterized by a forbidden subgraph. Zbl 1303.05061Golovach, Petr A.; Paulusma, Daniël; Ries, Bernard 10 2015 Parameterized algorithm for eternal vertex cover. Zbl 1234.68150Fomin, Fedor V.; Gaspers, Serge; Golovach, Petr A.; Kratsch, Dieter; Saurabh, Saket 9 2010 Induced disjoint paths in AT-free graphs. Zbl 1357.68084Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 9 2012 Clique-width. III: Hamiltonian cycle and the odd case of graph coloring. Zbl 1458.05245Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 9 2019 Finding clubs in graph classes. Zbl 1298.05092Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Rafiey, Arash 9 2014 Parameterized complexity of three edge contraction problems with degree constraints. Zbl 1360.68489Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël 9 2014 Enumerating minimal connected dominating sets in graphs of bounded chordality. Zbl 1339.05190Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter 8 2016 Parameterized complexity of generalized domination problems. Zbl 1241.05108Golovach, Petr A.; Kratochvíl, Jan; Suchý, Ondřej 8 2012 Backbone colorings for networks. Zbl 1255.05076Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J. 8 2003 On the tractability of optimization problems on \(H\)-graphs. Zbl 1447.05142Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent 8 2020 Clique-width: on the price of generality. Zbl 1421.68125Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 8 2009 Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 8 2018 Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 8 2013 Editing to a graph of given degrees. Zbl 1322.68142Golovach, Petr A. 8 2015 Metric dimension of bounded width graphs. Zbl 1466.68054Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. 8 2015 Computing vertex-surjective homomorphisms to partially reflexive trees. Zbl 1251.05031Golovach, Petr A.; Paulusma, Daniël; Song, Jian 7 2012 Spanners of bounded degree graphs. Zbl 1260.68154Fomin, Fedor V.; Golovach, Petr A.; van Leeuwen, Erik Jan 7 2011 Increasing the minimum degree of a graph by contractions. Zbl 1296.05185Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. 7 2013 Editing to a connected graph of given degrees. Zbl 1426.68122Golovach, Petr A. 7 2014 Finding contractions and induced minors in chordal graphs via disjoint paths. Zbl 1350.68129Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël 7 2011 List coloring in the absence of a linear forest. Zbl 1305.05073Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 7 2011 On recognition of threshold tolerance graphs and their complements. Zbl 1350.05054Golovach, Petr A.; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vinícius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz 6 2017 Parameterized complexity of coloring problems: treewidth versus vertex cover (extended abstract). Zbl 1241.68071Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan 6 2009 Choosability of \(P _{5}\)-free graphs. Zbl 1250.68127Golovach, Petr A.; Heggernes, Pinar 6 2009 Parameterized complexity of the spanning tree congestion problem. Zbl 1253.68163Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; van Leeuwen, Erik Jan 6 2012 Spanners in sparse graphs. Zbl 1234.68149Dragan, Feodor F.; Fomin, Fedor V.; Golovach, Petr A. 6 2011 Induced packing of odd cycles in a planar graph. Zbl 1272.05157Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. 6 2009 Spanners in sparse graphs. Zbl 1153.68406Dragan, Feodor F.; Fomin, Fedor V.; Golovach, Petr A. 6 2008 Induced disjoint paths in circular-arc graphs in linear time. Zbl 1345.05051Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 6 2016 Sparse square roots. Zbl 1331.05204Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 6 2013 Search in graphs. Zbl 1118.91305Golovach, P. A.; Petrov, N. N.; Fomin, F. V. 5 2000 Minimal dominating sets in interval graphs and trees. Zbl 1350.05121Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve 5 2017 How to hunt an invisible rabbit on a graph. Zbl 1327.05233Abramovskaya, Tatjana V.; Fomin, Fedor V.; Golovach, Petr A.; Pilipczuk, Michał 5 2016 Parameterized complexity of secluded connectivity problems. Zbl 1378.68075Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S. 5 2017 Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1373.05008Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter 5 2018 Cops and robber with constraints. Zbl 1248.05120Fomin, Fedor V.; Golovach, Petr A.; Prałat, Paweł 5 2012 Computational complexity of generalized domination: A complete dichotomy for chordal graphs. Zbl 1141.68530Golovach, Petr; Kratochvíl, Jan 5 2007 Extremal search problem on graphs. Zbl 0713.90038Golovach, P. A. 5 1990 Search problems on 1-skeletons of regular polyhedrons. Zbl 0904.90091Fomin, F. V.; Golovach, P. A.; Petrov, N. N. 5 1997 Some generalizations of the problem on the search number of a graph. Zbl 0883.90149Golovach, P. A.; Petrov, N. N. 5 1995 Acyclic, star, and injective colouring: bounding the diameter. Zbl 07538588Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani 5 2021 Interval degree and bandwidth of a graph. Zbl 1021.05087Fomin, Fedor V.; Golovach, Petr A. 4 2003 A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2017 A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Induced disjoint paths in claw-free graphs. Zbl 1365.05279Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 4 2012 Finding vertex-surjective graph homomorphisms. Zbl 1253.68149Golovach, Petr A.; Lidický, Bernard; Martin, Barnaby; Paulusma, Daniël 4 2012 Containment relations in split graphs. Zbl 1237.05180Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. 4 2012 Distance three labelings of trees. Zbl 1241.05123Fiala, Jiří; Golovach, Petr A.; Kratochvíl, Jan; Lidický, Bernard; Paulusma, Daniël 4 2012 Computing square roots of graphs with low maximum degree. Zbl 1395.05083Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2018 Finding cactus roots in polynomial time. Zbl 1391.68051Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Search number, node search number, and vertex separator of a graph. Zbl 0727.90086Golovach, P. A. 4 1991 4-coloring \(H\)-free graphs when \(H\) is small. Zbl 1298.05117Golovach, Petr A.; Paulusma, Daniël; Song, Jian 4 2012 Editing to connected \(f\)-degree graph. Zbl 1388.68229Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket 4 2016 On an extremal search problem on graphs. Zbl 0704.90105Golovach, P. A. 4 1990 Parameterized complexity of the anchored \(k\)-core problem for directed graphs. Zbl 1336.68119Chitnis, Rajesh; Fomin, Fedor V.; Golovach, Petr A. 4 2016 Squares of low clique number. Zbl 1356.05102Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Editing to Eulerian graphs. Zbl 1360.68503Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniel 4 2014 Minimal trees with given vertex-search number. Zbl 0769.05030Golovach, P. A. 4 1992 How to guard a graph? Zbl 1183.91021Fomin, Fedor V.; Golovach, Petr A.; Hall, Alexander; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter 4 2008 Induced disjoint paths in claw-free graphs. Zbl 1311.05090Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 4 2015 On the tractability of optimization problems on \(H\)-graphs. Zbl 07378700Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent 4 2018 Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. Zbl 1479.68002Golovach, Petr A.; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang 3 2022 Induced disjoint paths in AT-free graphs. Zbl 1478.68240Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 2 2022 Partitioning \(H\)-free graphs of bounded diameter. Zbl 07575095Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani 1 2022 Parameterized complexity of elimination distance to first-order logic properties. Zbl 1505.03075Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. 1 2022 Lossy kernelization of same-size clustering. Zbl 07615733Bandyapadhyay, Sayan; Fomin, Fedor V.; Golovach, Petr A.; Purohit, Nidhi; Siminov, Kirill 1 2022 Acyclic, star, and injective colouring: bounding the diameter. Zbl 1491.05074Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani 1 2022 Acyclic, star, and injective colouring: bounding the diameter. Zbl 07538588Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani 5 2021 Subexponential parameterized algorithms and kernelization on almost chordal graphs. Zbl 1467.05254Fomin, Fedor V.; Golovach, Petr A. 1 2021 16th international symposium on parameterized and exact computation, IPEC 2021, Lisbon, Portugal, September 8–10, 2021. Zbl 1482.68023 1 2021 Parameterized \(k\)-clustering: tractability island. Zbl 1477.68132Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill 1 2021 On the tractability of optimization problems on \(H\)-graphs. Zbl 1447.05142Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent 8 2020 Subgraph complementation. Zbl 1439.05212Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. 3 2020 Approximation schemes for low-rank binary matrix approximation problems. Zbl 1454.68180Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket 3 2020 Parameterized aspects of strong subgraph closure. Zbl 1442.68168Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis 2 2020 On the parameterized complexity of graph modification to first-order logic properties. Zbl 1434.68208Fomin, Fedor V.; Golovach, Petr A.; Thilikos, Dimitrios M. 2 2020 Enumeration of minimal connected dominating sets for chordal graphs. Zbl 1437.05104Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza 2 2020 Parameterized low-rank binary matrix approximation. Zbl 1458.68075Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad 2 2020 Finding connected secluded subgraphs. Zbl 1443.68130Golovach, Petr A.; Heggernes, Pinar; Lima, Paloma T.; Montealegre, Pedro 1 2020 Graph square roots of small distance from degree one graphs. Zbl 07600769Golovach, Petr A.; Lima, Paloma T.; Papadopoulos, Charis 1 2020 Going far from degeneracy. Zbl 1451.05229Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav 1 2020 Clique-width. III: Hamiltonian cycle and the odd case of graph coloring. Zbl 1458.05245Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 9 2019 Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony 2 2019 Enumeration and maximum number of minimal dominating sets for chordal graphs. Zbl 1428.05139Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri 2 2019 Enumeration and maximum number of maximal irredundant sets for chordal graphs. Zbl 1416.05267Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri 2 2019 Enumeration of maximal irredundant sets for claw-free graphs. Zbl 1409.05109Golovach, Petr A.; Kratsch, Dieter; Sayadi, Mohamed Yosri 2 2019 Kernelization of graph Hamiltonicity: proper \(H\)-graphs. Zbl 1476.68197Chaplick, Steven; Fomin, Fedor V.; Golovach, Petr A.; Knop, Dušan; Zeman, Peter 2 2019 Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68082Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël 1 2019 Editing to connected \(f\)-degree graph. Zbl 1429.68189Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket 1 2019 Parameterized \(k\)-clustering: tractability island. Zbl 07650311Fomin, Fedor V.; Golovach, Petr A.; Simonov, Kirill 1 2019 Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1383.05162Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve 11 2018 Cliquewidth III: the odd case of graph coloring parameterized by cliquewidth. Zbl 1403.68164Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav 8 2018 Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1373.05008Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter 5 2018 Computing square roots of graphs with low maximum degree. Zbl 1395.05083Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2018 On the tractability of optimization problems on \(H\)-graphs. Zbl 07378700Fomin, Fedor V.; Golovach, Petr A.; Raymond, Jean-Florent 4 2018 Finding cactus roots in polynomial time. Zbl 1391.68052Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 3 2018 Covering vectors by spaces: regular matroids. Zbl 1400.05045Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 1 2018 Finding connected secluded subgraphs. Zbl 1443.68129Golovach, Petr A.; Heggernes, Pinar; Lima, Paloma T.; Montealegre, Pedro 1 2018 Parameterized aspects of strong subgraph closure. Zbl 1442.68169Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis 1 2018 A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian 69 2017 Metric dimension of bounded tree-length graphs. Zbl 1371.68103Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. 10 2017 On recognition of threshold tolerance graphs and their complements. Zbl 1350.05054Golovach, Petr A.; Heggernes, Pinar; Lindzey, Nathan; McConnell, Ross M.; dos Santos, Vinícius Fernandes; Spinrad, Jeremy P.; Szwarcfiter, Jayme Luiz 6 2017 Minimal dominating sets in interval graphs and trees. Zbl 1350.05121Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Villanger, Yngve 5 2017 Parameterized complexity of secluded connectivity problems. Zbl 1378.68075Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S. 5 2017 A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2017 Editing to a connected graph of given degrees. Zbl 1376.68066Golovach, Petr A. 3 2017 The parameterized complexity of graph cyclability. Zbl 1358.05077Golovach, Petr A.; Kamiński, Marcin; Maniatis, Spyridon; Thilikos, Dimitrios M. 3 2017 Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Zbl 1421.68081Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël 2 2017 Graph editing to a given degree sequence. Zbl 1356.68098Golovach, Petr A.; Mertzios, George B. 2 2017 Spanning circuits in regular matroids. Zbl 1410.68164Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 2 2017 Editing to a planar graph of given degrees. Zbl 1356.68096Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 1 2017 Covering vectors by spaces: regular matroids. Zbl 1441.68106Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 1 2017 Enumeration and maximum number of maximal irredundant sets for chordal graphs. Zbl 1483.05180Golovach, Petr A.; Kratsch, Dieter; Liedloff, Mathieu; Sayadi, Mohamed Yosri 1 2017 Enumeration of maximal irredundant sets for claw-free graphs. Zbl 1441.05015Golovach, Petr A.; Kratsch, Dieter; Sayadi, Mohamed Yosri 1 2017 Enumerating minimal dominating sets in chordal bipartite graphs. Zbl 1326.05105Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou M.; Kratsch, Dieter; Villanger, Yngve 12 2016 Parameterized algorithms for finding square roots. Zbl 1332.05136Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 10 2016 Enumerating minimal connected dominating sets in graphs of bounded chordality. Zbl 1339.05190Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter 8 2016 Induced disjoint paths in circular-arc graphs in linear time. Zbl 1345.05051Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 6 2016 How to hunt an invisible rabbit on a graph. Zbl 1327.05233Abramovskaya, Tatjana V.; Fomin, Fedor V.; Golovach, Petr A.; Pilipczuk, Michał 5 2016 A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Finding cactus roots in polynomial time. Zbl 1391.68051Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Editing to connected \(f\)-degree graph. Zbl 1388.68229Fomin, Fedor V.; Golovach, Petr; Panolan, Fahad; Saurabh, Saket 4 2016 Parameterized complexity of the anchored \(k\)-core problem for directed graphs. Zbl 1336.68119Chitnis, Rajesh; Fomin, Fedor V.; Golovach, Petr A. 4 2016 Squares of low clique number. Zbl 1356.05102Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony 4 2016 Enumeration and maximum number of minimal connected vertex covers in graphs. Zbl 1476.68208Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter 3 2016 Editing to Eulerian graphs. Zbl 1346.05150Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël 2 2016 An incremental polynomial time algorithm to enumerate all minimal edge dominating sets. Zbl 1330.05118Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Villanger, Yngve 13 2015 List coloring in the absence of a linear forest. Zbl 1307.05068Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël 12 2015 Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej 10 2015 Coloring graphs characterized by a forbidden subgraph. Zbl 1303.05061Golovach, Petr A.; Paulusma, Daniël; Ries, Bernard 10 2015 Editing to a graph of given degrees. Zbl 1322.68142Golovach, Petr A. 8 2015 Metric dimension of bounded width graphs. Zbl 1466.68054Belmonte, Rémy; Fomin, Fedor V.; Golovach, Petr A.; Ramanujan, M. S. 8 2015 Induced disjoint paths in claw-free graphs. Zbl 1311.05090Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 4 2015 Hadwiger number of graphs with small chordality. Zbl 1327.05322Golovach, Petr A.; Heggernes, Pinar; van ’t Hof, Pim; Paul, Christophe 3 2015 Editing to a planar graph of given degrees. Zbl 1356.68095Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël; Thilikos, Dimitrios M. 3 2015 Output-polynomial enumeration on graphs of bounded (local) linear MIM-width. Zbl 1382.05033Golovach, Petr A.; Heggernes, Pinar; Kanté, Mamadou Moustapha; Kratsch, Dieter; Sæther, Sigve H.; Villanger, Yngve 1 2015 Parameterized complexity of secluded connectivity problems. Zbl 1366.68091Fomin, Fedor V.; Golovach, Petr A.; Karpov, Nikolay; Kulikov, Alexander S. 1 2015 Closing complexity gaps for coloring problems on \(H\)-free graphs. Zbl 1295.05105Golovach, Petr A.; Paulusma, Daniël; Song, Jian 23 2014 Almost optimal lower bounds for problems parameterized by clique-width. Zbl 1306.05181Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket 20 2014 Coloring graphs without short cycles and long induced paths. Zbl 1284.05098Golovach, Petr A.; Paulusma, Daniël; Song, Jian 18 2014 Colouring of graphs with Ramsey-type forbidden subgraphs. Zbl 1279.68104Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel 16 2014 Detecting fixed patterns in chordal graphs in polynomial time. Zbl 1291.68173Belmonte, Rémy; Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Kamiński, Marcin; Paulusma, Daniël 14 2014 Parameterized algorithms to preserve connectivity. Zbl 1412.68078Basavaraju, Manu; Fomin, Fedor V.; Golovach, Petr; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket 13 2014 Subset feedback vertex sets in chordal graphs. Zbl 1298.05302Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza 12 2014 List coloring in the absence of two subgraphs. Zbl 1283.05096Golovach, Petr A.; Paulusma, Daniël 11 2014 Solutions for the stable roommates problem with payments. Zbl 1422.91546Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël 11 2014 Finding clubs in graph classes. Zbl 1298.05092Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Rafiey, Arash 9 2014 Parameterized complexity of three edge contraction problems with degree constraints. Zbl 1360.68489Belmonte, Rémy; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniël 9 2014 Editing to a connected graph of given degrees. Zbl 1426.68122Golovach, Petr A. 7 2014 Editing to Eulerian graphs. Zbl 1360.68503Dabrowski, Konrad K.; Golovach, Petr A.; van ’t Hof, Pim; Paulusma, Daniel 4 2014 Hadwiger number of graphs with small chordality. Zbl 1417.05209Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Paul, Christophe 3 2014 Parameterized complexity of connected even/odd subgraph problems. Zbl 1311.68075Fomin, Fedor V.; Golovach, Petr A. 2 2014 Induced disjoint paths in circular-arc graphs in linear time. Zbl 1417.05109Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan 2 2014 Editing to a graph of given degrees. Zbl 1380.68222Golovach, Petr A. 2 2014 Long circuits and large Euler subgraphs. Zbl 1298.05300Fomin, Fedor V.; Golovach, Petr A. 1 2014 Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 22 2013 4-coloring \(H\)-free graphs when \(H\) is small. Zbl 1259.05061Golovach, Petr A.; Paulusma, Daniël; Song, Jian 20 2013 Obtaining planarity by contracting few edges. Zbl 1260.68156Golovach, Petr A.; Van ’t Hof, Pim; Paulusma, Daniël 15 2013 On the parameterized complexity of cutting a few vertices from a graph. Zbl 1398.68231Fomin, Fedor V.; Golovach, Petr A.; Korhonen, Janne H. 10 2013 Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 8 2013 Increasing the minimum degree of a graph by contractions. Zbl 1296.05185Golovach, Petr A.; Kamiński, Marcin; Paulusma, Daniël; Thilikos, Dimitrios M. 7 2013 ...and 112 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,054 Authors 91 Paulusma, Daniël 89 Golovach, Petr A. 43 Fomin, Fedor V. 31 Thilikos, Dimitrios M. 30 Saurabh, Saket 29 Kratsch, Dieter 19 Dabrowski, Konrad Kazimierz 19 Lokshtanov, Daniel 18 Heggernes, Pinar 18 Malyshev, Dmitriĭ Sergeevich 18 Martin, Barnaby D. 15 Van Leeuwen, Erik Jan 14 Chudnovsky, Maria 14 Kratochvíl, Jan 12 Johnson, Matthew 12 Kamiński, Marcin Marek 12 Lima, Paloma T. 12 Panolan, Fahad 12 Smith, Siani 12 Telle, Jan Arne 11 Niedermeier, Rolf 11 Otachi, Yota 11 Ries, Bernard 10 Brešar, Boštjan 10 Hanaka, Tesshu 10 Kanté, Mamadou Moustapha 10 Liedloff, Mathieu 10 Ono, Hirotaka 10 Papadopoulos, Charis 10 Zhong, Mingxian 9 Fiala, Jiří 9 Ganian, Robert 9 Huang, Shenwei 9 Kwon, Ojoung 9 Nisse, Nicolas 9 Schaudt, Oliver 9 Song, Jian 9 Spirkl, Sophie Theresa 9 Tale, Prafullkumar 8 Bonato, Anthony 8 Broersma, Hajo J. 8 Gavenčiak, Tomáš 8 Gutin, Gregory Z. 8 Jansen, Bart M. P. 8 Klavžar, Sandi 8 Knop, Dušan 8 Lozin, Vadim Vladislavovich 8 Pilipczuk, Michał 8 Rzążewski, Paweł 8 Sau, Ignasi 8 van ’t Hof, Pim 7 Belmonte, Rémy 7 Couturier, Jean-Francois 7 Havet, Frédéric 7 Komusiewicz, Christian 7 Masařík, Tomáš 7 Nichterlein, André 7 Raman, Venkatesh 7 Uno, Takeaki 7 Wahlström, Magnus 6 Bu, Yuehua 6 Dragan, Feodor F. 6 Fluschnik, Till 6 Gurski, Frank 6 Koutecký, Martin 6 Lampis, Michael 6 Lidický, Bernard 6 Mertzios, George B. 6 Munaro, Andrea 6 Novotná, Jana 6 Ramanujan, M. S. 6 Rossmanith, Peter 6 Sanità, Laura 6 Souza, Uéverton S. 6 Stewart, Anthony 6 Suchý, Ondřej 6 Szeider, Stefan 6 Togni, Olivier 6 Uno, Yushi 5 Agrawal, Akanksha 5 Asahiro, Yuichi 5 Bergougnoux, Benjamin 5 Bodlaender, Hans L. 5 Brause, Christoph 5 Dereniowski, Dariusz 5 Ducoffe, Guillaume 5 Ferme, Jasmina 5 Gaspers, Serge 5 Gastineau, Nicolas 5 Hell, Pavol 5 Hliněný, Petr 5 Holub, Přemysl 5 Jaffke, Lars 5 Kim, Eun Jung 5 Klimošová, Tereza 5 Konstantinidis, Athanasios L. 5 Mehrabian, Abbas 5 Milanič, Martin 5 Misra, Pranabendu 5 Miyano, Eiji ...and 954 more Authors all top 5 Cited in 82 Serials 120 Theoretical Computer Science 114 Discrete Applied Mathematics 74 Algorithmica 33 SIAM Journal on Discrete Mathematics 30 Journal of Computer and System Sciences 29 Discrete Mathematics 22 Information Processing Letters 17 Theory of Computing Systems 13 Journal of Combinatorial Optimization 12 Graphs and Combinatorics 11 Information and Computation 11 The Electronic Journal of Combinatorics 10 European Journal of Combinatorics 9 Discussiones Mathematicae. Graph Theory 8 Journal of Combinatorial Theory. Series B 8 Discrete Optimization 7 Journal of Discrete Algorithms 6 Journal of Graph Theory 6 Optimization Letters 5 Applied Mathematics and Computation 5 SIAM Journal on Computing 5 Journal of Graph Algorithms and Applications 4 Games and Economic Behavior 4 Aequationes Mathematicae 4 Mathematical Programming. Series A. Series B 4 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 3 International Journal of Game Theory 3 European Journal of Operational Research 3 Vestnik St. Petersburg University. Mathematics 3 Computer Science Review 2 Acta Informatica 2 Journal of Economic Theory 2 Networks 2 Acta Mathematicae Applicatae Sinica. English Series 2 Computational Geometry 2 The Australasian Journal of Combinatorics 2 INFORMS Journal on Computing 2 AKCE International Journal of Graphs and Combinatorics 2 Discrete Mathematics, Algorithms and Applications 2 Games 1 American Mathematical Monthly 1 Artificial Intelligence 1 Algebra Universalis 1 Journal of Combinatorial Theory. Series A 1 Journal of Mathematical Economics 1 Mathematics of Operations Research 1 Operations Research 1 Moscow University Computational Mathematics and Cybernetics 1 Advances in Applied Mathematics 1 Bulletin of the Korean Mathematical Society 1 Combinatorica 1 Computers & Operations Research 1 International Journal of Foundations of Computer Science 1 Discrete Mathematics and Applications 1 Applied Mathematical Modelling 1 Automation and Remote Control 1 Combinatorics, Probability and Computing 1 Fractals 1 Filomat 1 Opuscula Mathematica 1 Complexity 1 Constraints 1 Journal of Scheduling 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 1 Annals of Combinatorics 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 Data Mining and Knowledge Discovery 1 Journal of Discrete Mathematical Sciences & Cryptography 1 RAIRO. Operations Research 1 International Game Theory Review 1 Central European Journal of Mathematics 1 South East Asian Journal of Mathematics and Mathematical Sciences 1 Logical Methods in Computer Science 1 Advances and Applications in Discrete Mathematics 1 Algorithms 1 Dynamic Games and Applications 1 Frontiers of Computer Science 1 Palestine Journal of Mathematics 1 Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternye Nauki 1 Journal of Dynamics and Games 1 Bulletin of the Hellenic Mathematical Society 1 Mathematical Foundations of Computing all top 5 Cited in 20 Fields 609 Combinatorics (05-XX) 519 Computer science (68-XX) 112 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 60 Operations research, mathematical programming (90-XX) 7 Mathematical logic and foundations (03-XX) 6 Information and communication theory, circuits (94-XX) 3 Order, lattices, ordered algebraic structures (06-XX) 3 Biology and other natural sciences (92-XX) 2 Calculus of variations and optimal control; optimization (49-XX) 2 Probability theory and stochastic processes (60-XX) 2 Statistics (62-XX) 2 Numerical analysis (65-XX) 1 History and biography (01-XX) 1 General algebraic systems (08-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Measure and integration (28-XX) 1 Ordinary differential equations (34-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Convex and discrete geometry (52-XX) 1 General topology (54-XX) Citations by Year