( 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 . Algorithmica, 72 (3): 687-713 (2015)

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 wide-range algorithm for minimal triangulation from an arbitrary ordering., , , , and . J. Algorithms, 58 (1): 33-66 (2006)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)Large induced subgraphs via triangulations and CMSO., , and . CoRR, (2013)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . Algorithmica, 80 (2): 714-741 (2018)Finding Induced Subgraphs via Minimal Triangulations, and . CoRR, (2009)Proper Interval Vertex Deletion.. IPEC, volume 6478 of Lecture Notes in Computer Science, page 228-238. Springer, (2010)Maximal Induced Matchings in Triangle-Free Graphs., , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 93-104. Springer, (2014)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)