98 results on '"Janka Chlebíková"'
Search Results
2. Safe Edges: A Study of Triangulation in Fill-in and Tree-Width Problems.
3. How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations.
4. Colourful components in k-caterpillars and planar graphs.
5. Degree-anonymization using edge rotations.
6. Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems.
7. Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.
8. Approximation Hardness of Travelling Salesman via Weighted Amplifiers.
9. Complexity of Scheduling for DARP with Soft Ride Times.
10. Proportionally dense subgraph of maximum size: Complexity and approximation.
11. Structural and Algorithmic Properties of 2-Community Structures.
12. Graphs without a partition into two proportionally dense subgraphs.
13. The firefighter problem: Further steps in understanding its complexity.
14. New Insight into 2-Community Structures in Graphs with Applications in Social Networks.
15. Proportionally dense subgraph of maximum size: complexity and approximation.
16. The Firefighter Problem: A Structural Analysis.
17. On the Conjunctive Capacity of Graphs.
18. Graphs without a partition into two proportionally dense subgraphs.
19. Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.
20. Assign Ranges in General Ad-Hoc Networks.
21. Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes.
22. Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.
23. On Approximability of the Independent Set Problem for Low Degree Graphs.
24. Approximation Hardness of Dominating Set Problems.
25. On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
26. Connection between conjunctive capacity and structural properties of graphs.
27. Inapproximability Results for Bounded Variants of Optimization Problems.
28. Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.
29. Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.
30. Approximation Hardness of the Steiner Tree Problem on Graphs.
31. Hardness of approximation for orthogonal rectangle packing and covering problems.
32. Crown reductions for the Minimum Weighted Vertex Cover problem.
33. Approximation hardness of dominating set problems in bounded degree graphs.
34. The Steiner tree problem on graphs: Inapproximability results.
35. The d-precoloring problem for k-degenerate graphs.
36. Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.
37. A characterization of some graph classes using excluded minors.
38. The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes.
39. Assign ranges in general ad-hoc networks.
40. Hard coloring problems in low degree planar bipartite graphs.
41. Approximation hardness of edge dominating set problems.
42. Complexity of approximating bounded variants of optimization problems.
43. Partial k-trees with maximum chromatic number.
44. The structure of obstructions to treewidth and pathwidth.
45. The structure of obstructions to treewidth and pathwidth.
46. Approximating the Maximally Balanced Connected Partition Problem in Graphs.
47. The Firefighter Problem: A Structural Analysis.
48. Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
49. Crown reductions for the Minimum Weighted Vertex Cover problem
50. Inapproximability results for bounded variants of optimization problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.