| Publication | Date of Publication | Type |
|---|
| Anchor-robust project scheduling with non-availability periods | 2025-01-23 | Paper |
| Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems | 2025-01-07 | Paper |
| Learning-augmented online TSP on rings, trees, flowers and (almost) everywhere else | 2025-01-06 | Paper |
| Euclidean preferences in the plane under \(\ell_1,\ell_2\) and \(\ell_\infty\) norms | 2024-10-25 | Paper |
| Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms | 2024-03-27 | Paper |
| Online TSP with known locations | 2024-01-16 | Paper |
| Online 2-stage stable matching | 2023-11-13 | Paper |
| Canadian traveller problem with predictions | 2023-07-25 | Paper |
| Measuring nearly single-peakedness of an electorate: some new insights | 2023-03-31 | Paper |
| Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms | 2022-12-21 | Paper |
| Target-based computer-assisted orchestration: complexity and approximation algorithms | 2022-09-29 | Paper |
| Online learning for min-max discrete problems | 2022-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092381 | 2022-07-21 | Paper |
| Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences | 2022-06-21 | Paper |
| In memory of Jérôme Monnot | 2022-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075745 | 2022-05-11 | Paper |
| Multistage knapsack | 2022-03-29 | Paper |
| LP-based algorithms for multistage minimization problems | 2022-03-22 | Paper |
| A simple rounding scheme for multistage optimization | 2022-02-21 | Paper |
| Euclidean preferences in the plane under $\ell_1$, $\ell_2$ and $\ell_\infty$ norms | 2022-02-03 | Paper |
| Online multistage subset maximization problems | 2021-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116470 | 2020-08-25 | Paper |
| The convergence of iterative delegations in liquid democracy in a social network | 2020-02-04 | Paper |
| Saving colors and max coloring: some fixed-parameter tractability results | 2019-01-10 | Paper |
| Parameterized Power Vertex Cover | 2018-12-10 | Paper |
| Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs | 2018-08-17 | Paper |
| The price of optimum: complexity and approximation for a matching game | 2017-04-12 | Paper |
| Super-polynomial approximation branching algorithms | 2017-01-12 | Paper |
| Parameterized Power Vertex Cover | 2016-12-22 | Paper |
| Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results | 2016-12-22 | Paper |
| A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs | 2016-05-03 | Paper |
| New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set | 2015-05-29 | Paper |
| On subexponential and FPT-time inapproximability | 2015-05-04 | Paper |
| Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization | 2015-05-04 | Paper |
| Approximating MAX SAT by moderately exponential and parameterized algorithms | 2014-12-02 | Paper |
| A survey on the structure of approximation classes | 2014-10-07 | Paper |
| Exponential approximation schemata for some network design problems | 2014-08-13 | Paper |
| Moderately exponential time and fixed parameter approximation algorithms | 2013-12-19 | Paper |
| Simple and fast reoptimizations for the Steiner tree problem | 2013-12-11 | Paper |
| On subexponential and FPT-time inapproximability | 2013-12-10 | Paper |
| Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization | 2013-12-10 | Paper |
| Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games | 2013-10-23 | Paper |
| Truthful Many-to-Many Assignment with Private Weights | 2013-06-07 | Paper |
| Fast algorithms for min independent dominating set | 2013-03-12 | Paper |
| Strategic Coloring of a Graph | 2013-02-15 | Paper |
| New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set | 2013-01-07 | Paper |
| Algorithms for dominating clique problems | 2012-11-08 | Paper |
| Complexity and approximation in reoptimization | 2012-09-05 | Paper |
| Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms | 2012-07-16 | Paper |
| Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms | 2012-04-30 | Paper |
| Fast algorithms for max independent set | 2012-04-26 | Paper |
| Adapting parallel algorithms to the W-stream model, with applications to graph problems | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109949 | 2012-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109950 | 2012-01-26 | Paper |
| Strategy-Proof Mechanisms for Facility Location Games with Many Facilities | 2011-10-28 | Paper |
| The Price of Optimum in a Matching Game | 2011-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081835 | 2011-03-09 | Paper |
| Approximation of min coloring by moderately exponential algorithms | 2010-08-20 | Paper |
| A Bottom-Up Method and Fast Algorithms for max independent set | 2010-06-22 | Paper |
| Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ | 2010-06-17 | Paper |
| On the Impact of Local Taxes in a Set Cover Game | 2010-06-17 | Paper |
| Fast Algorithms for min independent dominating set | 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 |
| Weighted coloring: further complexity and approximability results | 2009-12-18 | Paper |
| Exact algorithms for dominating clique problems (extended abstract) | 2009-12-17 | Paper |
| Reoptimization of minimum and maximum traveling salesman's tours | 2009-12-10 | Paper |
| Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms | 2009-10-20 | Paper |
| Probabilistic graph-coloring in bipartite and split graphs | 2009-10-09 | Paper |
| Weighted coloring on planar, bipartite and split graphs: Complexity and approximation | 2009-06-30 | Paper |
| Efficient approximation of Min Set Cover by moderately exponential algorithms | 2009-05-28 | Paper |
| Some tractable instances of interval data minmax regret problems | 2009-03-04 | Paper |
| Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems | 2008-09-17 | Paper |
| Complexity and Approximation Results for the Connected Vertex Cover Problem | 2008-07-01 | Paper |
| An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs | 2008-06-05 | Paper |
| A better differential approximation ratio for symmetric TSP | 2008-05-28 | Paper |
| Approximation of the quadratic set covering problem | 2008-05-14 | Paper |
| Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality | 2008-03-07 | Paper |
| Reoptimization of Minimum and Maximum Traveling Salesman’s Tours | 2007-09-07 | Paper |
| Polynomial approximation: a structural and operational study. (Abstract of thesis) | 2007-08-31 | Paper |
| Improved worst-case complexity for the MIN 3-SET COVERING problem | 2007-08-27 | Paper |
| Differential approximation of MIN SAT, MAX SAT and related problems | 2007-04-19 | Paper |
| On-line models and algorithms for max independent set | 2006-12-11 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Completeness in approximation classes beyond APX | 2006-09-14 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness | 2005-06-30 | Paper |
| Proving completeness by logic | 2005-03-07 | Paper |
