171 citations
- Aarhus UniversityDK1 paper
- ETH ZurichCH1 paper
- Hiroshima UniversityJP1 paper
- Institut des Hautes Études ScientifiquesFR1 paper
- International Center for Relativistic AstrophysicsIT1 paper
- Istituto Nazionale di Fisica Nucleare, Sezione di TorinoIT1 paper
- Jet Propulsion LaboratoryUS1 paper
- Joint Institute for VLBI ERICNL1 paper
- Lancaster UniversityGB1 paper
- Ludwig-Maximilians-Universität MünchenDE1 paper
- Max Planck Institute for Gravitational PhysicsDE1 paper
- Max Planck Institute of Quantum OpticsDE1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2008
Minimum Leaf Out-branching and Related Problems
G. Gutin, I. Razgon, E. J. Kim
Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…
cs.DS2008★ 4 cited
Almost 2-SAT is Fixed-Parameter Tractable
Igor Razgon, Barry O'Sullivan
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to…