Teofilo F. Gonzalez

96 papers A* 1A 1B 2C 2Journal 56Unranked 13

Year	Rank	Type	Title / Venue / Authors
2018	—	`ch.`	Basic Methodologies and Applications. Handbook of Approximation Algorithms and Metaheuristics (1) Teofilo F. Gonzalez
2018	—	`ch.`	Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems. Handbook of Approximation Algorithms and Metaheuristics (2) Teofilo F. Gonzalez, Arturo Gonzalez-Gutierrez
2018	—	`book`	Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications Handbook of Approximation Algorithms and Metaheuristics Teofilo F. Gonzalez
2018	—	`book`	Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 2: Contemporary and Emerging Applications Handbook of Approximation Algorithms and Metaheuristics Teofilo F. Gonzalez
2018	—	`ch.`	Introduction, Overview and Definitions. Handbook of Approximation Algorithms and Metaheuristics (2) Teofilo F. Gonzalez
2018	—	`ch.`	Introduction, Overview, and Notation. Handbook of Approximation Algorithms and Metaheuristics (1) Teofilo F. Gonzalez
2018	—	`ch.`	Minimum Edge Length Rectangular Partitions. Handbook of Approximation Algorithms and Metaheuristics (2) Teofilo F. Gonzalez, Si-Qing Zheng
2018	—	`ch.`	Restriction Methods. Handbook of Approximation Algorithms and Metaheuristics (1) Teofilo F. Gonzalez
2014	—	`ch.`	Approximation Algorithms and Metaheuristics. Computing Handbook, 3rd ed. (1) Teofilo F. Gonzalez
2014	—	`book`	Computing Handbook, Third Edition: Computer Science and Software Engineering Computing Handbook, 3rd ed. (1) Teofilo F. Gonzalez, Jorge Diaz-Herrera, Allen Tucker
2011	—	`conf`	Finding Optimal Geodesic Bridges Between Two Simple Polygons. CCCG Amit M. Bhosle, Teofilo F. Gonzalez
2010	J	`jnl`	Approximating corridors and tours via restriction and relaxation techniques. ACM Trans. Algorithms Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
2010	J	`jnl`	Multicasting in the hypercube, chord and binomial graphs. Inf. Process. Lett. Christopher C. Cipriano, Teofilo F. Gonzalez
2009	J	`jnl`	Improved Communication Schedules with Buffers. Parallel Process. Lett. Teofilo F. Gonzalez
2008	J	`jnl`	Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode. IEEE Trans. Parallel Distributed Syst. Teofilo F. Gonzalez
2008	J	`jnl`	Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links CoRR Amit M. Bhosle, Teofilo F. Gonzalez
2008	J	`jnl`	Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures CoRR Amit M. Bhosle, Teofilo F. Gonzalez
2007	—	`conf`	Approximation Algorithms for the Minimum-Length Corridor and Related Problems. CCCG Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
2007	—	`ch.`	Basic Methodologies and Applications. Handbook of Approximation Algorithms and Metaheuristics Teofilo F. Gonzalez
2007	J	`jnl`	Complexity of the minimum-length corridor problem. Comput. Geom. Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
2007	—	`book`	Handbook of Approximation Algorithms and Metaheuristics. Teofilo F. Gonzalez
2007	—	`ch.`	Introduction, Overview, and Notation. Handbook of Approximation Algorithms and Metaheuristics Teofilo F. Gonzalez
2007	—	`ch.`	Message Dissemination Using Modern Communication Primitives. Handbook of Parallel Computing Teofilo F. Gonzalez
2007	C	`conf`	Message Dissemination under the Multicasting Communication Mode. PDCAT Teofilo F. Gonzalez
2007	—	`ch.`	Minimum-Edge Length Rectangular Partitions. Handbook of Approximation Algorithms and Metaheuristics Si-Qing Zheng, Teofilo F. Gonzalez
2007	—	`ch.`	Restriction Methods. Handbook of Approximation Algorithms and Metaheuristics Teofilo F. Gonzalez
2006	J	`jnl`	Minimizing total completion time on uniform machines with deadline constraints. ACM Trans. Algorithms Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael L. Pinedo
2006	J	`jnl`	Pairwise edge disjoint shortest paths in the n-cube. Theor. Comput. Sci. Teofilo F. Gonzalez, David Serena
2005	J	`jnl`	Exact and Approximation Algorithms for Finding an Optimal Bridge Connecting Two Simple Polygons. Int. J. Comput. Geom. Appl. Amit M. Bhosle, Teofilo F. Gonzalez
2005	—	`conf`	Improving the Computation and Communication Time with Buffers. IASTED PDCS Teofilo F. Gonzalez
2005	—	`conf`	Performance data collection using a hybrid approach. ESEC/SIGSOFT FSE Edu Metz, Raimondas Lencevicius, Teofilo F. Gonzalez
2005	J	`jnl`	Wavelength Assignment in Multifiber Optical Star Networks under the Multicasting Communication Mode. J. Interconnect. Networks Russell Brandt, Teofilo F. Gonzalez
2004	J	`jnl`	Algorithms for Single Link Failure Recovery and Related Problems. J. Graph Algorithms Appl. Amit M. Bhosle, Teofilo F. Gonzalez
2004	J	`jnl`	Complexity of pairwise shortest path routing in the grid. Theor. Comput. Sci. Teofilo F. Gonzalez, David Serena
2004	J	`jnl`	Efficient Resource Utilization in Parallel and Distributed Systems. J. Supercomput. Teofilo F. Gonzalez
2004	—	`ch.`	Flexible Hybrid Flowshops. Handbook of Scheduling Teofilo F. Gonzalez
2004	—	`ch.`	Online Dictionary Structures. Handbook of Data Structures and Applications Teofilo F. Gonzalez
2003	J	`jnl`	An Efficient Algorithm for Gossiping in the Multicasting Communication Environment. IEEE Trans. Parallel Distributed Syst. Teofilo F. Gonzalez
2002	—	`conf`	Complexity of k-Pairwise Disjoint Shortest Paths in the Undirected Hypercubic Network and Related Problems. IASTED PDCS Teofilo F. Gonzalez, David Serena
2002	—	`ed.`	International Conference on Parallel and Distributed Computing Systems, PDCS 2002, November 4-6, 2002, Cambridge, USA IASTED PDCS Selim G. Akl, Teofilo F. Gonzalez
2001	A	`conf`	Gossiping in the Multicasting Communication Environment. IPDPS Teofilo F. Gonzalez
2001	J	`jnl`	On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. Teofilo F. Gonzalez
2001	J	`jnl`	Simple Algorithms for Multimessage Multicasting with Forwarding. Algorithmica Teofilo F. Gonzalez
2000	J	`jnl`	Distributed Algorithm for Multimessage Multicasting. J. Interconnect. Networks Teofilo F. Gonzalez
2000	J	`jnl`	Simple Algorithms for the On-Line Multidimensional Dictionary and Related Problems. Algorithmica Teofilo F. Gonzalez
1998	J	`jnl`	Bounded Fan-Out Multimessage Multicasting. Nord. J. Comput. Teofilo F. Gonzalez
1998	J	`jnl`	Complexity and Approximations for Multimessage Multicasting. J. Parallel Distributed Comput. Teofilo F. Gonzalez
1998	J	`jnl`	Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. Inf. Process. Lett. Teofilo F. Gonzalez
1998	J	`jnl`	On Ensuring Multilayer Wirability by Stretching Layouts. VLSI Design Teofilo F. Gonzalez, Si-Qing Zheng
1998	J	`jnl`	Self-Stabilizing Algorithms for Tree Metrics. Parallel Process. Lett. Ajoy Kumar Datta, Teofilo F. Gonzalez, Visalakshi Thiagarajan
1997	—	`conf`	MultiMessage Multicasting: Complexity and Approximations. HICSS (1) Teofilo F. Gonzalez
1996	J	`jnl`	A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. Ömer Egecioglu, Teofilo F. Gonzalez
1996	—	`conf`	Multi-Message Multicasting. IRREGULAR Teofilo F. Gonzalez
1995	J	`jnl`	A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. Teofilo F. Gonzalez
1995	J	`jnl`	Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1994	—	`conf`	A flow based approach to the pin redistribution problem for multi-chip modules. Great Lakes Symposium on VLSI Douglas Chang, Teofilo F. Gonzalez, Oscar H. Ibarra
1994	J	`jnl`	On Optimal Guillotine Partitions Approximating Optimal D-box Partitions. Comput. Geom. Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng
1994	J	`jnl`	Single phase three-layer channel routing algorithms. Integr. Teofilo F. Gonzalez, Si-Qing Zheng
1993	J	`jnl`	An efficient divide and conquer approximation algorithm for partitionning into D-boxes. Int. J. Comput. Geom. Appl. Teofilo F. Gonzalez, Si-Qing Zheng
1993	—	`ch.`	Routing around two Rectangles to minimize the Layout Area. Algorithmic Aspects of VLSI Layout Teofilo F. Gonzalez, Sing-Ling Lee
1993	—	`ch.`	Switch-Box Routing under the two-Overlap wiring Model. Algorithmic Aspects of VLSI Layout Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara, Si-Qing Zheng
1992	B	`conf`	Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC Teofilo F. Gonzalez, Toshio Murayama
1992	J	`jnl`	Grid stretching algorithms for routing multiterminal nets through a rectangle. Integr. Teofilo F. Gonzalez, Si-Qing Zheng
1992	A*	`conf`	The On-Line SODA Teofilo F. Gonzalez
1991	B	`conf`	Complexity Aspects of Map Compression. Data Compression Conference Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1991	J	`jnl`	Covering a Set of Points in Multidimensional Space. Inf. Process. Lett. Teofilo F. Gonzalez
1991	—	`conf`	On the generalized channel definition problem. Great Lakes Symposium on VLSI Teofilo F. Gonzalez, Mohammadreza Razzazi
1990	J	`jnl`	Approximation Algorithms for Partitioning a Rectangle with Interior Points. Algorithmica Teofilo F. Gonzalez, Si-Qing Zheng
1990	C	`conf`	Multiterminal-net routing by grid stretching. ICCD Teofilo F. Gonzalez, Si-Qing Zheng
1990	J	`jnl`	Optimal Preemptive Scheduling of Two Unrelated Processors. INFORMS J. Comput. Teofilo F. Gonzalez, Eugene L. Lawler, Sartaj Sahni
1989	J	`jnl`	An approximation algorithm for the via placement problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
1989	J	`jnl`	Inproved Bounds for Rectangular and Guillotine Partitions. J. Symb. Comput. Teofilo F. Gonzalez, Si-Qing Zheng
1989	J	`jnl`	Stretching and three-layer wiring planar layouts. Integr. Teofilo F. Gonzalez, Si-Qing Zheng
1988	J	`jnl`	A linear time algorithm for optimal routing around a rectangle. J. ACM Teofilo F. Gonzalez, Sing-Ling Lee
1988	J	`jnl`	Minimization of the number of layers for single row routing with fixed street capacity. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Teofilo F. Gonzalez, Shashishekhar Kurki-Gowdara
1988	—	`conf`	Simple Three-Layer Channel Routing Algorithms. AWOC Teofilo F. Gonzalez, Si-Qing Zheng
1987	J	`jnl`	A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. Teofilo F. Gonzalez, Sing-Ling Lee
1986	J	`jnl`	Routing Multiterminal Nets Around a Rectangle. IEEE Trans. Computers Teofilo F. Gonzalez, Sing-Ling Lee
1985	—	`conf`	Bounds for partitioning rectilinear polygons. SCG Teofilo F. Gonzalez, Si-Qing Zheng
1985	J	`jnl`	Clustering to Minimize the Maximum Intercluster Distance. Theor. Comput. Sci. Teofilo F. Gonzalez
1984	J	`jnl`	An Approximation Problem for the Multi-Via Assignment Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Teofilo F. Gonzalez
1984	J	`jnl`	On the Computational Complexity of Path Cover Problems. J. Comput. Syst. Sci. Simeon C. Ntafos, Teofilo F. Gonzalez
1982	J	`jnl`	Evaluation of Arithmetic Expressions with Algebraic Identities. SIAM J. Comput. Teofilo F. Gonzalez, Joseph F. JáJá
1982	—	`conf`	On Minimizing the Number of Page Faults with Complete Information. IMACS World Congress Teofilo F. Gonzalez
1982	J	`jnl`	Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. Teofilo F. Gonzalez, Donald B. Johnson
1982	J	`jnl`	Unit Execution Time Shop Problems. Math. Oper. Res. Teofilo F. Gonzalez
1980	J	`jnl`	A New Algorithm for Preemptive Scheduling of Trees. J. ACM Teofilo F. Gonzalez, Donald B. Johnson
1980	J	`jnl`	On the Complexity of Computing Bilinear Forms with {0, 1} Constants. J. Comput. Syst. Sci. Teofilo F. Gonzalez, Joseph F. JáJá
1979	J	`jnl`	A Note on Open Shop Preemptive Schedules. IEEE Trans. Computers Teofilo F. Gonzalez
1978	J	`jnl`	Flowshop and Jobshop Schedules: Complexity and Approximation. Oper. Res. Teofilo F. Gonzalez, Sartaj Sahni
1978	J	`jnl`	Preemptive Scheduling of Uniform Processor Systems. J. ACM Teofilo F. Gonzalez, Sartaj Sahni
1977	J	`jnl`	An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests. ACM Trans. Math. Softw. Teofilo F. Gonzalez, Sartaj Sahni, William R. Franta
1977	J	`jnl`	Bounds for LPT Schedules on Uniform Processors. SIAM J. Comput. Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni
1976	J	`jnl`	Open Shop Scheduling to Minimize Finish Time. J. ACM Teofilo F. Gonzalez, Sartaj Sahni
1976	J	`jnl`	P-Complete Approximation Problems. J. ACM Sartaj Sahni, Teofilo F. Gonzalez
1974	—	`conf`	P-Complete Problems and Approximate Solutions SWAT Sartaj Sahni, Teofilo F. Gonzalez