Author of the publication

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

Structure of Polynomial-Time Approximation., and . Theory Comput. Syst., 50 (4): 641-674 (2012)Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces., , and . CoRR, (2018)Parameterized Complexity of Induced H-Matching on Claw-Free Graphs., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 624-635. Springer, (2012)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Solving Partition Problems Almost Always Requires Pushing Many Vertices Around., , , and . SIAM J. Discret. Math., 34 (1): 640-681 (2020)Induced Disjoint Paths in Claw-Free Graphs., , and . SIAM J. Discret. Math., 29 (1): 348-375 (2015)Algorithms for diversity and clustering in social networks through dot product graphs., , and . Soc. Networks, (2015)Few induced disjoint paths for H-free graphs., , , and . Theor. Comput. Sci., (2023)The Firefighter problem on graph classes., , and . Theor. Comput. Sci., (2016)Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 130-140. Springer, (2013)