( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algorithmic Aspects of Dominator Colorings in Graphs.

, , , , и . IWOCA, том 7056 из Lecture Notes in Computer Science, стр. 19-30. Springer, (2011)

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.

Philip Eckardt

Experimentelle Isolierung und Charakterisierung eines lockwirksamen Stoffes der Süßwasserschnecke Biomphalaria glabrata für den Zwischenwirtsfindungsprozess von Schistosoma-mansoni-Mirazidien. TU München, (2009)

Philip Esters

Philip Liste

Philip Herrmann

Philip Bertram

 

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

Vertex Exponential Algorithms for Connected f-Factors., и . FSTTCS, том 29 из LIPIcs, стр. 61-71. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms., , , и . CoRR, (2021)Disjoint Stable Matchings in Linear Time., , и . CoRR, (2020)2-Approximating Feedback Vertex Set in Tournaments., , , , , и . SODA, стр. 1010-1018. SIAM, (2020)Minimum Fill-in of Sparse Graphs: Kernelization and Approximation., , и . FSTTCS, том 13 из LIPIcs, стр. 164-175. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Subset Feedback Vertex Set in Chordal and Split Graphs., , , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 365-376. Springer, (2019)On Parameterized Independent Feedback Vertex Set., , , и . COCOON, том 6842 из Lecture Notes in Computer Science, стр. 98-109. Springer, (2011)B-Chromatic Number: Beyond NP-Hardness., , и . IPEC, том 43 из LIPIcs, стр. 389-401. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Hitting Forbidden Minors: Approximation and Kernelization., , , , и . SIAM J. Discret. Math., 30 (1): 383-410 (2016)Finding Even Subgraphs Even Faster., , , , и . CoRR, (2014)