A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

doi 10.1145/3188745.3188854
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

2020English

Tight Bounds for Testing Bipartiteness in General Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Lower Bounds for Gaussian Estrada Index of Graphs

Symmetry
MathematicsChemistryPhysicsComputer ScienceAstronomy
2018English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy