PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Stern, Michal"

Author of the publication

copydeleteadd this publication to your clipboard
Representing edge intersection graphs of paths on degree 4 trees.

, , and . Discrete Mathematics, 308 (8): 1381-1387 (2008)

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.

Michal Vyvlecka University of Stuttgart

Dr. Michal Kern University of Stuttgart

Patrick Stern University of Stuttgart

Dr. Oliver Sternal University of Stuttgart

Paula Sternberg

 

Other publications of authors with the same name

String graphs of k-bend paths on a grid., , , , , and . Electron. Notes Discret. Math., (2011)Approximation Algorithms for Not Necessarily Disjoint Clustered TSP., , and . J. Graph Algorithms Appl., 22 (4): 555-575 (2018)Edge intersection graphs of single bend paths on a grid., , and . CTW, page 53-55. University of Twente, (2007)Single bend paths on a grid have strong helly number 4: errata atque emendationes ad "edge intersection graphs of single bend paths on a grid"., , and . Networks, 62 (2): 161-163 (2013)Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)., , and . WG, volume 5911 of Lecture Notes in Computer Science, page 329-340. (2009)Finding Intersection Models of Weakly Chordal Graphs., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 241-255. Springer, (2006)The complete optimal stars-clustering-tree problem., and . Discrete Applied Mathematics, 156 (4): 444-450 (2008)Intersection models of weakly chordal graphs., , and . Discrete Applied Mathematics, 157 (9): 2031-2047 (2009)The clustering matroid and the optimal clustering tree., and . Math. Program., 98 (1-3): 385-414 (2003)On the bi-enhancement of chordal-bipartite probe graphs., , , and . Inf. Process. Lett., 110 (5): 193-197 (2010)