( en | de | ru )

 

Disambiguation of "Milanic, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
On total domination in the Cartesian product of graphs.

, , , and . Discussiones Mathematicae Graph Theory, 38 (4): 963-976 (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.

Martin Brückner

Vergleichende Untersuchungen zur Inzidenz apoptotischer und proliferativer Veränderungen kultivierter, humaner Knochenzellen von Ober- und Unterkiefer auf maschinenbearbeitetem, reinem Titan über 25 Tage. Uni Leipzig, (2009)

Martin Klug

The late Quaternary environmental and climatic history of North-East Greenland, inferred from coastal lakes. Uni Köln, (2009)

Martin Breitenfeldt

Mass measurements on short-lived Cd and Ag nuclides at the online mass spectrometer ISOLTRAP. Uni Greifswald, (2009)

Martin Faes

Analyse der mehrskaligen Transportmechanismen beim laminaren Mischen mittels laseroptischer und numerischer Methoden. Uni Hannover, (2009)

Martin Hille

Providentia Dei, Reich und Kirche: Weltbild und Stimmungsprofil altgläubiger Chronisten 1517 - 1618. Uni Passau, habilitation, (2007)
 

Other publications of authors with the same name

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph., and . J. Discrete Algorithms, 6 (4): 595-604 (2008)Treewidth is NP-Complete on Cubic Graphs (and related results)., , , , , , , , and . CoRR, (2023)Almost Well-Covered Graphs Without Short Cycles., , , and . CoRR, (2017)A polynomial algorithm to find an independent set of maximum weight in a fork-free graph., and . SODA, page 26-30. ACM Press, (2006)Maximum independent sets in graphs of low degree., and . SODA, page 874-880. SIAM, (2007)The Maximum Independent Set Problem in Planar Graphs., , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 96-107. Springer, (2008)On total domination in the Cartesian product of graphs., , , and . Discussiones Mathematicae Graph Theory, 38 (4): 963-976 (2018)Avoidable Vertices and Edges in Graphs., , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 126-139. Springer, (2019)The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs., , , , , and . SWAT, volume 294 of LIPIcs, page 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Vector Connectivity in Graphs., , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 331-342. Springer, (2013)