NEWS
Free Institutional Consultancy Services
New Feature: Compare Your Institution with the Previous Year
Find a Professional: Explore Experts Across 197 Disciplines in 220 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
Login
person_add
Register
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
Miroslav Chlebik
University of Sussex - Brighton / United Kingdom
Natural Sciences / Mathematical Sciences
AD Scientific Index ID: 1041664
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
Miroslav Chlebik's MOST POPULAR ARTICLES
1-)
Approximation hardness of dominating set problems in bounded degree graphsM Chlebík, J ChlebíkováInformation and Computation 206 (11), 1264-1275, 20081722008
2-)
The Steiner tree problem on graphs: Inapproximability resultsM Chlebík, J ChlebíkováTheoretical Computer Science 406 (3), 207-214, 20081552008
3-)
Complexity of approximating bounded variants of optimization problemsM Chlebík, J ChlebíkováTheoretical Computer Science 354 (3), 320-338, 20061242006
4-)
Crown reductions for the minimum weighted vertex cover problemM Chlebík, J ChlebíkováDiscrete Applied Mathematics 156 (3), 292-312, 20081112008
5-)
Approximation hardness of the Steiner tree problem on graphsM Chlebík, J ChlebíkováScandinavian Workshop on Algorithm Theory, 170-179, 20021062002
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