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="Gonzalez, Teofilo"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multicasting in the hypercube, chord and binomial graphs
Christopher C. Cipriano
,
Teofilo F. Gonzalez
Information Processing Letters
110
(17), 2010, pp. 774-777
Improved communication schedules with buffers
Teofilo F. Gonzalez
Parallel Processing Letters
19
(1), 2009, pp. 129-139
Pairwise edge disjoint shortest paths in the
n
-cube
Teofilo F. Gonzalez
,
David Serena
Theoretical Computer Science
369
(1-3), 2006, pp. 427-435
n
-cube network: Node disjoint shortest paths for maximal distance pairs of vertices
Teofilo F. Gonzalez
,
David Serena
Parallel Computing
30
(8), 2004, pp. 973-998
Complexity of pairwise shortest path routing in the grid
Teofilo F. Gonzalez
,
David Serena
Theoretical Computer Science
326
(1-3), 2004, pp. 155-185
Open shop scheduling
Teofilo F. Gonzalez
Computer and Information Science Series
, 2004, pp. 6-6
An efficient algorithm for gossiping in the multicasting communication environment
Teofilo F. Gonzalez
IEEE Transactions on Parallel and Distributed Systems
14
(7), 2003, pp. 701-708
On solving multimessage multicasting problems
Teofilo F. Gonzalez
International Journal of Foundations of Computer Science
12
(6), 2001, pp. 791-808
Self-stabilizing algorithms for tree metrics
Ajoy K. Datta
,
Teofilo F. Gonzalez
,
Visalakshi Thiagarajan
Parallel Processing Letters
8
(1), 1998, pp. 121-133
Improved approximation algorithms for embedding hyperedges in a cycle
Teofilo F. Gonzalez
Information Processing Letters
67
(5), 1998, pp. 267-271
Complexity and approximations for multimessage multicasting
Teofilo F. Gonzalez
Journal Parallel Distributed Computing
55
(2), 1998, pp. 215-235
Multi-message multicasting
Teofilo F. Gonzalez
Lecture Notes in Computer Science
1117
, 1996, pp. 217-228
A simple LP-free approximation algorithm for the minimum weight vertex cover problem
Teofilo F. Gonzalez
Information Processing Letters
54
, 1995, pp. 129-131
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
The on-line
d
-dimensional dictionary problem
Teofilo F. Gonzalez
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 376-385
Covering a set of points in multidimensional space
Teofilo F. Gonzalez
Information Processing Letters
40
, 1991, pp. 181-188
Approximation algorithms for partitioning a rectangle with interior points
Teofilo Gonzalez
,
Si-Qing Zheng
Algorithmica
5
, 1990, pp. 11-42
Improved bounds for rectangular and Guillotine partitions
Teofilo Gonzalez
,
Si-Qing Zheng
Journal Symbolic Computation
7
(6), 1989, pp. 591-610
A linear time algorithm for optimal routing around a rectangle
Teofilo F. Gonzalez
,
Sing-Ling Lee
Journal of the ACM
35
(4), 1988, pp. 810-831
Flowshop and jobshop schedules: complexity and approximation
Teofilo Gonzalez
,
Sartaj Sahni
Operations Research
26
(1), 1978, January, pp. 36-52
Open shop scheduling to minimize finish time
Teofilo Gonzalez
,
Sartaj Sahni
Journal of the ACM
23
(4), 1976, October, pp. 665-679
P-complete approximation problems
Sartaj Sahni
,
Teofilo Gonzalez
Journal of the ACM
23
(3), 1976, July, pp. 555-565