Anders Yeo

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 88

Top Venues

Publications

Michael A. Henning, Anders Yeo
Transversals in regular uniform hypergraphs. J. Graph Theory 105 (3) (2024)
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. 346 (2024)
Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR (2024)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105 (3) (2024)
Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou
Note on disjoint cycles in multipartite tournaments. Discret. Math. 347 (10) (2024)
Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR (2024)
Gregory Z. Gutin, Anders Yeo
Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. 37 (2) (2023)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102 (3) (2023)
Michael A. Henning, Christian Löwenstein, Anders Yeo
The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. 37 (2) (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Some coordination problems are harder than others. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR (2023)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940 (Part) (2023)
Yuefang Sun, Anders Yeo
Directed Steiner tree packing and directed tree connectivity. J. Graph Theory 102 (1) (2023)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. 332 (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR (2023)
Gregory Z. Gutin, Anders Yeo
(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. 340 (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Bounds on Maximum Weight Directed Cut. CoRR (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Results on the small quasi-kernel conjecture. Discret. Math. 346 (7) (2023)
Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI (2023)
Jørgen Bang-Jensen, Anders Yeo
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. 949 (2023)
David V. Akman, Milad Malekipirbazari, Zeren D. Yenice, Anders Yeo, Niranjan Adhikari, Yong Kai Wong, Babak Abbasi, Alev Taskin Gumus
k-best feature selection and ranking via stochastic approximation. Expert Syst. Appl. 213 (Part) (2023)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Unique stable matchings. Games Econ. Behav. 141 (2023)
Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo
Making a tournament k $k$-strong. J. Graph Theory 103 (1) (2023)
Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
Results on the Small Quasi-Kernel Conjecture. CoRR (2022)
Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory 99 (4) (2022)
Gregory Z. Gutin, Anders Yeo
Perfect forests in graphs and their extensions. J. Graph Theory 101 (3) (2022)
Gregory Z. Gutin, Anders Yeo
(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR (2022)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. Algorithmica 84 (9) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100 (2) (2022)
Michael A. Henning, Anders Yeo
A complete description of convex sets associated with matchings and edge-connectivity in graphs. J. Graph Theory 101 (4) (2022)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. 38 (6) (2022)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37 (6) (2021)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Proper-walk connection number of graphs. J. Graph Theory 96 (1) (2021)
Michael A. Henning, Anders Yeo
A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. 302 (2021)
Gregory Z. Gutin, Anders Yeo
Perfect Forests in Graphs and Their Extensions. CoRR (2021)
Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
Preference Swaps for the Stable Matching Problem. CoRR (2021)
Michael A. Henning, Anders Yeo
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. Discret. Appl. Math. 304 (2021)
Gregory Z. Gutin, Anders Yeo
Lower Bounds for Maximum Weighted Cut. CoRR (2021)
William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo
Dominating vertex covers: the vertex-edge domination problem. Discuss. Math. Graph Theory 41 (1) (2021)
Michael A. Henning, Anders Yeo
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. Graphs Comb. 37 (3) (2021)
Michael A. Henning, Anders Yeo
Matching and edge-connectivity in graphs with given maximum degree. Discret. Math. 344 (8) (2021)
Gregory Z. Gutin, Anders Yeo
Perfect Forests in Graphs and Their Extensions. MFCS (2021)
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
On the parameterized complexity of 2-partitions. Theor. Comput. Sci. 844 (2020)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Exact capacitated domination: on the computational complexity of uniqueness. CoRR (2020)
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. CoRR (2020)
Michael A. Henning, Anders Yeo
Bounds on upper transversals in hypergraphs. J. Comb. Optim. 39 (1) (2020)
Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. 343 (12) (2020)
Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Component Order Connectivity in Directed Graphs. IPEC (2020)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. Theor. Comput. Sci. 814 (2020)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95 (2) (2020)
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
On the parameterized complexity of 2-partitions. CoRR (2020)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92 (2) (2019)
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo
Safe sets in digraphs. CoRR (2019)
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR (2019)
Michael A. Henning, Anders Yeo
Upper transversals in hypergraphs. Eur. J. Comb. 78 (2019)
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
The directed 2-linkage problem with length constraints. CoRR (2019)
Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
Connecting edge-colouring. CoRR (2019)
Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
Strong subgraph k-connectivity. J. Graph Theory 92 (1) (2019)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
Spanning eulerian subdigraphs in semicomplete digraphs. CoRR (2019)
Michael A. Henning, Anders Yeo
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs. Discret. Math. 341 (8) (2018)
Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
Strong Subgraph k-connectivity. CoRR (2018)
Michael A. Henning, Anders Yeo
Tight lower bounds on the matching number in a graph with given maximum degree. J. Graph Theory 89 (2) (2018)
Michael A. Henning, Anders Yeo
On Upper Transversals in 3-Uniform Hypergraphs. Electron. J. Comb. 25 (4) (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719 (2018)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Out-degree reducing partitions of digraphs. CoRR (2017)
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in edge-colored graphs. Discret. Math. 340 (2) (2017)
Gregory Z. Gutin, Anders Yeo
Note on Perfect Forests in Digraphs. J. Graph Theory 85 (2) (2017)
Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83 (1) (2017)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. 217 (2017)
Supratim Ghosh, Justin Ruths, Anders Yeo
Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems. Autom. 86 (2017)
Michael A. Henning, Anders Yeo
A note on fractional disjoint transversals in hypergraphs. Discret. Math. 340 (10) (2017)
Michael A. Henning, Anders Yeo
Transversals and Independence in Linear Hypergraphs with Maximum Degree Two. Electron. J. Comb. 24 (2) (2017)
Michael A. Henning, Anders Yeo
Transversals in 4-Uniform Hypergraphs. Electron. J. Comb. 23 (3) (2016)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica 74 (1) (2016)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Acyclicity in Edge-Colored Graphs. CoRR (2016)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116 (6) (2016)
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. 209 (2016)
Alex Eustis, Michael A. Henning, Anders Yeo
Independence in 5-uniform hypergraphs. Discret. Math. 339 (2) (2016)
Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo
Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. J. Comb. Optim. 30 (3) (2015)
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR (2015)
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
Chinese Postman Problem on Edge-Colored Multigraphs. CoRR (2015)
Gregory Z. Gutin, Anders Yeo
Note on Perfect Forests in Digraphs. CoRR (2015)
Michael A. Henning, Anders Yeo
Total Transversals in Hypergraphs and Their Applications. SIAM J. Discret. Math. 29 (1) (2015)
Jørgen Bang-Jensen, Anders Yeo
Balanced branchings in digraphs. Theor. Comput. Sci. 595 (2015)
Michael A. Henning, Anders Yeo
On 2-Colorings of Hypergraphs. J. Graph Theory 80 (2) (2015)
Jørgen Bang-Jensen, Anders Yeo
The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. 520 (2014)
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica 68 (3) (2014)
Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo
Relating the annihilation number and the 2-domination number of a tree. Discret. Math. 319 (2014)
Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo
A New Lower Bound on the Independence Number of a Graph and Applications. Electron. J. Comb. 21 (1) (2014)
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo
Total Domination in Graphs with Diameter 2. J. Graph Theory 75 (1) (2014)
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80 (4) (2014)
Janusz Adamus, Lech Adamus, Anders Yeo
On the Meyniel condition for hamiltonicity in bipartite digraphs. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Michael A. Henning, Anders Yeo
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture. Discret. Appl. Math. 173 (2014)
Michael A. Henning, Anders Yeo
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. Graphs Comb. 30 (4) (2014)
Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21 (2) (2014)
Michael A. Henning, Anders Yeo
k-uniform hypergraphs. Eur. J. Comb. 34 (7) (2013)
Jason Crampton, Gregory Z. Gutin, Anders Yeo
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. 16 (1) (2013)

Anders Yeo.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Anders Yeo