Hans L. Bodlaender - Author Profile

Edit Profile

Bodlaender, Hans L.

Author ID:	bodlaender.hans-l
Published as:	Bodlaender, Hans L.; Bodlaender, H. L.; Bodlaender, Hans; Bodlaender, H. more...less
Homepage:	http://www.staff.science.uu.nl/~bodla101/
External Links:	MGP · ORCID · Wikidata · dblp · GND · IdRef

Documents Indexed:	279 Publications since 1984, including 1 Book and 3 Additional arXiv Preprints
	8 Contributions as Editor
Reviewing Activity:	142 Reviews
Biographic References:	1 Publication
Co-Authors:	162 Co-Authors with 242 Joint Publications
	4,880 Co-Co-Authors

all top 5

Co-Authors

45	single-authored
20	Thilikos, Dimitrios M.
19	Fomin, Fedor V.
17	Kloks, Ton
15	van der Zanden, Tom C.
14	Koster, Arie M. C. A.
14	Kratsch, Dieter
13	Fellows, Michael Ralph
13	Van Leeuwen, Jan
11	Kratsch, Stefan
11	van Rooij, Johan M. M.
10	Penninkx, Eelko
9	Grigorev, Aleksandr
9	Jansen, Bart M. P.
9	Otachi, Yota
8	Jansen, Klaus
7	Nederlof, Jesper
6	de Berg, Mark Theodoor
6	De Fluiter, Babette Lucie Elisabeth
6	Heggernes, Pinar
6	Jaffke, Lars
6	Kisfaludi-Bak, Sándor
6	Ono, Hirotaka
6	Tan, Richard B.
6	Tel, Gerard
6	Telle, Jan Arne
6	van der Wegen, Marieke
6	Van Leeuwen, Erik Jan
6	Woeginger, Gerhard
5	Lokshtanov, Daniel
5	Wolle, Thomas
4	Downey, Rodney Graham
4	Hanaka, Tesshu
4	Niedermeier, Rolf
4	Rosamond, Frances A.
4	Serna Iglesias, Maria José
3	Bachoore, Emgad H.
3	Cornelissen, Gunther
3	Hagerup, Torben
3	Johnson, Matthew
3	Kant, Goos
3	Kolay, Sudeshna
3	Kwisthout, Johan
3	Langston, Michael A.
3	Marx, Dániel
3	Müller, Haiko
3	Paulusma, Daniël
3	van der Gaag, Linda C.
3	van Dijk, Thomas C.
3	van Kreveld, Marc J.
3	Yamazaki, Koichi
2	Alber, Jochen
2	Alt, Helmut
2	Bodewes, Jelco M.
2	Brandstädt, Andreas
2	Brettell, Nick
2	Broersma, Hajo J.
2	Cygan, Marek
2	Deogun, Jitender S.
2	Dinneen, Michael J.
2	Dorn, Frederic
2	Engelfriet, Joost
2	Fafianie, Stefan
2	Feremans, Corinne
2	Fernau, Henning
2	Gijswijt, Dion C.
2	Gilbert, John R.
2	Grigorieva, Nadejda V.
2	Groenland, Carla
2	Hafsteinsson, Hjálmtýr
2	Hallett, Michael T.
2	Hendriks, Albert
2	Hermelin, Danny
2	Katriel, Irit
2	Khoussainov, Bakhadyr M.
2	Kreuzen, Vincent J. C.
2	Mancini, Federico
2	Möhring, Rolf H.
2	Moran, Shlomo
2	Okamoto, Yoshio
2	Paesani, Giacomo
2	Pandey, Sukanya
2	Papadopoulos, Charis
2	Pieterse, Astrid
2	Pyatkin, Artëm Valer’evich
2	Ragan, Mark A.
2	Rao, Michaël
2	Rote, Günter
2	Rotics, Udi
2	Saurabh, Saket
2	Schoone, Anneke A.
2	Sitters, Rene A.
2	Smit, Harry
2	Spinrad, Jeremy P.
2	Swennenhuis, Céline M. F.
2	Thomassé, Stéphan
2	Tuza, Zsolt
2	van Antwerpen-de Fluiter, Babette
2	van den Eijkhof, Frank
2	van Dobben de Bruyn, Josse
2	van Kooten Niekerk, Marcel E.
...and 62 more Co-Authors

all top 5

Serials

19	Algorithmica
18	Theoretical Computer Science
11	Journal of Algorithms
10	Discrete Applied Mathematics
9	Information and Computation
8	Information Processing Letters
8	Theory of Computing Systems
6	SIAM Journal on Discrete Mathematics
5	SIAM Journal on Computing
5	Lecture Notes in Computer Science
4	International Journal of Foundations of Computer Science
3	Journal of Computer and System Sciences
3	Nordic Journal of Computing
3	Journal of Graph Algorithms and Applications
2	Discrete Mathematics
2	Journal of Combinatorial Optimization
2	ACM Transactions on Algorithms
2	LIPIcs – Leibniz International Proceedings in Informatics
1	Acta Cybernetica
1	The Computer Journal. Section A / Section B
1	Information and Control
1	Journal of Graph Theory
1	European Journal of Combinatorics
1	Operations Research Letters
1	Combinatorica
1	Bulletin of the European Association for Theoretical Computer Science (EATCS)
1	Computational Geometry
1	Computational Statistics
1	Nieuw Archief voor Wiskunde. Vierde Serie
1	SIAM Journal on Optimization
1	INFORMS Journal on Computing
1	Journal of Scheduling
1	Journal of the ACM
1	Discrete Mathematics and Theoretical Computer Science. DMTCS
1	RIMS Kokyuroku
1	Fundamenta Informaticae
1	Nieuw Archief voor Wiskunde. Vijfde Serie
1	CWI Tracts

all top 5

Fields

257	Computer science (68-XX)
175	Combinatorics (05-XX)
31	Operations research, mathematical programming (90-XX)
9	General and overarching topics; collections (00-XX)
9	Game theory, economics, finance, and other social and behavioral sciences (91-XX)
6	Mathematical logic and foundations (03-XX)
3	Statistics (62-XX)
3	Biology and other natural sciences (92-XX)
2	Information and communication theory, circuits (94-XX)
1	Convex and discrete geometry (52-XX)
1	Numerical analysis (65-XX)

Publications by Year

all cited Publications top 5 cited Publications

Citations contained in zbMATH Open

