×
Compute Distance To:
Author ID: johnson.matthew Recent zbMATH articles by "Johnson, Matthew"
Published as: Johnson, Matthew
Homepage: http://community.dur.ac.uk/matthew.johnson2/
External Links: MGP · ORCID · dblp

Publications by Year

Citations contained in zbMATH Open

58 Publications have been cited 468 times in 252 Documents Cited by Year
A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian
62
2017
Finding paths between 3-colorings. Zbl 1216.05154
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
55
2011
Connectedness of the graph of vertex-colourings. Zbl 1133.05053
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
45
2008
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
32
2014
Mixing 3-colourings in bipartite graphs. Zbl 1198.05040
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
31
2009
A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
16
2016
Finding shortest paths between graph colourings. Zbl 1350.68148
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
14
2016
Some results on the Oberwolfach problem. Zbl 1012.05135
Hilton, A. J. W.; Johnson, Matthew
14
2001
Amalgamations of connected \(k\)-factorizations. Zbl 1033.05084
Hilton, A. J. W.; Johnson, Matthew; Rodger, C. A.; Wantland, E. B.
11
2003
Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
11
2018
Clique-width for hereditary graph classes. Zbl 1476.05175
Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
11
2019
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
10
2019
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
9
2018
Characterization of graphs with Hall number 2. Zbl 1033.05040
Eslahchi, Changiz; Johnson, Matthew
8
2004
Amalgamations of factorizations of complete graphs. Zbl 1153.05055
Johnson, Matthew
8
2007
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049
Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew
8
2019
The price of connectivity for cycle transversals. Zbl 1343.05157
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
7
2016
Finding shortest paths between graph colourings. Zbl 1341.68062
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
7
2014
Transversals of subtree hypergraphs and the source location problem in digraphs. Zbl 1180.05116
van den Heuvel, Jan; Johnson, Matthew
7
2008
Path factors and parallel knock-out schemes of almost claw-free graphs. Zbl 1219.05140
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal
6
2010
Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
6
2017
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
5
2016
Erdös-Ko-Rado theorems for a family of trees. Zbl 1377.05031
Feghali, Carl; Johnson, Matthew; Thomas, Daniel
5
2018
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs. Zbl 1445.68110
Huang, Shenwei; Johnson, Matthew; Paulusma, Daniël
5
2014
Finding paths between 3-colourings. Zbl 1235.05135
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
5
2009
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
4
2020
An algorithm for finding factorizations of complete graphs. Zbl 1015.05075
Hilton, A. J. W.; Johnson, Matthew
4
2003
Finding paths between graph colourings: Computational complexity and possible distances. Zbl 1341.05063
Bonsma, Paul; Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
4
2007
A reconfigurations analogue of Brooks’ theorem. Zbl 1426.05042
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
4
2014
Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
4
2019
On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332
Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł
4
2020
Cycle decompositions of the complete graph. Zbl 1174.05412
Hilton, A. J. W.; Johnson, Matthew
3
2006
The computational complexity of the parallel knock-out problem. Zbl 1136.68028
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
3
2008
Mixing 3-colourings in bipartite graphs. Zbl 1141.68521
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
3
2007
On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
3
2011
Recognizing graphs close to bipartite graphs. Zbl 1441.68167
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
Computing weighted subset transversals in \(H\)-free graphs. Zbl 07498680
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël
2
2021
Computing subset transversals in \(H\)-free graphs. Zbl 07458786
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2022
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 07152209
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
2
2019
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 07378380
Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor
2
2018
A multi-level hypergraph partitioning algorithm using rough set clustering. Zbl 1377.05186
Lotfifar, Foad; Johnson, Matthew
2
2015
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68244
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2018
Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony
2
2019
On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 07160840
Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
1
2019
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 07331686
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo
1
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
1
2021
The computational complexity of the parallel knock-out problem. Zbl 1145.68433
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
1
2006
Weak critical sets in cyclic Latin squares. Zbl 0977.05023
Johnson, Matthew; Bedford, David
1
2001
Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël
1
2009
The price of connectivity for cycle transversals. Zbl 1455.05076
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
1
2015
Algorithms to measure diversity and clustering in social networks through dot product graphs. Zbl 1329.05281
Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan
1
2013
Kempe equivalence of colourings of cubic graphs. Zbl 1346.05065
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
1
2015
What graphs are 2-dot product graphs? Zbl 1346.05246
Johnson, Matthew; van Leeuwen, Erik Jan; Paulusma, Daniël
1
2015
Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony
1
2014
Enclosings of decompositions of complete multigraphs in 2-factorizations. Zbl 1396.05091
Feghali, Carl; Johnson, Matthew
1
2018
Clique-width for graph classes closed under complementation. Zbl 1441.05167
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor
1
2020
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
1
2019
Computing subset transversals in \(H\)-free graphs. Zbl 07458786
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2022
Computing weighted subset transversals in \(H\)-free graphs. Zbl 07498680
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël
2
2021
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 07331686
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo
1
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
1
2021
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
4
2020
On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332
Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł
4
2020
Clique-width for graph classes closed under complementation. Zbl 1441.05167
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor
1
2020
Clique-width for hereditary graph classes. Zbl 1476.05175
Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
11
2019
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
10
2019
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049
Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew
8
2019
Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
4
2019
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 07152209
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël
2
2019
Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony
2
2019
On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 07160840
Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
1
2019
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
1
2019
Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
11
2018
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219
Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
9
2018
Erdös-Ko-Rado theorems for a family of trees. Zbl 1377.05031
Feghali, Carl; Johnson, Matthew; Thomas, Daniel
5
2018
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 07378380
Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor
2
2018
Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68244
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël
2
2018
Enclosings of decompositions of complete multigraphs in 2-factorizations. Zbl 1396.05091
Feghali, Carl; Johnson, Matthew
1
2018
A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039
Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian
62
2017
Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
6
2017
Recognizing graphs close to bipartite graphs. Zbl 1441.68167
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
3
2017
A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
16
2016
Finding shortest paths between graph colourings. Zbl 1350.68148
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
14
2016
The price of connectivity for cycle transversals. Zbl 1343.05157
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
7
2016
Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël
5
2016
A multi-level hypergraph partitioning algorithm using rough set clustering. Zbl 1377.05186
Lotfifar, Foad; Johnson, Matthew
2
2015
The price of connectivity for cycle transversals. Zbl 1455.05076
Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël
1
2015
Kempe equivalence of colourings of cubic graphs. Zbl 1346.05065
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
1
2015
What graphs are 2-dot product graphs? Zbl 1346.05246
Johnson, Matthew; van Leeuwen, Erik Jan; Paulusma, Daniël
1
2015
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
32
2014
Finding shortest paths between graph colourings. Zbl 1341.68062
Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël
7
2014
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs. Zbl 1445.68110
Huang, Shenwei; Johnson, Matthew; Paulusma, Daniël
5
2014
A reconfigurations analogue of Brooks’ theorem. Zbl 1426.05042
Feghali, Carl; Johnson, Matthew; Paulusma, Daniël
4
2014
Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony
1
2014
Algorithms to measure diversity and clustering in social networks through dot product graphs. Zbl 1329.05281
Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan
1
2013
Finding paths between 3-colorings. Zbl 1216.05154
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
55
2011
On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144
Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël
3
2011
Path factors and parallel knock-out schemes of almost claw-free graphs. Zbl 1219.05140
Johnson, Matthew; Paulusma, Daniël; Wood, Chantal
6
2010
Mixing 3-colourings in bipartite graphs. Zbl 1198.05040
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
31
2009
Finding paths between 3-colourings. Zbl 1235.05135
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
5
2009
Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël
1
2009
Connectedness of the graph of vertex-colourings. Zbl 1133.05053
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
45
2008
Transversals of subtree hypergraphs and the source location problem in digraphs. Zbl 1180.05116
van den Heuvel, Jan; Johnson, Matthew
7
2008
The computational complexity of the parallel knock-out problem. Zbl 1136.68028
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
3
2008
Amalgamations of factorizations of complete graphs. Zbl 1153.05055
Johnson, Matthew
8
2007
Finding paths between graph colourings: Computational complexity and possible distances. Zbl 1341.05063
Bonsma, Paul; Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
4
2007
Mixing 3-colourings in bipartite graphs. Zbl 1141.68521
Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
3
2007
Cycle decompositions of the complete graph. Zbl 1174.05412
Hilton, A. J. W.; Johnson, Matthew
3
2006
The computational complexity of the parallel knock-out problem. Zbl 1145.68433
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
1
2006
Characterization of graphs with Hall number 2. Zbl 1033.05040
Eslahchi, Changiz; Johnson, Matthew
8
2004
Amalgamations of connected \(k\)-factorizations. Zbl 1033.05084
Hilton, A. J. W.; Johnson, Matthew; Rodger, C. A.; Wantland, E. B.
11
2003
An algorithm for finding factorizations of complete graphs. Zbl 1015.05075
Hilton, A. J. W.; Johnson, Matthew
4
2003
Some results on the Oberwolfach problem. Zbl 1012.05135
Hilton, A. J. W.; Johnson, Matthew
14
2001
Weak critical sets in cyclic Latin squares. Zbl 0977.05023
Johnson, Matthew; Bedford, David
1
2001
all top 5

