| Publication | Date of Publication | Type |
|---|
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
European Journal of Operational Research | 2017-12-06 | Paper |
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Greedy algorithms for on-line set-covering
Algorithmic Operations Research | 2013-12-11 | Paper |
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Fast algorithms for min independent dominating set
Discrete Applied Mathematics | 2013-03-12 | Paper |
Algorithms for dominating clique problems
Theoretical Computer Science | 2012-11-08 | Paper |
The \textsc{max quasi-independent set} problem
Journal of Combinatorial Optimization | 2012-07-10 | 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 |
Approximation of min coloring by moderately exponential algorithms
Information Processing Letters | 2010-08-20 | Paper |
Approximating the max-edge-coloring problem
Theoretical Computer Science | 2010-08-11 | Paper |
A bottom-up method and fast algorithms for Max Independent Set
Lecture Notes in Computer Science | 2010-06-22 | Paper |
The max quasi-independent set Problem
Computer Science – Theory and Applications | 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 |
Fast algorithms for \textsc{min independent dominating set}
Structural Information and Communication Complexity | 2010-06-17 | 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 |
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 |
Efficient approximation of Min Set Cover by moderately exponential algorithms
Theoretical Computer Science | 2009-05-28 | Paper |
An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
Parameterized and Exact Computation | 2008-06-05 | Paper |
Experimental and theoretical analysis of the limits to ductility of type 304 stainless steel sheet
European Journal of Mechanics. A. Solids | 2008-04-07 | Paper |