257 Publications have been cited 5,869 times in 3,328 Documents	Cited by ▼	Year ▼
A linear-time algorithm for finding tree-decompositions of small treewidth. Zbl 0864.68074 Bodlaender, Hans L.	526	1996
A partial k-arboretum of graphs with bounded treewidth. Zbl 0912.68148 Bodlaender, Hans L.	436	1998
On problems without polynomial kernels. Zbl 1192.68288 Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny	232	2009
A tourist guide through treewidth. Zbl 0804.68101 Bodlaender, Hans L.	215	1993
Kernelization lower bounds by cross-composition. Zbl 1295.05222 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	134	2014
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282 Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał	133	2016
Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Zbl 0861.68036 Bodlaender, Hans L.; Kloks, Ton	124	1996
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126 Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper	108	2015
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Zbl 0818.68118 Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton	104	1995
Dynamic programming on graphs with bounded treewidth. Zbl 0649.68039 Bodlaender, Hans L.	103	1988
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099 Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders	101	2011
(Meta) kernelization. Zbl 1292.68089 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.	88	2009
Treewidth: Algorithmic techniques and results. Zbl 0941.05057 Bodlaender, Hans L.	88	1997
On the complexity of some coloring games. Zbl 0753.05061 Bodlaender, Hans L.	86	1991
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Zbl 1016.68055 Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R.	84	2002
A linear time algorithm for finding tree-decompositions of small treewidth. Zbl 1310.05194 Bodlaender, Hans L.	81	1993
The pathwidth and treewidth of cographs. Zbl 0773.05091 Bodlaender, Hans L.; Möhring, Rolf H.	73	1993
Rankings of graphs. Zbl 0907.68137 Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt	73	1998
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Zbl 0716.68042 Bodlaender, Hans L.	71	1990
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157 van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter	67	2009
Algorithms for graphs embeddable with few crossings per edge. Zbl 1131.68120 Grigoriev, Alexander; Bodlaender, Hans L.	64	2007
Kernelization: new upper and lower bound techniques. Zbl 1273.68158 Bodlaender, Hans L.	61	2009
(Meta) kernelization. Zbl 1425.68137 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.	55	2016
Approximations for \(\lambda\)-colorings of graphs. Zbl 1039.68090 Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan	55	2004
Treewidth computations. I: Upper bounds. Zbl 1186.68328 Bodlaender, Hans L.; Koster, Arie M. C. A.	55	2010
Treewidth: Characterizations, applications, and computations. Zbl 1167.68404 Bodlaender, Hans L.	53	2006
Treewidth and pathwidth of permutation graphs. Zbl 0840.05087 Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter	52	1995
Diameter increase caused by edge deletion. Zbl 0646.05038 Schoone, A. A.; Bodlaender, H. L.; van Leeuwen, J.	51	1987
On disjoint cycles. Zbl 0803.05030 Bodlaender, Hans L.	51	1994
On linear time minor tests with depth-first search. Zbl 0764.68107 Bodlaender, Hans L.	50	1993
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	47	2011
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223 Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.	46	2010
Some classes of graphs with bounded treewidth. Zbl 0684.68047 Bodlaender, H. L.	45	1988
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract). Zbl 1345.68152 Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.	45	1994
\(\lambda\)-coloring of graphs. Zbl 0982.05050 Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan	41	2000
Parallel algorithms with optimal speedup for bounded treewidth. Zbl 0907.68089 Bodlaender, Hans L.; Hagerup, Torben	41	1998
Scheduling with incompatible jobs. Zbl 0822.68011 Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J.	40	1994
Safe separators for treewidth. Zbl 1084.05065 Bodlaender, Hans L.; Koster, Arie M. C. A.	39	2006
Discovering treewidth. Zbl 1117.68451 Bodlaender, Hans L.	39	2005
Achromatic number is NP-complete for cographs and interval graphs. Zbl 0684.68046 Bodlaender, Hans L.	37	1989
Cutwidth I: A linear time fixed parameter algorithm. Zbl 1161.68856 Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L.	37	2005
Constructive linear time algorithms for branchwidth. Zbl 1401.05277 Bodlaender, Hans L.; Thilikos, Dimitrios M.	36	1997
Restrictions of graph partition problems. I. Zbl 0873.68158 Bodlaender, Hans L.; Jansen, Klaus	35	1995
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196 Jansen, Bart M. P.; Bodlaender, Hans L.	32	2013
Two strikes against perfect phylogeny. Zbl 1425.68136 Bodlaender, Hans L.; Fellows, Mike R.; Warnow, Tandy J.	32	1992
On the complexity of the maximum cut problem. Zbl 0963.68224 Bodlaender, Hans L.; Jansen, Klaus	32	2000
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081 Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders	30	2009
On problems without polynomial kernels (extended abstract). Zbl 1153.68554 Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny	30	2008
Treewidth for graphs with small chordality. Zbl 0895.68113 Bodlaender, Hans L.; Thilikos, Dimitrios M.	30	1997
Cutwidth II: Algorithms for partial \(w\)-trees of bounded degree. Zbl 1161.68857 Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L.	30	2005
Exact algorithms for dominating set. Zbl 1237.05157 Van Rooij, Johan M. M.; Bodlaender, Hans L.	29	2011
Reduction algorithms for graphs of small treewidth. Zbl 1008.05140 Bodlaender, Hans L.; van Antwerpen-de Fluiter, Babette	29	2001
Treewidth computations. II. Lower bounds. Zbl 1220.68071 Bodlaender, Hans L.; Koster, Arie M. C. A.	27	2011
Equitable colorings of bounded treewidth graphs. Zbl 1086.68096 Bodlaender, Hans L.; Fomin, Fedor V.	26	2005
Treewidth and minimum fill-in on \(d\)-trapezoid graphs. Zbl 0905.68101 Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko	26	1998
Treewidth: computational experiments. Zbl 1409.05176 Koster, Arie M. C. A.; Bodlaender, Hans L.; van Hoesel, Stan P. M.	26	2001
On the complexity of some coloring games. Zbl 0770.90098 Bodlaender, Hans L.	25	1992
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling. Zbl 0857.90056 Bodlaender, Hans L.; Fellows, Michael R.	25	1995
On the complexity of scheduling incompatible jobs with unit-times. Zbl 0925.90222 Bodlaender, Hans L.; Jansen, Klaus	25	1993
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170 Bodlaender, Hans L.; van Dijk, Thomas C.	25	2010
Better algorithms for the pathwidth and treewidth of graphs. Zbl 0764.68108 Bodlaender, Hans L.; Kloks, Ton	24	1991
The parameterized complexity of sequence alignment and consensus. Zbl 0888.68060 Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Wareham, Harold T.	24	1995
Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Zbl 1162.05354 Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.	23	2005
Linear-time register allocation for a fixed number of register. Zbl 0930.68016 Bodlaender, Hans; Gustedt, Jens; Telle, Jan Arne	22	1998
Contraction and treewidth lower bounds. Zbl 1161.68644 Bodlaender, Hans L.; Wolle, Thomas; Koster, Arie M. C. A.	21	2006
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074 Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper	21	2013
NC-algorithms for graphs with small treewidth. Zbl 1533.68211 Bodlaender, Hans L.	21	1989
Kernel bounds for path and cycle problems. Zbl 1407.68207 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	20	2013
A note on exact algorithms for vertex ordering problems on graphs. Zbl 1253.68164 Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.	20	2012
Approximating treewidth, pathwidth, and minimum elimination tree height. Zbl 0768.68121 Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton	20	1992
Constructive linear time algorithms for small cutwidth and carving-width. Zbl 1044.68709 Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L.	20	2000
Design by measure and conquer. A faster exact algorithm for dominating set. Zbl 1259.68097 Van Rooij, Johan M. M.; Bodlaender, Hans L.	19	2008
A cubic kernel for feedback vertex set. Zbl 1186.68217 Bodlaender, Hans L.	19	2007
Treewidth lower bounds with brambles. Zbl 1138.68065 Bodlaender, Hans L.; Grigoriev, Alexander; Koster, Arie M. C. A.	18	2008
On exact algorithms for treewidth. Zbl 1131.68481 Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.	17	2006
On intervalizing \(k\)-colored graphs for DNA physical mapping. Zbl 0867.92008 Bodlaender, Hans L.; de Fluiter, Babette	17	1996
On exact algorithms for Treewidth. Zbl 1301.05328 Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.	17	2012
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	16	2013
Faster algorithms on branch and clique decompositions. Zbl 1287.05147 Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin	16	2010
Planar graph augmentation problems. Zbl 0764.68075 Kant, Goos; Bodlaender, Hans L.	16	1991
Triangulating planar graphs while minimizing the maximum degree. Zbl 0879.68082 Kant, Goos; Bodlaender, Hans L.	16	1997
Approximation of pathwidth of outerplanar graphs. Zbl 1005.68113 Bodlaender, Hans L.; Fomin, Fedor V.	16	2002
Computational complexity of norm-maximization. Zbl 0722.90080 Bodlaender, Hans L.; Gritzmann, P.; Klee, V.; van Leeuwen, J.	16	1990
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145 Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko	15	2009
On algorithms for (\(P_5\), gem)-free graphs. Zbl 1086.68050 Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy	15	2005
Graphs with branchwidth at most three. Zbl 0946.68103 Bodlaender, Hans L.; Thilikos, Dimitrios M.	15	1999
Partition into triangles on bounded degree graphs. Zbl 1286.68214 van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.	14	2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	14	2011
Kayles and Numbers. Zbl 1005.68112 Bodlaender, Hans L.; Kratsch, Dieter	14	2002
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Zbl 0945.68145 Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.; Wareham, H. Todd; Warnow, Tandy J.	14	2000
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067 Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel	13	2013
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092 Jansen, Bart M. P.; Bodlaender, Hans L.	13	2011
Complexity of path-forming games. Zbl 0776.90100 Bodlaender, Hans L.	13	1993
A linear kernel for planar Feedback Vertex Set. Zbl 1142.68451 Bodlaender, Hans L.; Penninkx, Eelko	13	2008
Safe reduction rules for weighted treewidth. Zbl 1108.68091 van den Eijkhof, Frank; Bodlaender, Hans L.; Koster, M. C. A.	13	2007
Treewidth: structure and algorithms. Zbl 1201.05076 Bodlaender, Hans L.	13	2007
Tree decompositions with small cost. Zbl 1084.05057 Bodlaender, Hans L.; Fomin, Fedor V.	13	2005
Exact algorithms for edge domination. Zbl 1264.68211 van Rooij, Johan M. M.; Bodlaender, Hans L.	12	2012
A faster parameterized algorithm for pseudoforest deletion. Zbl 1377.05184 Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota	12	2018
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1427.68353 de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der	12	2018
An ETH-tight exact algorithm for Euclidean TSP. Zbl 07693611 de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Kolay, Sudeshna	2	2023
Problems hard for treewidth but easy for stable gonality. Zbl 07682403 Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke	2	2022
Parameterized complexities of dominating and independent set reconfiguration. Zbl 07803587 Bodlaender, Hans L.; Groenland, Carla; Swennenhuis, Céline M. F.	6	2021
Parameterized complexity of conflict-free graph coloring. Zbl 1527.68154 Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid	2	2021
Steiner trees for hereditary graph classes: a treewidth perspective. Zbl 1477.68203 Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan	2	2021
Stable divisorial gonality is in NP. Zbl 1477.68204 Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C.	1	2021
Parameterized complexity of bandwidth of caterpillars and weighted path emulation. Zbl 07538564 Bodlaender, Hans L.	1	2021
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes. Zbl 07405958 Saitoh, Toshiki; Yoshinaka, Ryo; Bodlaender, Hans L.	1	2021
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1497.68375 de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.	7	2020
Typical sequences revisited – computing width parameters of graphs. Zbl 07650942 Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne	4	2020
Subgraph isomorphism on graph classes that exclude a substructure. Zbl 1492.68102 Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C.	3	2020
Parameterized complexity of scheduling chains of jobs with delays. Zbl 07764095 Bodlaender, Hans L.; van der Wegen, Marieke	3	2020
Constructing tree decompositions of graphs with bounded gonality. Zbl 07336120 Bodlaender, Hans L.; van Dobben de Bruyn, Josse; Gijswijt, Dion; Smit, Harry	2	2020
Recognizing hyperelliptic graphs in polynomial time. Zbl 1436.05105 Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke	2	2020
Steiner trees for hereditary graph classes. Zbl 07600807 Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan	2	2020
Knot diagrams of treewidth two. Zbl 07636197 Bodlaender, Hans L.; Burton, Benjamin; Fomin, Fedor V.; Grigoriev, Alexander	1	2020
On exploring always-connected temporal graphs of small pathwidth. Zbl 1469.68072 Bodlaender, Hans L.; van der Zanden, Tom C.	7	2019
On the maximum weight minimal separator. Zbl 1435.68239 Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka	7	2019
Parameterized complexity of conflict-free graph coloring. Zbl 1528.68273 Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid	6	2019
Stable divisorial gonality is in NP. Zbl 1444.68138 Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C.	2	2019
Subgraph isomorphism on graph classes that exclude a substructure. Zbl 1525.68092 Bodlaender, Hans L.; Hanaka, Tesshu; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C.	1	2019
A faster parameterized algorithm for pseudoforest deletion. Zbl 1377.05184 Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota	12	2018
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1427.68353 de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der	12	2018
Recognizing hyperelliptic graphs in polynomial time. Zbl 1517.68276 Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke	4	2018
Computing treewidth on the GPU. Zbl 1443.68213 van der Zanden, Tom C.; Bodlaender, Hans L.	4	2018
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. Zbl 1393.68067 Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota	3	2018
On the exact complexity of polyomino packing. Zbl 1453.68091 Bodlaender, Hans L.; van der Zanden, Tom C.	1	2018
A faster parameterized algorithm for pseudoforest deletion. Zbl 1398.68216 Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota	5	2017
Characterizing width two for variants of treewidth. Zbl 1350.05116 Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin	4	2017
Cut and count and representative sets on branch decompositions. Zbl 1398.05205 Pino, Willem J. A.; Bodlaender, Hans L.; van Rooij, Johan M. M.	4	2017
Improved lower bounds for graph embedding problems. Zbl 1486.68123 Bodlaender, Hans L.; van der Zanden, Tom C.	3	2017
The homogeneous broadcast problem in narrow and wide strips. Zbl 1421.68113 de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor	2	2017
42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Zbl 1376.68011	1	2017
On the maximum weight minimal separator. Zbl 1435.68238 Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka	1	2017
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees. Zbl 1369.05048 Jaffke, Lars; Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne	1	2017
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282 Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał	133	2016
(Meta) kernelization. Zbl 1425.68137 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.	55	2016
Subexponential time algorithms for embedding \(H\)-minor free graphs. Zbl 1388.68103 Bodlaender, Hans L.; Nederlof, Jesper; van der Zanden, Tom C.	12	2016
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. Zbl 1388.68104 Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota	1	2016
Exact algorithms for intervalizing coloured graphs. Zbl 1331.05202 Bodlaender, Hans L.; van Rooij, Johan M. M.	1	2016
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126 Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper	108	2015
PSPACE-completeness of Bloxorz and of games with 2-buttons. Zbl 1459.68080 van der Zanden, Tom C.; Bodlaender, Hans L.	7	2015
Definability equals recognizability for \(k\)-outerplanar graphs. Zbl 1378.03032 Jaffke, Lars; Bodlaender, Hans L.	7	2015
Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions. Zbl 1312.68230 Fafianie, Stefan; Bodlaender, Hans; Nederlof, Jesper	6	2015
Subexponential time algorithms for finding small tree and path decompositions. Zbl 1422.68183 Bodlaender, Hans L.; Nederlof, Jesper	5	2015
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249 Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne	4	2015
Exact algorithms for Kayles. Zbl 1305.05143 Bodlaender, Hans L.; Kratsch, Dieter; Timmer, Sjoerd T.	4	2015
Google Scholar makes it hard – the complexity of organizing one’s publications. Zbl 1338.68085 Bodlaender, Hans L.; van Kreveld, Marc	1	2015
Kernelization lower bounds by cross-composition. Zbl 1295.05222 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	134	2014
On making a distinguished vertex of minimum degree by vertex deletion. Zbl 1360.68492 Betzler, Nadja; Bodlaender, Hans L.; Bredereck, Robert; Niedermeier, Rolf; Uhlmann, Johannes	3	2014
Lower bounds for kernelization. Zbl 1456.68063 Bodlaender, Hans L.	1	2014
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196 Jansen, Bart M. P.; Bodlaender, Hans L.	32	2013
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074 Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper	21	2013
Kernel bounds for path and cycle problems. Zbl 1407.68207 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	20	2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	16	2013
Partition into triangles on bounded degree graphs. Zbl 1286.68214 van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.	14	2013
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067 Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel	13	2013
Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions. Zbl 1309.68209 Fafianie, Stefan; Bodlaender, Hans L.; Nederlof, Jesper	5	2013
Fixed-parameter tractability and characterizations of small special treewidth. Zbl 1400.05234 Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.	2	2013
A note on exact algorithms for vertex ordering problems on graphs. Zbl 1253.68164 Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.	20	2012
On exact algorithms for Treewidth. Zbl 1301.05328 Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.	17	2012
Exact algorithms for edge domination. Zbl 1264.68211 van Rooij, Johan M. M.; Bodlaender, Hans L.	12	2012
Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	9	2012
Parameterized complexity of the spanning tree congestion problem. Zbl 1253.68163 Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; van Leeuwen, Erik Jan	8	2012
Fixed-parameter tractability of treewidth and pathwidth. Zbl 1358.68119 Bodlaender, Hans L.	8	2012
Kernel bounds for path and cycle problems. Zbl 1352.68092 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	5	2012
Scheduling of pipelined operator graphs. Zbl 1280.68084 Bodlaender, Hans L.; Schuurman, Petra; Woeginger, Gerhard J.	4	2012
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Zbl 1245.68001	4	2012
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099 Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders	101	2011
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	47	2011
Exact algorithms for dominating set. Zbl 1237.05157 Van Rooij, Johan M. M.; Bodlaender, Hans L.	29	2011
Treewidth computations. II. Lower bounds. Zbl 1220.68071 Bodlaender, Hans L.; Koster, Arie M. C. A.	27	2011
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204 Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan	14	2011
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092 Jansen, Bart M. P.; Bodlaender, Hans L.	13	2011
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100 Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve	9	2011
Quadratic kernelization for convex recoloring of trees. Zbl 1234.68146 Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark	6	2011
Spanning tree congestion of \(k\)-outerplanar graphs. Zbl 1223.05017 Bodlaender, Hans L.; Kozawa, Kyohei; Matsushima, Takayoshi; Otachi, Yota	6	2011
Partition into triangles on bounded degree graphs. Zbl 1298.68119 van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.	4	2011
The complexity of finding \(k\)th most probable explanations in probabilistic networks. Zbl 1298.68202 Kwisthout, Johan H. P.; Bodlaender, Hans L.; van der Gaag, Linda C.	3	2011
Exact algorithms for Kayles. Zbl 1339.05251 Bodlaender, Hans L.; Kratsch, Dieter	3	2011
A local search algorithm for branchwidth. Zbl 1298.05304 Overwijk, Arnold; Penninkx, Eelko; Bodlaender, Hans L.	2	2011
On stopping evidence gathering for diagnostic Bayesian networks. Zbl 1341.62259 van der Gaag, Linda C.; Bodlaender, Hans L.	2	2011
Exact algorithms for intervalizing colored graphs. Zbl 1325.05160 Bodlaender, Hans L.; van Rooij, Johan M. M.	1	2011
Treewidth computations. I: Upper bounds. Zbl 1186.68328 Bodlaender, Hans L.; Koster, Arie M. C. A.	55	2010
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223 Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.	46	2010
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170 Bodlaender, Hans L.; van Dijk, Thomas C.	25	2010
Faster algorithms on branch and clique decompositions. Zbl 1287.05147 Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin	16	2010
The necessity of bounded treewidth for efficient inference in Bayesian networks. Zbl 1211.68275 Kwisthout, Johan H. P.; Bodlaender, Hans L.; Van Der Gaag, L. C.	11	2010
Complexity results for the spanning tree congestion problem. Zbl 1308.68067 Otachi, Yota; Bodlaender, Hans L.; van Leeuwen, Erik Jan	6	2010
Clustering with partial information. Zbl 1213.05222 Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances	2	2010
The valve location problem in simple network topologies. Zbl 1243.90086 Bodlaender, Hans L.; Hendriks, Albert; Grigoriev, Alexander; Grigorieva, Nadejda V.	2	2010
On problems without polynomial kernels. Zbl 1192.68288 Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny	232	2009
(Meta) kernelization. Zbl 1292.68089 Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.	88	2009
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157 van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter	67	2009
Kernelization: new upper and lower bound techniques. Zbl 1273.68158 Bodlaender, Hans L.	61	2009
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081 Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders	30	2009
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145 Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko	15	2009
Derivation of algorithms for cutwidth and related graph layout parameters. Zbl 1165.68523 Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M.	10	2009
On the minimum corridor connection problem and other generalized geometric problems. Zbl 1200.05215 Bodlaender, Hans L.; Feremans, Corinne; Grigoriev, Alexander; Penninkx, Eelko; Sitters, René; Wolle, Thomas	5	2009
On problems without polynomial kernels (extended abstract). Zbl 1153.68554 Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny	30	2008
...and 157 more Documents

