Anders Yeo

发表

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application

Robert Crowston, Gregory Gutin, Mark Jones, 2010, IPEC.

A New Lower Bound on the Independence Number of a Graph and Applications

Michael A. Henning, Christian Löwenstein, Anders Yeo, 2014, Electron. J. Comb..

TSP tour domination and Hamilton cycle decompositions of regular digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2001, Oper. Res. Lett..

On-line bin Packing with Two Item Sizes

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2006, Algorithmic Oper. Res..

Longest path partitions in generalizations of tournaments

Jørgen Bang-Jensen, Anders Yeo, Morten Hegner Nielsen, 2006, Discret. Math..

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian

Lutz Volkmann, Anders Yeo, Yubao Guo, 2000, Discret. Math..

Proper‐walk connection number of graphs

Anders Yeo, Jorgen Bang-Jensen, Thomas Bellitto, 2019, J. Graph Theory.

Note on Perfect Forests in Digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2015, J. Graph Theory.

Orientations of digraphs almost preserving diameter

Gregory Gutin, Anders Yeo, G. Gutin, 2002, Discret. Appl. Math..

A note on fractional disjoint transversals in hypergraphs

Michael A. Henning, Anders Yeo, 2017, Discret. Math..

Identifying Vertex Covers in Graphs

Michael A. Henning, Anders Yeo, 2012, Electron. J. Comb..

Remarks on hamiltonian digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2001, Australas. J Comb..

Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2004, Comb..

Upper bounds on ATSP neighborhood size

Gregory Gutin, Anders Yeo, G. Gutin, 2003, Discret. Appl. Math..

Variations of Total Domination

Michael A. Henning, Anders Yeo, Anders Yeo, 2013 .

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, J. Graph Theory.

22-colorings in Kk-regular Kk-uniform Hypergraphs

Michael A. Henning, Anders Yeo, 2013, Eur. J. Comb..

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average

Michael R. Fellows, Gregory Gutin, Mark Jones, 2011, FSTTCS.

On 2-Colorings of Hypergraphs

Michael A. Henning, Anders Yeo, 2015, J. Graph Theory.

Parameterizations of Test Cover with Bounded Test Sizes

Gregory Gutin, Mark Jones, Robert Crowston, 2014, Algorithmica.

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound pdf

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, ArXiv.

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Stefan Szeider, Gregory Gutin, Anders Yeo, 2007, Theory of Computing Systems.

Minimum cost homomorphisms to semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

A probabilistic approach to problems parameterized above or below tight bounds

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, J. Comput. Syst. Sci..

A New Upper Bound on the Total Domination Number of a Graph

Michael A. Henning, Anders Yeo, 2007, Electron. J. Comb..

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2012, SAT.

Kings in semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2000, J. Graph Theory.

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs

Michael A. Henning, Anders Yeo, 2018, Discret. Math..

A New Sufficient Condition for a Digraph to Be Hamiltonian

Jørgen Bang-Jensen, Anders Yeo, Yubao Guo, 1999, Discret. Appl. Math..

Arc-disjoint spanning sub(di)graphs in digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2012, Theor. Comput. Sci..

Paths and cycles containing given arcs, in close to regular multipartite tournaments

Anders Yeo, Anders Yeo, 2007, J. Comb. Theory, Ser. B.

On matching and total domination in graphs

Michael A. Henning, Anders Yeo, Erfang Shan, 2008, Discret. Math..

On the parameterized complexity of the workflow satisfiability problem

Gregory Gutin, Anders Yeo, Jason Crampton, 2012, CCS '12.

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic

Lutz Volkmann, Anders Yeo, Meike Tewes, 2002, Discret. Math..

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2 pdf

Anders Yeo, Joergen Bang-Jensen, St'ephane Bessy, 2020, Graphs and Combinatorics.

Level of repair analysis and minimum cost homomorphisms of graphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

Relating the annihilation number and the 2-domination number of a tree

Michael A. Henning, Anders Yeo, Douglas F. Rall, 2014, Discret. Math..

Tight lower bounds on the matching number in a graph with given maximum degree

Michael A. Henning, Anders Yeo, 2018, J. Graph Theory.

Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games

