( en | de | ru )

 

Disambiguation of "Villanger, Yngve"

Author of the publication

copydeleteadd this publication to your clipboard
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.

, , , , and . WG, volume 7551 of Lecture Notes in Computer Science, page 332-343. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yngve Spalden

Yngve Naess

Björn-Yngve Hailer

Holger-Yngve Simmann

Marc-Yngve Dietrich

 

Other publications of authors with the same name

A Quartic Kernel for Pathwidth-One Vertex Deletion., , and . WG, volume 6410 of Lecture Notes in Computer Science, page 196-207. (2010)Searching for better fill-in., and . STACS, volume 20 of LIPIcs, page 8-19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Exploring Subexponential Parameterized Complexity of Completion Problems., , , and . STACS, volume 25 of LIPIcs, page 288-299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Computing Minimal Triangulations in Time O(nalpha log n) = o(n 2.376)., , and . SIAM J. Discret. Math., 19 (4): 900-913 (2005)Independent Set in P5-Free Graphs in Polynomial Time., , and . SODA, page 570-581. SIAM, (2014)Enumerating Minimal Subset Feedback Vertex Sets., , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 399-410. Springer, (2011)Finding Induced Subgraphs via Minimal Triangulations, and . CoRR, (2009)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . Algorithmica, 80 (2): 714-741 (2018)Improved algorithms for feedback vertex set problems., , , , and . J. Comput. Syst. Sci., 74 (7): 1188-1198 (2008)Faster Parameterized Algorithms for Minimum Fill-In., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 282-293. Springer, (2008)