output
20022008
most citedMagnetism, superconductivity, and pairing symmetry in Fe-based superconductors

715 citations

researchers with a paper here
collaborating institutions
Showing 2002Show all

5 papers · 1 filter

cs.DS2002

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Sandor P. Fekete, Henk Meijer, Andre Rohe +1

We consider geometric instances of the Maximum Weighted Matching Problem (MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000 vertices. Making use of a geo…

cs.CC2002

Traveling Salesmen in the Presence of Competition

Sandor P. Fekete, Rudolf Fleischer, Aviezri Fraenkel +1

We propose the ``Competing Salesmen Problem'' (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing…

cond-mat2002★ 11 cited

Exact analytic solution for the generalized Lyapunov exponent of the 2-dimensional Anderson localization

V. N. Kuzovkov, W. von Niessen, V. Kashcheyevs +1

The Anderson localization problem in one and two dimensions is solved analytically via the calculation of the generalized Lyapunov exponents. This is achieved by making use of sign…

math.CO2002

Characterizing Matchings as the Intersection of Matroids

Sandor P. Fekete, Robert T. Firla, Bianca Spille

This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for whi…

cs.CG2002

An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures

Esther M. Arkin, Sandor P. Fekete, Joseph S. B. Mitchell

We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non…