| Publication | Date of Publication | Type |
|---|
| Destroying densest subgraphs is hard | 2025-12-02 | Paper |
| On the computational complexity of graph reconstruction | 2025-11-11 | Paper |
A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem
Networks | 2025-01-15 | Paper |
Approximating multiobjective optimization problems: how exact can you be?
Mathematical Methods of Operations Research | 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
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
An approximation algorithm for a general class of parametric optimization problems
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
The power of the weighted sum scalarization for approximating multiobjective optimization problems
Theory of Computing Systems | 2022-02-14 | Paper |
One-exact approximate Pareto sets
Journal of Global Optimization | 2021-07-07 | Paper |
Degree-anonymization using edge rotations
Theoretical Computer Science | 2021-06-22 | Paper |
Aspects of upper defensive alliances
Discrete Applied Mathematics | 2021-05-19 | Paper |
Parameterized dynamic variants of red-blue dominating set
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Domination chain: characterisation, classical complexity, parameterised complexity and approximability
Discrete Applied Mathematics | 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
Information Processing Letters | 2019-12-19 | Paper |
Proportionally dense subgraph of maximum size: complexity and approximation
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2019-04-23 | Paper |
Parameterized and approximation complexity of \textsc{Partial VC Dimension}
Theoretical Computer Science | 2019-03-14 | Paper |
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
Networks | 2019-03-06 | Paper |
Approximate Pareto sets of minimal size for multi-objective optimization problems
Operations Research Letters | 2018-09-28 | Paper |
Clustering with lower-bounded sizes. A general graph-theoretic framework
Algorithmica | 2018-07-26 | Paper |
Structural and algorithmic properties of 2-community structures
Algorithmica | 2018-06-01 | Paper |
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
European Journal of Operational Research | 2018-05-29 | Paper |
| scientific article; zbMATH DE number 6861937 (Why is no real title available?) | 2018-04-19 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
On the complexity of finding a potential community
Lecture Notes in Computer Science | 2017-07-21 | Paper |
On the approximability of partial VC dimension
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
On the complexity landscape of the domination chain
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Finding large degree-anonymous subgraphs is hard
Theoretical Computer Science | 2016-02-26 | Paper |
New insight into 2-community structures in graphs with applications in social networks
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Data reductions and combinatorial bounds for improved approximation algorithms
Journal of Computer and System Sciences | 2015-12-30 | Paper |
A refined complexity analysis of finding the most vital edges for undirected shortest paths
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Parameterized inapproximability of degree anonymization
Parameterized and Exact Computation | 2015-09-15 | Paper |
Approximation algorithms inspired by kernelization methods
Algorithms and Computation | 2015-09-11 | Paper |
The complexity of finding harmless individuals in social networks
Discrete Optimization | 2015-04-09 | Paper |
Parameterized inapproximability of target set selection and generalizations
Language, Life, Limits | 2015-02-25 | Paper |
Parameterized inapproximability of target set selection and generalizations
Computability | 2015-02-24 | Paper |
Blockers for the stability number and the chromatic number
Graphs and Combinatorics | 2015-01-20 | Paper |
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Parameterized approximability of maximizing the spread of influence in networks
Journal of Discrete Algorithms | 2014-07-07 | Paper |
Parameterized complexity of firefighting
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Critical edges for the assignment problem: complexity and exact resolution
Operations Research Letters | 2014-05-15 | Paper |
On the number of non-dominated points of a multicriteria optimization problem
Discrete Applied Mathematics | 2014-04-23 | Paper |
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Parameterized approximability of maximizing the spread of influence in networks
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Single approximation for the biobjective Max TSP
Theoretical Computer Science | 2013-06-06 | Paper |
The firefighter problem with more than one firefighter on trees
Discrete Applied Mathematics | 2013-04-25 | Paper |
Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
Computers & Operations Research | 2012-11-15 | Paper |
The robust set problem: parameterized complexity and approximation
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Single approximation for biobjective max TSP
Approximation and Online Algorithms | 2012-07-16 | Paper |
Approximation with a fixed number of solutions of some biobjective maximization problems
Approximation and Online Algorithms | 2012-07-16 | Paper |
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
Discrete Optimization | 2012-06-20 | Paper |
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics | 2012-04-30 | Paper |
Parameterized complexity of the firefighter problem
Algorithms and Computation | 2011-12-16 | Paper |
Efficient algorithms for finding the \(k\) most vital edges for the minimum spanning tree problem
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Complexity and approximation of the constrained forest problem
Theoretical Computer Science | 2011-07-27 | Paper |
Complexity of most vital nodes for independent set in graphs related to tree structures
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
| scientific article; zbMATH DE number 5823929 (Why is no real title available?) | 2010-12-08 | Paper |
Satisfactory graph partition, variants, and generalizations
European Journal of Operational Research | 2010-06-11 | Paper |
Covering a graph with a constrained forest (extended abstract)
Algorithms and Computation | 2009-12-17 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
European Journal of Operational Research | 2009-06-30 | Paper |
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Min-max and min-max regret versions of combinatorial optimization problems: A survey
European Journal of Operational Research | 2009-04-30 | Paper |
Solving efficiently the 0-1 multi-objective knapsack problem
Computers & Operations Research | 2008-10-08 | Paper |
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximation of satisfactory bisection problems
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Complexity of the min-max (regret) versions of min cut problems
Discrete Optimization | 2008-05-16 | Paper |
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem
Experimental Algorithms | 2008-01-02 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Efficient algorithms for decomposing graphs under degree constraints
Discrete Applied Mathematics | 2007-05-30 | Paper |
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
European Journal of Operational Research | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
The satisfactory partition problem
Discrete Applied Mathematics | 2006-06-30 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
Theoretical Computer Science | 2006-04-28 | Paper |
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters | 2006-02-02 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Theoretical Computer Science | 2005-06-30 | Paper |
On the differential approximation of MIN SET COVER
Theoretical Computer Science | 2005-04-06 | Paper |
Approximation algorithms for some vehicle routing problems
Discrete Applied Mathematics | 2005-02-23 | Paper |
Approximability of Dense Instances of Nearest Codeword Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
A note on the approximability of the toughness of graphs
Discrete Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2011863 (Why is no real title available?) | 2003-12-02 | Paper |
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms | 2003-08-06 | Paper |
Differential approximation for optimal satisfiability and related problems
European Journal of Operational Research | 2003-04-28 | Paper |
Efficient approximation algorithms for the subset-sums equality problem.
Journal of Computer and System Sciences | 2002-08-04 | Paper |
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree
Discrete Mathematics | 2002-03-20 | Paper |
Partitioning vertices of 1-tough graphs into paths
Theoretical Computer Science | 2001-08-20 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture] | 2001-04-10 | Paper |
| scientific article; zbMATH DE number 1390055 (Why is no real title available?) | 2000-01-17 | Paper |
On the vertex-distinguishing proper edge-colorings of graphs
Journal of Combinatorial Theory. Series B | 1999-11-29 | Paper |
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
Journal of Algorithms | 1999-08-31 | Paper |
| scientific article; zbMATH DE number 1223719 (Why is no real title available?) | 1998-11-15 | Paper |
