The following pages link to Cristina Bazgan (Q237413):
Displaying 50 items.
- (Q198758) (redirect page) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- On the vertex-distinguishing proper edge-colorings of graphs (Q1305536) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- On the differential approximation of MIN SET COVER (Q1770405) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- A note on the approximability of the toughness of graphs (Q1827680) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- Single approximation for the biobjective Max TSP (Q1951558) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- An FPTAS for a general class of parametric optimization problems (Q2300026) (← links)
- Relaxation and matrix randomized rounding for the maximum spectral subgraph problem (Q2327107) (← links)
- Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