Gregory Gutin, Anders Yeo, Philip R. Neary, 2020, COCOON.

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

Michael A. Henning, Anders Yeo, Anders Yeo, 2007, Graphs Comb..

Solving MAX-r-SAT Above a Tight Lower Bound

Noga Alon, Stefan Szeider, Gregory Gutin, 2010, SODA.

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1997, Combinatorics, Probability and Computing.

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

Michael A. Henning, Anders Yeo, 2013, J. Graph Theory.

Note on alternating directed cycles

Benny Sudakov, Gregory Gutin, Anders Yeo, 1998, Discret. Math..

Kernel bounds for disjoint cycles and disjoint paths

Anders Yeo, Stéphan Thomassé, Hans L. Bodlaender, 2009, Theor. Comput. Sci..

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2006, Discret. Optim..

Hamilton cycles in digraphs of unitary matrices

Simone Severini, Gregory Gutin, Anders Yeo, 2006, Discret. Math..

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels pdf

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2010, ArXiv.

Maximal and Minimal Vertex-Critical Graphs of Diameter Two

Jing Huang, Anders Yeo, 1998, J. Comb. Theory, Ser. B.

On the number of connected convex subgraphs of a connected acyclic digraph

Gregory Gutin, Anders Yeo, G. Gutin, 2009, Discret. Appl. Math..

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two

Michael A. Henning, Anders Yeo, 2017, Electron. J. Comb..

Construction Heuristics and Domination Analysis for the Asymmetric TSP

Fred W. Glover, Gregory Gutin, Anders Yeo, 1999, WAE.

Strong Transversals in Hypergraphs and Double Total Domination in Graphs

Michael A. Henning, Anders Yeo, 2010, SIAM J. Discret. Math..

Girth and Total Domination in Graphs

Michael A. Henning, Anders Yeo, 2012, Graphs Comb..

Domination analysis of combinatorial optimization problems

Gregory Gutin, Anders Yeo, Alek Vainshtein, 2003, Discret. Appl. Math..

Parameterized Eulerian strong component arc deletion problem on tournaments

Gregory Gutin, Mark Jones, Robert Crowston, 2011, Inf. Process. Lett..

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming

Stefan Szeider, Gregory Gutin, Anders Yeo, 2010, Algorithmica.

Total Domination and Matching Numbers in Claw-Free Graphs

Michael A. Henning, Anders Yeo, 2006, Electron. J. Comb..

(Non-)existence of polynomial kernels for the Test Cover problem pdf

Gregory Gutin, Anders Yeo, Gabriele Muciaccia, 2013, Inf. Process. Lett..

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1998, Discret. Appl. Math..

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

Fedor V. Fomin, Saket Saurabh, Gregory Gutin, 2009, COCOON.

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties

Jørgen Bang-Jensen, Anders Yeo, Daniel Gonçalves, 2013, Theor. Comput. Sci..

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2012, J. Comput. Syst. Sci..

On the Meyniel condition for hamiltonicity in bipartite digraphs

Anders Yeo, Lech Adamus, Janusz Adamus, 2012, Discret. Math. Theor. Comput. Sci..

Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour

Gregory Gutin, Anders Yeo, G. Gutin, 1999, Comput. Oper. Res..

Strong subgraph k‐connectivity pdf

Gregory Gutin, Anders Yeo, Xiaoyan Zhang, 2018, J. Graph Theory.

Chinese Postman Problem on edge-colored multigraphs

Gregory Gutin, Mark Jones, Magnus Wahlström, 2015, Discret. Appl. Math..

Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions pdf

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2020, J. Graph Theory.

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs

Michael A. Henning, Anders Yeo, 2014, Graphs Comb..

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming pdf

Stefan Szeider, Gregory Gutin, Anders Yeo, 2010, IPEC.

Better Than Optimal: Fast Identification of Custom Instruction Candidates

Gregory Gutin, Anders Yeo, Joseph Reddington, 2009, 2009 International Conference on Computational Science and Engineering.

Bounds on upper transversals in hypergraphs

Michael A. Henning, Anders Yeo, 2020, J. Comb. Optim..

Total domination in 2‐connected graphs and in graphs with no induced 6‐cycles

