Teofilo F. Gonzalez

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Minimum Edge Length Rectangular Partitions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Introduction, Overview and Definitions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Restriction Methods.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Basic Methodologies and Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Introduction, Overview, and Notation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2014
Approximation Algorithms and Metaheuristics.
Proceedings of the Computing Handbook, 2014

2011
Finding Optimal Geodesic Bridges Between Two Simple Polygons.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Approximating corridors and tours via restriction and relaxation techniques.
ACM Trans. Algorithms, 2010

Multicasting in the hypercube, chord and binomial graphs.
Inf. Process. Lett., 2010

2009
Improved Communication Schedules with Buffers.
Parallel Process. Lett., 2009

2008
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode.
IEEE Trans. Parallel Distributed Syst., 2008

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
CoRR, 2008

Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
CoRR, 2008

2007
Minimum-Edge Length Rectangular Partitions.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Message Dissemination Using Modern Communication Primitives.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

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

Basic Methodologies and Applications.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Introduction, Overview, and Notation.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Complexity of the minimum-length corridor problem.
Comput. Geom., 2007

Message Dissemination under the Multicasting Communication Mode.
Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

Approximation Algorithms for the Minimum-Length Corridor and Related Problems.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Pairwise edge disjoint shortest paths in the n-cube.
Theor. Comput. Sci., 2006

Minimizing total completion time on uniform machines with deadline constraints.
ACM Trans. Algorithms, 2006

2005
Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode.
J. Interconnect. Networks, 2005

Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons.
Int. J. Comput. Geom. Appl., 2005

Performance data collection using a hybrid approach.
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.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

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

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

Efficient Resource Utilization in Parallel and Distributed Systems.
J. Supercomput., 2004

Complexity of pairwise shortest path routing in the grid.
Theor. Comput. Sci., 2004

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

Algorithms for Single Link Failure Recovery and Related Problems.
J. Graph Algorithms Appl., 2004

2003
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment.
IEEE Trans. Parallel Distributed Syst., 2003

2002
Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

2001
On Solving Multimessage Multicasting Problems.
Int. J. Found. Comput. Sci., 2001

Simple Algorithms for Multimessage Multicasting with Forwarding.
Algorithmica, 2001

Gossiping in the Multicasting Communication Environment.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Distributed Algorithm for Multimessage Multicasting.
J. Interconnect. Networks, 2000

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

1998
On Ensuring Multilayer Wirability by Stretching Layouts.
VLSI Design, 1998

Self-Stabilizing Algorithms for Tree Metrics.
Parallel Process. Lett., 1998

Bounded Fan-Out Multimessage Multicasting.
Nord. J. Comput., 1998

Complexity and Approximations for Multimessage Multicasting.
J. Parallel Distributed Comput., 1998

Improved Approximation Algorithms for Embedding Hyperedges in a Cycle.
Inf. Process. Lett., 1998

1997
MultiMessage Multicasting: Complexity and Approximations.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996
A Computationally Intractable Problem on Simplicial Complexes.
Comput. Geom., 1996

Multi-Message Multicasting.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995
Complexity Aspects of Two-Dimensional Data Compression.
Nord. J. Comput., 1995

A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem.
Inf. Process. Lett., 1995

1994
Single phase three-layer channel routing algorithms.
Integr., 1994

On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.
Comput. Geom., 1994

A flow based approach to the pin redistribution problem for multi-chip modules.
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.
Int. J. Comput. Geom. Appl., 1993

Routing around two Rectangles to minimize the Layout Area.
Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

Switch-Box Routing under the two-Overlap wiring Model.
Proceedings of the Algorithmic Aspects of VLSI Layout, 1993

1992
Grid stretching algorithms for routing multiterminal nets through a rectangle.
Integr., 1992

The On-Line <i>d</i>-Dimensional Dictionary Problem.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Alhorithms for a Class of Min-Cut and Max-Cut Problem.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
Covering a Set of Points in Multidimensional Space.
Inf. Process. Lett., 1991

On the generalized channel definition problem.
Proceedings of the First Great Lakes Symposium on VLSI, 1991

Complexity Aspects of Map Compression.
Proceedings of the IEEE Data Compression Conference, 1991

1990
Optimal Preemptive Scheduling of Two Unrelated Processors.
INFORMS J. Comput., 1990

Approximation Algorithms for Partitioning a Rectangle with Interior Points.
Algorithmica, 1990

Multiterminal-net routing by grid stretching.
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.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

Inproved Bounds for Rectangular and Guillotine Partitions.
J. Symb. Comput., 1989

Stretching and three-layer wiring planar layouts.
Integr., 1989

1988
Minimization of the number of layers for single row routing with fixed street capacity.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1988

A linear time algorithm for optimal routing around a rectangle.
J. ACM, 1988

Simple Three-Layer Channel Routing Algorithms.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
A 1.6 Approximation Algorithm for Routing Multiterminal Nets.
SIAM J. Comput., 1987

1986
Routing Multiterminal Nets Around a Rectangle.
IEEE Trans. Computers, 1986

1985
Clustering to Minimize the Maximum Intercluster Distance.
Theor. Comput. Sci., 1985

Bounds for partitioning rectilinear polygons.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
An Approximation Problem for the Multi-Via Assignment Problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1984

On the Computational Complexity of Path Cover Problems.
J. Comput. Syst. Sci., 1984

1982
Evaluation of Arithmetic Expressions with Algebraic Identities.
SIAM J. Comput., 1982

Unit Execution Time Shop Problems.
Math. Oper. Res., 1982

Sorting Numbers in Linear Expected Time and Optimal Extra Space.
Inf. Process. Lett., 1982

On Minimizing the Number of Page Faults with Complete Information.
Proceedings of the Parallel and Large-Scale Computers: Performance, 1982

1980
On the Complexity of Computing Bilinear Forms with {0, 1} Constants.
J. Comput. Syst. Sci., 1980

A New Algorithm for Preemptive Scheduling of Trees.
J. ACM, 1980

1979
A Note on Open Shop Preemptive Schedules.
IEEE Trans. Computers, 1979

1978
Preemptive Scheduling of Uniform Processor Systems.
J. ACM, 1978

Flowshop and Jobshop Schedules: Complexity and Approximation.
Oper. Res., 1978

1977
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests.
ACM Trans. Math. Softw., 1977

Bounds for LPT Schedules on Uniform Processors.
SIAM J. Comput., 1977

1976
P-Complete Approximation Problems.
J. ACM, 1976

Open Shop Scheduling to Minimize Finish Time.
J. ACM, 1976

1974
P-Complete Problems and Approximate Solutions
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974


  Loading...