default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTeofilo F. Gonzalez
Person information
- affiliation: University of California, Santa Barbara, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2018
[p9]Teofilo F. Gonzalez:
Introduction, Overview, and Notation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 1-24- [p8]Teofilo F. Gonzalez:
Basic Methodologies and Applications. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 27-41 - [p7]Teofilo F. Gonzalez:
Restriction Methods. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 43-54 - [p6]Teofilo F. Gonzalez:
Introduction, Overview and Definitions. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p5]Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez:
Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [p4]Teofilo F. Gonzalez, Si-Qing Zheng:
Minimum Edge Length Rectangular Partitions. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - [e5]Teofilo F. Gonzalez:
Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications. Chapman and Hall/CRC 2018, ISBN 9781351236423 [contents] - [e4]Teofilo F. Gonzalez:
Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications. Chapman and Hall/CRC 2018, ISBN 9781351235426 [contents] - 2014
- [p3]Teofilo F. Gonzalez:
Approximation Algorithms and Metaheuristics. Computing Handbook, 3rd ed. (1) 2014: 12: 1-26 - [e3]Teofilo F. Gonzalez, Jorge Diaz-Herrera, Allen Tucker:
Computing Handbook, Third Edition: Computer Science and Software Engineering. CRC Press 2014, ISBN 978-1-43-989852-9 [contents] - 2011
- [c19]Amit M. Bhosle, Teofilo F. Gonzalez:
Finding Optimal Geodesic Bridges Between Two Simple Polygons. CCCG 2011 - 2010
- [j55]Christopher C. Cipriano, Teofilo F. Gonzalez:
Multicasting in the hypercube, chord and binomial graphs. Inf. Process. Lett. 110(17): 774-777 (2010) - [j54]Arturo Gonzalez-Gutierrez
, Teofilo F. Gonzalez:
Approximating corridors and tours via restriction and relaxation techniques. ACM Trans. Algorithms 6(3): 56:1-56:36 (2010)
2000 – 2009
- 2009
- [j53]Teofilo F. Gonzalez:
Improved Communication Schedules with Buffers. Parallel Process. Lett. 19(1): 129-139 (2009) - 2008
- [j52]Teofilo F. Gonzalez:
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode. IEEE Trans. Parallel Distributed Syst. 19(8): 1034-1043 (2008) - [i2]Amit M. Bhosle, Teofilo F. Gonzalez:
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures. CoRR abs/0810.3438 (2008) - [i1]Amit M. Bhosle, Teofilo F. Gonzalez:
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links. CoRR abs/0811.1301 (2008) - 2007
- [j51]Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez:
Complexity of the minimum-length corridor problem. Comput. Geom. 37(2): 72-103 (2007) - [c18]Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez:
Approximation Algorithms for the Minimum-Length Corridor and Related Problems. CCCG 2007: 253-256 - [c17]Teofilo F. Gonzalez:
Message Dissemination under the Multicasting Communication Mode. PDCAT 2007: 3-4 - [e2]Teofilo F. Gonzalez:
Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC 2007, ISBN 978-1-58488-550-4 [contents] - [r7]Teofilo F. Gonzalez:
Introduction, Overview, and Notation. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r6]Teofilo F. Gonzalez:
Basic Methodologies and Applications. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r5]Teofilo F. Gonzalez:
Restriction Methods. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r4]Teofilo F. Gonzalez:
Message Dissemination Using Modern Communication Primitives. Handbook of Parallel Computing 2007 - [r3]Si-Qing Zheng, Teofilo F. Gonzalez:
Minimum-Edge Length Rectangular Partitions. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j50]Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo:
Minimizing total completion time on uniform machines with deadline constraints. ACM Trans. Algorithms 2(1): 95-115 (2006) - [j49]Teofilo F. Gonzalez, David Serena:
Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. 369(1-3): 427-435 (2006) - 2005
- [j48]Amit M. Bhosle, Teofilo F. Gonzalez:
Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. Int. J. Comput. Geom. Appl. 15(6): 609-630 (2005) - [j47]Russell Brandt, Teofilo F. Gonzalez:
Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode. J. Interconnect. Networks 6(4): 383-406 (2005) - [c16]Teofilo F. Gonzalez:
Improving the Computation and Communication Time with Buffers. IASTED PDCS 2005: 336-341 - [c15]Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez:
Performance data collection using a hybrid approach. ESEC/SIGSOFT FSE 2005: 126-135 - 2004
- [j46]Amit M. Bhosle, Teofilo F. Gonzalez:
Algorithms for Single Link Failure Recovery and Related Problems. J. Graph Algorithms Appl. 8(3): 275-294 (2004) - [j45]Teofilo F. Gonzalez, David Serena:
n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices. Parallel Comput. 30(8): 973-998 (2004) - [j44]Teofilo F. Gonzalez, David Serena:
Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. 326(1-3): 155-185 (2004) - [j43]Teofilo F. Gonzalez:
Efficient Resource Utilization in Parallel and Distributed Systems. J. Supercomput. 28(1): 5-6 (2004) - [r2]Teofilo F. Gonzalez:
Online Dictionary Structures. Handbook of Data Structures and Applications 2004 - [r1]Teofilo F. Gonzalez:
Flexible Hybrid Flowshops. Handbook of Scheduling 2004 - 2003
- [j42]Teofilo F. Gonzalez:
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. IEEE Trans. Parallel Distributed Syst. 14(7): 701-708 (2003) - 2002
- [c14]Teofilo F. Gonzalez, David Serena:
Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS 2002: 61-66 - [e1]Selim G. Akl, Teofilo F. Gonzalez:
International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA. IASTED/ACTA Press 2002, ISBN 0-88986-366-0 [contents] - 2001
- [j41]Teofilo F. Gonzalez:
Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica 29(4): 511-533 (2001) - [j40]Teofilo F. Gonzalez:
On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. 12(6): 791-808 (2001) - [c13]Teofilo F. Gonzalez:
Gossiping in the Multicasting Communication Environment. IPDPS 2001: 55 - 2000
- [j39]Teofilo F. Gonzalez:
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. Algorithmica 28(2): 255-267 (2000) - [j38]Teofilo F. Gonzalez:
Distributed Algorithm for Multimessage Multicasting. J. Interconnect. Networks 1(4): 303-314 (2000)
1990 – 1999
- 1998
- [j37]Teofilo F. Gonzalez:
Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. Inf. Process. Lett. 67(5): 267-271 (1998) - [j36]Teofilo F. Gonzalez:
Complexity and Approximations for Multimessage Multicasting. J. Parallel Distributed Comput. 55(2): 215-235 (1998) - [j35]Teofilo F. Gonzalez:
Bounded Fan-Out Multimessage Multicasting. Nord. J. Comput. 5(3): 196-213 (1998) - [j34]Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan:
Self-Stabilizing Algorithms for Tree Metrics. Parallel Process. Lett. 8(1): 121-133 (1998) - [j33]Teofilo F. Gonzalez, Si-Qing Zheng:
On Ensuring Multilayer Wirability by Stretching Layouts. VLSI Design 7(4): 365-383 (1998) - 1997
- [c12]Teofilo F. Gonzalez:
MultiMessage Multicasting: Complexity and Approximations. HICSS (1) 1997: 211-220 - 1996
- [j32]Ömer Egecioglu, Teofilo F. Gonzalez:
A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (1996) - [c11]Teofilo F. Gonzalez:
Multi-Message Multicasting. IRREGULAR 1996: 217-228 - 1995
- [j31]Teofilo F. Gonzalez:
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. 54(3): 129-131 (1995) - [j30]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks:
Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995) - 1994
- [j29]Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng:
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. Comput. Geom. 4: 1-11 (1994) - [j28]Teofilo F. Gonzalez, Si-Qing Zheng:
Single phase three-layer channel routing algorithms. Integr. 17(2): 141-151 (1994) - [c10]Douglas Chang, Teofilo F. Gonzalez, Oscar H. Ibarra:
A flow based approach to the pin redistribution problem for multi-chip modules. Great Lakes Symposium on VLSI 1994: 114-119 - 1993
- [j27]Teofilo F. Gonzalez, Si-Qing Zheng:
An efficient divide and conquer approximation algorithm for partitionning into D-boxes. Int. J. Comput. Geom. Appl. 3(4): 417-428 (1993) - [p2]Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara, Si-Qing Zheng:
Switch-Box Routing under the two-Overlap wiring Model. Algorithmic Aspects of VLSI Layout 1993: 265-308 - [p1]Teofilo F. Gonzalez, Sing-Ling Lee:
Routing around two Rectangles to minimize the Layout Area. Algorithmic Aspects of VLSI Layout 1993: 365-397 - 1992
- [j26]Teofilo F. Gonzalez, Si-Qing Zheng:
Grid stretching algorithms for routing multiterminal nets through a rectangle. Integr. 13(2): 153-177 (1992) - [c9]Teofilo F. Gonzalez, Toshio Murayama:
Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC 1992: 97-105 - [c8]Teofilo F. Gonzalez:
The On-Line d-Dimensional Dictionary Problem. SODA 1992: 376-385 - 1991
- [j25]Teofilo F. Gonzalez:
Covering a Set of Points in Multidimensional Space. Inf. Process. Lett. 40(4): 181-188 (1991) - [c7]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks:
Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296 - [c6]Teofilo F. Gonzalez, Mohammadreza Razzazi:
On the generalized channel definition problem. Great Lakes Symposium on VLSI 1991: 88-91 - 1990
- [j24]Teofilo F. Gonzalez, Si-Qing Zheng:
Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica 5(1): 11-42 (1990) - [j23]Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni:
Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. 2(3): 219-224 (1990) - [c5]Teofilo F. Gonzalez, Si-Qing Zheng:
Multiterminal-net routing by grid stretching. ICCD 1990: 396-399
1980 – 1989
- 1989
- [j22]Teofilo F. Gonzalez, Si-Qing Zheng:
Stretching and three-layer wiring planar layouts. Integr. 8(2): 111-141 (1989) - [j21]Teofilo F. Gonzalez, Si-Qing Zheng:
Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. 7(6): 591-610 (1989) - [j20]Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara:
An approximation algorithm for the via placement problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(3): 219-228 (1989) - 1988
- [j19]Teofilo F. Gonzalez, Sing-Ling Lee:
A linear time algorithm for optimal routing around a rectangle. J. ACM 35(4): 810-831 (1988) - [j18]Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara:
Minimization of the number of layers for single row routing with fixed street capacity. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 7(3): 420-424 (1988) - [c4]Teofilo F. Gonzalez, Si-Qing Zheng:
Simple Three-Layer Channel Routing Algorithms. AWOC 1988: 237-246 - 1987
- [j17]Teofilo F. Gonzalez, Sing-Ling Lee:
A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16(4): 669-704 (1987) - 1986
- [j16]Teofilo F. Gonzalez, Sing-Ling Lee:
Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers 35(6): 543-549 (1986) - 1985
- [j15]Teofilo F. Gonzalez:
Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. 38: 293-306 (1985) - [c3]Teofilo F. Gonzalez, Si-Qing Zheng:
Bounds for partitioning rectilinear polygons. SCG 1985: 281-287 - 1984
- [j14]Simeon C. Ntafos, Teofilo F. Gonzalez:
On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. 29(2): 225-242 (1984) - [j13]Teofilo F. Gonzalez:
An Approximation Problem for the Multi-Via Assignment Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3(4): 257-264 (1984) - 1982
- [j12]Teofilo F. Gonzalez, Donald B. Johnson:
Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. 15(3): 119-124 (1982) - [j11]Teofilo F. Gonzalez:
Unit Execution Time Shop Problems. Math. Oper. Res. 7(1): 57-66 (1982) - [j10]Teofilo F. Gonzalez, Joseph F. JáJá:
Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. 11(4): 633-662 (1982) - [c2]Teofilo F. Gonzalez:
On Minimizing the Number of Page Faults with Complete Information. IMACS World Congress 1982: 77-81 - 1980
- [j9]Teofilo F. Gonzalez, Donald B. Johnson:
A New Algorithm for Preemptive Scheduling of Trees. J. ACM 27(2): 287-312 (1980) - [j8]Teofilo F. Gonzalez, Joseph F. JáJá:
On the Complexity of Computing Bilinear Forms with {0, 1} Constants. J. Comput. Syst. Sci. 20(1): 77-95 (1980)
1970 – 1979
- 1979
- [j7]Teofilo F. Gonzalez:
A Note on Open Shop Preemptive Schedules. IEEE Trans. Computers 28(10): 782-786 (1979) - 1978
- [j6]Teofilo F. Gonzalez, Sartaj Sahni:
Flowshop and Jobshop Schedules: Complexity and Approximation. Oper. Res. 26(1): 36-52 (1978) - [j5]Teofilo F. Gonzalez, Sartaj Sahni:
Preemptive Scheduling of Uniform Processor Systems. J. ACM 25(1): 92-101 (1978) - 1977
- [j4]Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni:
Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. 6(1): 155-166 (1977) - [j3]Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta:
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. ACM Trans. Math. Softw. 3(1): 60-64 (1977) - 1976
- [j2]Sartaj Sahni, Teofilo F. Gonzalez:
P-Complete Approximation Problems. J. ACM 23(3): 555-565 (1976) - [j1]Teofilo F. Gonzalez, Sartaj Sahni:
Open Shop Scheduling to Minimize Finish Time. J. ACM 23(4): 665-679 (1976) - 1974
- [c1]Sartaj Sahni, Teofilo F. Gonzalez:
P-Complete Problems and Approximate Solutions. SWAT 1974: 28-32
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
