#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
- Theory of Computing Systems
- 2016

We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, which need not be transitive nor acyclic. This generalization is practically well-motivated, and as we show, encompasses the well studied hard variant of stable marriage where… (More)

- Ehsan Ebrahimzadeh, Linda Farczadi, +4 authors Jonathan Zung
- Electronic Notes in Discrete Mathematics
- 2013

- Ehsan Ebrahimzadeh, Linda Farczadi, +4 authors Jonathan Zung
- Random Struct. Algorithms
- 2014

We consider the following iterative construction of a random planar triangulation. Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face. After n – 3 steps, we obtain a random triangulated plane graph with n vertices, which is called a… (More)

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for these games. In addition, we prove that an instance has a balanced solution if and only if it has a stable one. Our… (More)

- Linda Farczadi, Natália Guricanová
- ArXiv
- 2016

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general. Our contribution is two fold: a polyhedral characterization and an approximation algorithm.… (More)

- Luc Devroye, Linda Farczadi
- Discrete Mathematics & Theoretical Computer…
- 2013

Let T be a d-dimensional toroidal grid of n points. For a given range parameter ω, and a positive integer k ≤ d, we say that two points in T are mutually visible if they differ in at most k coordinates and are a distance at most ω apart, where distance is measured using the `p norm. We obtain a random d-dimensional line-of-sight graph G by placing a node at… (More)

- ‹
- 1
- ›