( en | de | ru )

 

Disambiguation of "Gaspers, Serge"

Author of the publication

copydeleteadd this publication to your clipboard
Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs.

, and . CoRR, (2017)

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.

Claudia Gaspers

Katharina Gaspers

Lutz Gaspers

Elena Sergeyev

Hans Gaspers

 

Other publications of authors with the same name

Cluster Editing with Vertex Splitting., , , , and . ISCO, volume 10856 of Lecture Notes in Computer Science, page 1-13. Springer, (2018)Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Colouring Square-Free Graphs without Long Induced Paths., , and . STACS, volume 96 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set., and . Discret. Math. Theor. Comput. Sci., 14 (1): 29-42 (2012)Parallel cleaning of a network with brushes., , , and . Discret. Appl. Math., 158 (5): 467-478 (2010)From Matching with Diversity Constraints to Matching with Regional Quotas., , , and . CoRR, (2020)Blockchain-Enabled Private and Secure Task Allocation Framework., , , and . COMSNETS, page 666-670. IEEE, (2024)Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs., and . CoRR, (2017)Strong Backdoors to Nested Satisfiability., and . SAT, volume 7317 of Lecture Notes in Computer Science, page 72-85. Springer, (2012)A Moderately Exponential Time Algorithm for Full Degree Spanning Tree., , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 479-489. Springer, (2008)