( en | de | ru )

 

Disambiguation of "Cerný, Jakub"

Author of the publication

copydeleteadd this publication to your clipboard
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.

, , , , and . Theory of Computing, 4 (1): 1-20 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elfriede Cerny

Gerhard Cerny

Lothar Cerny

Ute Cerny

Axel Cerny

 

Other publications of authors with the same name

Improvement on the Decay of Crossing Numbers., , and . GD, volume 4875 of Lecture Notes in Computer Science, page 25-30. Springer, (2007)On Intersection Graphs of Segments with Prescribed Slopes., , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 261-271. Springer, (2001)Quantal Correlated Equilibrium in Normal Form Games., , and . EC, page 210-239. ACM, (2022)Incremental Strategy Generation for Stackelberg Equilibria in Extensive-Form Games., , and . EC, page 151-168. ACM, (2018)Evaluating Models of Human Behavior in an Adversarial Multi-Armed Bandit Problem., , , , , , and . CogSci, page 394-400. cognitivesciencesociety.org, (2019)Reducing Optimism Bias in Incomplete Cooperative Games., , , and . AAMAS, page 1847-1855. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)Finite State Machines Play Extensive-Form Games., , and . EC, page 509-533. ACM, (2020)Noncrossing Hamiltonian Paths in Geometric Graphs., , , and . GD, volume 2912 of Lecture Notes in Computer Science, page 86-97. Springer, (2003)Computing Quantal Stackelberg Equilibrium in Extensive-Form Games., , , and . AAAI, page 5260-5268. AAAI Press, (2021)Geometric Graphs with No Three Disjoint Edges.. Discret. Comput. Geom., 34 (4): 679-695 (2005)