10.9k citations
- University of LiverpoolGB1.9k papers
- The Ohio State UniversityUS1.9k papers
- Heidelberg UniversityDE1.9k papers
- Lawrence Berkeley National LaboratoryUS1.9k papers
- Centre National de la Recherche ScientifiqueFR1.9k papers
- University of BirminghamGB1.9k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR1.8k papers
- National Institute for Subatomic PhysicsNL1.8k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.8k papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT1.8k papers
- Sapienza University of RomeIT1.8k papers
- Yale UniversityUS1.7k papers
94 papers · 1 filter
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
Mithilesh Kumar, Daniel Lokshtanov
A {\em bipartite tournament} is a directed graph such that every pair of vertices are connected by an arc, and no arc connects two vertice…
Threshold Testing and Semi-Online Prophet Inequalities
Martin Hoefer, Kevin Schewior
We study threshold testing, an elementary probing model with the goal to choose a large value out of i.i.d. random variables. An algorithm can test each variable once for…
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka +6
We consider the well-studied Robust -Clustering problem, which generalizes the classic -Median, -Means, and -Center problems. Given a constant , the input…
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
Meike Hatzel, Lars Jaffke, Paloma T. Lima +4
We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem, given a directed graph , pairs of ve…
-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Fredrik Manne, Geevarghese Philip, Saket Saurabh +1
Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms in preserving approxim…
Partitioning H-Free Graphs of Bounded Diameter
Christoph Brause, Petr Golovach, Barnaby Martin +2
A natural way of increasing our understanding of NP-complete graph problems is to restrict the input to a special graph class. Classes of -free graphs, that is, graphs that do n…