The following pages link to George B. Mertzios (Q261371):
Displaying 35 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)
- Stably Computing Order Statistics with Arithmetic Population Protocols (Q4608631) (← links)
- (Q4634388) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- (Q5089192) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs (Q5092333) (← links)
- (Q5092419) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- On the fixation probability of superstars (Q5362160) (← links)
- Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (Q5363764) (← links)
- Computing maximum matchings in temporal graphs. (Q5874299) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- The Complexity of Transitively Orienting Temporal Graphs (Q6168495) (← links)
- Graphs with minimum fractional domatic number (Q6180653) (← links)
