Teofilo F. Gonzalez

Available identifiers

zbMath Open gonzalez.teofilo-fWikidataQ20675528 ScholiaQ20675528MaRDI QIDQ293372

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4643851	2018-05-29	Paper
Improved approximation algorithms for embedding hyperedges in a cycle	2016-06-09	Paper
Minimizing total completion time on uniform machines with deadline constraints	2015-09-02	Paper
ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS	2015-04-30	Paper
Approximating corridors and tours via restriction and relaxation techniques	2014-11-18	Paper
Multicasting in the hypercube, chord and binomial graphs	2012-03-27	Paper
Improved communication schedules with buffers	2010-09-29	Paper
Complexity of the minimum-length corridor problem	2007-04-18	Paper
Pairwise edge disjoint shortest paths in the \(n\)-cube	2007-01-09	Paper
Algorithms for Single Link Failure Recovery and Related Problems	2006-04-03	Paper
EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS	2006-03-13	Paper
Complexity of pairwise shortest path routing in the grid	2005-01-11	Paper
Simple algorithms for multimessage multicasting with forwarding	2002-02-19	Paper
Simple algorithms for the on-line multidimensional dictionary and related problems	2001-05-20	Paper
Single phase three-layer channel routing algorithms	2000-07-06	Paper
Complexity and approximations for multimessage multicasting	1999-09-13	Paper
https://portal.mardi4nfdi.de/entity/Q4223773	1999-05-04	Paper
A simple LP-free approximation algorithm for the minimum weight vertex cover problem	1997-02-28	Paper
A computationally intractable problem on simplicial complexes	1996-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q4763423	1995-04-11	Paper
On optimal guillotine partitions approximating optimal \(d\)-box partitions	1994-06-15	Paper
AN EFFICIENT DIVIDE-AND-CONQUER APPROXIMATION ALGORITHM FOR PARTITIONING INTO D-BOXES	1994-05-26	Paper
Optimal Preemptive Scheduling of Two Unrelated Processors	1993-02-18	Paper
Grid stretching algorithms for routing multiterminal nets through a rectangle	1993-01-12	Paper
Covering a set of points in multidimensional space	1992-06-28	Paper
Approximation algorithms for partitioning a rectangle with interior points	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4206398	1990-01-01	Paper
Improved bounds for rectangular and guillotine partitions	1989-01-01	Paper
A linear time algorithm for optimal routing around a rectangle	1988-01-01	Paper
A $1.6$ Approximation Algorithm for Routing Multiterminal Nets	1987-01-01	Paper
Routing Multiterminal Nets Around a Rectangle	1986-01-01	Paper
Clustering to minimize the maximum intercluster distance	1985-01-01	Paper
On the computational complexity of path cover problems	1984-01-01	Paper
Sorting numbers in linear expected time and optimal extra space	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3944005	1982-01-01	Paper
Evaluation of Arithmetic Expressions with Algebraic Identities	1982-01-01	Paper
Unit Execution Time Shop Problems	1982-01-01	Paper
On the complexity of computing bilinear forms with \(\{0,1\}\) constants	1980-01-01	Paper
A New Algorithm for Preemptive Scheduling of Trees	1980-01-01	Paper
A Note on Open Shop Preemptive Schedules	1979-01-01	Paper
Preemptive Scheduling of Uniform Processor Systems	1978-01-01	Paper
Flowshop and Jobshop Schedules: Complexity and Approximation	1978-01-01	Paper
An efficient approximate algorithm for the Kolmogorov—Smirnov and Lilliefors tests†	1978-01-01	Paper
Bounds for LPT Schedules on Uniform Processors	1977-01-01	Paper
An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests	1977-01-01	Paper
Open Shop Scheduling to Minimize Finish Time	1976-01-01	Paper
P-Complete Approximation Problems	1976-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Teofilo F. Gonzalez