55 results on '"Miller, Mirka"'
Search Results
2. Edge-Magic Total Labelings
3. Conclusion
4. Edge-Antimagic Total Labelings
5. Vertex-Antimagic Total Labelings
6. Vertex-Magic Total Labelings
7. Magic and Supermagic Graphs
8. Monitoring the Edges of a Graph Using Distances
9. Introduction
10. Improved Bound for Dilation of an Embedding onto Circulant Networks
11. Monitoring the Edges of a Graph Using Distances
12. Trends in Temporal Reasoning: Constraints, Graphs and Posets
13. Edge-Antimagic Total Labelings
14. Magic and Antimagic Graphs
15. Vertex-Antimagic Total Labelings
16. Edge-Magic Total Labelings
17. Conclusion
18. Introduction
19. Graceful and Antimagic Labelings
20. Vertex-Magic Total Labelings
21. Magic and Supermagic Graphs
22. Trends in Temporal Reasoning: Constraints, Graphs and Posets
23. Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
24. Computing Minimum Length Representations of Sets of Words of Uniform Length
25. On the Galois Lattice of Bipartite Distance Hereditary Graphs
26. Lossless Seeds for Searching Short Patterns with High Error Rates
27. Computing Primitively-Rooted Squares and Runs in Partial Words
28. 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
29. Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
30. Border Correlations, Lattices, and the Subgraph Component Polynomial
31. Efficiently Listing Bounded Length st-Paths
32. Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
33. A Suffix Tree Or Not a Suffix Tree?
34. Embedding Circulant Networks into Butterfly and Benes Networks
35. The Min-max Edge q-Coloring Problem
36. Study of
37. Metric Dimension for Amalgamations of Graphs
38. Deterministic Algorithms for the Independent Feedback Vertex Set Problem
39. Sequence Covering Arrays and Linear Extensions
40. Kinetic Reverse k-Nearest Neighbor Problem
41. Solving Matching Problems Efficiently in Bipartite Graphs
42. A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
43. Minimum r-Star Cover of Class-3 Orthogonal Polygons
44. Speeding up Graph Algorithms via Switching Classes
45. Profile-Based Optimal Matchings in the Student/Project Allocation Problem
46. Some Hamiltonian Properties of One-Conflict Graphs
47. On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
48. Space Efficient Data Structures for Nearest Larger Neighbor
49. Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory
50. On Maximum Common Subgraph Problems in Series-Parallel Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.