Yori Zwólš

Computer Science · Physical Sciences

12h-index2.4kcitations27works3.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(9), Reinforcement Learning in Robotics(4), Cooperative Communication and Network Coding(4), Interconnection Networks and Systems(4), Limits and Structures in Graph Theory(4)

Publications26 total

Solving Mixed Integer Programs Using Neural Networks
arXiv (Cornell University)·2020· 42 citedOpen Access
Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search
arXiv (Cornell University)·2018· 41 citedOpen Access
Generative Temporal Models with Spatial Memory for Partially Observed Environments
arXiv (Cornell University)·2018· 3 citedOpen Access
PathNet: Evolution Channels Gradient Descent in Super Neural Networks
arXiv (Cornell University)·2017· 643 citedOpen Access
Hybrid computing using a neural network with dynamic external memory
Nature·2016· 1.4k cited
Patterns of conjunctive forks
arXiv (Cornell University)·2016· 1 citedOpen Access
Patterns of conjunctive forks
arXiv (Cornell University)·2016· 1 citedOpen Access
Deep Reinforcement Learning with Attention for Slate Markov Decision Processes with High-Dimensional States and Actions
arXiv (Cornell University)·2015· 32 citedOpen Access
The complexity of minimum-length path decompositions
Journal of Computer and System Sciences·2015· 4 citedOpen Access
Linear and Integer Optimization : Theory and Practice, Third Edition
2015· 10 cited
Linear and Integer Optimization
2015· 59 cited
A De Bruijn–Erdős Theorem for Chordal Graphs
The Electronic Journal of Combinatorics·2015· 20 citedOpen Access
Linear and integer optimization: Theory and practice
2015· 36 cited
Lines in hypergraphs
COMBINATORICA·2013· 12 cited
Optimal edge‐coloring with edge rate constraints
Networks·2013· 1 cited
A De Bruijn-Erdos theorem for chordal graphs
arXiv (Cornell University)·2012· 6 citedOpen Access
Lines in hypergraphs
arXiv (Cornell University)·2011Open Access
Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement
Journal of Graph Theory·2011· 19 citedOpen Access
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
Discrete Applied Mathematics·2011· 2 cited
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
IEEE/ACM Transactions on Networking·2011· 27 cited
page 1 of 2Next →

Frequent Co-authors

Maria Chudnovsky(10), Bernard Ries(6), Vašek Chvátal(5), Gerard Sierksma(4), Laurent Beaudou(4), Xiaohong Chen(4), Ehsan Chiniforooshan(4), Nicolás Fraiman(4), Berk Birand(3), Paul Seymour(3), Gil Zussman(3), Adrian Bondy(3), Alexander Pritzel(2), Dariusz Dereniowski(2), Wiesław Kubiak(2), František Matúš(2), Alex Graves(1), Greg Wayne(1), Malcolm Reynolds(1), Tim Harley(1)