Author of the publication

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

, , , , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 87-98. Springer, (2019)

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

Dynamic sampling from a discrete probability distribution with a known distribution of rates., , and . Comput. Stat., 37 (3): 1203-1228 (2022)Hedonic Seat Arrangement Problems., , , , , and . AAMAS, page 1777-1779. International Foundation for Autonomous Agents and Multiagent Systems, (2020)On Reduction Algorithms for Graphs with Small Treewidth.. WG, volume 790 of Lecture Notes in Computer Science, page 45-56. Springer, (1993)Lower Bounds for Kernelization.. IPEC, volume 8894 of Lecture Notes in Computer Science, page 1-14. Springer, (2014)Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.. SWAT, volume 318 of Lecture Notes in Computer Science, page 223-232. Springer, (1988)The Valve Location Problem in Simple Network Topologies., , , and . WG, volume 5344 of Lecture Notes in Computer Science, page 55-65. (2008)Computing Treewidth on the GPU., and . IPEC, volume 89 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter., and . STACS, volume 9 of LIPIcs, page 177-188. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)A linear time algorithm for finding tree-decompositions of small treewidth.. STOC, page 226-234. ACM, (1993)On the Complexity of Some Coloring Games.. WG, volume 484 of Lecture Notes in Computer Science, page 30-40. Springer, (1990)