25 results on '"Kratochvíl Jan"'
Search Results
2. Parameterized complexity of distance labeling and uniform channel assignment problems
3. Homothetic polygons and beyond: Maximal cliques in intersection graphs
4. Locally injective [formula omitted]-colourings of planar graphs
5. Determining the [formula omitted]-span in polynomial space
6. Parameterized complexity of generalized domination problems
7. Distance three labelings of trees
8. Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
9. On the computational complexity of partial covers of Theta graphs
10. Coloring mixed hypertrees
11. Systems of distant representatives
12. Computing the branchwidth of interval graphs
13. Fixed-parameter complexity of λ-labelings
14. Independent sets with domination constraints
15. Guest editors’ foreword
16. Determining the L(2,1)-span in polynomial space
17. Guest editors’ foreword
18. Guest Editors’ Foreword
19. Guest editors’ foreword
20. Transversal partitioning in balanced hypergraphs
21. A special planar satisfiability problem and a consequence of its NP-completeness
22. Algorithmic complexity of list colorings
23. Editorial
24. Structural decompositions, width parameters, and graph labelings
25. Compatible 2-factors
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.