Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Matthew Johnson
    Last name: 0002
    DBLP: j/MatthewJohnson2
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 51 of 51  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Kempe equivalence of colourings of cubic graphs.
    Eur. J. Comb. 2017, Volume 59 (0) 2017
    Conference paper
    Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart.
    Surjective H-Colouring: New Hardness Results.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Petr A. Golovach, Matthew Johnson 0002, Daniël Paulusma, Jian Song.
    A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
    Journal of Graph Theory 2017, Volume 84 (0) 2017
    Conference paper
    Alexandre Blanché, Konrad Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev.
    Clique-Width for Graph Classes Closed under Complementation.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart.
    Surjective H-Colouring: New Hardness Results.
    Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings 2017 (0) 2017
    Journal article
    Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma.
    Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Independent Feedback Vertex Set for $P_5$-free Graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Independent Feedback Vertex Sets for Graphs of Bounded Diameter.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Foad Lotfifar, Matthew Johnson 0002.
    A Serial Multilevel Hypergraph Partitioning Algorithm.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Alexandre Blanché, Konrad Dabrowski, Matthew Johnson 0002, Daniël Paulusma.
    Colouring on Hereditary Graph Classes Closed under Complementation.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma.
    The price of connectivity for cycle transversals.
    Eur. J. Comb. 2016, Volume 58 (0) 2016
    Conference paper
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.
    Journal of Graph Theory 2016, Volume 83 (0) 2016
    Journal article
    Markus Mäsker, Lars Nagel 0001, André Brinkmann, Foad Lotfifar, Matthew Johnson 0002.
    Smart Grid-aware scheduling in data centres.
    Computer Communications 2016, Volume 96 (0) 2016
    Conference paper
    Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma.
    Finding Shortest Paths Between Graph Colourings.
    Algorithmica 2016, Volume 75 (0) 2016
    Conference paper
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    A Reconfigurations Analogue of Brooks' Theorem and its Consequences.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Kempe Equivalence of Colourings of Cubic Graphs.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen.
    Algorithms for diversity and clustering in social networks through dot product graphs.
    Social Networks 2015, Volume 41 (0) 2015
    Journal article
    Matthew Johnson 0002, Daniël Paulusma, Anthony Stewart.
    Knocking out
    Discrete Applied Mathematics 2015, Volume 190 (0) 2015
    Conference paper
    Konrad Dabrowski, François Dross, Matthew Johnson 0002, Daniël Paulusma.
    Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Tatiana Romina Hartinger, Matthew Johnson 0002, Martin Milanic, Daniël Paulusma.
    The Price of Connectivity for Cycle Transversals.
    Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II 2015 (0) 2015
    Conference paper
    Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson 0002.
    On a conjecture of Mohar concerning Kempe equivalence of regular graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen.
    What Graphs are 2-Dot Product Graphs?
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Shenwei Huang, Matthew Johnson 0002, Daniël Paulusma.
    Narrowing the Complexity Gap for Colouring (
    Comput. J. 2015, Volume 58 (0) 2015
    Conference paper
    Matthew Johnson 0002, Erik Jan van Leeuwen, Daniël Paulusma.
    What Graphs are 2-Dot Product Graphs?
    Electronic Notes in Discrete Mathematics 2015, Volume 49 (0) 2015
    Journal article
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    Kempe Equivalence of Colourings of Cubic Graphs.
    Electronic Notes in Discrete Mathematics 2015, Volume 49 (0) 2015
    Conference paper
    Konrad Dabrowski, François Dross, Matthew Johnson 0002, Daniël Paulusma.
    Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
    Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers 2016 (0) 2015
    Conference paper
    Matthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck.
    Obtaining Online Ecological Colourings by Generalizing First-Fit.
    Theory Comput. Syst. 2014, Volume 54 (0) 2014
    Journal article
    Marthe Bonamy, Matthew Johnson 0002, Ioannis Lignos, Viresh Patel, Daniël Paulusma.
    Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
    J. Comb. Optim. 2014, Volume 27 (0) 2014
    Journal article
    Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma.
    Colouring Reconfiguration Is Fixed-Parameter Tractable.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Shenwei Huang, Matthew Johnson 0002, Daniël Paulusma.
    Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs.
    Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings 2014 (0) 2014
    Journal article
    Shenwei Huang, Matthew Johnson 0002, Daniël Paulusma.
    Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Petr A. Golovach, Matthew Johnson 0002, Daniël Paulusma, Jian Song.
    A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Carl Feghali, Matthew Johnson 0002, Daniël Paulusma.
    A Reconfigurations Analogue of Brooks' Theorem.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II 2014 (0) 2014
    Conference paper
    Matthew Johnson 0002, Daniël Paulusma, Anthony Stewart.
    Knocking Out P k -free Graphs.
    Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II 2014 (0) 2014
    Conference paper
    Matthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma.
    Finding Shortest Paths Between Graph Colourings.
    Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers 2014 (0) 2014
    Conference paper
    Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen.
    Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.
    Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings 2013 (0) 2013
    Conference paper
    Marthe Bonamy, Matthew Johnson 0002, Ioannis Lignos, Viresh Patel, Daniël Paulusma.
    On the diameter of reconfiguration graphs for vertex colourings.
    Electronic Notes in Discrete Mathematics 2011, Volume 38 (0) 2011
    Conference paper
    Matthew Johnson 0002, Daniël Paulusma, Chantal Wood.
    Path factors and parallel knock-out schemes of almost claw-free graphs.
    Discrete Mathematics 2010, Volume 310 (0) 2010
    Conference paper
    Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider.
    Editorial.
    J. Discrete Algorithms 2009, Volume 7 (0) 2009
    Conference paper
    Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma.
    Upper bounds and algorithms for parallel knock-out numbers.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider.
    Preface.
    J. Discrete Algorithms 2008, Volume 6 (0) 2008
    Conference paper
    Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart.
    The computational complexity of the parallel knock-out problem.
    Theor. Comput. Sci. 2008, Volume 393 (0) 2008
    Conference paper
    Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma.
    Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
    Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart.
    The Computational Complexity of the Parallel Knock-Out Problem.
    LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Anthony J. W. Hilton, Matthew Johnson 0002.
    Amalgamations of factorizations of complete equipartite graphs.
    Discrete Mathematics 2004, Volume 284 (0) 2004
    Conference paper
    Changiz Eslahchi, Matthew Johnson 0002.
    Characterization of graphs with hall number 2.
    Journal of Graph Theory 2004, Volume 45 (0) 2004
    Conference paper
    Anthony J. W. Hilton, Matthew Johnson 0002.
    An algorithm for finding factorizations of complete graphs.
    Journal of Graph Theory 2003, Volume 43 (0) 2003
    Conference paper
    David Bedford, Matthew Johnson 0002, Matthew A. Ollis.
    Defining sets for Latin squares given that they are based on groups.
    Eur. J. Comb. 2003, Volume 24 (0) 2003
    Conference paper
    Anthony J. W. Hilton, Matthew Johnson 0002, Christopher A. Rodger, Evan B. Wantland.
    Amalgamations of connected k-factorizations.
    J. Comb. Theory, Ser. B 2003, Volume 88 (0) 2003
    Journal article
    Matthew Johnson 0002, David Bedford.
    Weak critical sets in cyclic Latin squares.
    Australasian J. Combinatorics 2001, Volume 23 (0) 2001
    Show item 1 to 51 of 51  

    Your query returned 51 matches in the database.