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="Araki, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simplified
{\tilde{O}}(nm)
time edge-splitting algorithm in undirected graphs
H. Nagamochi
,
S. Nakamura
,
T. Ibaraki
Algorithmica
26
(1), 2000, pp. 50-67
Algorithms for determining the geometrical congruity in two and three dimensions
Tatsuya Akutsu
Lecture Notes in Computer Science
650
, 1992, pp. 279-288
Lowness and the complexity of sparse and tally descriptions
V. Arvind
,
J. Köbler
,
M. Mundhenk
Lecture Notes in Computer Science
650
, 1992, pp. 249-258
On probabilistic ACC circuits with an exact-threshold output gate
Richard Beigel
,
Jun Tarui
,
Seinosuke Toda
Lecture Notes in Computer Science
650
, 1992, pp. 420-429
Randomized range-maxima in nearly-constant parallel time
Omer Berkman
,
Yossi Matias
,
Uzi Vishkin
Lecture Notes in Computer Science
650
, 1992, pp. 135-144
Higher order communicating processes with value-passing, assignment and return of results
Dominique Bolignano
,
Mourad Debabi
Lecture Notes in Computer Science
650
, 1992, pp. 319-331
Relativizations of the
P=?NP
and other problems: Some developments in structural complexity theory
Ronald V. Book
Lecture Notes in Computer Science
650
, 1992, pp. 175-186
Approximation of polygonal curves with minimum number of line segments
W.S. Chan
,
F. Chin
Lecture Notes in Computer Science
650
, 1992, pp. 378-387
Linear time algorithms for
k
-cutwidth problem
Maw-Hwa Chen
,
Sing-Ling Lee
Lecture Notes in Computer Science
650
, 1992, pp. 21-30
Competitive analysis of the on-line algorithms for multiple stacks systems
Been-Chian Chien
,
Rong-Jaye Chen
,
Wei-Pang Yang
Lecture Notes in Computer Science
650
, 1992, pp. 78-87
Characterizing and recognizing visibility graphs of funnel-shaped polygons
Seung-Hak Choi
,
Sung Yong Shin
,
Kyung-Yong Chwa
Lecture Notes in Computer Science
650
, 1992, pp. 219-228
An efficient parallel algorithm for geometrically characterizing drawings of a class of 3-D objects
Nick D. Dendris
,
Iannis A. Kalafatis
,
Lefteris M. Kirousis
Lecture Notes in Computer Science
650
, 1992, pp. 198-208
On symmetric differences of NP-hard sets with weakly-P-selective sets
Bin Fu
,
Hong-zhou Li
Lecture Notes in Computer Science
650
, 1992, pp. 439-448
Algorithms for a class of min-cut and max-cut problem
Teofilo F. Gonzalez
,
Toshio Murayama
Lecture Notes in Computer Science
650
, 1992, pp. 97-105
Recognizing an envelope of lines in linear time
Eric Guévremont
,
Jack Snoeyink
Lecture Notes in Computer Science
650
, 1992, pp. 370-377
The longest common subsequence problem for small alphabet size between many strings
Koji Hakata
,
Hiroshi Imai
Lecture Notes in Computer Science
650
, 1992, pp. 469-478
Parallel and on-line graph coloring algorithms
Magnús M. Halldórsson
Lecture Notes in Computer Science
650
, 1992, pp. 61-70
Fault-tolerant broadcasting in binary jumping networks
Yijie Han
,
Yoshihide Igarashi
,
Kumiko Kanai
,
Kinya Miura
Lecture Notes in Computer Science
650
, 1992, pp. 145-154
Algorithms for rectilinear optimal multicast tree problem
Jan-Ming Ho
,
M.T. Ko
,
Tze-Heng Ma
,
Ting-Yi Sung
Lecture Notes in Computer Science
650
, 1992, pp. 106-115
A simple test for the consecutive ones property
Wen-Lian Hsu
Lecture Notes in Computer Science
650
, 1992, pp. 459-468
The application of the searching over separators strategy to solve some NP-complete problems on planar graphs
R.Z. Hwang
,
R.C.T. Lee
Lecture Notes in Computer Science
650
, 1992, pp. 51-60
How to generate realistic sample problems for network optimization
Masao Iri
Lecture Notes in Computer Science
650
, 1992, pp. 342-350
On the complexity of composite numbers
Toshiya Itoh
,
Kenji Horikawa
Lecture Notes in Computer Science
650
, 1992, pp. 229-238
Routing problems on the mesh of buses
Kazuo Iwama
,
Eiji Miyano
,
Yahiko Kambayashi
Lecture Notes in Computer Science
650
, 1992, pp. 155-164
On the relationships among constrained geometric structures
Esther Jennings
,
Andrzej Lingas
Lecture Notes in Computer Science
650
, 1992, pp. 289-298
Seiten 1
2
3
4
5
>