( en | de | ru )

 

Disambiguation of "Papadopoulos, Charis"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Aspects of Strong Subgraph Closure.

, , , , and . Algorithmica, 82 (7): 2006-2038 (2020)

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.

Keke Charis

Charalampos Charis

Charis Hautzinger

Charis Drummer

Ultrasonographische Untersuchungen zum Verlauf vom Euterödem beim Rind und Kontrolle des Behandlungserfolges mit einem Diuretikum. TierH Hannover, (2009)

Charis Goer

 

Other publications of authors with the same name

Computing and Listing Avoidable Vertices and Paths., and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 104-120. Springer, (2022)Clustering with Partial Information., , , , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 144-155. Springer, (2008)Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs., and . ISAAC, volume 92 of LIPIcs, page 53:1-53:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Sparse Subgraphs for 2-Connectivity in Directed Graphs., , , , and . SEA, volume 9685 of Lecture Notes in Computer Science, page 150-166. Springer, (2016)Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width., , and . WG, volume 12301 of Lecture Notes in Computer Science, page 388-400. Springer, (2020)Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree., , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 346-358. Springer, (2017)Parameterized Aspects of Strong Subgraph Closure., , , , and . Algorithmica, 82 (7): 2006-2038 (2020)Enumerating Minimal Subset Feedback Vertex Sets., , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 399-410. Springer, (2011)Counting Spanning Trees in Graphs Using Modular Decomposition., , and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 202-213. Springer, (2011)Drawing Graphs Using Modular Decomposition., and . GD, volume 3843 of Lecture Notes in Computer Science, page 343-354. Springer, (2005)