#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1996

2017

- This year (4)
- Last 5 years (17)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

#### Organism

Learn More

- Ivona Bezáková, Varsha Dani
- SIGecom Exchanges
- 2005

The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. the cake-cutting problem) and economics (e.g. market equilibria). On the other hand, the natural… (More)

We present an improved "cooling schedule" for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature decreases.… (More)

- Ivona Bezáková, Adam J. Friedlander
- Theor. Comput. Sci.
- 2012

We give an O(nd + n log n) algorithm computing the number of minimum (s, t)-cuts in weighted planar graphs, where n is the number of vertices and d is the length of the shortest s-t path in the… (More)

The Max-Min Fairness problem is as follows: Given m indivisible goods and k players, each with a specified valuation function on the subsets of the goods, how should the goods be split between the… (More)

- Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda
- Random Struct. Algorithms
- 2006

We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 <i>n x m</i> matrices… (More)

Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition… (More)

- Anurag Babruwan Gomsale, Ivona Bezáková
- 2016

Introduction One of the applications of the Maximum Flow Network graph algorithm and the related min (s,t)-cut algorithm[1] is to produce image segmentation. In this project, we are analyzing an… (More)

- Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin
- ICALP
- 2017

We consider the following natural “above guarantee” parameterization of the classical Longest Path problem: For given vertices s and t of a graph G, and an integer k, the problem Longest Detour asks… (More)

- Ivona Bezáková, James E. Heliotis, Sean Strout
- SIGCSE
- 2013

We present three open-ended freshman projects where students design and implement their own player strategies for well-established board games: Quoridor by Mirko Marchesi (Gigamic), San Francisco… (More)

- Ivona Bezáková, William A. Rummler
- MFCS
- 2009

An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidly for graphs with… (More)