Bidimensionality - PDFSEARCH.IO - Document Search Engine

Bidimensionality
Results: 17

#	Item
1	The Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,∗ , Pim van ’t Hof1,∗ , Marcin Kami´ nski2 , and 3,† Dani¨el Paulusma 1 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2013-04-23 04:25:37 Graph theory NP-complete problems Planar graph Dominating set Vertex Degree Cycle Line graph Bidimensionality
2	The Computer Journal Special Issue on Parameterized Complexity: Foreward by the Guest Editors Rodney G. Downey Victoria University Wellington, New Zealand Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 03:04:07 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Dominating set Exponential time hypothesis Feedback vertex set Theoretical computer science Computational complexity theory Applied mathematics
3	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
4	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
5	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 3, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:09 NP-complete problems Bidimensionality Parameterized complexity Kernelization Branch-decomposition Path decomposition Tree decomposition Clique Feedback vertex set Graph theory Theoretical computer science Mathematics
6	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 2, NovemberWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 06:03:49 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Bidimensionality Kernelization Dominating set Branch-decomposition Vertex cover Theoretical computer science Graph theory Computational complexity theory
7	Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:19:59 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Kernelization Bidimensionality Feedback vertex set Dominating set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
8	Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:47:38 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Graph coloring Bidimensionality Kernelization Clique Dominating set Theoretical computer science Graph theory Computational complexity theory
9	Newsletter of the PC Community November 2011 Welcome Frances Rosamond, Editor Congratulations to Serge Gaspers and Mohammad Taghi Hajiaghayi for multiple awards, to Yoichi Iwata for the IPEC Excellent Student Paper award Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:09:27 NP-complete problems Parameterized complexity Kernelization NP-complete Bidimensionality Dominating set Clique problem Feedback vertex set Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
10	A quick summary of the field of Parameterized Complexity, 2012 Overview Parameterized Complexity is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-22 20:37:29 Analysis of algorithms Parameterized complexity Michael Fellows Kernelization Bidimensionality Exponential time hypothesis Time complexity Complexity FO Theoretical computer science Computational complexity theory Applied mathematics