Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bez{\'a}kov{\'a}, Ivona"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting and sampling minimum
(s,t)
-cuts in weighted planar graphs in polynomial time
Ivona Bezáková
,
Adam J. Friedlander
Theoretical Computer Science
417
, 2012, pp. 2-11
Contiguous minimum single-source-multi-sink cuts in weighted planar graphs
Ivona Bezáková
,
Zachary Langley
Lecture Notes in Computer Science
7434
, 2012, pp. 49-60
Negative examples for sequential importance sampling of binary contingency tables
Ivona Bezáková
,
Alistair Sinclair
,
Daniel S̑tefankovic̑
,
Eric Vigoda
Algorithmica
64
(4), 2012, pp. 606-620
Counting minimum
(s, t)
-cuts in weighted planar graphs in polynomial time
Ivona Bezáková
,
Adam J. Friedlander
Lecture Notes in Computer Science
6281
, 2010, pp. 126-137
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Ivona Bezáková
,
Nayantara Bhatnagar
,
Dana Randall
Lecture Notes in Computer Science
5609
, 2009, pp. 307-316
Sampling edge covers in 3-regular graphs
Ivona Bezáková
,
William A. Rummler
Lecture Notes in Computer Science
5734
, 2009, pp. 137-148
Accelerating simulated annealing for the permanent and combinatorial counting problems
Ivona Bezáková
,
Daniel S̑tefankovic̑
,
Vijay V. Vazirani
,
Eric Vigoda
SIAM Journal on Computing
37
(5), 2008, pp. 1429-1454
Negative examples for sequential importance sampling of binary contingency tables
Ivona Bezáková
,
Alistair Sinclair
,
Daniel S̑tefankovic̑
,
Eric Vigoda
Lecture Notes in Computer Science
4168
, 2006, pp. 136-147