( en | de | ru )

 

Disambiguation of "Defrain, Oscar"

Author of the publication

copydeleteadd this publication to your clipboard
Dualization in Lattices Given by Implicational Bases.

, and . ICFCA, volume 11511 of Lecture Notes in Computer Science, page 89-98. Springer, (2019)

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.

Wolfgang Defrain

Martina Defrain

Manfred Krieck-Defrain

Oscar Miller

Oscar Landtreter

 

Other publications of authors with the same name

Local Certification of Geometric Graph Classes., , , , and . MFCS, volume 306 of LIPIcs, page 48:1-48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hypergraph Dualization with sfFPT-delay Parameterized by the Degeneracy and Dimension., , and . IWOCA, volume 14764 of Lecture Notes in Computer Science, page 111-125. Springer, (2024)Enumerating Minimal Dominating Sets in Triangle-Free Graphs., , , and . STACS, volume 126 of LIPIcs, page 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs., and . ISAAC, volume 149 of LIPIcs, page 63:1-63:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Local certification of geometric graph classes., , , , and . CoRR, (2023)Dualization in Lattices Given by Implicational Bases., and . ICFCA, volume 11511 of Lecture Notes in Computer Science, page 89-98. Springer, (2019)Polynomial-delay generation of functional digraphs up to isomorphism., , and . Discret. Appl. Math., (2024)Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets., , , and . CoRR, (2020)On the dualization problem in graphs, hypergraphs, and lattices. (Sur le problème de dualisation dans les graphes, hypergraphes, et treillis).. University of Clermont Auvergne, Clermont-Ferrand, France, (2020)Avoidable Paths in Graphs., , , and . Electron. J. Comb., 27 (4): 4 (2020)