Teofilo F. Gonzalez

Teofilo F. Gonzalez's AcademicInfluence.com Rankings

Teofilo F. Gonzalez

Computer Science

#2787

World Rank

#2918

Historical Rank

#1165

USA Rank

Database

#3270

World Rank

#3407

Historical Rank

#617

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Teofilo F. Gonzalez Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Teofilo Francisco Gonzalez Arce is a Mexican-American computer scientist who is professor emeritus of computer science at the University of California, Santa Barbara. In 1972, Gonzalez was one of the first students who earned a bachelor's degree in computer science in Mexico, at the Monterrey Institute of Technology and Higher Education. He completed his Ph.D. in 1975 from the University of Minnesota under the supervision of Sartaj Sahni. He taught at the University of Oklahoma from 1975 to 1976, at the Pennsylvania State University from 1976 to 1979, at the Monterrey Institute of Technology and Higher Education from 1979 to 1980, and at the University of Texas at Dallas from 1980 to 1984, before joining the UCSB computer science faculty in 1984. He spent Sabbatical Leaves at Utrecht University in the Netherlands and the Monterrey Institute of Technology and Higher Education. Professor Gonzalez became a Fellow of IASTED in 2009.

(See a Problem?)

Teofilo F. Gonzalez's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

P-Complete Approximation Problems (1976) (1773)
Clustering to Minimize the Maximum Intercluster Distance (1985) (1713)
Open Shop Scheduling to Minimize Finish Time (1976) (708)
Flowshop and Jobshop Schedules: Complexity and Approximation (1978) (426)
Bounds for LPT Schedules on Uniform Processors (1977) (268)
Preemptive Scheduling of Uniform Processor Systems (1978) (227)
Covering a Set of Points in Multidimensional Space (1991) (119)
Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series) (2007) (87)
Minimum-energy Broadcast in Simple Graphs with Limited Node Power (2007) (83)
Unit Execution Time Shop Problems (1982) (64)
A New Algorithm for Preemptive Scheduling of Trees (1980) (57)
A Note on Open Shop Preemptive Schedules (1979) (51)
P-Complete Problems and Approximate Solutions (1974) (49)
On the computational complexity of clustering and related problems (1982) (44)
A Computationally Intractable Problem on Simplicial Complexes (1996) (35)
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests (1977) (35)
Performance data collection using a hybrid approach (2005) (30)
Inproved Bounds for Rectangular and Guillotine Partitions (1989) (29)
Bounds for partitioning rectilinear polygons (1985) (24)
A linear time algorithm for optimal routing around a rectangle (1988) (20)
Improved Approximation Algorithms for Embedding Hyperedges in a Cycle (1998) (20)
Complexity and Approximations for Multimessage Multicasting (1998) (16)
Computing Handbook, Third Edition: Computer Science and Software Engineering (2014) (15)
Stretching and three-layer wiring planar layouts (1989) (14)
Reactive Search: Machine Learning for Memory-Based Heuristics (2007) (13)
Simple Three-Layer Channel Routing Algorithms (1988) (13)
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment (2003) (12)
Simple Algorithms for Multimessage Multicasting with Forwarding (1997) (12)
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem (1993) (11)
Optimal Preemptive Scheduling of Two Unrelated Processors (1990) (11)
Approximation Algorithms and Metaheuristics (2014) (11)
On the Complexity of Computing Bilinear Forms with {0, 1} Constants (1980) (11)
A 1.6 Approximation Algorithm for Routing Multiterminal Nets (1987) (10)
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions (1994) (10)
Complexity of the minimum-length corridor problem (2007) (10)
Minimizing total completion time on uniform machines with deadline constraints (2006) (10)
Multicasting using WDM in Multifiber Optical Star Networks (2003) (10)
n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices (2004) (10)
Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications (2018) (9)
Approximation algorithms for partitioning a rectangle with interior points (1990) (9)
Complexity of pairwise shortest path routing in the grid (2004) (9)
Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode (2005) (9)
On the Computational Complexity of Path Cover Problems (1984) (8)
Routing Multiterminal Nets Around a Rectangle (1986) (8)
Performance Guarantees for One-Dimensional Bin Packing (2007) (8)
Networking and Communication (2014) (8)
Evaluation of Arithmetic Expressions with Algebraic Identities (1982) (8)
Multi-Message Multicasting (1996) (7)
Computer science and software engineering (2014) (7)
An Approximation Problem for the Multi-Via Assignment Problem (1984) (7)
The on-line d-dimensional dictionary problem (1992) (7)
Algorithms for Single Link Failure Recovery and Related Problems (2004) (7)
Multimessage multicasting: complexity and approximations (1997) (6)
A flow based approach to the pin redistribution problem for multi-chip modules (1994) (6)
Bounded Fan-Out Multimessage Multicasting (1998) (6)
Architecture and Organization (2014) (6)
Minimization of the number of layers for single row routing with fixed street capacity (1988) (6)
Prize-Collecting Traveling Salesman and Related Problems (2007) (6)
An efficient divide and conquer approximation algorithm for partitionning into D-boxes (1993) (6)
Multimessage Multicasting with Forwarding (1996) (5)
Combinatorial and Algorithmic Issues for Microarray Analysis (2007) (5)
Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, November 9-11, 2004, MIT, Cambridge, USA (2004) (5)
Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems (1998) (5)
Approximation Algorithms for the Minimum-Length Corridor and Related Problems (2007) (4)
Proofs for Improved Approximation Algorithms forMultimessage Multicasting (1996) (4)
Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons (2005) (4)
Approximating corridors and tours via restriction and relaxation techniques (2010) (4)
On Solving Multimessage Multicasting Problems (2001) (3)
Computing Handbook, Third Edition (2014) (3)
Gossiping in the multicasting communication environment (2001) (3)
Routing around two Rectangles to minimize the Layout Area (1993) (3)
Sorting Numbers in Linear Expected Time and Optimal Extra Space (1982) (3)
Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems (2002) (3)
International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA (2002) (3)
Distributed Algorithm for Multimessage Multicasting (1998) (3)
Complexity of k-Pairwise Disjoint Shortest Paths in the Hypercube and Grid Networks (2002) (3)
The Well-Separated Pair Decomposition and Its Applications (2007) (3)
Flexible Hybrid Flowshops (2004) (2)
Single phase three-layer channel routing algorithms (1994) (2)
6 Open Shop Scheduling (2004) (2)
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures (2008) (2)
Self-stabilizing algorithms for tree metrics (1995) (2)
On the generalized channel definition problem (1991) (2)
Message Dissemination under the Multicasting Communication Mode (2007) (2)
Handbook of Approximation Algorithms and Metaheuristics Contemporary and Emerging Applications (2019) (2)
Very Large-Scale Neighborhood Search: Theory, Algorithms, and Applications (2007) (2)
Improved Algorithms for Constructing Hypercube Sp-multicasting Trees (2009) (1)
Message Dissemination Using Modern Communication Primitives (2007) (1)
Computational Science and Graphics (2014) (1)
An approximation algorithm for the via placement problem (1989) (1)
An Efficient Algorithm for the Kolmogorov-Smirnov (1977) (1)
Complexity aspects of map compression (1991) (1)
Pairwise edge disjoint shortest paths in the n-cube (2006) (1)
On Ensuring Multilayer Wirability by Stretching Layouts (1998) (1)
Handbook of Approximation Algorithms and Metaheuristics, Second Edition : Two-Volume Set (2018) (1)
Scheduling Tasks to Minimize the Total Computation and Communication Makespan (2011) (1)
Proceedings of the IASTED International Conference, parallel and distributed computing and systems, August 21-24, 2001, Anaheim, California, USA (2001) (1)
Multicasting in the hypercube, chord and binomial graphs (2010) (1)
Minimum-length corridors: complexity and approximations (2007) (1)
Minimum-Edge Length Rectangular Partitions (2007) (1)
Minimum Edge-Length Rectangular Partitions (2018) (1)
Overview of Computer Science (2014) (1)
QoS Multimedia Multicast Routing (2007) (1)
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links (2008) (1)
Improving the Computation and Communication Time with Buffers (2005) (1)
Switch-Box Routing under the two-Overlap wiring Model (1993) (0)
Distributed Apporximation Algorithms via LP-Duality and Randomization (2007) (0)
Software Quality and Measurement (2014) (0)
Computing Handbook : Two-Volume Set (2019) (0)
Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Heuristics* (2007) (0)
Restriction Methods (2007) (0)
Establishing alternate routes in networks and routes between polygons in two-dimensional space (2008) (0)
Vehicle Scheduling Problems in Graphs (2007) (0)
Online Dictionary Structures (2004) (0)
Discipline of Software Engineering (2014) (0)
Introduction, Overview and Definitions (2018) (0)
Program Committees (2020) (0)
Topology Control Problems for Wireless Ad Hoc Networks (2007) (0)
Generalized Assignment Problem (2007) (0)
Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems (2007) (0)
Balanced Min and Max Cuts Under the Triangle Inequality (1969) (0)
Algorithmic Game Theory and Scheduling (2007) (0)
Proceedings of the fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems, November 3-5, 2003, Marina del Rey, CA, USA (2003) (0)
Approximation Algorithms for Imprecise Computation Task with 0/1 Constraint (2007) (0)
On Minimizing the Number of Page Faults with Complete Information (1982) (0)
Efficient Resource Utilization in Parallel and Distributed Systems (2004) (0)
Principles of Tabu Search (2007) (0)
Partitioning Finite d-Dimensional Integer Grids with Applications (2007) (0)
Software Development Management: Processes and Paradigms (2014) (0)
Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems (2018) (0)
Histograms, Wavelets, Streams, and Approximation (2007) (0)
APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1 (2012) (0)
Finding Optimal Geodesic Bridges Between Two Simple Polygons (2011) (0)
Handbook of Approximation Algorithms and Metaheuristics , Second Edition Methodologies and Traditional Applications (2019) (0)
Introduction, Overview, and Notation (2018) (0)
Asymptotic Polynomial-Time Approximation Schemes (2007) (0)
SP-Multicast Trees for Grids (2011) (0)
LP Rounding and Extensions (2007) (0)
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode (2008) (0)
Variable-Sized Bin Packing and Bin Covering (2007) (0)
NP-Completeness : Theory and Applications (0)
Algorithms and complexity issues in computer-aided design (1990) (0)
Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications (2018) (0)
Proceedings of the 20th IASTED International Conference on Parallel and Distributed Computing and Systems, November 16-18, 2008, Orland, Florida, USA . The IASTED International Symposia on Distributed Sensor Networks . Distributed and Intelligent Multimedia Systems (2008) (0)
Stability of Approximation (2007) (0)
Maximum Planar Subgraph (2007) (0)
Sphere Packing and Medical Applications (2007) (0)
Proceedings of the 23rd IASTED International Conference on Parallel and Distributed Computing and Systems, November 14-16, 2011 in Dallas, USA (2011) (0)
Overlay Networks for Peer-to-Peer Networks (2007) (0)
Greedy Algorithms for Metric Facility Location Problems (2007) (0)
An Efficient Algorithm for Gossiping in the (2003) (0)
Complexity Aspects of Two-Dimensional Data Compression (1995) (0)
Parallel and distributed computing and systems : proceedings of the 14th IASTED International Conference, November 4-6, 2002, Cambridge, USA (2002) (0)
PIN REDISTRIBUTION PROBLEM FOR MULTI-CHIP MODULES: ALGORITHMS AND COMPLEXITY (1995) (0)
Algorithms and Complexity (2014) (0)
LAYER ASSIGNMENT FOR PLANAR LAYOUTS. (1987) (0)
Basic Methodologies and Applications (2018) (0)
Recursive Greedy Methods (2007) (0)
Proceedings of the 21st IASTED International Conference on Parallel and Distributed Computing and Systems, November 2-4, 2009, Cambridge, Massachusetts, USA (2009) (0)
Approximation Algorithms for Multilevel Graph Partitioning (2007) (0)
Approximation Algorithms and Algorithm Mechanism Design (2007) (0)
K-pairwise disjoint shortest paths: algorithms and complexity (2002) (0)
Alhorithms for a Class of Min-Cut and Max-Cut Problem (1992) (0)
Multiterminal-net routing by grid stretching (1990) (0)
Software Modeling, Analysis and Design (2014) (0)
Differential Ratio Approximation (2007) (0)
Improved Communication Schedules with Buffers (2009) (0)
Grid stretching algorithms for routing multiterminal nets through a rectangle (1992) (0)

This paper list is powered by the following services:

Other Resources About Teofilo F. Gonzalez

en.wikipedia.org

What Schools Are Affiliated With Teofilo F. Gonzalez?

Teofilo F. Gonzalez is affiliated with the following schools:

Teofilo F. Gonzalez's Academic­Influence.com Rankings