Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMatthew Johnson 0002
Person information
- affiliation: University of Durham, Department of Computer Science, UK
Other persons with the same name
- Matthew Johnson
- Matt Johnson 0001 (aka: Matthew Johnson 0001, Matthew J. Johnson 0001) — Florida Institute for Human and Machine Cognition (IHMC), Pensacola, USA
- Matthew Johnson 0003 — University of Cambridge, Department of Engineering
- Matthew Johnson 0004 — University of Tennessee, Oak Ridge, National Institute for Computational Sciences
- Matthew Johnson 0005 — Clemson University, Department of Industrial Engineering
- Matthew Johnson 0006 — Leuphana University Lüneburg, Centre for Sustainability Management
- Matthew Johnson 0007 — California State University Sacramento, USA
- Matthew Johnson 0008 — University of California, Berkeley, Department of Bioengineering
- Matthew Johnson 0009 — University of California, Irvine, Donald Bren School of Information and Computer Sciences
- Matthew Johnson 0010
![[0000-0001-5597-6615]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-5597-6615")
— University of Southampton, Faculty of Health Sciences, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j39]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-colouring: New hardness results. Computability 8(1): 27-42 (2019)- [j38]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory, Ser. B 135: 179-199 (2019) - [i20]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-Width for Hereditary Graph Classes. CoRR abs/1901.00335 (2019) - 2018
- [j37]Carl Feghali, Matthew Johnson, Daniel Thomas:
Erdős-Ko-Rado theorems for a family of trees. Discrete Applied Mathematics 236: 464-471 (2018) - [j36]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131: 26-32 (2018) - [j35]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705: 75-83 (2018) - [c22]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev:
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15 - [c21]Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG 2018: 279-291 - [i19]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - [i18]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. CoRR abs/1811.12252 (2018) - 2017
- [j34]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59: 1-10 (2017) - [j33]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. Journal of Graph Theory 84(4): 331-363 (2017) - [c20]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CiE 2017: 270-281 - [c19]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c18]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [c17]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. MFCS 2017: 73:1-73:14 - [i17]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. CoRR abs/1701.02188 (2017) - [i16]Alexandre Blanché, Konrad Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. CoRR abs/1705.07681 (2017) - [i15]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR abs/1706.08050 (2017) - [i14]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i13]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i12]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR abs/1707.09817 (2017) - [i11]Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP1+P5)-Free Graphs. CoRR abs/1712.08362 (2017) - 2016
- [j32]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. Algorithmica 75(2): 295-321 (2016) - [j31]Markus Mäsker, Lars Nagel, André Brinkmann, Foad Lotfifar, Matthew Johnson:
Smart Grid-aware scheduling in data centres. Computer Communications 96: 73-85 (2016) - [j30]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The price of connectivity for cycle transversals. Eur. J. Comb. 58: 203-224 (2016) - [j29]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. Journal of Graph Theory 83(4): 340-358 (2016) - [i10]Foad Lotfifar, Matthew Johnson:
A Serial Multilevel Hypergraph Partitioning Algorithm. CoRR abs/1601.01336 (2016) - [i9]Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma:
Colouring on Hereditary Graph Classes Closed under Complementation. CoRR abs/1607.06757 (2016) - 2015
- [j28]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. Comput. J. 58(11): 3074-3088 (2015) - [j27]Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking out Pk-free graphs. Discrete Applied Mathematics 190-191: 100-108 (2015) - [j26]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. Electronic Notes in Discrete Mathematics 49: 243-249 (2015) - [j25]Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma:
What Graphs are 2-Dot Product Graphs? Electronic Notes in Discrete Mathematics 49: 705-711 (2015) - [j24]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms for diversity and clustering in social networks through dot product graphs. Social Networks 41: 48-55 (2015) - [c16]Foad Lotfifar, Matthew Johnson:
A Multi-level Hypergraph Partitioning Algorithm Using Rough Set Clustering. Euro-Par 2015: 159-170 - [c15]Markus Mäsker, Lars Nagel, André Brinkmann, Foad Lotfifar, Matthew Johnson:
Smart grid-aware scheduling in data centres. SustainIT 2015: 1-9 - [c14]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA 2015: 100-111 - [c13]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The Price of Connectivity for Cycle Transversals. MFCS (2) 2015: 395-406 - [i8]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR abs/1501.05800 (2015) - [i7]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. CoRR abs/1503.03430 (2015) - [i6]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR abs/1506.06564 (2015) - [i5]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - [i4]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? CoRR abs/1511.05009 (2015) - 2014
- [j23]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 (2014) - [j22]Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. 54(2): 244-260 (2014) - [c12]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM 2014: 162-173 - [c11]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Finding Shortest Paths Between Graph Colourings. IPEC 2014: 221-233 - [c10]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) 2014: 287-298 - [c9]Matthew Johnson, Daniël Paulusma, Anthony Stewart:
Knocking Out P k -free Graphs. MFCS (2) 2014: 396-407 - [i3]Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma:
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR abs/1403.6347 (2014) - [i2]Shenwei Huang, Matthew Johnson, Daniël Paulusma:
Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR abs/1407.1480 (2014) - [i1]Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song:
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR abs/1407.1482 (2014) - 2013
- [c8]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC 2013: 130-140 - 2012
- [j21]
- 2011
- [j20]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics 38: 161-166 (2011) - [j19]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding paths between 3-colorings. Journal of Graph Theory 67(1): 69-82 (2011) - 2010
- [j18]Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics 310(9): 1413-1423 (2010) - [j17]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 8(2): 101 (2010) - [c7]Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck:
Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251
2000 – 2009
- 2009
- [j16]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009) - [j15]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 7(2): 147 (2009) - [j14]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009) - 2008
- [j13]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(5-6): 913-919 (2008) - [j12]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. J. Discrete Algorithms 6(4): 539 (2008) - [j11]Jan van den Heuvel, Matthew Johnson:
Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008) - [j10]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008) - [c6]Matthew Johnson, Daniël Paulusma, Chantal Wood:
Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41 - [c5]Matthew Johnson, Luis Cereceda, Jan van den Heuvel:
Finding Paths Between 3-Colourings. IWOCA 2008: 182-196 - 2007
- [j9]Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electronic Notes in Discrete Mathematics 29: 463-469 (2007) - [j8]Matthew Johnson:
Amalgamations of factorizations of complete graphs. J. Comb. Theory, Ser. B 97(4): 597-611 (2007) - [c4]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340 - [c3]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177 - 2006
- [j7]Anthony J. W. Hilton, Matthew Johnson:
Cycle decompositions of the complete graph. Ars Comb. 81 (2006) - [c2]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261 - [e2]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents] - 2005
- [e1]Hajo Broersma, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, ISBN 1-904987-10-9 [contents] - 2004
- [j6]Anthony J. W. Hilton, Matthew Johnson:
Amalgamations of factorizations of complete equipartite graphs. Discrete Mathematics 284(1-3): 157-175 (2004) - [j5]Changiz Eslahchi, Matthew Johnson:
Characterization of graphs with hall number 2. Journal of Graph Theory 45(2): 81-100 (2004) - [c1]Jan van den Heuvel, Matthew Johnson:
The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126 - 2003
- [j4]David Bedford, Matthew Johnson, Matthew A. Ollis:
Defining sets for Latin squares given that they are based on groups. Eur. J. Comb. 24(1): 129-135 (2003) - [j3]Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland:
Amalgamations of connected k-factorizations. J. Comb. Theory, Ser. B 88(2): 267-279 (2003) - [j2]Anthony J. W. Hilton, Matthew Johnson:
An algorithm for finding factorizations of complete graphs. Journal of Graph Theory 43(2): 132-136 (2003) - 2001
- [j1]Matthew Johnson, David Bedford:
Weak critical sets in cyclic Latin squares. Australasian J. Combinatorics 23: 301- (2001)
Coauthor Index
[j39] [i20] [j36] [j35] [c22] [c21] [i19] [i18] [j34] [j33] [c20] [c19] [c18] [c17] [i17] [i16] [i15] [i14] [i13] [i12] [i11] [j32] [j30] [j29] [i9] [j28] [j27] [j26] [j25] [j24] [c14] [c13] [i8] [i7] [i6] [i4] [j23] [j22] [c12] [c11] [c10] [c9] [i3] [i2] [i1] [c8] [j21] [j20] [j18] [c7] [j14] [j10] [c6] [c4] [c2]
maintained by 
, founded at 
, founded at 
last updated on 2019-02-04 22:29 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
