( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.

, и . SIAM J. Discret. Math., 30 (3): 1685-1725 (2016)

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.

Archontia Stavropoulou

Guido C C Clinckspoor

Thomas C C Knöbig

Ullrich C C Jagstaidt

Guido C C Clinckspoor

 

Другие публикации лиц с тем же именем

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs., , и . Theor. Comput. Sci., (2017)The canonical directed tree decomposition and its applications to the directed disjoint paths problem., , , и . CoRR, (2020)Lean Tree-Cut Decompositions: Obstructions and Algorithms., , , и . STACS, том 126 из LIPIcs, стр. 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Obstructions for Tree-depth., и . Electron. Notes Discret. Math., (2009)Neighborhood complexity and kernelization for nowhere dense classes of graphs., , , , , , и . CoRR, (2016)Excluding Single-Crossing Matching Minors in Bipartite Graphs., , и . SODA, стр. 2111-2121. SIAM, (2023)Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes., , , , и . SIAM J. Discret. Math., 35 (1): 105-151 (2021)Effective computation of immersion obstructions for unions of graph classes., , и . J. Comput. Syst. Sci., 80 (1): 207-216 (2014)New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs., и . STACS, том 30 из LIPIcs, стр. 354-366. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Directed Flat Wall Theorem., , , и . SODA, стр. 239-258. SIAM, (2020)