Teofilo F. Gonzalez

According to our database, Teofilo F. Gonzalez authored at least 92 papers between 1974 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

Minimum Edge Length Rectangular Partitions.

Teofilo F. Gonzalez, Si-Qing Zheng

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems.

Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Introduction, Overview and Definitions.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Restriction Methods.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Basic Methodologies and Applications.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Introduction, Overview, and Notation.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2014

Approximation Algorithms and Metaheuristics.

Teofilo F. Gonzalez

Proceedings of the Computing Handbook, 2014

2011

Finding Optimal Geodesic Bridges Between Two Simple Polygons.

Amit M. Bhosle, Teofilo F. Gonzalez

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Approximating corridors and tours via restriction and relaxation techniques.

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

ACM Trans. Algorithms, 2010

Multicasting in the hypercube, chord and binomial graphs.

Christopher C. Cipriano, Teofilo F. Gonzalez

Inf. Process. Lett., 2010

2009

Improved Communication Schedules with Buffers.

Teofilo F. Gonzalez

Parallel Process. Lett., 2009

2008

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode.

Teofilo F. Gonzalez

IEEE Trans. Parallel Distributed Syst., 2008

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links

Amit M. Bhosle, Teofilo F. Gonzalez

CoRR, 2008

Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures

Amit M. Bhosle, Teofilo F. Gonzalez

CoRR, 2008

2007

Minimum-Edge Length Rectangular Partitions.

Si-Qing Zheng, Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Message Dissemination Using Modern Communication Primitives.

Teofilo F. Gonzalez

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Restriction Methods.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Basic Methodologies and Applications.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Introduction, Overview, and Notation.

Teofilo F. Gonzalez

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Complexity of the minimum-length corridor problem.

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

Comput. Geom., 2007

Message Dissemination under the Multicasting Communication Mode.

Teofilo F. Gonzalez

Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

Approximation Algorithms for the Minimum-Length Corridor and Related Problems.

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Pairwise edge disjoint shortest paths in the n-cube.

Teofilo F. Gonzalez, David Serena

Theor. Comput. Sci., 2006

Minimizing total completion time on uniform machines with deadline constraints.

Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo

ACM Trans. Algorithms, 2006

2005

Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode.

Russell Brandt, Teofilo F. Gonzalez

J. Interconnect. Networks, 2005

Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons.

Amit M. Bhosle, Teofilo F. Gonzalez

Int. J. Comput. Geom. Appl., 2005

Performance data collection using a hybrid approach.

Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez

Proceedings of the 10th European Software Engineering Conference held jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2005

Improving the Computation and Communication Time with Buffers.

Teofilo F. Gonzalez

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

2004

Flexible Hybrid Flowshops.

Teofilo F. Gonzalez

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Online Dictionary Structures.

Teofilo F. Gonzalez

Proceedings of the Handbook of Data Structures and Applications., 2004

Efficient Resource Utilization in Parallel and Distributed Systems.

Teofilo F. Gonzalez

J. Supercomput., 2004

Complexity of pairwise shortest path routing in the grid.

Teofilo F. Gonzalez, David Serena

Theor. Comput. Sci., 2004

<i>n</i>-Cube network: node disjoint shortest paths for maximal distance pairs of vertices.

Teofilo F. Gonzalez, David Serena

Parallel Comput., 2004

Algorithms for Single Link Failure Recovery and Related Problems.

Amit M. Bhosle, Teofilo F. Gonzalez

J. Graph Algorithms Appl., 2004

2003

An Efficient Algorithm for Gossiping in the Multicasting Communication Environment.

Teofilo F. Gonzalez

IEEE Trans. Parallel Distributed Syst., 2003

2002

Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems.

Teofilo F. Gonzalez, David Serena

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

2001

On Solving Multimessage Multicasting Problems.

Teofilo F. Gonzalez

Int. J. Found. Comput. Sci., 2001

Simple Algorithms for Multimessage Multicasting with Forwarding.

Teofilo F. Gonzalez

Algorithmica, 2001

Gossiping in the Multicasting Communication Environment.

Teofilo F. Gonzalez

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000

Distributed Algorithm for Multimessage Multicasting.

Teofilo F. Gonzalez

J. Interconnect. Networks, 2000

Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems.

Teofilo F. Gonzalez

Algorithmica, 2000

1998

On Ensuring Multilayer Wirability by Stretching Layouts.

Teofilo F. Gonzalez, Si-Qing Zheng

VLSI Design, 1998

Self-Stabilizing Algorithms for Tree Metrics.

Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan

Parallel Process. Lett., 1998

Bounded Fan-Out Multimessage Multicasting.

Teofilo F. Gonzalez

Nord. J. Comput., 1998

Complexity and Approximations for Multimessage Multicasting.

Teofilo F. Gonzalez

J. Parallel Distributed Comput., 1998

Improved Approximation Algorithms for Embedding Hyperedges in a Cycle.

Teofilo F. Gonzalez

Inf. Process. Lett., 1998

1997

MultiMessage Multicasting: Complexity and Approximations.

Teofilo F. Gonzalez

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996

A Computationally Intractable Problem on Simplicial Complexes.

Ömer Egecioglu, Teofilo F. Gonzalez

Comput. Geom., 1996

Multi-Message Multicasting.

Teofilo F. Gonzalez

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995

Complexity Aspects of Two-Dimensional Data Compression.

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks

Nord. J. Comput., 1995

A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem.

Teofilo F. Gonzalez

Inf. Process. Lett., 1995

1994