Michael A. Henning, Anders Yeo, A. Yeo, 2009, J. Graph Theory.

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2011, The Multivariate Algorithmic Revolution and Beyond.

Safe sets in digraphs pdf

Jørgen Bang-Jensen, Anders Yeo, Shinya Fujita, 2019, ArXiv.

An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2008 .

Lower Bound for Max-$r$-Lin2 and its Applications in Algorithmics and Graph Theory pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2011, ArXiv.

Pushing vertices in digraphs without long induced cycles

Gary MacGillivray, Anders Yeo, Jing Huang, 2002, Discret. Appl. Math..

Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems

Anders Yeo, Supratim Ghosh, Justin Ruths, 2017, Autom..

Parameterized Rural Postman Problem

Gregory Gutin, Anders Yeo, Magnus Wahlstrom, 2013, 1308.2599.

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach

Michael R. Fellows, Gregory Gutin, Mark Jones, 2014, J. Comput. Syst. Sci..

Hoàng-Reed conjecture holds for tournaments

Anders Yeo, Stéphan Thomassé, Frédéric Havet, 2008, Discret. Math..

Independence in 5-uniform hypergraphs

Michael A. Henning, Anders Yeo, Alex Eustis, 2016, Discret. Math..

When the greedy algorithm fails

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2004, Discret. Optim..

Total Domination in Graphs with Given Girth

Michael A. Henning, Anders Yeo, 2008, Graphs Comb..

On the existence of k-partite or Kp-free total domination edge-critical graphs

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2011, Discret. Math..

Total Domination Number Versus Matching Number

Michael A. Henning, Anders Yeo, 2013 .

Assignment problem based algorithms are impractical for the generalized TSP

Gregory Gutin, Anders Yeo, 2003, Australas. J Comb..

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number

Gregory Gutin, Anders Yeo, 2002, Discret. Appl. Math..

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs

Gregory Gutin, Anders Yeo, 2001, Graphs Comb..

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Stefan Szeider, Gregory Gutin, Anders Yeo, 2006, CIAC.

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem

Gregory Gutin, Anders Yeo, Jason Crampton, 2013, TSEC.

Convex-Round and Concave-Round Graphs

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2000, SIAM J. Discret. Math..

Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2011, Discret. Appl. Math..

The Greedy Algorithm for the Symmetric TSP

Gregory Gutin, Anders Yeo, G. Gutin, 2007, Algorithmic Oper. Res..

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs pdf

Gregory Gutin, Anders Yeo, Pavol Hell, 2006, ArXiv.

Connecting edge-colouring pdf

Jørgen Bang-Jensen, Anders Yeo, Thomas Bellitto, 2019, ArXiv.

Balanced branchings in digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2015, Theor. Comput. Sci..

Parameterized Rural Postman and Conjoining Bipartite Matching Problems pdf

Gregory Gutin, Magnus Wahlström, Anders Yeo, 2013, ArXiv.

On Upper Transversals in 3-Uniform Hypergraphs

Michael A. Henning, Anders Yeo, 2018, Electron. J. Comb..

Solving MAX-r-SAT Above a Tight Lower Bound

Noga Alon, Stefan Szeider, Gregory Gutin, 2009, SODA '10.

Making a tournament k-arc-strong by reversing or deorienting arcs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2004, Discret. Appl. Math..

A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2011, Discret. Optim..

On the number of quasi‐kernels in digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2001, J. Graph Theory.

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

Gregory Gutin, Anders Yeo, Arash Rafiey, 2009, Graphs Comb..

Complexity and Algorithmic Results

Michael A. Henning, Anders Yeo, Anders Yeo, 2013 .

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Anders Yeo, Stéphan Thomassé, Pierre Charbit, 2006, Combinatorics, Probability and Computing.

Process planning for rotational parts using the generalized travelling salesman problem

David Ben-Arieh, Anders Yeo, Michal Penn, 2003 .

Batched bin packing

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2005, Discret. Optim..

Progress on the Murty–Simon Conjecture on diameter-2 critical graphs: a survey

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2015, J. Comb. Optim..

Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2004, J. Graph Theory.

Some complexity problems on single input double output controllers. (BRICS report series of Department of Computer Science University of Aarhus, RS-01-18.)

