default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksei V. Fishkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j9]Khaled M. Elbassioni
, Aleksei V. Fishkin, René Sitters:
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geom. Appl. 19(2): 173-193 (2009)- 2008
- [j8]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica 51(2): 183-199 (2008) - [j7]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Rectangles with Resource Augmentation: Maximizing the Profit. Algorithmic Oper. Res. 3(1) (2008) - 2007
- [j6]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discret. Appl. Math. 155(2): 119-136 (2007) - [j5]Eric Angel, Evripidis Bampis, Aleksei V. Fishkin:
A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35(1): 69-73 (2007) - [j4]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
A tight bound for online colouring of disk graphs. Theor. Comput. Sci. 384(2-3): 152-160 (2007) - 2006
- [j3]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open block scheduling in optical communication networks. Theor. Comput. Sci. 361(2-3): 257-274 (2006) - [c19]Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters:
On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222 - 2005
- [c18]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
On Packing Squares with Resource Augmentation: Maximizing the Profit. CATS 2005: 61-67 - [c17]Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters:
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA 2005: 580-591 - [c16]Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters:
Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 - [c15]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen:
On Efficient Weighted Rectangle Packing with Large Resources. ISAAC 2005: 1039-1050 - [c14]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
Packing Weighted Rectangles into a Square. MFCS 2005: 352-363 - [c13]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
A Tight Bound for Online Coloring of Disk Graphs. SIROCCO 2005: 78-88 - 2004
- [j2]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1-3): 261-292 (2004) - [c12]Aleksei V. Fishkin, Olga Gerber, Klaus Jansen:
On Weighted Rectangle Packing with Large Resources. IFIP TCS 2004: 237-250 - [c11]Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis, Evi Papaioannou:
Online Algorithms for Disk Graphs. MFCS 2004: 215-226 - 2003
- [b1]Aleksei V. Fishkin:
Approximation and online algorithms in scheduling and coloring. University of Kiel, Germany, 2003, pp. 1-234 - [j1]Aleksei V. Fishkin, Guochuan Zhang:
On maximizing the throughput of multiprocessor tasks. Theor. Comput. Sci. 302(1-3): 319-335 (2003) - [c10]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC 2003: 319-328 - [c9]Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov:
Open Block Scheduling in Optical Communication Networks. WAOA 2003: 13-26 - [c8]Aleksei V. Fishkin:
Disk Graphs: A Short Survey. WAOA 2003: 260-264 - 2002
- [c7]Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella:
Scheduling of Independent Dedicated Multiprocessor Tasks. ISAAC 2002: 391-402 - [c6]Aleksei V. Fishkin, Guochuan Zhang:
On Maximizing the Throughput of Multiprocessor Tasks. MFCS 2002: 269-279 - 2001
- [c5]Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli:
Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA 2001: 206-217 - [c4]Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin:
Online and Offline Distance Constrained Labeling of Disk Graphs. ESA 2001: 464-475 - [c3]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. FCT 2001: 495-507 - [c2]Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab:
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. ICALP 2001: 875-886 - 2000
- [c1]Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon:
Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS 2000: 454-464
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-24 22:45 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:
