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="Kashiwabara, Toshinobu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
Masaki Nakanishi
,
Kiyoharu Hamaguchi
,
Toshinobu Kashiwabara
Lecture Notes in Computer Science
1858
, 2000, pp. 467-476
Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
Toshinobu Kashiwabara
,
Sumio Masuda
,
Kazuo Nakajima
,
Toshio Fujisawa
Journal of Algorithms
13
, 1992, pp. 161-174
Polynomial time algorithms on circular-arc overlap graphs
Toshinobu Kashiwabara
,
Sumio Masuda
,
Kazuo Nakajima
,
Toshio Fujisawa
Networks
21
(2), 1991, pp. 195-203
Efficient algorithms for finding maximum cliques of an overlap graph
Sumio Masuda
,
Kazuo Nakajima
,
Toshinobu Kashiwabara
,
Toshio Fujisawa
Networks
20
(2), 1990, pp. 157-171