( 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

Ulf Gaspers

 

Other publications of authors with the same name

A note on the eternal dominating set problem., , , and . Int. J. Game Theory, 47 (2): 543-555 (2018)Backdoors into Heterogeneous Classes of SAT and CSP., , , , and . CoRR, (2015)Linearly χ-bounding (P6, C4)-free graphs., and . J. Graph Theory, 92 (3): 322-342 (2019)Kernels for Global Constraints., and . IJCAI, page 540-545. IJCAI/AAAI, (2011)Backdoors to Acyclic SAT., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 363-374. Springer, (2012)Enumeration of Preferred Extensions in Almost Oriented Digraphs., and . MFCS, volume 138 of LIPIcs, page 74:1-74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements., , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Turbocharging Treewidth Heuristics., , , , and . Algorithmica, 81 (2): 439-475 (2019)Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems., and . CoRR, (2023)Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets., and . ACM Trans. Algorithms, 13 (4): 44:1-44:36 (2017)