The following pages link to Vangelis Th. Paschos (Q218830):
Displaying 50 items.
- Sparsification and subexponential approximation (Q1702300) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- The antennas preassignment problem (Q1766595) (← links)
- On-line vertex-covering (Q1770381) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Parameterized (in)approximability of subset problems (Q1785218) (← links)
- Approximation algorithms for the traveling salesman problem (Q1812290) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← links)
- Fast algorithms for min independent dominating set (Q1941381) (← links)
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability (Q1941538) (← links)
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing (Q1961735) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- In memory of Jérôme Monnot (Q2140557) (← links)
- Improved (In-)approximability bounds for \(d\)-scattered set (Q2193093) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Improved approximations for weighted and unweighted graph problems (Q2581009) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs (Q2802943) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
- Probabilistic optimization in graph-problems (Q2865853) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- Greedy algorithms for on-line set-covering (Q2867360) (← links)
- Simple and fast reoptimizations for the Steiner tree problem (Q2867366) (← links)
- Approximating the metric 2-peripatetic salesman problem (Q2867374) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion (Q2889902) (← links)
- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems (Q2894455) (← links)
- Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms (Q2898031) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Efficient Algorithms for the max k -vertex cover Problem (Q2915177) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
