PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Villanger, Yngve"

Author of the publication

copydeleteadd this publication to your clipboard
A multi-parameter analysis of hard problems on deterministic finite automata.

, , and . J. Comput. Syst. Sci., 81 (4): 747-765 (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.

No persons found for author name Villanger, Yngve
add a person with the name Villanger, Yngve
 

Other publications of authors with the same name

Faster Parameterized Algorithms for Minimum Fill-In., , and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 282-293. Springer, (2008)Maximal Induced Matchings in Triangle-Free Graphs., , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 93-104. Springer, (2014)Proper Interval Vertex Deletion.. IPEC, volume 6478 of Lecture Notes in Computer Science, page 228-238. Springer, (2010)Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width., , , , , and . Algorithmica, 80 (2): 714-741 (2018)TREEWIDTH and PATHWIDTH parameterized by vertex cover, , , and . CoRR, (2013)Finding Induced Subgraphs via Minimal Triangulations, and . CoRR, (2009)Improved algorithms for feedback vertex set problems., , , , and . J. Comput. Syst. Sci., 74 (7): 1188-1198 (2008)Large induced subgraphs via triangulations and CMSO., , and . CoRR, (2013)A multi-parameter analysis of hard problems on deterministic finite automata., , and . J. Comput. Syst. Sci., 81 (4): 747-765 (2015)Solving Capacitated Dominating Set by using covering by subsets and maximum matching., , and . Discrete Applied Mathematics, (2014)