| Year |
Citation |
Score |
| 2015 |
Beaudou L, Bondy A, Chen X, Chiniforooshan E, Chudnovsky M, Chvátal V, Fraiman N, Zwols Y. A de Bruijn-Erdős theorem for chordal graphs Electronic Journal of Combinatorics. 22. DOI: 10.37236/3527 |
0.639 |
|
| 2015 |
Dereniowski D, Kubiak W, Zwols Y. The complexity of minimum-length path decompositions Journal of Computer and System Sciences. 81: 1715-1747. DOI: 10.1016/j.jcss.2015.06.011 |
0.467 |
|
| 2013 |
Beaudou L, Bondy A, Chen X, Chiniforooshan E, Chudnovsky M, Chvátal V, Fraiman N, Zwols Y. Lines in hypergraphs Combinatorica. 33: 633-654. DOI: 10.1007/S00493-013-2910-5 |
0.563 |
|
| 2013 |
Dereniowski D, Kubiak W, Ries B, Zwols Y. Optimal edge-coloring with edge rate constraints Networks. 62: 165-182. DOI: 10.1002/net.21505 |
0.625 |
|
| 2012 |
Birand B, Chudnovsky M, Ries B, Seymour P, Zussman G, Zwols Y. Analyzing the performance of greedy maximal scheduling via local pooling and graph theory Ieee/Acm Transactions On Networking. 20: 163-176. DOI: 10.1109/Tnet.2011.2157831 |
0.604 |
|
| 2012 |
Chudnovsky M, Zwols Y. Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement Journal of Graph Theory. 70: 449-472. DOI: 10.1002/Jgt.20626 |
0.655 |
|
| 2011 |
Chudnovsky M, Ries B, Zwols Y. Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures Discrete Applied Mathematics. 159: 1996-2029. DOI: 10.1016/J.Dam.2011.06.031 |
0.697 |
|
| 2011 |
Chudnovsky M, Ries B, Zwols Y. Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs Discrete Applied Mathematics. 159: 1971-1995. DOI: 10.1016/J.Dam.2011.06.024 |
0.697 |
|
| 2010 |
Zwols Y. K4-free graphs with no odd hole: Even pairs and the circular chromatic number Journal of Graph Theory. 65: 303-322. DOI: 10.1002/Jgt.V65:4 |
0.611 |
|
| Show low-probability matches. |