Cited by 345 Authors

48 Paulusma, Daniël
30 Johnson, Matthew
16 Feghali, Carl
15 Ito, Takehiro
11 Dabrowski, Konrad Kazimierz
10 Bonamy, Marthe
10 Bousquet, Nicolas
10 Chudnovsky, Maria
9 Bahmanian, M. Amin
9 Martin, Barnaby D.
9 Mouawad, Amer E.
8 Malyshev, Dmitriĭ Sergeevich
8 Smith, Siani
8 Suzuki, Akira
7 Bryant, Darryn E.
7 Kamiński, Marcin Marek
7 Milanič, Martin
7 Nishimura, Naomi
7 Rzążewski, Paweł
7 Zhong, Mingxian
7 Zhou, Xiao
6 Bonsma, Paul S.
6 Brettell, Nick
6 Haas, Ruth
5 Demaine, Erik D.
5 Hilton, Anthony J. W.
5 Novotná, Jana
5 Paesani, Giacomo
5 Schaudt, Oliver
5 Spirkl, Sophie Theresa
5 Van Leeuwen, Erik Jan
5 Zhou, Sizhong
4 Brewster, Richard C.
4 Cereceda, Luis
4 Danziger, Peter
4 Goedgebeur, Jan
4 Golovach, Petr A.
4 Huang, Shenwei
4 Klimošová, Tereza
4 Lima, Paloma T.
4 Lozin, Vadim Vladislavovich
4 Masařík, Tomáš
4 Raman, Venkatesh
4 Seyffarth, Karen
4 Wrochna, Marcin
3 Asplund, John
3 Bartier, Valentin
3 Bonomo-Braberman, Flavia
3 Brause, Christoph
3 Buratti, Marco
3 Heinrich, Marc
3 Horsley, Daniel
3 Kobayashi, Yusuke
3 Lee, Jae-Baek
3 Medvedev, Paul
3 Munaro, Andrea
3 Noel, Jonathan Andrew
3 Ono, Hirotaka
3 Osawa, Hiroki
3 Ries, Bernard
3 Rodger, Christopher Andrew
3 Siggers, Mark H.
3 Stein, Maya Jakobine
3 Traetta, Tommaso
3 van den Heuvel, Jan
3 Zamaraev, Victor A.
2 Blanché, Alexandre
2 Borg, Peter
2 Brignall, Robert
2 Broersma, Hajo J.
2 Burgess, Andrea C.
2 Cranston, Daniel W.
2 Cropper, Mathew Maurice
2 Dallard, Clément
2 Dross, François
2 Dvořák, Zdeněk
2 Estrugo, Emiliano J. J.
2 Gaspers, Serge
2 Hartinger, Tatiana Romina
2 Hatanaka, Tatsuhiko
2 Hoffman, Dean G.
2 Jaffke, Lars
2 Jelínek, Vít
2 Johnson, Peter D. jun.
2 Kakimura, Naonori
2 Kamat, Vikram
2 Kamiyama, Naoyuki
2 Karthick, T.
2 Lehel, Jeno
2 Lokshtanov, Daniel
2 Maceli, Peter
2 Maenhaut, Barbara M.
2 Malík, Josef
2 Mendelsohn, Eric
2 Merkel, Owen D.
2 Mynhardt, Christina Magdalena
2 Novick, Beth
2 Okamoto, Yoshio
2 Okrasa, Karolina
2 Ouvrard, Paul
...and 245 more Authors

Citations by Year