The following pages link to Vangelis Th. Paschos (Q218830):
Displaying 50 items.
- (Q3059318) (← links)
- (Q3059319) (← links)
- (Q3059326) (← links)
- (Q3059328) (← links)
- (Q3061962) (← links)
- (Q3070857) (← links)
- (Q3070863) (← links)
- (Q3081832) (← links)
- Online Maximum k-Coverage (Q3088282) (← links)
- (Q3109949) (← links)
- (Q3109950) (← links)
- (Q3142706) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- On the max min vertex cover Problem (Q3188864) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
- Probabilistic Combinatorial Optimization on Graphs (Q3426051) (← links)
- Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2 (Q3439517) (← links)
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578) (← links)
- Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (Q3569091) (← links)
- Fast Algorithms for min independent dominating set (Q3569130) (← links)
- The max quasi-independent set Problem (Q3569731) (← links)
- A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879) (← links)
- (Q3579308) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Steiner Forests on Stochastic Metric Graphs (Q3611962) (← links)
- Approximating the Max Edge-Coloring Problem (Q3651536) (← links)
- Exact Algorithms for Dominating Clique Problems (Q3652186) (← links)
- An overview on polynomial approximation of NP-hard problems (Q3655024) (← links)
- (Q4246715) (← links)
- The probabilistic longest path problem (Q4254356) (← links)
- (Q4258251) (← links)
- (Q4258252) (← links)
- (Q4289901) (← links)
- (Q4291269) (← links)
- (Q4359293) (← links)
- (Q4414489) (← links)
- (Q4414490) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- (Q4471994) (← links)
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems (Q4497873) (← links)
- The Probabilistic Minimum Vertex-covering Problem (Q4532541) (← links)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Time-approximation trade-offs for inapproximable problems (Q4601874) (← links)
- Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse (Q4601889) (← links)
- Proving completeness by logic (Q4653719) (← links)
- On-line maximum-order induced hereditary subgraph problems (Q4670672) (← links)
- Computing and Combinatorics (Q4681188) (← links)
- (Q4781816) (← links)
- (Q4782716) (← links)
