4 citations · 4 across the 4 of their papers we have counts for
4 papers
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model
Pierre Fraigniaud, Maël Luce, Ioan Todinca
It is known that, for every , -freeness can be decided by a generic Monte-Carlo algorithm running in rounds in the CONGEST model. For $2\leq k\leq…
A Meta-Theorem for Distributed Certification
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport +1
Distributed certification, whether it be proof-labeling schemes, locally checkable proofs, etc., deals with the issue of certifying the legality of a distributed system with respec…
On Distance- Independent Set and other problems in graphs with few minimal separators
Pedro Montealegre, Ioan Todinca
Fomin and Villanger (STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most…
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre +1
In this paper we give upper bounds on the number of minimal separators and potential maximal cliques of graphs w.r.t. two graph parameters, namely vertex cover (…