Krzysztof Choromanski, Ph.D. - Publications
Affiliations: | 2013 | Operations Research | Columbia University, New York, NY |
Year | Citation | Score | |||
---|---|---|---|---|---|
2019 | Berger E, Choromanski K, Chudnovsky M. On the Erdős–Hajnal conjecture for six-vertex tournaments European Journal of Combinatorics. 75: 113-122. DOI: 10.1016/J.Ejc.2018.08.007 | 0.67 | |||
2018 | Choromanski K, Falik D, Liebenau A, Patel V, Pilipczuk M. Excluding Hooks and their Complements Electronic Journal of Combinatorics. 25: 3-27. DOI: 10.37236/6397 | 0.713 | |||
2015 | Choromanski K. EH-suprema of tournaments with no nontrivial homogeneous sets Journal of Combinatorial Theory. Series B. 114. DOI: 10.1016/J.Jctb.2015.04.002 | 0.694 | |||
2015 | Berger E, Choromanski K, Chudnovsky M. Forcing large transitive subtournaments Journal of Combinatorial Theory. Series B. 112: 1-17. DOI: 10.1016/J.Jctb.2014.11.003 | 0.702 | |||
2014 | Choromanski K, Chudnovsky M, Seymour P. Tournaments with near-linear transitive subsets Journal of Combinatorial Theory. Series B. 109: 228-249. DOI: 10.1016/J.Jctb.2014.06.007 | 0.626 | |||
2013 | Berger E, Choromanski K, Chudnovsky M, Fox J, Loebl M, Scott A, Seymour P, Thomassé S. Tournaments and colouring Journal of Combinatorial Theory. Series B. 103: 1-20. DOI: 10.1016/J.Jctb.2012.08.003 | 0.655 | |||
2013 | Choromański K, Matuszak M, Miȩkisz J. Scale-Free Graph with Preferential Attachment and Evolving Internal Vertex Structure Journal of Statistical Physics. 151: 1175-1183. DOI: 10.1007/S10955-013-0749-1 | 0.382 | |||
2013 | Choromanski K. Upper bounds for Erdös-Hajnal coefficients of tournaments Journal of Graph Theory. 74: 122-132. DOI: 10.1002/Jgt.21696 | 0.638 | |||
2012 | Choromanski K, Malkin T. The power of the Dinur-Nissim algorithm: Breaking privacy of statistical and graph databases Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 65-76. DOI: 10.1145/2213556.2213570 | 0.311 | |||
Show low-probability matches. |