Zsolt Tuza, Anders Yeo, Katalin M. Hangos, 2001 .

Making a tournament k-arc-strong by reversing arcs

Jørgen Bang-Jensen, Anders Yeo, 2001, Electron. Notes Discret. Math..

Total Transversals and Total Domination in Uniform Hypergraphs

Csilla Bujtás, Zsolt Tuza, Michael A. Henning, 2014, Electron. J. Comb..

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2012, J. Discrete Algorithms.

On k-strong and k-cyclic digraphs

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 1996, Discret. Math..

Linear-Number-of-Variables Kernel for Unit-Conflict-Free-Max-Sat Parameterized Above Expectation pdf

Gregory Gutin, Mark Jones, Robert Crowston, 2010, ArXiv.

Parameterized Constraint Satisfaction Problems: a Survey

Gregory Gutin, Anders Yeo, 2017, The Constraint Satisfaction Problem.

Complementary cycles containing prescribed vertices in tournaments

Jørgen Bang-Jensen, Anders Yeo, Yubao Guo, 2000, Discret. Math..

FPT algorithms and kernels for the Directed k-Leaf problem

Gregory Gutin, Anders Yeo, Eun Jung Kim, 2008, J. Comput. Syst. Sci..

The number of pancyclic arcs in a k‐strong tournament

Anders Yeo, Anders Yeo, 2005, J. Graph Theory.

A dichotomy for minimum cost graph homomorphisms

Gregory Gutin, Anders Yeo, Pavol Hell, 2008, Eur. J. Comb..

Spanning eulerian subdigraphs in semicomplete digraphs pdf

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2019, ArXiv.

Total Domination in Planar Graphs

Michael A. Henning, Anders Yeo, Anders Yeo, 2013 .

An algorithm for finding input-output constrained convex sets in an acyclic digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2008, J. Discrete Algorithms.

A kernel of order 2k-c for Vertex Cover

Anders Yeo, Arezou Soleimanfallah, Anders Yeo, 2011, Discret. Math..

A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

Gregory Gutin, Mark Jones, Anders Yeo, 2011, FCT.

Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments

Anders Yeo, 1999, J. Graph Theory.

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2002, Graphs Comb..

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

Gregory Gutin, Anders Yeo, Arash Rafiey, 2008, Graphs Comb..

Total Domination in Partitioned Graphs

Anders Yeo, Preben D. Vestergaard, Allan Frendrup, 2009, Graphs Comb..

Perfect Matchings in Total Domination Critical Graphs

Michael A. Henning, Anders Yeo, Anders Yeo, 2011, Graphs Comb..

Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian

Gregory Gutin, Anders Yeo, G. Gutin, 2000, J. Comb. Theory, Ser. B.

Fixed-Parameter Complexity of Minimum Profile Problems

Stefan Szeider, Gregory Gutin, Anders Yeo, 2006, IWPEC.

Algorithms for generating convex sets in acyclic digraphs

Gregory Gutin, Anders Yeo, Paul N. Balister, 2007, J. Discrete Algorithms.

Component Order Connectivity in Directed Graphs pdf

Gregory Gutin, Magnus Wahlström, Jørgen Bang-Jensen, 2020, IPEC.

A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph

Anders Yeo, Anders Yeo, 1999, J. Algorithms.

Note on maximal bisection above tight lower bound pdf

Gregory Gutin, Anders Yeo, 2010, Inf. Process. Lett..

Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph

Gregory Gutin, Anders Yeo, G. Gutin, 1996, Discret. Appl. Math..

A problem of finding an acceptable variant in generalized project networks

Gregory Gutin, Anders Yeo, David Blokh, 2005, Adv. Decis. Sci..

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths

Gregory Gutin, Mark Jones, Bin Sheng, 2016, Inf. Process. Lett..

Bipartite spanning sub(di)graphs induced by 2-partitions pdf

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2019, J. Graph Theory.

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications

Gregory Gutin, Mark Jones, Robert Crowston, 2011, Algorithmica.

Transversals in 4-Uniform Hypergraphs

Michael A. Henning, Anders Yeo, 2016, Electron. J. Comb..

Total domination of graphs and small transversals of hypergraphs

