( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes.

, и . Electron. Notes Discret. Math., (2009)

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.

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 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 Nickel

Einsatz von Rollenspielen und standardisierten Eltern zur Schulung kommunikativer Kompetenzen von Medizinstudenten in Anamnese- und Beratungsgesprächen mit Eltern kranker Kinder: eine quantitative und qualitative Analyse im Kontrollgruppendesign. Uni Heidelberg, (2009)
 

Другие публикации лиц с тем же именем

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