• Publications
• Influence
Multicut is FPT
• Mathematics, Computer Science
• STOC '11
• 25 October 2010
We show that there exists an O(k)nc algorithm which decides if there exists a multicut of size at most k. Expand
• 94
• 13
• PDF
The Erdős-Hajnal conjecture for paths and antipaths
• Mathematics, Computer Science
• J. Comb. Theory, Ser. B
• 21 March 2013
We prove that for every k, there exists c k 0 such that every graph G on n vertices with no induced path P k or its complement P k contains a clique or a stable set of size n c k . Expand
• 33
• 10
• PDF
Recoloring bounded treewidth graphs
• Mathematics, Computer Science
• Electron. Notes Discret. Math.
• 14 February 2013
A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent properk-colorings. Expand
• 58
• 6
• PDF
A Polynomial Kernel for Multicut in Trees
• Mathematics, Computer Science
• STACS
• 6 February 2009
The {\sc Multicut In Trees} problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer \$k\$, whether there exists aSet of \$k\$ edges cutting all the requests. Expand
• 34
• 6
• PDF
Recoloring graphs via tree decompositions
• Mathematics, Computer Science
• Eur. J. Comb.
• 25 March 2014
We prove that any graph is \$(tw+2)\$-mixing, where \$tw\$ is the treewidth of the graph (Cereceda 2006). Expand
• 23
• 5
• PDF
VC-dimension and Erdős-Pósa property
• Mathematics, Computer Science
• Discret. Math.
• 4 December 2014
Let G = ( V , E ) be a graph. A k -neighborhood in G is a set of vertices consisting of all the vertices at distance at most k from some vertex of G . The hypergraph on vertex set V whose edge setExpand
• 18
• 5
• PDF
Clique versus independent set
• Mathematics, Computer Science
• Eur. J. Comb.
• 11 January 2013
We show that three classical problems from communication complexity, graph theory and CSP are polynomially equivalent. Expand
• 19
• 5
• PDF
The Erdös-Hajnal Conjecture for Long Holes and Antiholes
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 8 August 2014
We prove that graphs which contain neither a hole of length at least k nor its complement have the Erdős-Hajnal property. Expand
• 22
• 4
• PDF
Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints
— The problem of estimating the probability p = P (g(X) ≤ 0) is considered when X represents a multivariate stochastic input of a monotonic function g. First, a heuristic method to bound p,Expand
• 8
• 4
• PDF
Fast Recoloring of Sparse Graphs
• Mathematics, Computer Science
• Eur. J. Comb.
• 25 November 2014
For every graph of maximum average degree bounded away from \$d\$, any \$(d+1)\$-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current coloring is proper. Expand
• 27
• 3
• PDF