Aleksei V. Fishkin

According to our database1, Aleksei V. Fishkin authored at least 26 papers between 2000 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.
Int. J. Comput. Geom. Appl., 2009

2008
On Packing Rectangles with Resource Augmentation: Maximizing the Profit.
Algorithmic Oper. Res., 2008

Grouping Techniques for Scheduling Problems: Simpler and Faster.
Algorithmica, 2008

2007
A tight bound for online colouring of disk graphs.
Theor. Comput. Sci., 2007

A note on scheduling to meet two min-sum objectives.
Oper. Res. Lett., 2007

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Discret. Appl. Math., 2007

2006
Open block scheduling in optical communication networks.
Theor. Comput. Sci., 2006

On Approximating the TSP with Intersecting Neighborhoods.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005
A Tight Bound for Online Coloring of Disk Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Packing Weighted Rectangles into a Square.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

On Efficient Weighted Rectangle Packing with Large Resources.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximation Algorithms for Euclidean Group TSP.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays.
Proceedings of the Algorithms, 2005

On Packing Squares with Resource Augmentation: Maximizing the Profit.
Proceedings of the Theory of Computing 2005, 2005

2004
On distance constrained labeling of disk graphs.
Theor. Comput. Sci., 2004

Online Algorithms for Disk Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

On Weighted Rectangle Packing with Large Resources.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Approximation and online algorithms in scheduling and coloring.
PhD thesis, 2003

On maximizing the throughput of multiprocessor tasks.
Theor. Comput. Sci., 2003

Disk Graphs: A Short Survey.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002
Scheduling of Independent Dedicated Multiprocessor Tasks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Online and Offline Distance Constrained Labeling of Disk Graphs.
Proceedings of the Algorithms, 2001

2000
Scheduling to Minimize the Average Completion Time of Dedicated Tasks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000


  Loading...