A. V. Fishkin

Most-cited papers

Approximation Algorithms for Euclidean Group TSP
K. Elbassioni, A. V. Fishkin, Nabil H. Mustafa, René Sitters
2005International Colloquium on Automata, Languages and Programming62 citations
Semantic Scholar
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods
K. Elbassioni, A. V. Fishkin, René Sitters
2009International journal of computational geometry and applications57 citations
Semantic Scholar
Disk Graphs: A Short Survey
A. V. Fishkin
2003Workshop on Approximation and Online Algorithms46 citations
Semantic Scholar
Packing Weighted Rectangles into a Square
A. V. Fishkin, O. Gerber, K. Jansen, R. Solis-Oba
2005International Symposium on Mathematical Foundations of Computer Science30 citations
Semantic Scholar
Grouping Techniques for Scheduling Problems: Simpler and Faster
A. V. Fishkin, K. Jansen, M. Mastrolilli
2001Algorithmica29 citations Open access
Semantic Scholar
A tight bound for online colouring of disk graphs
I. Caragiannis, A. V. Fishkin, C. Kaklamanis, Evi Papaioannou
2007Theoretical Computer Science28 citations Open access
Semantic Scholar
On Approximating the TSP with Intersecting Neighborhoods
K. Elbassioni, A. V. Fishkin, René Sitters
2006International Symposium on Algorithms and Computation26 citations
Semantic Scholar
On distance constrained labeling of disk graphs
J. Fiala, A. V. Fishkin, F. Fomin
2004Theoretical Computer Science24 citations Open access
Semantic Scholar
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
F. Afrati, E. Bampis, A. V. Fishkin, K. Jansen +1 more
2000Foundations of Software Technology and Theoretical Computer Science24 citations
Semantic Scholar
Scheduling of Independent Dedicated Multiprocessor Tasks
E. Bampis, M. Caramia, J. Fiala, A. V. Fishkin +1 more
2002International Symposium on Algorithms and Computation23 citations
Semantic Scholar
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
I. Caragiannis, A. V. Fishkin, C. Kaklamanis, Evi Papaioannou
2007Discrete Applied Mathematics19 citations Open access
Semantic Scholar
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
A. V. Fishkin, K. Jansen, Lorant Porkolab
2001International Colloquium on Automata, Languages and Programming18 citations
Semantic Scholar
A note on scheduling to meet two min-sum objectives
Eric Angel, E. Bampis, A. V. Fishkin
2007Operations Research Letters16 citations Open access
Semantic Scholar
On Efficient Weighted Rectangle Packing with Large Resources
A. V. Fishkin, O. Gerber, K. Jansen
2005International Symposium on Algorithms and Computation14 citations
Semantic Scholar
A Tight Bound for Online Coloring of Disk Graphs
I. Caragiannis, A. V. Fishkin, C. Kaklamanis, Evi Papaioannou
2005Colloquium on Structural Information & Communication Complexity12 citations
Semantic Scholar
Çò¹ððòò Òò Ó«¹ððòò ×øøò Óò×øöööòòò Ðððððòò Óó ×× Ööôô×
A. V. Fishkin, F. Fomin
200212 citations
Semantic Scholar
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
S. Sevastyanov, René Sitters, A. V. Fishkin
201010 citations
Semantic Scholar
On Packing Squares with Resource Augmentation: Maximizing the Profit
A. V. Fishkin, O. Gerber, K. Jansen, R. Solis-Oba
2005Computing: The Australasian Theory Symposium9 citations
Semantic Scholar
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
A. V. Fishkin, K. Jansen, Lorant Porkolab
2001International Symposium on Fundamentals of Computation Theory9 citations
Semantic Scholar
On Weighted Rectangle Packing with Large Resources
A. V. Fishkin, O. Gerber, K. Jansen
2004IFIP TCS8 citations Open access
Semantic Scholar
On maximizing the throughput of multiprocessor tasks
A. V. Fishkin, Guo-Chuan Zhang
2002Theoretical Computer Science6 citations Open access
Semantic Scholar
On Packing Rectangles with Resource Augmentation: Maximizing the Profit
A. V. Fishkin, O. Gerber, K. Jansen, R. Solis-Oba
2008Algorithmic Operations Research5 citations
Semantic Scholar
Online Algorithms for Disk Graphs
I. Caragiannis, A. V. Fishkin, C. Kaklamanis, Evi Papaioannou
2004International Symposium on Mathematical Foundations of Computer Science5 citations
Semantic Scholar
Open Block Scheduling in Optical Communication Networks
A. Ageev, A. V. Fishkin, A. Kononov, S. Sevastianov
2003Workshop on Approximation and Online Algorithms5 citations Open access
Semantic Scholar
Approximation and online algorithms in scheduling and coloring
A. V. Fishkin
20062 citations
Semantic Scholar
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays
A. V. Fishkin, Klaus Jansen, Sergey V. Sevastyanov, René Sitters
2005Embedded Systems and Applications2 citations
Semantic Scholar
A PTAS for shop scheduling with release dates to minimize the average weighted completion time
A. V. Fishkin, K. Jansen, M. Mastrolilli
20022 citations
Semantic Scholar
Online and Offline Distance Constrained Labeling of Disk Graphs
Jiří Fiala, A. V. Fishkin, F. V. Fomin
2001Embedded Systems and Applications2 citations
Semantic Scholar
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates
A. V. Fishkin, Klaus Jansen, M. Mastrolilli
2003International Symposium on Algorithms and Computation1 citations
Semantic Scholar