( en | de | ru )

 

Disambiguation of "Todinca, Ioan"

Author of the publication

copydeleteadd this publication to your clipboard
Exact Algorithm for the Maximum Induced Planar Subgraph Problem.

, , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 287-298. 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. You can also use the button next to the name to display some publications already assigned to the person.

Despina Ioannidou

Niki Ioannidis

Alexandra Ioannidou

Ekaterini Ioannou

Iosif Ioannidis

 

Other publications of authors with the same name

Connected Graph Searching in Outerplanar Graphs., , and . Electron. Notes Discret. Math., (2005)On the heapability of finite partial orders., , , , and . Discret. Math. Theor. Comput. Sci., (2020)Coloring Powers of Graphs of Bounded Clique-Width.. WG, volume 2880 of Lecture Notes in Computer Science, page 370-382. Springer, (2003)Exact Algorithm for the Maximum Induced Planar Subgraph Problem., , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 287-298. Springer, (2011)Large Induced Subgraphs via Triangulations and CMSO., , and . SIAM J. Comput., 44 (1): 54-87 (2015)The role of randomness in the broadcast congested clique model., , , and . Inf. Comput., (2021)Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique., and . PODC, page 245-247. ACM, (2016)Polynomial Kernels for Strictly Chordal Edge Modification Problems., , and . IPEC, volume 214 of LIPIcs, page 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 568-580. Springer, (2004)A Meta-Theorem for Distributed Certification., , , and . Algorithmica, 86 (2): 585-612 (February 2024)