Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms

2013 ◽  
Vol 113 (5-6) ◽  
pp. 179-182 ◽  
Author(s):  
Marek Cygan ◽  
Marcin Pilipczuk
2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier

We study the General Position Subset Selection problem: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and present several fixed-parameter tractability results for the problem as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.


Optimization ◽  
2013 ◽  
Vol 62 (8) ◽  
pp. 1019-1036
Author(s):  
Bruno Escoffier ◽  
Vangelis Th. Paschos ◽  
Emeric Tourniaire

2020 ◽  
Vol 49 (4) ◽  
pp. 772-810
Author(s):  
Parinya Chalermsook ◽  
Marek Cygan ◽  
Guy Kortsarz ◽  
Bundit Laekhanukit ◽  
Pasin Manurangsi ◽  
...  

2016 ◽  
Vol 19 ◽  
pp. 12-22 ◽  
Author(s):  
Maw-Shang Chang ◽  
Li-Hsuan Chen ◽  
Ling-Ju Hung ◽  
Peter Rossmanith ◽  
Ping-Chen Su
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document