( en | de | ru )

 

Disambiguation of "Bellitto, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
On the density of sets of the Euclidean plane avoiding distance 1.

, , and . CoRR, (2018)

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.

Thomas Thomas

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

The smallest 5-chromatic tournament., , , and . Math. Comput., 93 (345): 443-458 (August 2023)The directed 2-linkage problem with length constraints., , , and . Theor. Comput. Sci., (2020)The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs., , , , and . ISAAC, volume 181 of LIPIcs, page 59:1-59:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Supereulerian 2-Edge-Coloured Graphs., , and . Graphs Comb., 37 (6): 2601-2620 (2021)On Minimum Connecting Transition Sets in Graphs., and . WG, volume 11159 of Lecture Notes in Computer Science, page 40-51. Springer, (2018)Close Relatives (Of Feedback Vertex Set), Revisited., , , and . IPEC, volume 214 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the minimum number of arcs in k-dicritical oriented graphs., , , and . CoRR, (2022)On the density of sets of the Euclidean plane avoiding distance 1., , and . Discret. Math. Theor. Comput. Sci., (2021)On the density of sets of the Euclidean plane avoiding distance 1., , and . CoRR, (2018)On DP-coloring of digraphs., , , and . J. Graph Theory, 95 (1): 76-98 (2020)