all cited Publications top 5 cited Publications

all top 5

Cited by 3,422 Authors

119	Bodlaender, Hans L.
101	Saurabh, Saket
97	Fomin, Fedor V.
97	Thilikos, Dimitrios M.
70	Golovach, Petr A.
63	Lokshtanov, Daniel
63	Niedermeier, Rolf
48	Jansen, Bart M. P.
48	Paulusma, Daniël
47	Pilipczuk, Marcin L.
46	Fellows, Michael Ralph
46	Sau, Ignasi
44	Otachi, Yota
42	Kratsch, Dieter
41	Pilipczuk, Michał
39	Szeider, Stefan
38	Kratsch, Stefan
34	Lampis, Michael
34	Marx, Dániel
34	Zehavi, Meirav
33	Panolan, Fahad
31	Ganian, Robert
31	Hanaka, Tesshu
31	Heggernes, Pinar
31	Komusiewicz, Christian
31	Ono, Hirotaka
30	Wood, David Ronald
28	Ordyniak, Sebastian
28	Raman, Venkatesh
27	Fernau, Henning
27	Montecchiani, Fabrizio
27	Telle, Jan Arne
26	Gutin, Gregory Z.
26	Kloks, Ton
26	Liotta, Giuseppe
25	Paul, Christophe
24	Chen, Jian-er
23	Cygan, Marek
23	Hermelin, Danny
23	Kwon, O. joung
22	Eiben, Eduard
22	Guo, Jiong
22	Liedloff, Mathieu
22	Paschos, Vangelis Th.
22	Ramanujan, M. S.
22	Todinca, Ioan
22	Van Leeuwen, Erik Jan
21	Milanič, Martin
21	Nisse, Nicolas
21	Tuza, Zsolt
20	Andres, Stephan Dominique
20	Gurski, Frank
20	Kanj, Iyad A.
20	Kobayashi, Yasuaki
20	Lozin, Vadim Vladislavovich
20	Rzążewski, Paweł
20	Villanger, Yngve
19	Bazgan, Cristina
19	Courcelle, Bruno
19	Kawarabayashi, Ken-ichi
19	Rosamond, Frances A.
19	van Bevern, René
19	Zhu, Xuding
18	Kobayashi, Yusuke
18	Misra, Neeldhara
18	Nederlof, Jesper
18	van der Zanden, Tom C.
17	Baste, Julien
17	Kamiński, Marcin
17	Kanté, Mamadou Moustapha
17	Mnich, Matthias
17	Monnot, Jérôme
17	Müller, Haiko
17	Papadopoulos, Charis
17	Souza, Uéverton S.
17	Suchý, Ondřej
17	Wahlström, Magnus
17	Wang, Jianxin
16	Belmonte, Rémy
16	Gaspers, Serge
16	Ito, Takehiro
16	Jansen, Klaus
16	Kim, Eun Jung
16	Rossmanith, Peter
16	van ’t Hof, Pim
16	Woltran, Stefan
16	Xiao, Mingyu
16	Zhou, Xiao
15	Bekos, Michael A.
15	Downey, Rodney Graham
15	Dujmović, Vida
15	Jones, Mark
15	Kratochvíl, Jan
15	Sikora, Florian
15	Yeo, Anders
14	Dabrowski, Konrad Kazimierz
14	de Berg, Mark Theodoor
14	Demaine, Erik D.
14	Eppstein, David Arthur
14	Fluschnik, Till
...and 3,322 more Authors

