Edit Profile (opens in new tab) Sorge, Manuel Co-Author Distance Author ID: sorge.manuel Published as: Sorge, Manuel Documents Indexed: 60 Publications since 2011, including 3 Additional arXiv Preprints Co-Authors: 58 Co-Authors with 59 Joint Publications 1,223 Co-Co-Authors all top 5 Co-Authors 1 single-authored 20 Niedermeier, Rolf 17 Komusiewicz, Christian 17 van Bevern, René 9 Pilipczuk, Marcin L. 8 Kratsch, Stefan 8 Molter, Hendrik 8 Weller, Mathias 7 Chen, Jiehua 7 Suchý, Ondřej 6 Fluschnik, Till 6 Kanj, Iyad A. 4 Van Leeuwen, Erik Jan 3 Disser, Yann 3 Feldmann, Andreas Emil 3 Froese, Vincent 3 Hermelin, Danny 3 Masařík, Tomáš 3 Moser, Hannes 2 Bellitto, Thomas 2 Bulteau, Laurent 2 Grüttemeier, Niels 2 Hoffmann, Clemens 2 Li, Shaohua 2 Mertzios, George B. 2 Millani, Marcelo Garlet 2 Morik, Marco 2 Muzi, Irene 2 Nadara, Wojciech 2 Okrasa, Karolina 2 Rzążewski, Paweł 2 Walsh, Toby 1 Bredereck, Robert 1 Chmurovic, Adrian 1 Czerwiński, Wojciech 1 Ganian, Robert 1 Hartung, Sepp 1 Hatzel, Meike 1 Himmel, Anne-Sophie 1 Hüffner, Falk 1 Jogl, Fabian 1 Komosa, Paweł 1 Komusiwicz, Christian 1 Kowalik, Łukasz 1 Kunz, Pascal 1 Mucha, Marcin 1 Nichterlein, André 1 Nöllenburg, Martin 1 Pilipczuk, Michał 1 Schidler, André 1 Szeider, Stefan 1 Terziadis, Soeren 1 Villedieu, Anaïs 1 Wróblewski, Bartłomiej 1 Wu, Hsiang-Yun 1 Wulms, Jules J. H. M. 1 Wygocki, Piotr 1 Yedidsion, Harel 1 Zych-Pawlewicz, Anna all top 5 Serials 5 Journal of Computer and System Sciences 3 Algorithmica 3 SIAM Journal on Discrete Mathematics 2 Discrete Applied Mathematics 2 Journal of Combinatorial Optimization 2 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 Acta Informatica 1 Artificial Intelligence 1 Operations Research Letters 1 The Journal of Artificial Intelligence Research (JAIR) 1 Theory of Computing Systems 1 Journal of Discrete Algorithms 1 Discrete Optimization Fields 49 Computer science (68-XX) 27 Combinatorics (05-XX) 14 Operations research, mathematical programming (90-XX) 6 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 History and biography (01-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 43 Publications have been cited 193 times in 151 Documents Cited by ▼ Year ▼ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes. Zbl 1261.90081 Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel 20 2012 The complexity of arc routing problems. Zbl 1377.90114 van Bevern, René; Niedermeier, Rolf; Sorge, Manuel; Weller, Mathias 14 2014 An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Zbl 1317.05107 Komusiewicz, Christian; Sorge, Manuel 14 2015 A new view on rural postman based on Eulerian extension and matching. Zbl 1255.68076 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 12 2012 From few components to an Eulerian graph by adding ARCS. Zbl 1341.05144 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 9 2011 On the parameterized complexity of computing graph bisections. Zbl 1318.68098 van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej 9 2013 Finding dense subgraphs of sparse graphs. Zbl 1375.68067 Komusiewicz, Christian; Sorge, Manuel 9 2012 Polynomial-time data reduction for the subset interconnection design problem. Zbl 1326.05147 Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias 8 2015 Finding highly connected subgraphs. Zbl 1432.68358 Hüffner, Falk; Komusiewicz, Christian; Sorge, Manuel 8 2015 How hard is it to satisfy (almost) all roommates? Zbl 1499.68131 Chen, Jiehua; Hermelin, Danny; Sorge, Manuel; Yedidsion, Harel 7 2018 Constant-factor approximations for capacitated arc routing without triangle inequality. Zbl 1408.90044 van Bevern, René; Hartung, Sepp; Nichterlein, André; Sorge, Manuel 6 2014 The parameterized complexity of the minimum shared edges problem. Zbl 1366.68090 Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf; Sorge, Manuel 5 2015 Exploiting hidden structure in selecting dimensions that distinguish vectors. Zbl 1333.68143 Froese, Vincent; van Bevern, René; Niedermeier, Rolf; Sorge, Manuel 5 2016 The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Zbl 1454.90104 van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 5 2018 Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Zbl 1380.68227 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 4 2018 On the parameterized complexity of computing balanced partitions in graphs. Zbl 1329.68150 van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej 4 2015 Cluster editing in multi-layer and temporal graphs. Zbl 07561378 Chen, Jiehua; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 4 2018 A new view on rural postman based on Eulerian extension and matching. Zbl 1344.68091 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 3 2011 The complexity of routing with collision avoidance. Zbl 1421.68076 Fluschnik, Till; Morik, Marco; Sorge, Manuel 3 2019 On computing centroids according to the \(p\)-norms of Hamming distance vectors. Zbl 07525465 Chen, Jiehua; Hermelin, Danny; Sorge, Manuel 3 2019 Planarizing graphs and their drawings by vertex splitting. Zbl 07727764 Nöllenburg, Martin; Sorge, Manuel; Terziadis, Soeren; Villedieu, Anaïs; Wu, Hsiang-Yun; Wulms, Jules 3 2023 Efficient algorithms for measuring the funnel-likeness of DAGs. Zbl 1434.05148 Garlet Millani, Marcelo; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 3 2020 Solving partition problems almost always requires pushing many vertices around. Zbl 1524.05240 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 3 2018 The parameterized complexity of the minimum shared edges problem. Zbl 1431.68052 Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf; Sorge, Manuel 3 2019 Finding secluded places of special interest in graphs. Zbl 1398.68408 van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 2 2017 Exploiting a hypergraph model for finding Golomb rulers. Zbl 1360.68520 Sorge, Manuel; Moser, Hannes; Niedermeier, Rolf; Weller, Mathias 2 2014 \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments. Zbl 1386.68076 van Bevern, René; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Walsh, Toby 2 2016 On kernelization and approximation for the vector connectivity problem. Zbl 1372.68137 Kratsch, Stefan; Sorge, Manuel 2 2015 Twins in subdivision drawings of hypergraphs. Zbl 1483.68262 van Bevern, René; Kanj, Iyad; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel 2 2016 Approximation algorithms for mixed, windy, and capacitated arc routing problems. Zbl 1432.90024 van Bevern, René; Komusiewicz, Christian; Sorge, Manuel 2 2015 A parameterized complexity analysis of combinatorial feature selection problems. Zbl 1333.68142 Froese, Vincent; van Bevern, René; Niedermeier, Rolf; Sorge, Manuel 2 2013 Exploiting a hypergraph model for finding Golomb rulers. Zbl 1360.68519 Sorge, Manuel; Moser, Hannes; Niedermeier, Rolf; Weller, Mathias 2 2012 Efficient algorithms for measuring the funnel-likeness of DAGs. Zbl 1404.90133 Millani, Marcelo Garlet; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 2 2018 Effective and efficient data reduction for the subset interconnection design problem. Zbl 1303.68091 Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias 2 2013 The minimum feasible tileset problem. Zbl 1417.68285 Disser, Yann; Kratsch, Stefan; Sorge, Manuel 1 2015 The complexity of routing with few collisions. Zbl 1495.68168 Fluschnik, Till; Morik, Marco; Sorge, Manuel 1 2017 Assessing the computational complexity of multi-layer subgraph detection. Zbl 1486.68126 Bredereck, Robert; Komusiewicz, Christian; Kratsch, Stefan; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 1 2017 The parameterized complexity of centrality improvement in networks. Zbl 1444.68080 Hoffmann, Clemens; Molter, Hendrik; Sorge, Manuel 1 2018 The PACE 2020 parameterized algorithms and computational experiments challenge: treedepth. Zbl 07764128 Kowalik, Łukasz; Mucha, Marcin; Nadara, Wojciech; Pilipczuk, Marcin; Sorge, Manuel; Wygocki, Piotr 1 2020 Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. Zbl 1477.68210 Bulteau, Laurent; Grüttemeier, Niels; Komusiewicz, Christian; Sorge, Manuel 1 2021 Solving partition problems almost always requires pushing many vertices around. Zbl 1434.05123 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 1 2020 Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. Zbl 1477.68209 Bulteau, Laurent; Grüttemeier, Niels; Komusiewicz, Christian; Sorge, Manuel 1 2019 h-index manipulation by undoing merges. Zbl 1394.68194 van Bevern, René; Komusiwicz, Christian; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel; Walsh, Toby 1 2016 Planarizing graphs and their drawings by vertex splitting. Zbl 07727764 Nöllenburg, Martin; Sorge, Manuel; Terziadis, Soeren; Villedieu, Anaïs; Wu, Hsiang-Yun; Wulms, Jules 3 2023 Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. Zbl 1477.68210 Bulteau, Laurent; Grüttemeier, Niels; Komusiewicz, Christian; Sorge, Manuel 1 2021 Efficient algorithms for measuring the funnel-likeness of DAGs. Zbl 1434.05148 Garlet Millani, Marcelo; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 3 2020 The PACE 2020 parameterized algorithms and computational experiments challenge: treedepth. Zbl 07764128 Kowalik, Łukasz; Mucha, Marcin; Nadara, Wojciech; Pilipczuk, Marcin; Sorge, Manuel; Wygocki, Piotr 1 2020 Solving partition problems almost always requires pushing many vertices around. Zbl 1434.05123 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 1 2020 The complexity of routing with collision avoidance. Zbl 1421.68076 Fluschnik, Till; Morik, Marco; Sorge, Manuel 3 2019 On computing centroids according to the \(p\)-norms of Hamming distance vectors. Zbl 07525465 Chen, Jiehua; Hermelin, Danny; Sorge, Manuel 3 2019 The parameterized complexity of the minimum shared edges problem. Zbl 1431.68052 Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf; Sorge, Manuel 3 2019 Your rugby mates don’t need to know your colleagues: triadic closure with edge colors. Zbl 1477.68209 Bulteau, Laurent; Grüttemeier, Niels; Komusiewicz, Christian; Sorge, Manuel 1 2019 How hard is it to satisfy (almost) all roommates? Zbl 1499.68131 Chen, Jiehua; Hermelin, Danny; Sorge, Manuel; Yedidsion, Harel 7 2018 The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Zbl 1454.90104 van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 5 2018 Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Zbl 1380.68227 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 4 2018 Cluster editing in multi-layer and temporal graphs. Zbl 07561378 Chen, Jiehua; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 4 2018 Solving partition problems almost always requires pushing many vertices around. Zbl 1524.05240 Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan 3 2018 Efficient algorithms for measuring the funnel-likeness of DAGs. Zbl 1404.90133 Millani, Marcelo Garlet; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 2 2018 The parameterized complexity of centrality improvement in networks. Zbl 1444.68080 Hoffmann, Clemens; Molter, Hendrik; Sorge, Manuel 1 2018 Finding secluded places of special interest in graphs. Zbl 1398.68408 van Bevern, René; Fluschnik, Till; Mertzios, George B.; Molter, Hendrik; Sorge, Manuel; Suchý, Ondřej 2 2017 The complexity of routing with few collisions. Zbl 1495.68168 Fluschnik, Till; Morik, Marco; Sorge, Manuel 1 2017 Assessing the computational complexity of multi-layer subgraph detection. Zbl 1486.68126 Bredereck, Robert; Komusiewicz, Christian; Kratsch, Stefan; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel 1 2017 Exploiting hidden structure in selecting dimensions that distinguish vectors. Zbl 1333.68143 Froese, Vincent; van Bevern, René; Niedermeier, Rolf; Sorge, Manuel 5 2016 \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments. Zbl 1386.68076 van Bevern, René; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Walsh, Toby 2 2016 Twins in subdivision drawings of hypergraphs. Zbl 1483.68262 van Bevern, René; Kanj, Iyad; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel 2 2016 h-index manipulation by undoing merges. Zbl 1394.68194 van Bevern, René; Komusiwicz, Christian; Molter, Hendrik; Niedermeier, Rolf; Sorge, Manuel; Walsh, Toby 1 2016 An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Zbl 1317.05107 Komusiewicz, Christian; Sorge, Manuel 14 2015 Polynomial-time data reduction for the subset interconnection design problem. Zbl 1326.05147 Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias 8 2015 Finding highly connected subgraphs. Zbl 1432.68358 Hüffner, Falk; Komusiewicz, Christian; Sorge, Manuel 8 2015 The parameterized complexity of the minimum shared edges problem. Zbl 1366.68090 Fluschnik, Till; Kratsch, Stefan; Niedermeier, Rolf; Sorge, Manuel 5 2015 On the parameterized complexity of computing balanced partitions in graphs. Zbl 1329.68150 van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej 4 2015 On kernelization and approximation for the vector connectivity problem. Zbl 1372.68137 Kratsch, Stefan; Sorge, Manuel 2 2015 Approximation algorithms for mixed, windy, and capacitated arc routing problems. Zbl 1432.90024 van Bevern, René; Komusiewicz, Christian; Sorge, Manuel 2 2015 The minimum feasible tileset problem. Zbl 1417.68285 Disser, Yann; Kratsch, Stefan; Sorge, Manuel 1 2015 The complexity of arc routing problems. Zbl 1377.90114 van Bevern, René; Niedermeier, Rolf; Sorge, Manuel; Weller, Mathias 14 2014 Constant-factor approximations for capacitated arc routing without triangle inequality. Zbl 1408.90044 van Bevern, René; Hartung, Sepp; Nichterlein, André; Sorge, Manuel 6 2014 Exploiting a hypergraph model for finding Golomb rulers. Zbl 1360.68520 Sorge, Manuel; Moser, Hannes; Niedermeier, Rolf; Weller, Mathias 2 2014 On the parameterized complexity of computing graph bisections. Zbl 1318.68098 van Bevern, René; Feldmann, Andreas Emil; Sorge, Manuel; Suchý, Ondřej 9 2013 A parameterized complexity analysis of combinatorial feature selection problems. Zbl 1333.68142 Froese, Vincent; van Bevern, René; Niedermeier, Rolf; Sorge, Manuel 2 2013 Effective and efficient data reduction for the subset interconnection design problem. Zbl 1303.68091 Chen, Jiehua; Komusiewicz, Christian; Niedermeier, Rolf; Sorge, Manuel; Suchý, Ondřej; Weller, Mathias 2 2013 Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes. Zbl 1261.90081 Moser, Hannes; Niedermeier, Rolf; Sorge, Manuel 20 2012 A new view on rural postman based on Eulerian extension and matching. Zbl 1255.68076 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 12 2012 Finding dense subgraphs of sparse graphs. Zbl 1375.68067 Komusiewicz, Christian; Sorge, Manuel 9 2012 Exploiting a hypergraph model for finding Golomb rulers. Zbl 1360.68519 Sorge, Manuel; Moser, Hannes; Niedermeier, Rolf; Weller, Mathias 2 2012 From few components to an Eulerian graph by adding ARCS. Zbl 1341.05144 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 9 2011 A new view on rural postman based on Eulerian extension and matching. Zbl 1344.68091 Sorge, Manuel; van Bevern, René; Niedermeier, Rolf; Weller, Mathias 3 2011 all cited Publications top 5 cited Publications all top 5 Cited by 259 Authors 23 van Bevern, René 21 Niedermeier, Rolf 21 Sorge, Manuel 18 Komusiewicz, Christian 12 Fluschnik, Till 6 Gutin, Gregory Z. 6 Koana, Tomohiro 6 Nichterlein, André 5 Jansen, Bart M. P. 5 Kanj, Iyad A. 5 Sommer, Frank 4 Bentert, Matthias 4 Dondi, Riccardo 4 Froese, Vincent 4 Kratsch, Stefan 4 Molter, Hendrik 4 Pilipczuk, Marcin L. 4 Tsidulko, Oxana Yu. 4 Wahlström, Magnus 4 Zehavi, Meirav 4 Zschoche, Philipp 3 Dar, Muhammad Abid 3 Eiben, Eduard 3 Fischer, Andreas 3 Fujito, Toshihiro 3 Golovach, Petr A. 3 Hermelin, Danny 3 Knop, Dušan 3 Koutecký, Martin 3 Lokshtanov, Daniel 3 Martinovic, John 3 Sau, Ignasi 3 Saurabh, Saket 3 Scheithauer, Guntram 3 Smirnov, Pavel V. 3 Tu, Jianhua 3 Weller, Mathias 3 Yeo, Anders 3 Yu, Wei 2 Bao, Xiaoguang 2 Bläsius, Thomas 2 Bodlaender, Hans L. 2 Bredereck, Robert 2 Bulteau, Laurent 2 Butenko, Sergiy I. 2 Chang, Maw-Shang 2 Chen, Li-Hsuan 2 Cordasco, Gennaro 2 Cseh, Ágnes 2 Cygan, Marek 2 de Kroon, Jari J. H. 2 Disser, Yann 2 Donkers, Huib 2 Feldmann, Andreas Emil 2 Friedrich, Tobias 2 Ganian, Robert 2 Gargano, Luisa 2 Gupta, Sushmita 2 Havet, Frédéric 2 Heggernes, Pinar 2 Hüffner, Falk 2 Hung, Ling-Ju 2 Irving, Robert W. 2 Konstantinidis, Athanasios L. 2 Lima, Paloma T. 2 Mauri, Giancarlo 2 Mazauric, Dorian 2 Montealegre, Pedro 2 Montejano, Luis Pedro 2 Mouawad, Amer E. 2 Nöllenburg, Martin 2 Onn, Shmuel 2 Ordyniak, Sebastian 2 Papadopoulos, Charis 2 Paschos, Vangelis Th. 2 Pilipczuk, Michał 2 Pyatkin, Artëm Valer’evich 2 Rescigno, Adele Anna 2 Rossmanith, Peter 2 Rötzschke, Martin 2 Schirneck, Martin 2 Schubert, Carsten 2 Suchý, Ondřej 2 Van Leeuwen, Erik Jan 2 Villedieu, Anaïs 2 Watrigant, Rémi 2 Wrochna, Marcin 2 Wu, Lidong 2 Zoppis, Italo 1 Afanasev, Vsevolod A. 1 Ahmed, Reyan 1 An, Zhao 1 Armaselu, Bogdan 1 Balasubramaniam, Chitra 1 Balasundaram, Balabhaskar 1 Bang-Jensen, Jørgen 1 Bannach, Max 1 Barbato, Michele 1 Baril, Ambroise 1 Berndt, Sebastian ...and 159 more Authors all top 5 Cited in 34 Serials 20 Algorithmica 14 Journal of Computer and System Sciences 8 Discrete Applied Mathematics 8 Theoretical Computer Science 6 Theory of Computing Systems 5 SIAM Journal on Discrete Mathematics 5 Journal of Combinatorial Optimization 4 Information Processing Letters 4 Discrete Optimization 4 Algorithms 3 Operations Research Letters 2 Networks 2 SIAM Journal on Computing 2 Information and Computation 2 Computers & Operations Research 2 Journal of Graph Algorithms and Applications 2 Journal of Discrete Algorithms 1 Acta Informatica 1 Artificial Intelligence 1 Applied Mathematics and Computation 1 Optimization 1 Annals of Operations Research 1 European Journal of Operational Research 1 Historia Mathematica 1 Mathematical Programming. Series A. Series B 1 Computational Optimization and Applications 1 Discussiones Mathematicae. Graph Theory 1 Constraints 1 INFORMS Journal on Computing 1 Mathematical Methods of Operations Research 1 Trudy Instituta Matematiki 1 Sibirskie Èlektronnye Matematicheskie Izvestiya 1 Logical Methods in Computer Science 1 Computer Science Review all top 5 Cited in 8 Fields 116 Computer science (68-XX) 70 Combinatorics (05-XX) 45 Operations research, mathematical programming (90-XX) 10 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 4 Biology and other natural sciences (92-XX) 2 Statistics (62-XX) 1 History and biography (01-XX) 1 Mathematical logic and foundations (03-XX) Citations by Year