Author of the publication

Parameterized complexity of the induced subgraph problem in directed graphs.

, and . Inf. Process. Lett., 104 (3): 79-85 (2007)

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.

 

Other publications of authors with the same name

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas., , , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 985-996. Springer, (2015)Explicit Deterministic Constructions for Membership in the Bitprobe Model., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 290-299. Springer, (2001)Triangles, 4-Cycles and Parameterized (In-)Tractability., and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 304-315. Springer, (2006)On Parameterized Independent Feedback Vertex Set., , , and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 98-109. Springer, (2011)Sorting and Selection with Equality Comparisons., , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 434-445. Springer, (2015)FPT Algorithms for Connected Feedback Vertex Set, , , , and . CoRR, (2009)Faster Algorithms for Finding and Counting Subgraphs, , , , and . CoRR, (2009)Approximate Block Sorting., , , and . Int. J. Found. Comput. Sci., 17 (2): 337-356 (2006)Succinct ordinal trees with level-ancestor queries., , and . ACM Trans. Algorithms, 2 (4): 510-534 (2006)Succinct Data Structures for Representing Equivalence Classes., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 502-512. Springer, (2013)