default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Johnson 0002
Person information
- affiliation: University of Durham, Department of Computer Science, UK
Other persons with the same name
- Matthew Johnson — disambiguation page
- Matt Johnson 0001 (aka: Matthew Johnson 0001, Matthew J. Johnson 0001) — Florida Institute for Human and Machine Cognition (IHMC), Pensacola, USA
- Matthew Johnson 0003
![[0000-0002-1019-8036]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1019-8036")
(aka: Matthew A. Johnson 0003) — Microsoft Research, Cambridge, UK (and 1 more) - Matthew Johnson 0004 — University of Tennessee, National Institute for Computational Sciences, Oak Ridge, TN, USA
- Matthew Johnson 0005 — Clemson University, Department of Industrial Engineering, SC, USA
- Matthew Johnson 0006 — Leuphana University Lüneburg, Centre for Sustainability Management, Germany
- Matthew Johnson 0007 — California State University Sacramento (CSUS), CA, USA
- Matthew Johnson 0008 — University of California, Berkeley, Department of Bioengineering, CA, USA
- Matthew Johnson 0009 — University of California, Irvine, Donald Bren School of Information and Computer Sciences, CA, USA
- Matthew Johnson 0010 — University of Southampton, Faculty of Health Sciences, UK
- Matthew Johnson 0011 (aka: Matthew William Johnson) — University of Washington, Paul G. Allen School of Computer Science, Seattle, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j54]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. Eur. J. Comb. 117: 103821 (2024)- [c34]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS 2024: 2153-2155 - [c33]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA 2024: 206-217 - [c32]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT 2024: 29:1-29:17 - 2023
- [j53]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. 77: 459-485 (2023) - [c31]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS 2023: 57:1-57:15 - [i31]Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR abs/2305.01104 (2023) - [i30]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023) - [i29]Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye:
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR abs/2312.16653 (2023) - 2022
- [j52]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Odd Cycle Transversals in H-free graphs. J. Comput. Syst. Sci. 128: 71-85 (2022) - [j51]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing subset transversals in H-free graphs. Theor. Comput. Sci. 902: 76-92 (2022) - [i28]Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye:
The Complexity of Matching Games: A Survey. CoRR abs/2202.06898 (2022) - [i27]Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR abs/2211.12203 (2022) - [i26]Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework For Forbidden Subgraphs. CoRR abs/2211.12887 (2022) - 2021
- [j50]Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021) - [j49]Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen:
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31(1): 1-16 (2021) - [j48]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98(1): 81-109 (2021) - [j47]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867: 30-39 (2021) - [c30]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Preface. BCC 2021: vii-viii - [c29]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. WADS 2021: 229-242 - [e3]Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma:
Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. Cambridge University Press 2021, ISBN 978-1-009-01888-3 [contents] - 2020
- [j46]Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Connected Vertex Cover for (sP1+P5)-Free Graphs. Algorithmica 82(1): 20-40 (2020) - [j45]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - [j44]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34(2): 1107-1147 (2020) - [c28]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c27]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199 - [i25]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020) - [i24]Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. CoRR abs/2005.13938 (2020) - [i23]Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. CoRR abs/2007.14514 (2020)
2010 – 2019
- 2019
- [j43]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j42]Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-colouring: New hardness results. Comput. 8(1): 27-42 (2019) - [j41]Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma:
Report on BCTCS & AlgoUK 2019. Bull. EATCS 128 (2019) - [j40]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B 135: 179-199 (2019) - [j39]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory 91(3): 267-289 (2019) - [j38]Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92(4): 377-393 (2019) - [c26]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-width for hereditary graph classes. BCC 2019: 1-56 - [c25]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c24]Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT 2019: 258-273 - [c23]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. WADS 2019: 181-195 - [i22]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-Width for Hereditary Graph Classes. CoRR abs/1901.00335 (2019) - [i21]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - [i20]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. CoRR abs/1910.05254 (2019) - 2018
- [j37]Carl Feghali, Matthew Johnson, Daniel Thomas:
Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. 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. J. 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 K. 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. Comput. Commun. 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. J. 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. Discret. Appl. Math. 190-191: 100-108 (2015) - [j26]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. 49: 243-249 (2015) - [j25]Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma:
What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. 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. Soc. 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]Iain A. Stewart, Daniël Paulusma, Matthew Johnson:
Editorial. J. Discrete Algorithms 12: 1 (2012) - 2011
- [j20]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38: 161-166 (2011) - [j19]Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Finding paths between 3-colorings. J. 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. Discret. Math. 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. Discret. Math. 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. Electron. Notes Discret. Math. 29: 463-469 (2007) - [j8]Matthew Johnson:
Amalgamations of factorizations of complete graphs. J. Comb. Theory 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. Discret. Math. 284(1-3): 157-175 (2004) - [j5]Changiz Eslahchi, Matthew Johnson:
Characterization of graphs with hall number 2. J. 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 B 88(2): 267-279 (2003) - [j2]Anthony J. W. Hilton, Matthew Johnson:
An algorithm for finding factorizations of complete graphs. J. Graph Theory 43(2): 132-136 (2003) - 2001
- [j1]Matthew Johnson, David Bedford:
Weak critical sets in cyclic Latin squares. Australas. J Comb. 23: 301- (2001)
Coauthor Index
Konrad K. Dabrowski
aka: Konrad Kazimierz Dabrowski
aka: Konrad Kazimierz Dabrowski
[j54] [c34] [c33] [c32] [j53] [c31] [i31] [i30] [i29] [j52] [j51] [i28] [i27] [i26] [j50] [j49] [j48] [j47] [c30] [c29] [e3] [j46] [j45] [j44] [c28] [c27] [i25] [i24] [i23] [j43] [j42] [j41] [j39] [j38] [c26] [c25] [c24] [c23] [i22] [i21] [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]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
