| Publication | Date of Publication | Type |
|---|
Approximation results on resource leveling problems
Theoretical Computer Science | 2025-09-16 | Paper |
Anchored rescheduling problem with non-availability periods
Operations Research Letters | 2025-05-05 | Paper |
Anchor-robust project scheduling with non-availability periods
Discrete Optimization | 2025-01-23 | Paper |
Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
Journal of Scheduling | 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
Social Choice and Welfare | 2024-10-25 | Paper |
Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms
Discrete Applied Mathematics | 2024-03-27 | Paper |
Online TSP with known locations
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Online 2-stage stable matching
Discrete Applied Mathematics | 2023-11-13 | Paper |
Canadian traveller problem with predictions
Approximation and Online Algorithms | 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
(available as arXiv preprint) | 2022-12-21 | Paper |
Target-based computer-assisted orchestration: complexity and approximation algorithms
European Journal of Operational Research | 2022-09-29 | Paper |
Online learning for min-max discrete problems
Theoretical Computer Science | 2022-08-25 | Paper |
| scientific article; zbMATH DE number 7561666 (Why is no real title available?) | 2022-07-21 | Paper |
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
Discrete Applied Mathematics | 2022-06-21 | Paper |
In memory of Jérôme Monnot
Theoretical Computer Science | 2022-05-23 | Paper |
| scientific article; zbMATH DE number 7525448 (Why is no real title available?) | 2022-05-11 | Paper |
Multistage knapsack
Journal of Computer and System Sciences | 2022-03-29 | Paper |
LP-based algorithms for multistage minimization problems
(available as arXiv preprint) | 2022-03-22 | Paper |
A simple rounding scheme for multistage optimization
Theoretical Computer Science | 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
Algorithmica | 2021-07-26 | Paper |
Online multistage subset maximization problems
Algorithmica | 2021-07-26 | Paper |
| scientific article; zbMATH DE number 7238962 (Why is no real title available?) | 2020-08-25 | Paper |
The convergence of iterative delegations in liquid democracy in a social network
(available as arXiv preprint) | 2020-02-04 | 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
Theoretical Computer Science | 2019-01-10 | Paper |
Parameterized power vertex cover
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
Discrete Optimization | 2018-08-17 | Paper |
The price of optimum: complexity and approximation for a matching game
Algorithmica | 2017-04-12 | Paper |
Super-polynomial approximation branching algorithms
RAIRO - Operations Research | 2017-01-12 | Paper |
Saving colors and max coloring: some fixed-parameter tractability results
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Parameterized power vertex cover
Lecture Notes in Computer Science | 2016-12-22 | Paper |
A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
Theory of Computing Systems | 2015-05-29 | Paper |
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
Algorithmica | 2015-05-04 | Paper |
On subexponential and FPT-time inapproximability
Algorithmica | 2015-05-04 | Paper |
Approximating MAX SAT by moderately exponential and parameterized algorithms
Theoretical Computer Science | 2014-12-02 | Paper |
A survey on the structure of approximation classes
Computer Science Review | 2014-10-07 | Paper |
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Moderately exponential time and fixed parameter approximation algorithms
Optimization | 2013-12-19 | Paper |
Simple and fast reoptimizations for the Steiner tree problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
Parameterized and Exact Computation | 2013-12-10 | Paper |
On subexponential and FPT-time inapproximability
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Designing budget-balanced best-response mechanisms for network coordination games
Algorithmic Game Theory | 2013-10-23 | Paper |
Truthful many-to-many assignment with private weights
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Fast algorithms for min independent dominating set
Discrete Applied Mathematics | 2013-03-12 | Paper |
Strategic Coloring of a Graph
Internet Mathematics | 2013-02-15 | Paper |
New results on polynomial inapproximability and fixed parameter approximability of \textsc{Edge Dominating Set}
Parameterized and Exact Computation | 2013-01-07 | Paper |
Algorithms for dominating clique problems
Theoretical Computer Science | 2012-11-08 | Paper |
| Complexity and approximation in reoptimization | 2012-09-05 | Paper |
Approximating MAX SAT by moderately exponential and parameterized algorithms
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
Discrete Applied Mathematics | 2012-04-30 | Paper |
Fast algorithms for max independent set
Algorithmica | 2012-04-26 | Paper |
Adapting parallel algorithms to the W-stream model, with applications to graph problems
Theoretical Computer Science | 2012-04-03 | Paper |
| An introduction to exponential time exact algorithms for solving NP-hard problems | 2012-01-26 | Paper |
| Moderately exponential approximation | 2012-01-26 | Paper |
Strategy-proof mechanisms for facility location games with many facilities
Algorithmic Decision Theory | 2011-10-28 | Paper |
The price of optimum in a matching game
Algorithmic Game Theory | 2011-10-28 | Paper |
| Dynamic programming | 2011-03-09 | Paper |
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters | 2010-08-20 | Paper |
A bottom-up method and fast algorithms for Max Independent Set
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\)
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On the impact of local taxes in a set cover game
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Fast algorithms for \textsc{min independent dominating set}
Structural Information and Communication Complexity | 2010-06-17 | Paper |
Strategic coloring of a graph
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
European Journal of Operational Research | 2010-03-18 | Paper |
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Weighted coloring: further complexity and approximability results
Information Processing Letters | 2009-12-18 | Paper |
Exact algorithms for dominating clique problems (extended abstract)
Algorithms and Computation | 2009-12-17 | Paper |
Reoptimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Probabilistic graph-coloring in bipartite and split graphs
Journal of Combinatorial Optimization | 2009-10-09 | Paper |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics | 2009-06-30 | Paper |
Efficient approximation of Min Set Cover by moderately exponential algorithms
Theoretical Computer Science | 2009-05-28 | Paper |
Some tractable instances of interval data minmax regret problems
Operations Research Letters | 2009-03-04 | Paper |
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Complexity and Approximation Results for the Connected Vertex Cover Problem
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
Parameterized and Exact Computation | 2008-06-05 | Paper |
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science | 2008-05-28 | Paper |
Approximation of the quadratic set covering problem
Discrete Optimization | 2008-05-14 | Paper |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Polynomial approximation: a structural and operational study. (Abstract of thesis)
4OR | 2007-08-31 | Paper |
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters | 2007-08-27 | Paper |
Differential approximation of MIN SAT, MAX SAT and related problems
European Journal of Operational Research | 2007-04-19 | Paper |
On-line models and algorithms for max independent set
RAIRO - Operations Research | 2006-12-11 | Paper |
On-line models and algorithms for max independent set
RAIRO - Operations Research | 2006-12-11 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Completeness in approximation classes beyond APX
Theoretical Computer Science | 2006-09-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Theoretical Computer Science | 2005-06-30 | Paper |
Proving completeness by logic
International Journal of Computer Mathematics | 2005-03-07 | Paper |
