Anders Yeo - RankMe

294 papers A* 4A 3B 7C 3Misc 2Journal 263Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Public Goods Games in Directed Networks with Constraints on Sharing. AAAI Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2025	J	`jnl`	Acyclic dichromatic number of oriented graphs. CoRR Jørgen Bang-Jensen, Lucas Picasarri-Arrieta, Anders Yeo
2025	J	`jnl`	Extensions and applications of the Tuza-Vestergaard theorem. Eur. J. Comb. Michael A. Henning, Anders Yeo
2025	J	`jnl`	Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs. CoRR Gregory Z. Gutin, Mads Anker Nielsen, Anders Yeo, Yacong Zhou
2025	J	`jnl`	Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs. CoRR Jiangdong Ai, Qiwen Guo, Gregory Z. Gutin, Yimin Hao, Anders Yeo
2025	J	`jnl`	Generalized paths and cycles in semicomplete multipartite digraphs. Discret. Appl. Math. Jørgen Bang-Jensen, Yun Wang, Anders Yeo
2025	J	`jnl`	Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. J. Graph Theory Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2025	J	`jnl`	Oriented discrepancy of Hamilton cycles and paths in digraphs. CoRR Qiwen Guo, Gregory Z. Gutin, Yongxin Lan, Qi Shao, Anders Yeo, Yacong Zhou
2025	J	`jnl`	Public Goods Games in Directed Networks with Constraints on Sharing. CoRR Argyrios Deligkas, Gregory Z. Gutin, Mark Jones, Philip R. Neary, Anders Yeo
2025	J	`jnl`	Transversal coalitions in hypergraphs. Discret. Math. Michael A. Henning, Anders Yeo
2024	J	`jnl`	Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Finding all stable matchings with assignment constraints. Games Econ. Behav. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2024	J	`jnl`	Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Note on disjoint cycles in multipartite tournaments. Discret. Math. Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials. CoRR Jiangdong Ai, Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2024	J	`jnl`	On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Safe sets and in-dominating sets in digraphs. Discret. Appl. Math. Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo
2024	J	`jnl`	Speeding up deferred acceptance. CoRR Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vickery, Anders Yeo
2024	J	`jnl`	Transversals in regular uniform hypergraphs. J. Graph Theory Michael A. Henning, Anders Yeo
2024	J	`jnl`	Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree. CoRR Gregory Z. Gutin, Hui Lei, Anders Yeo, Yacong Zhou
2023	J	`jnl`	(1,1)-Cluster Editing is polynomial-time solvable. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2023	J	`jnl`	Bounds on Maximum Weight Directed Cut. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2023	J	`jnl`	Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	A*	`conf`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems. IJCAI Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Directed Steiner tree packing and directed tree connectivity. J. Graph Theory Yuefang Sun, Anders Yeo
2023	J	`jnl`	Exact capacitated domination: On the computational complexity of uniqueness. Discret. Appl. Math. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Lower Bounds for Maximum Weighted Cut. SIAM J. Discret. Math. Gregory Z. Gutin, Anders Yeo
2023	J	`jnl`	Making a tournament k $k$-strong. J. Graph Theory Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo
2023	J	`jnl`	Preference swaps for the stable matching problem. Theor. Comput. Sci. Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2023	J	`jnl`	Results on the small quasi-kernel conjecture. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2023	J	`jnl`	Some coordination problems are harder than others. CoRR Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2023	J	`jnl`	The Tuza-Vestergaard Theorem. SIAM J. Discret. Math. Michael A. Henning, Christian Löwenstein, Anders Yeo
2023	J	`jnl`	The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2023	J	`jnl`	Unique stable matchings. Games Econ. Behav. Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2023	J	`jnl`	k-best feature selection and ranking via stochastic approximation. Expert Syst. Appl. David V. Akman, Milad Malekipirbazari, Zeren D. Yenice, Anders Yeo, Niranjan Adhikari, Yong Kai Wong, Babak Abbasi, Alev Taskin Gumus
2022	J	`jnl`	(1, 1)-Cluster Editing is Polynomial-time Solvable. CoRR Gregory Z. Gutin, Anders Yeo
2022	J	`jnl`	A complete description of convex sets associated with matchings and edge-connectivity in graphs. J. Graph Theory Michael A. Henning, Anders Yeo
2022	J	`jnl`	Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2022	J	`jnl`	Component Order Connectivity in Directed Graphs. Algorithmica Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2022	J	`jnl`	Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. J. Graph Theory Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo
2022	J	`jnl`	Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
2022	J	`jnl`	Perfect forests in graphs and their extensions. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2022	J	`jnl`	Results on the Small Quasi-Kernel Conjecture. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2021	J	`jnl`	A new upper bound on the total domination number in graphs with minimum degree six. Discret. Appl. Math. Michael A. Henning, Anders Yeo
2021	J	`jnl`	Affine Planes and Transversals in 3-Uniform Linear Hypergraphs. Graphs Comb. Michael A. Henning, Anders Yeo
2021	J	`jnl`	Dominating vertex covers: the vertex-edge domination problem. Discuss. Math. Graph Theory William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo
2021	J	`jnl`	Lower Bounds for Maximum Weighted Cut. CoRR Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	Lower bounds on Tuza constants for transversals in linear uniform hypergraphs. Discret. Appl. Math. Michael A. Henning, Anders Yeo
2021	J	`jnl`	Matching and edge-connectivity in graphs with given maximum degree. Discret. Math. Michael A. Henning, Anders Yeo
2021	J	`jnl`	On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2021	B	`conf`	Perfect Forests in Graphs and Their Extensions. MFCS Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	Perfect Forests in Graphs and Their Extensions. CoRR Gregory Z. Gutin, Anders Yeo
2021	J	`jnl`	Preference Swaps for the Stable Matching Problem. CoRR Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo
2021	J	`jnl`	Proper-walk connection number of graphs. J. Graph Theory Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2020	J	`jnl`	Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2020	J	`jnl`	Bounds on upper transversals in hypergraphs. J. Comb. Optim. Michael A. Henning, Anders Yeo
2020	B	`conf`	Component Order Connectivity in Directed Graphs. IPEC Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Component Order Connectivity in Directed Graphs. CoRR Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2020	J	`jnl`	Exact capacitated domination: on the computational complexity of uniqueness. CoRR Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2020	J	`jnl`	Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo
2020	J	`jnl`	On the parameterized complexity of 2-partitions. CoRR Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
2020	J	`jnl`	On the parameterized complexity of 2-partitions. Theor. Comput. Sci. Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
2020	J	`jnl`	Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments. Discret. Math. Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo
2020	J	`jnl`	The directed 2-linkage problem with length constraints. Theor. Comput. Sci. Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2020	Misc	`conf`	Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games. COCOON Gregory Z. Gutin, Philip R. Neary, Anders Yeo
2019	J	`jnl`	Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. CoRR Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2019	J	`jnl`	Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2019	J	`jnl`	Connecting edge-colouring. CoRR Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo
2019	J	`jnl`	Safe sets in digraphs. CoRR Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Anders Yeo
2019	J	`jnl`	Spanning eulerian subdigraphs in semicomplete digraphs. CoRR Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2019	J	`jnl`	Strong subgraph k-connectivity. J. Graph Theory Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
2019	J	`jnl`	The directed 2-linkage problem with length constraints. CoRR Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo
2019	J	`jnl`	Upper transversals in hypergraphs. Eur. J. Comb. Michael A. Henning, Anders Yeo
2018	J	`jnl`	Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs. Discret. Math. Michael A. Henning, Anders Yeo
2018	J	`jnl`	On Upper Transversals in 3-Uniform Hypergraphs. Electron. J. Comb. Michael A. Henning, Anders Yeo
2018	J	`jnl`	Out-degree reducing partitions of digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2018	—	`ch.`	Semicomplete Multipartite Digraphs. Classes of Directed Graphs Anders Yeo
2018	J	`jnl`	Strong Subgraph k-connectivity. CoRR Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang
2018	J	`jnl`	Tight lower bounds on the matching number in a graph with given maximum degree. J. Graph Theory Michael A. Henning, Anders Yeo
2017	J	`jnl`	A note on fractional disjoint transversals in hypergraphs. Discret. Math. Michael A. Henning, Anders Yeo
2017	J	`jnl`	Acyclicity in edge-colored graphs. Discret. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2017	J	`jnl`	Chinese Postman Problem on edge-colored multigraphs. Discret. Appl. Math. Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems. Autom. Supratim Ghosh, Justin Ruths, Anders Yeo
2017	J	`jnl`	Note on Perfect Forests in Digraphs. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2017	J	`jnl`	Out-degree reducing partitions of digraphs. CoRR Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
2017	—	`ch.`	Parameterized Constraint Satisfaction Problems: a Survey. The Constraint Satisfaction Problem Gregory Z. Gutin, Anders Yeo
2017	J	`jnl`	Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2017	J	`jnl`	Transversals and Independence in Linear Hypergraphs with Maximum Degree Two. Electron. J. Comb. Michael A. Henning, Anders Yeo
2016	J	`jnl`	Acyclicity in Edge-Colored Graphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2016	J	`jnl`	Independence in 5-uniform hypergraphs. Discret. Math. Alex Eustis, Michael A. Henning, Anders Yeo
2016	—	`ch.`	Kernelization, MaxLin Above Average. Encyclopedia of Algorithms Anders Yeo
2016	J	`jnl`	Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2016	J	`jnl`	Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
2016	J	`jnl`	The complexity of finding arc-disjoint branching flows. Discret. Appl. Math. Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo
2016	J	`jnl`	Transversals in 4-Uniform Hypergraphs. Electron. J. Comb. Michael A. Henning, Anders Yeo
2015	J	`jnl`	Balanced branchings in digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2015	J	`jnl`	Chinese Postman Problem on Edge-Colored Multigraphs. CoRR Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo
2015	J	`jnl`	Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long Induced Paths. CoRR Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo
2015	J	`jnl`	Note on Perfect Forests in Digraphs. CoRR Gregory Z. Gutin, Anders Yeo
2015	J	`jnl`	On 2-Colorings of Hypergraphs. J. Graph Theory Michael A. Henning, Anders Yeo
2015	J	`jnl`	Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey. J. Comb. Optim. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo
2015	J	`jnl`	Total Transversals in Hypergraphs and Their Applications. SIAM J. Discret. Math. Michael A. Henning, Anders Yeo
2014	J	`jnl`	A New Lower Bound on the Independence Number of a Graph and Applications. Electron. J. Comb. Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo
2014	J	`jnl`	A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture. Discret. Appl. Math. Michael A. Henning, Anders Yeo
2014	J	`jnl`	Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs. Graphs Comb. Michael A. Henning, Anders Yeo
2014	J	`jnl`	Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2014	J	`jnl`	On the Meyniel condition for hamiltonicity in bipartite digraphs. Discret. Math. Theor. Comput. Sci. Janusz Adamus, Lech Adamus, Anders Yeo
2014	J	`jnl`	Relating the annihilation number and the 2-domination number of a tree. Discret. Math. Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo
2014	J	`jnl`	Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
2014	J	`jnl`	The complexity of multicut and mixed multicut problems in (di)graphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2014	J	`jnl`	Total Domination in Graphs with Diameter 2. J. Graph Theory Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo
2014	J	`jnl`	Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo
2013	J	`jnl`	(Non-)existence of polynomial kernels for the Test Cover problem. Inf. Process. Lett. Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	2-colorings in Eur. J. Comb. Michael A. Henning, Anders Yeo
2013	J	`jnl`	A new bound for 3-satisfiable MaxSat and its algorithmic application. Inf. Comput. Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo
2013	J	`jnl`	Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2013	J	`jnl`	Hypergraphs with large transversal number. Discret. Math. Michael A. Henning, Anders Yeo
2013	J	`jnl`	Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three. J. Graph Theory Michael A. Henning, Anders Yeo
2013	J	`jnl`	On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem. ACM Trans. Inf. Syst. Secur. Jason Crampton, Gregory Z. Gutin, Anders Yeo
2013	J	`jnl`	Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$. Theory Comput. Syst. Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2013	J	`jnl`	Parameterized Complexity of k-Chinese Postman Problem. CoRR Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	Parameterized Rural Postman and Conjoining Bipartite Matching Problems. CoRR Gregory Z. Gutin, Magnus Wahlström, Anders Yeo
2013	J	`jnl`	Parameterized complexity of k-Chinese Postman Problem. Theor. Comput. Sci. Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2013	J	`jnl`	Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties. Theor. Comput. Sci. Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo
2013	J	`jnl`	Total domination and matching numbers in graphs with all vertices in triangles. Discret. Math. Michael A. Henning, Anders Yeo
2013	J	`jnl`	Transversals and matchings in 3-uniform hypergraphs. Eur. J. Comb. Michael A. Henning, Anders Yeo
2012	J	`jnl`	(Non-)existence of Polynomial Kernels for the Test Cover Problem CoRR Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo
2012	J	`jnl`	A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2012	J	`jnl`	An algorithm for finding input-output constrained convex sets in an acyclic digraph. J. Discrete Algorithms Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo
2012	J	`jnl`	Arc-disjoint spanning sub(di)graphs in digraphs. Theor. Comput. Sci. Jørgen Bang-Jensen, Anders Yeo
2012	—	`conf`	Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey. The Multivariate Algorithmic Revolution and Beyond Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2012	A	`conf`	Fixed-Parameter Tractability of Satisfying beyond the Number of Variables. SAT Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Fixed-parameter tractability of satisfying beyond the number of variables CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Girth and Total Domination in Graphs. Graphs Comb. Michael A. Henning, Anders Yeo
2012	J	`jnl`	Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Identifying Vertex Covers in Graphs. Electron. J. Comb. Michael A. Henning, Anders Yeo
2012	J	`jnl`	On a conjecture of Murty and Simon on diameter two critical graphs II. Discret. Math. Teresa W. Haynes, Michael A. Henning, Anders Yeo
2012	J	`jnl`	On the Parameterized Complexity of the Workflow Satisfiability Problem CoRR Jason Crampton, Gregory Z. Gutin, Anders Yeo
2012	A*	`conf`	On the parameterized complexity of the workflow satisfiability problem. CCS Jason Crampton, Gregory Z. Gutin, Anders Yeo
2012	J	`jnl`	Parameterizations of Test Cover with Bounded Test Sizes CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo
2012	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2012	J	`jnl`	Parameterized Eulerian strong component arc deletion problem on tournaments. Inf. Process. Lett. Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2012	J	`jnl`	Parameterized Study of the Test Cover Problem CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2012	B	`conf`	Parameterized Study of the Test Cover Problem. MFCS Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo
2012	J	`jnl`	Vertex Disjoint Cycles of Different Length in Digraphs. SIAM J. Discret. Math. Michael A. Henning, Anders Yeo
2011	J	`jnl`	A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application CoRR Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	B	`conf`	A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. FCT Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. Michael A. Henning, Ingo Schiermeyer, Anders Yeo
2011	J	`jnl`	A kernel of order 2k-c for Vertex Cover. Discret. Math. Arezou Soleimanfallah, Anders Yeo
2011	J	`jnl`	A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011	J	`jnl`	A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free. Discret. Optim. Teresa W. Haynes, Michael A. Henning, Anders Yeo
2011	J	`jnl`	Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey CoRR Gregory Z. Gutin, Anders Yeo
2011	J	`jnl`	Hypercontractive Inequality for Pseudo-Boolean Functions of Bounded Fourier Width CoRR Gregory Z. Gutin, Anders Yeo
2011	J	`jnl`	Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2011	J	`jnl`	Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems. Theor. Comput. Sci. Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	On a conjecture of Murty and Simon on diameter 2-critical graphs. Discret. Math. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo
2011	J	`jnl`	On the existence of k-partite or K Discret. Math. Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo
2011	J	`jnl`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming CoRR Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2011	J	`jnl`	Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_2$ CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Parameterized Eulerian Strong Component Arc Deletion Problem on Tournaments CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2011	J	`jnl`	Perfect Matchings in Total Domination Critical Graphs. Graphs Comb. Michael A. Henning, Anders Yeo
2011	—	`conf`	Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo
2011	J	`jnl`	Solving MAX- Algorithmica Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010	B	`conf`	A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application. IPEC Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2010	J	`jnl`	All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels CoRR Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	—	`conf`	All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	J	`jnl`	Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2010	J	`jnl`	FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2010	J	`jnl`	Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems CoRR Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation CoRR Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo
2010	J	`jnl`	Note on Maximal Bisection above Tight Lower Bound CoRR Gregory Z. Gutin, Anders Yeo
2010	J	`jnl`	Note on maximal bisection above tight lower bound. Inf. Process. Lett. Gregory Z. Gutin, Anders Yeo
2010	B	`conf`	Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2010	A*	`conf`	Solving MAX-r-SAT Above a Tight Lower Bound. SODA Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010	J	`jnl`	Strong Transversals in Hypergraphs and Double Total Domination in Graphs. SIAM J. Discret. Math. Michael A. Henning, Anders Yeo
2009	J	`jnl`	A Polynomial Kernel For Multicut In Trees CoRR Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009	A	`conf`	A Polynomial Kernel for Multicut in Trees. STACS Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo
2009	J	`jnl`	A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	—	`conf`	A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	Misc	`conf`	Algorithm for Finding COCOON Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem CoRR Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo
2009	J	`jnl`	Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2009	—	`conf`	Better Than Optimal: Fast Identification of Custom Instruction Candidates. CSE (2) Joseph Reddington, Gregory Z. Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo
2009	A	`conf`	Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2009	J	`jnl`	Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Graphs Comb. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2009	J	`jnl`	On the number of connected convex subgraphs of a connected acyclic digraph. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2009	J	`jnl`	Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2009	J	`jnl`	Solving MAX-2-SAT Above a Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009	J	`jnl`	Some complexity problems on single input double output controllers. Discret. Appl. Math. Katalin M. Hangos, Zsolt Tuza, Anders Yeo
2009	J	`jnl`	Total Domination in Partitioned Graphs. Graphs Comb. Allan Frendrup, Preben D. Vestergaard, Anders Yeo
2009	J	`jnl`	Total domination in 2-connected graphs and in graphs with no induced 6-cycles. J. Graph Theory Michael A. Henning, Anders Yeo
2008	J	`jnl`	A dichotomy for minimum cost graph homomorphisms. Eur. J. Comb. Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2008	B	`conf`	An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. WG Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo
2008	J	`jnl`	FPT Algorithms and Kernels for the Directed $k$-Leaf Problem CoRR Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo
2008	J	`jnl`	Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2008	J	`jnl`	Hoàng-Reed conjecture holds for tournaments. Discret. Math. Frédéric Havet, Stéphan Thomassé, Anders Yeo
2008	J	`jnl`	Hypergraphs with large transversal number and with edge sizes at least 3. J. Graph Theory Michael A. Henning, Anders Yeo
2008	C	`conf`	Minimum Cost Homomorphism Dichotomy for Oriented Cycles. AAIM Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs. SIAM J. Discret. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	Minimum cost homomorphisms to semicomplete multipartite digraphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2008	J	`jnl`	On matching and total domination in graphs. Discret. Math. Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo
2008	J	`jnl`	Some Parameterized Problems On Digraphs. Comput. J. Gregory Z. Gutin, Anders Yeo
2008	J	`jnl`	The minimum spanning strong subdigraph problem is fixed parameter tractable. Discret. Appl. Math. Jørgen Bang-Jensen, Anders Yeo
2008	J	`jnl`	Total Domination in Graphs with Given Girth. Graphs Comb. Michael A. Henning, Anders Yeo
2007	J	`jnl`	A New Upper Bound on the Total Domination Number of a Graph. Electron. J. Comb. Michael A. Henning, Anders Yeo
2007	J	`jnl`	Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2007	J	`jnl`	Paths and cycles containing given arcs, in close to regular multipartite tournaments. J. Comb. Theory B Anders Yeo
2007	J	`jnl`	Relationships between total domination, order, size, and maximum degree of graphs. J. Graph Theory Anders Yeo
2007	J	`jnl`	The Greedy Algorithm for the Symmetric TSP. Algorithmic Oper. Res. Gregory Z. Gutin, Anders Yeo
2007	J	`jnl`	The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2007	J	`jnl`	The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. Pierre Charbit, Stéphan Thomassé, Anders Yeo
2007	J	`jnl`	Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph. Graphs Comb. Michael A. Henning, Anders Yeo
2007	J	`jnl`	Total domination of graphs and small transversals of hypergraphs. Comb. Stéphan Thomassé, Anders Yeo
2006	J	`jnl`	Domination analysis for minimum multiprocessor scheduling. Discret. Appl. Math. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2006	J	`jnl`	Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2006	J	`jnl`	Fixed-Parameter Complexity of Minimum Profile Problems CoRR Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006	—	`conf`	Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006	J	`jnl`	Hamilton cycles in digraphs of unitary matrices. Discret. Math. Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo
2006	J	`jnl`	Level of repair analysis and minimum cost homomorphisms of graphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso
2006	J	`jnl`	Longest path partitions in generalizations of tournaments. Discret. Math. Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo
2006	J	`jnl`	Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs CoRR Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Minimum cost and list homomorphisms to semicomplete digraphs. Discret. Appl. Math. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	Note on Upper Bounds for TSP Domination Number. Algorithmic Oper. Res. Gregory Z. Gutin, Angela Koller, Anders Yeo
2006	J	`jnl`	On Graphs Comb. Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2006	J	`jnl`	On-line bin Packing with Two Item Sizes. Algorithmic Oper. Res. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2006	C	`conf`	The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2006	J	`jnl`	Total Domination and Matching Numbers in Claw-Free Graphs. Electron. J. Comb. Michael A. Henning, Anders Yeo
2005	J	`jnl`	A problem of finding an acceptable variant in generalized project networks. Adv. Decis. Sci. David Blokh, Gregory Z. Gutin, Anders Yeo
2005	J	`jnl`	Batched bin packing. Discret. Optim. Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2005	—	`conf`	Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. ACiD Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2005	J	`jnl`	Kernels in planar digraphs. J. Comput. Syst. Sci. Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
2005	C	`conf`	Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs. AAIM Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso
2005	J	`jnl`	Mediated digraphs and quantum nonlocality. Discret. Appl. Math. Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo
2005	J	`jnl`	Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2005	J	`jnl`	Minimum Cost and List Homomorphisms to Semicomplete Digraphs CoRR Gregory Z. Gutin, Arash Rafiey, Anders Yeo
2005	—	`conf`	Optimal On-Line Bin Packing with Two Item Sizes. ACiD Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo
2005	J	`jnl`	The Linear Arrangement Problem Parameterized Above Guaranteed Value CoRR Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2005	J	`jnl`	The number of pancyclic arcs in a J. Graph Theory Anders Yeo
2004	J	`jnl`	Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. Comb. Jørgen Bang-Jensen, Anders Yeo
2004	J	`jnl`	Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. Discret. Math. Lutz Volkmann, Anders Yeo
2004	J	`jnl`	Making a tournament k-arc-strong by reversing or deorienting arcs. Discret. Appl. Math. Jørgen Bang-Jensen, Anders Yeo
2004	J	`jnl`	On the number of quasi-kernels in digraphs. J. Graph Theory Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2004	J	`jnl`	Spanning J. Graph Theory Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2004	J	`jnl`	When the greedy algorithm fails. Discret. Optim. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Assignment problem based algorithms are impractical for the generalized TSP. Australas. J Comb. Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Domination analysis of combinatorial optimization problems. Discret. Appl. Math. Gregory Z. Gutin, Alek Vainshtein, Anders Yeo
2003	J	`jnl`	Packing paths in digraphs. J. Graph Theory Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo
2003	J	`jnl`	Small degree out-branchings. J. Graph Theory Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo
2003	J	`jnl`	Steiner type problems for digraphs that are locally semicomplete or extended semicomplete. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
2003	J	`jnl`	Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2003	J	`jnl`	Transformations of generalized ATSP into ATSP. Oper. Res. Lett. David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich
2003	J	`jnl`	Upper bounds on ATSP neighborhood size. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2002	J	`jnl`	Almost all almost regular Discret. Math. Meike Tewes, Lutz Volkmann, Anders Yeo
2002	J	`jnl`	Anti-matroids. Oper. Res. Lett. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Orientations of digraphs almost preserving diameter. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo
2002	J	`jnl`	Pushing vertices in digraphs without long induced cycles. Discret. Appl. Math. Jing Huang, Gary MacGillivray, Anders Yeo
2002	J	`jnl`	Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
2001	J	`jnl`	Construction heuristics for the asymmetric TSP. Eur. J. Oper. Res. Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
2001	J	`jnl`	Making a tournament k-arc-strong by reversing arcs. Electron. Notes Discret. Math. Jørgen Bang-Jensen, Anders Yeo
2001	J	`jnl`	Remarks on hamiltonian digraphs. Australas. J Comb. Gregory Z. Gutin, Anders Yeo
2001	J	`jnl`	Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Graphs Comb. Gregory Z. Gutin, Anders Yeo
2001	J	`jnl`	TSP tour domination and Hamilton cycle decompositions of regular digraphs. Oper. Res. Lett. Gregory Z. Gutin, Anders Yeo
2001	J	`jnl`	The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs. J. Algorithms Jørgen Bang-Jensen, Anders Yeo
2000	J	`jnl`	Complementary cycles containing prescribed vertices in tournaments. Discret. Math. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
2000	J	`jnl`	Convex-Round and Concave-Round Graphs. SIAM J. Discret. Math. Jørgen Bang-Jensen, Jing Huang, Anders Yeo
2000	J	`jnl`	Kings in semicomplete multipartite digraphs. J. Graph Theory Gregory Z. Gutin, Anders Yeo
2000	J	`jnl`	Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs. Discret. Math. Gregory Z. Gutin, Meike Tewes, Anders Yeo
2000	J	`jnl`	Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian. J. Comb. Theory B Gregory Z. Gutin, Anders Yeo
2000	J	`jnl`	Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian. Discret. Math. Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo
1999	J	`jnl`	A New Sufficient Condition for a Digraph to Be Hamiltonian. Discret. Appl. Math. Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
1999	J	`jnl`	A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. J. Algorithms Anders Yeo
1999	—	`conf`	Construction Heuristics and Domination Analysis for the Asymmetric TSP. WAE Fred W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich
1999	J	`jnl`	Diregular J. Graph Theory Anders Yeo
1999	J	`jnl`	Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments. J. Graph Theory Anders Yeo
1999	J	`jnl`	How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? Graphs Comb. Anders Yeo
1999	J	`jnl`	Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs. J. Graph Theory Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1998	J	`jnl`	Maximal and Minimal Vertex-Critical Graphs of Diameter Two. J. Comb. Theory B Jing Huang, Anders Yeo
1998	J	`jnl`	Note on alternating directed cycles. Discret. Math. Gregory Z. Gutin, Benny Sudakov, Anders Yeo
1998	J	`jnl`	Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. Discret. Appl. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1997	J	`jnl`	A Note on Alternating Cycles in Edge-Coloured Graphs. J. Comb. Theory B Anders Yeo
1997	J	`jnl`	Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. Comb. Probab. Comput. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1997	J	`jnl`	One-diregular subgraphs in semicomplete multipartite digraphs. J. Graph Theory Anders Yeo
1996	J	`jnl`	On k-strong and k-cyclic digraphs. Discret. Math. Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo
1996	J	`jnl`	Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. Discret. Appl. Math. Gregory Z. Gutin, Anders Yeo