Anders Yeo, Stéphan Thomassé, Stéphan Thomassé, 2007, Comb..

Anti-matroids

Gregory Gutin, Anders Yeo, 2002, Oper. Res. Lett..

Vertex Disjoint Cycles of Different Length in Digraphs

Michael A. Henning, Anders Yeo, 2012, SIAM J. Discret. Math..

Transformations of generalized ATSP into ATSP

David Ben-Arieh, Gregory Gutin, Anders Yeo, 2003, Oper. Res. Lett..

Domination analysis for minimum multiprocessor scheduling

Gregory Gutin, Anders Yeo, Tommy R. Jensen, 2006, Discret. Appl. Math..

Transversals and matchings in 3-uniform hypergraphs

Michael A. Henning, Anders Yeo, 2013, Eur. J. Comb..

Fixed-Parameter Complexity of Minimum Profile Problems

Stefan Szeider, Gregory Gutin, Anders Yeo, 2007, Algorithmica.

Packing paths in digraphs

Richard C. Brewster, Anders Yeo, Pavol Hell, 2003, J. Graph Theory.

Semicomplete Multipartite Digraphs

Anders Yeo, Anders Yeo, 2018, Classes of Directed Graphs.

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Gregory Gutin, Mark Jones, Anders Yeo, 2010, Theor. Comput. Sci..

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments

Lutz Volkmann, Anders Yeo, L. Volkmann, 2004, Discret. Math..

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, Meike Tewes, 2000, Discret. Math..

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

Jørgen Bang-Jensen, Anders Yeo, Jing Huang, 2003, SIAM J. Discret. Math..

Rural postman parameterized by the number of components of required edges

Gregory Gutin, Magnus Wahlström, Anders Yeo, 2017, J. Comput. Syst. Sci..

Total Transversals in Hypergraphs and Their Applications

Michael A. Henning, Anders Yeo, 2015, SIAM J. Discret. Math..

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture

Michael A. Henning, Anders Yeo, 2014, Discret. Appl. Math..

A Probabilistic Approach to Problems Parameterized above or below Tight Bounds

Stefan Szeider, Gregory Gutin, Anders Yeo, 2009, IWPEC.

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2001, J. Algorithms.

A Note on Alternating Cycles in Edge-Coloured Graphs

Anders Yeo, Anders Yeo, 1997, J. Comb. Theory, Ser. B.

Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP

Gregory Gutin, Anders Yeo, Alexey Zverovich, 2001, Discret. Appl. Math..

One-diregular subgraphs in semicomplete multipartite digraphs

Anders Yeo, Anders Yeo, 1997, J. Graph Theory.

Hypergraphs with large transversal number

Michael A. Henning, Anders Yeo, 2013, Discret. Math..

Out-degree reducing partitions of digraphs

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2018, Theor. Comput. Sci..

Small Degree Out-branchings

Jørgen Bang-Jensen, Anders Yeo, Stéphan Thomassé, 2001 .

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

Fedor V. Fomin, Saket Saurabh, Gregory Gutin, 2009, J. Comput. Syst. Sci..

Mediated digraphs and quantum nonlocality

Simone Severini, Gregory Gutin, Anders Yeo, 2005, Discret. Appl. Math..

Domination Analysis of Combinatorial Optimization Algorithms and Problems

Gregory Gutin, Anders Yeo, G. Gutin, 2005 .

Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5

Anders Yeo, Anders Yeo, 1999, J. Graph Theory.

Parameterized complexity of k-Chinese Postman Problem

Gregory Gutin, Anders Yeo, Gabriele Muciaccia, 2013, Theor. Comput. Sci..

Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound pdf

Gregory Gutin, Matthias Mnich, Anders Yeo, 2009, ArXiv.

Kernels in planar digraphs

Gregory Gutin, Anders Yeo, Ton Kloks, 2005, J. Comput. Syst. Sci..

Some Parameterized Problems On Digraphs

Gregory Gutin, Anders Yeo, G. Gutin, 2008, Comput. J..

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs pdf

Gregory Gutin, Anders Yeo, Arash Rafiey, 2006, SIAM J. Discret. Math..

