| The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems | 0 | 0.34 | 2022 |
| An approximation algorithm for the maximum spectral subgraph problem | 0 | 0.34 | 2022 |
| An approximation algorithm for a general class of parametric optimization problems | 1 | 0.35 | 2022 |
| One-Exact Approximate Pareto Sets | 0 | 0.34 | 2021 |
| Degree-Anonymization Using Edge Rotations | 0 | 0.34 | 2021 |
| Monte Carlo Search Algorithms for Network Traffic Engineering | 0 | 0.34 | 2021 |
| Graphs without a partition into two proportionally dense subgraphs | 0 | 0.34 | 2020 |
| Domination chain: Characterisation, classical complexity, parameterised complexity and approximability | 0 | 0.34 | 2020 |
| How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. | 0 | 0.34 | 2020 |
| An FPTAS for a General Class of Parametric Optimization Problems. | 0 | 0.34 | 2019 |
| Finding a potential community in networks | 0 | 0.34 | 2019 |
| Parameterized and approximation complexity of Partial VC Dimension | 0 | 0.34 | 2019 |
| Proportionally dense subgraph of maximum size: complexity and approximation. | 0 | 0.34 | 2019 |
| Aspects of upper defensive alliances | 0 | 0.34 | 2019 |
| Proportionally dense subgraph of maximum size: Complexity and approximation. | 0 | 0.34 | 2019 |
| A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. | 1 | 0.39 | 2019 |
| Graphs without 2-community structures. | 0 | 0.34 | 2018 |
| Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. | 0 | 0.34 | 2018 |
| The many facets of upper domination. | 0 | 0.34 | 2018 |
| Structural and Algorithmic Properties of 2-Community Structures. | 2 | 0.42 | 2018 |
| Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. | 1 | 0.35 | 2017 |
| On the Complexity of Finding a Potential Community. | 0 | 0.34 | 2017 |
| Building Clusters with Lower-Bounded Sizes. | 0 | 0.34 | 2016 |
| On the Approximability of Partial VC Dimension. | 2 | 0.36 | 2016 |
| Upper Domination: Complexity And Approximation | 3 | 0.40 | 2016 |
| On the Complexity Landscape of the Domination Chain. | 0 | 0.34 | 2016 |
| Finding large degree-anonymous subgraphs is hard. | 2 | 0.37 | 2016 |
| Algorithmic Aspects of Upper Domination: A Parameterised Perspective. | 2 | 0.36 | 2016 |
| Approximate Pareto sets of minimal size for multi-objective optimization problems | 7 | 0.48 | 2015 |
| New Insight into 2-Community Structures in Graphs with Applications in Social Networks. | 0 | 0.34 | 2015 |
| Blockers for the Stability Number and the Chromatic Number | 6 | 0.50 | 2015 |
| On the Complexity of QoS-Aware Service Selection Problem. | 0 | 0.34 | 2015 |
| A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths | 6 | 0.54 | 2015 |
| Algorithmic Aspects of Upper Domination | 0 | 0.34 | 2015 |
| Complexity and approximation for Traveling Salesman Problems with profits. | 2 | 0.36 | 2014 |
| Parameterized Inapproximability Of Target Set Selection And Generalizations | 4 | 0.47 | 2014 |
| Parameterized complexity of firefighting. | 3 | 0.41 | 2014 |
| The complexity of finding harmless individuals in social networks. | 1 | 0.35 | 2014 |
| Approximation Algorithms Inspired by Kernelization Methods. | 1 | 0.35 | 2014 |
| Parameterized Inapproximability Of Degree Anonymization | 2 | 0.38 | 2014 |
| Critical edges for the assignment problem: Complexity and exact resolution. | 1 | 0.35 | 2013 |
| Complexity of determining the most vital elements for the p-median and p-center location problems | 7 | 0.49 | 2013 |
| On the number of non-dominated points of a multicriteria optimization problem | 0 | 0.34 | 2013 |
| Single approximation for the biobjective Max TSP | 0 | 0.34 | 2013 |
| Critical edges/nodes for the minimum spanning tree problem: complexity and approximation | 8 | 0.48 | 2013 |
| Approximation with a fixed number of solutions of some multiobjective maximization problems | 2 | 0.37 | 2013 |
| Parameterized approximability of maximizing the spread of influence in networks | 19 | 0.68 | 2013 |
| The robust set problem: parameterized complexity and approximation | 3 | 0.37 | 2012 |
| Efficient determination of the k most vital edges for the minimum spanning tree problem | 6 | 0.44 | 2012 |
| Single approximation for biobjective max TSP | 0 | 0.34 | 2011 |
