|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 7 occurrences of 7 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ivona Bezáková, Adam J. Friedlander |
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, James E. Heliotis, Sean Strout, Adam Oest, Paul D. Solt |
Programming board-game strategies in the introductory CS sequence (abstract only).  |
SIGCSE  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ivona Bezáková |
Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Nayantara Bhatnagar, Dana Randall |
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.  |
J. Comb. Optim.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Adam J. Friedlander |
Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time.  |
MFCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, William A. Rummler |
Sampling Edge Covers in 3-Regular Graphs.  |
MFCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Nayantara Bhatnagar, Dana Randall |
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.  |
COCOON  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková |
Sampling Binary Contingency Tables.  |
Computing in Science and Engineering  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda |
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.  |
SIAM J. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda |
Sampling binary contingency tables with a greedy start.  |
Random Struct. Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda |
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda |
Sampling binary contingency tables with a greedy start.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda |
Accelerating simulated annealing for the permanent and combinatorial counting problems.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Adam Kalai, Rahul Santhanam |
Graph model selection using maximum likelihood.  |
ICML  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Varsha Dani |
Allocating indivisible goods.  |
SIGecom Exchanges  |
2005 |
DBLP DOI BibTeX RDF |
cake-cutting, algorithms, approximation algorithms, game theory, fairness, theory, economics, truthfulness |
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|