Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Johnson, Matthew"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Obtaining online ecological colourings by generalizing first-fit
Matthew Johnson
,
Viresh Patel
,
Daniël Paulusma
,
Théophile Trunck
Theory of Computing Systems
54
(2), 2014, pp. 244-260
Secluded connectivity problems
Shiri Chechik
,
Matthew P. Johnson
,
Merav Parter
,
David Peleg
Lecture Notes in Computer Science
8125
, 2013, pp. 301-312
Algorithms to measure diversity and clustering in social networks through dot product graphs
Matthew Johnson
,
Daniël Paulusma
,
Erik Jan van Leeuwen
Lecture Notes in Computer Science
8283
, 2013, pp. 130-140
Finding paths between 3-colorings
Luis Cereceda
,
Jan van den Heuvel
,
Matthew Johnson
Journal of Graph Theory
67
(1), 2011, pp. 69-82
Obtaining online ecological colourings by generalizing first-fit
Matthew Johnson
,
Viresh Patel
,
Daniël Paulusma
,
Théophile Trunck
Lecture Notes in Computer Science
6072
, 2010, pp. 240-251
Upper bounds and algorithms for parallel knock-out numbers
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
Theoretical Computer Science
410
(14), 2009, pp. 1319-1327
The computational complexity of the parallel knock-out problem
Hajo Broersma
,
Matthew Johnson
,
Daniël Paulusma
,
Iain A. Stewart
Theoretical Computer Science
393
(1-3), 2008, pp. 182-195
Transversals of subtree hypergraphs and the source location problem in digraphs
Jan van den Heuvel
,
Matthew Johnson
Networks
51
(2), 2008, pp. 113-119
Mixing 3-colourings in bipartite graphs
Luis Cereceda
,
Jan van den Heuvel
,
Matthew Johnson
Lecture Notes in Computer Science
4769
, 2007, pp. 166-177
Amalgamations of factorizations of complete graphs
Matthew Johnson
Journal of Combinatorial Theory Series B
97
(4), 2007, pp. 597-611
Characterization of graphs with hall number 2
Changiz Eslahchi
,
Matthew Johnson
Journal of Graph Theory
45
(2), 2004, pp. 81-100
Amalgamations of connected
k
-factorizations
A.J.W. Hilton
,
Matthew Johnson
,
C.A. Rodger
,
E.B. Wantland
Journal of Combinatorial Theory Series B
88
(2), 2003, pp. 267-279
An algorithm for finding factorizations of complete graphs
A.J.W. Hilton
,
Matthew Johnson
Journal of Graph Theory
43
(2), 2003, pp. 132-136