28 results on '"Mertzios, George B."'
Search Results
2. Determining majority in networks with local interactions and very small local memory
3. Intersection Graphs of L-Shapes and Segments in the Plane
4. Minimum Bisection Is NP-hard on Unit Disk Graphs
5. Determining Majority in Networks with Local Interactions and Very Small Local Memory
6. The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
7. On the Recognition of Four-Directional Orthogonal Ray Graphs
8. Strong Bounds for Evolution in Networks
9. Temporal Network Optimization Subject to Connectivity Constraints
10. Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
11. Parameterized Domination in Circle Graphs
12. Online Regenerator Placement
13. Natural Models for Evolution on Networks
14. On the Intersection of Tolerance and Cocomparability Graphs
15. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
16. A New Intersection Model and Improved Algorithms for Tolerance Graphs
17. The Longest Path Problem Is Polynomial on Interval Graphs
18. Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
19. Determining Majority in Networks with Local Interactions and Very Small Local Memory
20. Minimum Bisection Is NP-hard on Unit Disk Graphs
21. Intersection Graphs of L-Shapes and Segments in the Plane
22. Strong Bounds for Evolution in Networks
23. Temporal Network Optimization Subject to Connectivity Constraints
24. On the Recognition of Four-Directional Orthogonal Ray Graphs
25. Parameterized Domination in Circle Graphs
26. A New Intersection Model and Improved Algorithms for Tolerance Graphs
27. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
28. The Longest Path Problem Is Polynomial on Interval 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.