all top 5

Cited in 206 Serials

368	Theoretical Computer Science
363	Discrete Applied Mathematics
272	Algorithmica
120	Journal of Computer and System Sciences
114	Discrete Mathematics
82	Information Processing Letters
74	SIAM Journal on Discrete Mathematics
66	Journal of Combinatorial Optimization
59	Theory of Computing Systems
47	Information and Computation
45	Artificial Intelligence
44	Journal of Graph Theory
38	Journal of Combinatorial Theory. Series B
32	Journal of Discrete Algorithms
31	European Journal of Combinatorics
28	Discrete Optimization
26	SIAM Journal on Computing
24	The Electronic Journal of Combinatorics
24	Journal of Graph Algorithms and Applications
22	Networks
21	Computational Geometry
19	Graphs and Combinatorics
16	Computers & Operations Research
15	International Journal of Foundations of Computer Science
14	Operations Research Letters
14	Discrete & Computational Geometry
14	International Journal of Approximate Reasoning
13	Journal of Scheduling
12	Annals of Operations Research
12	Linear Algebra and its Applications
12	Mathematical Programming. Series A. Series B
10	European Journal of Operational Research
10	Discussiones Mathematicae. Graph Theory
10	Discrete Mathematics and Theoretical Computer Science. DMTCS
10	ACM Journal of Experimental Algorithmics
10	ACM Transactions on Algorithms
9	Discrete Mathematics, Algorithms and Applications
9	Computer Science Review
8	Combinatorica
7	Distributed Computing
7	Combinatorics, Probability and Computing
6	Applied Mathematics Letters
6	The Journal of Artificial Intelligence Research (JAIR)
6	Theory and Practice of Logic Programming
6	Quantum Information Processing
6	AKCE International Journal of Graphs and Combinatorics
6	Logical Methods in Computer Science
6	Algorithms
5	Acta Informatica
5	Applied Mathematics and Computation
5	Information Sciences
5	Annals of Pure and Applied Logic
5	RAIRO. Operations Research
5	ACM Transactions on Computation Theory
4	Order
4	Journal of Automated Reasoning
4	Computational Complexity
4	Annals of Mathematics and Artificial Intelligence
4	Constraints
4	Mathematical Methods of Operations Research
4	RAIRO. Theoretical Informatics and Applications
4	Electronic Journal of Graph Theory and Applications
4	Prikladnaya Diskretnaya Matematika
3	Journal of Optimization Theory and Applications
3	Advances in Applied Mathematics
3	Acta Mathematicae Applicatae Sinica. English Series
3	Random Structures & Algorithms
3	International Journal of Computer Mathematics
3	Journal of the ACM
3	Annals of Combinatorics
3	Journal of Discrete Mathematical Sciences & Cryptography
3	Fundamenta Informaticae
3	Trudy Instituta Matematiki
3	Mathematics in Computer Science
3	Optimization Letters
2	Indian Journal of Pure & Applied Mathematics
2	ACM Transactions on Mathematical Software
2	Journal of Combinatorial Theory. Series A
2	Naval Research Logistics
2	Quaestiones Mathematicae
2	International Journal of Computational Geometry & Applications
2	SIAM Journal on Optimization
2	Computational Optimization and Applications
2	Applied Mathematics. Series B (English Edition)
2	Journal of Mathematical Sciences (New York)
2	Computational and Applied Mathematics
2	International Transactions in Operational Research
2	INFORMS Journal on Computing
2	ELA. The Electronic Journal of Linear Algebra
2	Algebraic & Geometric Topology
2	JMMA. Journal of Mathematical Modelling and Algorithms
2	Journal of Applied Mathematics and Computing
2	ACM Transactions on Computational Logic
2	Proceedings of the Steklov Institute of Mathematics
2	Mathematical Programming Computation
2	Journal of the Operations Research Society of China
2	Journal of Applied and Computational Topology
2	Algebraic Combinatorics
2	The Art of Discrete and Applied Mathematics
2	CGT. Computing in Geometry and Topology
...and 106 more Serials