On a conjecture of Murty and Simon on diameter 2-critical graphs

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2011, Discret. Math..

The complexity of finding arc-disjoint branching flows

Jørgen Bang-Jensen, Anders Yeo, Frédéric Havet, 2016, Discret. Appl. Math..

The complexity of multicut and mixed multicut problems in (di)graphs

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2014, Theor. Comput. Sci..

Parameterized Study of the Test Cover Problem pdf

Saket Saurabh, Gregory Gutin, Mark Jones, 2012, MFCS.

Acyclicity in edge-colored graphs

Gregory Gutin, Mark Jones, Magnus Wahlström, 2017, Discret. Math..

On n-partite Tournaments with Unique n-cycle

Gregory Gutin, Anders Yeo, Arash Rafiey, 2006, Graphs Comb..

Kernelization, MaxLin Above Average

Anders Yeo, 2016, Encyclopedia of Algorithms.

Upper transversals in hypergraphs

Michael A. Henning, Anders Yeo, 2019, Eur. J. Comb..

Total domination and matching numbers in graphs with all vertices in triangles

Michael A. Henning, Anders Yeo, 2013, Discret. Math..

A Polynomial Kernel for Multicut in Trees pdf

Anders Yeo, Nicolas Bousquet, Stéphan Thomassé, 2009, STACS.

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

Anders Yeo, Anders Yeo, 1997, Graphs Comb..

Total Domination in Graphs with Diameter 2

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2013, J. Graph Theory.

Kernel Bounds for Disjoint Cycles and Disjoint Paths

Anders Yeo, Stéphan Thomassé, Hans L. Bodlaender, 2009, ESA.

A new bound for 3-satisfiable MaxSat and its algorithmic application

Mark Jones, Gregory Gutin, Anders Yeo, 2011, Inf. Comput..

The minimum spanning strong subdigraph problem is fixed parameter tractable

Jørgen Bang-Jensen, Anders Yeo, J. Bang-Jensen, 2008, Discret. Appl. Math..

Note on Upper Bounds for TSP Domination Number

Gregory Gutin, Anders Yeo, Angela Koller, 2006, Algorithmic Oper. Res..

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete

Gregory Gutin, Jørgen Bang-Jensen, Anders Yeo, 2003, J. Graph Theory.

Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$

Gregory Gutin, Mark Jones, Robert Crowston, 2012, Theory of Computing Systems.

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments

Anders Yeo, Jorgen Bang-Jensen, Hugues Depres, 2019, Discret. Math..

The directed 2-linkage problem with length constraints

Jørgen Bang-Jensen, Anders Yeo, Thomas Bellitto, 2019, Theor. Comput. Sci..

Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, AAIM.

On the parameterized complexity of 2-partitions pdf

Anders Yeo, Jorgen Bang-Jensen, Jonas Bamse Andersen, 2020, Theor. Comput. Sci..

Construction heuristics for the asymmetric TSP

Fred W. Glover, Gregory Gutin, Anders Yeo, 2001, Eur. J. Oper. Res..

Parameterized Rural Postman and Conjoining Matching Problems

Magnus Wahlström, Gregory Gutin, Anders Yeo, 2013 .

On a conjecture of Murty and Simon on diameter two critical graphs II

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2012, Discrete Mathematics.

Relationships between total domination, order, size, and maximum degree of graphs

Anders Yeo, 2007, J. Graph Theory.

Hypergraphs with large transversal number and with edge sizes at least 3

Michael A. Henning, Anders Yeo, M. Henning, 2008, J. Graph Theory.

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables

Saket Saurabh, Venkatesh Raman, Gregory Gutin, 2012, Algorithmica.

A New Bound on the Domination Number of Graphs with Minimum Degree Two

Michael A. Henning, Anders Yeo, Ingo Schiermeyer, 2011, Electron. J. Comb..

Some complexity problems on single input double output controllers

Zsolt Tuza, Anders Yeo, Katalin M. Hangos, 2009, Discret. Appl. Math..

Minimum cost and list homomorphisms to semicomplete digraphs

Gregory Gutin, Anders Yeo, Arash Rafiey, 2005, Discret. Appl. Math..

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Leo van Iersel, Gregory Gutin, Matthias Mnich, 2010, ESA.

