Anders Yeo

发表

Batched bin packing

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

A complete description of convex sets associated with matchings and edge‐connectivity in graphs

A. Yeo, M. Henning, Anders Yeo, 2022, J. Graph Theory.

A Polynomial Kernel for Multicut in Trees pdf

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

Lower Bounds for Maximum Weighted Cut pdf

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

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..

When the greedy algorithm fails

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

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

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

Safe sets in digraphs pdf

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

C C ] 1 9 A ug 2 01 9 Safe sets in digraphs

A. Yeo, Yandong Bai, S. Fujita, 2019 .

Independence in 5-uniform hypergraphs

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

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

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

A Transition from Total Domination in Graphs to Transversals in Hypergraphs

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

Total domination of graphs and small transversals of hypergraphs

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

Perfect forests in graphs and their extensions

G. Gutin, Anders Yeo, 2021, MFCS.

Domination analysis for minimum multiprocessor scheduling

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

Domination Analysis of Combinatorial Optimization Algorithms and Problems

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

Short Introduction to Domination Analysis in Combinatorial Optimization

G. Gutin, A. Yeo, A. Koller, 2004 .

Introduction to Domination Analysis

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

Domination analysis of combinatorial optimization problems

Gregory Gutin, Anders Yeo, Alek Vainshtein, 2003, 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..

A dichotomy for minimum cost graph homomorphisms

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

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..

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs pdf

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

Level of repair analysis and minimum cost homomorphisms of graphs

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

Hamilton cycles in digraphs of unitary matrices

S. Severini, G. Gutin, A. Yeo, 2004, Discret. Math..

Conjecture on Hamilton Cycles in Digraphs of Unitary Matrices

S. Severini, G. Gutin, A. Yeo, 2004 .

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

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

Note: A Graph-Theoretical Approach to Level of Repair Analysis

M. Tso, G. Gutin, A. Yeo, 2004 .

Note on the Path Covering Number of a Semicomplete Multipartite Digraph

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

Parameterized Complexity of Satisfying Almost All Linear Equations over F2

Gregory Gutin, Robert Crowston, Anders Yeo, 2013 .

Unique Stable Matchings

Philip R. Neary, G. Gutin, A. Yeo, 2021, 2106.12977.

Parameterized complexity of k-Chinese Postman Problem

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

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

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

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

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

Making a tournament k $k$ ‐strong

J. Bang-Jensen, Anders Yeo, K. S. Johansen, 2022, Journal of Graph Theory.

Unique stable matchings

Philip R. Neary, G. Gutin, Anders Yeo, 2021, Games Econ. Behav..

Minimum cost and list homomorphisms to semicomplete digraphs

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

K-best Feature Selection and Ranking via Stochastic Approximation

Alev Taskin Gumus, Zeren D. Yenice, A. Yeo, 2022, Expert Syst. Appl..

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems

Philip R. Neary, G. Gutin, E. Eiben, 2023, IJCAI.

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem

Philip R. Neary, G. Gutin, E. Eiben, 2023, ArXiv.

Bounds on Maximum Weight Directed Cut

G. Gutin, S. Gerke, J. Ai, 2023, arXiv.org.

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

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

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..

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.

A probabilistic approach to problems parameterized above or below tight bounds

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

Kernel bounds for disjoint cycles and disjoint paths

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

The minimum spanning strong subdigraph problem is fixed parameter tractable

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

The Greedy Algorithm for the Symmetric TSP

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

A kernel of order 2k-c for Vertex Cover

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

Convex-Round and Concave-Round Graphs

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

Finding all Stable Matchings with Assignment Constraints

Philip R. Neary, G. Gutin, Anders Yeo, 2022, 2204.03989.

On Supereulerian 2-Edge-Coloured Graphs

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

The directed 2-linkage problem with length constraints

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

Chinese Postman Problem on edge-colored multigraphs

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

A Note on Alternating Cycles in Edge-Coloured Graphs

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

Rural postman parameterized by the number of components of required edges

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

Upper bounds on ATSP neighborhood size

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

Construction Heuristics and Domination Analysis for the Asymmetric TSP

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

