Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bezáková, Ivona - Department of Computer Science, Rochester Institute of Technology
Sampling Edge Covers in 3-Regular Graphs Ivona Bezakova and William A. Rummler
Sampling Binary Contingency Tables with a Greedy Start Ivona Bezakova
ACCELERATING SIMULATED ANNEALING FOR THE PERMANENT AND COMBINATORIAL COUNTING PROBLEMS
Allocating Indivisible Goods IVONA BEZAKOVA and VARSHA DANI
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with
Department of Computer Science Faculty of Mathematics and Physics
Sampling Binary Contingency Tables with a Greedy Start Ivona Bezakova
26 This arTicle has been peer-reviewed. Computing in SCienCe & engineering C o m b i n a t o r i c s
Graph Model Selection using Maximum Likelihood Ivona Bezakova ivona@cs.uchicago.edu
THE UNIVERSITY OF CHICAGO FASTER MARKOV CHAIN MONTE CARLO ALGORITHMS FOR THE
A Uniform Methodology for Ranking Internet Topology Models
Nobody Left Behind: Fair Allocation of Indivisible Goods Ivona Bezakova and Varsha Dani
Negative Examples for Sequential Importance Sampling of
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time
RESEARCH ARTICLE Path lengths in proteinprotein interaction networks
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time
Computing and Counting the Longest Paths on Circular-Arc Graphs in Polynomial Time
Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time
