( en | de | ru )

 

Disambiguation of "Gaspers, Serge"

Author of the publication

copydeleteadd this publication to your clipboard
Myhill-Nerode Methods for Hypergraphs.

, , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 372-382. Springer, (2013)

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

Backdoors to Acyclic SAT., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 363-374. Springer, (2012)A note on the eternal dominating set problem., , , and . Int. J. Game Theory, 47 (2): 543-555 (2018)Turbocharging Treewidth Heuristics., , , , and . Algorithmica, 81 (2): 439-475 (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)Backdoors into Heterogeneous Classes of SAT and CSP., , , , and . CoRR, (2015)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)Kernels for Global Constraints., and . IJCAI, page 540-545. IJCAI/AAAI, (2011)Linearly χ-bounding (P6, C4)-free graphs., and . J. Graph Theory, 92 (3): 322-342 (2019)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)Faster Algorithms for Weak Backdoors., and . AAAI, page 3741-3748. AAAI Press, (2022)