On Supereulerian 2-Edge-Coloured Graphs

J. Bang-Jensen, Thomas Bellitto, Anders Yeo, 2021, Graphs and Combinatorics.

Syddansk Universitet Chinese Postman Problem on edge-colored multigraphs

G. Gutin, A. Yeo, Mark Jones, 2016 .

Proper‐walk connection number of graphs

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

The complexity of finding arc-disjoint branching flows

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

Parameterized Rural Postman Problem

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

The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties

J. Bang-Jensen, Anders Yeo, 2023, Theor. Comput. Sci..

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties

A. Yeo, F. Havet, J. Bang‐Jensen, 2020, J. Graph Theory.

Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2

A. Yeo, S. Bessy, F. Havet, 2020, J. Graph Theory.

Strong subgraph k‐connectivity pdf

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

Arc-disjoint spanning sub(di)graphs in digraphs

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

1 M ar 2 01 8 Strong Subgraph k-connectivity

G. Gutin, A. Yeo, Yuefang Sun, 2018 .

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs pdf

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

Minimum cost homomorphisms to semicomplete multipartite digraphs

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

Large Exponential Neighbourhoods for the Traveling Salesman Problem

Anders Yeo, Anders Yeo, 1997 .

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

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

Component Order Connectivity in Directed Graphs pdf

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

On the parameterized complexity of 2-partitions pdf

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

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments

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

Connecting edge-colouring

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

Spanning eulerian subdigraphs in semicomplete digraphs

F. Havet, J. Bang-Jensen, Anders Yeo, 2019, J. Graph Theory.

Out-degree reducing partitions of digraphs

S. Bessy, F. Havet, J. Bang-Jensen, 2017, Theor. Comput. Sci..

Acyclicity in edge-colored graphs

G. Gutin, Mark Jones, Magnus Wahlström, 2016, Discret. Math..

Note on Perfect Forests in Digraphs

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

Balanced branchings in digraphs

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

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

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

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..

On the Meyniel condition for hamiltonicity in bipartite digraphs

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

Parameterized Eulerian strong component arc deletion problem on tournaments

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

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound pdf

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

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

Gregory Gutin, Anders Yeo, G. Gutin, 2009, 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, J. Comput. Syst. Sci..

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

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

FPT algorithms and kernels for the Directed k-Leaf problem

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

Minimum Cost Homomorphism Dichotomy for Oriented Cycles

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

Some Parameterized Problems On Digraphs

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

Algorithms for generating convex sets in acyclic digraphs

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

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

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

Longest path partitions in generalizations of tournaments

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

On n-partite Tournaments with Unique n-cycle

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

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

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

Kernels in planar digraphs

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

Mediated digraphs and quantum nonlocality

S. Severini, G. Gutin, A. Yeo, 2004, Discret. Appl. Math..

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.

Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

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

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..

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

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

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.

TSP tour domination and Hamilton cycle decompositions of regular digraphs

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

On the number of quasi‐kernels in digraphs

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

An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph

Gregory Gutin, Anders Yeo, Joseph Reddington, 2008 .

Exponential Neighborhoods and Domination Analysis for the TSP

G. Gutin, A. Yeo, A. Zverovitch, 2007 .

Remarks on hamiltonian digraphs

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

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..

Orientations of digraphs almost preserving diameter

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

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

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

Complementary cycles containing prescribed vertices in tournaments

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

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.

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

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

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.

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..

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

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

Note on alternating directed cycles

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

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs

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

A New Sufficient Condition for a Digraph to Be Hamiltonian

Yubao Guo, J. Bang-Jensen, Anders Yeo, 1997, Discret. Appl. Math..

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

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

Hamiltonian paths and cycles in hypertournaments

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

One-diregular subgraphs in semicomplete multipartite digraphs

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

On k-strong and k-cyclic digraphs

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

Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph

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

Kings in semicomplete multipartite digraphs

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

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

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

Transformations of generalized ATSP into ATSP

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

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

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

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..

A maximum degree theorem for diameter-2-critical graphs

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

Total Domination in Graphs with Diameter 2

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

Perfect Matchings in Total Domination Critical Graphs

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

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 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 and Graph Products