Single phase three-layer channel routing algorithms.

Teofilo F. Gonzalez, Si-Qing Zheng

Integr., 1994

On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.

Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng

Comput. Geom., 1994

A flow based approach to the pin redistribution problem for multi-chip modules.

Douglas Chang, Teofilo F. Gonzalez, Oscar H. Ibarra

Proceedings of the Fourth Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1994

1993

An efficient divide and conquer approximation algorithm for partitionning into D-boxes.

Teofilo F. Gonzalez, Si-Qing Zheng

Int. J. Comput. Geom. Appl., 1993

Routing around two Rectangles to minimize the Layout Area.

Teofilo F. Gonzalez, Sing-Ling Lee

Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

Switch-Box Routing under the two-Overlap wiring Model.

Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara, Si-Qing Zheng

Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

1992

Grid stretching algorithms for routing multiterminal nets through a rectangle.

Teofilo F. Gonzalez, Si-Qing Zheng

Integr., 1992

The On-Line <i>d</i>-Dimensional Dictionary Problem.

Teofilo F. Gonzalez

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Alhorithms for a Class of Min-Cut and Max-Cut Problem.

Teofilo F. Gonzalez, Toshio Murayama

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Covering a Set of Points in Multidimensional Space.

Teofilo F. Gonzalez

Inf. Process. Lett., 1991

On the generalized channel definition problem.

Teofilo F. Gonzalez, Mohammadreza Razzazi

Proceedings of the First Great Lakes Symposium on VLSI, 1991

Complexity Aspects of Map Compression.

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks

Proceedings of the IEEE Data Compression Conference, 1991

1990

Optimal Preemptive Scheduling of Two Unrelated Processors.

Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni

INFORMS J. Comput., 1990

Approximation Algorithms for Partitioning a Rectangle with Interior Points.

Teofilo F. Gonzalez, Si-Qing Zheng

Algorithmica, 1990

Multiterminal-net routing by grid stretching.

Teofilo F. Gonzalez, Si-Qing Zheng

Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990

1989

An approximation algorithm for the via placement problem.

Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

Inproved Bounds for Rectangular and Guillotine Partitions.

Teofilo F. Gonzalez, Si-Qing Zheng

J. Symb. Comput., 1989

Stretching and three-layer wiring planar layouts.

Teofilo F. Gonzalez, Si-Qing Zheng

Integr., 1989

1988

Minimization of the number of layers for single row routing with fixed street capacity.

Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988

A linear time algorithm for optimal routing around a rectangle.

Teofilo F. Gonzalez, Sing-Ling Lee

J. ACM, 1988

Simple Three-Layer Channel Routing Algorithms.

Teofilo F. Gonzalez, Si-Qing Zheng

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A 1.6 Approximation Algorithm for Routing Multiterminal Nets.

Teofilo F. Gonzalez, Sing-Ling Lee

SIAM J. Comput., 1987

1986

Routing Multiterminal Nets Around a Rectangle.

Teofilo F. Gonzalez, Sing-Ling Lee

IEEE Trans. Computers, 1986

1985

Clustering to Minimize the Maximum Intercluster Distance.

Teofilo F. Gonzalez

Theor. Comput. Sci., 1985

Bounds for partitioning rectilinear polygons.

Teofilo F. Gonzalez, Si-Qing Zheng

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

An Approximation Problem for the Multi-Via Assignment Problem.

Teofilo F. Gonzalez

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1984

On the Computational Complexity of Path Cover Problems.

Simeon C. Ntafos, Teofilo F. Gonzalez

J. Comput. Syst. Sci., 1984

1982

Evaluation of Arithmetic Expressions with Algebraic Identities.

Teofilo F. Gonzalez, Joseph F. JáJá

SIAM J. Comput., 1982

Unit Execution Time Shop Problems.

Teofilo F. Gonzalez

Math. Oper. Res., 1982

Sorting Numbers in Linear Expected Time and Optimal Extra Space.

Teofilo F. Gonzalez, Donald B. Johnson

Inf. Process. Lett., 1982

On Minimizing the Number of Page Faults with Complete Information.

Teofilo F. Gonzalez

Proceedings of the Parallel and Large-Scale Computers: Performance, 1982

1980

On the Complexity of Computing Bilinear Forms with {0, 1} Constants.

Teofilo F. Gonzalez, Joseph F. JáJá

J. Comput. Syst. Sci., 1980

A New Algorithm for Preemptive Scheduling of Trees.

Teofilo F. Gonzalez, Donald B. Johnson

J. ACM, 1980

1979

A Note on Open Shop Preemptive Schedules.

Teofilo F. Gonzalez

IEEE Trans. Computers, 1979

1978

Preemptive Scheduling of Uniform Processor Systems.

Teofilo F. Gonzalez, Sartaj Sahni

J. ACM, 1978

Flowshop and Jobshop Schedules: Complexity and Approximation.

Teofilo F. Gonzalez, Sartaj Sahni

Oper. Res., 1978

1977

An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests.

Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta

ACM Trans. Math. Softw., 1977

Bounds for LPT Schedules on Uniform Processors.

Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni

SIAM J. Comput., 1977

1976

P-Complete Approximation Problems.

Sartaj Sahni, Teofilo F. Gonzalez

J. ACM, 1976

Open Shop Scheduling to Minimize Finish Time.

Teofilo F. Gonzalez, Sartaj Sahni

J. ACM, 1976

1974

P-Complete Problems and Approximate Solutions

Sartaj Sahni, Teofilo F. Gonzalez

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974