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="Takaoka, Tadao"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Variations on the bottleneck paths problem
Tong-Wook Shinn
,
Tadao Takaoka
Theoretical Computer Science
575
, 2015, pp. 10-16
Sharing information for the all pairs shortest path problem
Tadao Takaoka
Theoretical Computer Science
520
, 2014, pp. 43-50
An
O(n^3\log\log n/\log^2n)
time algorithm for all pairs shortest paths
Yijie Han
,
Tadao Takaoka
Lecture Notes in Computer Science
7357
, 2012, pp. 131-141
Partial solution and entropy
Tadao Takaoka
Lecture Notes in Computer Science
5734
, 2009, pp. 700-711
Algorithms for
K
-disjoint maximum subarrays
Sung Eun Bae
,
Tadao Takaoka
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 319-339
A sub-cubic time algorithm for the
k
-maximum subarray problem
Sung Eun Bae
,
Tadao Takaoka
Lecture Notes in Computer Science
4835
, 2007, pp. 751-762
Solving shortest paths efficiently on nearly acyclic directed graphs
Shane Saunders
,
Tadao Takaoka
Theoretical Computer Science
370
(1-3), 2007, pp. 94-109
Fusing loopless algorithms for combinatorial generation
Tadao Takaoka
,
Stephen Violich
International Journal of Foundations of Computer Science
18
(2), 2007, pp. 263-293
Improved algorithms for the
K
-maximum subarray problem for small
K
Sung E. Bae
,
Tadao Takaoka
Lecture Notes in Computer Science
3595
, 2005, pp. 621-631
An
O(n^3 \log\log n / \log n)
time algorithm for the all-pairs shortest path problem
Tadao Takaoka
Information Processing Letters
96
(5), 2005, pp. 155-161
A faster algorithm for the all-pairs shortest path problem and its application
Tadao Takaoka
Lecture Notes in Computer Science
3106
, 2004, pp. 278-289
Improved shortest path algorithms for nearly acyclic graphs
Shane Saunders
,
Tadao Takaoka
Theoretical Computer Science
293
(3), 2003, pp. 535-556
Algorithms for pattern involvement in permutations
Michael H. Albert
,
Robert E.L. Aldred
,
Mike D. Atkinson
,
Derek A. Holton
Lecture Notes in Computer Science
2223
, 2001, pp. 355-366
How to color a checkerboard with a given distribution - Matrix rounding achieving low
2\times 2
-discrepancy
Tetsuo Asano
,
Takeshi Tokuyama
Lecture Notes in Computer Science
2223
, 2001, pp. 636-648
A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model
James Aspnes
,
Julia Hartling
,
Ming-Yang Kao
,
Junhyong Kim
,
Gauri Shah
Lecture Notes in Computer Science
2223
, 2001, pp. 403-415
On-line algorithms for cardinality constrained bin packing problems
Luitpold Babel
,
Bo Chen
,
Hans Kellerer
,
Vladimir Kotov
Lecture Notes in Computer Science
2223
, 2001, pp. 695-706
The Cent-dian path problem on tree networks
Ronald I. Becker
,
Yen-I Chiang
,
Isabella Lari
,
Andrea Scozzari
Lecture Notes in Computer Science
2223
, 2001, pp. 743-755
Tight bounds on maximal and maximum matchings
Therese Biedl
,
Erik D. Demaine
,
Christian A. Duncan
,
Rudolf Fleischer
,
Stephen G. Kobourov
Lecture Notes in Computer Science
2223
, 2001, pp. 308-319
On game-theoretic models of networks
Hans L. Bodlaender
,
Michael J. Dinneen
,
Bakhadyr Khoussainov
Lecture Notes in Computer Science
2223
, 2001, pp. 550-561
Small convex quadrangulations of point sets
David Bremner
,
Ferran Hurtado
Lecture Notes in Computer Science
2223
, 2001, pp. 623-635
Baire category and nowhere differentiability for feasible real function
Josef M. Breutzmann
,
David W. Juedes
,
Jack H. Lutz
Lecture Notes in Computer Science
2223
, 2001, pp. 219-230
Computing the quartet distance between evolutionary trees in time
\O(n \log^2 n)
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Christian N.S. Pedersen
Lecture Notes in Computer Science
2223
, 2001, pp. 731-742
Multiprocess time queue
Andrej Brodnik
,
Johan Karlsson
Lecture Notes in Computer Science
2223
, 2001, pp. 599-609
On-line scheduling a batch processing system to minimize total weighted job completion time
Bo Chen
,
Xiaotie Deng
,
Wenan Zang
Lecture Notes in Computer Science
2223
, 2001, pp. 380-389
Semi-normal schedulings: Improvement on Goeman's algorithm
Jianer Chen
,
Jingui Huang
Lecture Notes in Computer Science
2223
, 2001, pp. 48-60
Seiten 1
2
3
4
>