Follow
Janka Chlebikova
Janka Chlebikova
Senior Lecturer, University of Portsmouth
Verified email at port.ac.uk
Title
Cited by
Cited by
Year
Approximation hardness of dominating set problems in bounded degree graphs
M Chlebík, J Chlebíková
Information and Computation 206 (11), 1264-1275, 2008
1902008
The Steiner tree problem on graphs: Inapproximability results
M Chlebík, J Chlebíková
Theoretical Computer Science 406 (3), 207-214, 2008
1772008
Complexity of approximating bounded variants of optimization problems
M Chlebík, J Chlebíková
Theoretical Computer Science 354 (3), 320-338, 2006
1372006
Approximating the maximally balanced connected partition problem in graphs
J Chlebíková
Information Processing Letters 60 (5), 225-230, 1996
1171996
Crown reductions for the minimum weighted vertex cover problem
M Chlebík, J Chlebíková
Discrete Applied Mathematics 156 (3), 292-312, 2008
1062008
Approximation hardness of the Steiner tree problem on graphs
M Chlebík, J Chlebíková
Scandinavian Workshop on Algorithm Theory, 170-179, 2002
1052002
Approximation hardness of edge dominating set problems
M Chlebík, J Chlebíková
Journal of Combinatorial Optimization 11 (3), 279-290, 2006
602006
Approximation hardness for small occurrence instances of NP-hard problems
M Chlebík, J Chlebíková
Italian Conference on Algorithms and Complexity, 152-164, 2003
562003
Approximation hardness of dominating set problems
M Chlebík, J Chlebíková
Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004
522004
Inapproximability results for bounded variants of optimization problems
M Chlebík, J Chlebíková
International Symposium on Fundamentals of Computation Theory, 27-38, 2003
522003
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
M Chlebík, J Chlebíková
SIAM Journal on Discrete Mathematics 21 (1), 158-169, 2007
362007
Inapproximability results for orthogonal rectangle packing problems with rotations
M Chlebík, J Chlebíková
Italian Conference on Algorithms and Complexity, 199-210, 2006
252006
Hard coloring problems in low degree planar bipartite graphs
M Chlebík, J Chlebíková
Discrete Applied Mathematics 154 (14), 1960-1965, 2006
242006
Hardness of approximation for orthogonal rectangle packing and covering problems
M Chlebík, J Chlebíková
Journal of Discrete Algorithms 7 (3), 291-305, 2009
232009
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
M Chlebík, J Chlebíková
SODA'05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005
202005
Approximation hardness of minimum edge dominating set and minimum maximal matching
M Chlebík, J Chlebíková
International Symposium on Algorithms and Computation, 415-424, 2003
192003
On approximation hardness of the minimum 2SAT-DELETION problem
M Chlebík, J Chlebíková
International Symposium on Mathematical Foundations of Computer Science, 263-273, 2004
162004
The firefighter problem: Further steps in understanding its complexity
J Chlebíková, M Chopin
Theoretical Computer Science 676, 42-51, 2017
142017
The structure of obstructions to treewidth and pathwidth
J Chlebıková
Discrete Applied Mathematics 120 (1-3), 61-71, 2002
142002
Improvement of Nemhauser-Trotter Theorem and its applications in parametrized complexity
M Chlebík, J Chlebíková
Scandinavian Workshop on Algorithm Theory, 174-186, 2004
132004
The system can't perform the operation now. Try again later.
Articles 1–20