NEWS
Institutional Subscription: Comprehensive Analyses to Enhance Your Global and Local Impact
New Feature: Compare Your Institution with the Previous Year
Find a Professional: Explore Experts Across 197 Disciplines in 221 Countries!
Find a Professional
Print Your Certificate
New! Young University / Institution Rankings 2025
New! Art & Humanities Rankings 2025
New! Social Sciences and Humanities Rankings 2025
Highly Cited Researchers 2025
AD
Scientific Index 2025
Scientist Rankings
University Rankings
Subject Rankings
Country Rankings
Login
Register & Pricing
insights
H-Index Rankings
insights
i10 Productivity Rankings
format_list_numbered
Citation Rankings
subject
University Subject Rankings
school
Young Universities
format_list_numbered
Top 100 Scientists
format_quote
Top 100 Institutions
format_quote
Compare & Choose
local_fire_department
Country Reports
person
Find a Professional
Anders Yeo
University of Southern Denmark - Tianjin / Denmark
Others
AD Scientific Index ID: 1557170
Syddansk Universitet
Registration, Add Profile,
Premium Membership
Print Your Certificate
Ranking &
Analysis
Job
Experiences (0)
Education
Information (0)
Published Books (0)
Book Chapters (0)
Articles (0)
Presentations (0)
Lessons (0)
Projects (0)
Subject Leaders
Editorship, Referee &
Scientific Board (0 )
Patents /
Designs (0)
Academic Grants
& Awards (0)
Artistic
Activities (0)
Certificate / Course
/ Trainings (0)
Association &
Society Memberships (0)
Contact, Office
& Social Media
person_outline
Anders Yeo's MOST POPULAR ARTICLES
1-)
Total domination in graphsMA Henning, A YeoSpringer, 20136612013
2-)
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSPG Gutin, A Yeo, A ZverovichDiscrete Applied Mathematics 117 (1-3), 81-86, 20023732002
3-)
Kernel bounds for disjoint cycles and disjoint pathsHL Bodlaender, S Thomassé, A YeoTheoretical Computer Science 412 (35), 4570-4578, 20112012011
4-)
When the greedy algorithm failsJ Bang-Jensen, G Gutin, A YeoDiscrete optimization 1 (2), 121-127, 20042312004
5-)
The minimum feedback arc set problem is NP-hard for tournamentsP Charbit, S Thomassé, A YeoCombinatorics, Probability and Computing 16 (1), 1-4, 20072012007
ARTICLES
Add your articles
We use cookies to personalize our website and offer you a better experience. If you accept cookies, we can offer you special services.
Cookie Policy
Accept