17 results on '"Mertzios, George B."'
Search Results
2. Equitable scheduling on a single machine
3. The Power of Linear-Time Data Reduction for Maximum Matching
4. When Can Graph Hyperbolicity be Computed in Linear Time?
5. Binary Search in Graphs Revisited
6. Temporal Network Optimization Subject to Connectivity Constraints
7. The Complexity of Optimal Design of Temporally Connected Graphs
8. Online Regenerator Placement
9. Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity
10. Determining majority in networks with local interactions and very small local memory
11. Algorithms and Almost Tight Results for $$3$$ 3 -Colorability of Small Diameter Graphs
12. Parameterized Domination in Circle Graphs
13. An Intersection Model for Multitolerance Graphs: Efficient Algorithms and Hierarchy
14. Approximating Fixation Probabilities in the Generalized Moran Process
15. The Longest Path Problem has a Polynomial Solution on Interval Graphs
16. An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
17. Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.