209 results on '"Kratochvíl Jan"'
Search Results
2. The Parametrized Complexity of the Segment Number
3. Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult
4. Preface: Czech-Slovak Graph Theory in honor of Robin Thomas
5. List Covering of Regular Multigraphs
6. Direct Resonant Diode Pumping of Tm-fiber Laser
7. Computational Complexity of Covering Disconnected Multigraphs
8. Efficient 1.7 µm pumping of 2 µm thulium lasers
9. Drawing Simultaneously Embedded Graphs with Few Bends
10. Tm, Ho:GGAG 2.1 µm laser diode-pumped at 1.7 µm
11. Důvody pro zdrženlivý přezkum Ústavním soudem
12. Bounded Stub Resolution for Some Maximal 1-Planar Graphs
13. On Vertex- and Empty-Ply Proximity Drawings
14. Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria
15. 2 µm microchip laser based on Tm:YAG composite under 0.8 µm and 1.7 µm pumping
16. Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
17. On the Hardness of Switching to a Small Number of Edges
18. Simultaneous Orthogonal Planarity
19. Ho:GGAG Disordered Garnet Crystal for Tunable 2.1 µm Laser
20. Ho:YAG and Ho:YAP Microchip Lasers Operating at 2.1 µm
21. 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus
22. Cops and Robbers on String Graphs
23. $${\mathcal {U}}$$-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
24. Extending Partial Representations of Proper and Unit Interval Graphs
25. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
26. Computational Complexity of Covering Three-Vertex Multigraphs
27. Formation of deformation substructures observed in ductile materials
28. Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
29. Drawing Simultaneously Embedded Graphs with Few Bends
30. Planar Embeddings with Small and Uniform Faces
31. Tm:YAP microchip laser under 1700 nm and 790 nm diode pumping
32. Improving method for deterministic treatment of double cross-slip in FCC metals under low homologous temperatures
33. Non-crossing Connectors in the Plane
34. Cops and Robbers on Intersection Graphs
35. MSOL Restricted Contractibility to Planar Graphs
36. Beyond Homothetic Polygons: Recognition and Maximum Clique
37. Extending Partial Representations of Function Graphs and Permutation Graphs
38. Extending Partial Representations of Subclasses of Chordal Graphs
39. Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
40. Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
41. Determining the L(2,1)-Span in Polynomial Space
42. Fast Exact Algorithm for L(2,1)-Labeling of Graphs
43. On the Computational Complexity of Degenerate Unit Distance Representations of Graphs
44. Extending Partial Representations of Interval Graphs
45. Faithful Representations of Graphs by Islands in the Extended Grid
46. Discrete Dislocation Dynamics and Mean Curvature Flow
47. The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
48. Parameterized Complexity of Generalized Domination Problems
49. Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
50. Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.