default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorant Porkolab
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j10]Klaus Jansen, Lorant Porkolab:
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes. SIAM J. Discret. Math. 20(3): 545-563 (2006)- 2005
- [j9]Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. SIAM J. Comput. 35(3): 519-530 (2005) - 2004
- [j8]Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. J. Sched. 7(1): 35-48 (2004) - 2003
- [j7]Klaus Jansen, Lorant Porkolab:
Computing optimal preemptive schedules for parallel tasks: linear programming approaches. Math. Program. 95(3): 617-630 (2003) - 2002
- [j6]Klaus Jansen, Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica 32(3): 507-520 (2002) - [j5]Klaus Jansen, Lorant Porkolab:
Polynomial time approximation schemes for general multiprocessor job shop scheduling. J. Algorithms 45(2): 167-191 (2002) - [c10]Klaus Jansen, Lorant Porkolab:
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. IPCO 2002: 329-349 - 2001
- [j4]Klaus Jansen, Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. Math. Oper. Res. 26(2): 324-338 (2001) - [j3]Michael D. Grigoriadis, Leonid G. Khachiyan, Lorant Porkolab, J. Villavicencio:
Approximate Max-Min Resource Sharing for Structured Concave Optimization. SIAM J. Optim. 11(4): 1081-1091 (2001) - [c9]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. FCT 2001: 495-507 - [c8]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. ICALP 2001: 875-886 - 2000
- [j2]Leonid Khachiyan, Lorant Porkolab:
Integer Optimization on Convex Semialgebraic Sets. Discret. Comput. Geom. 23(2): 207-224 (2000) - [c7]Klaus Jansen, Lorant Porkolab:
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. ICALP 2000: 878-889 - [c6]Klaus Jansen, Lorant Porkolab:
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. ISAAC 2000: 398-409 - [c5]Klaus Jansen, Lorant Porkolab:
Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. MFCS 2000: 446-455
1990 – 1999
- 1999
- [c4]Klaus Jansen, Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. SODA 1999: 490-498 - [c3]Klaus Jansen, Lorant Porkolab:
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. STOC 1999: 408-417 - [c2]Klaus Jansen, Lorant Porkolab:
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. WADS 1999: 110-121 - 1997
- [j1]Lorant Porkolab, Leonid Khachiyan:
On the Complexity of Semidefinite Programs. J. Glob. Optim. 10(4): 351-365 (1997) - [c1]Leonid Khachiyan, Lorant Porkolab:
Computing Integral Points in Convex Semi-algebraic Sets. FOCS 1997: 162-171
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
