The following pages link to Cristina Bazgan (Q237413):
Displayed 50 items.
- On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- How to get a degree-anonymous graph using minimum number of edge rotations (Q2692217) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Single Approximation for Biobjective Max TSP (Q2896377) (← links)
- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (Q2896393) (← links)
- The Robust Set Problem: Parameterized Complexity and Approximation (Q2912715) (← links)
- Approximation Algorithms Inspired by Kernelization Methods (Q2942653) (← links)
- Parameterized Inapproximability of Degree Anonymization (Q2946009) (← links)
- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Approximability of Dense Instances of Nearest Codeword Problem (Q3046504) (← links)
- (Q3059308) (← links)
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems (Q3066160) (← links)
- Parameterized Complexity of the Firefighter Problem (Q3104666) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- New Insight into 2-Community Structures in Graphs with Applications in Social Networks (Q3467849) (← links)
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem (Q3527261) (← links)
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305) (← links)
- Covering a Graph with a Constrained Forest (Extended Abstract) (Q3652276) (← links)
- (Q4219034) (← links)
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs (Q4240135) (← links)
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← links)
- (Q4437515) (← links)
- On the Loebl-Koml�s-S�s conjecture (Q4506067) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- (Q4636485) (← links)
- Parameterized Approximability of Maximizing the Spread of Influence in Networks (Q4925269) (← links)
- (Q4934320) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175620) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175873) (← links)
- Algorithms and Computation (Q5191672) (← links)
- Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (Q5199145) (← links)
- On the Complexity of Finding a Potential Community (Q5283357) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431303) (← links)
- An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem (Q5432328) (← links)
- Algorithms – ESA 2005 (Q5475893) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711562) (← links)
- Algorithms and Computation (Q5712104) (← links)
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES (Q5714673) (← links)
- Computing and Combinatorics (Q5717006) (← links)
- Algorithms and Computation (Q5897895) (← links)
- Algorithms and Computation (Q5897911) (← links)
- Partitioning vertices of 1-tough graphs into paths (Q5941518) (← links)
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degree (Q5959088) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)