| Publication | Date of Publication | Type |
|---|
| Extension of some edge graph problems: standard, parameterized and approximation complexity | 2023-09-14 | Paper |
| The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * | 2023-07-24 | Paper |
| Project games | 2023-04-20 | Paper |
| Strong cliques in diamond-free graphs | 2022-12-21 | Paper |
| Extension and its price for the connected vertex cover problem | 2022-02-01 | Paper |
| On the complexity of solution extension of optimization problems | 2022-02-01 | Paper |
| Algorithmic aspects of upper edge domination | 2021-06-23 | Paper |
| On the complexity of the upper \(r\)-tolerant edge cover problem | 2021-03-01 | Paper |
| Strong cliques in diamond-free graphs | 2021-02-03 | Paper |
| Maximum independent sets in subcubic graphs: new results | 2020-11-06 | Paper |
| Complexity and algorithms for constant diameter augmentation problems | 2020-10-01 | Paper |
| Extension and its price for the Connected Vertex Cover problem | 2020-02-25 | Paper |
| Maximum independent sets in subcubic graphs: new results | 2020-02-24 | Paper |
| Weighted upper edge cover: complexity and approximability | 2020-02-17 | Paper |
| Project games | 2020-02-06 | Paper |
| Extension of Vertex Cover and Independent Set in some classes of graphs | 2020-02-06 | Paper |
| On a simple hedonic game with graph-restricted communication | 2020-02-04 | Paper |
| Extension of some edge graph problems: standard and parameterized complexity | 2020-01-30 | Paper |
| Weighted upper edge cover: complexity and approximability | 2019-10-15 | Paper |
| Correction to: ``Weighted upper edge cover: complexity and approximability | 2019-10-15 | Paper |
| Efficient reallocation under additive and responsive preferences | 2019-09-10 | Paper |
| Complexity and approximability of extended spanning star forest problems in general and complete graphs | 2019-05-29 | Paper |
| Subset sum problems with digraph constraints | 2018-12-06 | Paper |
| On maximin share allocations in matroids | 2018-12-04 | Paper |
| Upper domination: towards a dichotomy through boundary properties | 2018-07-26 | Paper |
| Weighted upper domination number | 2018-04-09 | Paper |
| The many facets of upper domination | 2018-03-13 | Paper |
| Extended spanning star forest problems | 2018-02-26 | Paper |
| Approximate maximin share allocations in matroids | 2017-07-21 | Paper |
| Near fairness in matroids | 2017-07-18 | Paper |
| The price of optimum: complexity and approximation for a matching game | 2017-04-12 | Paper |
| Selfish transportation games | 2017-04-04 | Paper |
| Bi-objective matchings with the triangle inequality | 2017-03-16 | Paper |
| Conference program design with single-peaked and single-crossing preferences | 2017-02-10 | Paper |
| Strategic scheduling games: equilibria and efficiency | 2017-02-03 | Paper |
| Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective | 2016-11-09 | Paper |
| A boundary property for upper domination | 2016-09-29 | Paper |
| Upper domination: complexity and approximation | 2016-09-29 | Paper |
| Differential approximation results for the traveling salesman and related problems | 2016-06-16 | Paper |
| Congestion games with capacitated resources | 2016-01-13 | Paper |
| Approximate tradeoffs on matroids | 2015-12-11 | Paper |
| The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles | 2015-09-25 | Paper |
| A note on the clustered set covering problem | 2015-09-22 | Paper |
| A dichotomy for upper domination in monogenic classes | 2015-09-11 | Paper |
| Worst case compromises in matroids with applications to the allocation of indivisible goods | 2015-06-01 | Paper |
| New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set | 2015-05-29 | Paper |
| Approximate tradeoffs on weighted labeled matroids | 2015-04-28 | Paper |
| On the maximum independent set problem in subclasses of subcubic graphs | 2015-03-24 | Paper |
| A protocol for cutting matroids like cakes | 2015-01-12 | Paper |
| A note on the traveling salesman reoptimization problem under vertex insertion | 2014-12-15 | Paper |
| The Lazy Matroid Problem | 2014-09-15 | Paper |
| Approximation with a fixed number of solutions of some multiobjective maximization problems | 2014-08-13 | Paper |
| On the complexity of the selective graph coloring problem in some special classes of graphs | 2014-06-06 | Paper |
| On paths, trails and closed trails in edge-colored graphs | 2014-03-25 | Paper |
| On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs | 2014-01-17 | Paper |
| Possible winners in approval voting | 2013-12-17 | Paper |
| Cooperation in multiorganization matching | 2013-12-11 | Paper |
| Reoptimization of maximum weight induced hereditary subgraph problems | 2013-12-11 | Paper |
| Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph | 2013-09-05 | Paper |
| The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design | 2013-08-16 | Paper |
| The exact weighted independent set problem in perfect graphs and related classes | 2013-07-19 | Paper |
| On \(s\)--\(t\) paths and trails in edge-colored graphs | 2013-07-19 | Paper |
| Truthful many-to-many assignment with private weights | 2013-06-07 | Paper |
| Single approximation for the biobjective Max TSP | 2013-06-06 | Paper |
| Labeled traveling salesman problems: complexity and approximation | 2013-05-31 | Paper |
| Complexity of trails, paths and circuits in arc-colored digraphs | 2013-04-18 | Paper |
| Congestion games with capacitated resources | 2013-03-13 | Paper |
| Resilience and optimization of identifiable bipartite graphs | 2013-03-12 | Paper |
| Strategic Coloring of a Graph | 2013-02-15 | Paper |
| New results on polynomial inapproximability and fixed parameter approximability of \textsc{Edge Dominating Set} | 2013-01-07 | Paper |
| Complexity results for the empire problem in collection of stars | 2012-11-02 | Paper |
| Selective graph coloring in some special classes of graphs | 2012-11-02 | Paper |
| New candidates welcome! Possible winners with respect to the addition of new candidates | 2012-09-11 | 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 |
| Reoptimization of some maximum weight induced hereditary subgraph problems | 2012-06-29 | Paper |
| Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion | 2012-06-08 | Paper |
| Approximation of the clustered set covering problem | 2012-05-13 | Paper |
| The price of optimum in a matching game | 2011-10-28 | Paper |
| Maximizing the number of unused bins | 2011-01-28 | Paper |
| A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059325 | 2010-12-08 | Paper |
| The traveling salesman problem and its variations | 2010-12-08 | Paper |
| The complexity of bottleneck labeled graph problems | 2010-09-16 | Paper |
| The minimum reload \(s-t\) path, trail and walk problems | 2010-08-13 | Paper |
| Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs | 2010-06-17 | Paper |
| On the impact of local taxes in a set cover game | 2010-06-17 | Paper |
| The max \(k\)-cut game and its strong equilibria | 2010-06-17 | Paper |
| Strategic coloring of a graph | 2010-05-28 | Paper |
| Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation | 2010-03-18 | Paper |
| Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs | 2010-02-26 | Paper |
| On a Labeled Vehicle Routing Problem | 2010-01-28 | Paper |
| The labeled perfect matching in bipartite graphs | 2009-12-18 | Paper |
| Weighted coloring: further complexity and approximability results | 2009-12-18 | Paper |
| Reoptimization of minimum and maximum traveling salesman's tours | 2009-12-10 | Paper |
| Weighted coloring on planar, bipartite and split graphs: Complexity and approximation | 2009-06-30 | Paper |
| Some tractable instances of interval data minmax regret problems | 2009-03-04 | Paper |
| Cooperation in Multiorganization Matching | 2009-02-12 | Paper |
| The Minimum Reload s-t Path/Trail/Walk Problems | 2009-02-03 | Paper |
| A note on the hardness results for the labeled perfect matching problems in bipartite graphs | 2009-01-29 | Paper |
| On Labeled Traveling Salesman Problems | 2009-01-29 | Paper |
| Approximation results for the weighted \(P_4\) partition problem | 2008-08-08 | Paper |
| Complexity and Approximation Results for the Connected Vertex Cover Problem | 2008-07-01 | Paper |
| The Complexity of Bottleneck Labeled Graph Problems | 2008-07-01 | Paper |
| A better differential approximation ratio for symmetric TSP | 2008-05-28 | Paper |
| Approximation algorithms and hardness results for labeled connectivity problems | 2008-04-23 | Paper |
| The P k Partition Problem and Related Problems in Bipartite Graphs | 2008-03-07 | Paper |
| Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality | 2008-03-07 | Paper |
| The path partition problem and related problems in bipartite graphs | 2008-01-11 | Paper |
| Reoptimization of Minimum and Maximum Traveling Salesman’s Tours | 2007-09-07 | Paper |
| Approximation Algorithms and Hardness Results for Labeled Connectivity Problems | 2007-09-05 | Paper |
| Time slot scheduling of compatible jobs | 2007-05-15 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs | 2005-12-27 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| The maximum saving partition problem | 2005-06-01 | Paper |
| On the differential approximation of MIN SET COVER | 2005-04-06 | Paper |
| Approximation algorithms for some vehicle routing problems | 2005-02-23 | Paper |
| A hypocoloring model for batch scheduling | 2005-02-23 | Paper |
| Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) | 2005-02-09 | Paper |
| Differential approximation results for the Steiner tree problem | 2004-06-11 | Paper |
| Differential approximation of NP-hard problems with equal size feasible solutions | 2004-03-17 | Paper |
| Local approximations for maximum partial subgraph problem. | 2004-03-15 | Paper |
| Approximation result toward nearest neighbor heuristic | 2004-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437515 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414490 | 2003-07-25 | Paper |
| Approximation algorithms for the traveling salesman problem | 2003-06-23 | Paper |
| Local search for the minimum label spanning tree problem with bounded color classes. | 2003-06-17 | Paper |
| Differential approximation results for the traveling salesman problem with distances 1 and 2 | 2003-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792058 | 2003-02-10 | Paper |
| Bottleneck shortest paths on a partially ordered scale | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782716 | 2002-12-02 | Paper |
| The maximum \(f\)-depth spanning tree problem | 2002-07-14 | Paper |
| Bridging gap between standard and differential polynomial approximation: The case of bin-packing | 2000-01-30 | Paper |
