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
[1]
Hilfe
Suche: Author="Masuyama, Shigeru"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum and Addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph''
Hirotoshi Honma
,
Kodai Abe
,
Shigeru Masuyama
Information Processing Letters
111
(18), 2011, pp. 891-894
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Shin-ichi Nakayama
,
Shigeru Masuyama
Information Processing Letters
103
(6), 2007, pp. 216-221
A parallel algorithm for solving the coloring problem on trapezoid graphs
Shin-ichi Nakayama
,
Shigeru Masuyama
Information Processing Letters
62
(6), 1997, pp. 323-327
Edge-disjoint packings of graphs
Derek G. Corneil
,
Shigeru Masuyama
,
S. Louis Hakimi
Discrete Applied Mathematics
50
, 1994, pp. 135-148
Deciding whether graph
G
has page number one is in NC
Shigeru Masuyama
,
Shozo Naito
Information Processing Letters
44
, 1992, pp. 7-10
On the tree packing problem
Shigeru Masuyama
Discrete Applied Mathematics
35
, 1992, pp. 163-166
Chain packing in graphs
Shigeru Masuyama
,
Toshihide Ibaraki
Algorithmica
6
, 1991, pp. 826-839