( en | de | ru )

 

Disambiguation of "Fekete, Sándor P."

Author of the publication

copydeleteadd this publication to your clipboard
Approximation of Geometric Dispersion Problems.

, and . APPROX, volume 1444 of Lecture Notes in Computer Science, page 63-75. Springer, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Béla Sándor

Sándor Kádas

Sándor Molnár

Sándor Fejér

Sándor Roth

 

Other publications of authors with the same name

An exact algorithm for higher-dimensional orthogonal packing, , and . CoRR, (2006)Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.. SODA, page 337-345. ACM/SIAM, (1999)Approximation of Geometric Dispersion Problems., and . Algorithmica, 30 (3): 451-470 (2001)Minimizing the Stabbing Number of Matchings, Trees, and Triangulations., , and . Discret. Comput. Geom., 40 (4): 595-621 (2008)Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures., , and . Electron. Notes Discret. Math., (2006)Approximation of Geometric Dispersion Problems., and . APPROX, volume 1444 of Lecture Notes in Computer Science, page 63-75. Springer, (1998)Covering Folded Shapes., , , , , , , , and . CCCG, Carleton University, Ottawa, Canada, (2013)Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability., , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 296-306. Springer, (2015)Minimum Covering with Travel Cost., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 393-402. Springer, (2009)Not All Fair Probabilistic Schedulers Are Equivalent., , , , and . OPODIS, volume 5923 of Lecture Notes in Computer Science, page 33-47. Springer, (2009)