Lorant Porkolab

20 papers A* 5B 5Journal 10
YearRankTypeTitle / Venue / Authors
2006 J jnl
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.
SIAM J. Discret. Math.
Klaus Jansen, Lorant Porkolab
2005 J jnl
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.
SIAM J. Comput.
Klaus Jansen, Lorant Porkolab
2004 J jnl
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring.
J. Sched.
Klaus Jansen, Lorant Porkolab
2003 J jnl
Computing optimal preemptive schedules for parallel tasks: linear programming approaches.
Math. Program.
Klaus Jansen, Lorant Porkolab
2002 J jnl
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
Algorithmica
Klaus Jansen, Lorant Porkolab
2002 B conf
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.
IPCO
Klaus Jansen, Lorant Porkolab
2002 J jnl
Polynomial time approximation schemes for general multiprocessor job shop scheduling.
J. Algorithms
Klaus Jansen, Lorant Porkolab
2001 J jnl
Approximate Max-Min Resource Sharing for Structured Concave Optimization.
SIAM J. Optim.
Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio
2001 J jnl
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
Math. Oper. Res.
Klaus Jansen, Lorant Porkolab
2001 A* conf
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.
ICALP
Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
2001 B conf
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.
FCT
Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
2000 J jnl
Integer Optimization on Convex Semialgebraic Sets.
Discret. Comput. Geom.
Leonid Khachiyan, Lorant Porkolab
2000 A* conf
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling.
ICALP
Klaus Jansen, Lorant Porkolab
2000 B conf
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time.
ISAAC
Klaus Jansen, Lorant Porkolab
2000 B conf
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring.
MFCS
Klaus Jansen, Lorant Porkolab
1999 B conf
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time.
WADS
Klaus Jansen, Lorant Porkolab
1999 A* conf
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines.
STOC
Klaus Jansen, Lorant Porkolab
1999 A* conf
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
SODA
Klaus Jansen, Lorant Porkolab
1997 A* conf
Computing Integral Points in Convex Semi-algebraic Sets.
FOCS
Leonid Khachiyan, Lorant Porkolab
1997 J jnl
On the Complexity of Semidefinite Programs.
J. Glob. Optim.
Lorant Porkolab, Leonid Khachiyan