Preference Swaps for the Stable Matching Problem pdf

Gregory Gutin, Anders Yeo, Eduard Eiben, 2021, ArXiv.

Affine Planes and Transversals in 3-Uniform Linear Hypergraphs

Michael A. Henning, Anders Yeo, A. Yeo, 2021, Graphs Comb..

A new upper bound on the total domination number in graphs with minimum degree six

Michael A. Henning, Anders Yeo, 2021, Discret. Appl. Math..

Perfect Forests in Graphs and Their Extensions pdf

Gregory Gutin, Anders Yeo, 2021, MFCS.

Lower bounds on Tuza constants for transversals in linear uniform hypergraphs

Michael A. Henning, Anders Yeo, A. Yeo, 2021, Discret. Appl. Math..

On Supereulerian 2-Edge-Coloured Graphs

Anders Yeo, Jorgen Bang-Jensen, Thomas Bellitto, 2020, Graphs Comb..

Lower Bounds for Maximum Weighted Cut pdf

Gregory Gutin, Anders Yeo, G. Gutin, 2021, ArXiv.

Matching and edge-connectivity in graphs with given maximum degree

Michael A. Henning, Anders Yeo, A. Yeo, 2021, Discret. Math..

Parameterized Complexity of Satisfying Almost All Linear Equations over F2

Gregory Gutin, Robert Crowston, Anders Yeo, 2013 .

Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments

Anders Yeo, 1999 .

Upper Total Domination

Michael A. Henning, Anders Yeo, 2013 .

One-diregular subgraphs in semicomplete multipartite digraphs

Anders Yeo, 1997 .

Kings in semicomplete multipartite digraphs

Gregory Gutin, Anders Yeo, 2000 .

Strongly connected spanning subgraphs with the minimum number of arcs in semicomplete multipartite digraphs

Anders Yeo, J rgen Bang-Jensen, Anders Yeo, 1999 .

Simultaneously Satisfying Linear Equations Over $\mathbb{F}_2$: MaxLin2 and Max-$r$-Lin2 Parameterized Above Average

Michael R. Fellows, Robert Crowston, Anders Yeo, 2011 .

Packing paths in digraphs

Richard C. Brewster, Anders Yeo, Pavol Hell, 2003 .

A Transition from Total Domination in Graphs to Transversals in Hypergraphs

Michael A. Henning, Anders Yeo, A. Yeo, 2007 .

Traveling Salesman Should not be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP

Gregory Gutin, Anders Yeo, Alexey Zverovich, 2001 .

Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5

Anders Yeo, 1999 .

The number of pancyclic arcs in a k-strong tournament

Anders Yeo, 2005 .

Total domination in 2-connected graphs and in graphs with no induced 6-cycles

Michael A. Henning, Anders Yeo, 2009 .

Domination in Convex Bipartite and Convex-round Graphs

Gary MacGillivray, Anders Yeo, Jing Huang, 1999 .

Note on the Path Covering Number of a Semicomplete Multipartite Digraph

Gregory Gutin, Anders Yeo, G. Gutin, 1997 .

Small degree out-branchings

Jørgen Bang-Jensen, Anders Yeo, Stéphan Thomassé, 2003 .

Total Domination in Claw-Free Graphs

Michael A. Henning, Anders Yeo, 2013 .

Total Domination in Graphs with Diameter 2

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2013 .

Introduction to Domination Analysis

Gregory Gutin, Anders Yeo, G. Gutin, 2004 .

A maximum degree theorem for diameter-2-critical graphs

Michael A. Henning, Anders Yeo, Teresa W. Haynes, 2014 .

Hypergraphs with large transversal number and with edge sizes at least 3

Michael A. Henning, Anders Yeo, 2008 .

Large Exponential Neighbourhoods for the Traveling Salesman Problem

Anders Yeo, Anders Yeo, 1997 .

Total Domination Critical Graphs

Michael A. Henning, Anders Yeo, Anders Yeo, 2013 .

Relationships between total domination, order, size, and maximum degree of graphs

Anders Yeo, A. Yeo, 2007 .

Hamiltonian paths and cycles in hypertournaments

Gregory Gutin, Anders Yeo, G. Gutin, 1997 .