Anders Yeo

Researcher Next ID · RN-043272

Researcher · Computer Science

Odense, South Africa

Accepting doctoral researchersFunding unknown

Research interests

Computer Science

Engineering

Mathematics

Advanced Graph Theory Research

Complexity and Algorithms in Graphs

Limits and Structures in Graph Theory

Graph Labeling and Dimension Problems

graph theory and CDMA systems

Total Domination in Graphs
Springer monographs in mathematics · 2013 · https://doi.org/10.1007/978-1-4614-6525-6
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science · 2011 · https://doi.org/10.1016/j.tcs.2011.04.039
Solving MAX-r-SAT Above a Tight Lower Bound
Algorithmica · 2010 · https://doi.org/10.1007/s00453-010-9428-7
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences · 2010 · https://doi.org/10.1016/j.jcss.2010.06.001
Kernel Bounds for Disjoint Cycles and Disjoint Paths
Lecture notes in computer science · 2009 · https://doi.org/10.1007/978-3-642-04128-0_57
Total domination of graphs and small transversals of hypergraphs
COMBINATORICA · 2007 · https://doi.org/10.1007/s00493-007-2020-3
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics Probability Computing · 2006 · https://doi.org/10.1017/s0963548306007887
When the greedy algorithm fails
Discrete Optimization · 2004 · https://doi.org/10.1016/j.disopt.2004.03.007
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
Discrete Applied Mathematics · 2002 · https://doi.org/10.1016/s0166-218x(01)00195-0
Construction heuristics for the asymmetric TSP
European Journal of Operational Research · 2001 · https://doi.org/10.1016/s0377-2217(99)00468-3

No projects listed.