| Publication | Date of Publication | Type |
|---|
Approximating minimum spanning tree of depth 2
International Transactions in Operational Research | 2026-02-25 | Paper |
| Constructive -- non-constructive approximation and maximum independent set problem | 2024-07-05 | Paper |
Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}
Discrete Applied Mathematics | 2024-01-09 | Paper |
| scientific article; zbMATH DE number 7764100 (Why is no real title available?) | 2023-11-13 | Paper |
| The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet * | 2023-07-24 | Paper |
Improved (In-)Approximability Bounds for d-Scattered Set
Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
Lecture Notes in Computer Science | 2023-03-22 | Paper |
New algorithms for mixed dominating set
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
New algorithms for mixed dominating set
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
Theoretical Computer Science | 2022-06-13 | Paper |
In memory of Jérôme Monnot
Theoretical Computer Science | 2022-05-23 | Paper |
Structurally parameterized \(d\)-scattered set
Discrete Applied Mathematics | 2022-01-05 | Paper |
| scientific article; zbMATH DE number 7278055 (Why is no real title available?) | 2020-11-25 | Paper |
| scientific article; zbMATH DE number 7238962 (Why is no real title available?) | 2020-08-25 | Paper |
Improved (In-)approximability bounds for \(d\)-scattered set
(available as arXiv preprint) | 2020-08-24 | Paper |
| A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs | 2019-09-18 | Paper |
Structural parameters, tight bounds, and approximation for \((k, r)\)-center
Discrete Applied Mathematics | 2019-06-20 | Paper |
Structural parameters, tight bounds, and approximation for \((k, r)\)-center
Discrete Applied Mathematics | 2019-06-20 | Paper |
When polynomial approximation meets exact computation
Annals of Operations Research | 2019-03-06 | Paper |
Structurally parameterized \(d\)-scattered set
(available as arXiv preprint) | 2018-11-22 | Paper |
Parameterized (in)approximability of subset problems
Operations Research Letters | 2018-09-28 | Paper |
On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems
IEEE Transactions on Computers | 2018-09-14 | Paper |
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
Discrete Optimization | 2018-08-17 | Paper |
Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
RAIRO - Operations Research | 2018-08-10 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
Sparsification and subexponential approximation
Acta Informatica | 2018-02-28 | Paper |
Time-approximation trade-offs for inapproximable problems
(available as arXiv preprint) | 2018-01-24 | Paper |
Sub-exponential approximation schemes for CSPs: from dense to almost sparse
(available as arXiv preprint) | 2018-01-24 | Paper |
The probabilistic minimum dominating set problem
Discrete Applied Mathematics | 2017-12-20 | Paper |
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
European Journal of Operational Research | 2017-12-06 | Paper |
Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
Optimization Theory, Decision Making, and Operations Research Applications | 2017-11-30 | Paper |
Time-approximation trade-offs for inapproximable problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Dual parameterization and parameterized approximability of subset graph problems
RAIRO - Operations Research | 2017-03-24 | Paper |
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
RAIRO - Theoretical Informatics and Applications | 2017-01-19 | Paper |
Super-polynomial approximation branching algorithms
RAIRO - Operations Research | 2017-01-12 | 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 |
A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
On the max min vertex cover problem
Discrete Applied Mathematics | 2015-09-30 | Paper |
When polynomial approximation meets exact computation
4OR | 2015-09-17 | Paper |
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
Theory of Computing Systems | 2015-05-29 | Paper |
On subexponential and FPT-time inapproximability
Algorithmica | 2015-05-04 | Paper |
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
Algorithmica | 2015-05-04 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2015-01-22 | Paper |
Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
Journal of Combinatorial Optimization | 2015-01-21 | 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 |
On the max min vertex cover problem
Approximation and Online Algorithms | 2014-09-02 | 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 |
Greedy algorithms for on-line set-covering
Algorithmic Operations Research | 2013-12-11 | Paper |
Approximating the metric 2-peripatetic salesman problem
Algorithmic Operations Research | 2013-12-11 | Paper |
Probabilistic optimization in graph-problems
Algorithmic Operations Research | 2013-12-11 | Paper |
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science | 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 |
Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph
Discrete Mathematics, Algorithms and Applications | 2013-09-05 | Paper |
The probabilistic min dominating set problem
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
Discrete Optimization | 2013-03-13 | Paper |
Fast algorithms for min independent dominating set
Discrete Applied Mathematics | 2013-03-12 | Paper |
On the probabilistic min spanning tree problem
JMMA. Journal of Mathematical Modelling and Algorithms | 2013-02-19 | 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 |
Efficient algorithms for the max \(k\)-vertex cover problem
Lecture Notes in Computer Science | 2012-09-21 | Paper |
A survey on combinatorial optimization in dynamic environments
RAIRO. Operations Research | 2012-09-04 | Paper |
A survey on combinatorial optimization in dynamic environments
RAIRO. Operations Research | 2012-09-04 | Paper |
Online maximum \(k\)-coverage
Discrete Applied Mathematics | 2012-08-10 | Paper |
Approximating MAX SAT by moderately exponential and parameterized algorithms
Lecture Notes in Computer Science | 2012-07-16 | Paper |
The \textsc{max quasi-independent set} problem
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
Reoptimization of some maximum weight induced hereditary subgraph problems
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion
WALCOM: Algorithms and Computation | 2012-06-08 | 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 |
| An introduction to exponential time exact algorithms for solving NP-hard problems | 2012-01-26 | Paper |
| Moderately exponential approximation | 2012-01-26 | Paper |
Online maximum \(k\)-coverage
Fundamentals of Computation Theory | 2011-08-19 | Paper |
| Basic concepts in algorithms and complexity theory | 2011-03-09 | Paper |
| Maximizing the number of unused bins | 2011-01-28 | Paper |
| A note on the approximation ratio of graph-coloring | 2011-01-28 | Paper |
| A model for the design of a minimum-cost telecommunications network | 2011-01-03 | Paper |
On the max-weight edge coloring problem
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
| Probabilistic combinatorial optimization | 2010-12-08 | Paper |
| Polynomial approximation | 2010-12-08 | Paper |
| scientific article; zbMATH DE number 5823948 (Why is no real title available?) | 2010-12-08 | Paper |
| Approximation preserving reductions | 2010-12-08 | Paper |
Probabilistic models for the Steiner tree problem
Networks | 2010-11-24 | Paper |
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters | 2010-08-20 | Paper |
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms | 2010-08-18 | Paper |
Approximating the max-edge-coloring problem
Theoretical Computer Science | 2010-08-11 | Paper |
| scientific article; zbMATH DE number 5764439 (Why is no real title available?) | 2010-08-06 | Paper |
The max quasi-independent set Problem
Computer Science – Theory and Applications | 2010-06-22 | Paper |
A bottom-up method and fast algorithms for Max Independent Set
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Fast algorithms for \textsc{min independent dominating set}
Structural Information and Communication Complexity | 2010-06-17 | 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 |
An overview on polynomial approximation of NP-hard problems
Yugoslav Journal of Operations Research | 2010-01-12 | Paper |
The probabilistic minimum coloring problem (extended abstract)
Lecture Notes in Computer Science | 2010-01-12 | 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 |
Approximating the max edge-coloring problem
Lecture Notes in Computer Science | 2009-12-11 | 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 |
Algorithms for the on-line quota traveling salesman problem
Information Processing Letters | 2009-08-27 | Paper |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics | 2009-06-30 | Paper |
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
Discrete Applied Mathematics | 2009-06-24 | Paper |
Efficient approximation of Min Set Cover by moderately exponential algorithms
Theoretical Computer Science | 2009-05-28 | Paper |
Steiner Forests on Stochastic Metric Graphs
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems
Operational Research. An International Journal | 2009-02-17 | Paper |
On the Maximum Edge Coloring Problem
Approximation and Online Algorithms | 2009-02-12 | Paper |
Vertex-Uncertainty in Graph-Problems
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
Parameterized and Exact Computation | 2008-06-05 | Paper |
An exact algorithm for MAX-CUT in sparse graphs
Operations Research Letters | 2008-01-21 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2007-12-20 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters | 2007-08-27 | Paper |
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Time slot scheduling of compatible jobs
Journal of Scheduling | 2007-05-15 | Paper |
Differential approximation of MIN SAT, MAX SAT and related problems
European Journal of Operational Research | 2007-04-19 | Paper |
| Probabilistic Combinatorial Optimization on Graphs | 2007-03-07 | 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 |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | 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 |
Reductions, completeness and the hardness of approximability
European Journal of Operational Research | 2006-05-16 | Paper |
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics | 2006-04-28 | Paper |
Improved approximations for weighted and unweighted graph problems
Theory of Computing Systems | 2006-01-10 | 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 DIFFERENTIAL APPROXIMATION CLASSES
International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2221549 (Why is no real title available?) | 2005-11-01 | Paper |
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Theoretical Computer Science | 2005-06-30 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
On-line maximum-order induced hereditary subgraph problems
International Transactions in Operational Research | 2005-04-22 | Paper |
Polynomial approximation algorithms with performance guarantees: an introduction-by-example
European Journal of Operational Research | 2005-04-21 | Paper |
On-line vertex-covering
Theoretical Computer Science | 2005-04-06 | Paper |
On the differential approximation of MIN SET COVER
Theoretical Computer Science | 2005-04-06 | Paper |
The antennas preassignment problem
Chaos, Solitons and Fractals | 2005-03-08 | Paper |
Proving completeness by logic
International Journal of Computer Mathematics | 2005-03-07 | Paper |
A hypocoloring model for batch scheduling
Discrete Applied Mathematics | 2005-02-23 | Paper |
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa
International Journal of Computer Mathematics | 2004-12-29 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
RAIRO - Operations Research | 2004-08-30 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
RAIRO - Operations Research | 2004-08-30 | Paper |
A simulated annealing approach for the circular cutting problem
European Journal of Operational Research | 2004-08-16 | Paper |
| scientific article; zbMATH DE number 2079869 (Why is no real title available?) | 2004-08-03 | Paper |
Differential approximation results for the Steiner tree problem
Applied Mathematics Letters | 2004-06-11 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
RAIRO - Operations Research | 2004-03-17 | Paper |
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
RAIRO - Operations Research | 2004-03-17 | Paper |
Local approximations for maximum partial subgraph problem.
Operations Research Letters | 2004-03-15 | Paper |
Master-slave strategy and polynomial approximation
Computational Optimization and Applications | 2003-08-26 | Paper |
Polynomial approximation and graph-coloring
Computing | 2003-08-21 | Paper |
| scientific article; zbMATH DE number 1953087 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1953086 (Why is no real title available?) | 2003-07-25 | Paper |
Approximation algorithms for the traveling salesman problem
Mathematical Methods of Operations Research | 2003-06-23 | Paper |
Differential approximation for optimal satisfiability and related problems
European Journal of Operational Research | 2003-04-28 | Paper |
Differential approximation results for the traveling salesman problem with distances 1 and 2
European Journal of Operational Research | 2003-04-10 | Paper |
| scientific article; zbMATH DE number 1865680 (Why is no real title available?) | 2003-02-10 | Paper |
| scientific article; zbMATH DE number 1839451 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1828012 (Why is no real title available?) | 2002-11-13 | Paper |
The Probabilistic Minimum Vertex-covering Problem
International Transactions in Operational Research | 2002-10-10 | Paper |
A priori optimization for the probabilistic maximum independent set problem
Theoretical Computer Science | 2002-03-03 | Paper |
A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
Chaos, Solitons and Fractals | 2002-01-02 | Paper |
An improved general procedure for lexicographic bottleneck problems
Operations Research Letters | 2001-02-09 | Paper |
A neural network for the minimum set covering problem
Chaos, Solitons and Fractals | 2000-12-18 | Paper |
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
RAIRO - Operations Research | 2000-08-24 | Paper |
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
RAIRO - Operations Research | 2000-08-24 | Paper |
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Applied Mathematics Letters | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1330076 (Why is no real title available?) | 1999-09-01 | Paper |
| scientific article; zbMATH DE number 1330075 (Why is no real title available?) | 1999-09-01 | Paper |
Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
European Journal of Operational Research | 1999-07-05 | Paper |
| The probabilistic longest path problem | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1300957 (Why is no real title available?) | 1999-06-16 | Paper |
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
European Journal of Operational Research | 1999-02-22 | Paper |
Differential approximation algorithms for some combinatorial optimization problems
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 847791 (Why is no real title available?) | 1998-12-10 | Paper |
A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem
Chaos, Solitons and Fractals | 1998-08-16 | Paper |
Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA)
Acta Informatica | 1998-08-10 | Paper |
Improved approximations for maximum independent set via approximation chains
Applied Mathematics Letters | 1998-03-16 | Paper |
| scientific article; zbMATH DE number 1072400 (Why is no real title available?) | 1997-10-08 | Paper |
| scientific article; zbMATH DE number 1072400 (Why is no real title available?) | 1997-10-08 | Paper |
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
Annals of Operations Research | 1997-08-24 | Paper |
The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
Computational Optimization and Applications | 1997-06-04 | Paper |
Average case analysis of greedy algorithms for optimisation problems on set systems
Theoretical Computer Science | 1997-02-28 | Paper |
On an approximation measure founded on the links between optimization and polynomial approximation theory
Theoretical Computer Science | 1997-02-27 | Paper |
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
RAIRO - Operations Research | 1997-02-20 | Paper |
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
RAIRO - Operations Research | 1997-01-07 | Paper |
| scientific article; zbMATH DE number 915981 (Why is no real title available?) | 1996-10-28 | Paper |
A New Efficient Heuristic for the Minimum Set Covering Problem
The Journal of the Operational Research Society | 1996-09-16 | Paper |
| scientific article; zbMATH DE number 845765 (Why is no real title available?) | 1996-08-19 | Paper |
| scientific article; zbMATH DE number 844506 (Why is no real title available?) | 1996-06-09 | Paper |
| scientific article; zbMATH DE number 792644 (Why is no real title available?) | 1995-09-04 | Paper |
| scientific article; zbMATH DE number 784428 (Why is no real title available?) | 1995-08-13 | Paper |
Approximation results for the minimum graph coloring problem
Information Processing Letters | 1995-02-13 | Paper |
| scientific article; zbMATH DE number 563689 (Why is no real title available?) | 1994-06-16 | Paper |
| scientific article; zbMATH DE number 558545 (Why is no real title available?) | 1994-05-19 | Paper |
| scientific article; zbMATH DE number 447044 (Why is no real title available?) | 1994-01-09 | Paper |
A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
Information Processing Letters | 1993-01-04 | Paper |
