BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Iceland
1 × Italy
1 × Latvia
1 × Switzerland
2 × Greece
2 × USA
Collaborated with:
L.Porkolab K.Klein R.Thöle R.v.Stee A.V.Fishkin R.Solis-Oba M.Sviridenko C.Kaklamanis P.Persiano T.Erlebach
Talks about:
approxim (6) schedul (4) job (4) scheme (3) time (3) multiprocessor (2) polynomi (2) parallel (2) minim (2) shop (2)

Person: Klaus Jansen

DBLP DBLP: Jansen:Klaus

Contributed to:

ICALP (1) 20132013
ICALP (1) 20092009
ICALP (1) 20082008
STOC 20052005
ICALP 20012001
ICALP 20002000
STOC 19991999
ICALP 19971997

Wrote 10 papers:

ICALP-v1-2013-JansenK #migration #online #polynomial #robust
A Robust AFPTAS for Online Bin Packing with Polynomial Migration, (KJ, KMK), pp. 589–600.
ICALP-v1-2009-Jansen #constant #scheduling #using
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables (KJ), pp. 562–573.
ICALP-A-2008-JansenT #algorithm #approximate #parallel #scheduling
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (KJ, RT), pp. 234–245.
STOC-2005-JansenS #on the
On strip packing With rotations (KJ, RvS), pp. 755–761.
ICALP-2001-FishkinJP #multi #on the
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates (AVF, KJ, LP), pp. 875–886.
ICALP-2000-JansenP #approximate #multi #scheduling
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling (KJ, LP), pp. 878–889.
STOC-1999-JansenP #approximate #parallel #scheduling
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines (KJ, LP), pp. 408–417.
STOC-1999-JansenSS #approximate #polynomial
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme (KJ, RSO, MS), pp. 394–399.
ICALP-1997-Jansen #approximate #problem
Approximation Results for the Optimum Cost Partition Problem (KJ), pp. 727–737.
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing (CK, PP, TE, KJ), pp. 493–504.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.