all top 5

Cited in 39 Fields

2,328	Computer science (68-XX)
2,155	Combinatorics (05-XX)
442	Operations research, mathematical programming (90-XX)
197	Game theory, economics, finance, and other social and behavioral sciences (91-XX)
96	Mathematical logic and foundations (03-XX)
62	Biology and other natural sciences (92-XX)
31	Statistics (62-XX)
31	Information and communication theory, circuits (94-XX)
22	Convex and discrete geometry (52-XX)
21	Linear and multilinear algebra; matrix theory (15-XX)
16	Manifolds and cell complexes (57-XX)
14	Probability theory and stochastic processes (60-XX)
14	Quantum theory (81-XX)
11	Order, lattices, ordered algebraic structures (06-XX)
9	Numerical analysis (65-XX)
8	Algebraic geometry (14-XX)
8	Statistical mechanics, structure of matter (82-XX)
7	Group theory and generalizations (20-XX)
6	Dynamical systems and ergodic theory (37-XX)
5	General and overarching topics; collections (00-XX)
5	History and biography (01-XX)
5	General algebraic systems (08-XX)
5	Commutative algebra (13-XX)
4	Number theory (11-XX)
4	Operator theory (47-XX)
4	Systems theory; control (93-XX)
3	Field theory and polynomials (12-XX)
2	Category theory; homological algebra (18-XX)
2	Functional analysis (46-XX)
1	Associative rings and algebras (16-XX)
1	Nonassociative rings and algebras (17-XX)
1	Functions of a complex variable (30-XX)
1	Sequences, series, summability (40-XX)
1	Calculus of variations and optimal control; optimization (49-XX)
1	Geometry (51-XX)
1	General topology (54-XX)
1	Algebraic topology (55-XX)
1	Mechanics of particles and systems (70-XX)
1	Classical thermodynamics, heat transfer (80-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.