The following pages link to George B. Mertzios (Q261371):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Window-games between TCP flows (Q982652) (← links)
- Kernelization lower bounds for finding constant-size subgraphs (Q1670739) (← links)
- Strong bounds for evolution in networks (Q1672000) (← links)
- Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Natural models for evolution on networks (Q1945945) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy (Q2249739) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Online regenerator placement (Q2408557) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs (Q2820855) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
- The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial (Q2849360) (← links)
- On the Recognition of Four-Directional Orthogonal Ray Graphs (Q2849926) (← links)
- Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613) (← links)
- Intersection Graphs of L-Shapes and Segments in the Plane (Q2922617) (← links)
- Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs. (Q2955008) (← links)
- A New Intersection Model and Improved Algorithms for Tolerance Graphs (Q3058531) (← links)
- On the Intersection of Tolerance and Cocomparability Graphs (Q3060736) (← links)
- (Q3104272) (← links)
- The recognition of triangle graphs. (Q3113722) (← links)
- The recognition of tolerance and bounded tolerance graphs. (Q3113782) (← links)
- The Recognition of Tolerance and Bounded Tolerance Graphs (Q3115865) (← links)
