The following pages link to Nikolaos Melissinos (Q1791023):
Displaying 17 items.
- A faster FPTAS for the subset-sums ratio problem (Q1791024) (← links)
- On the complexity of the upper \(r\)-tolerant edge cover problem (Q1997258) (← links)
- Approximation schemes for subset sum ratio problems (Q2037971) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- Extension and its price for the Connected Vertex Cover problem (Q2301752) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} (Q6145803) (← links)
- (Q6147538) (← links)
- Filling crosswords is very hard (Q6199399) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)
- Complexity of finding maximum locally irregular induced subgraphs (Q6544081) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
- Parameterized max min feedback vertex set (Q6647695) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)
