| Publication | Date of Publication | Type |
|---|
| A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem | 2025-01-15 | Paper |
| Approximating multiobjective optimization problems: how exact can you be? | 2024-10-09 | Paper |
| Dense graph partitioning on sparse and dense graphs | 2024-05-27 | Paper |
| How to get a degree-anonymous graph using minimum number of edge rotations | 2023-03-21 | Paper |
| An approximation algorithm for the maximum spectral subgraph problem | 2022-10-04 | Paper |
| An approximation algorithm for a general class of parametric optimization problems | 2022-07-18 | Paper |
| The power of the weighted sum scalarization for approximating multiobjective optimization problems | 2022-02-14 | Paper |
| One-exact approximate Pareto sets | 2021-07-07 | Paper |
| Degree-anonymization using edge rotations | 2021-06-22 | Paper |
| Aspects of upper defensive alliances | 2021-05-19 | Paper |
| Parameterized Dynamic Variants of Red-Blue Dominating Set | 2020-07-20 | Paper |
| Domination chain: characterisation, classical complexity, parameterised complexity and approximability | 2020-05-18 | Paper |
| An FPTAS for a general class of parametric optimization problems | 2020-02-24 | Paper |
| Graphs without a partition into two proportionally dense subgraphs | 2019-12-19 | Paper |
| Proportionally dense subgraph of maximum size: complexity and approximation | 2019-11-06 | Paper |
| Relaxation and matrix randomized rounding for the maximum spectral subgraph problem | 2019-10-11 | Paper |
| Finding a potential community in networks | 2019-04-23 | Paper |
| Parameterized and approximation complexity of \textsc{Partial VC Dimension} | 2019-03-14 | Paper |
| A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths | 2019-03-06 | Paper |
| Approximate Pareto sets of minimal size for multi-objective optimization problems | 2018-09-28 | Paper |
| Clustering with lower-bounded sizes. A general graph-theoretic framework | 2018-07-26 | Paper |
| Structural and algorithmic properties of 2-community structures | 2018-06-01 | Paper |
| Discrete representation of the non-dominated set for multi-objective optimization problems using kernels | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636485 | 2018-04-19 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| On the Complexity of Finding a Potential Community | 2017-07-21 | Paper |
| Parameterized and approximation complexity of \textsc{Partial VC Dimension} | 2017-02-01 | Paper |
| Algorithmic Aspects of Upper Domination: A Parameterised Perspective | 2016-11-09 | Paper |
| Upper Domination: Complexity and Approximation | 2016-09-29 | Paper |
| On the Complexity Landscape of the Domination Chain | 2016-03-23 | Paper |
| Finding large degree-anonymous subgraphs is hard | 2016-02-26 | Paper |
| New Insight into 2-Community Structures in Graphs with Applications in Social Networks | 2016-02-05 | Paper |
| Data reductions and combinatorial bounds for improved approximation algorithms | 2015-12-30 | Paper |
| A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths | 2015-09-21 | Paper |
| Parameterized Inapproximability of Degree Anonymization | 2015-09-15 | Paper |
| Approximation Algorithms Inspired by Kernelization Methods | 2015-09-11 | Paper |
| The complexity of finding harmless individuals in social networks | 2015-04-09 | Paper |
| Parameterized Inapproximability of Target Set Selection and Generalizations | 2015-02-25 | Paper |
| Parameterized Inapproximability of Target Set Selection and Generalizations | 2015-02-24 | Paper |
| Blockers for the stability number and the chromatic number | 2015-01-20 | Paper |
| Approximation with a fixed number of solutions of some multiobjective maximization problems | 2014-08-13 | Paper |
| Parameterized approximability of maximizing the spread of influence in networks | 2014-07-07 | Paper |
| Parameterized complexity of firefighting | 2014-06-10 | Paper |
| Critical edges for the assignment problem: complexity and exact resolution | 2014-05-15 | Paper |
| On the number of non-dominated points of a multicriteria optimization problem | 2014-04-23 | Paper |
| Critical edges/nodes for the minimum spanning tree problem: complexity and approximation | 2013-08-09 | Paper |
| Parameterized Approximability of Maximizing the Spread of Influence in Networks | 2013-06-11 | Paper |
| Single approximation for the biobjective Max TSP | 2013-06-06 | Paper |
| The firefighter problem with more than one firefighter on trees | 2013-04-25 | Paper |
| Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems | 2013-03-25 | Paper |
| Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem | 2012-11-15 | Paper |
| The Robust Set Problem: Parameterized Complexity and Approximation | 2012-09-25 | Paper |
| Single Approximation for Biobjective Max TSP | 2012-07-16 | Paper |
| Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems | 2012-07-16 | Paper |
| General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems | 2012-06-20 | Paper |
| The most vital nodes with respect to independent set and vertex cover | 2012-04-30 | Paper |
| Parameterized Complexity of the Firefighter Problem | 2011-12-16 | Paper |
| Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem | 2011-08-12 | Paper |
| Complexity and approximation of the constrained forest problem | 2011-07-27 | Paper |
| Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures | 2011-05-19 | Paper |
| Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems | 2011-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059308 | 2010-12-08 | Paper |
| Satisfactory graph partition, variants, and generalizations | 2010-06-11 | Paper |
| Covering a Graph with a Constrained Forest (Extended Abstract) | 2009-12-17 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Implementing an efficient fptas for the 0-1 multi-objective knapsack problem | 2009-06-30 | Paper |
| Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 | 2009-05-13 | Paper |
| Min-max and min-max regret versions of combinatorial optimization problems: A survey | 2009-04-30 | Paper |
| Solving efficiently the 0-1 multi-objective knapsack problem | 2008-10-08 | Paper |
| A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem | 2008-09-25 | Paper |
| Approximation of satisfactory bisection problems | 2008-06-26 | Paper |
| Complexity of the min-max (regret) versions of min cut problems | 2008-05-16 | Paper |
| An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem | 2008-01-02 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Approximating Min-Max (Regret) Versions of Some Polynomial Problems | 2007-09-10 | Paper |
| Efficient algorithms for decomposing graphs under degree constraints | 2007-05-30 | Paper |
| Approximation of min-max and min-max regret versions of some combinatorial optimization problems | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| The satisfactory partition problem | 2006-06-30 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Degree-constrained decompositions of graphs: Bounded treewidth and planarity | 2006-04-28 | Paper |
| Complexity of the min-max and min-max regret assignment problems | 2006-02-02 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES | 2005-12-15 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness | 2005-06-30 | Paper |
| On the differential approximation of MIN SET COVER | 2005-04-06 | Paper |
| Approximation algorithms for some vehicle routing problems | 2005-02-23 | Paper |
| Approximability of Dense Instances of Nearest Codeword Problem | 2004-08-12 | Paper |
| A note on the approximability of the toughness of graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437515 | 2003-12-02 | Paper |
| Polynomial time approximation schemes for dense instances of minimum constraint satisfaction | 2003-08-06 | Paper |
| Differential approximation for optimal satisfiability and related problems | 2003-04-28 | Paper |
| Efficient approximation algorithms for the subset-sums equality problem. | 2002-08-04 | Paper |
| A note on the vertex-distinguishing proper coloring of graphs with large minimum degree | 2002-03-20 | Paper |
| Partitioning vertices of 1-tough graphs into paths | 2001-08-20 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture] | 2001-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934320 | 2000-01-17 | Paper |
| On the vertex-distinguishing proper edge-colorings of graphs | 1999-11-29 | Paper |
| On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs | 1999-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219034 | 1998-11-15 | Paper |
