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