( en | de | ru )

 

Disambiguation of "Vatshelle, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Boolean-width of graphs.

, , and . Theor. Comput. Sci., 412 (39): 5187-5204 (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.

Martin Klug

The late Quaternary environmental and climatic history of North-East Greenland, inferred from coastal lakes. Uni Köln, (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 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 Sanchez

Charakterisierung des Replikationsenzyms ORF904 aus Sulfolobus islandicus. Uni Bayreuth, (2010)
 

Other publications of authors with the same name

An algorithm for the maximum weight independent set problem on outerstring graphs., , , and . Comput. Geom., (2017)The point-set embeddability problem for plane graphs., and . SCG, page 41-50. ACM, (2012)Recognition of Linear and Star Variants of Leaf Powers is in P., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 70-83. Springer, (2022)Hardness of computing width parameters based on branch decompositions over the vertex set., and . Electron. Notes Discret. Math., (2015)Upper Bounds on Boolean-Width with Applications to Exact Algorithms., , and . IPEC, volume 8246 of Lecture Notes in Computer Science, page 308-320. Springer, (2013)An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs., , , and . CCCG, Queen's University, Ontario, Canada, (2015)Finding Good Decompositions for Dynamic Programming on Dense Graphs., , , and . IPEC, volume 7112 of Lecture Notes in Computer Science, page 219-231. Springer, (2011)Faster Algorithms on Branch and Clique Decompositions., , , and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 174-185. Springer, (2010)Graph Classes with Structured Neighborhoods and Algorithmic Applications., and . WG, volume 6986 of Lecture Notes in Computer Science, page 47-58. Springer, (2011)On Alternative Models for Leaf Powers., , , and . CoRR, (2021)